text:
Office of Scientific and Technical Information
Implementing Graph Pattern Queries on a Relational Database
Science Conference Proceedings (OSTI)
When a graph database is implemented on top of a relational database, queries in the graph query language are translated into relational SQL queries. Graph pattern queries are an important feature of a graph query language. Translating graph pattern queries into single SQL statements results in very poor query performance. By taking into account the pattern query structure and generating multiple SQL statements, pattern query performance can be dramatically improved. The performance problems encountered with the single SQL statements generated for pattern queries reflects a problem in the SQL query planner and optimizer. Addressing this problem would allow relational databases to better support semantic graph databases. Relational database systems that provide good support for graph databases may also be more flexible platforms for data warehouses.
Kaplan, I L; Abdulla, G M; Brugger, S T; Kohn, S R
Graph Transformations in Relational Databases
E-Print Network (OSTI)
The theory of graph transformation [2] was originally developed as a generalization of Chomsky grammars from strings to graphs. Methods, techniques, and tools from the area of graph transformations have already been studied and applied in many fields of computer science such as formal language theory, pattern recognition and generation, compiler construction, software engineering, etc. Despite the large variety of existing graph transformation tools, the implementation of their graph transformation engine typically follows the same principle. In this respect, first a matching occurrence of the left-hand side (LHS) of the graph transformation rule is being found by some sophisticated graph pattern matching algorithm. Then the engine performs some local modifications to add or remove graph elements to the matching pattern, and the entire process starts all over again. Since graph pattern matching leads to the subgraph isomorphism problem that is known to be NPcomplete in general, this step is considered to be the most crucial in the overall performance of a graph transformation engine. Current tools (e.g., PROGRES [4]) use different efficient strategies for the graph pattern matching phase. However, I argue that the overall complexity of a graph transformation engine is not necessarily equal to the complexity of the graph pattern matching phase, especially for long transformation sequences.
Gergely Varr�
Effective Graph Clustering for Path Queries in Digital Map Databases
In this paper, we present an experimental evaluation of graph clustering strategies in terms of their effectiveness in optimizing I/O for path query processing in digital map databases. Clustering optimization is attractive because it does not incurs any run-time cost, and is complimentary to many of the existing techniques in path query optimization. We first propose a novel graph clustering technique, called Spatial Partition Clustering (SPC), that creates balanced partitions of links based on the spatial proximity of their origin nodes. We then select three alternative clustering techniques from the literature, namely two-way partitioning, approximately topological clustering, and random clustering, to compare their performance in path query processing with SPC. Experimental evaluation indicates that our SPC performs the best for the high-locality graphs (such as GIS maps), whereas the two-way partitioning approach performs the best for no-locality random graphs. 1 Introduction 1....
Yun-Wu Huang; Ning Jing; Elke A. Rundensteiner
StreamWorks - A system for Dynamic Graph Search
Acting on time-critical events by processing ever growing social media, news or cyber data streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Mining and searching for subgraph patterns in a continuous setting requires an efficient approach to incremental graph search. The goal of our work is to enable real-time search capabilities for graph databases. This demonstration will present a dynamic graph query system that leverages the structural and semantic characteristics of the underlying multi-relational graph.
Choudhury, Sutanay; Holder, Larry; Chin, George; Ray, Abhik; Beus, Sherman J.; Feo, John T.
Stochastic Graph Transformation Systems
In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To formalize, measure, and predict such properties, stochastic methods are required. ...
Reiko Heckel; Georgios Lajios; Sebastian Menge
Integrating databases and workflow systems
There has been an information explosion in fields of science such as high energy physics, astronomy, environmental sciences and biology. There is a critical need for automated systems to manage scientific applications and data. Database technology is ...
Srinath Shankar; Ameet Kini; David J. DeWitt; Jeffrey Naughton
Bond graph modeling of centrifugal compressor system
system, active surge control. A novel method of modeling centrifugal compression systems for surge control purposes by using bond graphs is presented. By using the bond graph method, we get a simple description of compression systems based on physical phenomena and it is straight forward to get the dynamic equations. It is demonstrated that several active surge control methods can be represented by the same bond graph. It is also shown how methods for active surge control can be classified using energy flow in terms of upstream energy injection or downstream energy dissipation. A model of a compression system with recycle flow is derived in this work. 1.
Nur Uddin; Jan Tommy Gravdahl
Bond Graph Modeling Of Variable Structure Systems
The problem of describing variable structure models in a compact, object--oriented fashion is revisited and analyzed from the perspective of bond graph modeling. Traditionally, bond graphs have always been used to describe continuous-- time physical processes with a fixed structure. Yet, this paper shall demonstrate that bond graphs are equally suitable to describe variable structure models as fixed structure models. Moreover, a bond graph description of variable structure models can teach us a lot about the essential properties of variable structure models, properties that are not easily visible when other modeling approaches are taken. The paper discusses issues related to causality reassignment and conditional index changes as a consequence of switching in a physical system. Keywords: Bond graphs, variable structure system, computational causality, conditional index change, switching, object--oriented modeling, Dymola. INTRODUCTION When the causality strokes were added to the forme...
Fran�ois E. Cellier; Martin Otter; Hilding Elmqvist
Methodical Construction of Database Management Systems
Although more and more database management systems are being developed, constructing such systems in an engineering fashion remains an open problem. An engineering attitude towards construction not only tells how to implement a database management system, but also tries to minimize construction time. Hence, the prime objective of an engineering-style construction approach is construction efficiency.
Andreas Geppert; Erlangung Der; Philosophischen Doktorwrde; Vorgelegt Der; Begutachtet Von; Den Herren; K. R. Dittrich; K. Bauknecht; Prof Dr; Prof Dr; Prof Dr; M. Glinz
An introduction to spatial database systems
We propose a definition of a spatial database system as a database system that offers spatial data types in its data model and query language, and supports spatial data types in its implementation, providing at least spatial indexing and spatial join ...
Ralf Hartmut G�ting
... C++). More information. Journal of Combinatorics dynamic surveys DS8 and DS9 are a bibliography and glossary of graphs. ...
Sharing of Nuclear Safety Information through Distributed Database Systems
SciTech Connect
This presentation discusses the sharing of nuclear safety information through distributed database systems.
Ley, H.
WESF Capsule and Encapsulation Database System (EDS) Configuration Document
Encapsulation Database System (EDS) developed contains information on each cesium and strontium capsule stored at WESF
On the cost of multilingualism in database systems
Database engines are well-designed for storing and processing text data based on Latin scripts. But in today's global village, databases should ideally support multilingual text data equally efficiently. While current database systems do support management ...
A. Kumaran; Jayant R. Haritsa
LHCb Conditions Database Operation Assistance Systems
The Conditions Database of the LHCb experiment (CondDB) provides versioned, time dependent geometry and conditions data for all LHCb data processing applications (simulation, high level trigger, reconstruction, analysis) in a heterogeneous computing environment ranging from user laptops to the HLT farm and the Grid. These different use cases impose front-end support for multiple database technologies (Oracle and SQLite are used). Sophisticated distribution tools are required to ensure timely and robust delivery of updates to all environments. The content of the database has to be managed to ensure that updates are internally consistent and externally compatible with multiple versions of the physics application software. In this paper we describe three systems that we have developed to address these issues: - an extension to the automatic content validation done by the �Oracle Streams� replication technology, to trap cases when the replication was unsuccessful; - an automated distribution process for the S...
Shapoval, Illya
A New Conceptual Graph Generated Algorithm for Semi-structured Databases
As the World Wide Web grows dramatically in recent years, there is increasing interest in semi-structured data on the web. Semi-structured data are usually represented in graph format, many graph schemas have then been proposed to extract schemas from ...
Kam-Fai Wong; Yat Fan Su; Dongqing Yang; Shiwei Tang
Interactive searching and visualization of patterns in attributed graphs
Searching for patterns in graphs and visualizing the search results is an active area of research with numerous applications. With the continual growth of database size, querying these databases often results in multiple solutions. Text-based systems ...
Pierre-Yves Koenig; Faraz Zaidi; Daniel Archambault
Enhancing graph production skills via programmed instruction: An experimental analysis of the effect of guided-practice on data-based graph production
A computer-based graphing simulator used tutorial modules to teach 61 undergraduate college students how to create cumulative graphs from sets of data. One group was required to complete the steps of constructing an appropriate graph within a computer-provided ... Keywords: Computer-based instruction, Graphing, Programmed instruction, Simulation
Darrel R. Davis
Efficient simulation of hybrid systems: A hybrid bond graph approach
Accurate and efficient simulations facilitate cost-effective design and analysis of large, complex, embedded systems, whose behaviors are typically hybrid, i.e. continuous behaviors interspersed with discrete mode changes. In this paper we present an ... Keywords: component-oriented modeling, dynamic causal assignment, hybrid bond graphs, modeling and simulation environments, simulation of hybrid systems
Indranil Roychoudhury; Matthew J Daigle; Gautam Biswas; Xenofon Koutsoukos
Query execution in column-oriented database systems
There are two obvious ways to map a two-dimension relational database table onto a one-dimensional storage interface: store the table row-by-row, or store the table column-by-column. Historically, database system implementations ...
Abadi, Daniel J
Testing Systems Database interface operation manual
A joint-service effort is under way to develop, evaluate, and field-test a Computerized Adaptive Testing version of the Armed Services Vocational Aptitude Battery (CAT-ASVAB). The CAT-ASVAB is being evaluated as a replacement for the Paper and Pencil ASVAB (P P-ASVAB), which is currently used for military personnel selection and classification. During the Score Equating Development (SED) phase of the evaluation, the CAT-ASVAB is being administered at a limited number of Military Entrance Processing Stations (MEPS). At these stations all examinees are given an operational P P-ASVAB; in addition, approximately one-third are given a nonoperational P P-ASVAB and two-thirds are given the CAT-ASVAB. Data are being transmitted from the MEPS to the Navy Personnel Research and Development Center (NPRDC) for analysis and storage in the Testing Systems Database. The Testing Systems Database (TSD) and its supporting programs reside on a minicomputer at the NPRDC's CAT-ASVAB Maintenance and Psychometric (CAMP) Facility in San Diego, California. The CAMP Facility supports the development, maintenance, and continuing improvement of the CAT-ASVAB testing program. The purpose of this Interface Operation Manual is to provide operating instructions for the TSD ''Interface,'' a system of menus and interactive screen displays that integrate the use of the TSD and its supporting programs. It is not the purpose of this manual to document in detail the general use of commercial or NPRDC-produced programs that are documented elsewhere. 34 figs.
Caplinger, J.T.; Olander, M.
Characterization analysis database system (CADS): A system overview
The CADS database is a standardized, quality-assured, and configuration-controlled data management system developed to assist in the task of characterizing the DOE surplus HEU material. Characterization of the surplus HEU inventory includes identifying the specific material; gathering existing data about the inventory; defining the processing steps that may be necessary to prepare the material for transfer to a blending site; and, ultimately, developing a range of the preliminary cost estimates for those processing steps. Characterization focuses on producing commercial reactor fuel as the final step in material disposition. Based on the project analysis results, the final determination will be made as to the viability of the disposition path for each particular item of HEU. The purpose of this document is to provide an informational overview of the CADS database, its evolution, and its current capabilities. This document describes the purpose of CADS, the system requirements it fulfills, the database structure, and the operational guidelines of the system.
Medical Multimedia and Multimodality Databases Systems Peter L. Stanchev
Medical Multimedia and Multimodality Databases Systems Peter L. Stanchev Kettering University, Michigan, 48202 USA firstname.lastname@example.com ABSTRACT In this paper we make a review of some medical for a project of building a medical multimedia and multimodality database system. The MEDIMAGE system
Stanchev, Peter
Testing systems database interface users manual
A joint-service effort is under way to develop, evaluate, and field-test a Computerized Adaptive Testing version of the Armed Services Vocational Aptitude Battery (CAT-ASVAB). The CAT-ASVAB is being evaluated as a replacement for the Paper and Pencil ASVAB (P P-ASVAB), which is currently used for military personnel selection and classification. During the Score Equating Development (SED) phase of the evaluation, the CAT-ASVAB is being administered at a limited number of Military Entrance Processing Stations (MEPS). At these stations all examinees are given a P P operational ASVAB; in addition, approximately one-third are given a P P non-operational ASVAB and two-thirds are given the CAT-ASVAB. Data are being transmitted from the MEPS to the CAT-ASVAB Maintenance and Psychometric (CAMP) Facility for analysis and storage. The CAMP Facility supports the development, maintenance, and continuing improvement of the CAT-ASVAB testing program. The Pacific Northwest Laboratory (PNL) was contracted by the Navy Personnel and Development Center (NPRDC) to provide software for enhancing the NPRDC CAMP facility. The objective of this Users Manual is to provide an overview of the Testing Systems Database (TSD) Interface, which is designed to support the transfer, quality assurance, analysis, and maintenance of data pertaining to the evaluation of the CAT-ASVAB. This document provides the general management and personnel who are not automated data processing staff with the information necessary to understand the system.
Olander, M.
Motion graphs
In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a motion graph that encapsulates connections among the database. The ... Keywords: animation with constraints, motion capture, motion synthesis
Lucas Kovar; Michael Gleicher; Fr�d�ric Pighin
The MPEG-7 Multimedia Database System (MPEG-7 MMDB)
Broadly used Database Management Systems (DBMS) propose multimedia extensions, like Oracle's Multimedia (formerly interMedia). However, these extensions lack means for managing the requirements of multimedia data in terms of semantic meaningful querying, ... Keywords: MPEG-7, Multimedia Database Systems, Multimedia index structures
Mario D�ller; Harald Kosch
Proof graphs for parameterised boolean equation systems
Parameterised Boolean equation systems (PBESs) can be used for solving a variety of verification problems such as model checking and equivalence checking problems. The definition of solution for a PBES is notoriously difficult to understand, which makes ...
Sjoerd Cranen, Bas Luttik, Tim A. C. Willemse
Using MySQL and JDBC in new teaching methods for undergraduate database systems courses
This paper describes how the open source database software MySQL and Java Database Connectivity (JDBC) are used in new teaching methods for undergraduate Database Systems courses. Traditionally, the content of these courses include database design and ... Keywords: Java database connectivity, MySQL, query tree, relational algebra, undergraduate database systems course
Anil L. Pereira; Mehdi Raoufi; Jerrod C. Frost
Improving accessibility to statistical graphs: the iGraph-Lite system
Information is often presented in graphical form. Unfortunately, current assistive technologies such as screen readers are not well-equipped to handle these representations. To provide accessibility to graphs published in ``The Daily" (Statistics Canada's ... Keywords: accessibility (blind and visually impaired), natural language interaction, statistical graphs
Leo Ferres; Petro Verkhogliad; Gitte Lindgaard; Louis Boucher; Antoine Chretien; Martin Lachance
DOE technology information management system database study report
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.
Widing, M.A.; Blodgett, D.W.; Braun, M.D.; Jusko, M.J.; Keisler, J.M.; Love, R.J.; Robinson, G.L. [Argonne National Lab., IL (United States). Decision and Information Sciences Div.
Supporting match joins in relational database management systems
As more and more diverse applications seek to use database management systems (DBMS) as their primary storage, the question frequently arises as to whether we can exploit the query capabilities of the DBMS to support these applications. This dissertation ...
Ameet M. Kini / Jeffrey F. Naughton
ParaGraph-RTS: A parallel reduction-based run-time system
We are investigating the use of the functional programming paradigm on multiprocessor computers. We have developed a parallel graph reduction run-time system called ParaGraph-RTS (Parallel Graph Reduction) that provides both significant amounts of exploitable parallelism and the robustness to support development of large scientific codes. This system allows us to empirically investigate the functional programming paradigm within computationally intensive application domains. In this paper, we describe an implementation of ParaGraph-RTS on a shared-memory multiprocessor. The implementation strategy reflects insights gained through performance characterizations of the reduction process. Preliminary performance results and analyses are presented. 8 refs., 4 figs.
Yantis, B.; Rich, D.; Michelsen, R.
Facet defining inequalities among graph invariants: The system GraPHedron
We present a new computer system, called GraPHedron, which uses a polyhedral approach to help the user to discover optimal conjectures in graph theory. We define what should be optimal conjectures and propose a formal framework allowing to identify them. ... Keywords: Computer-assisted system, Conjecture, GraPHedron, Graph
Hadrien M�lot
Decision support system for water distribution systems based on neural networks and graphs theory for leakage detection
This paper presents an efficient and effective decision support system (DSS) for operational monitoring and control of water distribution systems based on a three layer General Fuzzy Min-Max Neural Network (GFMMNN) and graph theory. The operational monitoring ... Keywords: Decision support system, Graph theory, Loop corrective flows equations, Modeling and simulation, Neural network, Operational control of water distribution systems
Corneliu T. C. Arsene; Bogdan Gabrys; David Al-Dabass
Legal Energy Information System (SIEL) Database | Open Energy Information
Open Energy Info (EERE)
Legal Energy Information System (SIEL) Database Legal Energy Information System (SIEL) Database Jump to: navigation, search Tool Summary Name: Legal Energy Information System (SIEL) Database Agency/Company /Organization: Latin American Energy Organization Sector: Energy Focus Area: Renewable Energy Topics: Policies/deployment programs, Background analysis Resource Type: Dataset Website: www.olade.org/sielEn.html Country: Costa Rica, El Salvador, Guatemala, Honduras, Nicaragua, Panama, Mexico, Argentina, Bolivia, Brazil, Chile, Colombia, Ecuador, Guyana, Paraguay, Peru, Suriname, Uruguay, Venezuela, Barbados, Cuba, Grenada, Haiti, Jamaica, Trinidad & Tobago, Dominican Republic Central America, Central America, Central America, Central America, Central America, Central America, Central America, South America, South America, South America, South America, South America, South America, South America, South America, South America, South America, South America, South America, Caribbean, Caribbean, Caribbean, Caribbean, Caribbean, Caribbean, Caribbean
(BARS) -- Bibliographic Retrieval System Sandia shock compression (SSC) database shock physics index (SPHINX) database. Volume 3, UNIX version Systems Guide
The Bibliographic Retrieval System (BARS) is a database management system specially designed to store and retrieve bibliographic references and track documents. The system uses INGRES to manage this database and user interface. It uses forms for journal articles, books, conference proceedings, theses, technical reports, letters, memos, visual aids, as well as a miscellaneous form which can be used for data sets or any other material which can be assigned an access or file number. Sorted output resulting from flexible BOOLEAN searches can be printed or saved in files which can be inserted in reference lists for use with word processors.
von Laven, G.M. [Advanced Software Engineering, Madison, AL (United States); Herrmann, W. [Sandia National Labs., Albuquerque, NM (United States)
Storage device sizing for a hybrid railway traction system by means of bicausal bond graphs
(a supercapacitor) included in this system is then discussed. Keywords: bond graph, bicausality In the paper, the example of a supercapacitor process consists of choosing the system structure dimensioning
Paris-Sud XI, Université de
Records retention in relational database systems
The recent introduction of several pieces of legislation mandating minimum and maximum retention periods for corporate records has prompted the Enterprise Content Management (ECM) community to develop various records retention solutions. Records retention ... Keywords: business records, legal compliance, privacy, records retention, relational systems
Ahmed A. Ataullah; Ashraf Aboulnaga; Frank Wm. Tompa
Buffer management in relational database systems
The hot-set model, characterizing the buffer requirements of relational queries, is presented. This model allows the system to determine the optimal buffer space to be allocated to a query; it can also be used by the query optimizer to derive efficient ...
Giovanni Maria Sacco; Mario Schkolnick
GnatDb: a small-footprint, secure database system
This paper describes GnatDb, which is an embedded database system that provides protection against both accidental and malicious corruption of data. GnatDb is designed to run on a wide range of appliances, some of which have very limited resources. Therefore, ...
Radek Vingralek
Searching the Occurrence Reporting and Processing Systems (ORPS) database
The Occurrence Reporting and Processing System (ORPS) is a computerized method to submit, collect, update, and sign occurrence reports required by US Department of Energy (DOE) Order 5000.3B, Occurrence Reporting and Processing of Operations Information. The basic reason for investigating and reporting the causes of occurrences is to enable the identification of corrective actions to prevent recurrence and, thereby, protect the health and safety of the public, the workers, and the environment. ORPS provides the DOE community with a readily accessible database that contains information about occurrences at DOE facilities, causes of those occurrences, and corrective actions. This information can, therefore, be used to identify and analyze trends in occurrences. The ORPS database resides on a host computer located at the Idaho National Engineering Laboratory (INEL) in Idaho Falls, Idaho. The database can be accessed from any DOE site via computer terminals or personal computers (PCs) that are set up to access ORPS.
Commander, S.L.
Database Supported Bacnet Data Acquisition System for Building Energy Diagnostics
This paper reports a tool that can be used to acquire and store the BACnet (A Data Communication Protocol for Building Automation and Control Networks) data for the purpose of building energy system Fault Detection and Diagnostics (FDD). Building Automation Control (BAC) systems have become a common practice in recently constructed buildings in the United States. Although building operational data could readily be collected for various analysis purposes, there is still a debate in building community which or what FDD method is better in terms of performance matrix, such as false alarm rate and training data requirement, etc. Therefore, from the user's perspective, it is potentially beneficial to try out different FDD methods before the deployment, 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 Control Virtual Test Bed (BCVTB) environment [2]. This paper discusses (1) Relational database schema development for the purpose of storing building operational data and FDD analysis data (2) Development of the connector in BCVTB that enables the transition from the BACnet module to the database module and (3)Testing of the integrated system in a real building. The relational database is intended to be general and detailed enough so that it can be applied to different buildings and projects with various complexity without any major structure change. The BACnet-reader to database connector enables seamless data flow from commercial BACnet system to user's customized workstation. The integrated system enables users to analyze building operational data in an effective and efficient way, which helps achieve automated FDD in buildings.
Li, Z.; Augenbroe, G.
A Methodology for Finding Invariants of Motion for Asymmetric Systems with Gauge-Transformed Umbra Lagrangian Generated by Bond Graphs
The purpose of this article is to obtain conservation laws (invariants of motion) for different energy domains through the extended Noether theorem and bond graphs. Bond graphs are profitably used in representing the physics of a system as well as obtaining ... Keywords: Bond graphs, Noether's theorem, gauge-transformed umbra-Lagrangian, invariants of motion, umbra-Lagrangian
Amalendu Mukherjee; Vikas Rastogi; Anirvan Dasgupta
PyDecay/GraphPhys: A Unified Language and Storage System for Particle Decay Process Descriptions
To ease the tasks of Monte Carlo (MC) simulation and event reconstruction (i.e. inferring particle-decay events from experimental data) for long-term BaBar data preservation and analysis, the following software components have been designed: a language ('GraphPhys') for specifying decay processes, common to both simulation and data analysis, allowing arbitrary parameters on particles, decays, and entire processes; an automated visualization tool to show graphically what decays have been specified; and a searchable database storage mechanism for decay specifications. Unlike HepML, a proposed XML standard for HEP metadata, the specification language is designed not for data interchange between computer systems, but rather for direct manipulation by human beings as well as computers. The components are interoperable: the information parsed from files in the specification language can easily be rendered as an image by the visualization package, and conversion between decay representations was implemented. Several proof-of-concept command-line tools were built based on this framework. Applications include building easier and more efficient interfaces to existing analysis tools for current projects (e.g. BaBar/BESII), providing a framework for analyses in future experimental settings (e.g. LHC/SuperB), and outreach programs that involve giving students access to BaBar data and analysis tools to give them a hands-on feel for scientific analysis.
Dunietz, Jesse N.; /MIT /SLAC
A software development tool for improving quality of service in distributed database systems
The Distributed Database Management Systems (DDBMS) are measured by their Quality of Service (QoS) improvements on the real world applications. To analyze the behavior of the distributed database system and to measure its quality of service performance, ...
Ismail Omar Hababeh
Energy and quality aware query processing in wireless sensor database systems
Query processing has been studied extensively in traditional database systems. However, few existing methods can be directly applied to wireless sensor database systems (WSDSs) due to their characteristics, such as decentralized nature, limited computational ... Keywords: Energy reservation, Energy-efficiency, Imagine chain, Multipath routing, Query optimization, Query processing, Space vector model, Wireless sensor database system, k-Partial cover set problem
Qingchun Ren; Qilian Liang
Modeling and Dynamic Simulation of Electric Power Steering System of Automobile Using Bond Graph Technique
Electric Power Steering (EPS) systems have many merits over traditional hydraulic power steering systems in fuel economy, variable assist capabilities and favorable road feeling by virtue of adjustment assist characteristic with adopting assist motor ... Keywords: electric power steering system, bond graph, modeling, simulation
Lin-an Wang; Qiang Li; Xiao-juan Liang
Geographic Information System (GIS) Database Development, Integration, and Maintenance for the Iowa Department of
Geographic Information System (GIS) Database Development, Integration, and Maintenance for the Iowa-related fields. #12;Geographic Information System (GIS) Database Development, Integration, and Maintenance to limit data management and maintenance in the central office. A single database table would exist
Beresnev, Igor
Based on embedded database greenhouse temperature and humidity intelligent control system
The article based on embedded database of greenhouse temperature and humidity control system intelligent. Put forward by embedded database system set up in an ideal environment for data greenhouse temperature and humidity control, greenhouse crops in ... Keywords: control, data filtering, embedded database, greenhouse, microcontrollers, temperature and humidity
Sun Rong-gao; Wan Zhong; Sun De-chao
Evaluation of Concurrency Control Strategies for Mixed Soft Real-Time Database Systems
1 Evaluation of Concurrency Control Strategies for Mixed Soft Real-Time Database Systems Kam of the miss rate of soft real-time transactions. Although many new database applications have significant soft real-time database systems (MSRTDBS), in which both non-real-time and soft real-time transactions
Cheng, Reynold Cheng Chun
Combining a Multithreaded Scene Graph System with a Tiled Display Environment
This case study highlights the technical challenges of creating an application that uses a multithreaded scene graph toolkit for rendering and uses a software environment for management of tiled display systems. Scene graph toolkits simplify and streamline graphics applications by providing data management and rendering services. Software for tiled display environments typically performs device and event management by opening windows on displays, by gathering and processing input device events, and by orchestrating the execution of application rendering code. These environments serve double-duty as frameworks for creating parallel rendering applications. We explore technical issues related to interfacing scene graph systems with software that manages tiled projection systems in the context of an implementation, and formulate suggestions for the future growth of such systems.
Frank, R; Bethel, W
Generic Natural Systems Evaluation - Thermodynamic Database Development and Data Management
DOE Green Energy (OSTI)
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).
Wolery, T W; Sutton, M
Fear and desire in systems design : negotiating database usefulness
Databases are ubiquitous. They are used for a host of functions including coordination, decision making, and memory archiving. Despite their importance and ubiquity, databases continue to frustrate us, often departing from ...
Agrawal, Tanu
National Ambient Radiation Database
The U.S. Environmental Protection Agency (EPA) recently developed a searchable database and website for the Environmental Radiation Ambient Monitoring System (ERAMS) data. This site contains nationwide radiation monitoring data for air particulates, precipitation, drinking water, surface water and pasteurized milk. This site provides location-specific as well as national information on environmental radioactivity across several media. It provides high quality data for assessing public exposure and environmental impacts resulting from nuclear emergencies and provides baseline data during routine conditions. The database and website are accessible at www.epa.gov/enviro/. This site contains (1) a query for the general public which is easy to use--limits the amount of information provided, but includes the ability to graph the data with risk benchmarks and (2) a query for a more technical user which allows access to all of the data in the database, (3) background information on ER AMS.
Dziuban, J.; Sears, R.
Tropical cyclone identification and tracking system using integrated neural oscillatory elastic graph matching and hybrid RBF network track mining techniques
We present an automatic and integrated neural network-based tropical cyclone (TC) identification and track mining system. The proposed system consists of two main modules: 1) TC pattern identification system using neural oscillatory elastic graph matching ...
R. S.T. Lee; J. N.K. Liu
GnatDb: A Small-Footprint, Secure Database System
This paper describes GnatDb, which is an embedded database system that provides protection against both accidental and malicious corruption of data. GnatDb is designed to run on a wide range of appliances, some of which have very limited resources. Therefore, its design is heavily driven by the need to reduce resource consumption. GnatDb employs atomic and durable updates to protect the data against accidental corruption. It prevents malicious corruption of the data using standard cryptographic techniques that leverage the underlying log-structured storage model. We show that the total memory consumption of GnatDb, which includes the code footprint, the stack and the heap, does not exceed 11 KB, while its performance on a typical appliance platform remains at an acceptable level.
A database-centric approach to system managemant in the blue gene/L supercomputer
In designing the management system for Blue Gene/L, we adopted a database-centric approach, All configuration and operational data for a particular Blue Gene/L system are stored in a relational database that is kept in the system's service node. The ...
Ralf Bellofatto; Paul G. Crumley; David Darrington; Brant knudson; Mark Megerian; Jos� E. Moreira; Alda S. Ohmacht; John Orbeck; Don Reed; Greg Stewart
The Technology of Object-Oriented Database Systems Gopi Krishna Attaluri, Andrej Brodnik, Carolina Culik,
The Technology of Object-Oriented Database Systems Gopi Krishna Attaluri, Andrej Brodnik, Carolina on what an object-oriented (OODBMS) database system must have in the way of features. Roughly, one obtains for concurrency and recovery to an object-oriented programming language, such as C++ or Eiffel. Unfortunately
Waterloo, University of
Environmental Factor(tm) system: Superfund site information from five EPA databases (on cd-rom). Database
Environmental Factor puts today`s technology to work to provide a better, more cost-efficient and time-saving way to access EPA information on hazardous waste sites. Environmental consultants, insurers, and reinsurers, corporate risk assessors and companies actively involved in the generation, transport, storage or cleanup of hazardous waste materials can use its user-friendly information retrieval system to gain rapid access to vital information in immediately-usable form. Search, retrieve, and export information in real time. No more waiting for the mail or overnight delivery services to deliver hard copies of voluminous listings and individual site reports. More than 200,000 pages of EPA hazardous waste site information are contained in 5 related databases: (1) Site data from the National Priority List (NPL) and CERCLIS databases, Potentially Responsible Parties (PRP) and Records of Decision (RODs) summaries; (2) Complete PRP information; (3) EPA Records of Decision (Full Text); (4) entire Civil Enforcement Docket; and (5) Glossary of EPA terms, abbreviations and acronyms. Environmental Factor`s powerful database management engine gives even the most inexperienced computer user extensive search capabilities, including wildcard, phonetic and direct cross reference searches across multiple databases. The first menu option delivers information from the NPL, CERCLIS site data, PRP and RODs summary information. Enter a set of search criteria and then immediately access displays containing information from all of these databases. Get full PRP information and Full Text RODs by using their respective menu options. If your search turns up multiple items, a list of site names appears. To bring up the data, highlight the specific site you want and hit Enter. That`s how easy it is to access the vast amount of data stored in the Environmental Factor CD-ROM.
DBMiner: a system for data mining in relational databases and data warehouses
A data mining system, DBMiner, has been developed for interactive mining of multiple-level knowledge in large relational databases and data warehouses. The system implements a wide spectrum of data mining functions, including characterization, comparison, ...
Jiawei Han; Jenny Y. Chiang; Sonny Chee; Jianping Chen; Qing Chen; Shan Cheng; Wan Gong; Micheline Kamber; Krzysztof Koperski; Gang Liu; Yijun Lu; Nebojsa Stefanovic; Lara Winstone; Betty B. Xia; Osmar R. Zaiane; Shuhua Zhang; Hua Zhu
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been classified as complete for classes such as np, co-np, and ... Keywords: Argumentation frameworks, Computational complexity, Computational properties of argumentation
Paul E. Dunne
Proposal to negotiate the renewal of the contract for the licensing and maintenance of database management system software
Asynchronous data change notification between database server and accelerator controls system
Database data change notification (DCN) is a commonly used feature. Not all database management systems (DBMS) provide an explicit DCN mechanism. Even for those DBMS's which support DCN (such as Oracle and MS SQL server), some server side and/or client side programming may be required to make the DCN system work. This makes the setup of DCN between database server and interested clients tedious and time consuming. In accelerator control systems, there are many well established software client/server architectures (such as CDEV, EPICS, and ADO) that can be used to implement data reflection servers that transfer data asynchronously to any client using the standard SET/GET API. This paper describes a method for using such a data reflection server to set up asynchronous DCN (ADCN) between a DBMS and clients. This method works well for all DBMS systems which provide database trigger functionality. Asynchronous data change notification (ADCN) between database server and clients can be realized by combining the use of a database trigger mechanism, which is supported by major DBMS systems, with server processes that use client/server software architectures that are familiar in the accelerator controls community (such as EPICS, CDEV or ADO). This approach makes the ADCN system easy to set up and integrate into an accelerator controls system. Several ADCN systems have been set up and used in the RHIC-AGS controls system.
Fu, W.; Morris, J.; Nemesure, S.
Future Robotics Database Management System along with Cloud TPS
This paper deals with memory management issues of robotics. In our proposal we break one of the major issues in creating humanoid. . Database issue is the complicated thing in robotics schema design here in our proposal we suggest new concept called NOSQL database for the effective data retrieval, so that the humanoid robots will get the massive thinking ability in searching each items using chained instructions. For query transactions in robotics we need an effective consistency transactions so by using latest technology called CloudTPS which guarantees full ACID properties so that the robot can make their queries using multi-item transactions through this we obtain data consistency in data retrievals. In addition we included map reduce concepts it can splits the job to the respective workers so that it can process the data in a parallel way.
S, Vijaykumar
Synchronization and recovery in an embedded database system for read-only transactions
Transactions within an embedded database management system face many restrictions. These can not afford unlimited delays or participate in multiple retry attempts for execution. The proposed embedded concurrency control (ECC) techniques provide support ...
Subhash Bhalla; Masaki Hasegawa
graph drawing
... Layout Program (C). Graphviz: Graph Visualization Software (C), consisting of many graph drawing programs, viewers (C, Java, and TCL/TK), etc. ...
Power domination in block graphs
The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known domination problem in graphs. In 2002, Haynes et al. considered the graph theoretical representation ... Keywords: algorithm, block graphs, electric power system, power dominating set
Guangjun Xu; Liying Kang; Erfang Shan; Min Zhao
U-dbms: a database system for managing constantly-evolving data
In many systems, sensors are used to acquire information from external environments such as temperature, pressure and locations. Due to continuous changes in these values, and limited resources (e.g., network bandwidth and battery power), it is often infeasible for the database to store the exact values at all times. Queries that uses these old values can produce invalid results. In order to manage the uncertainty between the actual sensor value and the database value, we propose a system called U-DBMS. U-DBMS extends the database system with uncertainty management functionalities. In particular, each data value is represented as an interval and a probability distribution function, and it can be processed with probabilistic query operators to produce imprecise (but correct) answers. This demonstration presents a PostgreSQL-based system that handles uncertainty and probabilistic queries for constantly-evolving data. 1
Reynold Cheng; Sarvjeet Singh; Sunil Prabhakar
System/subsystem specifications for the Worldwide Port System (WPS) Regional Integrated Cargo Database (ICDB)
A system is being developed by the Military Traffic Management Command (MTMC) to provide data integration and worldwide management and tracking of surface cargo movements. The Integrated Cargo Database (ICDB) will be a data repository for the WPS terminal-level system, will be a primary source of queries and cargo traffic reports, will receive data from and provide data to other MTMC and non-MTMC systems, will provide capabilities for processing Advance Transportation Control and Movement Documents (ATCMDs), and will process and distribute manifests. This System/Subsystem Specifications for the Worldwide Port System Regional ICDB documents the system/subsystem functions, provides details of the system/subsystem analysis in order to provide a communication link between developers and operational personnel, and identifies interfaces with other systems and subsystems. It must be noted that this report is being produced near the end of the initial development phase of ICDB, while formal software testing is being done. Following the initial implementation of the ICDB system, maintenance contractors will be in charge of making changes and enhancing software modules. Formal testing and user reviews may indicate the need for additional software units or changes to existing ones. This report describes the software units that are components of this ICDB system as of August 1995.
Rollow, J.P.; Shipe, P.C.; Truett, L.F. [Oak Ridge National Lab., TN (United States)] [Oak Ridge National Lab., TN (United States); Faby, E.Z.; Fluker, J.; Grubb, J.; Hancock, B.R. [Univ. of Tennessee, Knoxville, TN (United States)] [Univ. of Tennessee, Knoxville, TN (United States); Ferguson, R.A. [Science Applications International Corp., Oak Ridge, TN (United States)] [Science Applications International Corp., Oak Ridge, TN (United States)
The use of video within a database management system: the creation of an integrated information system for National Hockey League (NHL) teams
In this paper, the use of a statistical and video electronic database by two NHL teams is discussed. We begin with an illustration of the type of information commonly recorded on hockey players. The research and development of new video and computer ... Keywords: DMS), HNL), National Hockey League (, database management system (, integrated information systems, video database system
Kevin J. Leonard
Functional description for the Worldwide Port System (WPS) Regional Integrated Cargo Database (ICDB)
This Functional Description for the Worldwide Port System (WPS) Regional Integrated Cargo Database (ICDB) documents the purpose of and requirements for the ICDB in order to ensure a mutual understanding between the development group and the user group of the system. This Functional Description defines ICDB and provides a clear statement of the initial operational capability to be developed.
Truett, L.F.; Rollow, J.P.; Shipe, P.C. [Oak Ridge National Lab., TN (United States); Faby, E.Z.; Fluker, J.; Hancock, W.R.; Grubb, J.W.; Russell, D.L. [Univ. of Tennessee, Knoxville, TN (United States); Ferguson, R.A. [SAIC, Oak Ridge, TN (United States)
Lead Maintenance Management Systems PPE Pest Management Planning & Architecture Powered Industrial outlined in LBNL/PUB-5519 (1), Issues Management Program Manual. 2.0 Functionality and System Limitations 2 Trucks Preventive Maintenance Project Management Planning Design/Construction Project Management
Efficient algorithms for graph all-matching and containment search.
??Recent advances in database research have shown the potential of graph in modelling complicated data. Graph data have pervaded many modern applications including bio-informatics, chem-informatics,� (more)
Zhu, Gaoping
The Integration Of The LHC Cryogenics Control System Data Into The CERN Layout Database
The Large Hadron Collider�s Cryogenic Control System makes extensive use of several databases to manage data appertaining to over 34,000 cryogenic instrumentation channels. This data is essential for populating the software of the PLCs which are responsible for maintaining the LHC at the appropriate temperature. In order to reduce the number of data sources and the overall complexity of the system, the databases have been rationalised and the automatic tool, that extracts data for the control software, has been simplified. This paper describes the main improvements that have been made and considers the success of the project.
Fortescue-Beck, E; Gomes, P
Gasification Plant Databases
NLE Websites -- All DOE Office Websites (Extended Search)
Gasification Systems Gasification Plant Databases Welcome to the U. S. Department of Energy, National Energy Technology Laboratory's Gasification Plant Databases Within these...
Comprehensive online Atomic Database Management System (DBMS) with Highly Qualified Computing Capabilities
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 ...
Tahat, Amani
Development of Energy Consumption Database Management System of Existing Large Public Buildings
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 conservation. At present, the large public buildings have been the emphasis of building energy conservation in China. The functions and the basic construction of energy consumption database management system (ECDBMS) for large public buildings are introduced. The ECDBMS is developed by using SQL Server 2000 as the database and PowerBuilder10.0 as the developing tool. It includes five parts such as the basic information of public buildings, the designing parameters of energy-consuming equipments, the operational parameters of energy-consuming equipments, the electric and fuel consumption of buildings, the evaluation of energy efficiency for equipments. The energy consumption database can be accumulated and some functions can be realized by using this database such as the management of building designing parameters and energy consumption data, the evaluation and analysis of building energy consumption.
Li, Y.; Zhang, J.; Sun, D.
INTELLIGENT ACCESS TO A PETROLEUM USER DATABASE StevenINTELLIGENT ACCESS TO A PETROLEUM USER DATABASE StevenINTELLIGENT ACCESS TO A PETROLEUM USER DATABASE Steven
Rosenberg, Steven
A real-time intrusion prevention system for commercial enterprise databases
Modern intrusion detection systems are comprised of three basically different approaches, host based, network based, and a third relatively recent addition called procedural based detection. The first two have been extremely popular in the commercial ... Keywords: GLBA, HIPAA, VISA CISP, database security, encryption, intrusion tolerance, isolation
Ulf Mattsson
(BARS) -- Bibliographic Retrieval System Sandia Shock Compression (SSC) database Shock Physics Index (SPHINX) database. Volume 1: UNIX version query guide customized application for INGRES
The Bibliographic Retrieval System (BARS) is a data base management system specially designed to retrieve bibliographic references. Two databases are available, (i) the Sandia Shock Compression (SSC) database which contains over 5700 references to the literature related to stress waves in solids and their applications, and (ii) the Shock Physics Index (SPHINX) which includes over 8000 further references to stress waves in solids, material properties at intermediate and low rates, ballistic and hypervelocity impact, and explosive or shock fabrication methods. There is some overlap in the information in the two data bases.
Herrmann, W. [Sandia National Labs., Albuquerque, NM (United States); von Laven, G.M. [Advanced Software Engineering, Madison, AL (United States); Parker, T. [RE/SPEC, Inc., Albuquerque, NM (United States)
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.
Timothy R. Carr
The next database revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database system. This gives an extensible object-relational system where non-procedural ...
Jim Gray
A database prototype has been developed to help understand costs in photovoltaic systems
High photovoltaic (PV) system costs hinder market growth. An approach to studying these costs has been developed using a database containing system, component and maintenance information. This data, which is both technical and non-technical in nature, is to be used to identify trends related to costs. A pilot database exists at this time and work is continuing. The results of this work may be used by the data owners to improve their operations with the goal of sharing non-attributable information with the public and industry at large. The published objectives of the DOE PV program are to accelerate the development of PV as a national and global energy option, as well as ensure US technology and global market leadership. The approach to supporting these objectives is to understand what drives costs in PV applications. This paper and poster session describe work-in-progress in the form of a database that will help identify costs in PV systems. In an effort to address DOE's Five-Year PV Milestones, a program was established in the summer of 1999 to study system costs in three PV applications--solar home lighting, water pumping, and grid-tied systems. This work began with a RFQ requesting data from these types of systems. Creating a partnership with industry and other system organizations such as Non-Government Organizations (NGOs) was the approach chosen to maintain a close time to the systems in the field. Nine participants were selected as partners, who provided data on their systems. Two activities are emphasized in this work. For the first, an iterative approach of developing baseline reliability and costs information with the participants was taken. This effort led to identifying typical components in these systems as well as the specific data (metrics) that would be needed in any analysis used to understand total systems costs.
Buildings Performance Database Analysis Tools | Department of Energy
Energy.gov (U.S. Department of Energy (DOE)) Indexed Site
Commercial Buildings » Buildings Performance Database » Buildings Commercial Buildings » Buildings Performance Database » Buildings Performance Database Analysis Tools Buildings Performance Database Analysis Tools The Buildings Performance Database will offer four analysis tools for exploring building data and forecasting financial and energy savings: a Peer Group Tool, a Retrofit Analysis Tool, a Data Table Tool, and a Financial Forecasting Tool. Available now: Peer Group Tool The Peer Group Tool allows users to peruse the BPD, define peer groups, and analyze their performance. Users can create Peer Groups by filtering the dataset based on parameters such as building type, location, floor area, age, occupancy, and system characteristics such as lighting and HVAC type. The graphs show the energy performance distribution of those
1.264J / ESD.264J Database, Internet, and Systems Integration Technologies, Fall 2004
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 ...
Kocur, George
1.264J / ESD.264J Database, Internet, and Systems Integration Technologies, Fall 2002
Hazard Analysis Database report
This document describes and defines the Hazard Analysis Database for the Tank Waste Remediation System Final Safety Analysis Report.
Niemi, B.J.
Online reorganization of databases
In practice, any database management system sometimes needs reorganization, that is, a change in some aspect of the logical and/or physical arrangement of a database. In traditional practice, many types of reorganization have required denying access ... Keywords: Clustering, concurrent reorganization, indexes, log-structured file systems, maintenance, online reorganization, redefinition, reorganization, restructuring, schema evolution, very large databases
Gary H. Sockut; Balakrishna R. Iyer
National Carbon Sequestration Database and Geographic Information System (NatCarb)
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.
Kenneth Nelson; Timothy Carr
A framework for graph-based synthesis, analysis, and visualization of HPC cluster job data.
The monitoring and system analysis of high performance computing (HPC) clusters is of increasing importance to the HPC community. Analysis of HPC job data can be used to characterize system usage and diagnose and examine failure modes and their effects. This analysis is not straightforward, however, due to the complex relationships that exist between jobs. These relationships are based on a number of factors, including shared compute nodes between jobs, proximity of jobs in time, etc. Graph-based techniques represent an approach that is particularly well suited to this problem, and provide an effective technique for discovering important relationships in job queuing and execution data. The efficacy of these techniques is rooted in the use of a semantic graph as a knowledge representation tool. In a semantic graph job data, represented in a combination of numerical and textual forms, can be flexibly processed into edges, with corresponding weights, expressing relationships between jobs, nodes, users, and other relevant entities. This graph-based representation permits formal manipulation by a number of analysis algorithms. This report presents a methodology and software implementation that leverages semantic graph-based techniques for the system-level monitoring and analysis of HPC clusters based on job queuing and execution data. Ontology development and graph synthesis is discussed with respect to the domain of HPC job data. The framework developed automates the synthesis of graphs from a database of job information. It also provides a front end, enabling visualization of the synthesized graphs. Additionally, an analysis engine is incorporated that provides performance analysis, graph-based clustering, and failure prediction capabilities for HPC systems.
Mayo, Jackson R.; Kegelmeyer, W. Philip, Jr.; Wong, Matthew H.; Pebay, Philippe Pierre; Gentile, Ann C.; Thompson, David C.; Roe, Diana C.; De Sapio, Vincent; Brandt, James M.
API Requirements for Dynamic Graph Prediction
Given a large-scale time-evolving multi-modal and multi-relational complex network (a.k.a., a large-scale dynamic semantic graph), we want to implement algorithms that discover patterns of activities on the graph and learn predictive models of those discovered patterns. This document outlines the application programming interface (API) requirements for fast prototyping of feature extraction, learning, and prediction algorithms on large dynamic semantic graphs. Since our algorithms must operate on large-scale dynamic semantic graphs, we have chosen to use the graph API developed in the CASC Complex Networks Project. This API is supported on the back end by a semantic graph database (developed by Scott Kohn and his team). The advantages of using this API are (i) we have full-control of its development and (ii) the current API meets almost all of the requirements outlined in this document.
Gallagher, B; Eliassi-Rad, T
Harp: a distributed query system for legacy public libraries and structured databases
The main purpose of a digital library is to facilitate users easy access to enormous amount of globally networked information. Typically, this information includes preexisting public library catalog data, digitized document collections, and other databases. ... Keywords: Internet databases, digital libraries, interoperable databases
Ee-Peng Lim; Ying Lu
Keyword Proximity Search over Large and Complex RDF Database
In this paper, we propose a keyword proximity search approach that can be applied to large and complex RDF database. We model RDF database as undirected data graph, construct three indexes for each data graph, only one index need be loaded into memory. ... Keywords: RDF, proximity, link join, node pruning
Zhen Niu; Hai-Tao Zheng; Yong Jiang; Shu-Tao Xia; Hui-Qiu Li
[Geothermal system temperature-depth database and model for data analysis]. 4. quarterly technical progress report
The activities that have been carried out this quarter include continued planning and development of the geothermal system thermal-well data-base that will be one of the main contract results. The authors are continuing to modify the specifications of the database and continuing initial input. They have added several additional areas to their inventory of the geothermal areas for which data are available in the literature (published and open file) and on open file as described in the third quarterly report. A map was enclosed with the second quarterly report that gave the preliminary location of sites of various categories of wells. They will include a revised map with the next quarterly report when all of the sites, including the new ones described below, have been located and added to the index map. In particular in the last quarter the authors have added about 100 wells in west Texas in the transPecos region from a previously proprietary report that they recently obtained. In addition they have made arrangements to obtain thermal data collected by AMAX Geothermal during their exploration activities. The number of wells is large, several hundred, and the sites are spread throughout the western US from New Mexico and Colorado to California and Oregon.
Blackwell, D.D.
Assembly and comparison of available solar hot water system reliability databases and information.
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.
Menicucci, David F. (Building Specialists, Inc., Albuquerque, NM)
Using ECA rules to implement mobile query agents for fast-evolving pure P2P database systems
A challenging issue in fast-evolving pure P2P networks is the design of an appropriate mechanism for processing queries. Since both the data content of the peers as well as their acquaintances, change rapidly the typical P2P querying techniques become ... Keywords: ECA model, P2P systems, mobile agents, mobile databases
Verena Kantere; Aris Tsois
Semantic knowledge facilities for a web-based recipe database system supporting personalization
The recent explosive proliferation of interesting and useful data over the Web such as various recipes, while providing people with readily available information, brings out a challenging issue on how to manage such non-conventional data effectively. ... Keywords: constraint and rule, cooking graph, knowledge base, personalization, recipe, semantic modeling, user profiling
Liping Wang; Qing Li; Guozhu Dong; Yu Li
Chesapeake Bay Program Water Quality Database | Data.gov
Chesapeake Bay Program Water Quality Database Chesapeake Bay Program Water Quality Database Ocean Data Tools Technical Guide Map Gallery Regional Planning Feedback Ocean You are here Data.gov » Communities » Ocean » Data Chesapeake Bay Program Water Quality Database Dataset Summary Description The Chesapeake Information Management System (CIMS), designed in 1996, is an integrated, accessible information management system for the Chesapeake Bay Region. CIMS is an organized, distributed library of information and software tools designed to increase basin-wide public access to Chesapeake Bay information. The information delivered by CIMS includes technical and public information, educational material, environmental indicators, policy documents, and scientific data. Through the use of relational databases, web-based programming, and web-based GIS a large number of Internet resources have been established. These resources include multiple distributed on-line databases, on-demand graphing and mapping of environmental data, and geographic searching tools for environmental information. Baseline monitoring data, summarized data and environmental indicators that document ecosystem status and trends, confirm linkages between water quality, habitat quality and abundance, and the distribution and integrity of biological populations are also available. One of the major features of the CIMS network is the Chesapeake Bay Program's Data Hub, providing users access to a suite of long- term water quality and living resources databases. Chesapeake Bay mainstem and tidal tributary water quality, benthic macroinvertebrates, toxics, plankton, and fluorescence data can be obtained for a network of over 800 monitoring stations.
Environment/Health/Safety (EHS): Databases
System) (for findings 122005 to present) Chemical Management System Confined Spaces Inventory Electrical Safety Emergency Services Program Database Ergonomics Database (to read...
Line graph explorer: scalable display of line graphs using Focus+Context
Scientific measurements are often depicted as line graphs. State-of-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundreds to thousands of such graphs. Despite the increasing volume and ubiquity ... Keywords: Focus+Context, line graph
Robert Kincaid; Heidi Lam
Home Heating Systems Design using PHP and MySQL Databases
This paper presents the use of a computer application based on a MySQL database, managed by PHP programs, allowing the selection of a heating device using coefficient-based calculus.
Karnyanszky, Tiberiu Marius
System Models for Goal-Driven Self-management in Autonomic Databases
Self-managing databases intend to reduce the total cost of ownership for a DBS by automatically adapting the DBS configuration to evolving workloads and environments. However, existing techniques strictly focus on automating one particular administration ...
Marc Holze; Norbert Ritter
The Energy Science and Technology Database on a local library system: A case study at the Los Alamos National Research Library
This paper presents an overview of efforts at Los Alamos National Laboratory to acquire and mount the Energy Science and Technology Database (EDB) as a citation database on the Research Library`s Geac Advance system. The rationale for undertaking this project and expected benefits are explained. Significant issues explored are loading non-USMARC records into a MARC-based library system, the use of EDB records to replace or supplement in-house cataloging of technical reports, the impact of different cataloging standards and database size on searching and retrieval, and how integrating an external database into the library`s online catalog may affect staffing and workflow.
Holtkamp, I.S.
Information Solutions: Database Applications
Database Applications Database Applications Argonne DOE-BES Central User Facility: A-Z People Query Data Warehouse Edits Registration | Registration Processing Security Admin Beamline Component Database System to manage beamline components. Beamline Downtime Report - UES Floor coordinator's downtime entry and reporting system. Beamline Directory | Beamline Entry Administration Links to the beamline websites and to detailed information about the equipment, techniques and contact information of a beamline. Beamline Usage and Scheduling System Long term schedule query and edit. Beamline schedule query and edit. Watchman and PSS data. Budget Proposal System Allows user to submit budget proposals via the web. Beamline Statistics Menu Query, entry and reporting of beamline statistics for ALD use only.
Computing Information Value from RDF Graph Properties
Information value has been implicitly utilized and mostly non-subjectively computed in information retrieval (IR) systems. We explicitly define and compute the value of an information piece as a function of two parameters, the first is the potential semantic impact the target information can subjectively have on its recipient's world-knowledge, and the second parameter is trust in the information source. We model these two parameters as properties of RDF graphs. Two graphs are constructed, a target graph representing the semantics of the target body of information and a context graph representing the context of the consumer of that information. We compute information value subjectively as a function of both potential change to the context graph (impact) and the overlap between the two graphs (trust). Graph change is computed as a graph edit distance measuring the dissimilarity between the context graph before and after the learning of the target graph. A particular application of this subjective information valuation is in the construction of a personalized ranking component in Web search engines. Based on our method, we construct a Web re-ranking system that personalizes the information experience for the information-consumer.
al-Saffar, Sinan; Heileman, Gregory
Supercritical Boiler Tube Wall Temperature Test Base on the Power Plant Control System Database
In order to precisely learn the working condition of 600MW supercritical boiler, new temperature measuring points are set on the super-heater tube wall inner the flue. Since the working condition of 600MW supercritical boiler is quite severe, the temperature ... Keywords: supercritical boiler, database, temperature test, super-heater
Yu Yanzhi; Zhang Liangbo; Xu Haichuan; Chen Duogang; Dong Gongjun; Shen Bo; Liu Sheng
OS support for a commodity database on PC clusters: distributed devices vs. distributed file systems
In this paper we attempt to parallelise a commodity database for OLAP on a cluster of commodity PCs by using a distributed high-performance storage subsystem. By parallelising the underlying storage architecture we eliminate the need to make any changes ...
Felix Rauch; Thomas M. Stricker
Towards a hybrid row-column database for a cloud-based medical data management system
Medical data management becomes a real exigency. The emergence of new medical imaging techniques and the necessity to access medical information at any time have led to an inevitable need to find new advanced solutions for managing these critical data. ... Keywords: DICOM, cloud computing, hybrid database, medical imaging
Baraa Mohamad; Laurent d'Orazio; Le Gruenwald
PDSF Utilization Graphs
Graphs Graphs Utilization Graphs This page contains a series of graphs that use data from the PDSF batch scheduler (SGE) to show the utilization of the cluster over the past 24 hours. The graphs were generated with RRDTool and are updated approximately every 15 minutes. This graph shows the aggregate cluster CPU availablity and usage according to sgeload: 24 hour rolling usage graph (click to see long term averages) This graph shows the number of jobs being run by each group: Rolling 24 Running Jobs by Group (click to see long term averages) This is the same graph as above weighted by the clockspeed (GHz) of the node used for the job: Rolling 24 Running Jobs by Group (click to see long term averages) This graph show the number of pending jobs by group: Rolling 24 Pending Jobs
Crystallographic Databases
... By way of illustration, searching the ICSD database for yttrium-barium-copper- oxide, a common ... ICSD #63,483: Example of search results. ...
Pathogen Databases
Databases Los Alamos scientists are working on developing the next-generation of biofuels. Get Expertise Rebecca McDonald Bioscience Email Jose A. Olivares Bioscience Email...
Structural Databases
... c) http://bioinfo.nist.gov/biofuels/ A resource for Biofuels. ... Biofuels database (c) is a structural resource for biofuels research. ...
Databases - TMS
Principal Metals inventory database, 0, 734, Lynette Karabin, 2/9/2007 5:41 AM by Lynette Karabin. New Messages, Rating, WEB RESOURCE: Corrosion�...
The Knowledge Dictionary: A KBMS architecture for the many-to-many coupling of knowledge based-systems to databases
The effective management and leveraging of organizational knowledge has become the focus of much research in the computer industry. One specific area is the creation of information systems that combine the ability to manage large stores of data, making it available to many users, with the ability to reason and make inferences over bodies of knowledge capturing specific expertise in some problem domain. A Knowledge Base Management System (KBMS) is a system providing management of a large shared knowledge base for (potentially) many knowledge-based systems (KBS). A KBMS architecture for coupling knowledge-based systems to databases has been developed. The architecture is built around a repository known as the Knowledge Dictionary-a multi-level self-describing framework that facilitates the KBS-DBMS integration. Th Knowledge Dictionary architecture allows the following enhancements to be made to be made to the KBS environment: knowledge sharing among multiple KBS applications; knowledge management of semantic integrity over large-scale (declarative) knowledge bases; and, knowledge maintenance as the declarative portion of the shared knowledge base evolves over time. This dissertation discusses the architecture of the Knowledge Dictionary, and the underlying knowledge representation framework, focusing on how it is used to provide knowledge management services to the KBS applications having their declarative knowledge base components stored as databases in the DBMS. The specific service investigated is the management of semantic integrity of the knowledge base.
Davis, J.P.
Levelized Scheduling of Directed A-Cyclic Precedence Constrained Task Graphs onto Heterogeneous Computing System
Efficient scheduling of processes onto processors of a heterogeneous computing system has always been an important and challenging area of research.The scheduling problem has been shown to be NP-Complete in general cases as well as in several restricted ...
E. Illvarasan; P. Thambidurai
Sequoia tops Graph 500 list of 'big data' supercomputers
ATL062113_graph ATL062113_graph 06/21/2013 The Livermore Lab's Sequoia supercomputer topped the biannual Graph 500 list of the world's fastest systems for "big data" this week. The Graph 500 benchmark measures the speed with which a supercomputer can "connect the dots" within a massive set of data. Sequoia traversed 15,363 connections per second. Sequoia tops Graph 500 list of 'big data' supercomputers Donald B Johnston, LLNL, (925) 423-4902, email@example.com LLNL's 20 petaflops Sequoia supercomputer has retained its No. 1 ranking on the Graph 500 list, a measure of a system's ability to conduct analytic calculations -- finding the proverbial needle in the haystack. An IBM Blue Gene Q system, Sequoia was able to traverse 15,363 giga edges per second on a scale of 40 graph (a graph with 2^40 vertices). The new
Collaborative robotic instruction: A graph teaching experience
Graphing is a key skill in the study of Physics. Drawing and interpreting graphs play a key role in the understanding of science, while the lack of these has proved to be a handicap and a limiting factor in the learning of scientific concepts. It has ... Keywords: Face-to-face computer supported collaborative learning, Intelligent tutoring systems, Interactive learning environments, Robotic assisted teaching
Rub�n Mitnik; Mat�as Recabarren; Miguel Nussbaum; Alvaro Soto
A distributed atomic physics database and modeling system for plasma spectroscopy
We are undertaking to develop a set of computational capabilities which will facilitate the access, manipulation, and understanding of atomic data in calculations of x-ray spectral modeling. In this present limited description we will emphasize the objectives for this work, the design philosophy, and aspects of the atomic database, as a more complete description of this work is available. The project is referred to as the Plasma Spectroscopy Initiative; the computing environment is called PSI, or the ``PSI shell`` since the primary interface resembles a UNIX shell window. The working group consists of researchers in the fields of x-ray plasma spectroscopy, atomic physics, plasma diagnostics, line shape theory, astrophysics, and computer science. To date, our focus has been to develop the software foundations, including the atomic physics database, and to apply the existing capabilities to a range of working problems. These problems have been chosen in part to exercise the overall design and implementation of the shell. For successful implementation the final design must have great flexibility since our goal is not simply to satisfy our interests but to vide a tool of general use to the community.
Nash, J.K.; Liedahl, D.; Chen, M.H.; Iglesias, C.A.; Lee, R.W. [Lawrence Livermore National Lab., CA (United States); Salter, J.M. [South Gosforth Computer Systems, Newcastle upon Tyne (United Kingdom)
Hazard Analysis Database Report
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.
A graph based method for faster display for distribution networks
This paper presents our logical display approach for Distribution Networks based on the concept of Microsoft graphs. We demonstrate that by using Microsoft graphs we do not have to redraw the circuits after each switching operation or after a change ... Keywords: algorithms, distribution, graphs, logical display, network systems
Mansoor Al-A'ali
A Case for Database Filesystems
Data intensive science is offering new challenges and opportunities for Information Technology and traditional relational databases in particular. Database filesystems offer the potential to store Level Zero data and analyze Level 1 and Level 3 data within the same database system [2]. Scientific data is typically composed of both unstructured files and scalar data. Oracle SecureFiles is a new database filesystem feature in Oracle Database 11g that is specifically engineered to deliver high performance and scalability for storing unstructured or file data inside the Oracle database. SecureFiles presents the best of both the filesystem and the database worlds for unstructured content. Data stored inside SecureFiles can be queried or written at performance levels comparable to that of traditional filesystems while retaining the advantages of the Oracle database.
Adams, P A; Hax, J C
Computer systems and methods for the query and visualization of multidimensional databases
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.
Stolte, Chris (Palo Alto, CA); Tang, Diane L. (Palo Alto, CA); Hanrahan, Patrick (Portola Valley, CA)
Energetics Databases
Thermodynamic databases. Thermotech Sente Software. Al, Mg, Fe, Ni, NiFe- Super, Ti, TiAl alloy data (fee), 0, 1978, Cathy Rohrer, 4/8/2008 8:59 AM by Cathy �...
Graph sketcher: extending illustration to quantitative graphs
Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantitative concept diagrams (QCDs). Existing charting and illustration programs ... Keywords: charting, constraint-based layout, illustration, information visualization, planar map coloring, quantitative concept diagrams, snap-dragging
Robin Stewart; m.c. schraefel
The Hazard Analysis Database was developed in conjunction with the hazard analysis activities conducted in accordance with DOE-STD-3009-94, Preparation Guide for U S . Department of Energy Nonreactor Nuclear Facility Safety Analysis Reports, for HNF-SD-WM-SAR-067, Tank Farms Final Safety Analysis Report (FSAR). The FSAR is part of the approved Authorization Basis (AB) for the River Protection Project (RPP). This document describes, identifies, and defines the contents and structure of the Tank Farms FSAR Hazard Analysis Database and documents the configuration control changes made to the database. The Hazard Analysis Database contains the collection of information generated during the initial hazard evaluations and the subsequent hazard and accident analysis activities. The Hazard Analysis Database supports the preparation of Chapters 3 ,4 , and 5 of the Tank Farms FSAR and the Unreviewed Safety Question (USQ) process and consists of two major, interrelated data sets: (1) Hazard Analysis Database: Data from the results of the hazard evaluations, and (2) Hazard Topography Database: Data from the system familiarization and hazard identification.
Update to the Ground-Water Withdrawals Database for the Death Valley REgional Ground-Water Flow System, Nevada and California, 1913-2003
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.
Michael T. Moreo; and Leigh Justet
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the `labels' are ma...
Caetano, Tiberio S; Cheng, Li; Le, Quoc V; Smola, Alex J
Almost self-centered graphs
The center of a graph is the set of vertices with minimum eccentricity. Graphs in which all vertices are central are called self-centered graphs. In this paper almost self-centered (ASC) graphs are introduced as the graphs with exactly two non-central vertices. The block structure of these graphs is described and constructions for generating such graphs are proposed. Embeddings of arbitrary graphs into ASC graphs are studied. In particular it is shown that any graph can be embedded into an ASC graph of prescribed radius. Embeddings into ASC graphs of radius two are studied in more detail. Embedding index of a graph G is introduced as the smallest number of vertices needed to add to G such that G is an induced subgraph of an ASC graph.
Sandi Klavzar; et al.
Electronic tools for designing charts and graphs
This thesis explores the issues involved in designing an interactive chart and graph making system, especially tailored to the needs of the graphic designer. It defines a set of user interface requirements and describe the ...
Jones, Mary, M.S.V.S. Massachusetts Institute of Technology
Database Manipulation on Quantum Computers
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
Ahmed Younes
Task 3.0:Life-Cycle Database for Wind Energy Systems
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.
Janet M Twomey, PhD
Claw-free graphs and line graphs.
??The research of my dissertation is motivated by the conjecture ofThomassen that every 4-connected line graph is hamiltonian and by the conjecture ofTutte that every� (more)
Shao, Yehong, 1976-
A hybrid data structure for dense keys in in-memory database systems
This thesis presents a data structure which performs well for in-memory indexing of keys that are unevenly distributed into clusters with a high density of keys. This pattern is prevalent, for example, in systems that use ...
Mu�iz Navarro, Jos� Alberto
ADANS database specification
The purpose of the Air Mobility Command (AMC) Deployment Analysis System (ADANS) Database Specification (DS) is to describe the database organization and storage allocation and to provide the detailed data model of the physical design and information necessary for the construction of the parts of the database (e.g., tables, indexes, rules, defaults). The DS includes entity relationship diagrams, table and field definitions, reports on other database objects, and a description of the ADANS data dictionary. ADANS is the automated system used by Headquarters AMC and the Tanker Airlift Control Center (TACC) for airlift planning and scheduling of peacetime and contingency operations as well as for deliberate planning. ADANS also supports planning and scheduling of Air Refueling Events by the TACC and the unit-level tanker schedulers. ADANS receives input in the form of movement requirements and air refueling requests. It provides a suite of tools for planners to manipulate these requirements/requests against mobility assets and to develop, analyze, and distribute schedules. Analysis tools are provided for assessing the products of the scheduling subsystems, and editing capabilities support the refinement of schedules. A reporting capability provides formatted screen, print, and/or file outputs of various standard reports. An interface subsystem handles message traffic to and from external systems. The database is an integral part of the functionality summarized above.
Sustainable Energy Solutions Task 3.0:Life-Cycle Database for Wind Energy Systems
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.
[Geothermal system temperature-depth database and model for data analysis]. 5. quarterly technical progress report
During this first quarter of the second year of the contract activity has involved several different tasks. The author has continued to work on three tasks most intensively during this quarter: the task of implementing the data base for geothermal system temperature-depth, the maintenance of the WWW site with the heat flow and gradient data base, and finally the development of a modeling capability for analysis of the geothermal system exploration data. The author has completed the task of developing a data base template for geothermal system temperature-depth data that can be used in conjunction with the regional data base that he had already developed and is now implementing it. Progress is described.
FISH: a practical system for fast interactive image search in huge databases
The problem of search and retrieval of images using relevance feedback has attracted tremendous attention in recent years from the research community. A real-world-deployable interactive image retrieval system must (1) be accurate, (2) require minimal ... Keywords: content extraction, dynamic indexing, image retrieval, long term learning, relevance feedback, scalability, short term learning
Pradhee Tandon; Piyush Nigam; Vikram Pudi; C V. Jawahar
directed acyclic word graph
... and R. Verin, Direct Construction of Compact Directed Acyclic Word Graphs, 8th Annual Symposium, CPM 97, Aarhus, Denmark, 116-129, 1997. ...
NPP Database Dictionary
The NPP Database Dictionary defines the common terms, codes, and conventions used in the database. Data in the NPP Database may have been reformatted to achieve consistency in...
NETL: Computer Software & Databases
Databases Crude Oil Analysis Database: Database contains information on 9,056 crude oil analyses performed at the National Institute for Petroleum and Energy Research (NIPER). The...
2nd Quarterly technical progress report for geothermal system temperature-depth database
At the Southern Methodist University Geothermal Laboratory in Dallas, Texas, the Earth`s surface and internal temperature are studied. With financial support from the U.S. Department of Energy, a data base containing geothermal temperature well information for the United States is being developed. During this calendar quarter, activity with this project has continued involving several different tasks: planning and development of the geothermal system thermal-well data base and temperature-depth data, development of the specifications for the data base, and completion of an initial inventory of the geothermal areas for which data are available.
Slicibility of rectangular graphs and floorplan optimization
Keywords: floorplanning, graph dualization, heuristic search, nonslicible floorplans, planar graphs, slicible floorplans, very large scale integration
Partha S. Dasgupta; Susmita Sur-Kolay
NETL: 2010 World Gasification Database Archive
Home > Technologies > Coal & Power Systems > Gasification Systems > 2010 World Gasification Database Home > Technologies > Coal & Power Systems > Gasification Systems > 2010 World Gasification Database Gasification Systems 2010 Worldwide Gasification Database Archive DOE/NETL 2010 Worldwide Gasification Database Worldwide Gasification Database Analysis 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.
Aging in reversible dynamics of disordered systems. I. Emergence of the arcsine law in Bouchaud's asymmetric trap model on the complete graph
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.
V�ronique Gayrard
Undirected Graphs maze exploration
and Adar, 2004 corporate e-mail #12;5 Power transmission grid of Western US Reference: Duncan Watts #12 The Internet as mapped by The Opte Project http://www.opte.org #12;8 Graph terminology #12;9 Some graph
Sedgewick, Robert
Detachments of Complete Graphs
A detachment of a graph $G$ is formed by splitting each vertex into one or more subvertices, and sharing the incident edges arbitrarily among the subvertices. In this paper we consider the question of whether a graph $H$ is a detachment of some complete ...
Keith Edwards
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
The rapidly increasing volume of information contained in relational databases places a strain on databases, performance, and maintainability: DBAs are under greater pressure than ever to optimize database structure for system performance and administration. ... Keywords: Data Modeling & Design, Data Warehousing, Database Management, Information Technology
Sam S. Lightstone; Toby J. Teorey; Tom Nadeau
Linguistic Databases
this paper is organized as follows. We first provide a brief introduction to relevant aspects of Russian morphology and nominalization. We then turn to the question of the argument structure of deverbal nominals, providing a short summary of Grimshaw's analysis of English nominalizations. The following sections focus on the Russian data and the database application. A final section presents our findings. The reader who is interested primarily on our linguistic findings may find a preliminary analysis of these in Sadler, Spencer and Zaretskaya 1994.
Andrew Bredenkamp; Louisa Sadler; Andrew Spencer
NIST: Triatomic Spectral Database
... are listed with one standard deviation uncertainty for all values. ... Database Main Page Molecular Spectral Databases: Microwaves home page. ...
A Semantic Graph Query Language
Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.
Kaplan, I L
Continuous Time Group Discovery in Dynamic Graphs
With the rise in availability and importance of graphs and networks, it has become increasingly important to have good models to describe their behavior. While much work has focused on modeling static graphs, we focus on group discovery in dynamic graphs. We adapt a dynamic extension of Latent Dirichlet Allocation to this task and demonstrate good performance on two datasets. Modeling relational data has become increasingly important in recent years. Much work has focused on static graphs - that is fixed graphs at a single point in time. Here we focus on the problem of modeling dynamic (i.e. time-evolving) graphs. We propose a scalable Bayesian approach for community discovery in dynamic graphs. Our approach is based on extensions of Latent Dirichlet Allocation (LDA). LDA is a latent variable model for topic modeling in text corpora. It was extended to deal with topic changes in discrete time and later in continuous time. These models were referred to as the discrete Dynamic Topic Model (dDTM) and the continuous Dynamic Topic Model (cDTM), respectively. When adapting these models to graphs, we take our inspiration from LDA-G and SSN-LDA, applications of LDA to static graphs that have been shown to effectively factor out community structure to explain link patterns in graphs. In this paper, we demonstrate how to adapt and apply the cDTM to the task of finding communities in dynamic networks. We use link prediction to measure the quality of the discovered community structure and apply it to two different relational datasets - DBLP author-keyword and CAIDA autonomous systems relationships. We also discuss a parallel implementation of this approach using Hadoop. In Section 2, we review LDA and LDA-G. In Section 3, we review the cDTM and introduce cDTMG, its adaptation to modeling dynamic graphs. We discuss inference for the cDTM-G and details of our parallel implementation in Section 4 and present its performance on two datasets in Section 5 before concluding in Section 6.
Miller, K; Eliassi-Rad, T
Crawling Online Social Graphs
Unbiased sampling of facebook,� 2009. [9] A. Korolova, R.these users. For example, Facebook was ranked as the 4thsample (1M node) of the Facebook graph. The basic idea is
Ye, Shaozhi; Lang, Juan; Wu, S F
Groundwater Database | Department of Energy
Groundwater Database Groundwater Database Groundwater Database DOE has one of the largest ground water contamination problems and subsequent cleanup responsibilities for a single entity in the world, in terms of the sheer volume of affected groundwater, number of plumes, range of hydrogeologic settings, and diversity of contaminant types. The Groundwater Database was developed to provide a centralized location for information relating to groundwater flow, contamination, and remedial approaches across the DOE complex. The database provides DOE management and other interested parties with an easily accessible, high level understanding of the type of contamination, magnitude of contamination, and dynamics of groundwater systems at DOE sites. It also identifies remedial approaches, exit strategies, long-term stewardship requirements, regulatory
ARTI refrigerant database
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.
Calm, J.M.
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.
Calm, J.M. [Calm (James M.), Great Falls, VA (United States)] [Calm (James M.), Great Falls, VA (United States)
Analyzing uncertainty in TG protection graphs with TG/MC
We introduce TG/MC, a Monte Carlo approach for evaluating the impact of uncertainty about vulnerabilities upon forecasts of security for a real-world system modeled by a protection graph. A TG/MC model defines a vulnerability as a potential change to ... Keywords: Monte Carlo, TG, Take-Grant, protection graph, security
James R. Conrad; Jim Alves-Foss; Sauchi Stephen Lee
Towards graph containment search and indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g ? D such that q contains g (q ? g). Due to the wide adoption of graph models, fast containment search ...
Chen Chen; Xifeng Yan; Philip S. Yu; Jiawei Han; Dong-Qing Zhang; Xiaohui Gu
Algorithms for string and graph layout
Many graph optimization problems can be viewed as graph layout problems. A layout of a graph is a geometric arrangement of the vertices subject to given constraints. For example, the vertices of a graph can be arranged on ...
Newman, Alantha.
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) graphs. The knn graph of a data set is obtained by connecting each point ... Keywords: Approximate nearest neighbors, Distributed and parallel algorithms, Metric spaces, Nearest neighbors, Range queries, Robotics, knn graphs
Erion Plaku; Lydia E. Kavraki
National Carbon Sequestration Database and Geographical Information...
of this project is to construct a relational database management system with spatial query capabilities to evaluate the geographic distribution, physical characteristics,...
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a challenging task to mine for frequent patterns in this new graph model ...
Ali Cakmak; Gultekin Ozsoyoglu
Analysis of multilevel graph partitioning
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide excellent graph partitions. However, there exists little theoretical analysis ...
George Karypis; Vipin Kumar
Graph theoretic approach to parallel gene assembly
We study parallel complexity of signed graphs motivated by the highly complex genetic recombination processes in ciliates. The molecular gene assembly operations have been modeled by operations of signed graphs, i.e., graphs where the vertices have a ... Keywords: Double-split graphs, Gene assembly, Local complement, Parallel assembly, Perfect matching, Signed graphs, Split graphs
Tero Harju; Chang Li; Ion Petre
Temporal Representation in Semantic Graphs
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.
Levandoski, J J; Abdulla, G M
Design and development of algorithms for identifying termination of triggers in active databases
An active database system is a conventional database system extended with a facility for managing triggers (or active rules). Active database systems can react to the occurrence of some predefined events automatically. In many applications, active rules ...
R. Manicka Chezian; T. Devi
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.
Errors in graph embedding algorithms
One major area of difficulty in developing an algorithm for embedding a graph on a surface is handling bridges which have more than one possible placement. This paper addresses a number of published algorithms where this has not been handled correctly. ... Keywords: Algorithm, Graph embedding, Graph genus, Torus
Wendy Myrvold; William Kocay
Extremal graphs without 4-cycles
We prove an upper bound for the number of edges a C"4-free graph on q^2+q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q. Keywords: Extremal graph, Polarity, Projective plane
Frank A. Firke, Peter M. Kosek, Evan D. Nash, Jason Williford
Databases | Department of Energy
Databases Databases Databases November 1, 2013 - 11:40am Addthis DOE has supported the development of several combined heat and power (CHP) and distributed energy (DE) databases that have proven to be "go-to" resources for end users. These resources include an installation database that tracks CHP projects in all end-use sectors for all 50 states, as well as a database of regulatory requirements for small electric generators. A searchable database of CHP project profiles compiled by the DOE Regional Clean Energy Application Centers (CEACs) is also available. CHP Project Profiles Database (launched Feb. 2011 and continuously updated) CHP State and Regional Installation Database, May 2010 Database of State Incentives for Renewables and Efficiency (DSIRE) - CHP
Use of the Accessware Interface/Database Software in the Neutral Beam Control Systems Used by the DIII-D Tokamak
The complexities of monitoring and controlling the various DIII-D Tokamak systems have always required the aid of high-speed computer resources. Recent upgrades in computer hardware to the DIII-D central operations and Neutral Beam computer systems have forced a redesign of the corresponding software. These newer systems cannot make use of the antiquated computer platforms of the past. Entirely new software has been written/installed to replace the old. During the design and development many newer features have been added; especially in the realm of Graphical User Interfaces and database management. For most of the systems involved, this required the implementation of a third party software, including a crucial package written by AccessWare Inc. of Houston Texas.
Piglowski, D.; Penaflor, B.G.; Phillips, J.C.
Quantum secret sharing with qudit graph states
We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.
Keet, Adrian; Fortescue, Ben; Sanders, Barry C. [Institute for Quantum Information Science, University of Calgary, Alberta, T2N 1N4 (Canada); Markham, Damian [LTCI-CNRS, Telecom ParisTech, 37/39 rue Dareau, F-75014 Paris (France)
Adrian Keet; Ben Fortescue; Damian Markham; Barry C. Sanders
Diagnosability of star graphs with missing edges
In this paper, we study the system diagnosis on an n-dimensional star under the comparison model. Following the concept of local diagnosability [3], the strong local diagnosability property [7] is discussed; this property describes the equivalence of ... Keywords: Comparison diagnosis model, Extended star structure, Local diagnosability, MM* diagnosis model, Star graph, Strong local diagnosability property
Chieh-Feng Chiang; Guo-Huang Hsu; Lun-Min Shih; Jimmy J. M. Tan
Multithreaded Algorithms for Graph Coloring
Graph algorithms are challenging to parallelize when high performance and scalability are primary goals. Low concurrency, poor data locality, irregular access pattern, and high data access to computation ratio are among the chief reasons for the challenge. The performance implication of these features is exasperated on distributed memory machines. More success is being achieved on shared-memory, multi-core architectures supporting multithreading. We consider a prototypical graph problem, coloring, and show how a greedy algorithm for solving it can be e*ectively parallelized on multithreaded architectures. We present in particular two di*erent parallel algorithms. The first relies on speculation and iteration, and is suitable for any shared-memory, multithreaded system. The second uses data ow principles and is targeted at the massively multithreaded Cray XMT system. We benchmark the algorithms on three di*erent platforms and demonstrate scalable runtime performance. In terms of quality of solution, both algorithms use nearly the same number of colors as the serial algorithm.
Catalyurek, Umit V.; Feo, John T.; Gebremedhin, Assefaw H.; Halappanavar, Mahantesh; Pothen, Alex
The test data challenge for database-driven applications
Business applications rely typically on databases for storing and processing their data (database-driven applications, or DBAPs). Testing DBAPs requires testing the application logic plus the interaction between the application logic and the database. ... Keywords: databases, information systems, test coverage, test data, testing
Klaus Haller
Transparent Cost Database | Transparent Cost Database
Hide data for this chart (-)Show data for this chart (+) Loading data... Transparent Cost Database Generation Showing: Historical Projections Year Published: Release mouse to...
Quantum chaos on discrete graphs
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}.
Uzy Smilansky
GELBANK : A database of annotated two-dimensional gel electrophoresis patterns of biological systems with completed genomes.
GELBANK is a publicly available database of two-dimensional gel electrophoresis (2DE) gel patterns of proteomes from organisms with known genome information (available at and ftp://bioinformatics.anl.gov/gelbank/). Currently it includes 131 completed, mostly microbial proteomes available from the National Center for Biotechnology Information. A web interface allows the upload of 2D gel patterns and their annotation for registered users. The images are organized by species, tissue type, separation method, sample type and staining method. The database can be queried based on protein or 2DE-pattern attributes. A web interface allows registered users to assign molecular weight and pH gradient profiles to their own 2D gel patterns as well as to link protein identifications to a given spot on the pattern. The website presents all of the submitted 2D gel patterns where the end-user can dynamically display the images or parts of images along with molecular weight, pH profile information and linked protein identification. A collection of images can be selected for the creation of animations from which the user can select sub-regions of interest and unlimited 2D gel patterns for visualization. The website currently presents 233 identifications for 81 gel patterns for Homo sapiens, Methanococcus jannaschii, Pyro coccus furiosus, Shewanella oneidensis, Escherichia coli and Deinococcus radiodurans.
Babnigg, G.; Giometti, C. S.; Biosciences Division
Lessons Learned Database | Department of Energy
Lessons Learned Database Lessons Learned Database Lessons Learned Database The DOE Corporate Lessons Learned Database provides a central clearinghouse that allows ready access to and communication about collected information on a timely, unimpeded basis by all DOE elements. The database is used to collect and share lessons learned and best practices pertaining to all DOE activities Lessons Learned Database Login Welcome to the Lessons Learned site, the premier Web tool for online information sharing regarding Lessons Learned issues. Please login to access your profile, search the database, or submit a new Lesson Learned. User Log In: If you have already received your log in credentials for the DOE Lessons Learned system click here to log in. Create New Account: We do not allow anonymous access to this site. You must register for an
Graph Homomorphisms for Quantum Players
A homomorphism from a graph X to a graph Y is an adjacency preserving mapping f:V(X)->V(Y). We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph X admits a homomorphism to Y. This is a generalization of the well-studied graph coloring game. Via systematic study of quantum homomorphisms we prove new results for graph coloring. Most importantly, we show that the Lovasz theta number of the complement lower bounds the quantum chromatic number, which itself is not known to be computable. We also show that other quantum graph parameters, such as quantum independence number, can differ from their classical counterparts. Finally, we show that quantum homomorphisms closely relate to zero-error channel capacity. In particular, we use quantum homomorphisms to construct graphs for which entanglement-assistance increases their one-shot zero-error capacity.
David E. Roberson; Laura Mancinska
CALIFORNIA ENERGY Small HVAC Database Of Monitored
CALIFORNIA ENERGY COMMISSION Small HVAC Database Of Monitored Information Database of Compiled of the Integrated Design of Small Commercial HVAC Systems research project. The reports are a result of funding: Productivity and Interior Environments Integrated Design of Large Commercial HVAC Systems Integrated Design
Temporally Scalable Visual SLAM using a Reduced Pose Graph
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 ...
Johannsson, Hordur
Genome Properties Database
DOE Data Explorer (OSTI)
The Genome Properties system consists of a suite of "Properties" which are carefully defined attributes of prokaryotic organisms whose status can be described by numerical values or controlled vocabulary terms for individual completely sequenced genomes. Evaluation of these properties may take place via manual curation or by computer algorithms (numerical calculations or rules-based assignment of controlled vocabulary terms). The Genome Properties system has been designed to capture the widest possible range of attributes and currently encompasses taxonomic terms, genometric calculations, metabolic pathways, systems of interacting macromolecular components and quantitative and descriptive experimental observations (phenotypes) from the literature. Wherever possible, Genome Properties are linked to traceable lines of evidence and links are provided to data for any genes which are part of this evidence. The primary source of evidence linking genes to properties is homology modelling using Hidden Markov Models (HMMs) from the TIGRFAMs and Pfam databases. (Taken from the Genome Properties Home Page)(Specialized Interface)
Haft, Daniel H.; Selengut, Jeremy D.; Brinkac, Lauren M.; Zafar, Nikhat; White, Owen
Games on Graphs
We introduce and study Maker-Breaker positional games on random graphs. Our goal is to determine the threshold probability pF for the existence of Maker's strategy to claim a member of F in the unbiased (one-on-one) game played on the edges of the random graph G(n; p), for various target families F of winning sets. More generally, for each probability above this threshold we study the smallest bias b such that Maker wins the (1: b) biased game. We investigate these functions for a number of basic games, like the connectivity game, the perfect matching game, the clique game, the Hamiltonian cycle game and the tree game. Particular attention is devoted to unbiased games, when b = 1. Next, we consider the planarity game and the k-coloring game on the complete graph on n vertices. In the planarity game the winning sets are all non-planar subgraphs, and in the k-coloring game the winning sets are all non-k-colorable subgraphs. For both of the games we look at a (1: b) biased game. We are interested in determining the largest bias b such that Maker wins the Maker-Breaker version of the game. On the other hand, we want to find the largest bias b such that Forcer wins the Avoider-Forcer version of the game. Finally, we deal with balanced online games on the random graph process. The game is played by a player called Painter. Edges in the random graph process are introduced two at a time. For each pair of edges Painter immediately and irrevocably chooses one of the two possibilities to color one of them red and the other one blue. His goal is to avoid creating a monochromatic copy of a prescribed fixed graph H, for as long as possible. We study the threshold mH for the number of edges to be played to know that Painter almost surely will create a monochromatic copy of H, for H being a cycle, a path and a star.
Milos Stojakovic
A new user-friendly experiment visual database system application to the gas migration test (GMT) at the Grimsel test site
Available in abstract form only. Full text of publication follows: Long-term integrated field investigations combine information from different groups (laboratory, modeling, experimental) often working in different locations and on different time scales. The results of these different groups are evaluated and integrated for decision making during the experiment execution, but at the end of the experiment a huge database exists, which may be difficult to use at a later stage - for example, for further modeling, benchmarking etc. How can one preserve the information obtained and present it in a transparent and user-friendly manner? A new visual database system developed is presented and its application to the 'Gas Migration in-situ Test (GMT)' is described. The GMT project has been conducted to assess the gas migration (for example from TRU waste) through the engineered barrier system and the adjacent geosphere. The experiment was initiated in 1997 under the auspices of RWMC and with primary funding by the Japanese Ministry of Economy, Trade and Industry. The project consists of a large-scale in-situ test, laboratory tests and numerical modeling. The in-situ test has been performed at the Grimsel Test Site (GTS) in Switzerland operated by NAGRA (National cooperative for the disposal of radioactive waste, Switzerland). Laboratory tests have been performed in facilities in Japan, Germany, Spain and Switzerland. Finally, the modeling activities, performed within the modeling group, have included teams from the US, Spain, France, Japan, Germany and Switzerland with support from organizations BGR, ENRESA, ANDRA, and RWMC. More than 250 reports document the various data and analyses. The database developed uses a three layered framework. The first (or bottom) layer is the data storage which contains all reports, publications as well as the raw data; the second layer is a data flow diagram - from material data, generation of input data to the model and output to the end user; the third layer is the interface with external users to facilitate optimal use of the database for their needs - it includes search through key words, publication year, data type etc. (authors)
Shimura, Tomoyuki; Asano, Hidekazu [RWMC, N0.15 Mori Bldg., 2-8-10, Toranomon, Minato-ku, Tokyo (Japan); Ando, Kenichi; Okuma, Fumiko; Yamamoto, Shuichi [Obayashi Corporation, SHinagawa InterCity B, 2-15-2, Konan, Minatoku, Tokyo, 108-8502 (Japan); Vomvoris, Stratis [NAGRA, Wettingen (Switzerland)
d UNIVERSITY OF CALIFORNIA NUCLEAR STRUCTURE DATABASE R. B.IS UNLfflfTEO LBL-11089 NUCLEAR STRUCTURE DATABASE by R.B.and E. Browne June 1980 Nuclear Science Division University
Firestone, R.B.
Partial pattern databases
Perimeters and pattern databases are two similar memorybased techniques used in single-agent search problems.We present partial pattern databases, which unify the two approaches into a single memorybased heuristic table. Our approach allows the use of ...
Kenneth Anderson; Robert Holte; Jonathan Schaeffer
Partial information endgame databases
Endgame databases have previously been built based on complete analysis of endgame positions. In the domain of Checkers, where endgame databases consisting of 39 trillion positions have already been built, it would be beneficial to be able to ...
Yngvi Bj�rnsson; Jonathan Schaeffer; Nathan R. Sturtevant
Thermodynamic Databases - TMS
Apr 8, 2008 ... Thermodynamic databases are developed by teams of experts critically assessing all experimental phase equilibrium and thermodynamic data.
BIOFUELS 3D Database
BIOFUEL Database. NIST Home. BIOFUEL 3-D Structures ( Help / Contact / Rate Our Product and Services / NIST privacy policy ). Search: ...
Distributed large-scale natural graph factorization
Natural graphs, such as social networks, email graphs, or instant messaging patterns, have become pervasive through the internet. These graphs are massive, often containing hundreds of millions of nodes and billions of edges. While some theoretical models ... Keywords: asynchronous algorithms, distributed optimization, graph algorithms, graph factorization, large-scale machine learning, matrix factorization
Amr Ahmed, Nino Shervashidze, Shravan Narayanamurthy, Vanja Josifovski, Alexander J. Smola
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, ... Keywords: Crossing number, Geometric graphs, Proximity graphs
Bernardo M. �brego; Ruy Fabila-Monroy; Silvia Fern�ndez-Merchant; David Flores-Pe�aloza; Ferran Hurtado; Vera Sacrist�n; Maria Saumell
A history of graph entropy measures
This survey seeks to describe methods for measuring the entropy of graphs and to demonstrate the wide applicability of entropy measures. Setting the scene with a review of classical measures for determining the structural information content of graphs, ... Keywords: Entropy, Graph complexity, Graph entropy, Graphs, Information inequalities, Information measures, Information theory, Structural complexity
Matthias Dehmer; Abbe Mowshowitz
Coalfleet IGCC Permits Database
The CoalFleet IGCC Permits Database presents comprehensive information on permitting requirements and permit conditions for Integrated Gasification Combined Cycle (IGCC) power plants in an online database format. This Technical Update is a compilation of the Database contents as of April 1, 2009.
Search Results from DOE Databases
Office of Scientific and Technical Information (OSTI)
Information Bridge Energy Citations Database DOE R&D Accomplishments Database DOE Data Explorer Climate Modeling Information Bridge Energy Citations Database DOE R&D...
A graph theoretic approach to ultrafast information distribution: Borel Cayley graph resizing algorithm
A graph theoretic approach is proposed to formulate communication graphs that enable ultrafast information distribution. In our earlier work, we reported that Borel Cayley graph (BCG) is a promising candidate as a logical topology for fast information ... Keywords: Borel Cayley graph, Cayley graph, Graph theory, Interconnection networks, Network modeling
Jaewook Yu; Eric Noel; K. Wendy Tang
Clustering based on a near neighbor graph and a grid cell graph
This paper presents two novel graph-clustering algorithms, Clustering based on a Near Neighbor Graph (CNNG) and Clustering based on a Grid Cell Graph (CGCG). CNNG algorithm inspired by the idea of near neighbors is an improved graph-clustering method ... Keywords: Clustering, Grid Cell Graph, Grid cell, Near Neighbor Graph, Near neighbor point set
Xinquan Chen
Energy of graphs and digraphs.
??The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the� (more)
Jahanbakht, Nafiseh
MEMS based storage architecture for relational databases
Due to recent advances in semiconductor manufacturing, the gap between main memory and disks is constantly increasing. This leads to a significant performance bottleneck for Relational Database Management Systems. Recent advances in nanotechnology have ... Keywords: Data placement, MEMS, Relational databases, Storage
Hailing Yu; Divyakant Agrawal; Amr El Abbadi
HLDB: location-based services in databases
This paper introduces HLDB, the first practical system that can answer exact spatial queries on continental road networks entirely within a database. HLDB is based on hub labels (HL), the fastest point-to-point algorithm for road networks, and ... Keywords: SQL, databases, large road networks, location services
Ittai Abraham; Daniel Delling; Amos Fiat; Andrew V. Goldberg; Renato F. Werneck
Skewed graph partitioning
Graph partitioning is an important abstraction used in solving many scientific computing problems. Unfortunately, the standard partitioning model does not incorporate considerations that are important in many settings. We address this by describing a generalized partitioning model which incorporates the notion of partition skew and is applicable to a variety of problems. We then develop enhancements to several important partitioning algorithms necessary to solve the generalized partitioning problem. Finally we demonstrate the benefit of employing several of these generalized methods to static decomposition of parallel computing problems.
Hendrickson, B.; Leland, R. [Sandia National Labs., Albuquerque, NM (United States); Van Driessche, R. [Alcatel Telecom, Antwerp (Belgium)
On Generating Random Network Structures: Connected Graphs
are presented for random generation of connected graphs, sugraphs (sub- graphs on the ... a distribution and take it into account at estimation. Attainability is�...
From quantum graphs to quantum random walks
We give a short overview over recent developments on quantum graphs and outline the connection between general quantum graphs and so-called quantum random walks.
Gregor Tanner
Quantum networks modelled by graphs
Quantum networks are often modelled using Schr�dinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article we give a survey
Pavel Exner; Olaf Post
Robust Hamiltonicity of Dirac graphs
A graph is Hamiltonian if it contains a cycle which passes through every vertex of the graph exactly once. A classical theorem of Dirac from 1952 asserts that every graph on $n$ vertices with minimum degree at least $n/2$ is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we extend Dirac's theorem in two directions and show that Dirac graphs are robustly Hamiltonian in a very strong sense. First, we consider a random subgraph of a Dirac graph obtained by taking each edge independently with probability $p$, and prove that there exists a constant $C$ such that if $p \\ge C \\log n / n$, then a.a.s. the resulting random subgraph is still Hamiltonian. Second, we prove that if a $(1:b)$ Maker-Breaker game is played on a Dirac graph, then Maker can construct a Hamiltonian subgraph as long as the bias $b$ is at most $cn /\\log n$ for some absolute constant $c > 0$. Both of these results are tight up to a constant factor, and are proved under one general framework.
Krivelevich, Michael; Sudakov, Benny
Domain-independent data cleaning via analysis of entity-relationship graph
In this article, we address the problem of reference disambiguation. Specifically, we consider a situation where entities in the database are referred to using descriptions (e.g., a set of instantiated attributes). The objective of reference disambiguation ... Keywords: Connection strength, RelDC, data cleaning, entity resolution, graph analysis, reference disambiguation, relationship analysis
Dmitri V. Kalashnikov; Sharad Mehrotra
Transfer of Physical and Hydraulic Properties Databases to the Hanford Environmental Information System - PNNL Remediation Decision Support Project, Task 1, Activity 6
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.
Rockhold, Mark L.; Middleton, Lisa A.
Thermodynamic databases - TMS
Apr 8, 2008 ... Fe-DATA * Ni-DATA * NiFe-Super * Ti-DATA * TiAl-DATA Citation: " Thermodynamic databases," Thermotech Sente Software. Launch Site.
NIST Special Database 25
... recognition (OCR) results from a page with typesetting files for an entire book. ... volume of the database contains the pages of 20 books published in ...
All the terms used throughout the ORNL DAAC NPP Database (principally associated with sites in the grassland biome) are defined below. Since the field measurements were collected...
NIST Special Database 23
... NIST TREC Document Database: Disk 5. Rate our Products and Services. ... have all been compressed using the UNIX compress utility and are stored ...
NIST Special Database 22
... NIST TREC Document Database: Disk 4. Rate our Products and Services. ... have all been compressed using the UNIX compress utility and are stored ...
NIST Database Discalimer
... of Standards and Technology (NIST) uses its best efforts to deliver a high quality copy of the Database and to verify that the data contained therein ...
Biocatalysis - Biodegradation Database
Ellis LBM, Roe D, Wackett LP (2006) "The University of Minnesota Biocatalysis-Biodegradation Database: The First Decade," Nucleic Acids Research 34: D517-D521.
Ellis, Lynda; Roe, Dave; Wackett, Lawrence
Central Internet Database (CID)
Office of Environmental Management (EM)
RADCM-13 Reports Central Internet Database CID Photo Banner RADCM-13 Archived Reports By State California Adobe PDF Document Colorado Adobe PDF Document Idaho Adobe PDF Document...
Case Study 1 The database system that you are to implement in this project is for a typical Car Rental
customers. The company keeps a number of offices in a variety of cities and locations within each city. Each a vehicle, the company records the customer name, address, phone number (with the area code). A customer a reservation, the customer provides her/his name and phone number, and the system prints a confirmation number
Lakshmanan, Laks V.S.
Lessons Learned From Developing Reactor Pressure Vessel Steel Embrittlement Database
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.
Wang, Jy-An John [ORNL
Sequoia retains top ranking on Graph 500 for third year running
12113_sequoia 12113_sequoia 11/21/2013 High Resolution Image Lawrence Livermore's Sequoia supercomputer again retained its No. 1 ranking on the Graph 500 list. Sequoia retains top ranking on Graph 500 for third year running Donald B Johnston, LLNL, (925) 423-4902, email@example.com High Resolution Image From left: LLNL's Adam Bertsch, Dona Crawford and Scott Futral with the certificate for No. 1 on the Graph 500 in the SC13 DOE booth. LLNL's 20 petaflops Sequoia supercomputer again retained its No. 1 ranking on the Graph 500 list, a measure of a system's ability to conduct analytic calculations -- finding the proverbial needle in the haystack. An IBM Blue Gene Q system, Sequoia was able to traverse 15,363 giga edges per second on a scale of 40 graph (a graph with 2^40 vertices). The new
Database Support for Weighted Match Joins
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics that differ from those appropriate for traditional RDBMS applications. ...
Ameet Kini; Jeffrey F. Naughton
Database activities at Brookhaven National Laboratory
Brookhaven National Laboratory is a multi-disciplinary lab in the DOE system of research laboratories. Database activities are correspondingly diverse within the restrictions imposed by the dominant relational database paradigm. The authors discuss related activities and tools used in RHIC and in the other major projects at BNL. The others are the Protein Data Bank being maintained by the Chemistry department, and a Geographical Information System (GIS)--a Superfund sponsored environmental monitoring project under development in the Office of Environmental Restoration.
Trahern, C.G.
database | OpenEI
database database Dataset Summary Description The Southern Methodist University (SMU) Geothermal Laboratory's database consists of primarily regional or background wells that determine the heat flow for the United States; temperature gradients and conductivity are used to generate heat flow measurements; some wells close together have been averaged; wells within geothermal anomalies are located, but not utilized in the regional analysis.Database includes: latitude/longitude, township/range, AMS sheet, well depth, elevation, max./min. temp, BHT, gradient(s), thermal conductivity, Source SMU Date Released Unknown Date Updated Unknown Keywords Alabama database geothermal SMU Data application/vnd.ms-excel icon Alabama geothermal data 2008 (xls, 19.5 KiB) Quality Metrics
A mobile agent approach for global database constraint checking
Integrity constraints are valuable tools for enforcing consistency of data in a database. Global integrity constraints ensure integrity and consistency of data spanning multiple databases. In this paper, we propose a general framework of a mobile agent ... Keywords: global constraints, mobile agents, multi-database systems
Praveen Madiraju; Rajshekhar Sunderraman
Probe threshold and probe trivially perfect graphs
An undirected graph G=(V,E) is a probeC graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E^'@?NxN such that G^'=(V,E@?E^') is a C graph. In this article we investigate probe ... Keywords: 2-SAT, Graph class, Probe graphs, Probe interval, Probe threshold, Probe trivially perfect
Daniel Bayer; Van Bang Le; H. N. de Ridder
Graph anomalies in cyber communications
Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.
Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory
2010 Worldwide Gasification Database
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. [Copied from http://www.netl.doe.gov/technologies/coalpower/gasification/worlddatabase/index.html
Dec 16, 2005 ... ?(G) of a graph G. We introduce an operator ? mapping any graph parameter ?( G), nested between ...... On the Shannon capacity of a graph.
Time Series Graphs of Global and Hemispheric Temperature Anomalies...
Time Series Graphs of Global and Hemispheric Temperature Anomalies graphics Graph - Global and Hemispheric Annual Temperature Anomalies, 1850-2012 graphics Graph - Northern...
Nested (2,r)-regular graphs and their network properties.
??A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. If a graph� (more)
Brooks, Josh Daniel
Demand Response Database & Demo
Demand Response Database & Demo Speaker(s): Mike Graveley William M. Smith Date: June 7, 2005 - 12:00pm Location: Bldg. 90 Seminar HostPoint of Contact: Mary Ann Piette Infotility...
Nuclear Science References Database
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.
B. Pritychenko; E. B?t�k; B. Singh; J. Totans
ARTI Refrigerant Database
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.
Calm, J.M. [Calm (James M.), Great Falls, VA (United States)
Target Database | Argonne National Laboratory
Science & Engineering Applications Target Database The Target database and analytical pipeline provides bioinformatics support and selection of protein targets of biomedical...
REDD+ Database | Open Energy Information
REDD+ Database REDD+ Database Jump to: navigation, search Tool Summary Name: REDD+ Database Agency/Company /Organization: Institute for Global Environmental Strategies Sector: Land Focus Area: Forestry Topics: Co-benefits assessment, Implementation, Background analysis Resource Type: Dataset Website: redd-database.iges.or.jp/redd/ REDD+ Database Screenshot References: REDD+ Database[1] Overview "The purpose of this database is to make information on REDD+ preparedness activities and projects available in a succinct manner to forest stakeholders and other interested groups, with the objective of supporting efforts to achieve climate change mitigation, resource conservation and positive development outcomes through sustainable forest management." References ↑ "REDD+ Database"
Note: A note on power domination in grid graphs
The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graphs (see [T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, ... Keywords: Grid, Power domination
Michael Dorfling; Michael A. Henning
A note on power domination in grid graphs
The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graphs (see [T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, ... Keywords: grid, power domination
Automatic Library Tracking Database Infrastructure
Libraries » ALTD Libraries » ALTD ALTD Automatic Library Tracking Database Infrastructure To track and monitor library usage and better serve your software needs, we have enabled the Automatic Library Tracking Database (ALTD) on our prodcution systems, Hopper and Edison. ALTD is also availailable on Carver, but has not enabled for all users by default yet. ALTD, developed by National Institute for Computational Sciences, automatically and transparently tracks all libraries linked into an application at compile time, as well as the libraries used at run time, by intercepting the linker (ld) and the job launcher (aprun, or mpirun). It is a light-weight tool, and should not change your experience with compilation and execution of codes on the machine. However, if you encounter any problems due to ALTD,
Crude Oil Analysis Database
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.
Shay, Johanna Y.
Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati
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
Kambhampati, Subbarao
Parallel Graph Transformation for Model Simulation applied to Timed Transition Petri Nets
This work discusses the use of parallel graph transformation systems for (multi-formalism) modeling and simulation and their implementation in the meta-modeling tool AToM^3. As an example, a simulator for Timed Transition Petri Nets (TTPN) is modeled ... Keywords: model simulation, parallel graph transformation, timed transition Petri nets
J. de Lara; C. Ermel; G. Taentzer; K. Ehrig
Active and passive rules for complex object databases
ecution: the management of multiple rules activation, and the definition ... the database management systems allowing the definition of ... maintenance [2: 3].
PR-EDB: Power Reactor Embrittlement Database - Version 3
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.
Wang, Jy-An John [ORNL; Subramani, Ranjit [ORNL
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
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.
Rockhold, Mark L.; Middleton, Lisa A.; Cantrell, Kirk J.
0-1 graph partitioning and image segmentation
Graph partitioning is the grouping of all the nodes in a graph into two or more partitions based on certain criteria. Graph cut techniques are used to partition a graph. The Minimum Cut method gives imbalanced partitions. ...
Goh, Chun Fan
A Scalable Database Approach to Computing Delaunay Triangulations
of database management systems in managing huge informa- tion stores for the commercial and governmental. Although unstructured scientific data sets do not map to the tabular representation of a database system. We have implemented our methodology in a prototype system called Abacus that tar- gets Delaunay
A discrete curvature on a planar graph
Given a planar graph derived from a spherical, euclidean or hyperbolic tessellation, one can define a discrete curvature by combinatorial properties, which after embedding the graph in a compact 2d-manifold, becomes the Gaussian curvature.
M. Lorente
Graph coloring and related symmetric functions - CECM
metric functions), pa (the power sum symmetric functions), s~ (the Schur functions ), ..... It is true for line graphs (a special class of claw-free graphs) by a result of.
Database Support for Probabilistic Attributes and Tuples
Abstract � The inherent uncertainty of data present in numerous applications such as sensor databases, text annotations, and information retrieval motivate the need to handle imprecise data at the database level. Uncertainty can be at the attribute or tuple level and is present in both continuous and discrete data domains. This paper presents a model for handling arbitrary probabilistic uncertain data (both discrete and continuous) natively at the database level. Our approach leads to a natural and efficient representation for probabilistic data. We develop a model that is consistent with possible worlds semantics and closed under basic relational operators. This is the first model that accurately and efficiently handles both continuous and discrete uncertainty. The model is implemented in a real database system (PostgreSQL) and the effectiveness and efficiency of our approach is validated experimentally. I.
Sarvjeet Singh; Chris Mayfield; Rahul Shah; Sunil Prabhakar; Susanne Hambrusch; Jennifer Neville; Reynold Cheng
Fire Protection Database | Department of Energy
Fire Protection Database 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 process used to collect the required data utilizes a Microsoft Access database that was downloaded, completed by the field and then sent to Headquarters for summation and analysis by engineers in Office of Sustainability Support. Data collection for the CY2013 Summary will begin Jan. 1, 2014, and a commitment has been made to the Defense Nuclear Facilities Safety Board to collect this information and make it available utilizing a standard systematic approach. This approach will be accomplished via a web based system which will allow reporting organizations to enter or edit information.
Solid Waste Projection Model: Database (Version 1. 3)
The Solid Waste Projection Model (SWPM) system is an analytical tool developed by Pacific Northwest Laboratory (PNL) for Westinghouse Hanford Company (WHC). The SWPM system provides a modeling and analysis environment that supports decisions in the process of evaluating various solid waste management alternatives. This document, one of a series describing the SWPM system, contains detailed information regarding the software and data structures utilized in developing the SWPM Version 1.3 Database. This document is intended for use by experienced database specialists and supports database maintenance, utility development, and database enhancement.
Blackburn, C.L.
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.
CID Reports > Archived CID Reports > Archived Reports Central Internet Database CID Photo Banner Archived Reports The reports in the Archived Reports section of the CID are based on the FY 2001 EM Corporate Database (except the Buried TRU Report). The EM Corporate database stores information on radioactive waste, contaminated media, and spent nuclear fuel by identifying "streams" of material. A "stream" is defined as a group of materials, media, or waste having similar origins or management requirements. Radioactive waste, contaminated media, or spent nuclear fuel may be part of more than one "stream" from the time it is generated to the time it is permanently disposed, depending on the physical location or the management activity it is undergoing. The CID retains the "stream" concept as part of its data structure.
Complex Glazing Database
1.2 1.2 This is a Beta version of the Complex Glazing Database (CGDB) for WINDOW 6. The data in the list below was measured by LBNL for this first data set. In the future, LBNL will publish measurement and submittal procedures so that manufacturers can submit their own data to LBNL for review and inclusion in subsequent databases, in a similar fashion to the International Glazing Database (IGDB). The numbering scheme for each manufacturer is a Beta scheme and will be further developed in the next few months. Alkenz USA Inc Shading Material Name BSDF XML File Shading Layer Name ID Type Sunshadow 3000, N901 Charcoal (SA-31) 2011-SA31.XML Sunshadow 3000, N901 Charcoal (WS) 7000 BSDF File Sunshadow 3100, N002 white/bone (SA-30) 2011-SA30.XML Sunshadow 3100, N002 white/bone (WS)
Methods | Transparent Cost Database
Methods Methods Disclaimer The data gathered here are for informational purposes only. Inclusion of a report in the database does not represent approval of the estimates by DOE or NREL. Levelized cost calculations DO NOT represent real world market conditions. The calculation uses a single discount rate in order to compare technology costs only. About the Cost Database For emerging energy technologies, a variety of cost and performance numbers are cited in presentations and reports for present-day characteristics and potential improvements. Amid a variety of sources and methods for these data, the Office of Energy Efficiency and Renewable Energy's technology development programs determine estimates for use in program planning. The Transparent Cost Database collects program cost and performance
FORAST Database (DB1005)
Atmospheric Trace Gases » Ozone » FORAST Database Atmospheric Trace Gases » Ozone » FORAST Database FORAST Database DOI: 10.3334/CDIAC/vrc.db1005 data Data Investigators S. B. McLaughlin, D. J. Downing, T. J. Blasing, B. L. Jackson, D. J. Pack, D. N. Duvick, L. K. Mann, and T. W. Doyle Description The Forest Responses to Anthropogenic Stress (FORAST) project was designed (1) to determine whether evidence of alterations of long-term growth patterns of several species of eastern forest trees was apparent in tree-ring chronologies from within the region and (2) to identify environmental variables that were temporally or spatially correlated with any observed changes. The project was supported principally by the U.S. Environmental Protection Agency (EPA) with additional support from the National Park Service.
Positional Games on Random Graphs
We introduce and study Maker/Breaker-type positional games on random graphs. Our main concern is to determine the threshold probability pF for the existence of Maker's strategy to claim a member of in the unbiased game played on the edges of random graph G(n, p), for various target families of winning sets. More generally, for each probability above this threshold we study the smallest bias b such that Maker wins the (1: b) biased game. We investigate these functions for a number of basic games, like the connectivity game, the perfect matching game, the clique game and the Hamiltonian cycle game.
Milos Stojakovic; Tibor Szabo
High Performance Buildings Database
The High Performance Buildings Database is a shared resource for the building industry. The Database, developed by the U.S. Department of Energy and the National Renewable Energy Laboratory (NREL), is 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. Early partners using the database include:
Copied (then edited) from http://eere.buildinggreen.com/partnering.cfm
"Cut me some slack": latency-aware live migration for databases
Cloud-based data management platforms often employ multitenant databases, where service providers achieve economies of scale by consolidating multiple tenants on shared servers. In such database systems, a key functionality for service providers is database ... Keywords: PID controller, cloud computing, control theory, database migration, multitenancy
Sean Barker; Yun Chi; Hyun Jin Moon; Hakan Hacig�m�?; Prashant Shenoy
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identifying highly associated groups and clusters. In this paper, we investigate ... Keywords: closed pattern, connectivity, graph
Xifeng Yan; X. Jasmine Zhou; Jiawei Han
Graph partitioning via recurrent multivalued neural networks
In this work, the well-known Graph Partitioning (GP) problem for undirected weighted graphs has been studied from two points of view: maximizing (MaxCut) or minimizing (MinCut) the cost of the cut induced in the graph by the partition. An unified model, ...
Enrique M�rida-Casermeiro; Domingo L�pez-Rodr�guez
Introducing complete graphs in molecular connectivity studies
The mathematical model of the molecular polarizability of fifty-four organic compounds, of the lattice enthalpy of twenty metal halides, and of the partition coefficient of twenty-five organic compounds has been used to test four different complete graph, ... Keywords: Mathematical model, algorithms, chemical graphs, complete graphs, core electrons, molecular connectivity, polarizability
Lionello Pogliani
Bipartite graph partitioning and data clustering
Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender ... Keywords: bipartite graph, correspondence analysis, document clustering, graph partitioning, singular value decomposition, spectral relaxation
Hongyuan Zha; Xiaofeng He; Chris Ding; Horst Simon; Ming Gu
A Graph Analytical Approach for Topic Detection
Topic detection with large and noisy data collections such as social media must address both scalability and accuracy challenges. KeyGraph is an efficient method that improves on current solutions by considering keyword cooccurrence. We show that KeyGraph ... Keywords: KeyGraph-based Topic Detection, Topic detection, community detection, network analysis
Hassan Sayyadi, Louiqa Raschid
Drawing graphs nicely using simulated annealing
The paradigm of simulated annealing is applied to the problem of drawing graphs �nicely.� Our algorithm deals with general undirected graphs with straight-line edges, and employs several simple criteria for the aesthetic quality of the result. ... Keywords: aesthetics, graph drawing, simulated annealing
Ron Davidson; David Harel
Graphical and incremental type inference: a graph transformation approach
We present a graph grammar based type inference system for a totally graphic development language. NiMo (Nets in Motion) can be seen as a graphic equivalent to Haskell that acts as an on-line tracer and debugger. Programs are process networks that evolve ... Keywords: graphical language, process networks, type inference, type visualization
Silvia Clerici; Cristina Zoltan; Guillermo Prestigiacomo
Component supervision by sensor placement on bond-graph model
The component supervision procedure consists of the comparison of the actual behaviour with the reference behaviour which describes the normal mode. The analytical redundancy has to find relations between known variables of the system. These relations ... Keywords: bond graphs, causal paths, modelling, sensors placement, supervision
M. Khemliche; B. Ould Bouamama; A. Khellaf; M. Mostefa�
Simulation of an Electrical Substation Using the Bond Graph Technique
Simulation and especially computer simulation, is a basic tool since it enables engineers to understand how systems work without actually needing to see them. They can learn how they work in different circumstances and optimize their design with considerably ... Keywords: simulation, electrical substations, elements, electricity, bond graph
Gregorio Romero; Jesus Felez; Joaquin Maroto; Jose Manuel Mera
The CEBAF Element Database
With the inauguration of the CEBAF Element Database (CED) in Fall 2010, Jefferson Lab computer scientists have taken a step toward the eventual goal of a model-driven accelerator. Once fully populated, the database will be the primary repository of information used for everything from generating lattice decks to booting control computers to building controls screens. A requirement influencing the CED design is that it provide access to not only present, but also future and past configurations of the accelerator. To accomplish this, an introspective database schema was designed that allows new elements, types, and properties to be defined on-the-fly with no changes to table structure. Used in conjunction with Oracle Workspace Manager, it allows users to query data from any time in the database history with the same tools used to query the present configuration. Users can also check-out workspaces to use as staging areas for upcoming machine configurations. All Access to the CED is through a well-documented Application Programming Interface (API) that is translated automatically from original C++ source code into native libraries for scripting languages such as perl, php, and TCL making access to the CED easy and ubiquitous.
Theodore Larrieu, Christopher Slominski, Michele Joyce
UK Windspeed Reference/Archival Database The windspeed database...
UK Windspeed ReferenceArchival Database The windspeed database provides estimates of mean annual wind speed throughout the UK, averaged over a 1-kilometer square area, at each of...
Constrained Graph Optimization: Interdiction and Preservation Problems
The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.
Schild, Aaron V [Los Alamos National Laboratory
Enhanced modeling : real-time simulation and modeling of graph based problems on interactive workbenches
This thesis presents a methodology and framework for designing systems that apply real-time simulation of computational models throughout the modeling and parameter modification stages of problem solving for graph based ...
Chak, Daniel, 1980-
Graph-Based Software Design for Managing Complexity and Enabling Concurrency in Multiphysics PDE Software
Multiphysics simulation software is plagued by complexity stemming from nonlinearly coupled systems of Partial Differential Equations (PDEs). Such software typically supports many models, which may require different transport equations, constitutive ... Keywords: Scientific computing, multiphysics, object-oriented design, task graph
Patrick K. Notz; Roger P. Pawlowski; James C. Sutherland
Thermodynamic Database Population Software (DBCreate)
Update Thermodynamic Databases for Modeling Geochemical Processes The DBCreate software quickly and accurately updates thermodynamic databases used in geochemical modeling, based on changes in temperatures and pressures. The software facilitates the ...
Fuel Cell Technologies Office: Databases
Efficiency and Renewable Energy Fuel Cell Technologies Office Databases The Fuel Cell Technologies Office is developing databases to make it easier for users to find up-to-date...
The Comprehensive Pacific Rainfall Database
This paper describes the Comprehensive Pacific Rainfall Database (PACRAIN), which contains daily and monthly precipitation records from the tropical Pacific basin. The database is a collection of observations from a variety of sources, including ...
J. Scott Greene; Michael Klatt; Mark Morrissey; Susan Postawko
Noisy evolution of graph-state entanglement
A general method for the study of the entanglement evolution of graph states under the action of Pauli maps was recently proposed in Cavalcanti et al. [Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds to the entanglement of the entire state as a function only of the state of a (typically) considerably smaller subsystem undergoing an effective noise process related to the original map. This provides a huge decrease in the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in detail 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.
Aolita, L.; Dhara, C. [ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, E-08860 Castelldefels, Barcelona (Spain); Cavalcanti, D. [Centre for Quantum Technologies, University of Singapore (Singapore); Chaves, R.; Davidovich, L. [Instituto de Fisica, Universidade Federal do Rio de Janeiro, Caixa Postal 68528, 21941-972 Rio de Janeiro, RJ (Brazil); Acin, A. [ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, E-08860 Castelldefels, Barcelona (Spain); ICREA-Institucio Catalana de Recerca i Estudis Avancats, Lluis Companys 23, E-08010 Barcelona (Spain)
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.
Anual Energy Database
Annual Energy Database Annual Energy Database Over the past several years, the National Fenestration Rating Council (NFRC) has developed technical procedures for determining the thermal performance properties of fenestration products. These properties document the thermal performance of the product in response to specific physical effects. U-factors define heat transfer as a function of temperature differences, Solar Heat Gain Coefficients are the fraction of incident solar radiation transmitted into the space, and Air Infiltration measures heat transfer as a function of a pressure differential. For the consumer or lay-person looking to understand the energy (heating and/or cooling) impacts of specific windows in typical residential applications, and to select an appropriate window for their application,
Open Calphad - Software and Databases
Since today all major thermodynamic software and databases are commercial this ... Relations of High Temperature Materials for Fossil Energy Applications.
Standard Reference Databases Online Subscription
... Num. NIST ONLINE SUBSCRIPTION DATABASES. Price. SRD 202. NIST Web Thermo Tables, Version Lite - Individual License. $200. SRD 202. ...
Buildings Performance Database
DOE Buildings Performance DOE Buildings Performance Database Paul Mathew Lawrence Berkeley National Laboratory email@example.com (510) 486 5116 April 3, 2013 Standard Data Spec API 2 | Building Technologies Office eere.energy.gov Purpose & Objectives Problem Statement: * Large-scale high-quality empirical data on building energy performance is critical to support decision- making and increase confidence in energy efficiency investments. * While there are a many potential sources for such data,
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems
A standard heuristic for testing graph isomorphism is to first assign distinct labels to a small set of vertices of an input graph, and then propagate to create new vertex labels across the graph, aiming to assign distinct and isomorphism-invariant labels ... Keywords: canonical forms, graph isomorphism, steiner 2-systems, strongly regular graphs
Xi Chen; Xiaorui Sun; Shang-Hua Teng
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.
Cain, J.M. (Calm (James M.), Great Falls, VA (United States))
Commercial equipment cost database
This report, prepared for DOE, Office of Codes and Standards, as part of the Commercial Equipment Standards Program at Pacific Northwest Laboratory, specifically addresses the equipment cost estimates used to evaluate the economic impacts of revised standards. A database including commercial equipment list prices and estimated contractor costs was developed, and through statistical modeling, estimated contractor costs are related to equipment parameters including performance. These models are then used to evaluate cost estimates developed by the ASHRAE 90.1 Standing Standards Project Committee, which is in the process of developing a revised ASHRAE 90.1 standard. The database will also be used to support further evaluation of the manufacturer and consumer impacts of standards. Cost estimates developed from the database will serve as inputs to economic modeling tools, which will be used to estimate these impacts. Preliminary results suggest that list pricing is a suitable measure from which to estimate contractor costs for commercial equipment. Models developed from these cost estimates accurately predict estimated costs. The models also confirm the expected relationships between equipment characteristics and cost. Cost models were developed for gas-fired and electric water heaters, gas-fired packaged boilers, and warm air furnaces for indoor installation. Because of industry concerns about the use of the data, information was not available for the other categories of EPAct-covered equipment. These concerns must be addressed to extend the analysis to all EPAct equipment categories.
Freeman, S.L.
VisTool: a Visual Tool for Querying Relational Databases
In this paper we describe VisTool, a prototype tool for querying relational databases by means of the visual query language VISIONARY. INTRODUCTION VISIONARY [1] is based on an iconic-diagrammatic paradigm used for both data and query representation. The external data model is called vision and is made up of the visual primitives of concept and association; the external query model is based on the definition of a dynamic and adaptive perspective for accessing data. The internal data model is relational, and the internal query model is SQL. The mapping between the visual and the relational worlds is established through an intermediate graph-based level. VISIONARY is mainly directed to naive and occasional users, who have no experience with data models and only have a general idea about the contents of the database; for this reason, the expressive power of VISIONARY is limited...
Francesca Benzi; Dario Maio; Stefano Rizzi
Central Internet Database (CID) Reports
Home > CID Reports Home > CID Reports Central Internet Database CID Photo Banner Reports The CID offers a choice of standard and archived reports. Standard reports are based on the most recently available DOE data related to the information requirements specified in the Settlement Agreement. Report categories include: Radioactive Waste Spent Nuclear Fuel and High-Level Radioactive Waste Facilities Non-Radioactive Hazardous Waste Toxic Release Inventory Waste The standard reports menu includes reports generated directly by the CID and reports generated by other systems. The CID generated reports allow users to select criteria to customize the report output. For the most current radioactive waste reports, CID users are directed to the Waste Information Management System (WIMS) Exit CID Website . WIMS provides radioactive waste disposition reports and disposition maps. While WIMS is a public site, you need to register and provide contact information the first time you enter WIMS.
Buildings Performance Database Helps Building Owners, Investors...
Buildings Performance Database Helps Building Owners, Investors Evaluate Energy Efficient Buildings Buildings Performance Database June 2013 A new database of building features and...
An Overview of the Lawrence Berkeley Laboratory Extended Entity-Relationship Database Tools
In this overview we briefly describe a collection of tools developed at Lawrence Berkeley Laboratory (LBL) for aiding users in specifying database structures and in querying databases using object-oriented concepts on top of commercial relational database management systems. These tools are based on an Extended Entity-Relationship (EER) model and allow users to deal with concise EER structures and queries rather than relational database definitions and queries which are usually large, hard to maintain, and involve terms that obscure the semantics of the application. Using the LBL/EER database tools users are insulated from the underlying database management system, and thus can avoid learning database management specific concepts and query languages. 1 Introduction Database applications involve large amounts of data that must be maintained and made available to users for analysis and manipulation. Database management systems (DBMSs) provide the capabilities required for stor...
Victor M. Markowitz; Arie Shoshani
Happy Endings for Flip Graphs
Abstract. We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of lattices, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently. 1
unknown authors
We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include intersections of lattices with convex sets, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently.
David Eppstein
Mixture graph based semi-supervised dimensionality reduction
Graph structure is crucial to graph based dimensionality reduction. A mixture graph based semi-supervised dimensionality reduction (MGSSDR) method with pairwise constraints is proposed. MGSSDR first constructs multiple diverse graphs on different random ... Keywords: dimensionality reduction, mixture graph, noise, pairwise constraints
G. X. Yu; H. Peng; J. Wei; Q. L. Ma
Tank Characterization Database (TCD) Data Dictionary: Version 4.0
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.
Western Area Power Administration customer database
This report describes a comprehensive customer database compiled by the Pacific Northwest Laboratory (PNL) to assist with analyses conducted as part of the Western Area Power Administration Energy Planning and Management Program Environmental Impact Statement (EIS). The database was used by PNL as a tool to help select a sample of Western customers for potential participation in the Organizational Impacts Analysis case studies, and was used as part of the Utility Impact Analysis to identify sources and costs of auxiliary power. Secondary information sources were used predominantly to compile one year of system related information on the Western customers (over 600) included in the database. This information was useful for its intended purposes; however, year-to-year information may not be consistent across utilities and not all information was available for each utility.
Sandahl, L.J.; Lee, A.D.; Wright, G.A.; Durfee, D.L.
An efficient database and search engine for electronic publications
In this paper we present an efficient database and search engine for digitalized text publications. The system has been initially developed for the most important and largest dictionary for the german language - the Jacob and Wilhelm Grimms Deutsche ... Keywords: Tcl/Tk, databases, search engine, text digitalization
Alexander Gamkrelidze; Thomas Burch; Ilia Chogovadze
[30] P. Fowler, P. Hansen, G. Caporossi, and A. Soncini, Polyenes with maximum homo-lumo gap. (variable neighborhood search for extremal graphs 7),�...
A copositive programming approach to graph partitioning
Aug 3, 2005 ... the random graph we can determine OPTMC by inspection, see column 3. The last 4 columns .... completeness. Freeman, San Francisco, 1979.
Graph algorithms in the titan toolkit.
Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.
McLendon, William Clarence, III; Wylie, Brian Neil
Building Technologies Office: Buildings Performance Database
on Twitter Bookmark Building Technologies Office: Buildings Performance Database on Google Bookmark Building Technologies Office: Buildings Performance Database on Delicious...
V-016: HP Performance Insight Bugs with Sybase Database Let Remote...
Performance Insight Bugs with Sybase Database Let Remote Users Deny Service and Take Full Control of the Target System V-016: HP Performance Insight Bugs with Sybase Database Let...
Scalable modeling of real graphs using Kronecker multiplication
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum, etc? We propose to use "Kronecker graphs", which naturally obey ...
Jure Leskovec; Christos Faloutsos
UK RE Planning Database Project: October, 2010 The Planning Database
with regular data to track progress towards achieving EU targets for electricity generation from renewable energy (RE) sources. Extracts from the database are available each...
A combinatorial construction of almost-ramanujan graphs using the zig-zag product
Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inherits its size from the large graph, its degree from the small graph ... Keywords: expander graphs, zig-zag product
Avraham Ben-Aroya; Amnon Ta-Shma
Feature extraction from large CAD databases using genetic algorithm
Syntactic recognition, Graph based method, expert systems and knowledge-based approach are the common feature recognition techniques available today. This work discusses a relatively newer concept of introduction of Genetic Algorithm for Features Recognition ... Keywords: Crossover, FEV representation, Feature recognition, Fitness function, Homologising, Hybrid approach, Offspring, Pocket feature, Search time, Solution path
Pralay Pal; A. M. Tigga; A Kumar
Global Bus Rapid Transit (BRT) Database | Open Energy Information
Global Bus Rapid Transit (BRT) Database Global Bus Rapid Transit (BRT) Database Jump to: navigation, search Tool Summary LAUNCH TOOL Name: Global Bus Rapid Transit (BRT) Database Agency/Company /Organization: EMBARQ Complexity/Ease of Use: Not Available Website: www.brtdata.org/ Equivalent URI: cleanenergysolutions.org/content/global-bus-rapid-transit-brt-database Language: English Related Tools European Green Cars Initiative Guidelines and Toolkits for Urban Transport Development in Medium Sized Cities in India Making Car Sharing and Car Clubs Work: Final Report ... further results Find Another Tool FIND TRANSPORTATION TOOLS This tool provides public access to current data about bus rapid transit systems around the world, including data for the design, performance, and cost of these systems. The database can be filtered by location or
Energy Citations Database (ECD) - Widget
Energy Citations Database Widget Energy Citations Database Widget You can access key features from the Department of Energy's Office of Scientific and Technical Information (DOE/OSTI) by downloading the Energy Citations Database widget. Use the widget to search, receive alerts, and top documents. If you wish you may download and install this widget using its html inclusion code. Get the Energy Citations Database widget and many other great free widgets at Widgetbox! Not seeing a widget? (More info) Search: provides the capability to search the Energy Citations Database collection of science research citations and documents. Alerts: provides the functionally for users with e-mail notification of updates to website content in specific areas of interest. By registering with Energy Citations Database, users can select search queries that are
Anual Energy Databases for Download
Annual Energy Databases & Modeling Assumptions The following Annual Energy Databases and Documentation can be downloaded from this page: Custom AEP Rating Calculator (Draft November 2001) Original NFRC900 database (542Kb, Excel spreadsheet) developed and approved by NFRC Annual Energy Subcommittee of heating and cooling energies, for 14 typical windows, in 52 North American climates, for typical new houses. Database for Discussion by NFRC Annual Energy Subcommittee: New Homes; 34 RESFEN windows with an infiltration rate of 0.3 cfm/sf; 52 North American climates Database for Discussion by NFRC Annual Energy Subcommittee: Existing Homes; 34 RESFEN windows with an infiltration rate of 0.3 cfm/sf; 52 North American climates RESFEN Modeling Assumptions: Documentation of the modeling assumptions used for all the RESFEN databases
Solving planning-graph by compiling it into CSP
Although the deep affinity between Graphplan's backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily used to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automatically converting Graphplan's planning graph into a CSP encoding, and solving the CSP encoding using standard CSP solvers. Our comprehensive empirical evaluation of GP-CSP demonstrates that it is quite competitive with both standard Graphplan and Blackbox system, which compiles planning graphs into SAT encodings. We discuss the many advantages offered by focusing on CSP encodings rather than SAT encodings, including the fact that by exploiting implicit constraint representations, GP-CSP tends to be less susceptible to memory blow-up associated with methods that compile planning problems into SAT encodings. Our work is inspired by t...
Minh Binh Do; Subbarao Kambhampati
OpenEI - Technical Database
http:en.openei.orgdatasetstaxonomyterm8720 en Technical Reference and Technical Database for Hydrogen Compatibility of Materials http:en.openei.orgdatasetsnode927...
Biological & Environmental Research Abstracts Database
and Environmental Research Abstracts Database. Please logon. Logon Name: Password: Logon CommentsEmail Us * SecurityDisclaimer Notices * BER Abstracts Last Updated: September 27...
WEB RESOURCE: Nuclear Materials Database
Feb 12, 2007 ... Mechanical properties data for stainless steels and superalloys; mechanical properties data for nuclear materials as a database for research�...
Search Our Online Image Database
Accelerator and Components Detectors and Computing People and Events Environment Graphics and Illustrations The images included in this database are the property of the U.S....
Central Internet Database (CID) Home
Banner Welcome to the updated Central Internet Database (CID) The CID is a gateway to waste management and facility information from current and archived Department of Energy...
Corrosion Databases and Data Compilations
Table 4 Selected corrosion databases and data compilations...U.S. Bureau of Labor Statistics Consumer price indexes for the United States
Download Data | Transparent Cost Database
in the database does not represent approval of the estimates by DOE or NREL. Levelized cost calculations DO NOT represent real world market conditions. The calculation uses a...
NIST Standard Reference Database 84
... containing more than 120,000 entries and covering the literature from 1913 to the present. The database has a Windows-based graphical user ...
Welcome to the Biological and Environmental Research Abstracts Database The U.S. Department of Energy's Office of Biological and Environmental Research (BER) conducts research in...
DOE Corporate Lessons Learned Database
Lessons Learned Database Home About This Site Contact Us Related Links Defense Nuclear Security Lessons Learned Center (DNS-LLC) Corporate Operating Experience Review Program...
Energy Benchmarking Database
Building energy benchmarking is a useful starting point for commercial building owners and operators to target energy savings opportunities. There are a number of tools and methods for benchmarking energy use. Benchmarking based on regional data can provides more relevant information for California buildings than national tools such as Energy Star. This paper discusses issues related to benchmarking commercial building energy use and the development of Cal-Arch, a building energy benchmarking database for California. Currently Cal-Arch uses existing survey data from California's Commercial End Use Survey (CEUS), a largely underutilized wealth of information collected by California's major utilities. Doe's Commercial Building Energy Consumption Survey (CBECS) is used by a similar tool, Arch, and by a number of other benchmarking tools. Future versions of Arch/Cal-Arch will utilize additional
Satkartar Kinney; Mary Ann Piette; Satkartar Kinney; Mary Ann Piette; Ernest Orlando Lawrence Berkeley; Satkartar Kinney; Mary Ann Piette
DOE Patents Database - FAQ's
Frequently Asked Questions Frequently Asked Questions Why was this database developed and by whom? How is this collection different than the one at the United States Patent and Trademark Office? What are the criteria for including patent records in this collection? How do you determine these patents were sponsored by DOE? How many patents are in this collection? Does the collection include all of DOE's patents? Does this collection include the full text for each patent? What time frame is covered by DOepatents? How often is this collection and Web site updated? Does the U.S. Government have exclusive rights to these inventions? What is OSTI? Where can I find information about doing business with DOE? How can I find additional information on the patenting process? Where can I find patents that are not related to DOE?
DOE Patents Database - About
About DOepatents About DOepatents DOepatents, developed by the U.S. Department of Energy (DOE) Office of Scientific and Technical Information (OSTI), is a searchable database of patent information resulting from DOE-sponsored research and development (R&D). Included here are patents that DOE sponsored through a variety of funding mechanisms, including grants, contracts, or cooperative agreements. Comprehensive coverage of DOE patent information is one way to demonstrate the Department's contribution to scientific progress in the physical sciences and other disciplines. Publicly available patent information from DOE R&D, historic and current, is presented here, excluding patent applications. DOepatents consists of bibliographic records, with full text where available, either via a PDF file or an HTML link to the record at the
Anonymizing bipartite graph data using safe groupings
Private data often come in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a large, sparse bipartite graph. As with tabular data, it is desirable to be able ... Keywords: Graph, Microdata, Privacy, Query answering
Graham Cormode; Divesh Srivastava; Ting Yu; Qing Zhang
Expressing graph algorithms using generalized active messages
Recently, graph computation has emerged as an important class of high-performance computing application whose characteristics differ markedly from those of traditional, compute-bound, kernels. Libraries such as BLAS, LAPACK, and others have been successful ... Keywords: active messages, parallel graph algorithms, parallel programming models
Nick Edmonds; Jeremiah Willcock; Andrew Lumsdaine
Improved call graph comparison using simulated annealing
The amount of suspicious binary executables submitted to Anti-Virus (AV) companies are in the order of tens of thousands per day. Current hash-based signature methods are easy to deceive and are inefficient for identifying known malware that have undergone ... Keywords: call graph, graph edit distance, malware, simulated annealing, static analysis
Orestis Kostakis; Joris Kinable; Hamed Mahmoudi; Kimmo Mustonen
Quantum Algorithms for Graph Problems -- A Survey
In this survey we give an overview about important methods to construct quantum algorithms and quantum lower bounds for graph problems. We show how to use these methods, and we give a summary about the quantum complexity of the most important graph problems. At the end of our paper, we give some interesting questions in this research area.
Sebastian D�rn
Oriented unicyclic graphs with extremal skew energy
Let $\\G$ be an oriented graph of order $n$ and $\\a_1,\\a_2,..., \\a_n$ denote all the eigenvalues of the skew-adjacency matrix of $\\G.$ The skew energy $\\displaystyle{\\cal E}_s(\\G)= \\sum_{i=1}^{n} |\\a_i|.$ In this paper, the oriented unicyclic graphs with minimal and maximal skew energy are determined.
Yaoping, Hou; Chongyan, Zhang
Graph mining: Laws, generators, and algorithms
How does the Web look? How could we tell an abnormal social network from a normal one? These and similar questions are important in many fields where the data can intuitively be cast as a graph; examples range from computer networks to sociology to biology ... Keywords: Generators, graphs, patterns, social networks
Deepayan Chakrabarti; Christos Faloutsos
Inflo: collaborative reasoning via open calculation graphs
Inflo is a web tool that introduces new ways to collaboratively construct and deconstruct logical arguments drawn as visual dataflow graphs. Inflo graphs are dynamic: nodes are logical propositions that can contain computations based on ... Keywords: collaboration, decision making, knowledge curation
Jonathan Lung; Steve Easterbrook
Generating random graphs with large girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Check (LDPC) codes. For any constant k, ? ? 1/2k(k ...
Mohsen Bayati; Andrea Montanari; Amin Saberi
Measuring energy consumption of a database cluster
Abstract: Energy consumption of database servers is a growing concern for companies as it is a critical part of a data center�s cost. To address the rising cost and the waste of energy, a new paradigm called GreenIT arose. Hardware and software developers are aiming at more energy-efficient systems. To improve the energy footprint of database servers, we developed a cluster of small-scale nodes, that can be dynamically powered dependent on the workload. This demo shows the measurement framework we set up to measure hardware components as well as an entire cluster of nodes. We�ll exhibit the measurement devices for components and servers and show the system�s behavior under varying workloads. Attendees will be able to adjust workloads and experience their impact on energy consumption. 1
Volker Hudlet; Daniel Schall; Ag Dbis; Tu Kaiserslautern
Feature Tracking Using Reeb Graphs
Tracking features and exploring their temporal dynamics can aid scientists in identifying interesting time intervals in a simulation and serve as basis for performing quantitative analyses of temporal phenomena. In this paper, we develop a novel approach for tracking subsets of isosurfaces, such as burning regions in simulated flames, which are defined as areas of high fuel consumption on a temperature isosurface. Tracking such regions as they merge and split over time can provide important insights into the impact of turbulence on the combustion process. However, the convoluted nature of the temperature isosurface and its rapid movement make this analysis particularly challenging. Our approach tracks burning regions by extracting a temperature isovolume from the four-dimensional space-time temperature field. It then obtains isosurfaces for the original simulation time steps and labels individual connected 'burning' regions based on the local fuel consumption value. Based on this information, a boundary surface between burning and non-burning regions is constructed. The Reeb graph of this boundary surface is the tracking graph for burning regions.
Weber, Gunther H.; Bremer, Peer-Timo; Day, Marcus S.; Bell, John B.; Pascucci, Valerio
Sealion Database: Tracking and Characterization of Legacy Wastes
The Radioactive Scrap and Waste Facility Liner-by-Liner Characterization Project was initiated to support waste management planning and disposition activities at the Materials and Fuels Complex located at the Idaho National Laboratory. The project scope consisted of a detailed examination of available historical records to consolidate information and eliminate discrepancies between sources. This information was captured in a new comprehensive searchable online database dubbed Sealion (Searchable Liner Online). For each storage liner and associated waste container, Sealion tracks the physical configuration, radiological data (e.g., source term, transuranic content, fissile content, and direct gamma radiation reading), Resource Conservation and Recovery Act characterization data, contents descriptions, and a variety of other waste management data. Historical hard-copy records were scanned and are stored in the database for easy access. In addition to storing the consolidated data in a library for easy retrieval or linking, Sealion serves as a tool in the development of batching plans for retrieving, transporting, processing, and, ultimately, dispositioning the waste. An integral search function allows the user to query for a variety of parameters in order to plan custom batches and account for facility or regulatory limitations (e.g., U.S. Department of Transportation limits, hazard category determinations, and fissile gram equivalent limitations). Liners can be combined or batched together and the combined results displayed in real-time graphs and tables showing the cumulative characteristics. The basic database architecture has proven to be adaptable to a variety of other similar applications. Sealion is capable of tracking segmented inventories (i.e., the liners can be replaced with storage drums, racks in a warehouse, or grids overlaid on a landfill). Additionally, the batching functions allow for the ability to combine inventory sub-locations into real-time graphs that summarize the characteristics of the contents for ease in comparison of characteristics to established thresholds or decision-making modeling needed to support waste-management operations.
Michel Hall; Brady Orchard; Brett Welty; James Rivera; Paul Walker; Reese Gannon
pGraph: Efficient Parallel Construction of Large-Scale Protein Sequence Homology Graphs
Detecting sequence homology between protein sequences is a fundamental problem in computational molecular biology, with a pervasive application in nearly all analyses that aim to structurally and functionally characterize protein molecules. While detecting the homology between two protein sequences is relatively inexpensive, detecting pairwise homology for a large number of protein sequences can become computationally prohibitive for modern inputs, often requiring millions of CPU hours. Yet, there is currently no robust support to parallelize this kernel. In this paper, we identify the key characteristics that make this problemparticularly hard to parallelize, and then propose a new parallel algorithm that is suited for detecting homology on large data sets using distributed memory parallel computers. Our method, called pGraph, is a novel hybrid between the hierarchical multiple-master/worker model and producer-consumer model, and is designed to break the irregularities imposed by alignment computation and work generation. Experimental results show that pGraph achieves linear scaling on a 2,048 processor distributed memory cluster for a wide range of inputs ranging from as small as 20,000 sequences to 2,560,000 sequences. In addition to demonstrating strong scaling, we present an extensive report on the performance of the various system components and related parametric studies.
Wu, Changjun; Kalyanaraman, Anantharaman; Cannon, William R.
Speedy transactions in multicore in-memory databases
Silo is a new in-memory database that achieves excellent performance and scalability on modern multicore machines. Silo was designed from the ground up to use system memory and caches efficiently. For instance, it avoids all centralized contention points, ...
Stephen Tu, Wenting Zheng, Eddie Kohler, Barbara Liskov, Samuel Madden
QueryScope: visualizing queries for repeatable database tuning
Reading and perceiving complex SQL queries has been a time consuming task in traditional database applications for decades. When it comes to decision support systems with automatically generated and sometimes highly nested SQL queries, human understanding ...
Ling Hu; Kenneth A. Ross; Yuan-Chi Chang; Christian A. Lang; Donghui Zhang
Database engines on multicores, why parallelize when you can distribute?
Multicore computers pose a substantial challenge to infrastructure software such as operating systems or databases. Such software typically evolves slower than the underlying hardware, and with multicore it faces structural limitations that can be solved ... Keywords: multicores, replication, snapshot isolation
Tudor-Ioan Salomie; Ionut Emanuel Subasu; Jana Giceva; Gustavo Alonso
Compression and query execution within column oriented databases
Compression is a known technique used by many database management systems ("DBMS") to increase performance[4, 5, 14]. However, not much research has been done in how compression can be used within column oriented architectures. ...
Ferreira, Miguel C. (Miguel Cacela Rosa Lopes Ferreira)
Quality Control for the Navy Operational Atmospheric Database
A new, operational meteorological database has been developed to provide quality-controlled observations for the atmospheric analysis and prediction systems at Fleet Numerical Oceanography Center (FNOC). The quality control procedures for the ...
Nancy L. Baker
A+M Collisional Databases in ALADDIN Format
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.
EEMIS data sector correspondence with conceptual database design
The purpose of this report is fivefold: (1) it provides an introduction to database systems and critieria that are important in the selection of a commercial database management system; (2) it demonstrates that the mapping of the EEMIS data sector structure into the conceptual database model is complete and preserves the hierarchies implied by the EEMIS data structure; (3) it describes all fields and associated field lengths; (4) it provides accurate formulae for estimating the computer storage requirements for the conceptual models at the facility level; and (5) it provides the details of the storage requirements for oil refineries, petroleum crude storage facilities, natural gas transmission and distribution facilities, and company description records.
Croteau, K; Kydes, A S; Maier, D
Wind turbine reliability database update.
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.
Peters, Valerie A.; Hill, Roger Ray; Stinebaugh, Jennifer A.; Veers, Paul S.
Federal Transit Administration-National Transit Database (NTD) | Open
Federal Transit Administration-National Transit Database (NTD) Federal Transit Administration-National Transit Database (NTD) Jump to: navigation, search Tool Summary LAUNCH TOOL Name: Federal Transit Administration-National Transit Database (NTD) Agency/Company /Organization: Federal Transit Administration Sector: Energy Focus Area: Transportation Resource Type: Dataset User Interface: Website Website: www.ntdprogram.gov/ntdprogram/ Cost: Free Language: English Federal Transit Administration-National Transit Database (NTD) Screenshot References: National Transit Database[1] "The NTD was established by Congress to be the Nation's primary source for information and statistics on the transit systems of the United States. Recipients or beneficiaries of grants from the Federal Transit Administration (FTA) under the Urbanized Area Formula Program (§5307) or
Central Internet Database (CID) About the CID
Home > About the CID Home > About the CID Central Internet Database CID Photo Banner About CID Overview Since its public release in 2000, the Central Internet Database (CID) has provided users with Department of Energy (DOE) waste management, cleanup, and facility information. The 2008 update of the CID is the first comprehensive update of the CID since its initial release. Several changes have been made in this new version of the CID. Most importantly the number and types of reports has been changed to reflect current DOE data collection. Also, in an effort to reduce redundancy with other DOE data reporting systems, the CID now directs users to other systems for radioactive waste information. Users will still be able to access the more detailed radioactive waste and contaminated media data previously featured in the CID by using the Archived Reports menu.
Stochastic kinetic models: Dynamic independence, modularity and graphs
The dynamic properties and independence structure of stochastic kinetic models (SKMs) are analyzed. An SKM is a highly multivariate jump process used to model chemical reaction networks, particularly those in biochemical and cellular systems. We identify SKM subprocesses with the corresponding counting processes and propose a directed, cyclic graph (the kinetic independence graph or KIG) that encodes the local independence structure of their conditional intensities. Given a partition $[A,D,B]$ of the vertices, the graphical separation $A\\perp B|D$ in the undirected KIG has an intuitive chemical interpretation and implies that $A$ is locally independent of $B$ given $A\\cup D$. It is proved that this separation also results in global independence of the internal histories of $A$ and $B$ conditional on a history of the jumps in $D$ which, under conditions we derive, corresponds to the internal history of $D$. The results enable mathematical definition of a modularization of an SKM using its implied dynamics. Gra...
Bowsher, Clive G
NIST Special Database 10
... algorithm development; system training or testing. ... Reference Data Program National Institute ... NCIC classes, NIST, software recognition, uncommon.
NIST Special Database 9
... development and system training and testing. ... Standard Reference Data Program National Institute of ... NCIC classes, NIST, software recognition.
Image segmentation by iterated region merging with localized graph cuts
This paper presents an iterated region merging-based graph cuts algorithm which is a novel extension of the standard graph cuts algorithm. Graph cuts addresses segmentation in an optimization framework and finds a globally optimal solution to a wide ... Keywords: Graph cuts, Image segmentation, Region merging
Bo Peng; Lei Zhang; David Zhang; Jian Yang
On the density of a graph and its blowup
It is well known that, of all graphs with edge-density p, the random graph G(n,p) contains the smallest density of copies of K"t","t, the complete bipartite graph of size 2t. Since K"t","t is a t-blowup of an edge, the following intriguing open question ... Keywords: Blowup, Graph density, Triangle density
Asaf Shapira; Raphael Yuster
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
The problem of enumerating the maximal cliques of a graph is a computationally expensive problem with applications in a number of different domains. Sometimes the benefit of knowing the maximal clique enumeration (MCE) of a single graph is worth investing ... Keywords: Graph algorithms, Graph perturbation theory, Maximal clique enumeration, Uncertain and noisy data
William Hendrix; Matthew C. Schmidt; Paul Breimyer; Nagiza F. Samatova
The depleted hydrogen atoms in chemical graph theory
A new algorithm which explicitly describes the depleted hydrogen atoms is proposed for chemical graph computations, and especially for molecular connectivity model studies. The new algorithm continues to be centred on the concepts of complete graphs ... Keywords: General chemical graphs, complete graphs, hydrogen perturbation, molecular connectivity computations
Designing a Multi-Petabyte Database for LSST
The 3.2 giga-pixel LSST camera will produce approximately half a petabyte of archive images every month. These data need to be reduced in under a minute to produce real-time transient alerts, and then added to the cumulative catalog for further analysis. The catalog is expected to grow about three hundred terabytes per year. The data volume, the real-time transient alerting requirements of the LSST, and its spatio-temporal aspects require innovative techniques to build an efficient data access system at reasonable cost. As currently envisioned, the system will rely on a database for catalogs and metadata. Several database systems are being evaluated to understand how they perform at these data rates, data volumes, and access patterns. This paper describes the LSST requirements, the challenges they impose, the data access philosophy, results to date from evaluating available database technologies against LSST requirements, and the proposed database architecture to meet the data challenges.
Becla, Jacek; Hanushevsky, Andrew; Nikolaev, Sergei; Abdulla, Ghaleb; Szalay, Alex; Nieto-Santisteban, Maria; Thakar, Ani; Gray, Jim; /SLAC
Visionary: a viewpoint-based visual language for querying relational databases
The adoption of a visual interface can simplify the query formulation process in DBMSs by enabling naive users to interact with a friendly environment. In this work we propose a visual query language based on a diagrammatic paradigm, used for both data and query representation. The external data model is called vision and is made up of the visual primitives of concept and association. The external query model is based on the definition of a viewpoint, which is a perspective for accessing data defined dynamically by selecting a concept of primary interest. Internally, the data model is relational and the query language is SQL. An intermediate graph-based model ensures consistent mapping between the visual and the relational worlds. Our language has been implemented within a tool which can be mounted on top of any relational DBMS supporting ODBC. The system has been tested with naive users; the results of the experiment are reported and compared with those obtained with other visual languages. Keywords and phrases: VPL-II.B.1: Diagrammatic languages, VPL-V.B: Database languages 1
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
The oriented chromatic number of an oriented graph $\\vec G$ is the minimum order of an oriented graph $\\vev H$ such that $\\vec G$ admits a homomorphism to $\\vev H$. The oriented chromatic number of an undirected graph $G$ is then the greatest oriented chromatic number of its orientations. In this paper, we introduce the new notion of the upper oriented chromatic number of an undirected graph $G$, defined as the minimum order of an oriented graph $\\vev U$ such that every orientation $\\vec G$ of $G$ admits a homomorphism to $\\vec U$. We give some properties of this parameter, derive some general upper bounds on the ordinary and upper oriented chromatic numbers of Cartesian, strong, direct and lexicographic products of graphs, and consider the particular case of products of paths.
Sopena, Eric
The Automatic Library Tracking Database
A library tracking database has been developed and put into production at the National Institute for Computational Sciences and the Oak Ridge Leadership Computing Facility (both located at Oak Ridge National Laboratory.) The purpose of the library tracking database is to track which libraries are used at link time on Cray XT5 Supercomputers. The database stores the libraries used at link time and also records the executables run in a batch job. With this data, many operationally important questions can be answered such as which libraries are most frequently used and which users are using deprecated libraries or applications. The infrastructure design and reporting mechanisms are presented along with collected production data.
Fahey, Mark R [ORNL; Jones, Nicholas A [ORNL; Hadri, Bilel [ORNL
Energy Citations Database (ECD) - About
About ECD 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 access to Departmental and predecessor agency scientific and technical information (STI). The Energy Citations Database (ECD) contains bibliographic citations for energy and energy related STI from the Department of Energy (DOE) and its predecessor agencies, the Energy Research & Development Administration (ERDA) and the Atomic Energy Commission (AEC). The Database provides access to electronic documents, primarily from 1943 forward, with continued growth through regular updates. Features of ECD include: bibliographic citations for scientific and technical information dating from 1943 to the present;
Semiregular Factorization of Simple Graphs A. J. W. Hilton
]. A (d, d + 1)-graph is said to be semiregular. An (r, r + 1)-factorization of a graph is a decomposition of the graph into edge-disjoint (r, r + 1)-factors. We discuss here the state of knowledge about (r, r +1)-factorizations of d-regular graphs and of (d, d + 1)-graphs. For r, s 0, let (r, s) be the least integer
Wojciechowski, Jerzy
NIST Atomic Spectra Database
... Ground states and ionization energies of atoms ... the US Department of Energy, by the ... SRDP), and by NIST's Systems Integration for Manufacturing ...
U-071:HP Database Archiving Software Bugs Let Remote Users Execute
1:HP Database Archiving Software Bugs Let Remote Users Execute 1:HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code U-071:HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code December 29, 2011 - 8:15am Addthis PROBLEM: HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code PLATFORM: HP Database Archiving Software v6.31 ABSTRACT: A remote user can execute arbitrary code on the target system. reference LINKS: HP Database Document ID: c03128302 SecurityTracker Alert ID: 1026467 CVE-2011-4163 CVE-2011-4164 CVE-2011-4165 IMPACT ASSESSMENT: High Discussion: Several vulnerabilities were reported in HP Database Archiving Software. A remote user can execute arbitrary code on the target system. Impact: A remote user can execute arbitrary code on the target system. Solution:
Creating a Physical Standby Database........................................ 13 Creating a Logical Standby Database.......................................... 13
Failing Over to a Local Standby Database................................... 14 Switching Over to a Local Standby Database.............................. 15 Upgrading Oracle Database with a Logical Standby Database.... 16 Upgrading Oracle Database with a Transient Logical Standby.... 17 Testing with a Physical Standby Database...................................... 19
Oracle Data Guard; Operational Procedures; Peoplesoft Multi-pillar Environments
The Gram dimension of a graph
be a Gram representation of Xi and let U an orthogonal matrix mapping u. (1) j to u. (2) ...... On the Shannon capacity of a graph IEEE Trans. Inform. Th. IT-25:.
Graph Invariants and Large Cycles - a Survey
Graph invariants are the best and single tools for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures (cycle structures, factors, colorings, coverings, and so on). In this survey paper we have attempted to bring together all direct (pure) relations between basic invariants of a graph and its large cycle structures, perhaps the most important cycle structures, namely Hamilton, longest, dominating and some generalized cycles including Hamilton and dominating cycles as special cases. These very few relations actually form a source (basis) from which nearly all possible hamiltonian results can be developed further based on generalized and extended invariants, extended list of path or cycle structures and additional structural limitations.
Nikoghosyan, Zh G
The Nuclear Science References Database
Pritychenko, B; Singh, B; Totans, J
ORISE: Human Subjects Research Database
Human Subjects Research Database Section 10, Part 745 of the Code of Federal Regulations and U.S. Department of Energy (DOE) Orders 443.1 and 481.1 require the maintenance of...
NIST Atomic Spectra Database Introduction
... plus up to the first five spectra of the lanthanide rare earths (Z=57-71 ... Each page of the ASD database (except the ASD home page) includes a menu ...
Analytical Chemistry Databases and Links
Analytical chemistry websites, humor, Material Safety Data Sheets,Patent Information, and references. Analytical Chemistry Databases and Links Analytical Chemistry acid analysis Analytical Chemistry aocs applicants april articles atomic)FluorometryDiffer
Energy Citations Database (ECD) - Comments
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...
Database support for uncertain data
In recent years, the field of uncertainty management in databases has received considerable interest due to the presence of numerous applications that handle probabilistic data. In this dissertation, we identify and solve important issues ...
Sarvjeet Singh / Sunil Prabhakar
Spatial network modeling for databases
Spatial networks like transportation, power, and pipeline networks are a ubiquitous spatial concept in everyday life and play an important role for navigational and routing purposes. Database support for large spatial networks in order to represent, ...
Virupaksha Kanjilal; Markus Schneider
Hydrogen Storage Materials Database Demonstration
| Fuel Cell Technologies Program Source: US DOE 4/25/2011 eere.energy.gov | Fuel Cell Technologies Program Source: US DOE 4/25/2011 eere.energy.gov Hydrogen Storage Materials Database Demonstration FUEL CELL TECHNOLOGIES PROGRAM Ned Stetson Storage Tech Team Lead Fuel Cell Technologies Program U.S. Department of Energy 12/13/2011 Hydrogen Storage Materials Database Marni Lenahan December 13, 2011 Database Background * The Hydrogen Storage Materials Database was built to retain information from DOE Hydrogen Storage funded research and make these data more accessible. * Data includes properties of hydrogen storage materials investigated such as synthesis conditions, sorption and release conditions, capacities, thermodynamics, etc. http://hydrogenmaterialssearch.govtools.us Current Status * Data continues to be collected from DOE funded research.
Database | OpenEI Community
Database Database Home Kyoung's picture Submitted by Kyoung(155) Contributor 14 October, 2013 - 20:19 Geothermal NEPA Workshop at GRC Categorical Exclusions CX Database EA EIS FONSI GEA GRC GRR NEPA On Tuesday, October 2, the Geothermal Technology Office and the National Renewable Energy Laboratory held a 1/2-day NEPA workshop. The workshop was held at the MGM Grand in Las Vegas, in conjunction with the GEA/GRC Tradeshow and Conference. Three presentations were given, describing the NEPA database and associated analysis that had been conducted in 2013. Files: application/vnd.openxmlformats-officedocument.presentationml.presentation icon 2. NEPA History - Presentation application/vnd.openxmlformats-officedocument.presentationml.presentation icon 3. Categorical Exclusions - Presentation
An Evaluation of Database Solutions to Spatial Object Association
Object association is a common problem encountered in many applications. Spatial object association, also referred to as crossmatch of spatial datasets, is the problem of identifying and comparing objects in two datasets based on their positions in a common spatial coordinate system--one of the datasets may correspond to a catalog of objects observed over time in a multi-dimensional domain; the other dataset may consist of objects observed in a snapshot of the domain at a time point. The use of database management systems to the solve the object association problem provides portability across different platforms and also greater flexibility. Increasing dataset sizes in today's applications, however, have made object association a data/compute-intensive problem that requires targeted optimizations for efficient execution. In this work, we investigate how database-based crossmatch algorithms can be deployed on different database system architectures and evaluate the deployments to understand the impact of architectural choices on crossmatch performance and associated trade-offs. We investigate the execution of two crossmatch algorithms on (1) a parallel database system with active disk style processing capabilities, (2) a high-throughput network database (MySQL Cluster), and (3) shared-nothing databases with replication. We have conducted our study in the context of a large-scale astronomy application with real use-case scenarios.
Kumar, V S; Kurc, T; Saltz, J; Abdulla, G M; Kohn, S; Matarazzo, C
Database Design Using Entity-Relationship Diagrams
With this comprehensive guide, database designers and developers can quickly learn all the ins and outs of E-R diagramming to become expert database designers.
Sikha Bagui; Richard Earp
Clean Cities: Clean Cities Annual Reporting Database
Annual Reporting Database to someone by E-mail Share Clean Cities: Clean Cities Annual Reporting Database on Facebook Tweet about Clean Cities: Clean Cities Annual Reporting...
Building Technologies Office: Life Cycle Inventory Database
Life Cycle Inventory Database to someone by E-mail Share Building Technologies Office: Life Cycle Inventory Database on Facebook Tweet about Building Technologies Office: Life...
REDD Country Activity Database | Open Energy Information
REDD Country Activity Database REDD Country Activity Database Jump to: navigation, search Tool Summary Name: REDD Country Activity Database Agency/Company /Organization: Global Canopy Programme, Forum on Readiness for REDD Sector: Land Focus Area: Forestry Topics: Background analysis Resource Type: Dataset, Case studies/examples User Interface: Website Website: www.theredddesk.org/countries Country: Brazil, Cameroon, Vietnam, Guyana, Tanzania, Indonesia Cost: Free UN Region: Southern Africa, South America, South-Eastern Asia REDD Country Activity Database Screenshot References: REDD Country Activity Database[1] Logo: REDD Country Activity Database The REDD Countries Database is a centralised and collaborative database of the diverse and rapidly evolving range of ongoing REDD activities in
Mining Bug Databases for Unidentified Software Vulnerabilities
Identifying software vulnerabilities is becoming more important as critical and sensitive systems increasingly rely on complex software systems. It has been suggested in previous work that some bugs are only identified as vulnerabilities long after the bug has been made public. These vulnerabilities are known as hidden impact vulnerabilities. This paper discusses the feasibility and necessity to mine common publicly available bug databases for vulnerabilities that are yet to be identified. We present bug database analysis of two well known and frequently used software packages, namely Linux kernel and MySQL. It is shown that for both Linux and MySQL, a significant portion of vulnerabilities that were discovered for the time period from January 2006 to April 2011 were hidden impact vulnerabilities. It is also shown that the percentage of hidden impact vulnerabilities has increased in the last two years, for both software packages. We then propose an improved hidden impact vulnerability identification methodology based on text mining bug databases, and conclude by discussing a few potential problems faced by such a classifier.
Dumidu Wijayasekara; Milos Manic; Jason Wright; Miles McQueen
Environmental GIS database for the White Sea
Introduction The European Commission INCO Copernicus project was promoted in autumn 2000 as "Sustainable management of the marine ecosystem and living resources of the White Sea". One of the scientific and technical objectives is t o create dedicated environmental, ecological and socio-economic databases integrated in a Geographical Information System (GIS) for the White Sea region. To ensure the access to the database development also in the future, the open source gis approach as GRASS5.0 was chosen [1]. Into the White Sea GRASS-GIS database the bathymetry data with resolution 1 by 0.5 minutes was used to model the bottom surface of the White Sea. Russian coordinate system of Pulkova 42 was used. DCW vector data were used for the shoreline and the White Sea was divided to 7 traditional geographic areas. Raster layer of the bathymetry was divided with vector polygons to appropriate geographic areas and the area and volume were calculated. The hydrological and chemical parameters as
Seppo Kaitala; Anatoly Shavykin; Vladimir A. Volkov
A database of PFT ventilation measurements
About five years ago, a method for measuring the ventilation flows of a building was developed at Brookhaven National Laboratory (BNL). This method is based on the use of a family of compounds known as perfluorocarbon tracers or PFTs. Since 1982, BNL has measured ventilation in more than 4000 homes, comprising about 100 separate research projects throughout the world. This measurement set is unique in that it is the only set of ventilation measurements that acknowledge and measure the multizone characteristics of residences. Other large measurement sets assume that a home can be treated as a single well-mixed zone. This report describes the creation of a database of approximately half of the PFT ventilation measurements made by BNL over the last five years. The PFT database is currently available for use on any IBM PC or Apple Macintosh based personal computer system. In addition to its utility in modeling indoor pollutant dispersion, this database may also be useful to those people studying energy conservation, thermal comfort and heating system design in residential buildings. 2 refs.
D' Ottavio, T.W.; Goodrich, R.W.; Spandau, D.J.; Dietz, R.N.
World electric power plants database
This global database provides records for 104,000 generating units in over 220 countries. These units include installed and projected facilities, central stations and distributed plants operated by utilities, independent power companies and commercial and self-generators. Each record includes information on: geographic location and operating company; technology, fuel and boiler; generator manufacturers; steam conditions; unit capacity and age; turbine/engine; architect/engineer and constructor; and pollution control equipment. The database is issued quarterly.
V-036: EMC Smarts Network Configuration Manager Database Authentication
6: EMC Smarts Network Configuration Manager Database 6: EMC Smarts Network Configuration Manager Database Authentication Bypass Vulnerability V-036: EMC Smarts Network Configuration Manager Database Authentication Bypass Vulnerability November 29, 2012 - 3:30am Addthis PROBLEM: EMC Smarts Network Configuration Manager Database Authentication Bypass Vulnerability PLATFORM: EMC Smarts Network Configuration Manager (NCM) all versions prior 9.1 ABSTRACT: Two vulnerabilities were reported in EMC Smarts Network Configuration Manager. REFERENCE LINKS: EMC Identifier: ESA-2012-057 Secunia Advisory SA51408 SecurityTracker Alert ID: 1027812 CVE-2012-4614 CVE-2012-4615 IMPACT ASSESSMENT: Medium DISCUSSION: The systems uses a hard-coded key to encrypt authentication credentials on the target system [CVE-2012-4615]. A local user with knowledge of the key
Central Internet Database (CID) Related Links
Related Links Related Links Central Internet Database CID Photo Banner Links to Waste and Materials Disposition Information Below is a collection of reports and links to various documents that provide information related to waste and material disposition. While most of these are directly related to the Department of Energy's waste management activities, some links include information from the commercial sector. Some of the information provides an historical context for current waste disposition alternatives. To view PDF documents, please ensure Adobe Reader is installed on your computer, it is available to download here Exit CID Website . Waste Volume Related Databases For DOE/EM waste and material stream data: Waste Information Management System (WIMS) provided by Florida International University Exit CID Website
DOE Research and Development Accomplishments Database Browse
Database Browse Database Browse The ASTRAL Compendium in 2004; Chandonia, John-Marc; Hon, Gary; Walker, Nigel S.; Lo Conte, Loredana; Koehl, Patrice; Levitt, Michael; Brenner, Steven E.; September 15, 2003; LBNL--53820; ACC0491 322 K, 10 pp. View Document A Novel Method for Sampling Alpha-Helical Protein Backbones; Fain, Boris; Levitt, Michael; 2001; ; ACC0490 1223 K, 28 pp. View Document Chemical Research--Radiochemistry Report for Month Ending April 17, 1943; Franck, J. Division Director; 1952; CC-579; ACC0484 13567 K, 21 pp. View Document Theoretical Studies in Chemical Kinetics - Annual Report, 1970.; Karplus, Martin; October 1970; HUX--3780-33; ACC0483 544 K, 7 pp. View Document Nonequilibrium Contribution to the Rate of Reaction. III. Isothermal Multicomponent Systems; Shizgal, B.; Karplus, M.; October 1970; HUX--3780-31; ACC0482
Rice Glycosyltransferase (GT) Phylogenomic Database
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.
Ronald, Pamela
Graph-based reasoning in collaborative knowledge management for industrial maintenance
Capitalization and sharing of lessons learned play an essential role in managing the activities of industrial systems. This is particularly the case for the maintenance management, especially for distributed systems often associated with collaborative ... Keywords: Case-based reasoning, Conceptual graph rule, Experience feedback, Expert knowledge, Fleet considerations, Maintenance management
Bernard Kamsu-Foguem, Daniel Noyes
Midcontinent Interactive Digital Carbon Atlas and Relational Database (MIDCARB)
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.
Timothy R. Carr; Scott W. White
Disclaimer concerning the fundamental constants database
... Uncertainty Constants, Units & Uncertainty home page. Disclaimer concerning the fundamental constants database The ...
NETL: Gasification Systems
Brochures Gasification Systems Reference Shelf - Brochures The Gasification Technology brochures are as follows: Gasification Plant Databases (Aug 2013) Gasification Systems...
User's guide to the Geothermal Resource Areas Database
The National Geothermal Information Resource project at the Lawrence Berkeley Laboratory is developing a Geothermal Resource Areas Database, called GRAD, designed to answer questions about the progress of geothermal energy development. This database will contain extensive information on geothermal energy resources for selected areas, covering development from initial exploratory surveys to plant construction and operation. The database is available for on-lie interactive query by anyone with an account number on the computer, a computer terminal with an acoustic coupler, and a telephone. This report will help in making use of the database. Some information is provided on obtaining access to the computer system being used, instructions on obtaining standard reports, and some aids to using the query language.
Lawrence, J.D.; Leung, K.; Yen, W.
Solid Waste Projection Model: Database (Version 1.3). Technical reference manual
Exporter Database | Data.gov
Exporter Database Exporter Database Manufacturing Data/Tools Research/Tech Services Apps Challenges Blogs Let's Talk Manufacturing You are here Data.gov » Communities » Manufacturing » Data Exporter Database Dataset Summary Description This tool provides a statistical overview and tables outlining the export activities of U.S. small and medium-sized enterprises (SMEs), which are defined as firms that have fewer than 500 employees. All figures in this overview and tables include only identifiable or "known" exports, i.e., exports that can be linked to individual companies using information on U.S. export declarations. Tags {exporter,"small and medium businesses",SME} Dataset Ratings Overall 0 No votes yet Data Utility 0 No votes yet Usefulness 0 No votes yet Ease of Access
Energy Citations Database (ECD) - FAQ
ECD Frequently Asked Questions (FAQs) What does the Energy Citations Database (ECD) contain? and what is the date range of the content? When was ECD created and why? What are the topics in ECD? Search Architecture - What Is under the hood? How often are documents added to the database? Is Energy Citations Database (ECD) the electronic equivalent of Energy Research Abstracts (ERA)? How do I find a document in ECD? How do I know if a document is available electronically? Of what value is a citation without an electronic document? How do I download a document? how long will it take? and how much will it cost? If I am interested in just a few pages, can I download only those pages of interest? Can I capture citations using Zotero? How do I get a copy of a journal article?
Translating Relational Databases into Linked Open Data
mappings 68 C Implementation architecture 72 D BOZAR mapping 73 E Agenda.be mappings 80 2 #12;List . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 3 #12;Listings 1.1 Resulting triples of the simple RDF graph 1. The proposed structure can be seen as a giant graph where data are interconnected with each other, as shown
Libre de Bruxelles, Université
Visualization Graph | OpenEI Community
Home Groups Community Central Green Button Applications Developer Utility Rate FRED: FRee Energy Database More Public Groups Private Groups Features Groups Blog posts Content...
DOE Patents Database - Home
A SCIENCE Accelerator Resource A SCIENCE Accelerator Resource Comprehensive coverage of DOE patent information DOepatents is the U.S. Department of Energy's central collection of patent information, where research and development intersect with innovation and invention. This collection demonstrates the Department's considerable contribution to scientific progress from the 1940s to today. Innventions Dr. Brian Looney, SRNL, Environmental remediation Dr. Paul Alvisatos, LBL, Quantum Dots Dr. Bertozzi, LBL, Contact Lens Innovation PNL Starlight Information Visualization System Dr. K. Amine, ANL, Battery Chemistry Innovation Some links on this page may take you to non-federal websites. Their policies may differ from this site. U.S. Department of Energy U.S. Deparment of Energy Office of Science Office of Scientific and Technical Information
DOE Patents Database - Innovations
DOE Innovations DOE Innovations Breakthroughs and Award Winners from the last 2 decades... Capillary Electrophoresis Ames Laboratory This technology allows multiple samples of substances to be analyzed simultaneously, providing both speed and accuracy. Has won multiple R&D 100 awards for inventor Ed Yeung and has been licensed by Spectromedix. U.S. Patent Nos. 5,324,401 and 5,582,705. Ultrananocrystalline Diamond (UNCD) Argonne National Laboratory Greatly surpasses other diamond film technologies with commercial potential, and can be used in a broad and diverse range of applications from macro to nanodevices, 2006 FLC Award Winner. U.S. Patent Nos. 5,620,512 and others. T7 Gene Expression System Brookhaven National Laboratory This patent family has been licensed to over 700 commercial entities
Prolinks: A Database of Protein Functional Linkages Derived from Coevolution
Prolinks makes dozens of genome data files available for download and is a a collection of inference methods used to predict functional linkages between proteins. These methods include the Phylogenetic Profile method which uses the presence and absence of proteins across multiple genomes to detect functional linkages; the Gene Cluster method, which uses genome proximity to predict functional linkage; Rosetta Stone, which uses a gene fusion event in a second organism to infer functional relatedness; and the Gene Neighbor method, which uses both gene proximity and phylogenetic distribution to infer linkage. [From About Prolinks Database 2.0 at http://prolinks.doe-mbi.ucla.edu/cgi_files/functionator/about.html] Users may search the database using a unique identifier number from any of several, well known resources or by various characteristics for specific proteins within specific genomes. Results include amino acid sequences, homologs, phylogenetic profiles, COGs (Clusters of Orthologous Groups of proteins), and KEGG information (Kyoto Encyclopedia of Genes and Genomes). When the Prolinks inferences are run, color graphs of linkages are generated. (Specialized Interface)
Bowers, Peter M.; Pelligrini, Matteo; Thompson, Mike J.; Fierro, Joe; Yeates, Todd O.; Eisenberg, David
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan-Newman method based on edge betweenness centrality. We show that they can be effective at discovering the latent groups or communities that are defined by the link structure of a graph. However, both approaches rely on prohibitively expensive computations, given the size of modern relational data sets. Network structure indices (NSIs) are a proven technique for indexing network structure and efficiently finding short paths. We show how incorporating NSIs into these graph clustering algorithms can overcome these complexity limitations. We also present promising quantitative and qualitative evaluations of the modified algorithms on synthetic and real data sets. 1.
Matthew J. Rattigan; Marc Maier; David Jensen
GRAPHS AND (Z2) k-ACTIONS
Abstract. Let (?, M n) be an effective smooth action of (Z2) k on an n-dimensional smooth closed connected manifold having a finite fixed set. One can associate to this action a regular graph of valency n. If the action is nonbounding one uses this graph to obtain a lower bound for the number of fixed points. Furthermore, this result is applied to a general nonbounding (Z2) k-action fixing a finite fixed set. With the help of graphs and the Kosniowski-Stong formula, up to cobordism all (Z2) k-actions fixing three isolated points (resp. four isolated points) are classified completely, and at the same time, the Smith problem for (Z2) k-actions fixing three isolated points (resp. four isolated points) is also solved. 1.
Zhi L �
Subgraphs of quasi-random oriented graphs
One cannot guarantee the presence of an oriented four-cycle in an oriented graph $D$ simply by demanding it has many edges, as an acyclic orientation of the complete graph on $n$ vertices has $\\binom{n}{2}$ edges -- the most possible -- but contains no oriented cycle. We show that a simple quasi-randomness condition on the orientation of $D$ does allow one to guarantee the presence of an oriented four-cycle. Significantly our results work even for sparse oriented graphs. Furthermore, we give examples which show that, in a sense, our result is best possible. We also prove a result concerning oriented six-cycles and a more general result in the case $D$ is dense. Finally, we raise a number of questions and conjectures related to these results.
Amini, Omid; Huc, Florian
Long alternating cycles in edge-colored complete graphs
Let Knc denote a complete graph on n vertices whose edges are colored in an arbitrary way. And let ?(Knc) denote the maximum number of edges of the same ... Keywords: alternating cycle, color degree, edge-colored graph
Hao Li; Guanghui Wang; Shan Zhou
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of ...
Xiao, Lin
An empirical comparison of some approximate methods for graph coloring
The Graph Coloring Problem (GCP) is a classical NP-complete problem for which several approximate solution algorithms have been proposed: Brelaz algorithm, simulated annealing (SA), ant colony optimization (ACO). This paper reports empirical results ... Keywords: graph coloring, gravitational swarm
Israel Rebollo-Ruiz; Manuel Gra�a
Computing maximum non-crossing matching in convex bipartite graphs
We consider computing a maximum non-crossing matching in convex bipartite graphs. For a convex bipartite graph of n vertices and m edges, we present an O (n logn ...
Danny Z. Chen; Xiaomin Liu; Haitao Wang
The cost of monotonicity in distributed graph searching
are placed at a particular vertex of the graph, called the homebase. Moreover, this sequence of moves must is aiming at clearing the whole network. Given a graph G and a homebase v0 V (G), the search problem
Ilcinkas, David
of the graph, called the homebase. Moreover, this sequence of moves must satisfy that recontamination never network. Given a graph G and a homebase v0 V (G), the search problem consists in designing a distributed
Using constraints to achieve stability in automatic graph layout algorithms
Automatic layout algorithms are commonly used when displaying graphs on the screen because they provide a �nice� drawing of the graph without user intervention. There are, however, a couple of disadvantages to automatic layout. Without user ...
Karl-Friedrich B�hringer; Frances Newbery Paulisch
Image segmentation using quadtree-based similarity graph and normalized cut
The graph cuts in image segmentation have been widely used in recent years because it regards the problem of image partitioning as a graph partitioning issue, a well-known problem in graph theory. The normalized cut approach uses spectral graph properties ... Keywords: graph partitioning, image segmentation, quadtree, spectral graph
Marco Antonio Garcia De Carvalho; Anselmo Castelo Branco Ferreira; Andr� Luis Costa
We introduce an operator � mapping any graph parameter �( ), nested between the stability number ...... Local chromatic number and Sperner capacity. ?ournal.
A hybrid parallel genetic algorithm approach for graph coloring
Graph-Coloring problem (GCP) deals with assigning labels (colors) to the vertices of a graph such that adjacent vertices do not get the same color. Coloring a graph with minimum number of colors is a well-known NP-hard problem. In this paper a new permutation ... Keywords: Graph coloring problem, message passing interface (MPI), migration model, parallel genetic algorithm, static wavelength assignment
S. N. Sivanandam; S. Sumathi; T. Hamsapriya
A Metadata-Rich File System
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.
Ames, S; Gokhale, M B; Maltzahn, C
Marine and Hydrokinetic Technology Database
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 is currently (2009) being updated to include ocean thermal energy technologies, companies, and projects.[Taken from http://www2.eere.energy.gov/windandhydro/hydrokinetic/
Dual lookups in pattern databases
A pattern database (PDB) is a heuristic function stored as a lookup table. Symmetries of a state space are often used to enable multiple values to be looked up in a PDB for a given state. This paper introduces an additional PDB lookup, called the dual ...
Ariel Felner; Uzi Zahavi; Jonathan Schaeffer; Robert C. Holte
Hiroshi Ishikawa A Practical Introduction to Graph Cut
Technology Contents Overview / Brief history Energy minimization Graphs and their minimum cuts Energy Elevation map #12;History Probablistic methods (SA, ICM,...) have been used for energy minimization OR has Overview / Brief history Energy minimization Graphs and their minimum cuts Energy minimization via graph
Ishikawa, Hiroshi
Discovering informative connection subgraphs in multi-relational graphs
Discovering patterns in graphs has long been an area of interest. In most approaches to such pattern discovery either quantitative anomalies, frequency of substructure or maximum flow is used to measure the interestingness of a pattern. In this paper ... Keywords: multi-relational graphs, semantic pattern discovery in RDF graphs, subgraph discovery
Cartic Ramakrishnan; William H. Milnor; Matthew Perry; Amit P. Sheth
Modeling molecular polarizabilities with graph-theoretical concepts
A model study of the molecular polarizabilities of a wide heterogeneous class of organic compounds was carried out. The model of this property was based on graph-theoretical molecular connectivity and pseudoconnectivity basis indices, including the corresponding ... Keywords: complete graphs, core electrons, graph-theoretical connectivity indices, molecular polarizabilities
Kinetic and stationary point-set embeddability for plane graphs
We investigate a kinetic version of point-set embeddability. Given a plane graph G(V,E) where |V|=n, and a set P of n moving points where the trajectory of each point is an algebraic function of constant ... Keywords: kinetic algorithm, kinetic graph drawing, plane graph, point-set embeddability
Zahed Rahmati; Sue H. Whitesides; Valerie King
View discovery in OLAP databases through statistical combinatorial optimization
OnLine Analytical Processing (OLAP) is a relational database technology providing users with rapid access to summary, aggregated views of a single large database, and is widely recognized for knowledge representation and discovery in high-dimensional relational databases. OLAP technologies provide intuitive and graphical access to the massively complex set of possible summary views available in large relational (SQL) structured data repositories. The capability of OLAP database software systems to handle data complexity comes at a high price for analysts, presenting them a combinatorially vast space of views of a relational database. We respond to the need to deploy technologies sufficient to allow users to guide themselves to areas of local structure by casting the space of 'views' of an OLAP database as a combinatorial object of all projections and subsets, and 'view discovery' as an search process over that lattice. We equip the view lattice with statistical information theoretical measures sufficient to support a combinatorial optimization process. We outline 'hop-chaining' as a particular view discovery algorithm over this object, wherein users are guided across a permutation of the dimensions by searching for successive two-dimensional views, pushing seen dimensions into an increasingly large background filter in a 'spiraling' search process. We illustrate this work in the context of data cubes recording summary statistics for radiation portal monitors at US ports.
Hengartner, Nick W [Los Alamos National Laboratory; Burke, John [PNNL; Critchlow, Terence [PNNL; Joslyn, Cliff [PNNL; Hogan, Emilie [PNNL
WTO Subsidy Notifications Database | Open Energy Information
WTO Subsidy Notifications Database WTO Subsidy Notifications Database Jump to: navigation, search Tool Summary LAUNCH TOOL Name: WTO Subsidy Notifications Database Agency/Company /Organization: World Trade Organization Topics: Finance, Market analysis, Policies/deployment programs Resource Type: Dataset Website: www.globalsubsidies.org/private/modules/knowledgebox/external/index.ph WTO Subsidy Notifications Database Screenshot References: WTO Subsidy Database[1] Overview "This searchable database provides links to the WTO's new and full subsidy notifications. Notifications are indexed by country, date of publication, symbol, period in which the subsidies are reported, and - though it should not be considered exhaustive - the sectors to which subsidies have been granted." References
Conservation laws for a gauge-variant umbra-Lagrangian in classical mechanics using bond graphs
In this article, conservation laws (invariants of motion) have been derived from symmetry operations for different energy domains. The formulation has been derived through an extended Noether�??s theorem and the bond graphs. An additional time-like ... Keywords: Noether's theorem, gauge transformation, radiation thermal system, time variant stiffness, umbra-Lagrangian
Vikas Rastogi; Amalendu Mukherjee
Shortest Paths in Fuzzy Weighted Graphs Chris Cornelis,* Peter De Kesel,
and fuzzy logic--Theory and applications. Upper Saddle River, NJ: Prentice Hall; 1995. 15. Campos L, Muñoz A;12:213227. 5. Dubois D, Prade H. Fuzzy sets and systems: Theory and applications. New York: Aca- demic PressShortest Paths in Fuzzy Weighted Graphs Chris Cornelis,* Peter De Kesel, Etienne E. Kerre
Gent, Universiteit
Suggesting friends using the implicit social graph
Although users of online communication tools rarely categorize their contacts into groups such as "family", "co-workers", or "jogging buddies", they nonetheless implicitly cluster contacts, by virtue of their interactions with them, forming implicit ... Keywords: contact group clustering, implicit social graph, tie strength
Maayan Roth; Assaf Ben-David; David Deutscher; Guy Flysher; Ilan Horn; Ari Leichtberg; Naty Leiser; Yossi Matias; Ron Merom
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan-Newman method based on edge betweenness centrality. We show that ...
Grid smoothing: a graph-based approach
In the past few years, mesh representation of images has attracted a lot of research interest due to its wide area of applications in image processing. In the mesh framework, an image is represented by a graph in which the nodes represent the pixels ... Keywords: content adaptative mesh, grid smoothing, image coding, non-linear optimisation
Guillaume Noel; Karim Djouani; Yskandar Hamam
Computing role assignments of chordal graphs
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1,...,k} called a role to each vertex of G such that any two vertices with the same role have ...
Pim Van't Hof; Dani�l Paulusma; Johan M. M. Van Rooij
Hamiltonian Graphs and the Traveling Salesman Problem
A new characterization of Hamiltonian graphs using f-cutset matrix is proposed. A new exact polynomial time algorithm for the traveling salesman problem (TSP) based on this new characterization is developed. We then define so called ordered weighted adjacency list for given weighted complete graph and proceed to the main result of the paper, namely, the exact algorithm based on utilization of ordered weighted adjacency list and the simple properties that any path or circuit must satisfy. This algorithm performs checking of sub-lists, containing (p-1) entries (edge pairs) for paths and p entries (edge pairs) for circuits, chosen from ordered adjacency list in a well defined sequence to determine exactly the shortest Hamiltonian path and shortest Hamiltonian circuit in a weighted complete graph of p vertices. The procedure has intrinsic advantage of landing on the desired solution in quickest possible time and even in worst case in polynomial time. A new characterization of shortest Hamiltonian tour for a weighted complete graph satisfying triangle inequality (i.e. for tours passing through every city on a realistic map of cities where cities can be taken as points on a Euclidean plane) is also proposed. Finally, we discuss a novel classical algorithm for unstructured search and its effect on any of the NP-Complete problems.
Dhananjay P. Mehendale
Multilevel heuristic algorithm for graph partitioning
Many real applications involve optimisation problems where more than one objective has to be optimised at the same time. One of these kinds of problems is graph partitioning, that appears in applications such as VLSI design, data-mining, efficient disc ...
Raul Ba�os; Consolaci�n Gil; Julio Ortega; Francisco G. Montoya
Graph grammars with string-regulated rewriting
Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to ... Keywords: Development, Expressive power, Genetic regulation, Graph grammars, Regulated rewriting
Daniel Lobo; Francisco J. Vico; J�rgen Dassow
Exploiting graph properties of game trees
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have concentrated on the traversal of trees, giving the field the name "game-tree ... Keywords: game playing, search
Aske Plaat; Jonathan Schaeffer; Wim Pijls; Arie de Bruin
Transaction Processing in Mobile, Heterogeneous Database Systems
Abstract�As technological advances are made in software and hardware, the feasibility of accessing information "any time, anywhere" is becoming a reality. Furthermore, the diversity and amount of information available to a given user is increasing at ... Keywords: Mobile computing environment, global information sharing process, concurrency control, caching and prefetching, simulation and analysis.
James B. Lim; A. R. Hurson
Intelligent Transportation Systems Deployment Statistics Database
, transportation agencies in 108 metropolitan areas involved with freeway, arterial, and transit management, public to insights regarding future program changes, redefinition of goals, or maintenance of current program Aviation Safety Air Traffic Management Analysis Data, Statistical Analysis Geo-Spatial Information Tools
Maker Can Construct a Sparse Graph on a Small Board
We study Maker/Breaker games on the edges of sparse graphs. Maker and Breaker take turns in claiming previously unclaimed edges of a given graph H. Maker aims to occupy a given target graph G and Breaker tries to prevent Maker from achieving his goal. We define a function f and show that for every d-regular graph G on n vertices there is a graph H with at most f(d)n edges such that Maker can occupy a copy of G in the game on H.
Gebauer, Heidi
Workload-Aware Database Monitoring and Consolidation
In most enterprises, databases are deployed on dedicated database servers. Often, these servers are underutilized much of the time. For example, in traces from almost 200 production servers from different organizations, ...
Curino, Carlo
Stepwise specification of dynamic database behaviour
This paper presents a methodology for the stepwise specification of dynamic database behaviour. A conceptual schema is described in three levels: data, objects and transactions. To determine which sequences of database states are �admissible�, ...
Udo W. Lipeck
NETL Carbon Capture and Storage Database
or new projects are released to the public. Access to the database requires use of Google Earth. The NETL CCS database is a layer in Google Earth. Free downloadable software...
The inherent uncertainty of data present in numerous applications such as sensor databases, text annotations, and information retrieval motivate the need to handle imprecise data at the database level. Uncertainty can be at the attribute or tuple level ...
Database of Mechanical Properties for Textile Composites
This report describes the approach followed to develop a database for mechanical properties of textile composites. The data in this database is assembled from NASA Advanced Composites Technology (ACT) programs and from data in the public domain. This ...
Delbrey J.
Energy Citations Database (ECD) - Home Page
SEARCH Search the Database: Search FEATURE SciTech Connect Search SciTech Connect, a consolidation of Information Bridge and Energy Citations Database, incorporating all the R&D...
Coal Power Plant Database | Open Energy Information
Power Plant Database Power Plant Database Jump to: navigation, search Name Coal Power Plant Database Data Format Excel Spreadsheet, Excel Pivot Table, Access Database Geographic Scope United States TODO: Import actual dataset contents into OpenEI The Coal Power Plant Database (CPPDB) is a dataset which "consolidates large quantities of information on coal-fired power plants in a single location."[1] It is produced by the National Energy Technology Laboratory (NETL). External links 2007 Edition Excel Spreadsheet Excel Pivot Table Access Database User's Manual (PDF) References ↑ "User's Manual: Coal Power Plant Database" Retrieved from "http://en.openei.org/w/index.php?title=Coal_Power_Plant_Database&oldid=273301" Categories: Datasets Articles with outstanding TODO tasks
Energy Citations Database (ECD) - Architecture
Search Architecture - What Is under the hood? 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 Department of Energy (DOE) and its predecessor agencies. This search is powered by traditional Web-based architecture. That is, a database and a set of citations are made searchable by a series of dynamic Web pages with persistent URLs (Web addresses). If a citation has associated full text then that content is also indexed and made searchable. The information consumer may perform a search against the entire record, both bibliographic citations and their associated full text, from the Basic Search feature. In addition, the user may perform fine grain searches by specific bibliographic citation fields and/or full text via the Fielded
Technical Database | OpenEI
56 56 Varnish cache server Browse Upload data GDR 429 Throttled (bot load) Error 429 Throttled (bot load) Throttled (bot load) Guru Meditation: XID: 2142281756 Varnish cache server Technical Database Dataset Summary Description Technical Reference for Hydrogen Compatibility of Materials Source Sandia National Laboratories Date Released June 03rd, 2010 (4 years ago) Date Updated September 27th, 2012 (2 years ago) Keywords Compatibility of Materials hydrogen NREL Sandia Technical Database Technical Reference Data application/vnd.openxmlformats-officedocument.spreadsheetml.sheet icon 1100_cia85_ten_fra_fat.xlsx (xlsx, 60.9 KiB) application/vnd.openxmlformats-officedocument.spreadsheetml.sheet icon 1100_san10_fra_fat.xlsx (xlsx, 58.5 KiB) application/vnd.openxmlformats-officedocument.spreadsheetml.sheet icon 1100_san10b_fra_fat.xlsx (xlsx, 59.4 KiB)
Energy Citations Database (ECD) - Availability
The Energy Citations Database (ECD) contains over 2.4 million bibliographic The Energy Citations Database (ECD) contains over 2.4 million bibliographic citations and over 307,000 full-text documents, primarily from 1943 forward. When an electronic document is available, an indicator is provided in the search results and on the bibliographic citation page. The electronic document may be accessed via a link to the document. To view an electronic document, click on the icon. (You must have Adobe Acrobat Reader plug-in [exit federal site] installed.) To download an electronic document, right-click on the icon and choose "Save Link As" or "Save Target As". In general, when an electronic document is not available, document availability information may be found on the Bibliographic Citation page in the Availability, Publisher, Author, Research Organization, and/or Resource
1991-2005 National Solar Radiation Database
This fact sheet provides an overview of the purpose, benefit, and features of the newly updated National Solar Radiation Database.
Wilcox, S.
National Vulnerability Database Full Vulnerability Listing
NVD Complete Vulnerability Listing. This web page contains direct links to every National Vulnerability Database vulnerability entry. ...
Security Automation and the National Vulnerability Database
... 6 Page 7. National Vulnerability Database Role Receive CVE ... Environmental Integrity ... Use Case: Vulnerability Management CVE 2012-3544 30 ...
WEB RESOURCE: Aerospace Structural Materials Database - TMS
Oct 29, 2007 ... The Aerospace Structural Materials Database (ASMD) was developed by CINDAS LLC under a Cooperative Research and Development�...
... MIL-HDBK-5H: Metallic Materials and Elements for Aerospace Vehicle ... Electric Power Research Institute, 2003, 0, 956, Lynette Karabin, 2/9/2007 6:35 AM
Selected Research Issues in Decision Support Databases
A flurry of buzzwords awaits anyone investigating database technology for decision support: data warehouse, multidimensional and dimensional database, on-line analytical processing, star schema, slicing, dicing, drill-down and roll-up. We introduce ... Keywords: data warehouse, databases, decision-support, dimensional, multidimensional
David Maier; Mary Edie Meredith; Leonard Shapiro
Modeling and managing changes in text databases
Large amounts of (often valuable) information are stored in web-accessible text databases. �Metasearchers� provide unified interfaces to query multiple such databases at once. For efficiency, metasearchers rely on succinct statistical summaries ... Keywords: Metasearching, distributed information retrieval, text database selection
Panagiotis G. Ipeirotis; Alexandros Ntoulas; Junghoo Cho; Luis Gravano
"Magic mirror on the wall, who's the fastest Database of them all?" A Survey of Database Benchmarks
Benchmarks are important tools for measuring the performance of database management systems (DBMS) and for understanding vendor claims of performance. This paper defines DBMS benchmarks, explores the role of the Transaction Processing Performance Council as the only benchmark standards organization, and surveys eight existing DBMS benchmarks for on-line transaction processing, relational, and object-oriented databases. 1 Introduction When examining the performance of a commercial database management system (DBMS),one is bombarded with vendor performance claims. Each vendor will shower you with claims of "tpsA-Local" ratings, or top performance on the "TPC-C" benchmark. If you are looking at a commercial object-oriented DBMS, vendors will tell you they have the best performance on the "Cattell" (or OO1 or "Sun") benchmark. The use of benchmark performance measurements by commercial DBMS vendors seems a bit like the Queen in Snow White asking the magic mirror who is the fairest. If the ...
Usaf Maj; Timothy J. Halloran; Timothy J. Halloran; Mark A. Roth; Mark A. Roth
Fact Sheet: Energy Storage Database (October 2012) | Department...
Energy Storage Database (October 2012) Fact Sheet: Energy Storage Database (October 2012) DOE and Sandia National Laboratories are developing a database of energy storage projects...
DOE Science Showcase - Featured Climate Change Research from DOE Databases
Featured Climate Change Research from DOE Databases Featured Climate Change Research from DOE Databases Search Results from DOE Databases View research documents, citations, accomplishments, patents, and projects related to climate change, one of the primary scientific challenges addressed through the Incite Program. Climate Change Information Bridge Energy Citations Database DOE R&D Accomplishments Database DOE Data Explorer Climate Modeling Information Bridge Energy Citations Database DOE R&D Accomplishments Database DOE Data Explorer Ocean Turbulence and Climate Information Bridge Energy Citations Database DOE Accomplishments Database DOE Data Explorer Cloud Simulation and Models Information Bridge Energy Citations Database DOE Accomplishments Database DOE Data Explorer Global Warming Information Bridge Energy Citations Database
Using Conceptual Graphs in a Multifaceted Logical Model for Information Retrieval
Ounis,I. Chevallet,J. Proceedings of the 7th Database and Expert System Applications Conference, DEXA'96 Zurich, Switzerland, Lecture Notes in Computer Science pp 812-823 Springer
Ounis, I.
Lachesis: robust database storage management based on device-specific performance characteristics
Database systems work hard to tune I/O performance, but do not always achieve the full performance potential of modern disk systems. Their abstracted view of storage components hides useful device-specific characteristics, such as disk track boundaries ...
Jiri Schindler; Anastassia Ailamaki; Gregory R. Ganger
This annual report describes progress in the second year of the three-year project entitled ''Midcontinent Interactive Digital Carbon Atlas and Relational Database (MIDCARB)''. This project, funded by the Department of Energy, is a cooperative project that assembles a consortium of five states (Indiana, Illinois, Kansas, Kentucky and Ohio) to construct an online distributed Relational Database Management System (RDBMS) and Geographic Information System (GIS) covering aspects of carbon dioxide geologic sequestration (http://www.midcarb.org). The system links the five states in the consortium into a coordinated regional database system consisting of datasets useful to industry, regulators and the public. The project is providing advanced distributed computing solutions to link database servers across the five states into a single system where data is maintained at the local level but is accessed through a single Web portal and can be queried, assembled, analyzed and displayed. Each individual state has strengths in data gathering, data manipulation and data display, including GIS mapping, custom application development, web development, and database design. Sharing of expertise provides the critical mass of technical expertise to improve CO{sub 2} databases and data access in all states. This project improves the flow of data across servers in the five states and increases the amount and quality of available digital data. Data is being assembled to analyze CO{sub 2} sequestration potential from a single object (e.g., power plant or well) to a region and across geographic boundaries. The MIDCARB system is robust and capable of being updated from multiple sources on a daily basis. The MIDCARB project has developed improved online tools to provide real-time display and analysis of CO{sub 2} sequestration data. The MIDCARB project is a functional template for distributed data systems to address CO{sub 2} sequestration and other natural resource issues that cross the boundaries between institutions and geographic areas. The system links together data from sources, sinks and transportation within a spatial database that can be queried online. Visualization of high quality and current data can assist decision makers by providing access to common sets of high quality data in a consistent manner.
A Survey on Database Performance in Virtualized Cloud Environments
Cloud Computing emerged as a major paradigm over the years. Major challenges it poses to computer science are related to latency, scale, and reliability issues. It leverages strong economical aspects and provides sound answers to questions like energy ... Keywords: Cloud Computing, Database Management Systems DBMS, Online Transaction Processing OLTP, Performance, Virtualization
Alejandro Buchmann; Todor Ivanov; Ilia Petrov
Survey on speech emotion recognition: Features, classification schemes, and databases
Recently, increasing attention has been directed to the study of the emotional content of speech signals, and hence, many systems have been proposed to identify the emotional content of a spoken utterance. This paper is a survey of speech emotion classification ... Keywords: Archetypal emotions, Dimensionality reduction techniques, Emotional speech databases, Speech emotion recognition, Statistical classifiers
Moataz El Ayadi; Mohamed S. Kamel; Fakhri Karray
Evaluating parallel relational databases for medical data analysis.
Hospitals have always generated and consumed large amounts of data concerning patients, treatment and outcomes. As computers and networks have permeated the hospital environment it has become feasible to collect and organize all of this data. This raises naturally the question of how to deal with the resulting mountain of information. In this report we detail a proof-of-concept test using two commercially available parallel database systems to analyze a set of real, de-identified medical records. We examine database scalability as data sizes increase as well as responsiveness under load from multiple users.
Rintoul, Mark Daniel; Wilson, Andrew T.
U-233: Oracle Database INDEXTYPE CTXSYS.CONTEXT Bug Lets Remote
3: Oracle Database INDEXTYPE CTXSYS.CONTEXT Bug Lets Remote 3: Oracle Database INDEXTYPE CTXSYS.CONTEXT Bug Lets Remote Authenticated Users Gain Elevated Privileges U-233: Oracle Database INDEXTYPE CTXSYS.CONTEXT Bug Lets Remote Authenticated Users Gain Elevated Privileges August 13, 2012 - 7:00am Addthis PROBLEM: Oracle Database INDEXTYPE CTXSYS.CONTEXT Bug Lets Remote Authenticated Users Gain Elevated Privileges PLATFORM: Oracle Database Server versions 10.2.0.3, 10.2.0.4, 10.2.0.5, 188.8.131.52, 220.127.116.11, 188.8.131.52 ABSTRACT: A remote authenticated user with 'Create Table' privileges can gain 'SYS' privileges on the target system. Reference LINKS: Oracle Security Alert Oracle Security Alert - CVE-2012-3132 Risk Matrices SecurityTracker Alert ID: 1027367 CVE-2012-3132 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in Oracle Database. This vulnerability is not
DOE Announces Webinars on Energy Systems Advances, Hydrogen Safety...
Energy Systems Advances, Hydrogen Safety Events Databases, and More DOE Announces Webinars on Energy Systems Advances, Hydrogen Safety Events Databases, and More September 9, 2013...
V-016: HP Performance Insight Bugs with Sybase Database Let Remote Users
6: HP Performance Insight Bugs with Sybase Database Let Remote 6: HP Performance Insight Bugs with Sybase Database Let Remote Users Deny Service and Take Full Control of the Target System V-016: HP Performance Insight Bugs with Sybase Database Let Remote Users Deny Service and Take Full Control of the Target System November 5, 2012 - 6:00am Addthis PROBLEM: HP Performance Insight Bugs with Sybase Database Let Remote Users Deny Service and Take Full Control of the Target System PLATFORM: HP Performance Insight v5.31, v5.40 and v5.41 running on HP-UX, Solaris, Linux, and Windows and using Sybase as the database ABSTRACT: Two vulnerabilities were reported in HP Performance Insight. REFERENCE LINKS: HP Support Document ID: c03555488 SecurityTracker Alert ID: 1027719 CVE-2012-3269 CVE-2012-3270 IMPACT ASSESSMENT: High DISCUSSION:
Visibility graph analysis of solar wind velocity
We analyze in situ measurements of solar wind velocity obtained by Advanced Composition Explorer (ACE) spacecraft and Helios spacecraft during the years 1998-2012 and 1975-1983 respectively. The data belong to mainly solar cycle 23 (1996-2008) and solar cycle 21 (1976-1986) respectively. We use Directed Horizontal Visibility graph (DHVg) algorithm and estimate a graph functional, namely, the degree distance (D) as the Kullback-Leibler divergence (KLD) argument to understand time irreversibility of solar wind time series. We estimate this degree distance irreversibility parameter for these time series at different phases of solar activity cycle. Irreversibility parameter is first established for known dynamical data and then applied for solar wind velocity time series. It is observed that irreversibility in solar wind velocity fluctuations show similar behaviour at 0.3 AU (Helios data) and 1 AU (ACE data). Moreover it changes over the different phases of solar activity cycle.
Suyal, Vinita; Singh, Harinder P
HEND: A Database for High Energy Nuclear Data
We propose to develop a high-energy heavy-ion experimental database and make it accessible to the scientific community through an on-line interface. The database will be searchable and cross-indexed with relevant publications, including published detector descriptions. It should eventually contain all published data from older heavy-ion programs such as the Bevalac, AGS, SPS and FNAL fixed-target programs, as well as published data from current programs at RHIC and new facilities at GSI (FAIR), KEK/Tsukuba and the LHC collider. This data includes all proton-proton, proton-nucleus to nucleus-nucleus collisions as well as other relevant systems and all measured observables. Such a database would have tremendous scientific payoff as it makes systematic studies easier and allows simpler benchmarking of theoretical models to a broad range of experiments. To enhance the utility of the database, we propose periodic data evaluations and topical reviews. These reviews would provide an alternative and impartial mechanism to resolve discrepancies between published data from rival experiments and between theory and experiment. Since this database will be a community resource, it requires the high-energy nuclear physics community's financial and manpower support.
Brown, D; Vogt, R
Database tools for enhanced analysis of TMX-U data
A commercial database software package has been used to create several databases and tools that assist and enhance the ability of experimental physicists to analyze data from the Tandem Mirror Experiment-Upgrade (TMX-U) experiment. This software runs on a DEC-20 computer in M-Division's User Service Center at Lawrence Livermore National Laboratory (LLNL), where data can be analyzed offline from the main TMX-U acquisition computers. When combined with interactive data analysis programs, these tools provide the capability to do batch-style processing or interactive data analysis on the computers in the USC or the supercomputers of the National Magnetic Fusion Energy Computer Center (NMFECC) in addition to the normal processing done by the TMX-U acquisition system. One database tool provides highly reduced data for searching and correlation analysis of several diagnostic signals within a single shot or over many shots. A second database tool provides retrieval and storage of unreduced data for use in detailed analysis of one or more diagnostic signals. We will show how these database tools form the core of an evolving offline data analysis environment on the USC computers.
Stewart, M.E.; Carter, M.R.; Casper, T.A.; Meyer, W.H.; Perkins, D.E.; Whitney, D.M.
Enhancing the DNA Patent Database
Final Report on Award No. DE-FG0201ER63171 Principal Investigator: LeRoy B. Walters February 18, 2008 This project successfully completed its goal of surveying and reporting on the DNA patenting and licensing policies at 30 major U.S. academic institutions. The report of survey results was published in the January 2006 issue of Nature Biotechnology under the title �The Licensing of DNA Patents by US Academic Institutions: An Empirical Survey.� Lori Pressman was the lead author on this feature article. A PDF reprint of the article will be submitted to our Program Officer under separate cover. The project team has continued to update the DNA Patent Database on a weekly basis since the conclusion of the project. The database can be accessed at dnapatents.georgetown.edu. This database provides a valuable research tool for academic researchers, policymakers, and citizens. A report entitled Reaping the Benefits of Genomic and Proteomic Research: Intellectual Property Rights, Innovation, and Public Health was published in 2006 by the Committee on Intellectual Property Rights in Genomic and Protein Research and Innovation, Board on Science, Technology, and Economic Policy at the National Academies. The report was edited by Stephen A. Merrill and Anne-Marie Mazza. This report employed and then adapted the methodology developed by our research project and quoted our findings at several points. (The full report can be viewed online at the following URL: http://www.nap.edu/openbook.php?record_id=11487&page=R1). My colleagues and I are grateful for the research support of the ELSI program at the U.S. Department of Energy.
Walters, LeRoy B.
PH2: an hadoop-based framework for mining structural properties from the PDB database
PH2 is an Hadoop and SQL-based tool for extracting information out of the Protein Database (PDB) quickly. The PDB database is stored as a set of Hadoop sequence files in a replicated way on the Hadoop Distributed File System. PH2 then allows a user to ... Keywords: PDB, hadoop, parallel computing, structural information
Scott Hazelhurst
Review: 3D geo-database research: Retrospective and future directions
3D geo-database research is a promising field to support challenging applications such as 3D urban planning, environmental monitoring, infrastructure management, and early warning or disaster management and response. In these fields, interdisciplinary ... Keywords: 3D GIS, Geo-data modelling, Geo-database, Information systems for geo- and environmental sciences
Martin Breunig; Sisi Zlatanova
Case study: The furniture company: deductive databases and the scheduling problem
In this paper we address the possibility of utilizing a deductive database solution to assist a furniture company to solve its delivery scheduling problems. We first present the company's current approach to scheduling furniture deliveries using their ... Keywords: Deductive database, Furniture, Knowledge-based systems, Scheduling
Alexander P. Pons
Database Archiving: How to Keep Lots of Data for a Very Long Time, 1st edition
With the amount of data a business accumulates now doubling every 12 to 18 months, IT professionals need to know how to develop a system for archiving important database data, in a way that both satisfies regulatory requirements and is durable and secure. ... Keywords: Database Management, Information Management, Information Technology, Library & Information Science
Jack E. Olson
The paradigm for creating multi-lingual text-to-speech voice databases
Voice database is one of the most important parts in TTS systems. However, creating a high quality new TTS voice is not an easy task even for a professional team. The whole process is rather complicated and contains plenty minutiae that should be handled ... Keywords: multi-lingual, text-to-speech, voice database
Min Chu; Yong Zhao; Yining Chen; Lijuan Wang; Frank Soong
Qserv: a distributed shared-nothing database for the LSST catalog
The LSST project will provide public access to a database catalog that, in its final year, is estimated to include 26 billion stars and galaxies in dozens of trillion detections in multiple petabytes. Because we are not aware of an existing open-source ... Keywords: MPP, database, distributed, file system, parallel, shared-nothing
Daniel L. Wang; Serge M. Monkewitz; Kian-Tat Lim; Jacek Becla
A Concatenational Graph Evolution Aging Model
Modeling the long-term face aging process is of great importance for face recognition and animation, but there is a lack of sufficient long-term face aging sequences for model learning. To address this problem, we propose a CONcatenational GRaph Evolution ... Keywords: Aging,Face,Active appearance model,Correlation,Computational modeling,Data models,Muscles,ANOVA,Face aging,aging model evaluation,long-term aging,short-term aging
Jinli Suo; Xilin Chen; Shiguang Shan; Wen Gao; Qionghai Dai
Graph operations that are good for greedoids
S is a local maximum stable set of a graph G, and we write S@?@J(G), if the set S is a maximum stable set of the subgraph induced by S@?N(S), where N(S) is the neighborhood of S. In Levit and Mandrescu (2002) [5] we have proved that @J(G) is a greedoid ... Keywords: Corona, Greedoid, Local maximum stable set, Zykov sum
Vadim E. Levit; Eugen Mandrescu
On a base exchange game on graphs
We consider the following maker-breaker game on a graph G that has a partition of the edge set E into two spanning trees E1 and E2. Initially the edges of E1 are purple and the edges of E2 blue. Maker and breaker move alternately. In a move of the maker a blue edge is coloured purple. The breaker then has to recolour a different edge blue in such a way that the purple and the blue edges are spanning trees again. The goal of the maker is to exchange all colours, i.e. to make E1 blue and E2 purple. We prove that a sufficient but not necessary condition for the breaker to win is that the graph contains an induced K4. Furthermore we characterize the structure of a partition of a wheel into two spanning trees and show that the maker wins on wheels Wn with n ? 4 and provide an example of a graph where, for some partitions, the maker wins, for some others, the breaker wins.
Stephan Dominique Andres; Winfried Hochst�ttler; Markus Merkel
Materials Inventory Database for the Light Water Reactor Sustainability Program
Scientific research involves the purchasing, processing, characterization, and fabrication of many sample materials. The history of such materials can become complicated over their lifetime � materials might be cut into pieces or moved to various storage locations, for example. A database with built-in functions to track these kinds of processes facilitates well-organized research. The Material Inventory Database Accounting System (MIDAS) is an easy-to-use tracking and reference system for such items. The Light Water Reactor Sustainability Program (LWRS), which seeks to advance the long-term reliability and productivity of existing nuclear reactors in the United States through multiple research pathways, proposed MIDAS as an efficient way to organize and track all items used in its research. The database software ensures traceability of all items used in research using built-in functions which can emulate actions on tracked items � fabrication, processing, splitting, and more � by performing operations on the data. MIDAS can recover and display the complete history of any item as a simple report. To ensure the database functions suitably for the organization of research, it was developed alongside a specific experiment to test accident tolerant nuclear fuel cladding under the LWRS Advanced Light Water Reactor Nuclear Fuels Pathway. MIDAS kept track of materials used in this experiment from receipt at the laboratory through all processes, test conduct and, ultimately, post-test analysis. By the end of this process, the database proved to be right tool for this program. The database software will help LWRS more efficiently conduct research experiments, from simple characterization tests to in-reactor experiments. Furthermore, MIDAS is a universal tool that any other research team could use to organize their material inventory.
Kazi Ahmed; Shannon M. Bragg-Sitton
Coloring kk-free intersection graphs of geometric objects in the plane
The intersection graph of a collection C of sets is a graph on the vertex set C, in which C1,C2 ? C are joined by an edge if and only if C1 ? C2 ... Keywords: chromatic number, intersection graph, quasi-planar, string graph, topological graph
Jacob Fox; J�nos Pach
Graduated assignment algorithm for finding the common labelling of a set of graphs
In pattern recognition applications, it is useful to represent objects by attributed graphs considering their structural properties. Besides, some graph matching problems need a Common Labelling between vertices of a set of graphs. Computing this Common ... Keywords: graduated assignment, graph common labelling, inconsistent labelling, multiple graph matching, softassign
Albert Sol�-Ribalta; Francesc Serratosa
An extended star graph: a proposal of a new network topology and its fundamental properties
In the past years, various network architectures for parallel computers have been proposed, for example, hyper cubes or star graphs. These classes of networks are known as Cayley graphs. In recent years, there have been some proposals of new families ... Keywords: Cayley graphs, degree four Cayley graphs, diameter, hypercubes, interconnection networks, network topology, routing algorithms, star graphs
Satoru Watanabe; Satoshi Okawa
Modeling and Analysis of Time-Varying Graphs
We live in a world increasingly dominated by networks -- communications, social, information, biological etc. A central attribute of many of these networks is that they are dynamic, that is, they exhibit structural changes over time. While the practice of dynamic networks has proliferated, we lag behind in the fundamental, mathematical understanding of network dynamism. Existing research on time-varying graphs ranges from preliminary algorithmic studies (e.g., Ferreira's work on evolving graphs) to analysis of specific properties such as flooding time in dynamic random graphs. A popular model for studying dynamic graphs is a sequence of graphs arranged by increasing snapshots of time. In this paper, we study the fundamental property of reachability in a time-varying graph over time and characterize the latency with respect to two metrics, namely store-or-advance latency and cut-through latency. Instead of expected value analysis, we concentrate on characterizing the exact probability distribution of routing l...
Basu, Prithwish; Ramanathan, Ram; Johnson, Matthew P
Strict inequalities for connective constants of transitive graphs
The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective constant decreases strictly when the graph is replaced by a non-trivial quotient graph. Secondly, the connective constant increases strictly when a quasi-transitive family of new edges is added. These results have the following implications for Cayley graphs. The connective constant of a Cayley graph decreases strictly when a new relator is added to the group, and increases strictly when a non-trivial group element is declared to be a generator.
Geoffrey R. Grimmett; Zhongyang Li
Design and Implementation of a Metadata-rich File System
Despite continual improvements in the performance and reliability of large scale file systems, the management of user-defined file system metadata has changed little in the past decade. The mismatch between the size and complexity of large scale data stores and their ability to organize and query their metadata has led to a de facto standard in which raw data is stored in traditional file systems, while related, application-specific metadata is stored in relational databases. This separation of data and semantic metadata requires considerable effort to maintain consistency and can result in complex, slow, and inflexible system operation. To address these problems, we have developed the Quasar File System (QFS), a metadata-rich file system in which files, user-defined attributes, and file relationships are all first class objects. In contrast to hierarchical file systems and relational databases, QFS defines a graph data model composed of files and their relationships. QFS incorporates Quasar, an XPATH-extended query language for searching the file system. Results from our QFS prototype show the effectiveness of this approach. Compared to the de facto standard, the QFS prototype shows superior ingest performance and comparable query performance on user metadata-intensive operations and superior performance on normal file metadata operations.
Planning as Constraint Satisfaction: Solving the planning-graph by compiling it into CSP
Although the deep affinity between Graphplan's backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily used to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automatically converting Graphplan's planning graph into a CSP encoding, and solving the CSP encoding using standard CSP solvers. Our comprehensive empirical evaluation of GP-CSP demonstrates that it is superior to both standard Graphplan and Blackbox system, which compiles planning graphs into SAT encodings. Our results show that CSP encodings outperform SAT encodings in terms of both space and time requirements. The space reduction is particularly important as it makes GP-CSP less susceptible to the memory blow-up associated with SAT compilation methods. Our work is inspired by the success of van Beek & Chen's CPLAN system. However, in contrast...
Database Architecture for a Computer Network
Performance of various components of telecommunication systems and data networks need to be monitored continuously. Monitored information is presented to system operators and managers to assist them in the efficient operation and effective management of the system. Analysis of performance information can also reveal existing shortcomings and impending failures in the monitored network. The level of detail of the information presented to each group of individuals is also different. System operators are generally interested in fine grained real-time information that warns them of impending failure conditions. Alternatively, senior level managers need to view the performance information collected and summarised over several weeks depicting trends in the utilisation of the network. For an accurate historical analysis of a network's performance, performance data needs to be maintained for significantly long periods of time. User queries to the performance database may result in the retrieval and processing of large volumes of data. Furthermore, users may generate several different queries on the same dataset during the analysis process. Effective management of monitored performance data and derived information is, therefore, required to guarantee efficient and accurate analysis.
Performance Monitoring System; Omar Bashir; David Parish; Iain Phillips
Finding good nearly balanced cuts in power law graphs
The green dots in figure 8-A represent cuts that were obtained using Spectral plus Swept Hyperplane .... Fast approximate energy minimization via graph cuts.
A Graph Theory Package for Maple - CECM - Simon Fraser University
{jfarr,mahdad,skhodada,email@example.com. Abstract. We present a new graph theory package for Maple. The package is presently intended for teaching �...
New Benchmark Instances for the Steiner Problem in Graphs
Sep 26, 2001 ... New Benchmark Instances for the Steiner Problem in Graphs. Isabel Rosseti ( rosseti ***at*** inf.puc-rio.br) Marcus Poggi de Arag�o (poggi�...
GreenArrow� - A New Graph Labeling Technique - Available ...
Search PNNL. PNNL Home; About; Research; Publications; Jobs; News; Contacts; GreenArrow� - A New Graph Labeling Technique. Battelle Number(s): ...
Joint Spectral Radius and Path-Complete Graph Lyapunov Functions
Nov 22, 2011 ... Abstract: We introduce the framework of path-complete graph Lyapunov functions for approximation of the joint spectral radius. The approach is�...
Code based analysis for object-oriented systems
The basic features of object-oriented software makes it difficult to apply traditional testing methods in object-oriented systems. Control Flow Graph (CFG) is a well-known model used for identification of independent paths in procedural software. This ... Keywords: extended control flow graph, extended cyclomatic complexity, graph-based testing, object-oriented testing, test paths
Swapan Bhattacharya; Ananya Kanjilal
Life Cycle Inventory Database | Department of Energy
Commercial Buildings » Research Projects » Life Cycle Inventory Commercial Buildings » Research Projects » Life Cycle Inventory Database Life Cycle Inventory Database The U.S. Life Cycle Inventory (LCI) Database serves as a central repository for information about the total energy and resource impacts of developing and using various commercial building materials, components, and assemblies. The database helps manufacturers, building designers, and developers select energy-efficient and environmentally friendly materials, products, and processes for their projects based on the environmental impact of an item over its entire lifespan. The U.S. Department of Energy and the National Renewable Energy Laboratory (NREL) developed the database in 2003 with input from a variety of partners. NREL maintains and updates the database with support from the
Nuclear Concrete Materials Database Phase I Development
The FY 2011 accomplishments in Phase I development of the Nuclear Concrete Materials Database to support the Light Water Reactor Sustainability Program are summarized. The database has been developed using the ORNL materials database infrastructure established for the Gen IV Materials Handbook to achieve cost reduction and development efficiency. In this Phase I development, the database has been successfully designed and constructed to manage documents in the Portable Document Format generated from the Structural Materials Handbook that contains nuclear concrete materials data and related information. The completion of the Phase I database has established a solid foundation for Phase II development, in which a digital database will be designed and constructed to manage nuclear concrete materials data in various digitized formats to facilitate electronic and mathematical processing for analysis, modeling, and design applications.
Ren, Weiju [ORNL; Naus, Dan J [ORNL
Hydrologic database user`s manual
The Hydrologic Database is an electronic filing cabinet containing water-related data for the Nevada Test Site (NTS). The purpose of the database is to enhance research on hydrologic issues at the NTS by providing efficient access to information gathered by a variety of scientists. Data are often generated for specific projects and are reported to DOE in the context of specific project goals. The originators of the database recognized that much of this information has a general value that transcends project-specific requirements. Allowing researchers access to information generated by a wide variety of projects can prevent needless duplication of data-gathering efforts and can augment new data collection and interpretation. In addition, collecting this information in the database ensures that the results are not lost at the end of discrete projects as long as the database is actively maintained. This document is a guide to using the database.
Champman, J.B.; Gray, K.J.; Thompson, C.B.
Buildings Performance Database | OpenEI
Buildings Performance Database Buildings Performance Database Dataset Summary Description This is a non-proprietary subset of DOE's Buildings Performance Database. Buildings from the cities of Dayton, OH and Gainesville, FL areas are provided as an example of the data in full database. Sample data here is formatted as CSV Source Department of Energy's Buildings Performance Database Date Released July 09th, 2012 (2 years ago) Date Updated Unknown Keywords Buildings Performance Database Dayton Electricity Gainesville Natural Gas open data Residential Data application/zip icon BPD Dayton and Gainesville Residential csv files in a zip file (zip, 2.8 MiB) text/csv icon BPD Dayton and Gainesville Residential Building Characteristics data (csv, 1.4 MiB) text/csv icon BPD Dayton and Gainesville Residential data headers (csv, 5.8 KiB)
Substation Sensor Database Version 1.0
The Substation Sensor database provides utilities with a searchable list of sensors available to be applied in substation applications. The Substation Sensor Database provides a searchable database of sensors available to substation engineers, categorized by Area, Component, Sub-Component, Parameter, and Technology. By specifying each category, the list can be filtered to a sub-set of sensors. By clicking on a sensorname, details can be viewed including a description, sensor maturity, and a link to the m...
Optimal Nodal Control of Networked Hyperbolic Systems: Evaluation ...
Nov 4, 2004 ... At the nodes, the system is governed by algebraic node conditions. The system is controlled at the nodes of the graph. Optimal control�...
NIST: Electron-Impact Cross Section Database
... of molecules by electron impact. The database also includes cross sections for some atoms and energy distributions of ejected electrons for H, He ...
Biological and Environmental Research (BER) Abstracts Database...
Future (improving the ability to understand, predict, and mitigate the impacts of energy production and use on climate change). The BER Abstracts Database is publicly...
WEB RESOURCE: Central Internet Database - TMS
May 15, 2007 ... Topic Title: WEB RESOURCE: Central Internet Database Topic Summary: DOE. Integrates waste management and cleanup data from multiple�...
NIST Standard Reference Database Available for Purchase
... for their own duties, tax, and VAT. ... NIST/EPA Gas-Phase Infrared; JCAMP Format. $150. ... NIST/ThermoData Engine Database - Pure Compounds. ...
The LBNL Water Heater Retail Price Database
Lawrence Berkeley National Laboratory developed the LBNL Water Heater Price Database to compile and organize information used in the revision of U.S. energy efficiency standards for water heaters. The Database contains all major components that contribute to the consumer cost of water heaters, including basic retail prices, sales taxes, installation costs, and any associated fees. In addition, the Database provides manufacturing data on the features and design characteristics of more than 1100 different water heater models. Data contained in the Database was collected over a two-year period from 1997 to 1999.
Lekov, Alex; Glover, Julie; Lutz, Jim