National Library of Energy BETA

Sample records for graph database system

  1. Querying RDF Data from a Graph Database Perspective

    E-Print Network [OSTI]

    Baeza-Yates, Ricardo

    }@dcc.uchile.cl Agenda ∑ Motivations, Problem and Proposal ∑ Database Models ∑ Graph Database Models ∑ RDF as data model of data model with inherent graph structure. ∑ Database models and query languages should support its that a query language for RDF should provide. Database Models Data structures Operators and Query Language

  2. `Modern' Databases Database Systems Lecture 18

    E-Print Network [OSTI]

    Alechina, Natasha

    `Modern' Databases Database Systems Lecture 18 Natasha Alechina #12;'Modern' Databases In This Lecture ∑ 'Modern' Databases ∑ Distributed DBs ∑ Web-based DBs ∑ Object Oriented DBs ∑ Semistructured Data chapter 4 #12;'Modern' Databases Other Sorts of DB ∑ We have looked mainly at relational databases

  3. `Modern' Databases Database Systems Lecture 18

    E-Print Network [OSTI]

    Alechina, Natasha

    1 `Modern' Databases Database Systems Lecture 18 Natasha Alechina 'Modern' Databases In This Lecture ∑ 'Modern' Databases ∑ Distributed DBs ∑ Web-based DBs ∑ Object Oriented DBs ∑ Semistructured Data chapter 4 'Modern' Databases Other Sorts of DB ∑ We have looked mainly at relational databases

  4. USER'S GUIDE DATABASE SYSTEM

    E-Print Network [OSTI]

    Budny, Robert

    USER'S GUIDE TO THE MINGL DATABASE SYSTEM FOR TFTR Version 4.1 R. M. Wieland Plasma Physics blank] #12;1 Abstract The MINGL database system is an integrated set of tools which is used to collect relational databases. A flexible software tool set makes it easy to browse, select, compare and display

  5. Introduction to Database Database Systems Lecture 1

    E-Print Network [OSTI]

    Alechina, Natasha

    .cs.nott.ac.uk/~nza/G51DBS #12;In this Lecture ∑ Course Information ∑ Databases and Database Systems ∑ Some History bookings ∑ Credit card details ∑ Student records ∑ Customer histories ∑ Stock market prices ∑ Discussion of information ∑ A database management system (DBMS) is the software than controls that information ∑ Examples

  6. Explicit Graphs in a Functional Model for Spatial Databases

    E-Print Network [OSTI]

    GŁting, Ralf Hartmut

    in the area affected by the fail≠ ure of a power plant?'' The second issue concerns queries on distinct planes, ... -- electricity, telephone, gas, water, sewage, ... Current spatial database systems support

  7. Efficient Query Processing on Graph Databases JAMES CHENG

    E-Print Network [OSTI]

    Ng, Wilfred Siu Hung

    . In this article, we propose an efficient index, FG*-index, to solve this problem. The cost of processing a subgraph query using most existing indexes mainly consists of two parts, the index probing cost and the candidate verification cost. Index probing is to find the query in the index, or to find the graphs from

  8. CSC 4480: Principles of Database Systems

    E-Print Network [OSTI]

    and technologies underlying database management systems. ∑ Understand data models, physical data organization, data databaseDatabase Management System (DBMS): generic program to manage databases 13 Basic Terms ∑ Data decisions based on large volume of facts 15 Figure 1-1b Summarized data Useful information that managers can

  9. A Static Analysis Technique for Graph Transformation Systems

    E-Print Network [OSTI]

    Baldan, Paolo

    A Static Analysis Technique for Graph Transformation Systems Paolo Baldan, Andrea Corradini,andrea,koenigb}@di.unipi.it Abstract. In this paper we introduce a static analysis technique for graph transformation systems. We in a direct and intuitive way. Graph Transformation Systems (GTSs) [18] add to the static description given

  10. A Visualization System for Correctness Proofs of Graph Algorithms

    E-Print Network [OSTI]

    Metaxas, Takis

    A Visualization System for Correctness Proofs of Graph Algorithms P.A. Gloor1, D.B. Johnson2, F. Makedon2, P. Metaxas3 Feb. 28, 1993 Running head: Proof Visualization of Graph Algorithms Correspondence proofs of graph algorithms. The system has been demonstrated for a greedy algorithm, Prim's algorithm

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

  12. Database System Concepts Silberschatz, Korth and Sudarshan

    E-Print Network [OSTI]

    Dragan, Feodor F.

    Database System Concepts ©Silberschatz, Korth and Sudarshan See www.db-book.com for conditions on re-use ©Silberschatz, Korth and SudarshanDatabase System Concepts Chapter 8: Application Design andChapter 8: Application Design and DevelopmentDevelopment #12;©Silberschatz, Korth and Sudarshan8.2Database

  13. Discrete Lagrangian Systems on Graphs. Symplecto-Topological Properties

    E-Print Network [OSTI]

    S. P. Novikov; A. S. Schwarz

    2000-04-11

    Discrete Lagrangian Systems on graphs are considered. Vector-valued closed differential 2-form on the space of solutions is constructed. This form takes values in the first homology group of the graph. This construction generalizes the Symplectic Wronskian for the linear self-adjoint operators on graphs found in 1997 by the first author and used for the needs of the Scattering Theory for graphs with tails

  14. A DATABASE INTEGRATION SYSTEM BASED ON GLOBAL VIEW GENERATION

    E-Print Network [OSTI]

    Lawrence, Ramon

    A DATABASE INTEGRATION SYSTEM BASED ON GLOBAL VIEW GENERATION Uchang Park Duksung Women: database, integration, view, heterogeneity. Abstract: Database integration is a common and growing challenge with the proliferation of database systems, data warehouses, data marts, and other OLAP systems

  15. GRAPH THEORETIC APPROACHES TO INJECTIVITY IN CHEMICAL REACTION SYSTEMS

    E-Print Network [OSTI]

    Craciun, Gheorghe

    GRAPH THEORETIC APPROACHES TO INJECTIVITY IN CHEMICAL REACTION SYSTEMS MURAD BANAJI AND GHEORGHE algebraic and graph theoretic conditions for injectivity of chemical reaction systems. After developing the possibility of multiple equilibria in the systems in question. Key words. Chemical reactions; Injectivity; SR

  16. DEMIDS: A Misuse Detection System for Database Systems

    E-Print Network [OSTI]

    Yoo, S. J. Ben

    information stored in database systems DBS, existing security models are insu cient to prevent misuseDEMIDS: A Misuse Detection System for Database Systems Christina Yip Chung, Michael Gertz, Karl the information stored in the database system against misuse, they are seldom used by security o cers because

  17. An Experimental Comparison of Pregel-like Graph Processing Systems

    E-Print Network [OSTI]

    Daudjee, Khuzaima

    Attribution- NonCommercial-NoDerivs 3.0 Unported License. To view a copy of this li- cense, visit http://creativecommons.org/licenses/by-nc Apache Hama [2], Apache Giraph [1], Catch the Wind (CatchW) [34], GPS [32], GraphLab [28] (which now incorporates PowerGraph [18]), and Mizan [23]. The relative performance characteristics of such systems

  18. 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 architecture selection and technology investment decisions will constrain the system to certain regions architectures, with a view to enabling robustness to technology portfolio realization and later architectural

  19. Bond graph models of electromechanical systems. The AC generator case

    E-Print Network [OSTI]

    Batlle, Carles

    Bond graph models of electromechanical systems. The AC generator case Carles Batlle Department. After reviewing electromechanical energy conversion and torque gener- ation, the core element present in any electromechanical system is introduced, and the corresponding electrical and mechanical ports

  20. Computer Science: An Overview Database Systems

    E-Print Network [OSTI]

    Lanubile, Filippo

    .1 Database Fundamentals ∑ 9.2 The Relational Model ∑ 9.3 Object-Oriented Databases ∑ 9.4 Maintaining Database of a database without changing the application software that uses it Database Models ∑ Database model: A conceptual view of a d t bdatabase ≠ Relational database model ≠ Object-oriented database model Copyright

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

  2. Database specification for the Worldwide Port System (WPS) Regional Integrated Cargo Database (ICDB)

    SciTech Connect (OSTI)

    Faby, E.Z.; Fluker, J.; Hancock, B.R.; Grubb, J.W.; Russell, D.L. [Univ. of Tennessee, Knoxville, TN (United States)] [Univ. of Tennessee, Knoxville, TN (United States); Loftis, J.P.; Shipe, P.C.; Truett, L.F. [Oak Ridge National Lab., TN (United States)] [Oak Ridge National Lab., TN (United States)

    1994-03-01

    This Database Specification for the Worldwide Port System (WPS) Regional Integrated Cargo Database (ICDB) describes the database organization and storage allocation, provides the detailed data model of the logical and physical designs, and provides information for the construction of parts of the database such as tables, data elements, and associated dictionaries and diagrams.

  3. An Approach to Evolving Database Dependent Systems (Extended Abstract)

    E-Print Network [OSTI]

    Perry, Dewayne E.

    -58113-545 -9/02/05...$5.00 ficient and slow evolution of database schemas and software that uses the databasesAn Approach to Evolving Database Dependent Systems (Extended Abstract) Mark Grechanika to relational databases using such standards as Universal Data Access (UDA) and Open Database Connec~vity (ODBC

  4. 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 3: SQLChapter 3: SQL #12;©Silberschatz, Korth and Sudarshan3.2Database System of the Database Joined Relations** #12;©Silberschatz, Korth and Sudarshan3.3Database System Concepts, 5th Edition

  5. Case for Staged Database Systems Stavros Harizopoulos

    E-Print Network [OSTI]

    increasing demands performance, high­end DBMS employ parallel processing techniques coupled with plethora­ lithic approach DBMS software lead complex difficult to extend designs. paper introduces a staged design high­per­ formance, evolvable DBMS that tune maintain. propose break the database system into modules

  6. SQL and Java Database Systems Lecture 19

    E-Print Network [OSTI]

    Alechina, Natasha

    1 SQL and Java Database Systems Lecture 19 Natasha Alechina SQL and Java In this Lecture · SQL in Java · SQL from within other Languages · SQL, Java, and JDBC · For More Information · Sun Java tutorial: http://java.sun.com/docs/books/tutorial/jdbc · Connolly and Begg 29.7 SQL and Java SQL and Other

  7. SQL and Java Database Systems Lecture 19

    E-Print Network [OSTI]

    Alechina, Natasha

    SQL and Java Database Systems Lecture 19 Natasha Alechina #12;SQL and Java In this Lecture · SQL in Java · SQL from within other Languages · SQL, Java, and JDBC · For More Information · Sun Java tutorial: http://java.sun.com/docs/books/tutorial/jdbc · Connolly and Begg 29.7 #12;SQL and Java SQL and Other

  8. SQL Data Definition Database Systems Lecture 5

    E-Print Network [OSTI]

    Alechina, Natasha

    SQL Data Definition Database Systems Lecture 5 Natasha Alechina #12;SQL Data Definition In This Lecture · SQL · The SQL language · SQL, the relational model, and E/R diagrams · CREATE TABLE · Columns.6. #12;SQL Data Definition SQL · Originally `Sequel' - Structured English query Language, part of an IBM

  9. SQL Data Definition Database Systems Lecture 5

    E-Print Network [OSTI]

    Alechina, Natasha

    1 SQL Data Definition Database Systems Lecture 5 Natasha Alechina SQL Data Definition In This Lecture · SQL · The SQL language · SQL, the relational model, and E/R diagrams · CREATE TABLE · Columns.6. SQL Data Definition SQL · Originally `Sequel' - Structured English query Language, part of an IBM

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

  11. I. Course Particulars Number & Title ICS 434 ADVANCED DATABASE SYSTEMS

    E-Print Network [OSTI]

    Adam, Salah

    Description Advanced data models: object-oriented model, and object-relational model, conceptual database. Course Objectives 1. To learn advanced data modeling techniques. 2. To learn how modern database systems an automated database design tool to design complex database systems. 2. Apply object-relational data model

  12. Automating Database Schema Evolution in Information System Upgrades

    E-Print Network [OSTI]

    Zaniolo, Carlo

    Automating Database Schema Evolution in Information System Upgrades Carlo Curino Hyun J. Moon Carlo, and down-time currently created by the database schema evolution process is the source of incessant prob and historical queries for database archives under schema evolution. Keywords Schema Evolution, Database Design

  13. Modularization of the DADAISM Ada Database System Architecture

    E-Print Network [OSTI]

    Keller, Arthur M.

    implemen≠ tation paradigm is necessary to handle the evolution of database systems over the next fewPage 1 Modularization of the DADAISM Ada Database System Architecture Arthur M. Keller Gio Wiederhold Stanford University Draft of May 21, 1991 Abstract. We describe a new database management system

  14. Modularization of the DADAISM Ada Database System Architecture

    E-Print Network [OSTI]

    Keller, Arthur M.

    implemen- tation paradigm is necessary to handle the evolution of database systems over the next fewPage 1 Modularization of the DADAISM Ada Database System Architecture Arthur M. Keller Gio Wiederhold Stanford University Draft of May 21, 1991 Abstract. We describe a new database management system

  15. 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, Korth and Sudarshan12.2Database System Concepts - 5th Edition, Oct 4, 2006 Chapter 12: Indexing Multiple-Key Access #12;©Silberschatz, Korth and Sudarshan12.3Database System Concepts - 5th Edition, Oct 4

  16. 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, 2006 #12;©Silberschatz, Korth and Sudarshan11.2Database System Concepts - 5th Edition Chapter 11-Dictionary Storage #12;©Silberschatz, Korth and Sudarshan11.3Database System Concepts - 5th Edition Classification

  17. SQLGraph: An Efficient Relational-Based Property Graph , Achille Fokoue

    E-Print Network [OSTI]

    Cortes, Corinna

    [Database Management]: Systems General Terms Property graphs; Gremlin Keywords Property graphs; Relational Storage; Gremlin 1. INTRODUCTION There is increased interest in graph data management re- cently, fueled literature has been on RDF data management (e.g., [39, 18, 27, 24, 6, 25, 16]). Much of this work targets

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

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

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

  1. Online Energy Estimation of Relational Operations in Database Systems

    E-Print Network [OSTI]

    Tu, Yicheng

    1 Online Energy Estimation of Relational Operations in Database Systems Zichen Xu # , Yi-Cheng Tu known to consume a large amount of energy. As databases are one of the major applications in a data center, building energy-aware database systems has become an active research topic recently

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

    E-Print Network [OSTI]

    Fernandez, Thomas

    First Steps toward Automated Design of Mechatronic Systems Using Bond Graphs and Genetic for mechatronic systems. The domain of mechatronic systems includes mixtures of, for example, electrical

  3. Temporal Conditions and Integrity Constraints in Active Database Systems \\Lambda

    E-Print Network [OSTI]

    Wolfson, Ouri E.

    to specify conditions that involve both, events and database states, and their evolution over time. BasicallyTemporal Conditions and Integrity Constraints in Active Database Systems \\Lambda A. Prasad Sistla, for specifying conditions and events in the rules for active database sys≠ tem. This language permits

  4. Conference and Journal Publications in Database Systems and Theory

    E-Print Network [OSTI]

    Zhou, Yuanyuan

    Conference and Journal Publications in Database Systems and Theory This document rates the conferences and journal publications in the database area with respect to quality and impact. As in many other with strong interactions but often distinct publication venues. We therefore discuss separately the database

  5. Intermediate statistics for a system with symplectic symmetry: the Dirac rose graph

    E-Print Network [OSTI]

    statistics formed of a gas of energy levels interacting with a logarithmic potential. Spectral statisticsIntermediate statistics for a system with symplectic symmetry: the Dirac rose graph J.M. Harrison1 Abstract We study the spectral statistics of the Dirac operator on a rose-shaped graph-- a graph

  6. Towards G2G: Systems of Technology Database Systems

    E-Print Network [OSTI]

    Maluf, David A.

    the creation of an integrated approach to sustain effective management of technology investments that supports the ability of various technology database systems to be independently managed. The integration technology an integrated management of technology approach that serves the global needs of NASA. The G2G capabilities

  7. REGULAR ENTRY IN ENCYCLOPEDIA OF DATABASE SYSTEMS

    E-Print Network [OSTI]

    Risch, Tore

    network. In a central DBMS the data is managed by one node whereas in a distributed DBMS the data is managed by several nodes. A distributed DBMS is a database manager consisting of several nodes distributed in the network. In a regular distributed DBMS it is up to the database administrator to manually specify how data

  8. DISTRIBUTED DATABASE SYSTEMS M. Tamer zsu

    E-Print Network [OSTI]

    ÷zsu, M. Tamer

    a database that is distributed across the nodes of a computer network and makes this distribution transparent of consistent and atomic execution against the database. Transparency: Extension of data independence at every site where it executes. The name comes from the fact that two rounds of messages are exchanged

  9. Status of ACM Transactions on Database Systems Richard T. Snodgrass

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    Status of ACM Transactions on Database Systems Richard T. Snodgrass June 7, 2004 This document outlines my view of the current state of ACM Transactions on Database Systems (TODS), summarizes my been resolved, following the initiatives I proposed to the ACM Publications Board three years ago

  10. Towards Eco-friendly Database Management Systems

    E-Print Network [OSTI]

    Lang, Willis

    2009-01-01

    Database management systems (DBMSs) have largely ignored the task of managing the energy consumed during query processing. Both economical and environmental factors now require that DBMSs pay close attention to energy consumption. In this paper we approach this issue by considering energy consumption as a first-class performance goal for query processing in a DBMS. We present two concrete techniques that can be used by a DBMS to directly manage the energy consumption. Both techniques trade energy consumption for performance. The first technique, called PVC, leverages the ability of modern processors to execute at lower processor voltage and frequency. The second technique, called QED, uses query aggregation to leverage common components of queries in a workload. Using experiments run on a commercial DBMS and MySQL, we show that PVC can reduce the processor energy consumption by 49% of the original consumption while increasing the response time by only 3%. On MySQL, PVC can reduce energy consumption by 20% wit...

  11. DOE technology information management system database study report

    SciTech Connect (OSTI)

    Widing, M.A.; Blodgett, D.W.; Braun, M.D.; Jusko, M.J.; Keisler, J.M.; Love, R.J.; Robinson, G.L.

    1994-11-01

    To support the missions of the US Department of Energy (DOE) Special Technologies Program, Argonne National Laboratory is defining the requirements for an automated software system that will search electronic databases on technology. This report examines the work done and results to date. Argonne studied existing commercial and government sources of technology databases in five general areas: on-line services, patent database sources, government sources, aerospace technology sources, and general technology sources. First, it conducted a preliminary investigation of these sources to obtain information on the content, cost, frequency of updates, and other aspects of their databases. The Laboratory then performed detailed examinations of at least one source in each area. On this basis, Argonne recommended which databases should be incorporated in DOE`s Technology Information Management System.

  12. System-Level Synthesis of MEMS via Genetic Programming and Bond Graphs

    E-Print Network [OSTI]

    Hu, Jianjun

    System-Level Synthesis of MEMS via Genetic Programming and Bond Graphs Zhun Fan+ , Kisung Seo for automatic synthesis of MEMS system-level lumped parameter models using genetic programming and bond graphs. This paper first dis- cusses the necessity of narrowing the problem of MEMS synthesis into a certain specific

  13. 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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room NewsInformation Current HAB Packet HanfordDOEDaniel Shechtman andDarkIDDatabases Databases

  14. Automatic Parallelization of Classification Systems based on Support Vector Machines: Comparison and Application to JET Database

    E-Print Network [OSTI]

    Automatic Parallelization of Classification Systems based on Support Vector Machines: Comparison and Application to JET Database

  15. Database Systems | Breaking Out of the Box Avi Silberschatz

    E-Print Network [OSTI]

    Silberschatz, Avi

    that keeps corporations running without support from commercial database management systems (DBMS). Today is aimed at increasing the functionality and performance of DBMS's. A DBMS is a very complex system for solving problems of large-scale data management in the corporate setting. However, a DBMS, as does any

  16. The ATLAS Data Quality Defect Database System

    E-Print Network [OSTI]

    T. Golling; H. S. Hayward; P. U. E. Onyisi; H. J. Stelzer; P. Waller

    2012-05-14

    The ATLAS experiment at the Large Hadron Collider has implemented a new system for recording information on detector status and data quality, and for transmitting this information to users performing physics analysis. This system revolves around the concept of "defects," which are well-defined, fine-grained, unambiguous occurrences affecting the quality of recorded data. The motivation, implementation, and operation of this system is described.

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

    E-Print Network [OSTI]

    Vasaitis, Vasileios

    2012-06-25

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

  18. A Case for Staged Database Systems Stavros Harizopoulos

    E-Print Network [OSTI]

    of data. In order to cope with increasing demands for performance, high-end DBMS employ parallel workloads with changing requirements. Moreover, the mono- lithic approach in DBMS software has lead, evolvable DBMS that are easy to tune and maintain. We propose to break the database system into modules

  19. More SQL Data Definition Database Systems Lecture 6

    E-Print Network [OSTI]

    Alechina, Natasha

    More SQL Data Definition Database Systems Lecture 6 Natasha Alechina #12;More SQL Data Definition In this Lecture · More SQL · DROP TABLE · ALTER TABLE · INSERT, UPDATE, and DELETE · Data dictionary · Sequences · For more information · Connolly and Begg chapters 5 and 6 #12;More SQL Data Definition Creating Tables

  20. More SQL Data Definition Database Systems Lecture 6

    E-Print Network [OSTI]

    Alechina, Natasha

    1 More SQL Data Definition Database Systems Lecture 6 Natasha Alechina More SQL Data Definition In this Lecture · More SQL · DROP TABLE · ALTER TABLE · INSERT, UPDATE, and DELETE · Data dictionary · Sequences · For more information · Connolly and Begg chapters 5 and 6 More SQL Data Definition Creating Tables · From

  1. Data Mining: Where is it Heading? Database Systems Research Laboratory

    E-Print Network [OSTI]

    Han, Jiawei

    Data Mining: Where is it Heading? (Panel) Jiawei Han Database Systems Research Laboratory School of Computing Science Simon Fraser University, B.C., Canada V5A 1S6 E-mail: han@cs.sfu.ca Abstract Data mining on the issues in the field. Data mining has attracted popular interest recently, due to the high demand

  2. Natural Language Database Interface for the Community Based Monitoring System*

    E-Print Network [OSTI]

    database interface, SQL, CBMS, natural language query 1. Introduction CBMS is a poverty monitoring system that is now used in Pasay City. It tracks poverty by surveying the people living in a certain area. Once statistically monitor poverty. Since STATA needs technical skills to be used effectively, the data is very hard

  3. Towards optimal database maintenance in wireless communication systems Amine Chohra

    E-Print Network [OSTI]

    Firenze, Universitŗ degli Studi di

    are then necessary; typically, audit operations are used, to perform periodic maintenance actions. Audits checkTowards optimal database maintenance in wireless communication systems Amine Chohra 1* , Stefano scheduled maintenance policies are necessary. However, the short-persistence of most of the data stored

  4. Flexible Analysis of Plant Genomes in a Database Management System

    E-Print Network [OSTI]

    Teubner, Jens

    Flexible Analysis of Plant Genomes in a Database Management System Sebastian Dorok Bayer Pharma AG.de Gunter Saake University of Magdeburg Germany gunter.saake@ovgu.de ABSTRACT Analysis of genomes has a wide, a typical use case is comparing two plant genomes and try to deduce which genes are responsible

  5. Automated Design Methodology for Mechatronic Systems Using Bond Graphs and Genetic Programming

    E-Print Network [OSTI]

    Fernandez, Thomas

    Automated Design Methodology for Mechatronic Systems Using Bond Graphs and Genetic Programming for synthesizing designs for multi-domain systems, such as mechatronic systems. The domain of mechatronic systems range. 1. INTRODUCTION Mechatronic system design is a type of multi-domain problem that differs from

  6. DATATRIEVE used in a control-system database

    SciTech Connect (OSTI)

    Greene, N.E.

    1983-01-01

    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.

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

    E-Print Network [OSTI]

    Cafarella, Michael J.

    . 94105-2403 dewitt @ cs.wisc.edu Gray @ SFbay.enet.dec.com January 1992 Abstract: Parallel database

  8. Software systems as complex networks: Structure, function, and evolvability of software collaboration graphs

    E-Print Network [OSTI]

    Myers, Chris

    Software systems as complex networks: Structure, function, and evolvability of software York 14853, USA Received 27 May 2003; published 20 October 2003 Software systems emerge from mere software collaboration graphs contained within several open-source soft- ware systems, and have found them

  9. A Study of Concurrency Control in Real-Time, Active Database Systems

    E-Print Network [OSTI]

    Son, Sang H.

    A Study of Concurrency Control in Real-Time, Active Database Systems Anindya Datta, Member, IEEE control, automated financial trading, process control and military command, and control systems. In spite√źReal-time database systems, active database systems, concurrency control, performance evaluation. √¶ 1 INTRODUCTION

  10. Application-Tailored Database Systems: a Case of Aspects in an Embedded Aleksandra Tesanovic Ke Sheng Jorgen Hansson

    E-Print Network [OSTI]

    Application-Tailored Database Systems: a Case of Aspects in an Embedded Database Aleksandra languages to the database domain. Our focus is on embedded database systems, as a represen- tative for a class of database systems. We show, by an- alyzing and re-engineering one commercial well-known embedded

  11. KDDML: a middleware language and system for knowledge discovery in databases

    E-Print Network [OSTI]

    Ruggieri, Salvatore

    KDDML: a middleware language and system for knowledge discovery in databases Andrea Romei Salvatore can be easily plugged in the system. Key words: Knowledge Discovery in Databases, Data Mining, Query Languages 1 Introduction Knowledge discovery in databases (KDD) [10] covers a wide range of applica- tive

  12. Pair-wise Cryptographic Models for Secure Data Exchange in P2P Database Management Systems

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Pair-wise Cryptographic Models for Secure Data Exchange in P2P Database Management Systems Sk. Md, University of Tsukuba, Tsukuba, 305-8573 Japan okamoto@risk.tsukuba.ac.jp ABSTRACT A peer-to-peer database augments a conventional database man- agement system with an inter-operability layer (i.e. map- pings

  13. Vacuum Energy in Quantum Graphs

    E-Print Network [OSTI]

    Wilson, Justin

    2007-07-14

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

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

    SciTech Connect (OSTI)

    Wolery, T W; Sutton, M

    2011-09-19

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

  15. Chromatic scheduling of dynamic data-graph computations

    E-Print Network [OSTI]

    Kaler, Tim (Tim F. S.)

    2013-01-01

    Data-graph computations are a parallel-programming model popularized by programming systems such as Pregel, GraphLab, PowerGraph, and GraphChi. A fundamental issue in parallelizing data-graph computations is the avoidance ...

  16. Efficient Temporal Coalescing Query Support in Relational Database Systems

    E-Print Network [OSTI]

    Zaniolo, Carlo

    demand for temporal databases have only in- creased with time; unfortunately, DBMS vendors and standard by the lessons learned from the very history of temporal databases, where past proposals failed to gain much temporal query models with current DBMS engines [5]. Even if temporal database and query model can be well

  17. Embedded Databases for Embedded Real-Time Systems: A Component-Based Approach1

    E-Print Network [OSTI]

    Embedded Databases for Embedded Real-Time Systems: A Component-Based Approach1 Aleksandra Tesanovi of embedded real-time systems has increased dramatically. At the same time, the amount of data that needs in embedded real-time systems. However, a database that can be used in an embedded real-time system must

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

    SciTech Connect (OSTI)

    Timothy R. Carr

    2006-01-09

    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.

  19. Using XML to Build Efficient Transaction-Time Temporal Database Systems on Relational Databases

    E-Print Network [OSTI]

    Zaniolo, Carlo

    (virtual) representations of the database history, (b) XQuery to express powerful temporal queries with time [1, 2]; unfortunately, DBMS vendors and standard groups have not moved aggressively to extend, we propose a very useful generalization of this idea, by showing that the evolution history of a rela

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

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

    E-Print Network [OSTI]

    Davison, Peter Leslie

    2014-01-01

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

  2. Software design for a database driven system for accelerator magnet measurements

    SciTech Connect (OSTI)

    Brown, B.C.; Bleadon, M.E.; Glass, H.D.; Glosson, R.; Hanft, R.W.; Harding, D.J.; Mazur, P.O.; Pachnik, J.E.; Sim, J.W.; Trombly-Freytag, K.; Walbridge, D.G.

    1991-05-01

    Measurements of more than 1000 new magnets are needed for the Main Injector Project at Fermilab. In order to achieve efficiency and accuracy in measurements, we chose a database driven design for control of the measurement system. We will use a relational database to describe the measurement subjects and equipment. A logbook system defined in the database will provide for prescription of measurements to be carried out, description of measurements as they are carried out, and a comment database for less structured information. The operator interface will be built on X-windows. This paper will describe our system design. 2 refs.

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

    E-Print Network [OSTI]

    Davison, Peter

    Many systems undergo significant architecture-level change throughout their lifecycles in order to adapt to new operating and funding contexts, to react to failed technology development, or to incorporate new technologies. ...

  4. Phys 597A: Graphs and Networks in Systems Biology

    E-Print Network [OSTI]

    Albert, Rťka

    systems have an underlying network topology ∑ nodes: routers, hosts ∑ edges: wires, cables, wireless Q Q: What is the nature of edges? Internet, router level Internet, domain level #12;Map

  5. A Model of Image Representation and Indexing in Image Database Systems \\Lambda

    E-Print Network [OSTI]

    Krovi, Venkat

    A Model of Image Representation and Indexing in Image Database Systems \\Lambda G. Sheikholeslami Buffalo, NY 14260 Abstract Image database systems need to be built to support effective and efficient≠oriented image decomposition structures to be used as a fundamental data model for representing image content

  6. Extending the SAND Spatial Database System for the Visualization of Three-

    E-Print Network [OSTI]

    Samet, Hanan

    Extending the SAND Spatial Database System for the Visualization of Three- Dimensional Scientific of the SAND (Spatial and Nonspatial Data) spatial database system is described as is its use for data found supported by SAND involve locating spatial objects in the order of their distance from other spatial objects

  7. COMPARATIVE ANALYSIS OF GENE PREDICTION METHODS AND DEVELOPMENT OF A FUNGAL GENOME DATABASE SYSTEM

    E-Print Network [OSTI]

    Moriyama, Etsuko

    COMPARATIVE ANALYSIS OF GENE PREDICTION METHODS AND DEVELOPMENT OF A FUNGAL GENOME DATABASE SYSTEM;COMPARATIVE ANALYSIS OF GENE PREDICTION METHODS AND DEVELOPMENT OF A FUNGAL GENOME DATABASE SYSTEM Skanth genome projects have been planned and some new draft genomes have been recently completed. Multiple gene

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

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

  9. Database System Architecture Supporting Coexisting Query Languages and Data Models†

    E-Print Network [OSTI]

    Hepp, Pedro E.

    1983-01-01

    Database technology is already recognised and increasingly used in administering and organising large bodies of data and as an aid in developing software. This thesis considers the applicability of this technology in ...

  10. Nexus: A Novel Weighted-Graph-Based Prefetching Algorithm for Metadata Servers in Petabyte-Scale Storage Systems

    E-Print Network [OSTI]

    Zhu, Yifeng

    -Scale Storage Systems Peng Gu, Yifeng Zhu, Hong Jiang, Jun Wang Computer Science and Engineering University in large distributed storage systems. In this paper, we present a novel weighted-graph-based prefetching/O bottleneck in modern storage systems [1]≠[4]. Unlike conventional storage systems, these new storage

  11. METU Interoperable Database System A. Dogac, C. Dengi, E. Kilic, G. Ozhan, F. Ozcan, S. Nural, C. Evrendilek,

    E-Print Network [OSTI]

    Arpinar, I. Budak

    of database management systems based on di erent data models and languages (e.g. le systems, relationalMETU Interoperable Database System A. Dogac, C. Dengi, E. Kilic, G. Ozhan, F. Ozcan, S. Nural, C Turkiye email: asuman@srdc.metu.edu.tr Abstract METU INteroperable Database System (MIND) is a mul

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

    DOE Patents [OSTI]

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

    2010-05-11

    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.

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

    DOE Patents [OSTI]

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

    2006-08-08

    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.

  14. A Survey of Schema Evolution in Object-Oriented Databases School of Information Systems, Technology and Management

    E-Print Network [OSTI]

    Madiraju, Praveen

    A Survey of Schema Evolution in Object-Oriented Databases Xue Li School of Information Systems in the schema evolution of object- oriented databases. The main issues in the current research are identified. 1. Changes in the real world can be reflected as the evolution of object- oriented databases. Database

  15. QProber: A System for Automatic Classification of Hidden-Web Databases

    E-Print Network [OSTI]

    Sahami, Mehran

    Analysis and Indexing]: Abstracting Methods; H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval]: Digital Libraries; H.2.4 [Database Management]: Systems--textual databases, distributed This material is based upon work supported by the National Science Foundation under Grants No. IIS-97

  16. An Effective Class Hierarchy Concurrency Control Technique in Object-Oriented Database Systems

    E-Print Network [OSTI]

    Gruenwald, Le

    1 An Effective Class Hierarchy Concurrency Control Technique in Object-Oriented Database Systems-oriented databases (OODBs). Our scheme deals with class hierarchy which is an important property in OODBs. The existing concurrency controls for a class hierarchy perform well only for specific environments. Our scheme

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

  18. Database Systems on Virtual Machines: How Much do You Lose? Umar Farooq Minhas

    E-Print Network [OSTI]

    Aboulnaga, Ashraf

    manageability problems in database systems. For example, these technologies allow for server consolidation run on virtual machines. This offers many op- portunities for researchers in self-managing database sys- tems, but it is also important to understand the cost of virtu- alization. In this paper, we

  19. A Query Simulation System To Illustrate Database Query Execution

    E-Print Network [OSTI]

    Wagner, Paul J.

    the steps a DBMS performs during query execution. Database students need to be familiar with the underlying query execution process in order to understand how the DBMS implements commits and rollbacks. The query execution process also impacts query optimization techniques, and provides the foundation for how the DBMS

  20. A Database System for Moving Objects* August 17, 2011

    E-Print Network [OSTI]

    GŁting, Ralf Hartmut

    -dependent geometries. More precisely, complete histories of move- ment can be represented in a database and queried. For example: This approach to modeling and querying histories of moving objects is described in papers [1 DBMS without reading all the manuals and papers first. Go through the following steps: 1. If you do

  1. Discovering Quasi-Equivalence Relationships from Database Systems

    E-Print Network [OSTI]

    Chen, Shu-Ching

    . Kashyap School of Electrical and School of Computer Science School of Electrical and Computer Engineering me- dia objects residing in di erent databases for the re- lated data records. As the number to collect and store data of all kinds. However, our ability to interpret and analyze the data is still

  2. Graph500 [1] Graph500

    E-Print Network [OSTI]

    ab cBFSd ab 64 64 cBFSd bKernel 1c 14 Web VLSI Graph500 [1] Graph500 Top 500 Graph (Compressed Sparse Row)CSC (Compressed SparseColumn)cBFS BFSBFSdBFS BFS 1 5 2-2 BFS Graph500 OpenMP MPICrayExpand CQ C CQ CQPREDNQ CQ FoldPRED FoldCQCQ Fold CQ Fold Expand (R-1)fold(C-1) 2 3 Graph500 3 Graph

  3. Graph Generator Survey

    SciTech Connect (OSTI)

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

    2013-12-01

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

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

    E-Print Network [OSTI]

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

    2006-01-01

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

  5. Multiversion Locking Protocol with Freezing for Secure Real-Time Database Systems

    E-Print Network [OSTI]

    Stankovic, John A.

    Multiversion Locking Protocol with Freezing for Secure Real-Time Database Systems Chanjung Park constraints and security requirements, a new method, called the freezing method, is proposed. In order to show

  6. Optimizing Parallel Access to the BaBar Database System Using...

    Office of Scientific and Technical Information (OSTI)

    Technical Report: Optimizing Parallel Access to the BaBar Database System Using CORBA Servers Citation Details In-Document Search Title: Optimizing Parallel Access to the BaBar...

  7. COMET: A Component-Based Real-Time Database for Automotive Systems Dag Nystrom

    E-Print Network [OSTI]

    COMET: A Component-Based Real-Time Database for Automotive Systems Dag Nystr®om , Aleksandra With the increase of complexity in automotive control systems, the amount of data that needs to be managed is also-constrained automotive control systems, denoted the COMET development suit. Using software engineer- ing tools to assist

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

    E-Print Network [OSTI]

    Stanchev, Peter

    and software have resulted in a shift from paper-based medical record to electronic medical record systems tomography (PET), ultrasound, electrical source (ESI), electrical impedance tomography (EIT). Medical systems, interpretation, management and communication of multimodality images, expandable and open system architecture

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

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

    E-Print Network [OSTI]

    Slavek M. Rucinski

    1999-08-30

    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.

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

    E-Print Network [OSTI]

    Tahat, Amani

    2011-01-01

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

  12. Global search tool for the Advanced Photon Source Integrated Relational Model of Installed Systems (IRMIS) database.

    SciTech Connect (OSTI)

    Quock, D. E. R.; Cianciarulo, M. B.; APS Engineering Support Division; Purdue Univ.

    2007-01-01

    The Integrated Relational Model of Installed Systems (IRMIS) is a relational database tool that has been implemented at the Advanced Photon Source to maintain an updated account of approximately 600 control system software applications, 400,000 process variables, and 30,000 control system hardware components. To effectively display this large amount of control system information to operators and engineers, IRMIS was initially built with nine Web-based viewers: Applications Organizing Index, IOC, PLC, Component Type, Installed Components, Network, Controls Spares, Process Variables, and Cables. However, since each viewer is designed to provide details from only one major category of the control system, the necessity for a one-stop global search tool for the entire database became apparent. The user requirements for extremely fast database search time and ease of navigation through search results led to the choice of Asynchronous JavaScript and XML (AJAX) technology in the implementation of the IRMIS global search tool. Unique features of the global search tool include a two-tier level of displayed search results, and a database data integrity validation and reporting mechanism.

  13. A KNOWLEDGE BASED SYSTEM FOR PROVIDING INTELLIGENT ACCESS TO A PETROLEUM USER DATABASE

    E-Print Network [OSTI]

    Rosenberg, Steven

    2011-01-01

    INTELLIGENT ACCESS TO A PETROLEUM USER DATABASE StevenINTELLIGENT ACCESS TO A PETROLEUM USER DATABASE StevenINTELLIGENT ACCESS TO A PETROLEUM USER DATABASE Steven

  14. Exploring Power-Performance Tradeoffs in Database Systems

    E-Print Network [OSTI]

    Tu, Yicheng

    the above costs are calculated directly from energy consumption, power (i.e., energy consumption per unit cost, equivalent to one-third of the total maintenance cost [11]. This makes energy the second largest to lower system temperature and thus cooling costs [28]. This can contribute to significant energy savings

  15. Database Supported Bacnet Data Acquisition System for Building Energy Diagnostics†

    E-Print Network [OSTI]

    Li, Z.; Augenbroe, G.

    2011-01-01

    , or even develop a dedicated FDD method in a specific case. This is the motivation for development of the BACnet data storage system discussed in this paper, which could then be used together with BACnet data acquisition module in an open source Building...

  16. Secondo: An Extensible Database System for Research and Teaching

    E-Print Network [OSTI]

    G√ľting, Ralf Hartmut

    - Kernel - Second-Order Signature Specifying a Descriptive Algebra operators data in DATA. data data bool parts implemented in algebra modules ­ current "contents": basically a relational system with several major components: ­ Secondo Kernel: · implements specific data models · extensible by algebra modules

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

  18. A Data-Centric Approach to Insider Attack Detection in Database Systems

    E-Print Network [OSTI]

    Petropoulos, Michalis

    A Data-Centric Approach to Insider Attack Detection in Database Systems Sunu Mathew1, , Michalis the query expressions in prior approaches. Our data-centric approach is based on the key observation.): RAID 2010, LNCS 6307, pp. 382≠401, 2010. c Springer-Verlag Berlin Heidelberg 2010 #12;A Data-Centric

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

    E-Print Network [OSTI]

    Arbesser-Rastburg, Thomas

    2009-11-26

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

  20. A Class Hierarchy Concurrency Control Technique in Object-Oriented Database Systems

    E-Print Network [OSTI]

    Gruenwald, Le

    1 A Class Hierarchy Concurrency Control Technique in Object-Oriented Database Systems Woochun Jun scheme deals with class hierarchy which is an important property in OODBs. The existing concurrency controls for a class hierarchy perform well only for specific environments. Our scheme is based on so

  1. Identity and Discernibility of Objects: Configuration Change Management in P.L.M and Database Systems

    E-Print Network [OSTI]

    Paris-Sud XI, Universitť de

    1 Identity and Discernibility of Objects: Configuration Change Management in P.L.M and Database changes specifically addressed by Product Lifecycle Management systems are examined in the context of fast is relatively and conditionally redefined. The strategies for managing configuration changes are optimized using

  2. New York's Online Invasive Species Database and Mapping System What is iMapInvasives?

    E-Print Network [OSTI]

    Berkowitz, Alan R.

    New York's Online Invasive Species Database and Mapping System What is iMapInvasives? i through batch uploads and quality- controlled online submissions. The New York Natural Heritage Program.NYimapinvasives.org Questions? Contact: imapinvasives@nynhp.org Supported by the New York State Environmental Protection Fund

  3. New York's Online Invasive Species Database and Mapping System What is iMapInvasives?

    E-Print Network [OSTI]

    Berkowitz, Alan R.

    New York's Online Invasive Species Database and Mapping System What is iMapInvasives? i through batch uploads and quality- controlled online submissions. The New York Natural Heritage Program, and map data www.NYimapinvasives.org Questions? Contact: imapinvasives@nynhp.org Supported by the New York

  4. Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems

    E-Print Network [OSTI]

    Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems Kjetil N rvag and Kjell access cost and optimal use of memory for index page bu er and OD cache, with di erent access patterns in the context of general secondary index access cost and index entry caching. Keywords: Index organization

  5. Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 The Relational Model

    E-Print Network [OSTI]

    Tsotras, Vassilis J.

    intuitively, and the DBMS is responsible for efficient evaluation. ° The key: precise semantics for relational Carnatic101 C 53831 Reggae203 B 53650 Topology112 A 53666 History105 B Given the following instance of Enrolled (is this possible if the DBMS ensures referential integrity?): we get: Database Management Systems

  6. Enhancing a Genome Database Using the XSB Tabled Logic Programming System

    E-Print Network [OSTI]

    Davulcu, Hasan

    goal of the Human Genome Project 1] is to construct detailed physical maps of the human genome Research at the Whitehead Institute in MIT is engaged in several large-scale genome mapping projectsEnhancing a Genome Database Using the XSB Tabled Logic Programming System Hasan Davulcu I

  7. Health Informatics Systemic changes enabled by electronic record keeping, networked databases, and

    E-Print Network [OSTI]

    Hill, Wendell T.

    Health Informatics Systemic changes enabled by electronic record keeping, networked databases, distribute, and consume health information. But the healthcare industry is still far behind other sectors heath initiatives. uestions and How do consumers find and process health information on the Internet

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

    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.

  9. Information Systems Analysis and Design CSC340 2003 John Mylopoulos Database Design --1

    E-Print Network [OSTI]

    Mylopoulos, John

    . Database Design Databases and DBMSDatabases and DBMS Data Models, Hierarchical, Network, RelationalData Models, Hierarchical, Network, Relational Database DesignDatabase Design Restructuring an ER schema, for building and accessing a database e.g., the relational model offers relations (tables) as data structure

  10. Cost of Ensuring Safety in Distributed Database Management Systems Maitrayi Sabaratnam, Maitrayi.Sabaratnam@idi.ntnu.no

    E-Print Network [OSTI]

    Database Manage- ment Systems (DBMS) require that the integrity of the data stored in the database. The evaluation is performed on a replicated DBMS, ClustRa [9]. The results show that the checksum overhead in a DBMS inflicted with a very high TPC-B-like workload caused a reduction in throughput up to 5

  11. Figure 1. Schematic of initial air pump design Design of Air Pump System Using Bond Graph

    E-Print Network [OSTI]

    Fernandez, Thomas

    , is presented in Figure 1. It is a vibratory pump in which an electromagnetic circuit drives a small permanent magnet attached to a pivoted lever that, in turn, drives a rubber bellows pump. The bellows pump has an embryo bond graph model. Parameters for the GP search process must be set to control both the generation

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

  13. Graph Theory

    SciTech Connect (OSTI)

    Sanfilippo, Antonio P.

    2005-12-27

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

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

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

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

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

  18. March 23, 2008 DB: Concepts & Architecture 1 Database System Concepts and

    E-Print Network [OSTI]

    Adam, Salah

    and Basic Concepts Database Schema + Database States + Data Models + Categories of Data Models + #12;March 7 --- Example of a Database State #12;March 23, 2008 DB: Concepts & Architecture 8 -- Data Models A data model is a collection of concepts that can be used to describe the structure of a database

  19. A Query Answering System for Data with Evolution Relationships

    E-Print Network [OSTI]

    Velegrakis, Yannis

    for exploiting the evolution relationships between the structures in the database. In particular, our system]: Miscellaneous General Terms Algorithms, Performance Keywords Data evolution, Probabilistic databases, GraphA Query Answering System for Data with Evolution Relationships Siarhei Bykau University of Trento

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

    SciTech Connect (OSTI)

    Kenneth Nelson; Timothy Carr

    2009-03-31

    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.

  1. A Two-stage Stochastic View Selection Problem in Database Management Systems

    E-Print Network [OSTI]

    Young, R. Michael

    as Sears, Kmart, Target, and WalMart in the USA) all maintain significant- size databases storing information about ongoing sales transactions. For instance, WalMart is known for maintaining database

  2. The Index as a First-Class Construct in Relational Database Systems

    E-Print Network [OSTI]

    Parker, D. Stott

    -Class Index Over the history of the relational database, the index has been a second-class construct: database of Object-Relational DBMS, Extensible DBMS, and Com- ponent DBMS has been the need for better treatment

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

    SciTech Connect (OSTI)

    Menicucci, David F.

    2009-05-01

    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.

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

    2013-07-01

    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)

  5. Can Clinicians Create High-Quality Databases? A Study on A Flexible Electronic Health Record (fEHR) System

    E-Print Network [OSTI]

    Song, Il-Yeol

    Can Clinicians Create High-Quality Databases? A Study on A Flexible Electronic Health Record (f propose a flexible Electronic Health Record (fEHR) system, which allows clinicians to build new templates implementation of HIT, the electronic health record(EHR)[9, 19], and propose a flexible EHR (fEHR) system. The f

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

    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)

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

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

    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.

  9. Interoperability of Materials Database Systems in Support of Nuclear Energy Development and Potential Applications for Fuel Cell Material Selection

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

    Lin, Lianshan; Austin, Timothy; Ren, Weiju

    2015-01-01

    Materials database interoperability has been of great interest in recent years for information exchange in support of research and development (R&D). In response to data and knowledge sharing needs of the GenIV International Forum (GIF) for global collaboration in nuclear energy R&D, the European Commission JRC Institute for Energy and Transport (JRC-IET) and the Oak Ridge National Laboratory (ORNL) have established a materials database interoperability project that develops techniques for automated materials data exchange between systems hosted at the two institutes MatDB Online at JRC IET and the Gen IV Materials Handbook at ORNL, respectively. The work to enable automatedmore†Ľexchange of data between the two systems leverages the XML data import and export functionalities of both systems in combination with recently developed standards for engineering materials data. The preliminary results of data communication between the two systems have demonstrated the feasibility and efficiency of materials database interoperability, which constructs an interoperation framework that can be seamlessly integrated into the high-throughput First Principles material databases and thus advance the discovery of novel materials in fuel cell applications.ę†less

  10. A Flexible Class Hierarchy Locking Technique in Object-Oriented Database Systems Woochun Jun and Le Gruenwald

    E-Print Network [OSTI]

    Gruenwald, Le

    A Flexible Class Hierarchy Locking Technique in Object-Oriented Database Systems Woochun Jun and Le with class hierarchy which is an important property in OODBs. Our scheme is based on so called special classes and can be used for any applications, with less overhead, by adjusting the number of special

  11. Interoperability of Materials Database Systems in Support of Nuclear Energy Development and Potential Applications for Fuel Cell Material Selection

    SciTech Connect (OSTI)

    Lin, Lianshan; Austin, Timothy; Ren, Weiju

    2015-01-01

    Materials database interoperability has been of great interest in recent years for information exchange in support of research and development (R&D). In response to data and knowledge sharing needs of the GenIV International Forum (GIF) for global collaboration in nuclear energy R&D, the European Commission JRC Institute for Energy and Transport (JRC-IET) and the Oak Ridge National Laboratory (ORNL) have established a materials database interoperability project that develops techniques for automated materials data exchange between systems hosted at the two institutes MatDB Online at JRC IET and the Gen IV Materials Handbook at ORNL, respectively. The work to enable automated exchange of data between the two systems leverages the XML data import and export functionalities of both systems in combination with recently developed standards for engineering materials data. The preliminary results of data communication between the two systems have demonstrated the feasibility and efficiency of materials database interoperability, which constructs an interoperation framework that can be seamlessly integrated into the high-throughput First Principles material databases and thus advance the discovery of novel materials in fuel cell applications.

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

    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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservationBio-Inspired SolarAbout /Two0 -Using supercritical carbon dioxide as aGraphs

  14. Addison Wesley Longman, Inc. 2000, Elmasri/Navathe, Fundamentals of Database Systems, Third Edition SectionIdentifier CourseNumber Semester Year Instructor

    E-Print Network [OSTI]

    Chen, Yangjun

    © Addison Wesley Longman, Inc. 2000, Elmasri/Navathe, Fundamentals of Database Systems, Third Edition SectionIdentifier CourseNumber Semester Year Instructor SECTION CourseName CourseNumber Credit;© Addison Wesley Longman, Inc. 2000, Elmasri/Navathe, Fundamentals of Database Systems, Third Edition

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

    E-Print Network [OSTI]

    Gravdahl, Jan Tommy

    . A model of a compression system with recycle flow is derived in this work. 1. INTRODUCTION Compressors are widely applied in industries, for exam- ples in pipeline natural gas transportation system, extraction in oil fields, and process chemical and petrochemical plants [1]. A model of a compression system

  16. The Index as a FirstClass Construct in Relational Database Systems \\Lambda

    E-Print Network [OSTI]

    Parker, D. Stott

    importance. 1 Introduction: the Second≠Class Index Over the history of the relational database, the index has behind the development of Object≠Relational DBMS, Extensible DBMS, and Com≠ ponent DBMS has been the need

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

  18. Graph-theoretical consideration in the design of complex engineering systems for robustness and scalability

    E-Print Network [OSTI]

    Bounova, Gergana Assenova, 1980-

    2005-01-01

    (cont.) and (2) a forward approach which achieves optimality at the start and grows the system using an optimization technique. We systematically compare the two staging techniques in the context of telescope arrays and ...

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

    E-Print Network [OSTI]

    Paris-Sud XI, Universitť de

    products, as well as financial assets), we find that crude oil stands at the heart of the system in commodity markets might therefore be explained by external events like the fall in stock prices

  20. Spectral statistics of nearly unidirectional quantum graphs

    E-Print Network [OSTI]

    Maram Akila; Boris Gutkin

    2015-08-19

    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.

  1. Bond-Graphs + Genetic Programming: Analysis of an Automatically Synthesized Rotary Mechanical System

    E-Print Network [OSTI]

    Fernandez, Thomas

    : Analysis of an Automatically Synthesized Rotary Mechanical System S. A. Kayani1 , M. A. Malik2 Department of Mechanical Engineering, College of Electrical and Mechanical Engineering, National University of Sciences; J.2 [Physical Sciences and Engineering]: Engineering. General Terms: Design, Experimentation

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

  3. March 23, 2008 Databases: Intro. to DBs 1 Introduction to Databases

    E-Print Network [OSTI]

    Adam, Salah

    + Characteristics of database approach + Database Management System (DBMS) + Advantages of Using DBMS + Workers Involved in DBMSs + When Not to Use A DBMS + #12;March 23, 2008 Databases: Intro. to DBs 3 - Data Data Application programsUser 2 #12;March 23, 2008 Databases: Intro. to DBs 6 -- Database Approach Database DBMS

  4. Self-Tuning Database Systems: A Decade of Progress Surajit Chaudhuri

    E-Print Network [OSTI]

    Lu, Jiaheng

    progress. We conclude with our thoughts on opportunities and open issues. 1. HISTORY OF AUTOADMIN PROJECT TO PHYSICAL DATABASE DESIGN 2.1 Importance of Physical Design A crucial property of a relational DBMS a query is executed on a DBMS. The first generation of relational execution engines were relatively simple

  5. Investigating Database Security in a Networked Environment

    E-Print Network [OSTI]

    Wagner, Paul J.

    Investigating Database Security in a Networked Environment Matthew Giuliani Computer Science wagnerpj@uwec.edu Abstract Database and network security have traditionally been separate fields within flowing between client and database systems. Although vender specific information is available for many

  6. Database Security: A Historical Perspective

    E-Print Network [OSTI]

    Lesov, Paul

    2010-01-01

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

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

    E-Print Network [OSTI]

    D'Autilia, Roberto

    2015-01-01

    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.

  8. Clustering attributed graphs: models, measures and methods

    E-Print Network [OSTI]

    Bothorel, Cecile; Magnani, Matteo; Micenkova, Barbora

    2015-01-01

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

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

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

  10. Copyright Y. Daniel Liang, 2005 Database Concept and Design

    E-Print Network [OSTI]

    Liang, Y. Daniel

    to interact with the database system, as shown in Figure 1.1. Database Management System (DBMS) Application Programs System Users Application Users database Figure 1.1 A database system consists of data, DBMS. The software that stores and manages data is known as database management system, or DBMS. DBMS is usually

  11. Hazard Analysis Database Report

    SciTech Connect (OSTI)

    GAULT, G.W.

    1999-10-13

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

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

    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; Tang, Diane L; Hanrahan, Patrick

    2014-04-29

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

    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.

  15. Data mining the EXFOR database using network theory

    E-Print Network [OSTI]

    John A. Hirdt; David A. Brown

    2013-12-21

    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.

  16. 09-Databases-Wahid.pptx

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

    Wahid Bhimji (wbhimji@lbl.gov) https:www.nersc.govusersdata- analyticsdata-management Databases and IO --- 1 --- Systems Services Tools Capabilities Transfer Processing...

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

    SciTech Connect (OSTI)

    Kepner, Jeremy; Bader, David; BuluÁ, Ayd?n; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning

    2015-01-01

    The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.

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

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

    Kepner, Jeremy; Bader, David; BuluÁ, Ayd?n; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning

    2015-01-01

    The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implementmore†Ľa wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.ę†less

  19. Dynamic On-Demand Updating of Data in Real-Time Database Systems

    E-Print Network [OSTI]

    . This calls for data-centric ap- proaches when designing embedded systems, where data and its meta data freshness in soft real-time embedded systems and the target application is vehicular systems, vehicular systems 1. INTRODUCTION Real-time and embedded software increases in complexity due to the larger

  20. Dismantling sparse random graphs

    E-Print Network [OSTI]

    Janson, Svante

    2007-01-01

    We consider the number of vertices that must be removed from a graph G in order that the remaining subgraph has no component with more than k vertices. Our principal observation is that, if G is a sparse random graph or a random regular graph on n vertices with n tending to infinity, then the number in question is essentially the same for all values of k such that k tends to infinity but k=o(n).

  1. Update to the Ground-Water Withdrawals Database for the Death Valley REgional Ground-Water Flow System, Nevada and California, 1913-2003

    SciTech Connect (OSTI)

    Michael T. Moreo; and Leigh Justet

    2008-07-02

    Ground-water withdrawal estimates from 1913 through 2003 for the Death Valley regional ground-water flow system are compiled in an electronic database to support a regional, three-dimensional, transient ground-water flow model. This database updates a previously published database that compiled estimates of ground-water withdrawals for 1913Ė1998. The same methodology is used to construct each database. Primary differences between the 2 databases are an additional 5 years of ground-water withdrawal data, well locations in the updated database are restricted to Death Valley regional ground-water flow system model boundary, and application rates are from 0 to 1.5 feet per year lower than original estimates. The lower application rates result from revised estimates of crop consumptive use, which are based on updated estimates of potential evapotranspiration. In 2003, about 55,700 acre-feet of ground water was pumped in the DVRFS, of which 69 percent was used for irrigation, 13 percent for domestic, and 18 percent for public supply, commercial, and mining activities.

  2. Spectral Graph Theory

    E-Print Network [OSTI]

    *D. J. Kelleher

    2011-09-30

    Spectral Graph Theory. *D. J. Kelleher2. 2Department of Mathematics. University of Connecticut. UConnó SIGMA Seminar ó Fall 2011. D. J. Kelleher. Spectral†...

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

  4. Graph processing platforms at scale: practices and experiences

    SciTech Connect (OSTI)

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

    2015-01-01

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

  5. Frequent Subgraph Discovery in Large Attributed Streaming Graphs

    SciTech Connect (OSTI)

    Ray, Abhik; Holder, Larry; Choudhury, Sutanay

    2014-08-13

    The problem of finding frequent subgraphs in large dynamic graphs has so far only consid- ered a dynamic graph as being represented by a series of static snapshots taken at various points in time. This representation of a dynamic graph does not lend itself well to real time processing of real world graphs like social networks or internet traffic which consist of a stream of nodes and edges. In this paper we propose an algorithm that discovers the frequent subgraphs present in a graph represented by a stream of labeled nodes and edges. Our algorithm is efficient and consists of tunable parameters that can be tuned by the user to get interesting patterns from various kinds of graph data. In our model updates to the graph arrive in the form of batches which contain new nodes and edges. Our algorithm con- tinuously reports the frequent subgraphs that are estimated to be found in the entire graph as each batch arrives. We evaluate our system using 5 large dynamic graph datasets: the Hetrec 2011 challenge data, Twitter, DBLP and two synthetic. We evaluate our approach against two popular large graph miners, i.e., SUBDUE and GERM. Our experimental re- sults show that we can find the same frequent subgraphs as a non-incremental approach applied to snapshot graphs, and in less time.

  6. Database Manipulation on Quantum Computers

    E-Print Network [OSTI]

    Ahmed Younes

    2007-05-29

    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

  7. Aging in reversible dynamics of disordered systems. I. Emergence of the arcsine law in Bouchaud's asymmetric trap model on the complete graph

    E-Print Network [OSTI]

    Vťronique Gayrard

    2010-08-23

    In this paper the celebrated arcsine aging scheme of G. Ben Arous and J. Cern\\'y is taken up. Using a brand new approach based on point processes and weak convergence techniques, this scheme is implemented in a wide class of Markov processes that can best be described as Glauber dynamics of discrete disordered systems. More specifically, conditions are given for the underlying clock process (a partial sum process that measures the total time elapsed along paths of a given length) to converge to a subordinator, and this subordinator is constructed explicitly. This approach is illustrated on Bouchaud's asymmetric trap model on the complete graph for which aging is for the first time proved, and the full, optimal picture, obtained.

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

    E-Print Network [OSTI]

    California at Berkeley, University of

    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

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

  10. Database Help

    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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration would like submit theCovalent Bonding Low-Cost2 DOE HQSiteoC. DoranDatabase Help Database Help

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

    SciTech Connect (OSTI)

    Janet M Twomey, PhD

    2010-04-30

    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.

  12. Models of random graph hierarchies

    E-Print Network [OSTI]

    Paluch, Robert; Holyst, Janusz

    2015-01-01

    We introduce two models of inclusion hierarchies: Random Graph Hierarchy (RGH) and Limited Random Graph Hierarchy (LRGH). In both models a set of nodes at a given hierarchy level is connected randomly, as in the Erd\\H{o}s-R\\'{e}nyi random graph, with a fixed average degree equal to a system parameter $c$. Clusters of the resulting network are treated as nodes at the next hierarchy level and they are connected again at this level and so on, until the process cannot continue. In the RGH model we use all clusters, including those of size $1$, when building the next hierarchy level, while in the LRGH model clusters of size $1$ stop participating in further steps. We find that in both models the number of nodes at a given hierarchy level $h$ decreases approximately exponentially with $h$. The height of the hierarchy $H$, i.e. the number of all hierarchy levels, increases logarithmically with the system size $N$, i.e. with the number of nodes at the first level. The height $H$ decreases monotonically with the conne...

  13. Robust Aggregation in Peer-to-Peer Database Systems Norvald H. Ryeng and Kjetil Nrvg

    E-Print Network [OSTI]

    -to-peer systems is resilience to churn in the overlay network layer. A major challenge in P2PDBs is to provide aggrega- tion queries in P2PDBs can be handled in order to reduce the impact of churn on accuracy that increase the accuracy of aggregation queries in P2PDBs under churn. Categories and Subject Descriptors H.2

  14. NEAR MINIMAL WEIGHTED WORD GRAPHS FOR POST-PROCESSING SPEECH Michael T. Johnson and Mary P. Harper

    E-Print Network [OSTI]

    Johnson, Michael T.

    NEAR MINIMAL WEIGHTED WORD GRAPHS FOR POST-PROCESSING SPEECH Michael T. Johnson and Mary P. Harper for representing large numbers of acoustic hypotheses compactly. Word graphs or lattices generated by acoustic the graph. 1. INTRODUCTION Many recognition systems use word lattices or graphs as mechanisms

  15. Switching Graphs Jan Friso Groote

    E-Print Network [OSTI]

    Groote, Jan Friso

    Switching Graphs Jan Friso Groote J.F.Groote@tue.nl Bas Ploeger S.C.W.Ploeger@tue.nl Department The Netherlands Abstract Switching graphs are graphs containing switches. By using boolean functions called switch settings, these switches can be put in a fixed direction to obtain an ordinary graph. For many problems

  16. Graph Automatic Semigroups Rachael Carey

    E-Print Network [OSTI]

    St Andrews, University of

    Graph Automatic Semigroups Rachael Carey NBSAN St Andrews 22/04/2015 Rachael Carey NBSAN St Andrews Graph Automatic Semigroups #12;Regular languages An alphabet is a set of symbols.The elements are accepted by finite state automata. Rachael Carey NBSAN St Andrews Graph Automatic Semigroups #12;Graph

  17. A Characterization of Seymour Graphs

    E-Print Network [OSTI]

    Kostochka, Alexandr V.

    A Characterization of Seymour Graphs A. A. Ageev and A. V. Kostochka,* INSTITUTE OF MATHEMATICS undirected graph G is called a Seymour graph if the maximum number of edge disjoint T-cuts is equal to be subfamilies of Seymour graphs (Seymour J. Comb. Theory B 49 (1990), 189­222; Proc. London Math. Soc. Ser. (3

  18. 14th Int'l Conf. on Distributed Multimedia Systems -2008 Prof. Robert Laurini, INSA-Lyon, France Visual Summaries of Geographic Databases 1

    E-Print Network [OSTI]

    Laurini, Robert

    14th Int'l Conf. on Distributed Multimedia Systems - 2008 Prof. Robert Laurini, INSA-Lyon, France Visual Summaries of Geographic Databases 1 Lyon Robert Laurini Françoise Raffort David Sol Salerno Giuliana Vitiello Puebla-Lyon Karla López Salerno-Lyon Vincenzo Del Fatto International Project Monica

  19. Approved Module Information for CS1050, 2014/5 Module Title/Name: Information Systems and Databases Module Code: CS1050

    E-Print Network [OSTI]

    Neirotti, Juan Pablo

    for translating ER diagrams into relational schema and SQL tables; to write SQL queries forobtaining information and use them to create normalised relational schema * Programming in Oracle using SQL, PL/SQL and function of database management systems. * Introduction to SQL and Oracle. * Analysis of different types

  20. A Graph Bottleneck Inequality

    E-Print Network [OSTI]

    Chebotarev, Pavel

    2008-01-01

    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.

  1. Graph representation of protein free energy landscape

    SciTech Connect (OSTI)

    Li, Minghai; Duan, Mojie; Fan, Jue; Huo, Shuanghong; Han, Li

    2013-11-14

    The thermodynamics and kinetics of protein folding and protein conformational changes are governed by the underlying free energy landscape. However, the multidimensional nature of the free energy landscape makes it difficult to describe. We propose to use a weighted-graph approach to depict the free energy landscape with the nodes on the graph representing the conformational states and the edge weights reflecting the free energy barriers between the states. Our graph is constructed from a molecular dynamics trajectory and does not involve projecting the multi-dimensional free energy landscape onto a low-dimensional space defined by a few order parameters. The calculation of free energy barriers was based on transition-path theory using the MSMBuilder2 package. We compare our graph with the widely used transition disconnectivity graph (TRDG) which is constructed from the same trajectory and show that our approach gives more accurate description of the free energy landscape than the TRDG approach even though the latter can be organized into a simple tree representation. The weighted-graph is a general approach and can be used on any complex system.

  2. Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics

    E-Print Network [OSTI]

    Nitin Saxena; Simone Severini; Igor Shparlinski

    2007-03-26

    The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a circulant graph, is periodic if and only if all eigenvalues of the graph are integers (that is, the graph is integral). Motivated by this observation, we focus on relevant properties of integral circulant graphs. Specifically, we bound the number of vertices of integral circulant graphs in terms of their degree, characterize bipartiteness and give exact bounds for their diameter. Additionally, we prove that circulant graphs with odd order do not allow perfect state transfer.

  3. Graph similarity and matching

    E-Print Network [OSTI]

    Zager, Laura (Laura A.)

    2005-01-01

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

  4. Graph Grammars Matilde Marcolli

    E-Print Network [OSTI]

    Marcolli, Matilde

    to computer science, Lecture Notes in Computer Science, Vol. 532, Springer, 1990. G. Rozenberg, Handbook Grammars H. Ehrig, K. Ehrig, U. Prange, G. Taentzer, Fundamentals of algebraic graph transformation. New

  5. Fault-tolerant distributed transactions for partitioned OLTP databases

    E-Print Network [OSTI]

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

    2012-01-01

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

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

  7. Statistical Inference on Graphs Gerard BIAU # and Kevin BLEAKLEY

    E-Print Network [OSTI]

    Biau, Gérard

    to reconstruct networks have been proposed and tested so far, ranging from Bayesian or Petri networks applications including communication networks and systems biology, we propose a general model for studying deals with problems that have a graph (or network) structure. In this context an (undirected) graph

  8. Development of an OCS Cementing Operational Guidelines Database

    E-Print Network [OSTI]

    Bell, Matthew G.

    2014-08-20

    the goals of the database, identifying its users, and selecting an appropriate database management system. The main goal of the database is to present specific design, testing, and operational procedures to ensure optimized cement seal effectiveness...

  9. Phylogenetic Toric Varieties on Graphs

    E-Print Network [OSTI]

    Buczynska, Weronika J.

    2010-10-12

    We define the phylogenetic model of a trivalent graph as a generalization of a binary symmetric model of a trivalent phylogenetic tree. If the underlining graph is a tree, the model has a parametrization that can be expressed ...

  10. Open Graphs and Computational Reasoning†

    E-Print Network [OSTI]

    Dixon, Lucas; Ross, Duncan; Aleks, Kissinger

    2010-01-01

    We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface ...

  11. Subdominant pseudoultrametric on graphs

    SciTech Connect (OSTI)

    Dovgoshei, A A; Petrov, E A

    2013-08-31

    Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)?R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k?2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.

  12. Temporal Representation in Semantic Graphs

    SciTech Connect (OSTI)

    Levandoski, J J; Abdulla, G M

    2007-08-07

    A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.

  13. Self-testing graph states

    E-Print Network [OSTI]

    Matthew McKague

    2010-10-11

    We give a construction for a self-test for any connected graph state. In other words, for each connected graph state we give a set of non-local correlations that can only be achieved (quantumly) by that particular graph state and certain local measurements. The number of correlations considered is small, being linear in the number of vertices in the graph. We also prove robustness for the test.

  14. INCREMENTAL HORIZONTAL FRAGMENTATION OF DATABASE CLASS OBJECTS

    E-Print Network [OSTI]

    Ezeife, Christie

    INCREMENTAL HORIZONTAL FRAGMENTATION OF DATABASE CLASS OBJECTS C.I. Ezeife School of Computer-orientd databases, Incremental horizontal fragmentation, Distribution Abstract: Horizontal fragments of a class in an object-oriented database system contain subsets of the class extent or instance objects. These fragments

  15. Geometry of graph varieties

    E-Print Network [OSTI]

    Martin, Jeremy L.

    2003-01-01

    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 355, Number 10, Pages 4151{4169 S 0002-9947(03)03321-X Article electronically published on May 15, 2003 GEOMETRY OF GRAPH VARIETIES JEREMY L. MARTIN Abstract. A picture P of a graph G =(V...;E) consists of a point P(v)foreach vertex v2V and a line P(e)foreachedgee2E, all lying in the projective plane over a eld k and subject to containment conditions corresponding to incidence in G.Agraph variety is an algebraic set whose points parametrize...

  16. Ramsey Minimal Graphs Bela Bollobas

    E-Print Network [OSTI]

    Kohayakawa, Yoshiharu

    Ramsey Minimal Graphs B¬īela Bollob¬īas Department of Mathematical Sciences University of Memphis of the edges of contains a red copy of G or a blue copy of H. A pair of graphs (G, H) is said to be Ramsey- connected graph that does not contain induced cycles of length at least , then the pair (Ck , H) is Ramsey

  17. Densities in graphs and matroids†

    E-Print Network [OSTI]

    Kannan, Lavanya

    2009-05-15

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

  18. In this effort, we describe a face database obtained by using an involved acquisition system for the collection of

    E-Print Network [OSTI]

    Abidi, Mongi A.

    relies heavily on illumination. Thermal IR imagery, being a representation of the radiated thermal energy when involving multi-band visible and thermal information. The database has applications/monochromatic image, one thermal image and the spectral distribution of the illumination of the scene. The complete

  19. ARTI refrigerant database

    SciTech Connect (OSTI)

    Calm, J.M.

    1996-07-01

    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.

  20. ARTI refrigerant database

    SciTech Connect (OSTI)

    Calm, J.M.

    1999-01-01

    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.

  1. ARTI refrigerant database

    SciTech Connect (OSTI)

    Calm, J.M.

    1996-11-15

    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.

  2. A procedure for automatically linking a geographical database and a pavement attribute database

    E-Print Network [OSTI]

    Lehmann, Erwin August

    1996-01-01

    operational PMS packages display information in a tabular format, a Geographical Information System (GIS) displays information graphically. Therefore, linking a PMS attribute database to a GIS spatial database can improve and enhance its functionality...

  3. Quantum chaos on discrete graphs

    E-Print Network [OSTI]

    Uzy Smilansky

    2007-04-26

    Adapting a method developed for the study of quantum chaos on {\\it quantum (metric)} graphs \\cite {KS}, spectral $\\zeta$ functions and trace formulae for {\\it discrete} Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph, and obtaining functions which belongs to the class of $\\zeta$ functions proposed originally by Ihara \\cite {Ihara}, and expanded by subsequent authors \\cite {Stark,Sunada}. Finally, a model of "classical dynamics" on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs \\cite {KS}.

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

    2014-06-01

    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.

  5. NUCLEAR STRUCTURE DATABASE

    E-Print Network [OSTI]

    Firestone, R.B.

    2010-01-01

    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

  6. Temporally Scalable Visual SLAM using a Reduced Pose Graph

    E-Print Network [OSTI]

    Johannsson, Hordur

    2012-05-25

    In this paper, we demonstrate a system for temporally scalable visual SLAM using a reduced pose graph representation. Unlike previous visual SLAM approaches that use keyframes, our approach continually uses new measurements ...

  7. Temporally scalable visual SLAM using a reduced pose graph

    E-Print Network [OSTI]

    Johannsson, Hordur

    In this paper, we demonstrate a system for temporally scalable visual SLAM using a reduced pose graph representation. Unlike previous visual SLAM approaches that maintain static keyframes, our approach uses new measurements ...

  8. Proposal to extend a blanket contract for the supply and maintenance fo Network-Attached Storage systems for Oracle databases and for shared file servers for the LHC experiments

    E-Print Network [OSTI]

    2011-01-01

    Proposal to extend a blanket contract for the supply and maintenance fo Network-Attached Storage systems for Oracle databases and for shared file servers for the LHC experiments

  9. Database of Geneva stellar evolution tracks and isochrones for UBVRIJHKLL'M, HST-WFPC2, Geneva and Washington photometric systems

    E-Print Network [OSTI]

    Thibault Lejeune; Daniel Schaerer

    2000-11-27

    We have used an updated version of the empirically and semi-empirically calibrated BaSeL library of synthetic stellar spectra of Lejeune et al. (1997, 1998) and Westera et al. (1999) to calculate synthetic photometry in the UBVRIJHKLL'M, HST-WFPC2, Geneva, and Washington systems for the entire set of non-rotating Geneva stellar evolution models covering masses from 0.4-0.8 to 120-150 Msun and metallicities Z=0.0004 (1/50 Zsun) to 0.1 (5 Zsun). The results are provided in a database which includes all individual stellar tracks and the corresponding isochrones covering ages from 10^3 yr to 16--20 Gyr in time steps of Delta(log t)= 0.05 dex. The database also includes a new grid of stellar tracks of very metal-poor stars (Z=0.0004) from 0.8 - 150 Msun calculated with the Geneva stellar evolution code. The full database will be available in electronic form at the CDS (http://cdsweb.u-strasbg.fr/cgi-bin/qcat?J/A+A/(vol)/(page)) and at http://webast.ast.obs-mip.fr/stellar/.

  10. Finite Prime Distance Graphs and 2-Odd Graphs Joshua D. Laison, Colin Starr, and Andrea Walker

    E-Print Network [OSTI]

    Laison, Josh

    that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch windmill graphs and paper, Vinogradov's Theorem, and Ramarīe's Theorem, respectively; and we show that Dutch windmill graphs and paper

  11. The graph bottleneck identity

    E-Print Network [OSTI]

    Chebotarev, Pavel

    2010-01-01

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

  12. ARTI refrigerant database

    SciTech Connect (OSTI)

    Calm, J.M.

    1997-02-01

    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.

  13. ARTI refrigerant database

    SciTech Connect (OSTI)

    Calm, J.M.

    1998-08-01

    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.

  14. Predictive Database Schema Evolution Hassina BOUNIF, Stefano SPACCAPIETRA

    E-Print Network [OSTI]

    Madiraju, Praveen

    Predictive Database Schema Evolution Hassina BOUNIF, Stefano SPACCAPIETRA Database Laboratory (LBD.spaccapietra@epfl.ch Abstract: This paper proposes a new approach for organizing the evolution of existing database system and easy-to-evolve database schema. Evolution algorithms are tailored to choose the best evolution

  15. Private Database Queries Using Somewhat Homomorphic Craig Gentry

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Private Database Queries Using Somewhat Homomorphic Encryption Dan Boneh Craig Gentry Shai Halevi Frank Wang David J. Wu Abstract In a private database query system, a client issues queries to a database and obtains the results with- out learning anything else about the database and without the server

  16. Adventures in Graph Ramsey Theory /

    E-Print Network [OSTI]

    Parrish, Andrew T.

    2013-01-01

    1.1 Additive Ramsey theory . . . . . . . . . . .3.1 Large Ramsey . . . . . . . . . . . . . . .additive- and graph-Ramsey theory 1.3 The compactness

  17. Evaluation of Functional Data Models for Database Design and Use†

    E-Print Network [OSTI]

    Kulkarni, Krishnarao Gururao

    1983-01-01

    The problems of design, operation, and maintenance of databases using the three most popular database management systems (Hierarchical, CQDASYL/DBTG, and Relational) are well known. Users wishing to use these systems ...

  18. Laplacian spectral characterization of products of complete graphs with trees, unicyclic graphs, and bicyclic graphs

    E-Print Network [OSTI]

    Wang, Suijie

    2010-01-01

    In this paper, we give a Laplacian characterization of the product of the complete graphs $K_m$ with trees, unicyclic graphs, and bicyclic graphs. More precisely, let $G$ be a connected graph with at most two independent cycles. If $G$ is neither $C_{6}$ nor $\\Theta_{3,2,5}$ and determined by its Laplacain spectrum, then the product $G\\times K_{m}$ is also a graph determined by its Laplacian spectrum. In addition, we find the cosepctral graphs of $C_{6}\\times K_{m}$ and $\\Theta_{3,2,5}\\times K_{m}$, where the case $m=1$ is shown in Figure \\ref{F1} and \\ref{F2}.

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

    E-Print Network [OSTI]

    Wismath, Stephen

    stereo experi- ence with head tracking and display of appropriate left and right eye information The low on the effectiveness of head-mounted VR systems vs. fish tank VR noted that the hardware suffered from latency- braries permit its use as the main engine for creating the virtual (graph) world. Head tracking

  20. Combining Bond-Graphs with Genetic Programming for Unified/Automated Design of Mechatronic or

    E-Print Network [OSTI]

    Fernandez, Thomas

    Combining Bond-Graphs with Genetic Programming for Unified/Automated Design of Mechatronic or Multi of a mechatronic system makes it difficult to model using a single modeling technique over the whole system and polymorphic modeling and simulation technique. Bond-Graph model of the mechatronic system can be directly

  1. Graph Algorithms in the Internet Age

    E-Print Network [OSTI]

    Stanton, Isabelle Lesley

    2012-01-01

    5.2 Classic Matching Algorithms . . . . . . . . . . . . .4.3 Analysis of Algorithms on Random Graphs . . . . . . . .Graph Problems 5 An Introduction to Matching Algorithms 5.1

  2. Generating Reports & Graphs in Portfolio Manager | Department...

    Energy Savers [EERE]

    Generating Reports & Graphs in Portfolio Manager Generating Reports & Graphs in Portfolio Manager This presentation, given through the DOE's Technical Assitance Program (TAP),...

  3. Jeroen Weijers Universitt Tbingen1 A Database Coprocessor for Haskell

    E-Print Network [OSTI]

    Grust, Torsten

    into SQL Runtime Heap Database System Input Data Haskell Program Result 2 Dienstag, 7. September 2010 #12;Jeroen Weijers Universit√§t T√ľbingen Haskell turns into SQL Runtime Heap Database System Input Data SQL into SQL Runtime Heap Database System Input Data SQL Queries Result 2 Dienstag, 7. September 2010 #12

  4. Constrained Ramsey Numbers of Graphs

    E-Print Network [OSTI]

    Jiang, Tao

    Constrained Ramsey Numbers of Graphs Robert E. Jamison,1 Tao Jiang,2* and Alan C. H. Ling3 1-like trees. √? 2002 Wiley Periodicals, Inc. J Graph Theory 42: 1¬≠16, 2003 Keywords: Ramsey; monochromatic edges have the same color and rainbow iff all of its edges have different colors. In classical Ramsey

  5. Random rectangular Graphs

    E-Print Network [OSTI]

    Estrada, Ernesto

    2015-01-01

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

  6. Encoding and analyzing aerial imagery using geospatial semantic graphs

    SciTech Connect (OSTI)

    Watson, Jean-Paul; Strip, David R.; McLendon, William C.; Parekh, Ojas D.; Diegert, Carl F.; Martin, Shawn Bryan; Rintoul, Mark Daniel

    2014-02-01

    While collection capabilities have yielded an ever-increasing volume of aerial imagery, analytic techniques for identifying patterns in and extracting relevant information from this data have seriously lagged. The vast majority of imagery is never examined, due to a combination of the limited bandwidth of human analysts and limitations of existing analysis tools. In this report, we describe an alternative, novel approach to both encoding and analyzing aerial imagery, using the concept of a geospatial semantic graph. The advantages of our approach are twofold. First, intuitive templates can be easily specified in terms of the domain language in which an analyst converses. These templates can be used to automatically and efficiently search large graph databases, for specific patterns of interest. Second, unsupervised machine learning techniques can be applied to automatically identify patterns in the graph databases, exposing recurring motifs in imagery. We illustrate our approach using real-world data for Anne Arundel County, Maryland, and compare the performance of our approach to that of an expert human analyst.

  7. The EMIME Bilingual Database

    E-Print Network [OSTI]

    Wester, Mirjam

    2010-01-01

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

  8. A note on performance of VM/370 in the integration of models and databases

    E-Print Network [OSTI]

    Donovan, John J.

    1976-01-01

    As the proliferation of programming systems and database systems continues and, correspondingly, as the need for integrating these systems for

  9. Database Encryption Luc Bouganim

    E-Print Network [OSTI]

    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

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

  11. THE DESIGN AND IMPLEMENTATION OF A DATA LEVEL DATABASE

    E-Print Network [OSTI]

    Yoo, S. J. Ben

    THE DESIGN AND IMPLEMENTATION OF A DATA LEVEL DATABASE INFERENCE DETECTION SYSTEM Raymond W. Yip and Karl N. Levitt Abstract: Inference is a way to subvert access control mechanisms of database systems. Most existing work on inference detection relies on analyzing func- tional dependencies in the database

  12. A Study on Set-Graphs

    E-Print Network [OSTI]

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

    2015-04-09

    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.

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

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

    E-Print Network [OSTI]

    Alwes, Frederike

    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

  15. Rainbow Connection Number of Graph Power and Graph Products

    E-Print Network [OSTI]

    Basavaraju, Manu; Rajendraprasad, Deepak; Ramaswamy, Arunselvan

    2011-01-01

    Rainbow connection number, $rc(G)$, of a connected graph G is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. In this paper we study the rainbow connection number with respect to three important graph product operations (cartesian product, lexicographic product and strong product) and the operation of graph powering. More specifically we show the following: (Here, $r(G)$ denotes the radius of $G$, an obvious lower bound for $rc(G)$) (1.) For a connected graph $G$, let $G^{k}$ be the k-th power of $G$. We show that for $k \\ge 2$, $r(G^{k}) \\le rc(G^{k}) \\le 2r(G^{k}) + 1$. The upper bound is tight up to an additive constant of 1. (2.) For two-connected, non-trivial graphs $G$ and $H$, let $G \\Box H$ be the Cartesian Product of $G$ and $H$. We show that $r(G \\Box H) \\le rc(G \\Box H)$ $\\le$ $2r(G \\Box H)$. The bound is tight. (3.) For two graphs $G$ and $H$ such that $G$ is a connected, non-trivia...

  16. Abstract--With the rapid growth of the Internet and database technologies in recent years, question answering systems (QAS)

    E-Print Network [OSTI]

    Chu, Hao-hua

    of the most fundamental and influential theories of human behavior. Davis et al. [2] applied TRA to individual on a literature review of information system models and theories. Based on the user's perspective, we propose and factors in the development of an information system in order to improve its acceptance. The purpose

  17. Cycle structure in SR and DSR graphs: implications for multiple equilibria and stable oscillation in chemical reaction networks

    E-Print Network [OSTI]

    Banaji, Murad

    2010-01-01

    Associated with a chemical reaction network is a natural labelled bipartite multigraph termed an SR graph, and its directed version, the DSR graph. These objects are closely related to Petri nets. The construction of SR and DSR graphs for chemical reaction networks is presented. Conclusions about asymptotic behaviour of the associated dynamical systems which can be drawn easily from the graphs are discussed. In particular, theorems on ruling out the possibility of multiple equilibria or stable oscillation in chemical reaction networks based on computations on SR/DSR graphs are presented. These include both published and new results. The power and limitations of such results are illustrated via several examples.

  18. 38 Chapteri - Functions and Graphs

    E-Print Network [OSTI]

    a) Predict the pollution in 2007, 2010, and 2020. b) Graph the function over the interval [0, 50]. At most, how many y-intercepts can a function have? Explain.

  19. Approximate Graph Products Marc Hellmutha

    E-Print Network [OSTI]

    Stadler, Peter F.

    Approximate Graph Products Marc Hellmutha , Wilfried Imrichb , Werner Kl®ocklb , Peter F. Stadlera or fingers) can vary independently of other traits, or Email addresses: marc@bioinf.uni-leipzig.de (Marc

  20. Doing time : inducing temporal graphs

    E-Print Network [OSTI]

    Bramsen, Philip James

    2006-01-01

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

  1. DATABASE DESIGN, Gio Wiederhold CHAPTER 8, file CHAP8.tex This file is c

    E-Print Network [OSTI]

    Wiederhold, Gio

    To a Mouse, 1787 The previous chapter described models of databases. The structure of the database the database model, but do not make it directly available to a database management system. In this chapter we404 !le DATABASE DESIGN, Gio Wiederhold CHAPTER 8, file CHAP8.tex This file is c fl1977 by Mc

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

    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.

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

    SciTech Connect (OSTI)

    Wang, Jy-An John

    2010-08-01

    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.

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

  5. Construction of abstract state graphs with PVS Susanne Graf and Hassen Saidi

    E-Print Network [OSTI]

    Grosu, Radu

    Construction of abstract state graphs with PVS Susanne Graf and Hassen Saidi VERIMAG Centre at the address http:://www.imag.fr/VERIMAG/PEOPLE/Hassen.Saidi/BRP 2 #12; Construction of abstract state graphs of infinite systems with PVS Susanne Graf and Hassen Saidi VERIMAG 1 Abstract In this paper, we propose

  6. Fundamenta Informaticae 33(2), 1998, 201{209 1 Termination of graph rewriting is undecidable

    E-Print Network [OSTI]

    Plump, Detlef

    Fundamenta Informaticae 33(2), 1998, 201{209 1 IOS Press Termination of graph rewriting pushout approach") is terminating. The proof is by a reduction of the Post Correspondence Problem or of the termination problem for string rewriting systems to the present problem. Keywords: graph rewriting

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

  8. Session title: Distributed and intelligent databases

    SciTech Connect (OSTI)

    Argos, P.; Mewes, H.W.; Frishman, D.

    1996-12-31

    This session focuses on the recent advances in the delivery of information to the biological community concerning genome sequencing and related information. New approaches include interconnecting existing databases, knowledge-based expert systems, interface languages and multiserver management.

  9. Some algorithmic results in graph imbeddings†

    E-Print Network [OSTI]

    Joshi, Sanjay

    1990-01-01

    , is constructed by: 1. joining vertez us in graph G to vertez vr in H by an edge b, and 8. joining vertez uq in graph G to vertez vq in H by an edge V. The figure 2. 2 on the following page shows the double bar amalgamation of graphs Gq and Gq. We select a... vertex pair (un u2) in the graph Gq which are connected by an edge and similar vertex pair (vr, vq) on the graph Gz. The connecting bars b and b' join these two graphs at the selected vertices. 93 From the previous lemmas we can now prove, the mair...

  10. 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 be implemented in a GIS, in a computer-assisted design (CAD) system coupled with a DBMS, in a universal server

  11. SCDBR: An Automated Reasoner for Database (Extended Abstract)

    E-Print Network [OSTI]

    Bertossi, Leopoldo

    . In general, theories of action and change, such as the specification of the evolution of a database, includeSCDBR: An Automated Reasoner for Database Updates (Extended Abstract) Leopoldo Bertossi, Marcelo In this paper we describe SCDBR, a system that automates reasoning with specifications of database updates

  12. Requirements Ontology and Multirepresentation Strategy for Database Schema Evolution 1

    E-Print Network [OSTI]

    Pottinger, Rachel

    Requirements Ontology and Multirepresentation Strategy for Database Schema Evolution 1 Hassina important utilization field of ontology related to database schemas and which is schema evolution topic and which is related to information systems. That is database schema evolution, an important, complex

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

  14. PRTAD: A DATABASE FOR PROTEIN RESIDUE TORSION ANGLE DISTRIBUTIONS

    E-Print Network [OSTI]

    PRTAD: A DATABASE FOR PROTEIN RESIDUE TORSION ANGLE DISTRIBUTIONS By Xiaoyong Sun Di Wu Robert­0436 Phone: 612-624-6066 Fax: 612-626-7370 URL: http://www.ima.umn.edu #12;PRTAD: A Database for Protein@iastate.edu Abstract PRTAD is a dedicated database and structural bioinformatics system for protein analysis

  15. Database-Aware Semantically-Smart Storage Muthian Sivathanu

    E-Print Network [OSTI]

    Arpaci-Dusseau, Andrea

    the differ- ences when building database-aware storage. We find that semantically-smart disk systems can to require changes for semantically smart storage. To build database-aware storage, we investigate twoDatabase-Aware Semantically-Smart Storage Muthian Sivathanu , Lakshmi N. Bairavasundaram , Andrea C

  16. Score Region Algebra: Building a Transparent XML-IR Database

    E-Print Network [OSTI]

    Hiemstra, Djoerd

    imple- mented the algebra operators in a prototype system on top of a low-level database kernel algebra framework on top of any low-level physical database engine or existing RDBMS, allowing a more sysScore Region Algebra: Building a Transparent XML-IR Database Vojkan Mihajlovi¬īc Henk Ernst Blok

  17. A Scalable Processing-in-Memory Accelerator for Parallel Graph Processing Junwhan Ahn Sungpack Hong Sungjoo Yoo Onur Mutlu Kiyoung Choi

    E-Print Network [OSTI]

    Mutlu, Onur

    an open problem. Ideally, cost-effective and scalable graph processing systems can be realized by building technology that facilitates stacking logic and memory dies in a single package, which was not available when-of-the-art graph processing workloads with large real-world graphs show that the proposed architecture improves

  18. Exploring the Graph of Graphs: Network Evolution and Centrality Distances

    E-Print Network [OSTI]

    Pignolet, Yvonne Anne; Schmid, Stefan; Tredan, Gilles

    2015-01-01

    The topological structure of complex networks has fascinated researchers for several decades, and today we have a fairly good understanding of the types and reoccurring characteristics of many different complex networks. However, surprisingly little is known today about models to compare complex graphs, and quantitatively measure their similarity and dynamics. In the past a variety of node centralities, i.e., functions which assign values to nodes to represent their importance in the graph. Based on such centralities we propose a natural similarity measure for complex networks: the centrality distance $d_C$, the difference between two graphs with respect to a given node centrality $C$. Centrality distances can take the specific roles of the different nodes in the network into account, and have many interesting applications. As a case study, we investigate the evolution of networks with respect to centrality distances and their approximations based on closeness, betweenness, pagerank, clustering and degree cen...

  19. MAC, material accounting database user guide

    SciTech Connect (OSTI)

    Russell, V.K.

    1994-09-22

    The K Basins Material Accounting (MAC) database system user guide describes the user features and functions, and the document is structured like the database menus. This document presents the MAC database system user instructions which explain how to record the movements and configuration of canisters and materials within the K Basins on the computer, the mechanics of handling encapsulation tracking, and administrative functions associated with the system. This document includes the user instructions, which also serve as the software requirements specification for the system implemented on the microcomputer. This includes suggested user keystrokes, examples of screens displayed by the system, and reports generated by the system. It shows how the system is organized, via menus and screens. It does not explain system design nor provide programmer instructions.

  20. Detecting Tampering in Random Graphs

    E-Print Network [OSTI]

    Pinsky, Ross G

    2012-01-01

    Let $\\mathcal{G}_n=(V_n,E_n)$ be a growing sequence of deterministic finite graphs, with $V_n$ denoting the vertices and $E_n$ denoting the edges. Consider the random graph $\\mathcal{G}_n(p_n)=(V_n, E_n(p_n))$ obtained by including any given edge with probability $p_n$, independent of other edges, and let $P_n^{p_n}$ denote the corresponding probability measure on $\\mathcal{G}_n$. Now tamper with the random graph in some regular way. For example, if $\\mathcal{G}_n$ is the complete graph on $n$ vertices, so that $\\mathcal{G}_n(p_n)$ is the Erdos-Renyi graph, then one might tamper with it by disconnecting all the edges of a randomly chosen vertex, or by adding all the edges of a randomly chosen Hamiltonian path from $\\mathcal{G}_n$, or by adding all the edges of a randomly chosen clique of order $k_n$ from $\\mathcal{G}_n$. Denote the resulting induced measure on $\\mathcal{G}_n$ by $P_n^{p_n,\\text{tamper}}$. The tampering is called \\it detectable\\rm\\ if $\\lim_{n\\to\\infty}||P_n^{p_n,\\text{tamper}}-P_n^{p_n}||_{\\t...

  1. Spectral properties of magnetic chain graphs

    E-Print Network [OSTI]

    Pavel Exner; Stepan Manko

    2015-07-02

    We discuss spectral properties of a charged quantum particle confined to a chain graph consisting of an infinite array of rings under influence of a magnetic field assuming a $\\delta$-coupling at the points where the rings touch. We start with the situation when the system has a translational symmetry and analyze spectral consequences of perturbations of various kind, such as a local change of the magnetic field, of the coupling constant, or of a ring circumference. A particular attention is paid to weak perturbations, both local and periodic; for the latter we prove a version of Saxon-Hutner conjecture.

  2. On the Recognition of Four-Directional Orthogonal Ray Graphs

    E-Print Network [OSTI]

    Felsner, Stefan

    class of graphs is also known as grid intersection graphs (GIG), see [9]. The recognition of GIGs is NP

  3. Decidability, Behavioural Equivalences and Infinite Transition Graphs

    E-Print Network [OSTI]

    HŁttel, Hans

    This thesis studies behavioural equivalences on labelled infinite transition graphs and the role that they can play in the context of modal logics and notions from language theory. A natural class of such infinite graphs ...

  4. Optimization in Geometric Graphs: Complexity and Approximation†

    E-Print Network [OSTI]

    Kahruman-Anderoglu, Sera

    2011-02-22

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

  5. Cops and Robber on Circulant Graphs

    E-Print Network [OSTI]

    Bonato, Anthony

    Edward Island #12;Cops and Robber Played on a finite, simple graph Cops have perfect information TwoCops and Robber on Circulant Graphs Shannon Fitzpatrick John Paul Larkin University of Prince

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

    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.

  7. Green's function approach for quantum graphs: an overview

    E-Print Network [OSTI]

    Fabiano M. Andrade; Alexandre G. M. Schmidt; Eduardo Vicentini; Bin K. Cheng; Marcos G. E. da Luz

    2016-01-05

    Here we review the many interesting aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. Such approach is particularly interesting because $G$ can be written as a sum over classical-like paths, where local quantum effects are taking into account through the scattering matrix amplitudes (basically, transmission and reflection coefficients) defined on each one of the graph vertices. So, the {\\em exact} $G$ has the functional form of a generalized semiclassical formula, which through different calculation techniques (addressed in details here) always can be cast into a closed analytic expression. This allows to solve exactly arbitrary large (although finite) graphs in a recursive and fast way. Using the Green's function method, we survey many properties for open and closed quantum graphs, like scattering solutions for the former and eigenspectrum and eigenstates for the latter, also addressing quasi-bound states. Concrete examples, like cube, binary trees and Sierpi\\'nski-like, topologies are considered. Along the work, possible distinct applications using the Green's function methods for quantum graphs are outlined.

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

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

  10. Quantum search in structured database using local adiabatic evolution and spectral methods

    E-Print Network [OSTI]

    R. Sufiani; N. Bahari

    2012-08-04

    Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state space of a graph. The algorithm is based on a local diabatic evolution of the Hamiltonian associated with the graph. The main new idea is to apply some techniques such as Krylov bspace projection methods, Lanczos algorithm and spectral distribution methods. Indeed, using these techniques together with the second-order perturbation theory, we give a systematic method for calculating the approximate search time at which the marked state can be reached. That is, for any undirected regular connected graph which is considered as the state space of the database, the introduced algorithm provides a systematic and programmable way for evaluation of the search time, in terms of the corresponding graph polynomials.

  11. Some problems in Graph Ramsey Theory

    E-Print Network [OSTI]

    Grinshpun, Andrey Vadim

    2015-01-01

    A graph G is r-Ramsey minimal with respect to a graph H if every r-coloring of the edges of G yields a monochromatic copy of H, but the same is not true for any proper subgraph of G. The study of the properties of graphs ...

  12. Semester Thesis Virus Inoculation on Social Graphs -

    E-Print Network [OSTI]

    Schmid, Stefan

    Semester Thesis Virus Inoculation on Social Graphs - The Friendship Factor Dominic Meier meierdo introduce friendship between neighbors while looking at a virus inoculation game which is played and in the star graph. #12;Virus Inoculation on Social Graphs - The Windfall of Friendship page 2 1 Introduction

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

  14. A heuristic algorithm for graph isomorphism†

    E-Print Network [OSTI]

    Torres Navarro, Luz

    1999-01-01

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

  15. The Joys of Graph Transformation Arend Rensink

    E-Print Network [OSTI]

    Rensink, Arend

    The Joys of Graph Transformation Arend Rensink Department of Computer Science, University of Twente, the things being changed are graphs. A fundamental assumption in studying such changes, the handbook [21] is a 1 #12;Figure 1: Two graphs with a matching good source); rather, we want to illustrate

  16. Regular graphs maximize the variability of random neural networks

    E-Print Network [OSTI]

    Gilles Wainrib; Mathieu Galtier

    2014-12-17

    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.

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

  18. PR-EDB: Power Reactor Embrittlement Database - Version 3

    SciTech Connect (OSTI)

    Wang, Jy-An John [ORNL; Subramani, Ranjit [ORNL

    2008-03-01

    The aging and degradation of light-water reactor pressure vessels is of particular concern because of their relevance to plant integrity and the magnitude of the expected irradiation embrittlement. The radiation embrittlement of reactor pressure vessel materials depends on many factors, such as neutron fluence, flux, and energy spectrum, irradiation temperature, and preirradiation material history and chemical compositions. These factors must be considered to reliably predict pressure vessel embrittlement and to ensure the safe operation of the reactor. Large amounts of data from surveillance capsules are needed to develop a generally applicable damage prediction model that can be used for industry standards and regulatory guides. Furthermore, the investigations of regulatory issues such as vessel integrity over plant life, vessel failure, and sufficiency of current codes, Standard Review Plans (SRPs), and Guides for license renewal can be greatly expedited by the use of a well-designed computerized database. The Power Reactor Embrittlement Database (PR-EDB) is such a comprehensive collection of data for U.S. designed commercial nuclear reactors. The current version of the PR-EDB lists the test results of 104 heat-affected-zone (HAZ) materials, 115 weld materials, and 141 base materials, including 103 plates, 35 forgings, and 3 correlation monitor materials that were irradiated in 321 capsules from 106 commercial power reactors. The data files are given in dBASE format and can be accessed with any personal computer using the Windows operating system. "User-friendly" utility programs have been written to investigate radiation embrittlement using this database. Utility programs allow the user to retrieve, select and manipulate specific data, display data to the screen or printer, and fit and plot Charpy impact data. The PR-EDB Version 3.0 upgrades Version 2.0. The package was developed based on the Microsoft .NET framework technology and uses Microsoft Access for backend data storage, and Microsoft Excel for plotting graphs. This software package is compatible with Windows (98 or higher) and has been built with a highly versatile user interface. PR-EDB Version 3.0 also contains an "Evaluated Residual File" utility for generating the evaluated processed files used for radiation embrittlement study.

  19. ORISE: Human Subjects Research Database

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

    in support of the HSRD database: Database maintenance Federal Internet server access Software development Quality assurancequality control Project assistance Human Subjects...

  20. Inf-2101 -Algoritmer Graph Search

    E-Print Network [OSTI]

    Bongo, Lars Ailo

    Inf-2101 - Algoritmer Graph Search John Markus Bj√łrndalen 2010-09-02 Some foils are adapted from the book and the book's homepage. John Markus Bj√łrndalen () Inf-2101 - Algoritmer 2010-09-02 1 / 25 #12 John Markus Bj√łrndalen () Inf-2101 - Algoritmer 2010-09-02 2 / 25 #12;Breadth-first search Depth

  1. ARTI Refrigerant Database

    SciTech Connect (OSTI)

    Calm, J.M.

    1994-05-27

    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.

  2. Nano Databases Nano Business

    E-Print Network [OSTI]

    Xie, Xiaoliang Sunney

    Home News Nano Databases Nano Business Nano Jobs Resources Introduc on to Nanotechnology Open menu's lab. A team of interna onal researchers, led by Lieber, the Mark Hyman, Jr. Professor of Chemistry

  3. Nuclear Science References Database

    E-Print Network [OSTI]

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

    2014-07-08

    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.

  4. 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 Fuels DataEnergy Webinar:IAbout Us| DepartmentFunds Recipients |DatabasesDatabases

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

    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.

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

  7. Proposed database model and file structures for arthropod collection management

    E-Print Network [OSTI]

    Miller, Scott

    the context of a single data management system. The value of this linkage is that it permits developers who. In some mainframe based database management systems, it is possible to define repeating subsets of information as part of a single database file structure. However, few personal computer-based systems have

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

    E-Print Network [OSTI]

    Grechanik, Mark

    the process of software evolution error- prone, expensive, and difficult. Currently, database deadlocksTesting 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

  9. The EPILEPSIAE database: An extensive electroencephalography database of epilepsy patients

    E-Print Network [OSTI]

    Timmer, Jens

    The EPILEPSIAE database: An extensive electroencephalography database of epilepsy patients *yz1. In this article we present the EPILEPSIAE database, which was made publicly available in 2012. We illustrate its content and scope. The EPILEPSIAE database provides long-term EEG recordings of 275 patients as well

  10. Noisy entanglement evolution for graph states

    E-Print Network [OSTI]

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

    2011-03-29

    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.

  11. Adiabatic graph-state quantum computation

    E-Print Network [OSTI]

    Bobby Antonio; Damian Markham; Janet Anders

    2014-12-19

    Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed in a particular order on a large entangled state. In contrast in HQC the system starts in the ground subspace of a Hamiltonian which is slowly changed such that a transformation occurs within the subspace. Following the approach of Bacon and Flammia, we show that any measurement-based quantum computation on a graph state with \\emph{gflow} can be converted into an adiabatically driven holonomic computation, which we call \\emph{adiabatic graph-state quantum computation} (AGQC). We then investigate how properties of AGQC relate to the properties of MBQC, such as computational depth. We identify a trade-off that can be made between the number of adiabatic steps in AGQC and the norm of $\\dot{H}$ as well as the degree of $H$, in analogy to the trade-off between the number of measurements and classical post-processing seen in MBQC. Finally the effects of performing AGQC with orderings that differ from standard MBQC are investigated.

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

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

  14. _ CMU-ITC-91-103 An Introduction to Object-Oriented Databases

    E-Print Network [OSTI]

    support, database self-containment, and schema evolution. This paper presents a summary of current.4.1 Query Language 28 2.4.2 Indexing 30 2.4.3 Query Optimization 31 2.5 Database Evolution 33 2.5.1 Schema_ CMU-ITC-91-103 An Introduction to Object-Oriented Databases and Database Systems Michael L

  15. Semantics of Database Transformations? Susan Davidson1, Peter Buneman1, and Anthony Kosky2

    E-Print Network [OSTI]

    Pennsylvania, University of

    including database integration, evolution of database systems, and implementing user views and data to schema evolution, integrating heterogeneous databases, and merging user views or mapping between dataSemantics of Database Transformations? Susan Davidson1, Peter Buneman1, and Anthony Kosky2 1 Dept

  16. WOL: A Language for Database Transformations and Constraints * Susan B. Davidson

    E-Print Network [OSTI]

    Pennsylvania, University of

    in data management. These tasks are complicated by schema evolution in the underlying databases such as reimplementing legacy systems, adapting databases to schema evolution, integrating heterogeneous databasesWOL: A Language for Database Transformations and Constraints * Susan B. Davidson Dept. of Computer

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

    E-Print Network [OSTI]

    Duckham, Matt

    spatial database M.G.S.M Zaffar Sadiq and Matt Duckham Department of Geomatics, University of Melbourne Variation in Quality Keywords Spatial data quality; spatial database; relational database management system for storing and retrieving spatially varying data quality information in a relational spatial database. Rather

  18. ARTI Refrigerant Database

    SciTech Connect (OSTI)

    Calm, J.M.

    1992-04-30

    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, though some may be added at a later date. The database identifies sources of specific information on R-32, R-123, R-124, R- 125, R-134a, R-141b, R142b, R-143a, R-152a, R-290 (propane), R-717 (ammonia), ethers, and others as well as azeotropic and zeotropic blends of these fluids. It addresses polyalkylene glycol (PAG), ester, and other lubricants. It also references documents addressing compatibility of refrigerants and lubricants with metals, plastics, elastomers, motor insulation, and other materials used in refrigerant circuits.

  19. Inf-2101 -Algoritmer Graph Search

    E-Print Network [OSTI]

    Bongo, Lars Ailo

    Inf-2101 - Algoritmer Graph Search John Markus Bj√łrndalen 2011-09-01 Some foils are adapted from the book and the book's homepage. John Markus Bj√łrndalen () Inf-2101 - Algoritmer 2011-09-01 1 / 16 #12 in the maze. Foil from Sedgewick/Wayne John Markus Bj√łrndalen () Inf-2101 - Algoritmer 2011-09-01 2 / 16 #12

  20. ON RAMSEY MINIMAL GRAPHS V. R ODL AND M. SIGGERS

    E-Print Network [OSTI]

    Siggers, Mark H.

    ON RAMSEY MINIMAL GRAPHS V. R ¨ODL AND M. SIGGERS Abstract. A graph G is r-ramsey on at most n vertices, each of which is r-ramsey-minimal with respect to the complete graph Kk. Furthermore of graph theory is determining the ramsey number for a graph H. This is the minimum number n such that any

  1. A Characterization of Seymour Graphs A. A. Ageev

    E-Print Network [OSTI]

    Szigeti, Zolt√°n

    A Characterization of Seymour Graphs A. A. Ageev , A. V. Kostochka and Z. Szigeti Abstract Following Gerards [1] we say that a connected undirected graph G is a Seymour graph if the maximum number (G). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour [4

  2. Counting matchings in irregular bipartite graphs

    E-Print Network [OSTI]

    Marc Lelarge

    2015-07-16

    We give a sharp lower bound on the number of matchings of a given size in a bipartite graph. When specialized to regular bipartite graphs, our results imply Friedland's Lower Matching Conjecture and Schrijver's theorem. It extends the recent work of Csikv\\'ari done for regular and bi-regular bipartite graphs. Moreover, our lower bounds are order optimal as they are attained for a sequence of $2$-lifts of the original graph. We then extend our results to permaments and subpermanents sums. For permanents, we are able to recover the lower bound of Schrijver recently proved by Gurvits using stable polynomials. We provide new lower bounds for subpermanents sums. Our proof borrows ideas from the theory of local weak convergence of graphs, statistical physics and covers of graphs.

  3. Fast generation of sparse random kernel graphs

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

    Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo

    2015-09-10

    The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore†Ľat most ?(n(logn)≤). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.ę†less

  4. Graphs in machine learning: an introduction

    E-Print Network [OSTI]

    Latouche, Pierre

    2015-01-01

    Graphs are commonly used to characterise interactions between objects of interest. Because they are based on a straightforward formalism, they are used in many scientific fields from computer science to historical sciences. In this paper, we give an introduction to some methods relying on graphs for learning. This includes both unsupervised and supervised methods. Unsupervised learning algorithms usually aim at visualising graphs in latent spaces and/or clustering the nodes. Both focus on extracting knowledge from graph topologies. While most existing techniques are only applicable to static graphs, where edges do not evolve through time, recent developments have shown that they could be extended to deal with evolving networks. In a supervised context, one generally aims at inferring labels or numerical values attached to nodes using both the graph and, when they are available, node characteristics. Balancing the two sources of information can be challenging, especially as they can disagree locally or globall...

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

  6. Discussiones Mathematicae Graph Theory 34 (2014) 287307

    E-Print Network [OSTI]

    Al Hanbali, Ahmad

    2014-01-01

    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

  7. Maximum Estrada Index of Bicyclic Graphs

    E-Print Network [OSTI]

    Wang, Long; Wang, Yi

    2012-01-01

    Let $G$ be a simple graph of order $n$, let $\\lambda_1(G),\\lambda_2(G),...,\\lambda_n(G)$ be the eigenvalues of the adjacency matrix of $G$. The Esrada index of $G$ is defined as $EE(G)=\\sum_{i=1}^{n}e^{\\lambda_i(G)}$. In this paper we determine the unique graph with maximum Estrada index among bicyclic graphs with fixed order.

  8. Generation of graph-state streams

    E-Print Network [OSTI]

    Daniel Ballester; Jaeyoon Cho; M. S. Kim

    2010-12-08

    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.

  9. Nuclear reactor multiphysics via bond graph formalism

    E-Print Network [OSTI]

    Sosnovsky, Eugeny

    2014-01-01

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

  10. On Products and Line Graphs of Signed Graphs, their Eigenvalues and Energy

    E-Print Network [OSTI]

    Zaslavsky, Thomas

    On Products and Line Graphs of Signed Graphs, their Eigenvalues and Energy K.A. Germina, Shahul and Laplacian matrices and their eigenvalues and energies of the general product (non-complete extended p- sum product and the eigenvalues and energy of the product in terms of those of the factor graphs

  11. Lecture Notes Database Management

    E-Print Network [OSTI]

    O'Neil, Patrick

    SQL Programs. Embedded SQL means SQL statements embedded in host language (C in our case). The original idea was for end-users to access a database through SQL. Called casual users. But this is not a good idea. Takes too much concentration. Can you picture airline reservation clerk doing job with SQL

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

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

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

    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.

  15. Interactive visualization of big data leveraging databases for scalable computation

    E-Print Network [OSTI]

    Battle, Leilani Marie

    2013-01-01

    Modern database management systems (DBMS) have been designed to efficiently store, manage and perform computations on massive amounts of data. In contrast, many existing visualization systems do not scale seamlessly from ...

  16. The EMIME Mandarin Bilingual Database

    E-Print Network [OSTI]

    Wester, Mirjam; Liang, Hui

    2011-01-01

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

  17. DCC Briefing Paper: Database archiving†

    E-Print Network [OSTI]

    MŁller, Heiko

    2009-02-02

    In a computational context, data archiving refers to the storage of electronic documents, data sets, multimedia files, and so on, for a defined period of time. Database archiving is usually seen as a subset of data archiving. Database archiving...

  18. Star graphs and Seba billiards

    E-Print Network [OSTI]

    G. Berkolaiko; E. B. Bogomolny; J. P. Keating

    2000-10-26

    We derive an exact expression for the two-point correlation function for quantum star graphs in the limit as the number of bonds tends to infinity. This turns out to be identical to the corresponding result for certain Seba billiards in the semiclassical limit. Reasons for this are discussed. The formula we derive is also shown to be equivalent to a series expansion for the form factor - the Fourier transform of the two-point correlation function - previously calculated using periodic orbit theory.

  19. A matrix representation of graphs and its spectrum as a graph invariant

    E-Print Network [OSTI]

    David Emms; Edwin R. Hancock; Simone Severini; Richard C. Wilson

    2006-04-05

    We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the first two cases, we compute the spectrum explicitly and show that it is determined by the spectrum of the adjacency matrix of the original graph. We then show by computation that the isomorphism classes of many known families of strongly regular graphs (up to 64 vertices) are characterized by the spectrum of this matrix. We conjecture that this is always the case for strongly regular graphs and we show that the conjecture is not valid for general graphs. We verify that the smallest regular graphs which are not distinguished with our method are on 14 vertices.

  20. ARTI Refrigerant Database

    SciTech Connect (OSTI)

    Calm, J.M.

    1992-11-09

    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.

  1. A Historical Database of Sociocultural Evolution

    E-Print Network [OSTI]

    Turchin, Peter; Whitehouse, Harvey; Francois, Pieter; Slingerland, Edward; Collard, Mark

    2012-01-01

    Historical Database of Sociocultural Evolution Peter TurchinThe Historical Database of Sociocultural Evolution, which weHistorical Database of Sociocultural Evolution. Cliodynamics

  2. A Noisy 10GB Provenance Database

    E-Print Network [OSTI]

    Cheah, You-Wei

    2013-01-01

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

  3. Lessons Learned Database | Department of Energy

    Office of Environmental Management (EM)

    Lessons Learned Database Lessons Learned Database The DOE Corporate Lessons Learned Database provides a central clearinghouse that allows ready access to and communication about...

  4. Ramsey Minimal Graphs B ela Bollob as

    E-Print Network [OSTI]

    Kohayakawa, Yoshiharu

    Ramsey Minimal Graphs B#19;ela Bollob#19;as #3; Department of Mathematical Sciences University to be Ramsey-in#12;nite if there are in#12;nitely many minimal graphs for which we have ! (G; H). Let ` #21; 4 `, then the pair (C k ; H) is Ramsey- in#12;nite for any k #21; `, where C k denotes the cycle of length k

  5. Diagonal Ramsey Numbers in Multipartite Graphs

    E-Print Network [OSTI]

    van Vuuren, Jan H.

    Diagonal Ramsey Numbers in Multipartite Graphs AP Burger , PJP Grobler , EH Stipp & JH van Vuuren September 17, 2003 Abstract The notion of a graph theoretic Ramsey number is generalised by assuming definition. Some small multipartite Ramsey numbers are found, while upper and lower bounds are established

  6. Induced Graph Ramsey Theory Marcus Schaefer

    E-Print Network [OSTI]

    Schaefer, Marcus

    Induced Graph Ramsey Theory Marcus Schaefer School of CTI DePaul University 243 South Wabash Avenue for all graphs, and good upper bounds on induced Ramsey numbers in general, and for particular families (path on four vertices). The proof is a standard Ramsey theory argu­ ment: fix one vertex u of the K 5

  7. Diagonal Ramsey Numbers in Multipartite Graphs

    E-Print Network [OSTI]

    van Vuuren, Jan H.

    Diagonal Ramsey Numbers in Multipartite Graphs AP Burger + , PJP Grobler # , EH Stipp # & JH van Vuuren # September 17, 2003 Abstract The notion of a graph theoretic Ramsey number is generalised as in the classical definition. Some small multipartite Ramsey numbers are found, while upper and lower bounds

  8. DISTRIBUTED PLANNING THROUGH GRAPH MERGING Damien Pellier

    E-Print Network [OSTI]

    Pellier, Damien

    DISTRIBUTED PLANNING THROUGH GRAPH MERGING Damien Pellier Universit¬īe Paris Descartes, Laboratoire.pellier@parisdescartes.fr Keywords: distributed problem solving, cooperation, coordination, multi-agent planning, planning graphs technics. Abstract: In this paper, we introduce a generic and fresh model for distributed planning called

  9. On the spectra of simplicial rook graphs

    E-Print Network [OSTI]

    Martin, Jeremy L.; Wagner, Jennifer D.

    2014-05-05

    The \\emph{simplicial rook graph} $\\SR(d,n)$ is the graph whose vertices are the lattice points in the $n$th dilate of the standard simplex in $\\mathbb{R}^d$, with two vertices adjacent if they differ in exactly two coordinates. We prove...

  10. Small Alliances in Graphs Rodolfo Carvajal1

    E-Print Network [OSTI]

    Rapaport, IvŠn

    Small Alliances in Graphs Rodolfo Carvajal1 , Martīin Matamala1,2 , Ivan Rapaport1,2 , and Nicolas is a (strong defensive) alliance of G if every node in S has at least as many neighbors in S than in V \\S typically belong to small alliances. Despite the fact that finding the smallest alliance in a graph is NP

  11. ACL HLT 2011 TextGraphs-6

    E-Print Network [OSTI]

    Proceedings of the Workshop 23 June, 2011 Portland, Oregon, USA #12;Production and Manufacturing by Omnipress of related graph-based methods. This workshop series is aimed at fostering an exchange of ideas, thanks also to the special theme of this year in the area of machine learning, i.e. Graphs in Structured

  12. 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 Fuels DataEnergy Webinar:IAbout Us| DepartmentFunds Recipients |Databases

  13. Noiseless Database Privacy Raghav Bhaskar

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Noiseless Database Privacy Raghav Bhaskar Microsoft Research India rbhaskar@microsoft.com Abhishek as a gold standard in the field of database privacy. While this notion has the benefit of providing concrete explore is to exploit the entropy already present in the database and substitute that in the place

  14. ARTI Refrigerant Database

    SciTech Connect (OSTI)

    Cain, J.M. , Great Falls, VA )

    1993-04-30

    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.

  15. Graph Mining Meets the Semantic Web

    SciTech Connect (OSTI)

    Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Lim, Seung-Hwan [ORNL

    2015-01-01

    The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.

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

    SciTech Connect (OSTI)

    NONE

    1996-04-01

    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.

  17. Using Delay to Defend Against Database Extraction

    E-Print Network [OSTI]

    Cafarella, Michael J.

    a business in competition. This attacker could attempt to hack into the provider's system ≠ such attacks, the "crown jewels" of their business are the data that they have organized. If someone could copy their entire database, it would be a competitive catastrophe. Yet, a data provider is in the business

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

  19. PDS: A Performance Database Server

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

    Berry, Michael W.; Dongarra, Jack J.; Larose, Brian H.; Letsche, Todd A.

    1994-01-01

    The process of gathering, archiving, and distributing computer benchmark data is a cumbersome task usually performed by computer users and vendors with little coordination. Most important, there is no publicly available central depository of performance data for all ranges of machines from personal computers to supercomputers. We present an Internet-accessible performance database server (PDS) that can be used to extract current benchmark data and literature. As an extension to the X-Windows-based user interface (Xnetlib) to the Netlib archival system, PDS provides an on-line catalog of public domain computer benchmarks such as the LINPACK benchmark, Perfect benchmarks, and the NAS parallelmore†Ľbenchmarks. PDS does not reformat or present the benchmark data in any way that conflicts with the original methodology of any particular benchmark; it is thereby devoid of any subjective interpretations of machine performance. We believe that all branches (research laboratories, academia, and industry) of the general computing community can use this facility to archive performance metrics and make them readily available to the public. PDS can provide a more manageable approach to the development and support of a large dynamic database of published performance metrics.ę†less

  20. The Dartmouth Stellar Evolution Database

    E-Print Network [OSTI]

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

    2008-04-28

    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.

  1. Construction of file database management

    SciTech Connect (OSTI)

    MERRILL,KYLE J.

    2000-03-01

    This work created a database for tracking data analysis files from multiple lab techniques and equipment stored on a central file server. Experimental details appropriate for each file type are pulled from the file header and stored in a searchable database. The database also stores specific location and self-directory structure for each data file. Queries can be run on the database according to file type, sample type or other experimental parameters. The database was constructed in Microsoft Access and Visual Basic was used for extraction of information from the file header.

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

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

  4. Periscope/SQ: Interactive Exploration of Biological Sequence Databases

    E-Print Network [OSTI]

    Cafarella, Michael J.

    Periscope/SQ: Interactive Exploration of Biological Sequence Databases Sandeep Tata Willis Lang to optimized declarative tech- niques. We have designed and implemented a system called Periscope/SQ that makes of database-style query optimization. As a result, queries in Periscope/SQ run orders of magnitude faster than

  5. March 23, 2008 Databases: SQL 1 Structured Query Language -SQL

    E-Print Network [OSTI]

    Adam, Salah

    , 2008 Databases: SQL 5 - Introduction Objectives of SQL + History of SQL + Importance of SQL;March 23, 2008 Databases: SQL 9 -- History of SQL ... In 1974, D. Chamberlin (IBM San Jose Laboratory-quel', though official pronunciation is 's-q-l'. IBM subsequently produced a prototype DBMS called System R

  6. Smart Services for Ad Hoc Databases University of Washington

    E-Print Network [OSTI]

    Matrajt, Graciela

    data-base from lists of addresses of nearby schools, locations of resources (e.g., ambulances), and contact information for emergency workers. ∑ A consulting business analyst assembles an ad hoc data- base of commercial database management systems are prohibitive, especially without access to dedicated IT staff

  7. The PRISM Workwench: Database Schema Evolution Without Tears

    E-Print Network [OSTI]

    Zaniolo, Carlo

    The PRISM Workwench: Database Schema Evolution Without Tears Carlo A. Curino #1 , Hyun J. Moon 2 to a perpetual evolution, which is particularly pressing in Web Information Systems, due to their distributed of the intrinsic complexity of the task and the serious ramifications of such changes upon database

  8. Handling Database Updates in Two-dimensional Temporal Logic

    E-Print Network [OSTI]

    Finger, Marcelo

    Handling Database Updates in Two-dimensional Temporal Logic Marcelo Finger y Department (Draft version 0.2) Abstract This paper deals with the description of the evolution of the understanding in database systems due to updates. For this purpose, we introduce a two-dimensional temporal logic

  9. Mining Views: Database Views for Data Mining Hendrik Blockeel1

    E-Print Network [OSTI]

    Antwerpen, Universiteit

    Mining Views: Database Views for Data Mining Hendrik Blockeel1 , Toon Calders2 , Elisa Fromont1 model towards the inte- gration of data mining into relational database systems, based on the so called virtual mining views. We show that several types of patterns and models over the data, such as itemsets

  10. Master Thesis Design and Implementation of a Database for Recipes

    E-Print Network [OSTI]

    Master Thesis Design and Implementation of a Database for Recipes November 2004 LinLin Wang (s to establish a structural semantic-oriented web. This project takes the recipe storage system as an example a database for recipes and to fill it with some data. During the project, I designed and implemented two

  11. Development and use of databases for ligand-protein interaction studies†

    E-Print Network [OSTI]

    Hsin, Kun-Yi

    2010-01-01

    This project applies structure-activity relationship (SAR), structure-based and database mining approaches to study ligand-protein interactions. To support these studies, we have developed a relational database system ...

  12. A Principled Framework for Constructing Natural Language Interfaces to Temporal Databases

    E-Print Network [OSTI]

    Androutsopoulos, Ioannis

    Most existing natural language interfaces to databases (Nlidbs) were designed to be used with snapshot database systems, that provide very limited facilities for manipulating time-dependent data. Consequently, most Nlidbs ...

  13. 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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room News Publications Traditional Knowledge Kiosks Barrow, AlaskaDatabaseSearchTips Publications

  14. Gasification Plant 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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration would likeUniverse (Journal Article)ForthcomingGENERALProblems I n QEstimatesPlant Databases

  15. Department of Psychology, University of Melbourne Introduction to graph theory

    E-Print Network [OSTI]

    ©Department of Psychology, University of Melbourne Introduction to graph theory Graphs Size and weak components Centrality for directed graphs Some special directed graphs ©Department of Psychology,6),(6,7)} 4 5 6 7 #12;©Department of Psychology, University of Melbourne Size and order The size of G

  16. Minimal comparability completions of arbitrary graphs Pinar Heggernes

    E-Print Network [OSTI]

    Heggernes, Pinar

    Minimal comparability completions of arbitrary graphs Pinar Heggernes Federico Mancini Charis for which completion of arbitrary graphs can be achieved through such a vertex incremental approach. 1 to an arbitrary graph is called a comparability completion of the input graph. Unfortunately, computing

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

  18. DIMACS Technical Report 200337 Perfect interval filament graphs

    E-Print Network [OSTI]

    DIMACS Technical Report 2003≠37 Perfect interval filament graphs by Fanica GAVRIL 1 DIMACS, Rutgers are disjoint, their curves do not intersect; FI={ f i | iőI} is a family of interval filaments and its intersection graph is an interval filament graph. The interval filament graphs contain the polygon

  19. What Energy Functions Can Be Minimized via Graph Cuts?

    E-Print Network [OSTI]

    Field, David

    What Energy Functions Can Be Minimized via Graph Cuts? Vladimir Kolmogorov, Member, IEEE, and Ramin been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph

  20. Information inequalities and Generalized Graph Entropies

    E-Print Network [OSTI]

    Sivakumar, Lavanya

    2012-01-01

    In this article, we discuss the problem of establishing relations between information measures assessed for network structures. Two types of entropy based measures namely, the Shannon entropy and its generalization, the R\\'{e}nyi entropy have been considered for this study. Our main results involve establishing formal relationship, in the form of implicit inequalities, between these two kinds of measures when defined for graphs. Further, we also state and prove inequalities connecting the classical partition-based graph entropies and the functional-based entropy measures. In addition, several explicit inequalities are derived for special classes of graphs.

  1. Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures

    E-Print Network [OSTI]

    Catalyurek, Umit; Gebremedhin, Assefaw; Halappanavar, Mahantesh; Pothen, Alex

    2012-01-01

    We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and high-performance computing, distance-1 graph coloring. We introduce two different kinds of multithreaded heuristic algorithms for the stated, NP-hard, problem. The first algorithm relies on speculation and iteration, and is suitable for any shared-memory system. The second algorithm uses dataflow principles, and is targeted at the non-conventional, massively multithreaded Cray XMT system. We study the performance of the algorithms on the Cray XMT and two multi-core systems, Sun Niagara 2 and Intel Nehalem. Together, the three systems represent a spectrum of multithreading capabilities and memory structure. As testbed, we use synthetically generated large-scale graphs carefully chosen to cover a wide range of input types. The results show that the algorithms have scalable runtime performance and use nearly the same number of colors as...

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

  3. Quantum Vacuum Energy in Graphs and Billiards

    E-Print Network [OSTI]

    L. Kaplan

    2011-01-03

    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.

  4. SCALABLE REACHABILITY INDEXING FOR VERY LARGE GRAPHS

    E-Print Network [OSTI]

    Zaki, Mohammed Javeed

    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 iii #12;3. GRAIL: Scalable Reachability Index for Large Graphs . . . . . . . . . . . . . 36 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 3.3 GRAIL Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 3.3.1 Index GRAIL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 4.1 Topological Level Filter

  5. Fault-tolerant dynamic task graph scheduling

    SciTech Connect (OSTI)

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

    2014-11-16

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

  6. On semidefinite programming bounds for graph bandwidth

    E-Print Network [OSTI]

    2011-05-24

    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.

  7. Projective representations from quantum enhanced graph symmetries

    E-Print Network [OSTI]

    2015-03-11

    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.

  8. Densities of Minor-Closed Graph Families

    E-Print Network [OSTI]

    Eppstein, David

    2010-01-01

    N. Robertson and P. D. Seymour. Graph Minors. XX. WagnerísChudnovsky, B. Reed, and P. Seymour. The edge-density for KReferences [1] N. Alon, P. Seymour, and R. Thomas. A

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

  10. Energy Citations Database (ECD) - About

    Office of Scientific and Technical Information (OSTI)

    About ECD The Energy Citations Database (1943 - Present) was developed by the U.S. Department of Energy (DOE) Office of Scientific and Technical Information (OSTI) to improve...

  11. Energy Citations Database (ECD) - Widget

    Office of Scientific and Technical Information (OSTI)

    Energy Citations Database Widget You can access key features from the Department of Energy's Office of Scientific and Technical Information (DOEOSTI) by downloading the Energy...

  12. Computerized Accident Incident Reporting System | Department...

    Office of Environmental Management (EM)

    Incident Reporting System Computerized Accident Incident Reporting System CAIRS Database The Computerized AccidentIncident Reporting System is a database used to collect and...

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

  14. Change Management in Heterogeneous Semistructured Databases (Demonstration Description) \\Lambda

    E-Print Network [OSTI]

    Chawathe, Sudarshan S.

    Change Management in Heterogeneous Semistructured Databases (Demonstration Description) \\Lambda the trigger should fire. At Stanford we are addressing the problem of change management in heterogeneous TDIFF CORE QSS Tsimmis Figure 1: Components of our change management system subscribers of changes

  15. Database Group, Georgia Tech Leo Mark 1DB Methodology

    E-Print Network [OSTI]

    Demurjian, Steven A.

    -)design ∑ Analysis ∑ Specification ∑ Design ∑ Implementation ∑ Testing ∑ Operation ∑ Maintenance Management Database-term maintenance ≠ few people; little turnover ≠ no critical resources ≠ small risk of failure ≠ small cost and tasks; scenarios; usage statistics; plans for the future system; relevant laws, constraints

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

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

  18. What is a Database? A DBMS? !A very large, integrated collection of data

    E-Print Network [OSTI]

    What is a Database? A DBMS? !A very large, integrated collection of data !Models real Database Management System (DBMS) is a software package designed to store and manage databases CS174A ­ security ­ concurrency DBMS Functionalities queries updates concurrency integrity constraints CS174A

  19. F1: A Distributed SQL Database That Scales Jeff Shute Radek Vingralek Bart Samwel Ben Handy

    E-Print Network [OSTI]

    Cortes, Corinna

    F1: A Distributed SQL Database That Scales Jeff Shute Radek Vingralek Bart Samwel Ben Handy Chad database that combines high availability, the scalability of NoSQL systems like Bigtable, and the consistency and us- ability of traditional SQL databases. F1 is built on Span- ner, which provides synchronous

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

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

  1. Noisy entanglement evolution for graph states

    E-Print Network [OSTI]

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

    2010-01-01

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

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

  3. On the Formal Verification of Embedded Software Using Multiway Decision Graphs

    E-Print Network [OSTI]

    Tahar, Sofiène

    . Recently attention has been given to the verification of embedded systems using formal methods and Claesen [10] suggested a methodology for modeling both the software and hardware of an embedded system1 On the Formal Verification of Embedded Software Using Multiway Decision Graphs Subhashini

  4. A Graph Theoretical Approach for Network Coding in Wireless Body Area Networks

    E-Print Network [OSTI]

    Byrne, Eimear; Marinkovic, Stevan; Popovici, Emanuel

    2011-01-01

    Modern medical wireless systems, such as wireless body area networks (WBANs), are applications of wireless networks that can be used as a tool of data transmission between patients and doctors. Accuracy of data transmission is an important requirement for such systems. In this paper, we will propose a WBAN which is robust against erasures and describe its properties using graph theoretic techniques.

  5. Wind turbine reliability database update.

    SciTech Connect (OSTI)

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

    2009-03-01

    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.

  6. Random key graphs can have many more triangles than Erdos-Renyi graphs

    E-Print Network [OSTI]

    Yagan, Osman

    , and in the First Workshop on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks (GRAPH-HOC 2009), Chennai (India), December 2009. O. Yagan was with the Department of Electrical and Computer is now with Department of Electrical and Computer Engineering and CyLab, Carnegie Mellon University

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

  8. Graph-Theoretic Generation of Assembly Plans Part I: Correct Generation of Precedence Graphs

    E-Print Network [OSTI]

    Wu, David

    1 Graph-Theoretic Generation of Assembly Plans Part I: Correct Generation of Precedence Graphs Lehigh University Bethlehem, Pennsylvania Abstract Automatic generation and selection of assembly plans is a problem of great practical importance with many significant cost implications. In this paper, we focus

  9. U.S. LIFE CYCLE INVENTORY DATABASE Goals of the U.S. LCI Database Project

    E-Print Network [OSTI]

    ) provides a holistic evaluation meth- odology and a consistent framework for making better- informed- ingful results. The U.S. LCI Database (www.nrel.gov/ lci) was initiated in 2003 to fulfill the need, product purchases, process performance, and educa- tion systems. The use of LCA for product and service

  10. Scalable Database Access Technologies for ATLAS Distributed Computing

    E-Print Network [OSTI]

    A. Vaniachine; for the ATLAS Collaboration

    2009-10-02

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

  12. Documentation for database.txt Description

    E-Print Network [OSTI]

    Gilchrist, Michael A.

    Documentation for database.txt Description: The file database.txtis a 163MB file which contains a pair-wise list of all the proteins seen in the TAP and HMS-PCI databases as well as the MIPS Complex-wise association. See Gilchrist et al. (2003) for more details. About database.txt: The database is available

  13. Cascading Power Outages Propagate Locally in an Influence Graph that is not the Actual Grid Topology

    E-Print Network [OSTI]

    Hines, Paul D H; Rezaei, Pooya

    2015-01-01

    In a cascading power transmission outage, component outages propagate non-locally; after one component outages, the next failure may be very distant, both topologically and geographically. As a result, simple models of topological contagion do not accurately represent the propagation of cascades in power systems. However, cascading power outages do follow patterns, some of which are useful in understanding and reducing blackout risk. This paper describes a method by which the data from many cascading failure simulations can be transformed into a graph-based model of influences that provides actionable information about the many ways that cascades propagate in a particular system. The resulting "influence graph" model is Markovian, since component outage probabilities depend only on the outages that occurred in the prior generation. To validate the model we compare the distribution of cascade sizes resulting from n-2 contingencies in a 2896 branch test case to cascade sizes in the influence graph. The two dist...

  14. Synthetic graph generation for data-intensive HPC benchmarking: Scalability, analysis and real-world application

    SciTech Connect (OSTI)

    Powers, Sarah S.; Lothian, Joshua

    2014-12-01

    The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allows the emulation of a broad spectrum of application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report described the in-depth analysis of the generated synthetic graphs' properties at a variety of scales using different generator implementations and examines their applicability to replicating real world datasets.

  15. Meteorological database for the United States

    E-Print Network [OSTI]

    Apte, M.G.

    2011-01-01

    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

  16. Unit †045 - Non-Spatial Database Models

    E-Print Network [OSTI]

    045, CC in GIScience; Meyer, Thomas H.

    2000-01-01

    25 Unit 045 - Non-Spatial Database Models Core Curriculum -26 Unit 045 - Non-Spatial Database Models Core Curriculum -27 Unit 045 - Non-Spatial Database Models Core Curriculum -

  17. Unit 11 - Spatial Objects and Database Models

    E-Print Network [OSTI]

    Unit 11, CC in GIS; Nyerges, Timothy L.

    1990-01-01

    Spatial Objects and Database Models NCGIA Core Curriculum inSpatial Objects and Database Models NCGIA Core Curriculum inSpatial Objects and Database Models NCGIA Core Curriculum in

  18. Updating Disjunctive Databases via Model Trees

    E-Print Network [OSTI]

    Gryz, Jarek

    Updating Disjunctive Databases via Model the update problem for disjunctive databases represented by model trees. The concept of a model tree was introduced in [4] to provide a compact representation for disjunctive databases in terms of minimal models

  19. Concurrency control in a fully replicated database environment†

    E-Print Network [OSTI]

    Nath, Rajivendra

    1992-01-01

    FOR SIMULATION DRIVER 40 B C CODE FOR PARTITION TOKEN ALGORITHM 69 C C CODE FOR PRIMARY COPY ALGORITHM 77 D C CODE FOR MAJORITY CONSENSUS ALGORITHM 82 VITA 93 v in LIST OF FIGURES FIGURE Page 1 Phases of pessimistic concurrency control 2 Phases... maintaining the facade that there is only one copy of the database [2]. A fully replicated database is where all the sites contain copies of all the data items. The replicated database systems provide other advantages: the increased number of copies...

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

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

  2. On the topology of graph picture spaces

    E-Print Network [OSTI]

    Martin, Jeremy L.

    2005-03-01

    V and edges E. The d-dimensional picture space Xd(G) is de ned as the projective algebraic set whose points are pictures of G in complex projective d-space Pd = PdC. A picture P consists of a point P(v) 2 Pd for each vertex v of G and a line P...(e) for each edge e, subject to the conditions P(v) 2 P(e) whenever v is an endpoint of e. Two fundamental operations of graph theory are deletion and contraction: given a graph G and an edge e, we may delete e to form a graph G e, or identify the end- points...

  3. MadGraph 5 : Going Beyond

    E-Print Network [OSTI]

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

    2011-06-02

    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.

  4. Oracle Database DBFS Hierarchical Storage Overview

    SciTech Connect (OSTI)

    Rivenes, A

    2011-07-25

    The National Ignition Facility (NIF) at the Lawrence Livermore National Laboratory creates large numbers of images during each shot cycle for the analysis of optics, target inspection and target diagnostics. These images must be readily accessible once they are created and available for the 30 year lifetime of the facility. The Livermore Computing Center (LC) runs a High Performance Storage System (HPSS) that is capable of storing NIF's estimated 1 petabyte of diagnostic images at a fraction of what it would cost NIF to operate its own automated tape library. With Oracle 11g Release 2 database, it is now possible to create an application transparent, hierarchical storage system using the LC's HPSS. Using the Oracle DBMS-LOB and DBMS-DBFS-HS packages a SecureFile LOB can now be archived to storage outside of the database and accessed seamlessly through a DBFS 'link'. NIF has chosen to use this technology to implement a hierarchical store for its image based SecureFile LOBs. Using a modified external store and DBFS links, files are written to and read from a disk 'staging area' using Oracle's backup utility. Database external procedure calls invoke OS based scripts to manage a staging area and the transfer of the backup files between the staging area and the Lab's HPSS.

  5. Introducing a New SectionóDatabases

    E-Print Network [OSTI]

    Turchin, Peter

    2012-01-01

    Historical Database of Sociocultural Evolution, described inand database papers, Cliodynamics continues the publication of book reviews and review essays, as well as special features from the Social Evolution

  6. Fire Protection Database | Department of Energy

    Office of Environmental Management (EM)

    Fire Protection Database Fire Protection Database DOE O 231.1, Environment, Safety, And Health Reporting, requires the submission of an Annual Fire Protection Summary. The previous...

  7. National Residential Efficiency Measures Database - Building...

    Energy Savers [EERE]

    National Residential Efficiency Measures Database - Building America Top Innovation National Residential Efficiency Measures Database - Building America Top Innovation Image of a...

  8. Westlaw China Westlaw China English Database

    E-Print Network [OSTI]

    Po, Lai-Man

    Guide 3 Steps: 1. Enter search term(s) into the search box. 2. Choose databases by checking............................................................................................................................................................... 2 Cross-Database Search ........................................................................................................................................ 3 Search and Browse

  9. A thermodynamic database for new generation nuclear fuels Bertrand CHEYNET, Evelyne FISCHER

    E-Print Network [OSTI]

    Boyer, Edmond

    - consistent database designed for thermochemical equilibria calculation codes, specially developed for new, enthalpies of mixing, heat capacities, etc. When a published assessment was available for a particular system

  10. ON HIGHLY RAMSEY INFINITE GRAPHS M. H. SIGGERS

    E-Print Network [OSTI]

    Siggers, Mark H.

    ON HIGHLY RAMSEY INFINITE GRAPHS M. H. SIGGERS Abstract. We show that, for k 3, there exists that are 2-ramsey-minimal for the odd cycle C2k+1. 1. Introduction A graph G is r-ramsey for a graph H if any r-colouring of the edges of G yields a monochromatic copy of the graph H. G is r-ramsey

  11. A Note on Ramsey Size-Linear Graphs

    E-Print Network [OSTI]

    Simonovits, Miklós

    A Note on Ramsey Size-Linear Graphs P.N. Balister,1 R.H. Schelp,1 and M. Simonovits1,2 1 DEPARTMENT is a Ramsey size-linear graph and x,y 2 V(G ) then if we add a sufficiently long path between x and y we obtain a new Ramsey size-linear graph. As a consequence we show that if G is any graph such that every

  12. Evaluating Graph Coloring on Pascal Grosset, Peihong Zhu, Shusen Liu,

    E-Print Network [OSTI]

    Hall, Mary W.

    any relevant related works for graph coloring on GPUs ∑ Main inspiration: o Gebremedhin and Manne o (G

  13. 1st Graph Searching in Canada (GRASCan) Workshop

    E-Print Network [OSTI]

    Bonato, Anthony

    Fitzpatrick, University of Prince Edward Island Cops and Robber on Circulant Graphs 11:30 - 12:00 Kieka

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

  15. Energy Citations Database (ECD) - Comments

    Office of Scientific and Technical Information (OSTI)

    Contact Us If you have a question about Energy Citations Database, we recommend you check frequently asked questions. If your question still has not been answered or if you wish to...

  16. REQUEST FOR PROPOSALS GEOTECHNICAL DATABASE DEVELOPMENT, PHASE 3

    E-Print Network [OSTI]

    Harms, Kyle E.

    of existing and future geotechnical data. Other Phase 2 features included a web-based system to access deep Pavement Management Systems (PMS) Section, for the districts to upload boring and core data (thickness in a PMS database called Deighton Total Infrastructure Management System (dTIMS). dTIMS is a data

  17. EZPIX: a tablet entry method for computer-generated slides, drawings, and graphs

    SciTech Connect (OSTI)

    Williams, J.M.

    1984-09-01

    This manual outlines a method for making slides, drawings, maps, graphs, etc., with the touch of a button. A minicomputer-based program, called EZPIX, connects the host computer graphics system to a tablet on which one can digitize input and specify graphics commands from a menu. A minicomputer terminal serves as editor and provides local graphics output. The magic button does practically everything else. It signs you on, starts, builds, ends, executes and saves your command file, and signs you off. It even allows you to make a composite picture from an assortment of inappropriately sized originals. The graph and pie chart modes are handy, too.

  18. VACUUM ENERGY IN QUANTUM GRAPHS A Senior Honors Thesis

    E-Print Network [OSTI]

    VACUUM ENERGY IN QUANTUM GRAPHS A Senior Honors Thesis by JUSTIN HOWARD WILSON Submitted ABSTRACT Vacuum Energy in Quantum Graphs. (April 2007) Justin Howard Wilson Department of Physics the vacuum energy in quantum graphs. Vacuum energy arose in quantum physics but has an independent

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

  20. Realization of some local unitary operations by graph switching

    E-Print Network [OSTI]

    Supriyo Dutta; Bibhas Adhikari; Subhashish Banerjee

    2015-02-27

    In this work we implement a graph theoretical realization of local unitary transformations, implemented by single qubit Pauli gates, by adapting techniques of graph switching. This leads to the concept of local unitary equivalent graphs. We illustrate our method by a few, well known, local unitary transformations implemented by single qubit Pauli and Hadamard gates.

  1. The case against specialized graph analytics engines University of Wisconsin

    E-Print Network [OSTI]

    Willett, Rebecca

    the performance perspec- tive. We present Grail ≠ a syntactic layer for querying graph in a vertex-centric way compare Grail to GraphLab and Giraph, and examine the performance implications of using Grail, showing.e. Grail) that presents such a syntactic mapping layer. We present how graph analytics queries using

  2. GRAIL: Scalable Reachability Index for Large Graphs Hilmi Yildirim

    E-Print Network [OSTI]

    Zaki, Mohammed Javeed

    GRAIL: Scalable Reachability Index for Large Graphs Hilmi Yildirim Rensselaer Polytechnic large real-world graphs. We present a very simple, but scalable reachability index, called GRAIL on small graphs, GRAIL is the only index that can scale to millions of nodes and edges. GRAIL has linear

  3. Making arbitrary graphs transitively orientable: Minimal comparability completions

    E-Print Network [OSTI]

    Papadopoulos, Charis

    Making arbitrary graphs transitively orientable: Minimal comparability completions Pinar Heggernes to an arbitrary graph is called a comparability completion of the input graph. Unfortunately, computing a comparability completion with the minimum number of added edges (called a minimum completion) is an NP

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

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

  6. Multivariate Graphs in Software Engineering and A. Telea2

    E-Print Network [OSTI]

    Telea, Alexandru C.

    Multivariate Graphs in Software Engineering S. Diehl1 and A. Telea2 1 Department of Computer, the Netherlands Abstract. Multivariate networks, or graphs, are an essential element of various activities. In this chapter, we present the specific context in which multivariate graphs occur in software engineering

  7. Cellular Algebras and Graph Invariants Based on Quantum Walks

    E-Print Network [OSTI]

    Jamie Smith

    2011-03-01

    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.

  8. On Sum--Connectivity Index of Bicyclic Graphs

    E-Print Network [OSTI]

    Du, Zhibin

    2009-01-01

    We determine the minimum sum--connectivity index of bicyclic graphs with $n$ vertices and matching number $m$, where $2\\le m\\le \\lfloor\\frac{n}{2}\\rfloor$, the minimum and the second minimum, as well as the maximum and the second maximum sum--connectivity indices of bicyclic graphs with $n\\ge 5$ vertices. The extremal graphs are characterized.

  9. Bicycles and Left-Right Tours in Locally Finite Graphs

    E-Print Network [OSTI]

    Diestel, Reinhard

    Bicycles and Left-Right Tours in Locally Finite Graphs von Melanie Win Myint, M. S. Dem Department-Right Tours 29 6 LRTs Generate the Bicycle Space 43 7 The ABL Planarity Criterion 53 8 Pedestrian Graphs 69 bicycles and some other concepts they relate to, such as left- right tours and pedestrian graphs

  10. Large Mesh Deformation Using the Volumetric Graph Laplacian

    E-Print Network [OSTI]

    Kazhdan, Michael

    Large Mesh Deformation Using the Volumetric Graph Laplacian Kun Zhou1 Jin Huang2 John Snyder3 Related Work Deformation on Volumetric Graphs Deformation from 2D curves Results Conclusions #12;11/21/2007 Bhaskar Kishore 3 Outline Introduction Related Work Deformation on Volumetric Graphs Deformation from

  11. Large-scale inference and graph theoretical analysis of gene-regulatory networks in B. stubtilis

    E-Print Network [OSTI]

    C. Christensen; A. Gupta; C. D. Maranas; R. Albert

    2006-07-18

    We present the methods and results of a two-stage modeling process that generates candidate gene-regulatory networks of the bacterium B. subtilis from experimentally obtained, yet mathematically underdetermined microchip array data. By employing a computational, linear correlative procedure to generate these networks, and by analyzing the networks from a graph theoretical perspective, we are able to verify the biological viability of our inferred networks, and we demonstrate that our networks' graph theoretical properties are remarkably similar to those of other biological systems. In addition, by comparing our inferred networks to those of a previous, noisier implementation of the linear inference process [17], we are able to identify trends in graph theoretical behavior that occur both in our networks as well as in their perturbed counterparts. These commonalities in behavior at multiple levels of complexity allow us to ascertain the level of complexity to which our process is robust to noise.

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

  13. An Energy-efficient Concurrency Control Algorithm for Mobile Ad-hoc Network Databases

    E-Print Network [OSTI]

    Gruenwald, Le

    and applications [5]. Also battery technology is not developed as rapidly as mobile devices and wireless and battery- powered nodes, and every node can roam freely. A mobile database system built on a MANET is called a MANET database system. In this system, both clients and servers are mobile, wireless and battery

  14. A Metadata-Rich File System

    SciTech Connect (OSTI)

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

    2009-01-07

    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.

  15. VISSOFT'07 Submission Kagdi, Maletic Onion Graphs for Focus+Context Views of UML Class Diagrams

    E-Print Network [OSTI]

    Maletic, Jonathan I.

    VISSOFT'07 Submission Kagdi, Maletic Onion Graphs for Focus+Context Views of UML Class Diagrams+context technique for visualizing large UML class models. The focus area, which can be manually or automatically source project. 1. Introduction Developers find UML class models1 useful for designing systems along

  16. Erdos-Renyi random graphs + forest fires = self-organized criticality

    E-Print Network [OSTI]

    Balazs Rath; Balint Toth

    2009-08-26

    We modify the usual Erdos-Renyi random graph evolution by letting connected clusters 'burn down' (i.e. fall apart to disconnected single sites) due to a Poisson flow of lightnings. In a range of the intensity of rate of lightnings the system sticks to a permanent critical state.

  17. Erdos-Renyi random graphs + forest fires = self-organized criticality

    E-Print Network [OSTI]

    Rath, Balazs

    2008-01-01

    We modify the usual Erdos-Renyi random graph evolution by letting connected clusters 'burn down' (i.e. fall apart to disconnected single sites) due to a Poisson flow of lightnings. In a range of the intensity of rate of lightnings the system sticks to a permanent critical state.

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

    SciTech Connect (OSTI)

    Timothy R. Carr; Scott W. White

    2002-06-01

    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. An integration doubleheader: exploration system's finder, an application or open-ended database architecture for sale and landmark graphics' openworks, an open opinion

    SciTech Connect (OSTI)

    Leonard, J.E.

    1989-04-01

    Two software packages for the petroleum industry are reviewed. The first, Finder, is an integrated exploration and production system using the Oracle relational data base engine. It operates on a microVAX (DEC) platforms with the user interface on an Apple Macintosh. The second program, OpenWorks, will combine petroleum applications with data over existing ''industry standards'' including X-Windows for graphics, TCP/IP for the networking protocols, and some relation model which fits over existing data bases.

  20. M&Ms4Graphs: Multi-scale, Multi-dimensional Graph Analytics Tools for Cyber-Security

    E-Print Network [OSTI]

    M&Ms4Graphs: Multi-scale, Multi-dimensional Graph Analytics Tools for Cyber-Security Objective We-of-Networks Framework for Cyber Security." IEEE Intelligence and Security Informatics, 2013. 2. "Towards a Multiscale. "Statistical and Hierarchical Graph Analysis for Cyber Security." SIAM Conference on Discrete Mathematics

  1. CPM: A Graph Pattern Matching Kernel with Diffusion for Accurate Graph Classification

    E-Print Network [OSTI]

    Kansas, University of

    (the Molecular Library Initiative project) that aims to determine and publicize the biological activ chemical structure data sets and have compared our methods to all major graph kernel functions that we know

  2. Three Theorems Regarding Testing Graph Properties*

    E-Print Network [OSTI]

    Trevisan, Luca

    Three Theorems Regarding Testing Graph Properties* Oded Goldreich,1, Luca Trevisan2 1 Department-mail: luca@eecs.berkeley.edu Received 9 December 2001; accepted 18 September 2002 DOI 10.1002/rsa.10078 ABSTRACT: Property testing is a relaxation of decision problems in which it is required to distinguish YES

  3. Graph Coloring with Quantum Heuristics Alex Fabrikant

    E-Print Network [OSTI]

    Fabrikant, Alex

    empirically with small graphs near a phase transition in search performance. It im- proves on two prior and physical phase transitions [4, 23, 19], which has led to new heuristics for conventional machines [12, 8 a conventional machine eval- uates just one. Hence one might expect high performance for problems having a rapid

  4. Understanding Design Patterns with Design Rationale Graphs

    E-Print Network [OSTI]

    Baniassad, Elisa

    Understanding Design Patterns with Design Rationale Graphs Elisa Baniassad and Gail C. Murphy christa.schwanninger@mchp.siemens.de ABSTRACT A Design Pattern presents a proven solution to a common design problem using a combination of informal text, diagrams, and examples. Often, to suitably describe

  5. Parsimonious Flooding in Dynamic Graphs Herv Baumann

    E-Print Network [OSTI]

    Fondements et Applications, Universitť Paris 7

    Parsimonious Flooding in Dynamic Graphs Hervť Baumann University Paris Diderot herve bounds on their flooding time -- flooding is the basic mechanism in which every node becoming aware. In this paper, we establish tight bounds on the complexity of flooding for all possible birth rates and death

  6. Spectral statistics for scaling quantum graphs

    E-Print Network [OSTI]

    Yu. Dabaghian

    2006-08-09

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

  7. Expander Graph Arguments for Message Passing Algorithms

    E-Print Network [OSTI]

    Burshtein, David

    Expander Graph Arguments for Message Passing Algorithms David Burshtein and Gadi Miller Dept arguments may be used to prove that message passing algorithms can correct a linear number of erroneous a message passing algorithm has corrected a sufficiently large fraction of the errors, it will eventually

  8. Minimum Spanning Trees weighted graph API

    E-Print Network [OSTI]

    Wu, Xiaolin

    on the complete graph on V vertices. #12;4 MST Origin Otakar Boruvka (1926). ∑ Electrical Power Company of Western Moravia in Brno. ∑ Most economical construction of electrical power network. ∑ Concrete engineering;5 Applications MST is fundamental problem with diverse applications. ∑ Network design. telephone, electrical

  9. Atomic Representations of Rank 2 Graph Algebras

    E-Print Network [OSTI]

    Davidson, Ken

    Atomic Representations of Rank 2 Graph Algebras Kenneth R. Davidson a , Stephen C. Power b , Dilian University, Lancaster LA1 4YF, U.K. Abstract We provide a detailed analysis of atomic -representations- posed into a direct sum or direct integral of irreducible atomic representations. The building blocks

  10. Solving the Graph Isomorphism Problem with a Quantum Annealer

    E-Print Network [OSTI]

    Itay Hen; A. P. Young

    2012-08-08

    We propose a novel method using a quantum annealer -- an analog quantum computer based on the principles of quantum adiabatic evolution -- to solve the Graph Isomorphism problem, in which one has to determine whether two graphs are isomorphic (i.e., can be transformed into each other simply by a relabeling of the vertices). We demonstrate the capabilities of the method by analyzing several types of graph families, focusing on graphs with particularly high symmetry called strongly regular graphs (SRG's). We also show that our method is applicable, within certain limitations, to currently available quantum hardware such as "D-Wave One".

  11. Pollution Prevention Successes Database (P2SDb) user guide

    SciTech Connect (OSTI)

    1995-07-01

    When Pollution Prevention Opportunity Assessments (P2OAs) were launched at the Hanford Site during the summer of 1994, the first comment received from those using them expressed the desire for a method to report assessments electronically. As a temporary measure, macros were developed for use on word processing systems, but a more formal database was obviously needed. Additionally, increased DOE and Washington state reporting requirements for pollution prevention suggested that a database system would streamline the reporting process. The Pollution Prevention Group of Westinghouse Hanford Company (WHC) contracted with the Data Automation Engineering Department from ICF Kaiser Hanford Company (ICFKH) to develop the system. The scope was to develop a database that will track P2OAs conducted by the facilities and contractors at the Hanford Site. It will also track pollution prevention accomplishments that are not the result of P2OAs and document a portion of the Process Waste Assessments conducted in the past. To accommodate the above criteria, yet complete the system in a timely manner, the Pollution Prevention Successes Database (P2SDb) is being implemented in three phases. The first phase will automate the worksheets to provide both input and output of the data associated with the worksheets. The second phase will automate standard summary reports and ad hoc reports. The third phase will provide automated searching of the database to facilitate the sharing of pollution prevention experiences among various users. This User`s Guide addresses only the Phase 1 system.

  12. MINERVA DATABASE Guidelines for Managing Intercollegiate Classes

    E-Print Network [OSTI]

    MINERVA DATABASE Guidelines for Managing Intercollegiate Classes The database can be accessed at http://minerva.maths.ox.ac.uk/ Minerva is a shared database run by the department for tutors, TAs enter reports on the attendance and marks of their students into the database. This should be done after

  13. WMC Database Evaluation. Case Study Report

    SciTech Connect (OSTI)

    Palounek, Andrea P. T

    2015-10-29

    The WMC Database is ultimately envisioned to hold a collection of experimental data, design information, and information from computational models. This project was a first attempt at using the Database to access experimental data and extract information from it. This evaluation shows that the Database concept is sound and robust, and that the Database, once fully populated, should remain eminently usable for future researchers.

  14. Un survol de la domination de puissance dans les graphes Un survol de la domination de puissance

    E-Print Network [OSTI]

    Marckert, Jean-FranÁois

    Electrical system monitoring (with PMU) From Baldwin, Mili, Boisen, Adapa ( IEEE Trans. on Power Systems 8 domination Electrical system monitoring (with PMU) What is a PMU ? #12;Un survol de la domination de PMU) What is a PMU ? #12;Un survol de la domination de puissance dans les graphes Introduction

  15. Korean Classics Indexing Project Database Korean Classics Indexing Project Database is a

    E-Print Network [OSTI]

    Po, Lai-Man

    Korean Classics Indexing Project Database ∑ Korean Classics Indexing Project Database is a database written in Chinese ∑ The database serves as a discovery tool to support teaching, learning and research's works shows that the Korean Database can help promote not only the research of Korean studies, but also

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

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

  18. Database Classification by Hybrid Method combining Supervised and Unsupervised Learnings

    E-Print Network [OSTI]

    Avignon et des Pays de Vaucluse, Universitť de

    contained in unlabeled signals of a Geographic Information System (GIS), allow to well classify it. Finally : Minimerror, hybrid method, classification, un- supervised learning, Geographic Information System. I classifications. We applied this new approach to a real-world database in order to know if the information

  19. Discrete Mathematical Approaches to Graph-Based Traffic Analysis

    SciTech Connect (OSTI)

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

    2014-04-01

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

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

  1. Planning Through Stochastic Local Search and Temporal Action Graphs in LPG

    E-Print Network [OSTI]

    Gerevini, A; Serina, I; 10.1613/jair.1183

    2011-01-01

    We present some techniques for planning in domains specified with the recent standard language PDDL2.1, supporting 'durative actions' and numerical quantities. These techniques are implemented in LPG, a domain-independent planner that took part in the 3rd International Planning Competition (IPC). LPG is an incremental, any time system producing multi-criteria quality plans. The core of the system is based on a stochastic local search method and on a graph-based representation called 'Temporal Action Graphs' (TA-graphs). This paper focuses on temporal planning, introducing TA-graphs and proposing some techniques to guide the search in LPG using this representation. The experimental results of the 3rd IPC, as well as further results presented in this paper, show that our techniques can be very effective. Often LPG outperforms all other fully-automated planners of the 3rd IPC in terms of speed to derive a solution, or quality of the solutions that can be produced.

  2. The impact of master scheduling models on student performance as identified by the Academic Excellence Indicator System (AEIS) database in the high schools of the San Antonio Independent School District, San Antonio, Texas†

    E-Print Network [OSTI]

    Morgan, Scott Edwin

    2005-11-01

    This study determined the impact of master scheduling models on student performance as reported by the AEIS database in the high schools of the SAISD. General student performance and the Texas Assessment of Knowledge and Skills were the primary...

  3. Benefits of an International Database for UF6 Cylinders

    SciTech Connect (OSTI)

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

    2008-06-30

    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.

  4. Microbial Metabolism Databases of Microbial

    E-Print Network [OSTI]

    Huang, Ching-Tsan

    1 Microbial Metabolism Databases of Microbial Metabolism & Degradation Ching-Tsan Huang () Office://www.ebi.ac.uk/ http://umbbd.msi.umn.edu/index.html #12;9 http://umbbd.msi.umn.edu/meta/meta_map.html #12;10 Microbial, Energy, Lipids, Nucleotides, Amino acids, Glycans, Polyketides/Nonribosome peptides, Secondary

  5. Mobile Database Ouri Wolfson1

    E-Print Network [OSTI]

    Wolfson, Ouri E.

    that resides on a mobile device such as a PDA, a smart phone, or a laptop. Such devices are often limited in resources such as memory, computing power, and battery power. Key Points Due to device limitations, a mobile are usually posed by the user of the mobile device. Updates of the database may originate from the user

  6. Local semicircle law for random regular graphs

    E-Print Network [OSTI]

    Roland Bauerschmidt; Antti Knowles; Horng-Tzer Yau

    2015-05-26

    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.

  7. Approximating the minimum clique cover and other hard problems in subtree filament graphs

    E-Print Network [OSTI]

    Stewart, Lorna

    Approximating the minimum clique cover and other hard problems in subtree filament graphs J. Mark Keil Lorna Stewart March 20, 2006 Abstract Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament

  8. A Characterization of Seymour Graphs A. A. Ageev A. V. Kostochka Z. Szigeti y

    E-Print Network [OSTI]

    Ageev, Alexandr

    A Characterization of Seymour Graphs A. A. Ageev #3; A. V. Kostochka #3; Z. Szigeti y Abstract Following Gerards [1] we say that a connected undirected graph G is a Seymour graph if the maximum number). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour [4][5], Gerards [1

  9. Calibration of the MACHO Photometry Database

    E-Print Network [OSTI]

    C. Alcock; R. A. Allsman; D. R. Alves; T. S. Axelrod; A. C. Becker; D. P. Bennett; K. H. Cook; A. J. Drake; K. C. Freeman; K. Griest; M. J. Lehner; S. L. Marshall; D. Minniti; B. A. Peterson; M. R. Pratt; C. A. Nelson; P. J. Quinn; C. W. Stubbs; W. Sutherland; A. B. Tomaney; D. L. Welch

    1999-09-14

    The MACHO Project is a microlensing survey that monitors the brightnesses of 60 million stars in the Large Magellanic Cloud (LMC), Small Magellanic Cloud, and Galactic bulge. Our database presently contains about 80 billion photometric measurements, a significant fraction of all astronomical photometry. We describe the calibration of MACHO two-color photometry and transformation to the standard Kron-Cousins V and R system. Calibrated MACHO photometry may be properly compared with all other observations on the Kron-Cousins standard system, enhancing the astrophysical value of these data. For 9 million stars in the LMC bar, independent photometric measurements of 20,000 stars with V photometry with published photometric sequences and new Hubble Space Telescope observations shows agreement. The current calibration zero-point uncertainty for the remainder of the MACHO photometry database is estimated to be +- 0.10 mag in V or R and +-0.04 mag in (V-R). We describe the first application of calibrated MACHO photometry data: the construction of a color-magnitude diagram used to calculate our experimental sensitivity to detect microlensing in the LMC.

  10. Marine and Hydrokinetic (MHK) Databases and Systems

    SciTech Connect (OSTI)

    2015-01-01

    The online information resources included in this fact sheet were developed with support from the U.S. Department of Energy, and are designed to provide the public access to information pertaining to MHK technologies, projects, and research.

  11. Missing Information Database Systems Lecture 10

    E-Print Network [OSTI]

    Alechina, Natasha

    :NULLs in conditions · Salary > 15,000 evaluates to `unknown' on the last tuple ­ not included SELECT * FROM Employee Where Salary > 15,000 Employee Name Salary John 25,000 Mark 15,000 Anne 20,000 Chris NULL Name Salary John 25,000 Anne 20,000 #12;Missing Information SQL solution:NULLs in conditions · Salary > 15

  12. Missing Information Database Systems Lecture 10

    E-Print Network [OSTI]

    Alechina, Natasha

    :NULLs in conditions · Salary > 15,000 evaluates to `unknown' on the last tuple ­ not included SELECT * FROM Employee Where Salary > 15,000 Employee Name Salary John 25,000 Mark 15,000 Anne 20,000 Chris NULL Name Salary John 25,000 Anne 20,000 Missing Information SQL solution:NULLs in conditions · Salary > 15,000 OR Name

  13. Relational Database SQL: Querying the Relational DB

    E-Print Network [OSTI]

    Qiu, Weigang

    Standards and Dialects ISO SQL:2008 DBMS vendors offer their own extensions Oracle PostgreSQL MySQL Weigang: auto-completion and command history Weigang Qiu Relational Database & SQL #12;Relational Database SQL

  14. Proposal for a High Energy Nuclear Database

    E-Print Network [OSTI]

    Brown, David A.; Vogt, Ramona

    2005-01-01

    Proposal for a High Energy Nuclear Database XML documentsProposal for a High Energy Nuclear Database David A. Brown 1it requires the high-energy nuclear physics com- munityís ?

  15. Large induced forests in sparse graphs , Dhruv Mubayi

    E-Print Network [OSTI]

    Shamir, Ron

    (G) of G. Given a graph G, let NG(v) or simply N(v) denote the set of neighbors of vertex v. For sets

  16. On the Adequacy of Program Dependence Graphs for Representing Programs

    E-Print Network [OSTI]

    Reps, Thomas W.

    introduced by Kuck as an intermediate program representation well suited for performing optimizations are strongly equivalent. 1. Introduction Program dependence graphs were introduced by Kuck as an intermediate

  17. Computing the Stretch of an Embedded Graph Sergio Cabello

    E-Print Network [OSTI]

    Cabello, Sergio

    . GIG/11/E023. 1 #12;Here, len() denotes the number of edges in and a cycle is a closed walk in a graph

  18. ON THE GAUSS MAP OF MINIMAL GRAPHS Daoud Bshouty, Dept ...

    E-Print Network [OSTI]

    1910-70-82

    Technology, 3200 Haifa, Israel, and Allen Weitsman, Dept. of Mathematics, Purdue University, W. Lafayette, IN 47907. Abstract. We consider graphs of solutions†...

  19. Quasiperiodic graphs: structural design, scaling and entropic properties

    E-Print Network [OSTI]

    Bartolo Luque; Fernando J. Ballesteros; Ńngel M. NķŮez; Alberto Robledo

    2012-03-16

    A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions represented by the Farey tree is inherited by their associated graphs. We are able to establish, via Renormalization Group (RG) theory, the architecture of the quasiperiodic graphs produced by irrational winding numbers with pure periodic continued fraction. And finally, we demonstrate that the RG fixed-point degree distributions are recovered via optimization of a suitably defined graph entropy.

  20. Stochastic processes on graphs with cycles : geometric and variational approaches

    E-Print Network [OSTI]

    Wainwright, Martin J. (Martin James), 1973-

    2002-01-01

    Stochastic processes defined on graphs arise in a tremendous variety of fields, including statistical physics, signal processing, computer vision, artificial intelligence, and information theory. The formalism of graphical ...