Powered by Deep Web Technologies
Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


1

Accelerating semantic graph databases on commodity clusters  

SciTech Connect (OSTI)

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

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

2013-10-06T23:59:59.000Z

2

SLQ: a user-friendly graph querying system  

Science Journals Connector (OSTI)

Querying complex graph databases such as knowledge graphs is a challenging task for non-professional users. In this demo, we present SLQ, a user-friendly graph querying system enabling schemales and structures graph querying, where a user need not describe ... Keywords: graph databases, keyword query, schemaless graph querying

Shengqi Yang; Yanan Xie; Yinghui Wu; Tianyu Wu; Huan Sun; Jian Wu; Xifeng Yan

2014-06-01T23:59:59.000Z

3

Graph Processing on an "almost" Relational Database  

Science Journals Connector (OSTI)

It would be hard to disagree with the contention that graph processing (whether it be of connections between people, shopping habits,...) allows the creation of valuable data-driven products and insights. There is less consensus on the systems that make ...

Ramesh Subramonian

2014-06-01T23:59:59.000Z

4

Closed and Maximal Subgraph Mining in Internally and Externally Weighted Graph Databases  

Science Journals Connector (OSTI)

We formalize a problem of closed and maximal pattern discovery in internally and externally weighted graph databases. We introduce two weights, internal weights and external weights, which represent utility and significance of each edge in the graph, ... Keywords: subgraph mining, weighted graph, closed, maximal patterns

Tomonobu Ozaki; Minoru Etoh

2011-03-01T23:59:59.000Z

5

A graph-based system for network-vulnerability analysis  

SciTech Connect (OSTI)

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

Swiler, L.P.; Phillips, C.

1998-06-01T23:59:59.000Z

6

A graph-based network-vulnerability analysis system  

SciTech Connect (OSTI)

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

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

1998-01-01T23:59:59.000Z

7

A graph-based network-vulnerability analysis system  

SciTech Connect (OSTI)

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

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

1998-05-03T23:59:59.000Z

8

6.830 Database Systems, Fall 2005  

E-Print Network [OSTI]

This course relies on primary readings from the database community to introduce graduate students to the foundations of database systems, focusing on basics such as the relational algebra and data model, schema normalization, ...

Madden, Samuel

9

The Web Graph of a Tourism System  

E-Print Network [OSTI]

The website network of a tourism destination is examined. The main statistical characteristics of the underlying graph are calculated. The topology of the network is similar to the one characterizing similar systems. However, some differences are found, mainly due to the relatively poor connectivity among the vertices of the network.

Baggio, R

2006-01-01T23:59:59.000Z

10

6.893 Database Systems, Fall 2004  

E-Print Network [OSTI]

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

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

11

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

E-Print Network [OSTI]

(virtual) representations of the database history, (b) XQuery to express powerful temporal queriesUsing XML to Build Efficient Transaction-Time Temporal Database Systems on Relational Databases the ArchIS system that achieves full-functionality transaction-time databases without re- quiring temporal

Zaniolo, Carlo

12

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

E-Print Network [OSTI]

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

Heller, Barbara

13

Technology Portfolio Planning by Weighted Graph Analysis of System Architectures  

E-Print Network [OSTI]

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

de Weck, Olivier L.

14

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

E-Print Network [OSTI]

Overall Structure History of Database Systems #12;©Silberschatz, Korth and Sudarshan1.3Database SystemDatabase System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See www, Korth and Sudarshan1.2Database System Concepts - 5th Edition, May 23, 2005 Chapter 1: Introduction

Dragan, Feodor F.

15

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

SciTech Connect (OSTI)

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

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

1994-03-01T23:59:59.000Z

16

WORKLOAD ADAPTATION IN AUTONOMIC DATABASE MANAGEMENT SYSTEMS  

E-Print Network [OSTI]

in Autonomic DBMSs", Proceedings of the 2nd International Workshop on Self-Managing Database Systems (SMDB 2007 to meet its Service Level Objectives (SLOs). It is a challenge to adapt multiple workloads with complex scheduler that performs workload adaptation in a DBMS, as the test bed to prove the effectiveness

17

Performance Modeling and Access Methods for Temporal Database Management Systems  

E-Print Network [OSTI]

implementation issues. Database systems with temporal support maintain history data on line together with current. Performance Modeling and Access Methods for Temporal Database Management Systems TR86-018 August. #12;Performance Modeling and Access Methods for Temporal Database Management Systems by Ilsoo Ahn

North Carolina at Chapel Hill, University of

18

Databases  

K-12 Energy Lesson Plans and Activities Web site (EERE)

This page contains several databases that provide comprehensive information to expand your biomass knowledge. Use the descriptions and links provided to access the database that best meets your...

19

Conference and Journal Publications in Database Systems and Theory  

E-Print Network [OSTI]

Conference and Journal Publications in Database Systems and Theory This document rates the conferences and journal publications in the database area with respect to quality and impact. As in many other systems and the database theory areas. A key issue we address is the relative importance of conference

Zhou, Yuanyuan

20

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

E-Print Network [OSTI]

database history. The evaluation algorithm is also an add­on component, executed on top of, and usingTemporal Conditions and Integrity Constraints in Active Database Systems \\Lambda A. Prasad Sistla, for specifying conditions and events in the rules for active database sys­ tem. This language permits

Wolfson, Ouri E.

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


21

TWRS information locator database system administrator`s manual  

SciTech Connect (OSTI)

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

Knutson, B.J., Westinghouse Hanford

1996-09-13T23:59:59.000Z

22

Integrating XML and Relational Database Systems  

Science Journals Connector (OSTI)

Relational databases get more and more employed in order to store the content of a web site. At the same time, XML is fast emerging as the dominant standard at the hypertext level of web site management descri...

Gerti Kappel; Elisabeth Kapsammer; Werner Retschitzegger

2004-12-01T23:59:59.000Z

23

Database System Concepts Silberschatz, Korth and Sudarshan  

E-Print Network [OSTI]

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

Dragan, Feodor F.

24

DOE technology information management system database study report  

SciTech Connect (OSTI)

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.

1994-11-01T23:59:59.000Z

25

Detecting and Tolerating Byzantine Faults in Database Systems  

E-Print Network [OSTI]

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

Vandiver, Benjamin Mead

2008-06-30T23:59:59.000Z

26

Detecting and tolerating Byzantine faults in database systems  

E-Print Network [OSTI]

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

Vandiver, Benjamin Mead, 1978-

2008-01-01T23:59:59.000Z

27

Towards a Query-by-Example System for Knowledge Graphs  

Science Journals Connector (OSTI)

We witness an unprecedented proliferation of knowledge graphs that record millions of heterogeneous entities and their diverse relationships. While knowledge graphs are structure-flexible and content-rich, it is difficult to query them. The challenge ...

Nandish Jayaram; Arijit Khan; Chengkai Li; Xifeng Yan; Ramez Elmasri

2014-06-01T23:59:59.000Z

28

Development of a coal combustion product (CCP) database system. Final report  

SciTech Connect (OSTI)

Nearly 90 million tons of coal combustion products (CCPs) are produced annually in the United States. The value of CCPs is well established by research and commercial practice; however, only 25% of these products are utilized. The objective of this project was to develop a computer program containing a database of advanced analytical and comprehensive engineering information on CCPs, accessible through a user-friendly interface. Version 1.0 of the ACAA CCP Data Manager was specifically designed to: perform multiple-criteria queries to produce a set of sample for in-depth study; view and print standard test reports, such as C618 reports; compare and contrast analytical results in graphs and tables; graph utilization information by application and region; and save data to a file for use in other computer applications, such as spreadsheet programs. The program was designed to contain descriptive information about a given CCP sample, including sample formation data (material type, sample location, fuel type, collection device etc.), combustion system design data (steam generator type, furnace type, SO{sub 2} and NO{sub x} control information, ash-handling configurations), test data (chemical, mineralogical, and physical characterization data), and utilization potential of the CCP. The location of the plant is identified by region. The database has been initially populated with information on over 800 CCP samples, taken from the Coal Ash Resources Research Consortium (CARRC). An installation package and user`s guide was developed for unlimited distribution by the American Coal Ash Association (ACAA).

O`Leary, E.M.; Pflughoeft-Hassett, D.F.

1997-09-01T23:59:59.000Z

29

A Database Management System for the Federal Courts  

E-Print Network [OSTI]

A Database Management System for the Federal Courts JACK R. BUCHANAN, RICHARD D. FENNELL Federal Making Information Systems, Inc., McLean, VA 22101; R. D. Fennell, Federal Judicial Center, Washington, D and several large-scale information management systems projects have been undertaken within the Federal

Samet, Hanan

30

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

31

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

E-Print Network [OSTI]

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

Li, Zaichun

2012-06-07T23:59:59.000Z

32

Intrusion Detection in Realtime Database Systems Via Time Signatures*  

E-Print Network [OSTI]

as ``normal'' transactions, and compare the ability of different numerically quantifiable measures to capture. Introduction In a real­time database system, transactions often have timing constraints. Transactions must meet their timing constraints, often expressed as deadlines, in order to be correct and useful. In stock market

Son, Sang H.

33

Managing MEDLINE: A Comparison of a Native XML Database System with a Relational Database System  

E-Print Network [OSTI]

. The DTD (Document Type Definition) defines the integral structure of the XML document. It describes querying the database online, and in an effort to control load on the servers, NLM limits the number offers researchers to overcome the limitations of the query options offered by NLM's web interface

Madiraju, Praveen

34

Concept generation of dynamic systems using bond graphs  

E-Print Network [OSTI]

REPRESENTATIONS OF IMMITTANCES . . . Immittance synthesis in design Conventional immit tance synthesis techniques by Foster and Cauer Immittance synthesis with bond graphs . . . . . . . . . . . . . Example - Synthesis of two frequency absorber... . . . . . . . . . 35 . 35 . 38 . . . . . . 40 . . . . . . 49 TABLE OF CONTENTS (Continued) CHAPTER Page V PHYSICAL REPRESENTATIONS OF TRANSFER FUNCTIONS Transfer function synthesis in design . . . . . . . . . . . General procedure Conditions for passive...

Krishnan, S

1990-01-01T23:59:59.000Z

35

Security of graph data: hashing schemes and definitions  

Science Journals Connector (OSTI)

Use of graph-structured data models is on the rise - in graph databases, in representing biological and healthcare data as well as geographical data. In order to secure graph-structured data, and develop cryptographically secure schemes for graph databases, ... Keywords: graphs, hash functions, integrity, perfectly secure hash functions, privacy

Muhammad U. Arshad, Ashish Kundu, Elisa Bertino, Krishna Madhavan, Arif Ghafoor

2014-03-01T23:59:59.000Z

36

From the LHC Reference Database to the Powering Interlock System  

E-Print Network [OSTI]

The protection of the magnet powering system for the Large Hadron Collider (LHC) currently being built at CERN is a major challenge due to the unprecedented complexity of the accelerator. The Powering Interlock System of the LHC will have to manage more than 1600 DC circuits for magnet powering, different in their structure, complexity and importance to the accelerator. For the coherent description of such complex system, a Reference Database as unique source of the parameters of the electrical circuits has been developed. The information, introduced via a generic circuit description language, is first used for installing the accelerator and making all electrical connections. The data is then used for tests and commissioning. During operation, the Powering Interlock System manages all critical functions. It consists of 36 PLC based controllers dis tributed around the machine and requires a flexible and transparent way of configuration, since each controller manages different numbers and types of electrical ci...

Dehavay, C; Schmidt, R; Veyrunes, E; Zerlauth, M

2003-01-01T23:59:59.000Z

37

MDB: a database system utilizing automatic construction of modules and STAR-derived universal language  

Science Journals Connector (OSTI)

......bioinformatics database that combines several innovative characteristics. MDB CONCEPT MDB has several key features. It is designed...mmcif/. The MDB database is currently accessible on GSK Intranet. The system is undergoing testing; data loading and processing......

Eugenia Migliavacca; Alexei A. Adzhubei; Manuel C. Peitsch

2001-11-01T23:59:59.000Z

38

Generic Natural Systems Evaluation - Thermodynamic Database Development and Data Management  

SciTech Connect (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

2011-09-19T23:59:59.000Z

39

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

E-Print Network [OSTI]

Bond Graph Modeling of Centrifugal Compressor System Nur Uddin and Jan Tommy Gravdahl Dept, Norway N-7491 nur.uddin@itk.ntnu.no, Jan.Tommy.Gravdahl@itk.ntnu.no Keywords: Compressor, compressor surge, surge avoidance system, active surge control. Abstract A novel method of modeling centrifugal

Gravdahl, Jan Tommy

40

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

E-Print Network [OSTI]

Systemic risk in energy derivative markets: a graph-theory analysis Delphine Lautier 1,2 and Franck condition for systemic risk to appear, this article focuses on integration in energy derivative markets, and that energy markets are becoming more and more integrated. Financial support of the French Energy Council

Paris-Sud XI, Université de

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


41

Fear and desire in systems design : negotiating database usefulness  

E-Print Network [OSTI]

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

2008-01-01T23:59:59.000Z

42

MARKIS: The Dutch marine database and its quality control system J. B. Wijngaard  

E-Print Network [OSTI]

2006 #12;1 Contents Introduction 3 History 4 To a relational database 5 MARKIS database 6 QualityMARKIS: The Dutch marine database and its quality control system J. B. Wijngaard De Bilt, February a long history of collecting and archiving marine data. In 1854 Dutch merchant ships started to transfer

Stoffelen, Ad

43

Gasification Plant Databases  

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

Gasification Plant Databases News Gasifipedia Gasifier Optimization Feed Systems Syngas Processing Systems Analyses Gasification Plant Databases International Activity Program Plan...

44

NATional CARBon Sequestration Database and Geographic Information System (NATCARB)  

SciTech Connect (OSTI)

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

Timothy R. Carr

2006-01-09T23:59:59.000Z

45

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

E-Print Network [OSTI]

, allow free composition, and are efficient for classification and analysis of models, allowing rapidAutomated Design Methodology for Mechatronic Systems Using Bond Graphs and Genetic Programming University, zhangbai@egr.msu.edu Abstract This paper suggests an automated design methodology

Fernandez, Thomas

46

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

E-Print Network [OSTI]

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

Kocur, George

47

Wizard: A Database Inference Analysis And Detection System  

E-Print Network [OSTI]

Abstract| The database inference problem is a well-known prob- lem in database security and information determine inference problems within sin- gle facets as well as some inference problems between two or more Science Department of the University of Alabama in Huntsville, Huntsville, AL 35899 U.S.A. (e

Delugach, Harry S.

48

Using Virtual Organizations Membership System with EDG's Grid Security and Database Access  

E-Print Network [OSTI]

Using Virtual Organizations Membership System with EDG's Grid Security and Database Access Marko University of Technology March 17, 2004 Keywords: Grid security, virtual organizations, Grid use case. This paper describes the European Data Grid's (EDG's) java security system and Spitfire database access

Haak, Hein

49

Tradespace exploration for space system architectures : a weighted graph framework  

E-Print Network [OSTI]

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

Davison, Peter Leslie

2014-01-01T23:59:59.000Z

50

Time-lag of record inputs to the international nuclear information system bibliographic database  

Science Journals Connector (OSTI)

This paper discusses the timeliness in inputting bibliographical records to international databases with a case study of the international nuclear information system bibliographic database from the inception (1970) to the year 2008. The authors have attempted to calculate the overall and average inputting time-lag of the database. The time-lags of inputting countries and international organisations are analysed separately. The study also tries to identify the nature of inputs that are responsible for this delayed response.

E.R. Prakasan; Nita Bhaskar; K. Bhanumurthy

2011-01-01T23:59:59.000Z

51

DBMiner: a system for data mining in relational databases and data warehouses  

Science Journals Connector (OSTI)

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

1997-11-01T23:59:59.000Z

52

Bond graph models of electromechanical systems. The AC generator case  

E-Print Network [OSTI]

. After reviewing electromechanical energy conversion and torque gener- ation, the core element present in any electromechanical system is introduced, and the corresponding electrical and mechanical ports are attached to it. No modulated elements are necessary, since the energy representation

Batlle, Carles

53

Graph Algorithms Tours in Graphs  

E-Print Network [OSTI]

terminates only at y. Graph Algorithms 14 #12;Combining the Main and the Secondary Cycles Let C = (x a secondary cycle C starting with y. - Combine the cycles C and C into C. Return the cycle C. Graph AlgorithGraph Algorithms Tours in Graphs Graph Algorithms #12;Special Paths and Cycles in Graphs Euler Path

Bar-Noy, Amotz

54

X-ray: towards integrating XML and relational database systems  

Science Journals Connector (OSTI)

Relational databases get more and more employed in order to store the content of a web site. At the same time, XML is fast emerging as the dominant standard at the hypertext level of web site management describing pages and links between them. Thus, ...

Gerti Kappel; Elisabeth Kapsammer; Stefan Rausch-Schott; Werner Retschitzegger

2000-10-01T23:59:59.000Z

55

CS 4750-001 Database Systems -Spring 2012 ENGR (17672)  

E-Print Network [OSTI]

of 12 The information in this document is private and confidential. Please handle accordingly. #12;CS-R diagrams. DB Security - it was well layed out, easy to follow, and effective. How to build a server the material sql - very relevant subject matter & will def be used in the future Distributed Databases

Sherriff, Mark S.

56

Asynchronous data change notification between database server and accelerator controls system  

SciTech Connect (OSTI)

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.

2011-10-10T23:59:59.000Z

57

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

E-Print Network [OSTI]

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

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

2006-01-01T23:59:59.000Z

58

Integration of a Relational Database in the CERN PS Control System  

E-Print Network [OSTI]

The control system for the CERN 26 GEV Proton Synchrotron and its injectors is a generic system which can be adapted to other accelerators. Most configuration data are in a relational database. From these data we can generate object interfaces for equipment, configuration files for front-end computers, a read-only database for accelerator control interfacing, and full dynamic documentation on the Web. The database is also used in real time for runtime references and archives, and for the working data of several programs.

Cuprus, J

1997-01-01T23:59:59.000Z

59

Quantity comparison of concurrency control methods for XML database systems based on DOM API  

Science Journals Connector (OSTI)

Existing works on processing of eXtensible Markup Language (XML) documents have been concentrated on query optimisation, storage problems, documents transformation, compressing methods and normalisation. There are only few papers on concurrency control in accessing and modifying XML documents, which are stored in XML database systems. The aim of this paper is to analyse and compare the quantity of concurrency control methods for XML database systems based on DOM API.

Krzysztof Jankiewicz; Aleksandra Siekierska; Maciej Siekierski

2008-01-01T23:59:59.000Z

60

A combined graph theory and analytic hierarchy process approach for multicriteria evaluation of hydrogen energy systems  

Science Journals Connector (OSTI)

Hydrogen is a renewable energy source and has the potential to mitigate the green house gas effect and to meet the increasing global electricity demand. In the present study, a multicriteria methodology is developed by combining graph theory and analytic hierarchy process methods for the evaluation and selection of hydrogen energy systems. The hydrogen energy system alternatives are assessed with respect to economic, environmental, performance and social criteria by computing the hydrogen energy system preference index. A detailed procedure for determination of hydrogen energy system preference index is suggested. Two examples relating to hydrogen production processes and hydrogen energy technologies are cited in order to demonstrate and validate the effectiveness and flexibility of the proposed methodology. In each example, a list of all possible choices from the best to the worst alternatives is obtained taking into account different evaluation criteria.

Pramod B. Lanjewar; R.V. Rao; A.V. Kale

2014-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


61

Instrument Failures for the da Vinci Surgical System: a Food and Drug Administration MAUDE Database Study  

E-Print Network [OSTI]

reports. The majority of failures (285) were of the instrument's wrist or tool tip. Cautery problemsInstrument Failures for the da Vinci Surgical System: a Food and Drug Administration MAUDE Database Background Our goal was to analyze reported instances of the da Vinci robotic surgical system instrument

62

A Database-driven decision support system: customized mortality prediction  

E-Print Network [OSTI]

We hypothesize that local customized modeling will provide more accurate mortality prediction than the current standard approach using existing scoring systems. Mortality prediction models were developed for two subsets ...

Celi, Leo Anthony G.

63

Managing Threats to Web Databases and Cyber Systems  

Science Journals Connector (OSTI)

This chapter provides an overview of some of the cyber threats information systems as well as data management ... then discusses potential solutions and challenges. The threats include access control violations, ...

Bhavani Thuraisingham

2005-01-01T23:59:59.000Z

64

Toward an Automated Design Method for Multi-Domain Dynamic Systems Using Bond Graphs and Genetic Programming  

E-Print Network [OSTI]

of models, permitting rapid determination of various types of acceptability or feasibility of candidate1 Toward an Automated Design Method for Multi-Domain Dynamic Systems Using Bond Graphs and Genetic Abstract This paper describes a unified and automated design method for synthesizing designs for multi

Hu, Jianjun

65

Second Annual Conference on Advances in Cognitive Systems Poster Collection (2013) 217-234 Inference Graphs: A Roadmap  

E-Print Network [OSTI]

-234 Inference Graphs: A Roadmap Daniel R. Schlegel DRSCHLEG@BUFFALO.EDU Stuart C. Shapiro SHAPIRO GLAIR (Shapiro & Bona, 2010) and MGLAIR (Bona, 2013), which use the SNePS 2 KRR system (Shapiro perform natural deduction inference using forward, backward, bi-directional (Shapiro, Martins, & Mc

Shapiro, Stuart C.

66

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

SciTech Connect (OSTI)

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

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

2007-01-01T23:59:59.000Z

67

Extending a Deductive ObjectOriented Database System with Spatial Data Handling Facilities  

E-Print Network [OSTI]

Extending a Deductive Object­Oriented Database System with Spatial Data Handling Facilities Alvaro, 1998 Abstract This paper describes the integration of a spatial data handling component with the ROCK collection of spatial data types as primitive types whose operations have state­of­the­art computational

Fernandes, Alvaro A. A.

68

Fundamenta Informaticae XX (2004) 118 1 A New Rough Sets Model Based on Database Systems  

E-Print Network [OSTI]

Fundamenta Informaticae XX (2004) 1­18 1 IOS Press A New Rough Sets Model Based on Database Systems, USA jhan@csudh.edu Abstract. Rough sets theory was proposed by Pawlak in the 1980s and has been applied success- fully in a lot of domains. One of the major limitations of the traditional rough sets

Lin, Tsau Young

69

Addison Wesley Longman, Inc. 2000, Elmasri/Navathe, Fundamentals of Database Systems, Third Edition FName MInit LName  

E-Print Network [OSTI]

/Navathe, Fundamentals of Database Systems, Third Edition FName Name LNameMInit BDate FOfficeSalary SsnSex Rank FPhone© Addison Wesley Longman, Inc. 2000, Elmasri/Navathe, Fundamentals of Database Systems, Third_EMPLOYEE SALARIED_EMPLOYEE TRADE_UNIONPROJECT MANAGES BELONGS_TO PayScale Salary EngTypeTGradeTypingSpeed d Three

Chen, Yangjun

70

GrIDS A GRAPH BASED INTRUSION DETECTION SYSTEM FOR LARGE NETWORKS  

E-Print Network [OSTI]

or groups of hosts. By analyzing the characteristics of the activity graphs, GrIDS detects and reports under contract DOD DABT 63-93-C-0045. intra-networks intranets to share and disseminate internal

California at Davis, University of

71

Buildings Performance Database Analysis Tools | Department of Energy  

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

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

72

An integrated medical image database and retrieval system using a web application server  

Science Journals Connector (OSTI)

We developed an Integrated Medical Image Database and Retrieval System (INIS) for easy access by medical staff. The INIS mainly consisted of four parts: specific servers to save medical images from multi-vendor modalities of CT, MRI, CR, ECG and endoscopy; an integrated image database (DB) server to save various kinds of images in a DICOM format; a Web application server to connect clients to the integrated image DB and the Web browser terminals connected to an HIS system. The INIS provided a common screen design to retrieve CT, MRI, CR, endoscopic and ECG images, and radiological reports, which would allow doctors to retrieve radiological images and corresponding reports, or ECG images of a patient simultaneously on a screen. Doctors working in internal medicine on average accessed information 492 times a month. Doctors working in cardiological and gastroenterological accessed information 308 times a month. Using the INIS, medical staff could browse all or parts of a patient's medical images and reports.

Pengyu Cao; Masao Hashiba; Kouhei Akazawa; Tomoko Yamakawa; Takayuki Matsuto

2003-01-01T23:59:59.000Z

73

Applications of interest : a relational database approach to managing control system software applications.  

SciTech Connect (OSTI)

Large accelerator facilities such as the Advanced Photon Source (APS) typically are operated by a diverse set of integrated control systems, such as front-end controllers, PLCs, and FPGAs. This type of control system structure encompasses numerous engineering documents, distributed real-time control system databases, source code, user displays, and other components. The complexity of the control system is further increased as the life cycle of a control system is never ending, change is constant. And the accelerator itself generates new operational problems on a regular basis. This overall controls environment begs the question of how best to provide a means for control system engineers to easily and quickly troubleshoot unique functions of the control system, find relevant information, and understand the impact of changes to one part of the control system on other applications. The answer to this question lies in being able to associate pertinent drawings, manuals, source code, hardware, and expert developers in an efficient and logical manner. Applications of Interest is a relational database software tool created for the purpose of providing alternative views of the supporting information behind each distinct control system application at the APS.

Quock, D. B.; Arnold, N.; Dohan, D.; Anderson, J.; Clemons, D. (APS Engineering Support Division)

2008-04-14T23:59:59.000Z

74

Framework for database and modelbase in an Information based Simulation system  

E-Print Network [OSTI]

in the building of this database, (3) It applies these methodologies to the Manufacturing arena and for creating simulation constructs and tests them with various examples, (4) It explores the area of modelbase and presents I'ramework for the modelbase... systems in which numerous techniques and modern computing methodologies are being tested for the creation of an integrated simulation environment. The present research work is motivated by the advancements made in the area of information based...

Ghoshal, Debashis

2012-06-07T23:59:59.000Z

75

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

E-Print Network [OSTI]

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

76

Translation of Graph-based Knowledge Representation in Multi-agent System  

Science Journals Connector (OSTI)

Abstract Agents provide a feasible mean for maintaining and manipulating large scale data. This paper deals with the problem of information exchange between different agents. It uses graph based formalism for the representation of knowledge maintained by an agent and graph transformations as a mean of knowledge exchange. Such a rigorous formalism ensures the cohesion of graph-based knowledge held by agents after each modification and exchange action. The approach presented in this paper is illustrated by a case study dealing with the problem of personal data held in different places (maintained by different agents) and the process of transmitting such information.11 Financial support for this study was provided from resources of National Center for Research and Development, the grant number \\{NCBiR\\} 0021/R/ID2/2011/01.

Leszek Kotulski; Adam S?dziwy; Barbara Strug

2014-01-01T23:59:59.000Z

77

Hazard Analysis Database report  

SciTech Connect (OSTI)

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

Niemi, B.J.

1997-08-12T23:59:59.000Z

78

On the degree distribution of horizontal visibility graphs associated to Markov processes and dynamical systems: diagrammatic and variational approaches  

E-Print Network [OSTI]

Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical data analysis and signal processing and (ii) characterising classes of dynamical systems and stochastic processes using the tools of graph theory. Recent works show that the degree distribution of these graphs encapsulates much information on the signals variability, and therefore constitutes a fundamental feature for statistical learning purposes. However, exact solutions for the degree distributions are only known in a few cases, such as for uncorrelated random processes. Here we analytically explore these distributions in a list of situations. We present a diagrammatic formalism which computes for all degrees their corresponding probability as a series expansion in a coupling constant which is the number of hidden variables. We offer a constructive solution for general Markovian stochastic processes and deterministic maps. As case tests we focus on Ornstein-Uhlenbeck processes, fully chaotic and quasiperiodic maps. Whereas only for certain degree probabilities can all diagrams be summed exactly, in the general case we show that the perturbation theory converges. In a second part, we make use of a variational technique to predict the complete degree distribution for special classes of Markovian dynamics with fast-decaying correlations. In every case we compare the theory with numerical experiments.

Lucas Lacasa

2014-02-21T23:59:59.000Z

79

Sequoia supercomputer tops Graph 500 | National Nuclear Security...  

National Nuclear Security Administration (NNSA)

on Graph 500 and new techniques for solving large graph problems on small high performance computing (HPC) systems, all the way down to a single server. Lawrence Livermore's...

80

Introduction to Physical Systems Modelling with Bond Graphs Jan F. Broenink  

E-Print Network [OSTI]

on energy and energy exchange. Analogies between domains are more than just equations being analogous and directed graphs, in which the vertices represent submodels and the edges represent an ideal energy connection between power ports. The vertices are idealised descriptions of physical phenomena

Batlle, Carles

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


81

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

SciTech Connect (OSTI)

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.

2010-08-01T23:59:59.000Z

82

Database Help  

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

Database Help Database Help LANL researchers can access most subscription databases from offsite via Remote Access. Question? 667-5809 Email How do I get full text? Some databases...

83

API Requirements for Dynamic Graph Prediction  

SciTech Connect (OSTI)

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

2006-10-13T23:59:59.000Z

84

Algorithms and architectures for high performance analysis of semantic graphs.  

SciTech Connect (OSTI)

Semantic graphs offer one promising avenue for intelligence analysis in homeland security. They provide a mechanism for describing a wide variety of relationships between entities of potential interest. The vertices are nouns of various types, e.g. people, organizations, events, etc. Edges in the graph represent different types of relationships between entities, e.g. 'is friends with', 'belongs-to', etc. Semantic graphs offer a number of potential advantages as a knowledge representation system. They allow information of different kinds, and collected in differing ways, to be combined in a seamless manner. A semantic graph is a very compressed representation of some of relationship information. It has been reported that the semantic graph can be two orders of magnitude smaller than the processed intelligence data. This allows for much larger portions of the data universe to be resident in computer memory. Many intelligence queries that are relevant to the terrorist threat are naturally expressed in the language of semantic graphs. One example is the search for 'interesting' relationships between two individuals or between an individual and an event, which can be phrased as a search for short paths in the graph. Another example is the search for an analyst-specified threat pattern, which can be cast as an instance of subgraph isomorphism. It is important to note than many kinds of analysis are not relationship based, so these are not good candidates for semantic graphs. Thus, a semantic graph should always be used in conjunction with traditional knowledge representation and interface methods. Operations that involve looking for chains of relationships (e.g. friend of a friend) are not efficiently executable in a traditional relational database. However, the semantic graph can be thought of as a pre-join of the database, and it is ideally suited for these kinds of operations. Researchers at Sandia National Laboratories are working to facilitate semantic graph analysis. Since intelligence datasets can be extremely large, the focus of this work is on the use of parallel computers. We have been working to develop scalable parallel algorithms that will be at the core of a semantic graph analysis infrastructure. Our work has involved two different thrusts, corresponding to two different computer architectures. The first architecture of interest is distributed memory, message passing computers. These machines are ubiquitous and affordable, but they are challenging targets for graph algorithms. Much of our distributed-memory work to date has been collaborative with researchers at Lawrence Livermore National Laboratory and has focused on finding short paths on distributed memory parallel machines. Our implementation on 32K processors of BlueGene/Light finds shortest paths between two specified vertices in just over a second for random graphs with 4 billion vertices.

Hendrickson, Bruce Alan

2005-09-01T23:59:59.000Z

85

Design plan for development of the worldwide port system (WPS) regional integrated cargo database (ICDB)  

SciTech Connect (OSTI)

The Worldwide Port System (WPS) Regional Integrated Cargo Database (ICDB) is a major military computer system that provides visibility over international cargo. Development started in early 1993 and implementation began on the West Coast in August of 1995. The Design Plan coordinated developmental efforts for the ICDB and its related processes. A Design Plan was especially important because the ICDB was developed at multiple sites by Oak Ridge National Laboratory and Military Traffic Management Command personnel. A Design Plan was essential to ensure that a consistent design was maintained throughout all modules, that functional and technical requirements were accomplished, that all components and processes worked together successfully, and that the development schedule was met. This plan described ICDB modules and tasks within each module. It documented responsibilities and dependencies by module and presented a schedule for development, testing, and integration.

Truett, L.F.; Rollow, J.P.; Shipe, P.C.

1995-11-01T23:59:59.000Z

86

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

SciTech Connect (OSTI)

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)

2009-05-01T23:59:59.000Z

87

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

SciTech Connect (OSTI)

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

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

2013-07-01T23:59:59.000Z

88

Sustainability analysis of complex dynamic systems using embodied energy flows: The eco-bond graphs modeling and simulation framework  

Science Journals Connector (OSTI)

Abstract This article presents a general methodology for modeling complex dynamic systems focusing on sustainability properties that emerge from tracking energy flows. We adopt the embodied energy (emergy) concept that traces all energy transformations required for running a process. Thus, energy at any process within a system is studied in terms of all the energy previously invested to support it (up to the primary sources) and therefore sustainability can be analyzed structurally. These ideas were implemented in the bond graph framework, a modeling paradigm where physical variables are explicitly checked for adherence to energy conservation principles. The results are a novel Ecological Bond Graphs (EcoBG) modeling paradigm and the new EcoBondLib library, a set of practical ready-to-use graphical models based on EcoBG principles and developed under the Modelica model encoding standard. EcoBG represents general systems in a three-faceted fashion, describing dynamics at their mass, energy, and emergy facets. EcoBG offers a scalable graphical formalism for the description of emergy dynamic equations, resolving some mathematical difficulties inherited from the original formulation of the equations. The core elements of EcoBG offer a soundly organized mathematical skeleton upon which new custom variables and indexes can be built to extend the modeling power. This can be done safely, without compromising the correctness of the core energy balance calculations. As an example we show how to implement a custom sustainability index at local submodels, for detecting unsustainable phases that are not automatically discovered when using the emergy technique alone. The fact that we implemented EcoBondLib relying on the Modelica technology opens up powerful possibilities for studying sustainability of systems with interactions between natural and industrial processes. Modelica counts on a vast and reusable knowledge base of industrial-strength models and tools in engineering applications, developed by the Modelica community throughout decades.

Rodrigo D. Castro; Franois E. Cellier; Andreas Fischlin

2014-01-01T23:59:59.000Z

89

Graph Algorithms Special Sets in Graphs  

E-Print Network [OSTI]

{u e}. Graph Algorithms 8 #12;Example: A Vertex Cover Set Graph Algorithms 9 #12;Example: A Minimum Size Vertex Cover Set Graph Algorithms 10 #12;A Clique A set of vertices for which all possible edges * * * * * Graph Algorithms 20 #12;Independent Sets and Vertex Cover Sets Observation: I is an independent set

Bar-Noy, Amotz

90

BAG: a graph theoretic sequence clustering algorithm  

Science Journals Connector (OSTI)

In this paper, we first discuss issues in clustering biological sequences with graph properties, which inspired the design of our sequence clustering algorithm BAG. BAG recursively utilises several graph properties: biconnectedness, articulation points, pquasi-completeness, and domain knowledge specific to biological sequence clustering. To reduce the fragmentation issue, we have developed a new metric called cluster utility to guide cluster splitting. Clusters are then merged back with less stringent constraints. Experiments with the entire COG database and other sequence databases show that BAG can cluster a large number of sequences accurately while keeping the number of fragmented clusters significantly low.

Sun Kim; Jason Lee

2006-01-01T23:59:59.000Z

91

Chesapeake Bay Program Water Quality Database | Data.gov  

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

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.

92

SQBC: An efficient subgraph matching method over large and dense graphs  

Science Journals Connector (OSTI)

Recent progress in biology and computer science have generated many complicated networks, most of which can be modeled as large and dense graphs. Developing effective and efficient subgraph match methods over these graphs is urgent, meaningful and necessary. ... Keywords: Algorithm, Database, Graph theory, Index strategy, Large network, Subgraph isomorphism

Weiguo Zheng; Lei Zou; Xiang Lian; Huaming Zhang; Wei Wang; Dongyan Zhao

2014-03-01T23:59:59.000Z

93

Using graph theory to resolve state estimator issues faced by deregulated power systems  

E-Print Network [OSTI]

.................................. 75 5.3 The global semantic dictionary for the SKW.................................... 77 5.4 The SKW with ontology connection knowledge .............................. 79 5.5 System entity relationships in a typical power market... centers and logistics departments. Information integration for such a system has become very challenging [49-55]. Common Information Model (CIM) is utilized for data exchange [53]. How to transform the legacy Energy Management System (EMS) system...

Lei, Jiansheng

2009-05-15T23:59:59.000Z

94

Information Solutions: Database Applications  

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

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.

95

On dynamic scheduling of a parallel server system with certain graph structure  

E-Print Network [OSTI]

Primitives 2.3 Scheduling Control . Chapter 3 Sequence ofto be mutually independent. Scheduling Control The system isand service rates and scheduling control are allowed to vary

Pesic, Vladimir N.

2011-01-01T23:59:59.000Z

96

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

E-Print Network [OSTI]

Petropoulos2 , Hung Q. Ngo2 , and Shambhu Upadhyaya2 1 Information Security, Amazon.com Inc., Seattle WA 98104, USA, smathew@amazon.com, 2 Computer Science and Engineering, University at Buffalo, Buffalo NY 14260, USA, (mpertropo, hungngo, shambhu)@buffalo.edu Abstract. The insider threat against database

Ngo, Hung Q.

97

An Integrated Multi-task Inductive Database and Decision Support System VINLEN: An Initial  

E-Print Network [OSTI]

, jwojt}@mli.gmu.edu Abstract. A brief review of the current research on VINLEN multitask induc- tive lifestyles and diseases in men. The conclusion outlines plans for future research. 1 Introduction This paper briefly reviews our current research on the development of VINLEN, a multitask inductive database

Michalski, Ryszard S.

98

A multimedia database supporting a generic computer based quality management system  

E-Print Network [OSTI]

. However, some projects in developing local, or internal "web application" ("Intranets") have already technology. Database characteristics and problems involved with this novel kind of application development to be developed [4,5,6,34,35,36]. These services should support internal characteristics of the organizations

da Silva, Alberto Rodrigues

99

Attributes for Causal Inference in Electronic Healthcare Databases Jenna Reps, Jonathan M. Garibaldi,  

E-Print Network [OSTI]

Attributes for Causal Inference in Electronic Healthcare Databases Jenna Reps, Jonathan M Spontaneous Reporting System (SRS) databases and Electronic Healthcare Databases (EHDs) are the databases

Aickelin, Uwe

100

Graph Algorithms Edge Coloring  

E-Print Network [OSTI]

: Perfect Matching Graph Algorithms 6 #12;Edge Covering An edge covering, EC E, is a set of edges #12;Example: Edge Covering Graph Algorithms 8 #12;Example: Minimal Edge Covering Graph Algorithms 9 #12;Example: Minimum Size Edge Covering Graph Algorithms 10 #12;Matching and Edge Covering Definition

Bar-Noy, Amotz

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


101

Graph Algorithms Robert Elsasser  

E-Print Network [OSTI]

-regular bipartite graph has a perfect matching. Definition 3: A vertex cover of a graph G = (V, E) is a set Q VGraph Algorithms Robert Els¨asser 10 November 2011 Program of the day: · Matchings in bipartite graphs Robert Els¨asser Universit¨at Paderborn Graph Algorithms WS 11/12 0 #12;5. Matchings in bipartite

Elsässer, Robert

102

Approximate von Neumann entropy for directed graphs  

Science Journals Connector (OSTI)

In this paper, we develop an entropy measure for assessing the structural complexity of directed graphs. Although there are many existing alternative measures for quantifying the structural properties of undirected graphs, there are relatively few corresponding measures for directed graphs. To fill this gap in the literature, we explore an alternative technique that is applicable to directed graphs. We commence by using Chung's generalization of the Laplacian of a directed graph to extend the computation of von Neumann entropy from undirected to directed graphs. We provide a simplified form of the entropy which can be expressed in terms of simple node in-degree and out-degree statistics. Moreover, we find approximate forms of the von Neumann entropy that apply to both weakly and strongly directed graphs, and that can be used to characterize network structure. We illustrate the usefulness of these simplified entropy forms defined in this paper on both artificial and real-world data sets, including structures from protein databases and high energy physics theory citation networks.

Cheng Ye; Richard C. Wilson; Csar H. Comin; Luciano da F. Costa; Edwin R. Hancock

2014-05-12T23:59:59.000Z

103

PDSF Utilization Graphs  

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

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

104

Graph Visualization API Library for Application Builders  

Science Journals Connector (OSTI)

Founded in 1991, Tom Sawyer Software produces quality graph-based architectures for application developers. These technologies include graph management, graph layout, graph diagramming, and graph visualization...

Franois Bertault; Wendy Feng; Uli Feier; Gabe Grigorescu

2002-01-01T23:59:59.000Z

105

Graph Algorithms Vertex Coloring  

E-Print Network [OSTI]

Coloring Definition I: A disjoint collection of independent sets that cover all the vertices in the graphGraph Algorithms Vertex Coloring Graph Algorithms #12;The Input Graph G = (V, E) a simple and undirected graph: V : a set of n vertices. E: a set of m edges. A B EF C D A B C D E F A 0 1 1 1 0 0 B 1 0

Bar-Noy, Amotz

106

Scheduling and mapping of conditional task graph for the synthesis of low power embedded systems  

E-Print Network [OSTI]

and mapping technique is investigated and results are reported. 1 Introduction Energy efficiency is becoming, such an accurate system representation also offers the potential of efficient implementations in terms of energy, which optimises both the mapping and schedule towards energy efficiency by abetting the exploitation

Zhao, Yuxiao

107

Buildings Database  

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

Energy Efficiency & Renewable Energy EERE Home | Programs & Offices | Consumer Information Buildings Database Welcome Guest Log In | Register | Contact Us Home About All Projects...

108

Database Search  

National Nuclear Security Administration (NNSA)

mountain ranges, faults that have both normal and strike slip. Dip Database Search http:gldims.cr.usgs.govwebappscfusionsitesqfaultqfwebdisp.cfm?... 1 of 1 3292010 6:23...

109

Database Search  

National Nuclear Security Administration (NNSA)

strike slip. Database Search http:gldims.cr.usgs.govwebappscfusionsitesqfaultqfwebdisp.cfm?... 1 of 3 3292010 5:50 PM Dip Comments: Probably steep to moderate, typical...

110

Database Search  

National Nuclear Security Administration (NNSA)

fault were found, so its displacement sense is uncertain. Dip Database Search http:gldims.cr.usgs.govwebappscfusionSitesqfaultqfwebdisp.cfm?... 1 of 1 1292010 2:54...

111

Sequoia tops Graph 500 list of 'big data' supercomputers  

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

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, johnston19@llnl.gov 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

112

Fuzzy Mathematics Fuzzy -Sets, -Relations, -Logic, -Graphs,  

E-Print Network [OSTI]

Fuzzy Mathematics Fuzzy -Sets, -Relations, -Logic, -Graphs, -Mappings and The Extension Principle . . . . . . . . . . . . . . . . . . 8 2 The Extension Principle 10 3 Fuzzy Graphs 16 4 Fuzzy Logic 19 Back View #12;Section 1: Fuzzy Olaf Wolkenhauer Control Systems Centre UMIST o.wolkenhauer@umist.ac.uk www

Rostock, Universität

113

Extremal optimization for graph partitioning Stefan Boettcher*  

E-Print Network [OSTI]

­4 and of fast-folding protein confor- mations 5 are but two examples. In cases where the relation between-temperature properties of disordered systems. In the present work we focus on the intrinsic features of the method on the graph bipartitioning problem. We consider various kinds of graph ensembles, both with geometric

Percus, Allon

114

Compatible Hamilton cycles in Dirac graphs Michael Krivelevich  

E-Print Network [OSTI]

Compatible Hamilton cycles in Dirac graphs Michael Krivelevich Choongbum Lee Benny Sudakov system F over a Dirac graph G, there exists a Hamilton cycle compatible with F. This settles in a very strong form, a conjecture of H¨aggkvist from 1988. 1 Introduction A Hamilton cycle in a graph G

Krivelevich, Michael

115

Graph algorithms experimentation facility  

E-Print Network [OSTI]

minimum vertex cover and maximum clique size heuristics and some visibility and circle graph related methods. As a by-product of our implementation we obtained several results about the structure of maximum independent sets for several classes of graphs...

Sonom, Donald George

2012-06-07T23:59:59.000Z

116

Graphs, Trees Pebbles, Robots  

E-Print Network [OSTI]

Graphs, Trees Pebbles, Robots 1 #12;Outline I. Robot Arms. II. Rigid Graphs. III. Characterizations. Applications: (a) Rigid Components. 2 #12;I. Robot arms and the Carpenter's Rule Problem. Can a robot arm

Haas, Ruth

117

Parasupersymmetry in Quantum Graphs  

E-Print Network [OSTI]

We study hidden parasupersymmetry structures in purely bosonic quantum mechanics on compact equilateral graphs. We consider a single free spinless particle on the graphs and show that the Huang-Su parasupersymmetry algebra is hidden behind degenerate spectra.

Satoshi Ohya

2012-10-29T23:59:59.000Z

118

Parasupersymmetry in Quantum Graphs  

E-Print Network [OSTI]

We study hidden parasupersymmetry structures in purely bosonic quantum mechanics on compact equilateral graphs. We consider a single free spinless particle on the graphs and show that the Rubakov-Spiridonov-Khare-Tomiya parasupersymmetries are hidden behind degenerate spectra.

Ohya, Satoshi

2012-01-01T23:59:59.000Z

119

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

SciTech Connect (OSTI)

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

2014-04-29T23:59:59.000Z

120

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

DOE Patents [OSTI]

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)

2012-03-20T23:59:59.000Z

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


121

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

DOE Patents [OSTI]

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)

2011-02-01T23:59:59.000Z

122

A patentometric analysis of the International Nuclear Information System database: 1970-2006  

Science Journals Connector (OSTI)

Of the 46 461 patents studied for the period 1970-2006 from the INIS Database, inputs (in percentages) were from Japan (27.9), the USA (23), Germany (13.7), France (11.3) and the UK (7.2). The main languages used were English (35.7), Japanese (27.9), German (14) and French (11.4), out of 20 languages. Patents with percentages in a single category were Engineering and Technology (62.4); Chemistry, Materials and Earth Sciences (13.9); Isotopes and Isotope and Radiation Applications (6.2); Physics (5.5); Life and Environmental Sciences (4.6); Other Aspects of Nuclear and Non-nuclear Energy (0.2); and multidisciplinary (7.2). Among the top inventors, Makoto Ueda had 140 patents, J. Schoening 121 and F.S. Jabsen 115.

T. Swarna; Anjali Prabhu; Geeta Nabar; V.L. Kalyane; Vijai Kumar

2009-01-01T23:59:59.000Z

123

Evaluation of Indian input to the international nuclear information system database  

Science Journals Connector (OSTI)

The study is aimed at analysing the INIS bibliographic records of publications in India during the period 2000-2008. The analysis includes the inputting trend, time-lag, contributing journals, country collaboration, content analysis through the classification and keywords. India has a total number of 14,697 records input to the database with an yearly average of 1631 records. The timeliness of input is very noteworthy as 29.15% of all articles are input in the same publication year, 52.57% articles are of only one year delay in inputting. Pramana, Journal of Medical Physics, Radiation Protection and Environment are found as the most contributed Indian journals. Scientists from USA, Germany, Japan, etc., are the main contributors. Nuclear physics and radiation physics, specific nuclear reactors and associated plants, particle accelerators, inorganic, organic, physical and analytical chemistry, etc., are main areas of the Indian input.

Anil Kumar; E.R. Prakasan; Sandeep Kadam; Nita Bhaskar

2011-01-01T23:59:59.000Z

124

Graph Algorithms Robert Elsasser  

E-Print Network [OSTI]

. Definition 3: A vertex cover of a graph G = (V, E) is a set Q V , such that each edge of E is incidentGraph Algorithms Robert Els¨asser 17 November 2011 Program of the day: · Matchings in bipartite graphs Robert Els¨asser Universit¨at Paderborn Graph Algorithms WS 11/12 0 #12;5. Matchings in bipartite

Elsässer, Robert

125

Database Search  

National Nuclear Security Administration (NNSA)

1:24,000. Database Search http:gldims.cr.usgs.govwebappscfusionSitesqfaultqfwebdisp.cfm?... 2 of 3 212010 12:30 PM 289 Dohrenwend, J.C., Schell, B.A., McKittrick,...

126

Belief propagation algorithm for computing correlation functions in finite-temperature quantum many-body systems on loopy graphs  

Science Journals Connector (OSTI)

Belief propagationa powerful heuristic method to solve inference problems involving a large number of random variableswas recently generalized to quantum theory. Like its classical counterpart, this algorithm is exact on trees when the appropriate independence conditions are met and is expected to provide reliable approximations when operated on loopy graphs. In this paper, we benchmark the performances of loopy quantum belief propagation (QBP) in the context of finite-temperature quantum many-body physics. Our results indicate that QBP provides reliable estimates of the high-temperature correlation function when the typical loop size in the graph is large. As such, it is suitable, e.g., for the study of quantum spin glasses on Bethe lattices and the decoding of sparse quantum error correction codes.

David Poulin and Ersen Bilgin

2008-05-16T23:59:59.000Z

127

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

E-Print Network [OSTI]

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

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

128

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

E-Print Network [OSTI]

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

Michalski, Ryszard S.

129

Graph Summarization with Bounded Error Saket Navlakha  

E-Print Network [OSTI]

of Maryland College Park, MD, USA-20742 saket@cs.umd.edu Rajeev Rastogi Yahoo! Labs Bangalore, India rrastogi@yahoo-inc Graphs are a fundamental abstraction that have been em- ployed for centuries to model real-world systems

Gruner, Daniel S.

130

A Portrait Drawing Robot Using a Geometric Graph Approach: Furthest Neighbour Theta-Graphs  

E-Print Network [OSTI]

literature include painting robots where various type of systems were implemented [1], [2], [4]. For instanceA Portrait Drawing Robot Using a Geometric Graph Approach: Furthest Neighbour Theta-Graphs Meng drawing humanoid robot, Betty. To solve this line drawing problem we present a modified Theta

Durocher, Stephane

131

Spectral characterizations of sun graphs and broken sun graphs  

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

132

Approaches to Anaphora Resolution in a Natural Language Database Management System  

E-Print Network [OSTI]

interface to a variety of systems. The types of information available for resolution are first identified and the past approaches to resolution for each type are critically reviewed. This paper then describes how anaphora resolution is implemented...

Nara, Hiroshi

1986-01-01T23:59:59.000Z

133

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

E-Print Network [OSTI]

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

Celi, Leo Anthony G.

134

SIR: a simple indexing and retrieval system for biological flat file databases  

Science Journals Connector (OSTI)

......can be used to build a primary index. The flat file databank, SWISSPROT...shows the module that builds indices. Indexing SWISSPROT (release...deletion and length. After the completion of index building the system is ready for......

Chenna Ramu

2001-08-01T23:59:59.000Z

135

[Geothermal system temperature-depth database and model for data analysis]. 5. quarterly technical progress report  

SciTech Connect (OSTI)

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.

Blackwell, D.D.

1998-04-25T23:59:59.000Z

136

Convex Graph Invariants  

E-Print Network [OSTI]

Dec 2, 2010 ... where A represents the adjacency matrix of a graph, and the maximum is taken over all ...... SDPT3 - a MATLAB software package for.

2010-12-02T23:59:59.000Z

137

Spectral Graph Theory  

E-Print Network [OSTI]

REU this summer was also to examine the brain of. Caenorhabditis elegans (C. Elegans). Chklovskii formed a Laplacian matrix of the graph representing.

*D. J. Kelleher

2011-09-30T23:59:59.000Z

138

Graphs associated with semigroups  

E-Print Network [OSTI]

the empty graph is not td d t b pl t . A ~b* h 1 g ph G graph having all of its vertices and edges in G. The citations on the following pages follow the style f th ~fdt f th A t M th tt 1 ~S1 t A path is a sequence of distinct vertices, V , V... , . . . , V n' where V and V are adjacent for i 1, 2, . . . , n-l. If there exists a path between two vertices, the pair is said to be connected. A connected ~ra h is a graph in which every pair of vertices is joined by a path. The empty graph...

Baber, Stephen Asa

2012-06-07T23:59:59.000Z

139

Database Security Issues for RealTime Electronic Commerce Systems Sang H. Son  

E-Print Network [OSTI]

Science University of Virginia Charlottesville, VA 22903, USA son@virginia.edu Abstract Data management and transaction processing are essential in supporting advanced time­critical appli­ cations. In many for advanced data management functionalities in real­ time systems poses intellectual and engineering

Son, Sang H.

140

Enhancing a Genome Database Using the XSB Tabled Logic Programming System  

E-Print Network [OSTI]

goal of the Human Genome Project 1] is to construct detailed physical maps of the human genome implementationof laboratory information systems developed at the Center for Genome Research in the Whitehead Research at the Whitehead Institute in MIT is engaged in several large-scale genome mapping projects

Davulcu, Hasan

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


141

Power systems: State estimation. (Latest citations from the EI Compendex plus database). Published Search  

SciTech Connect (OSTI)

The bibliography contains citations concerning the monitoring and control of power systems using state estimation techniques. The citations cover analytical techniques, including algorithms, simulations, and problems, such as bad data and nonlinearities. (Contains 250 citations and includes a subject term index and title list.)

Not Available

1993-08-01T23:59:59.000Z

142

NETL: 2010 World Gasification Database Archive  

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

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.

143

Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more  

Science Journals Connector (OSTI)

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

2007-03-01T23:59:59.000Z

144

Efficient Versioning for Scientific Array Databases  

E-Print Network [OSTI]

In this paper, we describe a versioned database storage manager we are developing for the SciDB scientific database. The system is designed to efficiently store and retrieve array-oriented data, exposing a "no-overwrite" ...

Seering, Adam

145

Bipartite graph partitioning and data clustering  

SciTech Connect (OSTI)

Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender system. In this paper, the authors propose a new data clustering method based on partitioning the underlying biopartite graph. The partition is constructed by minimizing a normalized sum of edge weights between unmatched pairs of vertices of the bipartite graph. They show that an approximate solution to the minimization problem can be obtained by computing a partial singular value decomposition (SVD) of the associated edge weight matrix of the bipartite graph. They point out the connection of their clustering algorithm to correspondence analysis used in multivariate analysis. They also briefly discuss the issue of assigning data objects to multiple clusters. In the experimental results, they apply their clustering algorithm to the problem of document clustering to illustrate its effectiveness and efficiency.

Zha, Hongyuan; He, Xiaofeng; Ding, Chris; Gu, Ming; Simon, Horst D.

2001-05-07T23:59:59.000Z

146

GraphState - a tool for graph identification and labelling  

E-Print Network [OSTI]

We present python libraries for Feynman graphs manipulation. The key feature of these libraries is usage of generalization of graph representation offered by B. G. Nickel et al. In this approach graph is represented in some unique 'canonical' form that depends only on its combinatorial type. The uniqueness of graph representation gives an efficient way for isomorphism finding, searching for subgraphs and other graph manipulation tasks. Though offered libraries were originally designed for Feynman graphs, they might be useful for more general graph problems.

Batkovich, D; Kompaniets, M; Novikov, S

2014-01-01T23:59:59.000Z

147

GraphState - a tool for graph identification and labelling  

E-Print Network [OSTI]

We present python libraries for Feynman graphs manipulation. The key feature of these libraries is usage of generalization of graph representation offered by B. G. Nickel et al. In this approach graph is represented in some unique 'canonical' form that depends only on its combinatorial type. The uniqueness of graph representation gives an efficient way for isomorphism finding, searching for subgraphs and other graph manipulation tasks. Though offered libraries were originally designed for Feynman graphs, they might be useful for more general graph problems.

D. Batkovich; Yu. Kirienko; M. Kompaniets; S. Novikov

2014-09-29T23:59:59.000Z

148

Review: Advanced Database Systems  

Science Journals Connector (OSTI)

......IBM European Object Technology Practice Unix...Information on a Corporate Intranet Bryan Hopkins ISBN 0-566-07981-X...cover how to set up an intranet but concentrates on...electronic delivery. As intranets are increasingly being...IBM European Object Technology Practice Chairman......

Tony Jenkins

1998-07-01T23:59:59.000Z

149

Graph representation of protein free energy landscape  

SciTech Connect (OSTI)

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

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

2013-11-14T23:59:59.000Z

150

Bose-Einstein condensation on quantum graphs  

E-Print Network [OSTI]

We present results on Bose-Einstein condensation (BEC) on general compact quantum graphs, i.e., one-dimensional systems with a (potentially) complex topology. We first investigate non-interacting many-particle systems and provide a complete classification of systems that exhibit condensation. We then consider models with interactions that consist of a singular part as well as a hardcore part. In this way we obtain generalisations of the Tonks-Girardeau gas to graphs. For this we find an absence of phase transitions which then indicates an absence of BEC.

Jens Bolte; Joachim Kerner

2014-03-02T23:59:59.000Z

151

Querying graphs with data  

E-Print Network [OSTI]

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

Vrgoc, Domagoj

2014-06-27T23:59:59.000Z

152

Data Modelling and Database Requirements Geographical Data  

E-Print Network [OSTI]

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 Brief history 15 Definitions 15 The three-schema architecture 16 Features/services of databaseData Modelling and Database Requirements for Geographical Data Håvard Tveite January, 1997 #12-Model Substitution, and adds new symbology that is relevant for geographical data. Database system requirements

153

Groundwater Database | Department of Energy  

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

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

154

ARTI refrigerant database  

SciTech Connect (OSTI)

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.

1996-11-15T23:59:59.000Z

155

Graph degree linkage: agglomerative clustering on a directed graph  

Science Journals Connector (OSTI)

This paper proposes a simple but effective graph-based agglomerative algorithm, for clustering high-dimensional data. We explore the different roles of two fundamental concepts in graph theory, indegree and outdegree, in the context of clustering. The ...

Wei Zhang; Xiaogang Wang; Deli Zhao; Xiaoou Tang

2012-10-01T23:59:59.000Z

156

Kinetic Pie Delaunay Graph and Its Applications  

Science Journals Connector (OSTI)

We construct a new proximity graph, called the Pie Delaunay graph, on a set of n points which is a super graph of Yao graph and Euclidean minimum spanning tree (EMST). We efficiently maintain the Pie

Mohammad Ali Abam; Zahed Rahmati; Alireza Zarei

2012-01-01T23:59:59.000Z

157

Databases | Department of Energy  

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

Technical Assistance Combined Heat & Power Deployment Databases Databases DOE has supported the development of several combined heat and power (CHP) and distributed energy...

158

Analyzing the Scalability of Graph Algorithms on Eldorado Keith D. Underwood1  

E-Print Network [OSTI]

Analyzing the Scalability of Graph Algorithms on Eldorado Keith D. Underwood1 , Megan Vance2 system provides exceptional perfor- mance on a variety of sparse graph algorithms. Unfor- tunately level scalability of the Eldorado platform on several graph algorithms. 1 Introduction Algorithms

Hendrickson, Bruce

159

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

E-Print Network [OSTI]

together through the entire journey. Thanks to the Computer Science Dept. , Texas AErM University, for lending me a SPARC workstation to design Modstar. Jonathan Creighton, Oracle Corp. , and Pyung-Chul Kim of ETRI, Korea, were always helpful... relational operations with different storage organizations (index on key, index on non-key, no index, clustered, and non-clustered relations) on a test database created using Modstar. The design has been implemented on a SPARC workstation running SUN OS 4...

Narayanan, Pudugramam Shanker

1994-01-01T23:59:59.000Z

160

Vacuum energy, spectral determinant and heat kernel asymptotics of graph Laplacians with general vertex matching conditions  

E-Print Network [OSTI]

We consider Laplace operators on metric graphs, networks of one-dimensional line segments (bonds), with matching conditions at the vertices that make the operator self-adjoint. Such quantum graphs provide a simple model of quantum mechanics in a classically chaotic system with multiple scales corresponding to the lengths of the bonds. For graph Laplacians we briefly report results for the spectral determinant, vacuum energy and heat kernel asymptotics of general graphs in terms of the vertex matching conditions.

J. M. Harrison; K. Kirsten

2010-03-16T23:59:59.000Z

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


161

Densities in graphs and matroids  

E-Print Network [OSTI]

|E(H)| |V (H)|?1 ? |E(T)| |V (T)|?1 = 1 for all non-trivial subgraphs of T. In general, a balanced graph G is a graph such that |E(H)| |V (H)| ? |E(G)| |V (G)| and a 1-balanced graph is a graph such that |E(H)| |V (H)|?1 ? |E(G)| |V (G)|?1 for all non...

Kannan, Lavanya

2009-05-15T23:59:59.000Z

162

Buildings Performance Database Overview  

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

such as lighting and HVAC type. * Create graphs of the selected dataset comparing: * Energy metrics such as: energy use intensity, source consumption, site consumption, electric...

163

Exploring the role of graph spectra in graph coloring algorithm performance  

Science Journals Connector (OSTI)

This paper considers the challenge of recognizing how the properties of a graph determine the performance of graph coloring algorithms. In particular, we examine how spectral properties of the graph make the graph coloring task easy or hard. We address ... Keywords: Algorithm selection, Branch and bound, DSATUR, Graph coloring, Graph invariants, Graph spectra, LP-relaxation

Kate Smith-Miles, Davaatseren Baatar

2014-10-01T23:59:59.000Z

164

ARTI refrigerant database  

SciTech Connect (OSTI)

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

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

1996-04-15T23:59:59.000Z

165

Databases | Department of Energy  

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

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

166

Triggers on Database Histories A. Prasad Sistla Ouri Wolfson  

E-Print Network [OSTI]

Triggers on Database Histories A. Prasad Sistla Ouri Wolfson Department of Electrical Engineering of the database state over time (i.e. the database history). For example, in securities trading, the system may to the database history. The following temporal trigger is one such example--- the value of attribute A increases

Wolfson, Ouri E.

167

Implementing an Improved Security for XYZ's Database and Telecommuters  

E-Print Network [OSTI]

& Integrity of XYZs Database............17 Developing a Database Security Plan ...............................18 Implementing the Improved Security... can occur. Developing a Database Security Plan XYZ has installed several audit trail devices into their working database system. Some of these devices are Top Secret and CA-Unicenter or other Windows security tools. These tools are able...

Ali, Mohamed M.

2011-05-20T23:59:59.000Z

168

Lessons Learned Database | Department of Energy  

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

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

169

Database Caching Over the Air-Storage  

Science Journals Connector (OSTI)

......adopted in database management systems for maximizing...utilizing an on-demand point-to-point...local database management system, and various...cache at the client side. In this model...cs over the on-demand channel and drive...challenges in data management. Commun. ACM......

H. Va Leong; A. Si

1997-01-01T23:59:59.000Z

170

CALIFORNIA ENERGY Small HVAC Database Of Monitored  

E-Print Network [OSTI]

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

171

A description of dynamical graphs associated to elementary regulatory circuits  

Science Journals Connector (OSTI)

......regulatory networks (regulatory graphs), as...for recent reviews, De Jong (2002...notion of cross-regulatory modules and a...2003)). We plan to study the...simulation of genetic regulatory systems: a literature review. J. Comput......

E. Remy; B. Moss; C. Chaouiya; D. Thieffry

2003-09-01T23:59:59.000Z

172

SSC lattice database and graphical interface  

SciTech Connect (OSTI)

When completed the Superconducting Super Collider will be the world's largest accelerator complex. In order to build this system on schedule, the use of database technologies will be essential. In this paper we discuss one of the database efforts underway at the SSC, the lattice database. The SSC lattice database provides a centralized source for the design of each major component of the accelerator complex. This includes the two collider rings, the High Energy Booster, Medium Energy Booster, Low Energy Booster, and the LINAC as well as transfer and test beam lines. These designs have been created using a menagerie of programs such as SYNCH, DIMAD, MAD, TRANSPORT, MAGIC, TRACE3D AND TEAPOT. However, once a design has been completed, it is entered into a uniform database schema in the database system. In this paper we discuss the reasons for creating the lattice database and its implementation via the commercial database system SYBASE. Each lattice in the lattice database is composed of a set of tables whose data structure can describe any of the SSC accelerator lattices. In order to allow the user community access to the databases, a programmatic interface known as dbsf (for database to several formats) has been written. Dbsf creates ascii input files appropriate to the above mentioned accelerator design programs. In addition it has a binary dataset output using the Self Describing Standard data discipline provided with the Integrated Scientific Tool Kit software tools. Finally we discuss the graphical interfaces to the lattice database. The primary interface, known as OZ, is a simulation environment as well as a database browser.

Trahern, C.G.; Zhou, J.

1991-11-01T23:59:59.000Z

173

The average number of distinct sites visited by a random walker on random graphs  

E-Print Network [OSTI]

We study the linear large $n$ behavior of the average number of distinct sites $S(n)$ visited by a random walker after $n$ steps on a large random graph. An expression for the graph topology dependent prefactor $B$ in $S(n) = Bn$ is proposed. We use generating function techniques to relate this prefactor to the graph adjacency matrix and then devise message-passing equations to calculate its value. Numerical simulations are performed to evaluate the agreement between the message passing predictions and random walk simulations on random graphs. Scaling with system size and average graph connectivity are also analysed.

De Bacco, Caterina; Sollich, Peter

2015-01-01T23:59:59.000Z

174

Exact algorithm for graph homomorphism and locally injective graph homomorphism  

Science Journals Connector (OSTI)

For graphs G and H, a homomorphism from G to H is a function @f:V(G)->V(H), which maps vertices adjacent in G to adjacent vertices of H. A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H. ... Keywords: Exact algorithm, Graph algorithms, Graph homomorphism, H(2,1)-labeling, Locally injective homomorphism

Pawe? Rzewski

2014-07-01T23:59:59.000Z

175

Extremal Graph Numbers of Graphs on Few May 4, 2012  

E-Print Network [OSTI]

Extremal Graph Numbers of Graphs on Few Vertices John Kim May 4, 2012 1 Introduction Let H this number to be the extremal graph number of H on n vertices, and we denote it by ex(n, H). When H(n, K3) n 2 2 . A precise formula for ex(n, K3) is given by: ex(n, K3) = n 2 n + 1 2 . The extremal

Zeilberger, Doron

176

Reimplementing the EPICS static database access library.  

SciTech Connect (OSTI)

The Static Database Access library was first introduced in EPICS (Experimental Physics and Industrial Control System) Release 3.11 in 1994. It provides an application program interface (API) for database configuration tools written in C to manipulate database record definitions and is used for various tasks within the core EPICS software. This paper describes the structure of a replacement for the original library that adds a native C++ API and will make some future enhancements to EPICS significantly easier to implement.

Johnson, A. N.; Kraimer, M. R.

2001-11-13T23:59:59.000Z

177

Gasification Plant Databases  

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

coal gasification projects throughout the world. These databases track proposed gasification projects with approximate outputs greater than 100 megawatts electricity...

178

Buildings Performance Database Overview  

Broader source: Energy.gov [DOE]

Buildings Performance Database Overview, from the U.S. Department of Energy's Office of Energy Efficiency and Renewable Energy.

179

Achieving 100,000,000 database inserts per second using Accumulo and D4M  

E-Print Network [OSTI]

The Apache Accumulo database is an open source relaxed consistency database that is widely used for government applications. Accumulo is designed to deliver high performance on unstructured data such as graphs of network data. This paper tests the performance of Accumulo using data from the Graph500 benchmark. The Dynamic Distributed Dimensional Data Model (D4M) software is used to implement the benchmark on a 216-node cluster running the MIT SuperCloud software stack. A peak performance of over 100,000,000 database inserts per second was achieved which is 100x larger than the highest previously published value for any other database. The performance scales linearly with the number of ingest clients, number of database servers, and data size. The performance was achieved by adapting several supercomputing techniques to this application: distributed arrays, domain decomposition, adaptive load balancing, and single-program-multiple-data programming.

Kepner, Jeremy; Bestor, David; Bergeron, Bill; Byun, Chansup; Gadepally, Vijay; Hubbell, Matthew; Michaleas, Peter; Mullen, Julie; Prout, Andrew; Reuther, Albert; Rosa, Antonio; Yee, Charles

2014-01-01T23:59:59.000Z

180

How to Resum Feynman Graphs  

E-Print Network [OSTI]

In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing but the percentage of Hepp's sectors in which the tree is leading the ultraviolet analysis. We explain how they allow to reshuffle the divergent series formulated in terms of Feynman graphs into convergent series indexed by the trees that these graphs contain. The Feynman graphs to be used are not the ordinary ones but those of the intermediate field representation, and the result of the reshuffling is called the Loop Vertex Expansion.

Vincent Rivasseau; Zhituo Wang

2013-09-24T23:59:59.000Z

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


181

US Department of Energy Chernobyl Database  

SciTech Connect (OSTI)

The Chernobyl Database project is developing and maintaining an information to provide researchers with data and resource materials relating to the Chernobyl nuclear accident of April 1986. The system is the official United States repository for Chernobyl data. The system includes a collection of Chernobyl-related documents, a database of bibliographic references, and a collection of radiological measurements records. In addition, projects have been developed to make the resources more accessible and easy to use. These products include a personal-computer-based bibliographic search system (ChernoLit{trademark}), two printed bibliographies, and a personal- computer-based radiological measurements database system (ChernoDat).

Kennedy, R.A.; Mahaffey, J.A.; Smith, S.K.; Carr, F. Jr.

1992-05-01T23:59:59.000Z

182

Fast iterative graph computation with block updates  

Science Journals Connector (OSTI)

Scaling iterative graph processing applications to large graphs is an important problem. Performance is critical, as data scientists need to execute graph programs many times with varying parameters. The need for a high-level, high-performance programming ...

Wenlei Xie; Guozhang Wang; David Bindel; Alan Demers; Johannes Gehrke

2013-09-01T23:59:59.000Z

183

databases | netl.doe.gov  

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

The database is available in Microsoft Access 2002 format. Download 6.35 MB COA Database Heavy Oil Database: 2004. The Heavy Oil Database contains information on over 500...

184

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

SciTech Connect (OSTI)

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

NONE

1995-11-01T23:59:59.000Z

185

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

SciTech Connect (OSTI)

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

NONE

1995-01-01T23:59:59.000Z

186

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

SciTech Connect (OSTI)

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

Not Available

1994-05-01T23:59:59.000Z

187

L21: "Irregular" Graph Algorithms  

E-Print Network [OSTI]

11/11/10 1 L21: "Irregular" Graph Algorithms November 11, 2010 Administrative ·Class cancelled Monday, November 22, 11:59 PM Today we will cover Successive Over Relaxation. Here is the sequential code ·Irregular parallel computation - Sparse matrix operations (last time) and graph algorithms (this time

Hall, Mary W.

188

Phylogenetic Toric Varieties on Graphs  

E-Print Network [OSTI]

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

Buczynska, Weronika J.

2010-10-12T23:59:59.000Z

189

Contraction semigroups on metric graphs  

E-Print Network [OSTI]

The main objective of the present work is to study contraction semigroups generated by Laplace operators on metric graphs, which are not necessarily self-adjoint. We prove criteria for such semigroups to be continuity and positivity preserving. Also we provide a characterization of generators of Feller semigroups on metric graphs.

Vadim Kostrykin; Jurgen Potthoff; Robert Schrader

2008-02-26T23:59:59.000Z

190

2010 Worldwide Gasification Database  

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

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

191

Lessons Learned From Developing Reactor Pressure Vessel Steel Embrittlement Database  

SciTech Connect (OSTI)

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

2010-08-01T23:59:59.000Z

192

Sequoia retains top ranking on Graph 500 for third year running  

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

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, johnston19@llnl.gov 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

193

Contractions of planar graphs in polynomial time?  

E-Print Network [OSTI]

Contractions of planar graphs in polynomial time? Marcin Kami´nski??1 , Dani¨el Paulusma2 that for every graph H, there exists a polyno- mial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological minors of embedded (plane) graphs and show that a plane

Dimitrios, Thilikos

194

Some Remarks on Definability of Process Graphs  

E-Print Network [OSTI]

them in the context of the well- known process algebras BPA and BPP. For a process graph G, the density going from s to infinity" exist in G. For BPA-graphs we discuss some tentative findings about-definability results, stating that certain process graphs are not BPA-graphs, and stronger, not even BPA

Klop, Jan Willem

195

Extremal Graph Problems, Degenerate Extremal Problems,  

E-Print Network [OSTI]

Extremal Graph Problems, Degenerate Extremal Problems, and Supersaturated Graphs Mikl´os Simonovits´an-type extremal problem. The graphs attaining the maximum will be called extremal and their family will be denoted and multi- ple edges. In 1940, P. Tur´an posed and solved the extremal problem of Kp+1, the complete graph

Simonovits, Miklós

196

CP(Graph): Introducing a Graph Computation Domain in Constraint Programming  

E-Print Network [OSTI]

CP(Graph): Introducing a Graph Computation Domain in Constraint Programming Gregoire Dooms, Yves constraint programming by introducing CP(Graph), a new computation domain focused on graphs including a new and its associated propagator are sketched. CP(Graph) is in- tegrated with finite domain and finite sets

Deville, Yves

197

Transforming a graph into a 1-balanced graph  

Science Journals Connector (OSTI)

Let G be a non-trivial, loopless graph and for each non-trivial subgraph H of G, let g(H)=|E(H)||V(H)|-@w(H). The graph G is 1-balanced if @c(G), the maximum among g(H), taken over all non-trivial subgraphs H of G, is attained when H=G. This quantity ... Keywords: Fractional arboricity, Molecular, Strongly balanced, Uniformly dense

Lavanya Kannan; Arthur Hobbs; Hong-Jian Lai; Hongyuan Lai

2009-01-01T23:59:59.000Z

198

Handling Database Updates in Two-dimensional Temporal Logic  

E-Print Network [OSTI]

describing the history of the world, the database system can also execute temporal speci cations in the form a reference point or a reference time. If we apply these concepts to the description of databases, the history the history of the world (database), and action is to be executed upon the world in the present or future time

Finger, Marcelo

199

Concept integration of document databases using different indexing languages  

Science Journals Connector (OSTI)

An integrated information retrieval system generally contains multiple databases that are inconsistent in terms of their content and indexing. This paper proposes a rough set-based transfer (RST) model for integration of the concepts of document databases ... Keywords: Compatibility, Concept integration, Document database, Indexing language, Rough set theory

Xueying Zhang

2006-01-01T23:59:59.000Z

200

Proposal for a High Energy Nuclear Database  

E-Print Network [OSTI]

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

Vogt, D A B R

2005-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


201

database | OpenEI  

Open Energy Info (EERE)

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

202

Standards for graph algorithm primitives  

E-Print Network [OSTI]

It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building ...

Mattson, Tim

203

Graph anomalies in cyber communications  

SciTech Connect (OSTI)

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

2011-01-11T23:59:59.000Z

204

Are Pixel Graphs Are Better at Representing Information than Pie Graphs?  

Science Journals Connector (OSTI)

This study investigates whether pixel graphs more accurately represent percentage based data than pie graphs or bar graphs. Participants were asked ... representing large quantities of percentage based data than

Jolie Bell; Jim Davies

2010-01-01T23:59:59.000Z

205

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

DOE Patents [OSTI]

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

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

2000-01-01T23:59:59.000Z

206

Multilevel spectral clustering : graph partitions and image segmentation  

E-Print Network [OSTI]

While the spectral graph partitioning method gives high quality segmentation, segmenting large graphs by the spectral method is computationally expensive. Numerous multilevel graph partitioning algorithms are proposed to ...

Kong, Tian Fook

2008-01-01T23:59:59.000Z

207

PATENTS OFFICE REGISTER DATABASE SEARCH  

E-Print Network [OSTI]

PATENTS OFFICE REGISTER & DATABASE SEARCH . Database Home PATENT REGISTER Status: Lapsed Grant No VERMEER MANUFACTURING COMPANY 2411 Highway 102 Pella, IA 50219 UNITED STATES OF AMERICA Address

Kansas, University of

208

REDD+ Database | Open Energy Information  

Open Energy Info (EERE)

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"

209

Nuclear Science References Database  

E-Print Network [OSTI]

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?tk; B. Singh; J. Totans

2014-07-08T23:59:59.000Z

210

Databases | Department of Energy  

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

databases to make it easier for users to find up-to-date information on hydrogen and fuel cells. The Hydrogen and Fuel Cells Codes and Standards Matrix is an up-to-date...

211

Automatic Library Tracking Database Infrastructure  

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

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,

212

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

E-Print Network [OSTI]

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

213

Memory Bounds for the Distributed Execution of a Hierarchical Synchronous Data-Flow Graph  

E-Print Network [OSTI]

Memory Bounds for the Distributed Execution of a Hierarchical Synchronous Data-Flow Graph Karol analysis tech- nique to define the boundary of shared memory requirements of Multiprocessor System of transformations to the SDF graph so as to reveal its memory characteristics. These transformations produce

Paris-Sud XI, Université de

214

Querying genomic databases  

SciTech Connect (OSTI)

A natural-language interface has been developed that retrieves genomic information by using a simple subset of English. The interface spares the biologist from the task of learning database-specific query languages and computer programming. Currently, the interface deals with the E. coli genome. It can, however, be readily extended and shows promise as a means of easy access to other sequenced genomic databases as well.

Baehr, A.; Hagstrom, R.; Joerg, D.; Overbeek, R.

1991-09-01T23:59:59.000Z

215

Freedom of Information and Privacy Act Database PIA, Idaho Operations...  

Energy Savers [EERE]

Freedom of Information and Privacy Act Database PIA, Idaho Operations Office More Documents & Publications PIA - Security Clearance Work Tracking and Budget System TRAIN-PIA.pdf...

216

Crude Oil Analysis Database  

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

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.

217

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

SciTech Connect (OSTI)

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.

2009-06-30T23:59:59.000Z

218

Algebraic connectivity and graph robustness.  

SciTech Connect (OSTI)

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

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

2009-07-01T23:59:59.000Z

219

Information discovery applied to a power generation database  

SciTech Connect (OSTI)

An information discovery system is presented that extracts knowledge from databases in a form that is much more compact and easy to understand than the original set of records. The system was tested with a subset of a real power generation database of the Federal Commission of Electricity in Mexico (CFE = Comision Federal de Electricidad). The paper discusses a machine learning algorithm for induction of rules and the heuristics used to obtain the simplest rules that define the knowledge hidden in a database.

Rodriguez, G.; Hernandez, V. [Electrical Research Inst., Cuernavaca (Mexico). Information Systems Dept.

1996-11-01T23:59:59.000Z

220

Fire Protection Database | Department of Energy  

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

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.

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


221

NLS ground states on graphs  

E-Print Network [OSTI]

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

Riccardo Adami; Enrico Serra; Paolo Tilli

2014-06-16T23:59:59.000Z

222

On Edge Szeged Index of Bridge Graphs  

Science Journals Connector (OSTI)

Corollary 2. Let H be any graph with fixed vertex $$ v $$ .... Then the edge Szeged index of the bridge

Fuqin Zhan; Youfu Qiao

2013-01-01T23:59:59.000Z

223

Pauli graph and finite projective lines/geometries  

E-Print Network [OSTI]

The commutation relations between the generalized Pauli operators of N-qudits (i. e., N p-level quantum systems), and the structure of their maximal sets of commuting bases, follow a nice graph theoretical/geometrical pattern. One may identify vertices/points with the operators so that edges/lines join commuting pairs of them to form the so-called Pauli graph P_{p^N} . As per two-qubits (p = 2, N = 2) all basic properties and partitionings of this graph are embodied in the geometry of the symplectic generalized quadrangle of order two, W(2). The structure of the two-qutrit (p = 3, N = 2) graph is more involved; here it turns out more convenient to deal with its dual in order to see all the parallels with the two-qubit case and its surmised relation with the geometry of generalized quadrangle Q(4, 3), the dual of W(3). Finally, the generalized adjacency graph for multiple (N > 3) qubits/qutrits is shown to follow from symplectic polar spaces of order two/three. The relevance of these mathematical concepts to mutually unbiased bases and to quantum entanglement is also highlighted in some detail.

Michel R. P. Planat; Metod Saniga

2007-03-16T23:59:59.000Z

224

A heuristic algorithm for graph isomorphism  

E-Print Network [OSTI]

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

Torres Navarro, Luz

1999-01-01T23:59:59.000Z

225

Hybrid motion graph for character motion synthesis  

Science Journals Connector (OSTI)

Objective: This paper proposes a novel framework of Hybrid Motion Graph (HMG) for creating character animations, which enhances the graph-based structural control by motion field representations for efficient motion synthesis of diverse and interactive ... Keywords: Motion fields, Motion graph, Motion synthesis, Motion template, Motion transition

Weiwei Xing; Xiang Wei; Jian Zhang; Cheng Ren; Wei Lu

2014-02-01T23:59:59.000Z

226

THE TUKEY ORDER FOR GRAPHS 1. Introduction  

E-Print Network [OSTI]

THE TUKEY ORDER FOR GRAPHS 1. Introduction Given a graph G, we let VG stand for the vertex set of G. For graphs G without isolated vertices, the Tukey order can be characterized thus: () G H iff there exist) is called a (generalized) Galois-Tukey connection (abbreviated GT-connection) from R to S if the following

Nyikos, Peter J.

227

Methods | Transparent Cost Database  

Open Energy Info (EERE)

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

228

FORAST Database (DB1005)  

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

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.

229

ARTI Refrigerant Database  

SciTech Connect (OSTI)

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.

Calm, J.M.

1992-04-30T23:59:59.000Z

230

Central Internet Database (CID)  

Office of Environmental Management (EM)

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.

231

Complex Glazing Database  

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

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)

232

Relational Database SQL: Querying the Relational DB  

E-Print Network [OSTI]

: auto-completion and command history Weigang Qiu Relational Database & SQL #12;Relational Database SQLRelational Database SQL: Querying the Relational DB Workshop: the "genome" Database Relational Database & SQL Weigang Qiu Department of Biological Sciences Hunter College BIOL 425 Computational

Qiu, Weigang

233

MINIMIZATION OF FUZZY SYSTEMS BASED ON FUZZY INFERENCE GRAPHS # Chantana Chantrapornchai 1 Sissades Tongsima 1 Edwin H.M. Sha 1  

E-Print Network [OSTI]

. INTRODUCTION Fuzzy logic and approximate reasoning [11] are widely used in rule­based expert system and especially in control system. A fuzzy knowledge­based system may contain a large number of rules; thus to compiling and running stages of ordinary programs. Since a fuzzy system, especially a fuzzy controller, can

Sha, Edwin

234

DDI and Relational Databases  

E-Print Network [OSTI]

will use Access for modelling some examples during the workshop It is not an ideal solution for DDI as the database engine is quite limited as it is not fully ANSI-SQL compliant In reality you should use a real SQL engine like e.g. MySQL Postgre... versions of DDI (e.g. DDI-L 3.0, 3.1, 3.2) and ensuring application compatibility with the original standard DDI Applications Pros of relational databases in regards to DDI Structure is very good for rectangular files (e.g. SPSS or Stata) Easier...

Amin, Alerk; Barkow, Ingo

2013-04-04T23:59:59.000Z

235

Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models  

E-Print Network [OSTI]

simulation of systems represented by rule- based models. This is founded on a new, clean, graph on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). Editors: D. D'Souza, J ­ Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany #12;Danos et al. 277 illuminates choices made

Fontana, Walter

236

Simulation of an Electrical Substation Using the Bond Graph Technique  

Science Journals Connector (OSTI)

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

2008-04-01T23:59:59.000Z

237

Quantitative Analysis of the Full Bitcoin Transaction Graph  

E-Print Network [OSTI]

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

238

Robust Object Recognition in Images and the Related Database Problems  

Science Journals Connector (OSTI)

Traditional content-based image retrieval systems typically compute a single descriptor per image based for example on color histograms. The result of a query is in general the images from the database whose descriptors are the closest to the descriptor ... Keywords: databases, fine-grain image recognition, high dimensional indexing, image retrieval systems

Laurent Amsaleg; Patrick Gros; Sid-Ahmed Berrani

2004-08-01T23:59:59.000Z

239

The CEBAF Element Database  

SciTech Connect (OSTI)

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

2011-03-01T23:59:59.000Z

240

High Performance Buildings Database  

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

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

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


241

Proposal for a High Energy Nuclear Database  

SciTech Connect (OSTI)

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

Brown, David A.; Vogt, Ramona

2005-03-31T23:59:59.000Z

242

Constrained Graph Optimization: Interdiction and Preservation Problems  

SciTech Connect (OSTI)

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

2012-07-30T23:59:59.000Z

243

Networked database builder and data-mining engine for electronic journal papers  

Science Journals Connector (OSTI)

We have developed a data-warehouse system designed for research data centres, which is currently tested in the National Institute for Fusion Science (NIFS) in Japan. The data warehouse integrates an online builder of multi-dimensional ... Keywords: Japan, crawler, data mining, data warehouse, e-journals, electronic journals, fusion plasma database, information retrieval, intelligent database, networked database builder, networking, numerical databases, online databases, research data centres, scientific abstracts

Lukas Pichl; Manabu Suzuki; Kazuki Joe; Daiji Kato; Akira Sasaki

2006-08-01T23:59:59.000Z

244

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

DOE Patents [OSTI]

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

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

2014-12-23T23:59:59.000Z

245

Solid waste projection model: Database version 1. 0 technical reference manual  

SciTech Connect (OSTI)

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.0 Database. This document is intended for use by experienced database specialists and supports database maintenance, utility development, and database enhancement. Those interested in using the SWPM database should refer to the SWPM Database User's Guide. 14 figs., 6 tabs.

Carr, F.; Bowman, A.

1990-11-01T23:59:59.000Z

246

An Object Oriented Framework For Database Benchmarking Based On The Open Source Database  

E-Print Network [OSTI]

the throughput of DBMSs against each other on the same operating systems, and compare the same DBMS's throughput on different operating systems. A benchmark is one scientific way to achieve such results. The Open Source Benchmark (OSDB) project for the Oracle database management system. Second, we have developed

Wagner, Paul J.

247

The Comprehensive Pacific Rainfall Database  

Science Journals Connector (OSTI)

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

2008-01-01T23:59:59.000Z

248

database | netl.doe.gov  

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

NETL's Carbon Capture, Utilization, & Storage Database - Ver. 4 Research and Development Infrastructure Global NATCARBAtlas Program Plan Project Portfolio Publications Carbon...

249

Industrial Assistance and Projects Databases  

Broader source: Energy.gov [DOE]

The databases listed here provide information on energy assessments, results and recommendations, contacts, and incentives for manufacturers.

250

Anual Energy Database  

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

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,

251

Logging and Recovery in a Highly Concurrent Database  

E-Print Network [OSTI]

This report addresses the problem of fault tolerance to system failures for database systems that are to run on highly concurrent computers. It assumes that, in general, an application may have a wide distribution in ...

Keen, John S.

1994-06-01T23:59:59.000Z

252

Generating efficient execution plans for vertically partitioned XML databases  

Science Journals Connector (OSTI)

Experience with relational systems has shown that distribution is an effective way of improving the scalability of query evaluation. In this paper, we show how distributed query evaluation can be performed in a vertically partitioned XML database system. ...

Patrick Kling; M. Tamer zsu; Khuzaima Daudjee

2010-10-01T23:59:59.000Z

253

Buildings Performance Database  

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

DOE Buildings Performance DOE Buildings Performance Database Paul Mathew Lawrence Berkeley National Laboratory pamathew@lbl.gov (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,

254

Montana State Antiquities Database | Open Energy Information  

Open Energy Info (EERE)

Antiquities Database Jump to: navigation, search OpenEI Reference LibraryAdd to library Web Site: Montana State Antiquities Database Abstract Database contains cultural resource...

255

Central Internet Database (CID) Reports  

Office of Environmental Management (EM)

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.

256

Mathematics Database ZMATH MSC 2000  

E-Print Network [OSTI]

Reviewer Service Subscription »ZMATH« ZMATH Database | Advanced Search Print ZMATH Database Simple Search Advanced Search Command Search Advanced Search Query: an:0852.4600 Fill in the form and click »SearchLanguage: English Search: ZMATH Contact World of Mathematics Database »ZMATH« MSC 2000 MSC 2010

Kutateladze, Semen Samsonovich

257

Review: The Object Database Handbook  

Science Journals Connector (OSTI)

......Review: The Object Database Handbook Reviewed by Mike Jackson School...ac.uk The Object Database Handbook Douglas K Barry John Wiley...ac.uk The Object Database Handbook Douglas K Barry John Wiley...object-based approach, the book does not outline any circumstances......

Mike Jackson

1997-02-01T23:59:59.000Z

258

Commercial equipment cost database  

SciTech Connect (OSTI)

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.

1995-01-01T23:59:59.000Z

259

Impact of Semantic Heterogeneity on Federating Databases  

Science Journals Connector (OSTI)

......B. (1994) Fundamentals of Database Systems, 2nd edn. Benjamin Cummings, New York. [19] Salton, G. (1989) Automatic...Hutchinson, E. K., Kalmus, J. R., MacKinnon, L. M., Jeffery, K. G., Marwick, D. H., Williams, M. H. and Wilson......

R. M. Colomb

1997-01-01T23:59:59.000Z

260

Auditing a database under retention policies  

Science Journals Connector (OSTI)

Auditing the changes to a database is critical for identifying malicious behavior, maintaining data quality, and improving system performance. But an accurate audit log is an historical record of the past that can also pose a serious threat to privacy. ... Keywords: Auditing, Privacy, Retention policy

Wentian Lu; Gerome Miklau; Neil Immerman

2013-04-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


261

Locating-total domination in graphs  

Science Journals Connector (OSTI)

In this paper, we continue the study of locating-total domination in graphs. A set S of vertices in a graph G is a total dominating set in G if every vertex of G is adjacent to a vertex in S . We consider total dominating sets S which have the additional property that distinct vertices in V ( G ) ? S are totally dominated by distinct subsets of the total dominating set. Such a set S is called a locating-total dominating set in G , and the locating-total domination number of G is the minimum cardinality of a locating-total dominating set in G . We obtain new lower and upper bounds on the locating-total domination number of a graph. Interpolation results are established, and the locating-total domination number in special families of graphs, including cubic graphs and grid graphs, is investigated.

Michael A. Henning; Nader Jafari Rad

2012-01-01T23:59:59.000Z

262

To make a circle graph (pie graph) in Excel 2010 1. Enter the data ...  

E-Print Network [OSTI]

To make a circle graph (pie graph) in Excel 2010. 1. Enter the data into Excel in rows, with the data labels followed by the numerical data. 2. Select all cells that...

Dave

2012-03-20T23:59:59.000Z

263

On real number labelings and graph invertibility  

Science Journals Connector (OSTI)

For non-negative real x"0 and simple graph G, @l"x"""0","1(G) is the minimum span over all labelings that assign real numbers to the vertices of G such that adjacent vertices receive labels that differ by at least x"0 and vertices at distance two receive ... Keywords: ?-invertible, ?j,k-labeling, ?x,1-labeling, Distance-constrained labeling, Kneser graphs, Self-complementary graphs

Jeong-Ok Choi; John Georges; David Mauro; Yan Wang

2012-10-01T23:59:59.000Z

264

Some algorithmic results in graph imbeddings  

E-Print Network [OSTI]

new technique called double bar amalgamation is developed. The second problem deals with constructing graph imbeddings on a sur- face of genus c (where c is an integer) less than the marimum genus 7, (G) the given graph G. We develop a polynomial... time algorithm that constructs an imbedding of a given upper imbbedable graph G with even Betti number, on an orientable surface of genus (7, (G) ? 1). TABLE OF CONTENTS CHAPTER Page I INTRODUCTION 1. 1 Overview 1. 2 Graphs and Relationships Used...

Joshi, Sanjay

1990-01-01T23:59:59.000Z

265

Generating Reports & Graphs in Portfolio Manager  

Broader source: Energy.gov [DOE]

This presentation, given through the DOE's Technical Assitance Program (TAP), provides information on how to generate reports and graphs in Portfolio Manager.

266

Nuclear reactor multiphysics via bond graph formalism  

E-Print Network [OSTI]

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

Sosnovsky, Eugeny

2014-01-01T23:59:59.000Z

267

Hamilton Decompositions of Graphs with Primitive Complements .  

E-Print Network [OSTI]

??A graph G is a pair (V, E) where V is the set of vertices(or nodes) and E is the set of edges connecting the (more)

OZKAN, SIBEL

2007-01-01T23:59:59.000Z

268

Generation of graph-state streams  

E-Print Network [OSTI]

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

Daniel Ballester; Jaeyoon Cho; M. S. Kim

2010-12-08T23:59:59.000Z

269

TriGS Debugger - A Tool for Debugging Active Database Behavior1  

Science Journals Connector (OSTI)

Active database systems represent a powerful means to respond automatically to events that are taking place inside or outside the database. However, one of the main stumbling blocks for their widespread use is...

G. Kappel; G. Kramler; W. Retschitzegger

2001-01-01T23:59:59.000Z

270

Use of incident databases for cause and consequence analysis and national estimates  

E-Print Network [OSTI]

stored in existing databases can lead to useful conclusions and reduction of chemical incidents and consequences of incidents. An incident database is a knowledge based system that can give an insight to the situation which led to an incident. Effective...

Obidullah, A.S.M.

2007-04-25T23:59:59.000Z

271

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

E-Print Network [OSTI]

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

Zaslavsky, Thomas

272

3D Graph Visualization with the Oculus Rift Virtual Graph Reality  

E-Print Network [OSTI]

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

Wismath, Stephen

273

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

E-Print Network [OSTI]

1 Graph-Theoretic Generation of Assembly Plans Part I: Correct Generation of Precedence Graphs Lehigh University Bethlehem, Pennsylvania Abstract Automatic generation and selection of assembly plans a graph-theoretic scheme for the generation of assembly plans. Our scheme involves decomposing the CSP

Wu, David

274

Webinar: Hydrogen Storage Materials Database Demonstration |...  

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

Storage Materials Database Demonstration Webinar: Hydrogen Storage Materials Database Demonstration Presentation slides from the Fuel Cell Technologies Office webinar "Hydrogen...

275

Hydrogen Storage Materials Database Demonstration | Department...  

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

Storage Materials Database Demonstration Hydrogen Storage Materials Database Demonstration Presentation slides from the Fuel Cell Technologies Office webinar "Hydrogen Storage...

276

Useful Graphs and Charts - Ion Beams - Radiation Effects Facility...  

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

Ion Beams Available Beams Beam Change Times Measurements Useful Graphs Useful Graphs and Charts LET vs. Range in Si Graphs: 15 MeVu Beams 24.8 MeVu Beams 40 MeVu Beams...

277

Global Bus Rapid Transit (BRT) Database | Open Energy Information  

Open Energy Info (EERE)

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

278

An Introduction to Database Systems The Relational Database Normalization Theory  

E-Print Network [OSTI]

, AB A, AB B, ... } |F+| > 30. #12; F+ Armstrong ­ ­ · #12; F+ Armstrong ­ ­ · #12;Armstrong Armstrong's Axioms (1974): (IR1) Reflexivity rule():(IR1) Reflexivity rule(): If X Y, then X Y, Y Z } |= X Z. F #12;A Armstrong Additional rules derivable from Armstrong's Axioms. (IR4) D iti l

Lu, Jiaheng

279

Quantitative Analysis of the Full Bitcoin Transaction Graph  

E-Print Network [OSTI]

Abstract. The Bitcoin scheme is a rare example of a large scale global payment system in which all the transactions are publicly accessible (but in an anonymous way). We downloaded the full history of this scheme, and analyzed many statistical properties of its associated transaction graph. In this paper we answer for the first time a variety of interesting questions about the typical behavior of users, how they acquire and how they spend their bitcoins, the balance of bitcoins they keep in their accounts, and how they move bitcoins between their various accounts in order to better protect their privacy. In addition, we isolated all the large transactions in the system, and discovered that almost all of them are closely related to a single large transaction that took place in November 2010, even though the associated users apparently tried to hide this fact with many strange looking long chains and fork-merge structures in the transaction graph.

Dorit Ron; Adi Shamir

280

A graph-separation theorem for quantum causal models  

E-Print Network [OSTI]

A causal model is an abstract representation of a physical system as a directed acyclic graph (DAG), where the statistical dependencies are encoded using a graphical criterion called `d-separation'. Recent work by Wood & Spekkens shows that causal models cannot, in general, provide a faithful representation of quantum systems. Since d-separation encodes a form of Reichenbach's Common Cause Principle (RCCP), whose validity is questionable in quantum mechanics, we propose a generalised graph separation rule that does not assume the RCCP. We prove that the new rule faithfully captures the statistical dependencies between observables in a quantum network, encoded as a DAG, and is consistent with d-separation in a classical limit. We note that the resulting model is still unable to give a faithful representation of correlations stronger than quantum mechanics, such as the Popescu-Rorlich box.

Jacques Pienaar; Caslav Brukner

2014-10-31T23:59:59.000Z

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


281

Energy Citations Database (ECD) - Widget  

Office of Scientific and Technical Information (OSTI)

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

282

Anual Energy Databases for Download  

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

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

283

LD-graphs and global location-domination in bipartite graphs  

Science Journals Connector (OSTI)

Abstract A dominating set S of a graph G is a locating-dominating-set, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality are called LD-codes and the cardinality of an LD-code is the location-domination number, ? ( G ) . An LD-set S of a graph G is global if it is an LD-set for both G and its complement, G . One of the main contributions of this work is the definition of the LD-graph, an edge-labeled graph associated to an LD-set, that will be very helpful to deduce some properties of location-domination in graphs. Concretely, we use LD-graphs to study the relation between the location-domination number in a bipartite graph and its complement.

C. Hernando; M. Mora; I.M. Pelayo

2014-01-01T23:59:59.000Z

284

Graph searching and a generalized parking function  

E-Print Network [OSTI]

introduced a new generalization, the G-multiparking function, where G is a simple graph on a totally ordered vertex set {1, 2, . . . , n}. We give an algorithm that converts a G-multiparking function into a rooted spanning forest of G by using a graph...

Kostic, Dimitrije Nenad

2009-05-15T23:59:59.000Z

285

Download Data | Transparent Cost Database  

Open Energy Info (EERE)

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

286

Biological & Environmental Research Abstracts Database  

Office of Scientific and Technical Information (OSTI)

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

287

Incremental elasticity for array databases  

E-Print Network [OSTI]

Relational databases benefit significantly from elasticity, whereby they execute on a set of changing hardware resources provisioned to match their storage and processing requirements. Such flexibility is especially ...

Duggan, Jennie

288

The Coal Transportation Rate Database  

Gasoline and Diesel Fuel Update (EIA)

Coal Transportation Rate Database (CTRDB) adds new data for 2000 and 2001. The Federal Energy Regulatory Commission's (FERC) Form 580 "interrogatories" are the primary source for...

289

Hydrogen Storage Materials Database Demonstration  

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

| Fuel Cell Technologies Program Source: US DOE 4252011 eere.energy.gov Hydrogen Storage Materials Database Demonstration FUEL CELL TECHNOLOGIES PROGRAM Ned Stetson Storage Tech...

290

Feature Tracking Using Reeb Graphs  

SciTech Connect (OSTI)

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

2010-08-02T23:59:59.000Z

291

Path Integral on Star Graph  

E-Print Network [OSTI]

In this paper we study path integral for a single spinless particle on a star graph with N edges, whose vertex is known to be described by U(N) family of boundary conditions. After carefully studying the free particle case, both at the critical and off-critical levels, we propose a new path integral formulation that correctly captures all the scale-invariant subfamily of boundary conditions realized at fixed points of boundary renormalization group flow. Our proposal is based on the folding trick, which maps a scalar-valued wave function on star graph to an N-component vector-valued wave function on half-line. All the parameters of scale-invariant subfamily of boundary conditions are encoded into the momentum independent weight factors, which appear to be associated with the two distinct path classes on half-line that form the cyclic group Z_2. We show that, when bulk interactions are edge-independent, these weight factors are generally given by an N-dimensional unitary representation of Z_2. Generalization to momentum dependent weight factors and applications to worldline formalism are briefly discussed.

Satoshi Ohya

2011-04-28T23:59:59.000Z

292

Path Integral on Star Graph  

E-Print Network [OSTI]

In this paper we study path integral for a single spinless particle on a star graph with N edges, whose vertex is known to be described by U(N) family of boundary conditions. After carefully studying the free particle case, both at the critical and off-critical levels, we propose new path integral formulation that correctly captures all the scale-invariant subfamily of boundary conditions realized at fixed points of boundary renormalization group flow. Our proposal is based on the folding trick, which maps a scalar-valued wave function on star graph to an N-component vector-valued wave function on half-line. All the parameters of scale-invariant subfamily of boundary conditions are encoded into the momentum independent weight factors, which appear to be associated with the two distinct path classes on half-line that form the cyclic group Z_2. We show that, when bulk interactions are edge-independent, these weight factors are generally given by an N-dimensional unitary representation of Z_2. Generalization to ...

Ohya, Satoshi

2011-01-01T23:59:59.000Z

293

NETL: Coal Gasification Systems  

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

Coal Gasification Systems News Gasifipedia Gasifier Optimization Feed Systems Syngas Processing Systems Analyses Gasification Plant Databases International Activity Program Plan...

294

Systems and Industry Analyses  

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

systems and industry analyses News Gasifipedia Gasifier Optimization Feed Systems Syngas Processing Systems Analyses Gasification Plant Databases International Activity Program...

295

Gasification Systems Project Portfolio  

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

2014 Gasification Systems Project Portfolio News Gasifipedia Gasifier Optimization Feed Systems Syngas Processing Systems Analyses Gasification Plant Databases International...

296

DOE Patents Database - FAQ's  

Office of Scientific and Technical Information (OSTI)

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?

297

DOE Patents Database - About  

Office of Scientific and Technical Information (OSTI)

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

298

Evaluation of Partial 16S Ribosomal DNA Sequencing for Identification of Nocardia Species by Using the MicroSeq 500 System with an Expanded Database  

Science Journals Connector (OSTI)

...MicroSeq 500 system (Applied BioSystems, Foster City, Calif...species (4). A study was done to...sequencing system with our expanded...MicroSeq 500 system. c See the...description. This study was in compliance...and D. L. Wheeler. 2003. GenBank...

Joann L. Cloud; Patricia S. Conville; Ann Croft; Dag Harmsen; Frank G. Witebsky; Karen C. Carroll

2004-02-01T23:59:59.000Z

299

CSP Techniques for Solving Combinatorial Queries within Relational Databases  

Science Journals Connector (OSTI)

A combinatorial query is a request for tuples from multiple relations that satisfy a conjunction of constraints on tuple attribute values. Managing combinatorial queries using the traditional database systems is ...

Malek Mouhoub; Chang Feng

2009-01-01T23:59:59.000Z

300

Speedy transactions in multicore in-memory databases  

E-Print Network [OSTI]

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

Tu, Stephen

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


301

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

E-Print Network [OSTI]

Integrated storage and querying of spatially varying data quality information in a relational Variation in Quality Keywords Spatial data quality; spatial database; relational database management system for storing and retrieving spatially varying data quality information in a relational spatial database. Rather

Duckham, Matt

302

TOWARDS UNIFYING DATABASE SCHEDULING AND  

E-Print Network [OSTI]

1 TOWARDS UNIFYING DATABASE SCHEDULING AND CONCURRENCY CONTROL: A FRONTIER APPROACH Gregory Jones previous work in real-time database concurrency control indexconcur- rency control and scheduling has focused on combiningvariations of traditional concurrency control techniques with real-time scheduling

Rhode Island, University of

303

TD Ameritrade suffers database hack  

Science Journals Connector (OSTI)

Online Brokerage TD Ameritrade has suffered a database hack. Client information such as addresses and phone numbers were accessed from the database. Although social security numbers, account numbers and date of birth details were within reach of the hacker, the sensitive information was left untouched according to Ameritrade.

2007-01-01T23:59:59.000Z

304

PARALLEL DATABASE MACHINES Kjell Bratbergsengen  

E-Print Network [OSTI]

by NFR formerly NTNF, Intel Norway AS, Eltron AS and Norwegian Telecom. 1 February 13, 1996 8:51 am #12 The Norwegian Institute of Technology University of Trondheim Email: kjellb@idt.unit.no Summary The idea and database servers for "new" data types, notably film and video. THE TRAUMATIC HISTORY OF DATABASE COMPUTERS

305

Federal Transit Administration-National Transit Database (NTD) | Open  

Open Energy Info (EERE)

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

306

Central Internet Database (CID) About the CID  

Office of Environmental Management (EM)

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.

307

Measuring extremal dependencies in Web graphs Yana Volkovich  

E-Print Network [OSTI]

Measuring extremal dependencies in Web graphs Yana Volkovich University of Twente P.O. Box 217 dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using of the proposed methods have never been applied to the Web graph data. This paper fills this gap. The new insights

Boucherie, Richard J.

308

Measuring Extremal Dependencies in Web Graphs Yana Volkovich  

E-Print Network [OSTI]

Measuring Extremal Dependencies in Web Graphs Yana Volkovich University of Twente P.O. Box 217 graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical of the proposed meth- ods have never been used in the Web graph data mining. The present work fills this gap

Boucherie, Richard J.

309

What Energy Functions Can Be Minimized via Graph Cuts?  

E-Print Network [OSTI]

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

Field, David

310

What Energy Functions can be Minimized via Graph Cuts?  

E-Print Network [OSTI]

What Energy Functions can be Minimized via Graph Cuts? Vladimir Kolmogorov and Ramin Zabih Computer. In the last few years, several new algorithms based on graph cuts have been developed to solve energy cut on the graph also minimizes the energy. Yet because these graph constructions are complex

Field, David

311

A Note on Hamilton Cycles in Kneser Graphs Ian Shields  

E-Print Network [OSTI]

A Note on Hamilton Cycles in Kneser Graphs Ian Shields IBM P.O. Box 12195 Research Triangle Park) have Hamilton cycles when n #20; 27. A similar result is shown for bipartite Kneser graphs. 1 for Hamilton cycles in Kneser graphs, K(n; k), and bipartite Kneser graphs, H(n; k). With the exception

Savage, Carla D.

312

Optimal acyclic edge colouring of grid like graphs  

Science Journals Connector (OSTI)

We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian product of d graphs each of which is an induced path or cycle. This class ... Keywords: Acyclic chromatic index, Acyclic edge colouring, Graph, Hypercube, Mesh

Rahul Muthu, N. Narayanan, C. R. Subramanian

2010-11-01T23:59:59.000Z

313

Discrete Mathematics Algebraic and Topological Methods in Graph Theory  

E-Print Network [OSTI]

symmetrical trivalent graphs which lead to negative currature carbon and bovon nitrie chemical structures. (D

Mohar, Bojan

314

Fibonacci-like cubes as Z-transformation graphs  

Science Journals Connector (OSTI)

The Fibonacci cube @C"n is a subgraph of n-dimensional hypercube induced by the vertices without two consecutive ones. Klavzar and Zigert [Fibonacci cubes are the resonance graphs of fibonaccenes, Fibonacci Quart. 43 (2005) 269-276] proved that Fibonacci ... Keywords: Fibonacci cube, Lucas cube, Perfect matching, Plane bipartite graph, Resonance graph, Z-transformation graph

Heping Zhang, Lifeng Ou, Haiyuan Yao

2009-04-01T23:59:59.000Z

315

Discrete Applied Mathematics 121 (2002) 139153 NeST graphs  

E-Print Network [OSTI]

Discrete Applied Mathematics 121 (2002) 139­153 NeST graphs Ryan B. Haywarda; , Paul E. Kearneyb; received in revised form 14 March 2001; accepted 26 March 2001 Abstract We establish results on NeST graphs show the equivalence of proper NeST graphs and unit NeST graphs, the equivalence of ÿxed distance NeST

Hayward, Ryan B.

316

Temporal Databases Status and Research Directions  

E-Print Network [OSTI]

these databases several thousand years and look up the (then current) grain harvest. Oral histories, e.g., Homer transaction time, recording a history of updates made to the database. Such a database supports rollback to a previous stored state of the database. An historical database supports valid time, recording a history

Snodgrass, Richard T.

317

Designing a Multi-Petabyte Database for LSST  

SciTech Connect (OSTI)

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

2007-01-10T23:59:59.000Z

318

A role for matrices in graph theory  

E-Print Network [OSTI]

A ROLE FOR MATRICES IN GRAPH THEORY A Thesis by John Patrick McLean Submitted to the Graduate College of Texas A&M University in partial fulfillment of the requirement for the degree of MASTER OF SCIENCE May 1971 Ma]or Subject: Mathematics... A ROLE FOR MATRICES IN GRAPH THEORY A Thesis by John Patrick McLean Approved as to style and content by: (Chairman of Committee) (Head of Department) I (Member) (Member) May 1971 tp Qey $ ABSTRACT A Role for Matrices in Graph Theory...

McLean, John Patrick

1971-01-01T23:59:59.000Z

319

Influence of geometry and topology of quantum graphs on their nonlinear optical properties  

Science Journals Connector (OSTI)

We analyze the nonlinear optics of quasi-one-dimensional quantum graphs and manipulate their topology and geometry to generate nonlinearities in a simple system approaching the fundamental limits of the first and second hyperpolarizabilities. We explore a huge configuration space in order to determine whether the fundamental limits may be approached for specific topologies, independent of molecular details, when the geometry is manipulated to maximize the intrinsic response. Changes in geometry result in smooth variations of the nonlinearities. Topological changes between geometrically similar systems cause profound changes in the nonlinear susceptibilities that include a discontinuity due to abrupt changes in the boundary conditions. We demonstrate the same universal scaling behavior for quantum graphs that is predicted for general quantum nonlinear optical systems near their fundamental limits, indicating that our results for quantum graphs may reflect general structure-property relationships for globally optimized nonlinear optical systems.

Rick Lytel; Shoresh Shafei; Julian H. Smith; Mark G. Kuzyk

2013-04-17T23:59:59.000Z

320

U-071:HP Database Archiving Software Bugs Let Remote Users Execute  

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

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:

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


321

U-071:HP Database Archiving Software Bugs Let Remote Users Execute  

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

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:

322

Energy Citations Database (ECD) - About  

Office of Scientific and Technical Information (OSTI)

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;

323

3-Rainbow Domination Number in Graphs  

Science Journals Connector (OSTI)

The k-rainbow domination is a location problem in operations research. Give an undirected graph G as the natural model of location problem. We have a set of k colors and assign an arbitrary subset of these col...

Kung-Jui Pai; Wei-Jai Chiu

2013-01-01T23:59:59.000Z

324

On semidefinite programming bounds for graph bandwidth  

E-Print Network [OSTI]

May 24, 2011 ... We propose two new lower bounds on graph bandwidth and cyclic ... matrix computations, parallel computations, VLSI layout, etc; see, for example [19]. ...... problems by SeDuMi [30] using the Yalmip interface [22] with Matlab.

2011-05-24T23:59:59.000Z

325

Graph Implementations for Nonsmooth Convex Programs  

E-Print Network [OSTI]

Summary. We describe graph implementations, a generic method for represent- ... object-oriented features of Matlab to turn it into an optimization modeling language: ..... For matrix and array expressions, these rules are applied on an elemen-.

2007-09-07T23:59:59.000Z

326

The Minimum Rank Problem for Outerplanar Graphs.  

E-Print Network [OSTI]

??Given a simple graph G with vertex set V(G)={1,2,...,n} define S(G) to be the set of all real symmetric matrices A such that for all (more)

Sinkovic, John Henry

2013-01-01T23:59:59.000Z

327

Minimum rank of graphs that allow loops.  

E-Print Network [OSTI]

??The traditional "minimum rank problem" for simple graphs associates a set of symmetric matrices, the zero-nonzero pattern of whose off-diagonal entries are described by the (more)

Mikkelson, Rana C.

2008-01-01T23:59:59.000Z

328

Hamilton Paths in Generalized Petersen Graphs.  

E-Print Network [OSTI]

??This thesis puts forward the conjecture that for n > 3k with k > 2, the generalized Petersen graph, GP(n,k) is Hamilton-laceable if n is (more)

Pensaert, William

2006-01-01T23:59:59.000Z

329

Progressive transitions using body part motion graphs  

Science Journals Connector (OSTI)

In this work we describe a preliminary method for progressive transitions in human locomotions. To achieve this, motion graphs have been used to synthesize body part transitions and every part has been synchronized with the other parts using time scaling. ...

Adso Fernndez-Baena; David Miralles

2011-12-01T23:59:59.000Z

330

A Faster Algorithm for Computing Motorcycle Graphs  

Science Journals Connector (OSTI)

We present a new algorithm for computing motorcycle graphs that runs in $$O(n^{4/3+\\varepsilon })$$O(n4/3+) time for any $$\\varepsilon >0$$>0, improving on all previously known algorithms. The main application of this result is to computing the straight ... Keywords: 65D18, 68Q25, 68U05, Algorithms design and analysis, Medial axis, Motorcycle graph, Polygon, Straight skeleton

Antoine Vigneron, Lie Yan

2014-10-01T23:59:59.000Z

331

About equivalent interval colorings of weighted graphs  

Science Journals Connector (OSTI)

Given a graph G=(V,E) with strictly positive integer weights @w"i on the vertices i@?V, a k-interval coloring of G is a function I that assigns an interval I(i)@?{1,...,k} of @w"i consecutive integers (called colors) to each vertex i@?V. If two adjacent ... Keywords: Equivalent colorings, Interval coloring problem, Weighted graphs

Mathieu Bouchard; Mirjana angalovi?; Alain Hertz

2009-10-01T23:59:59.000Z

332

Methods | Transparent Cost Database  

Open Energy Info (EERE)

information NREL has developed the following cost of energy tools: System Advisor Model (SAM): https:sam.nrel.gov SAM makes performance predictions and cost of...

333

REDD Country Activity Database | Open Energy Information  

Open Energy Info (EERE)

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

334

V-036: EMC Smarts Network Configuration Manager Database Authentication  

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

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

335

Database | OpenEI Community  

Open Energy Info (EERE)

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

336

Energy Citations Database (ECD) - Comments  

Office of Scientific and Technical Information (OSTI)

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

337

Introduction: Landslide Inventories and Databases  

Science Journals Connector (OSTI)

This is a short introduction to the Session B9 of the WLF3 entitled Inventory and Database with summarized overview of all contributions. Papers included in this part of the volume deals with landslide mappi...

Snjeana Mihali? Arbanas; Marko Komac

2014-01-01T23:59:59.000Z

338

Hydrogen Storage Materials Database Demonstration  

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

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

339

DOE Research and Development Accomplishments Database Browse  

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

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

340

Central Internet Database (CID) Related Links  

Office of Environmental Management (EM)

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

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


341

World electric power plants database  

SciTech Connect (OSTI)

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.

NONE

2006-06-15T23:59:59.000Z

342

NUCLEAR STRUCTURE DATABASE  

E-Print Network [OSTI]

records by end-of-record (EOR) marks. LBL system routines toseparated by end-of-record (EOR) marks. For missing A filesfor A and then INDEX(A,Z)-1 EOR marks to obtain the array

Firestone, R.B.

2010-01-01T23:59:59.000Z

343

Systems and Industry Analyses  

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

Gasifipedia Gasifier Optimization Feed Systems Syngas Processing Systems Analyses Gasification Plant Databases International Activity Program Plan Project Portfolio Project...

344

Gasification Systems Publications  

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

Gasifipedia Gasifier Optimization Feed Systems Syngas Processing Systems Analyses Gasification Plant Databases International Activity Program Plan Project Portfolio Project...

345

Gasification Systems Publications  

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

Publications News Gasifipedia Gasifier Optimization Feed Systems Syngas Processing Systems Analyses Gasification Plant Databases International Activity Program Plan Project...

346

Midcontinent Interactive Digital Carbon Atlas and Relational Database (MIDCARB)  

SciTech Connect (OSTI)

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

2002-06-01T23:59:59.000Z

347

Summary of Bugs Database Jeremy Kepner  

E-Print Network [OSTI]

written to create the current version of the bugs database. 1.2 Brief Project History Development1 Summary of Bugs Database Jeremy Kepner September, 1993 1. Introduction 1.1 Document Purpose of the Bugs database began in May of 1992. Initially, a very simple database model was used. By July

Kepner, Jeremy

348

Concept integration of document databases using different indexing languages  

Science Journals Connector (OSTI)

An integrated information retrieval system generally contains multiple databases that are inconsistent in terms of their content and indexing. This paper proposes a rough set-based transfer (RST) model for integration of the concepts of document databases using various indexing languages, so that users can search through the multiple databases using any of the current indexing languages. The RST model aims to effectively create meaningful transfer relations between the terms of two indexing languages, provided a number of documents are indexed with them in parallel. In our experiment, the indexing concepts of two databases respectively using the Thesaurus of Social Science (IZ) and the Schlagwortnormdatei (SWD) are integrated by means of the RST model. Finally, this paper compares the results achieved with a cross-concordance method, a conditional probability based method and the RST model.

Xueying Zhang

2006-01-01T23:59:59.000Z

349

Exporter Database | Data.gov  

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

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

350

Energy Citations Database (ECD) - FAQ  

Office of Scientific and Technical Information (OSTI)

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?

351

DOE Global Energy Storage Database  

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

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

352

Streaming Graph Computations with a Helpful Advisor  

E-Print Network [OSTI]

Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a powerful helper that can provide annotations to the data stream. We extend previous work on such {\\em annotation models} by considering a number of graph streaming problems. Without annotations, streaming algorithms for graph problems generally require significant memory; we show that for many standard problems, including all graph problems that can be expressed with totally unimodular integer programming formulations, only a constant number of hash values are needed for single-pass algorithms given linear-sized annotations. We also obtain a protocol achieving \\textit{optimal} tradeoffs between annotation length and memory usage for matrix-vector multiplication; this result contributes to a trend of recent research on numerical linear algebra in streaming models.

Cormode, Graham; Thaler, Justin

2010-01-01T23:59:59.000Z

353

About the Building Performance Database  

Broader source: Energy.gov [DOE]

Recent technology, market and policy drivers - smart meters, energy performance disclosure laws, etc. - are resulting in a rapid increase in generation of data about buildings and their energy performance. But this data is still hard to access, and analyze because it is being housed in many decentralized and often proprietary databases. The DOE Building Performance Database (BPD) aims to bridge this gap by compiling and cleansing a large dataset required to assess the likely performance of energy efficiency retrofit measures and services. By making the data available anonymously and in aggregate, the BPD enables the public to gain value from the data while addressing the privacy needs of contributors.

354

An efficient semidefinite programming relaxation for the graph ...  

E-Print Network [OSTI]

The general graph partition problem (GPP) is defined as follows. Let G = (V ... We denote by A the adjacency matrix of G. For a given partition of the graph into k.

2012-08-28T23:59:59.000Z

355

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network [OSTI]

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications, Berkeley Spring 1998 #12; Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications Copyright © 1998 by Michael Cameron Williamson #12; 1 Abstract Synthesis of Parallel Hardware

356

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network [OSTI]

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications, Berkeley Spring 1998 #12;Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications Copyright © 1998 by Michael Cameron Williamson #12;1 Abstract Synthesis of Parallel Hardware

357

Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP  

Science Journals Connector (OSTI)

We study the resolution complexity of Tseitin formulas over arbitrary rings in terms of combinatorial properties of graphs. We give some evidence that an expansion of a graph is a good characterization of the ...

Dmitry Itsykson; Vsevolod Oparin

2013-01-01T23:59:59.000Z

358

Graph isomorphism and adiabatic quantum computing  

Science Journals Connector (OSTI)

In the graph isomorphism (GI) problem two N-vertex graphs G and G? are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G?G?. If yes, then G and G? are said to be isomorphic; otherwise they are nonisomorphic. The GI problem is an important problem in computer science and is thought to be of comparable difficulty to integer factorization. In this paper we present a quantum algorithm that solves arbitrary instances of GI and which also provides an approach to determining all automorphisms of a given graph. We show how the GI problem can be converted to a combinatorial optimization problem that can be solved using adiabatic quantum evolution. We numerically simulate the algorithm's quantum dynamics and show that it correctly (i) distinguishes nonisomorphic graphs; (ii) recognizes isomorphic graphs and determines the permutation(s) that connect them; and (iii) finds the automorphism group of a given graph G. We then discuss the GI quantum algorithm's experimental implementation, and close by showing how it can be leveraged to give a quantum algorithm that solves arbitrary instances of the NP-complete subgraph isomorphism problem. The computational complexity of an adiabatic quantum algorithm is largely determined by the minimum energy gap ?(N) separating the ground and first-excited states in the limit of large problem size N?1. Calculating ?(N) in this limit is a fundamental open problem in adiabatic quantum computing, and so it is not possible to determine the computational complexity of adiabatic quantum algorithms in general, nor consequently, of the specific adiabatic quantum algorithms presented here. Adiabatic quantum computing has been shown to be equivalent to the circuit model of quantum computing, and so development of adiabatic quantum algorithms continues to be of great interest.

Frank Gaitan and Lane Clark

2014-02-28T23:59:59.000Z

359

Towards general information theoretical representations of database problems  

SciTech Connect (OSTI)

General database systems are described from the General Systems Theoretical (GST) framework. In this context traditional information theoretical (statistical) and general information theoretical (fuzzy measure and set theoretical, possibilistic, and random set theoretical) representations are derived. A preliminary formal framework is introduced.

Joslyn, C.

1997-06-01T23:59:59.000Z

360

Entanglement of graph states up to 8 qubits  

E-Print Network [OSTI]

The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146 local inequivalent graphs are classified as two categories: graphs with identical upper LOCC entanglement bound and lower bipartite entanglement bound, graphs with unequal bounds. The late may displays non-integer entanglement. The precision of iteration calculation of the entanglement is less than $10^{-14}$.

Xiao-yu Chen

2009-09-09T23:59:59.000Z

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


361

DOE Patents Database - Home  

Office of Scientific and Technical Information (OSTI)

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

362

DOE Patents Database - Innovations  

Office of Scientific and Technical Information (OSTI)

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

363

Using active database techniques for an advanced alarm processing  

SciTech Connect (OSTI)

An Advanced Alarm System (AAS) is primarily a digital system employing advanced alarm process logics and a VDU (Visual Display Unit) based control and display for the alarms. Active Database Systems (ADSs) are able to monitor a special situation represented by an event and one or more conditions. When the event occurs and the conditions are evaluated as true, the corresponding actions are executed. Hence, ADSs can recognize specific situations and react to them without direct explicit user or application requests. ADSs are very useful for timely applications such as the advanced, alarm processing. This paper proposes a new approach to the advanced alarm processing by using Event-Condition- Action(ECA) rules that can be automatically triggered by an active database. And this paper describes the design considerations and solution plan for advanced alarm processing by using active database techniques. (authors)

Jang, G. S. [I and C HFE Dept., Korea Atomic Energy Research Inst., 150, Duckjin-dong, Yusung-ku, Daejeon 305-353 (Korea, Republic of); Seong, D. H. [Samchang Enterprise Co., LTD, 974-1, Goyean-ri, Ulju-gun, Ulsan, 689-871 (Korea, Republic of); Keum, J. Y.; Park, H. Y. [I and C HFE Dept., Korea Atomic Energy Research Inst., 150, Duckjin-dong, Yusung-ku, Daejeon 305-353 (Korea, Republic of); Kim, Y. K. [Dept. of Computer Science, Chungnam National Univ., Daejeon, 305-764 (Korea, Republic of)

2006-07-01T23:59:59.000Z

364

A survey of models of the web graph Anthony Bonato  

E-Print Network [OSTI]

A survey of models of the web graph Anthony Bonato Department of Mathematics Wilfrid Laurier University Waterloo, ON Canada, N2L 3C5 abonato@rogers.com Abstract. The web graph has been the focus of much rigorously. 1 Introduction The web graph W has nodes representing web pages, and edges rep- resenting

Bonato, Anthony

365

Comparison of coarsening schemes for multilevel graph partitioning  

E-Print Network [OSTI]

Comparison of coarsening schemes for multilevel graph partitioning C´edric Chevalier1 and Ilya Laboratory, Argonne, IL, USA, safro@mcs.anl.gov Abstract. Graph partitioning is a well-known optimization as a process of graph topology learning at different scales in order to generate a better approx- imation

Safro, Ilya

366

On minimum balanced bipartitions of triangle-free graphs  

Science Journals Connector (OSTI)

A balanced bipartition of a graph G is a partition of V(G) into two subsets V 1 and V 2 that differ in cardinality by at most 1. A minimum balanced bipartition of G ... Keywords: Balanced bipartition, Planar graphs, Triangle-free graphs

Haiyan Li; Yanting Liang; Muhuo Liu; Baogang Xu

2014-04-01T23:59:59.000Z

367

Hiroshi Ishikawa A Practical Introduction to Graph Cut  

E-Print Network [OSTI]

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

368

Hamiltonian Cycles on Symmetrical Graphs Carlo H. Squin  

E-Print Network [OSTI]

Hamiltonian Cycles on Symmetrical Graphs Carlo H. Séquin Computer Science Division, EECS Department-connected symmetrical graphs are colored so that they form Hamiltonian cycles. As an introduction we discuss is to color all edges in these graphs with multi- ple congruent copies of Hamiltonian cycles exhibiting

O'Brien, James F.

369

Infinite Hamilton Cycles in Squares of Locally Finite Graphs  

E-Print Network [OSTI]

Infinite Hamilton Cycles in Squares of Locally Finite Graphs Agelos Georgakopoulos Abstract We prove Diestel's conjecture that the square G2 of a 2-connected locally finite graph G has a Hamilton if and only if they have distance at most n in G. A Hamilton cycle in a graph is a cycle containing all its

Diestel, Reinhard

370

Robust Self-assembly of Graphs Stanislav Angelov1  

E-Print Network [OSTI]

Robust Self-assembly of Graphs Stanislav Angelov1 , Sanjeev Khanna2 , and Mirk´o Visontai3 1 Google, University of Pennsylvania Philadelphia, PA 19104, USA mirko@math.upenn.edu Abstract. Self-assembly studied model of self-assembly is the Accretive Graph Assembly Model whereby an edge-weighted graph

Pennsylvania, University of

371

Simultaneous Segmentation and Filtering via Reduced Graph Cuts  

E-Print Network [OSTI]

provides small graphs while preserving thin structures but do not offer low memory usage when the amount [7,4,13]. In [7], binary energy functions are minimized for the shape fitting problem with graph cutsSimultaneous Segmentation and Filtering via Reduced Graph Cuts N. Lermé F. Malgouyres LAGA UMR CNRS

Malgouyres, François

372

Cellular Algebras and Graph Invariants Based on Quantum Walks  

E-Print Network [OSTI]

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

Jamie Smith

2011-03-01T23:59:59.000Z

373

EFFECTIVE RESISTANCE ON GRAPHS AND THE EPIDEMIC QUASIMETRIC  

E-Print Network [OSTI]

EFFECTIVE RESISTANCE ON GRAPHS AND THE EPIDEMIC QUASIMETRIC JOSH ERICSON, PIETRO POGGI distance, effective resistance, and modulus of path families. 1. Introduction Consider a finite contact into "natural" communities. We begin with some preliminaries on elementary graph theory. 2. Graphs 2.1. Notation

Poggi-Corradini, Pietro

374

Bicycles and Left-Right Tours in Locally Finite Graphs  

E-Print Network [OSTI]

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

Diestel, Reinhard

375

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

E-Print Network [OSTI]

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

Morgan, Scott Edwin

2005-11-01T23:59:59.000Z

376

Challenge to British forensic database  

Science Journals Connector (OSTI)

... London THE British civil rights group Liberty is seeking to take London's Metropolitan Police to the European Court of Human Rights ... Court of Human Rights, questioning the legality of its database of DNA fingerprinting results. Liberty's argument turns on the case of Roy Williams, a man questioned during a ...

Peter Aldhous

1992-01-16T23:59:59.000Z

377

Building Performance Database Analysis Tools  

Broader source: Energy.gov [DOE]

The BPD statistically analyzes the energy performance and physical and operational characteristics of real commercial and residential buildings. The Buildings Performance Database offers two primary methods to analyze building performance data. These are Explore, which allows users to browse a single dataset within the BPD, and Compare, which allowed users to compare multiple datasets within the BPD side-by-side.

378

View discovery in OLAP databases through statistical combinatorial optimization  

SciTech Connect (OSTI)

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

2009-01-01T23:59:59.000Z

379

Design and Verification of Instantiable Compliance Rule Graphs in Process-Aware  

E-Print Network [OSTI]

against imposed compliance rules. Tab. 1 summarizes quality compliance rules imposed on the software. Nevertheless, for quality assurance, it could be desired to verify c2 over the development process. ThusDesign and Verification of Instantiable Compliance Rule Graphs in Process-Aware Information Systems

Pfeifer, Holger

380

Operation database: Upcoming series to examine data handling  

SciTech Connect (OSTI)

The key issue in any exploration and production software application is the data and the subsequent handling of the data. This fact is becoming increasingly well-known to the petroleum computing community. In 1985 and 1986, CEED I and II conferences in Denver addressed the application side of various systems but really never touched on the issue of data handling. This was one of CEED's shortcomings, but the systems at that time were somewhat primitive toward database considerations. With this issue in mind, a select group of representatives from a cross-section of the petroleum industry was chosen to provide an evaluation of database applications. Results will appear in future issues.

Leonard, J.E.

1988-08-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


381

WTO Subsidy Notifications Database | Open Energy Information  

Open Energy Info (EERE)

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

382

Parameterized Algorithms for Graph Partitioning Problems  

E-Print Network [OSTI]

) time algorithm for any FGPP. Parameterized by p, Max and Min k-Vertex Cover can be solved in times O (1Parameterized Algorithms for Graph Partitioning Problems Hadas Shachnai and Meirav Zehavi are constants defining the problem, and m1, m2 are the cardinalities of the edge sets having both endpoints

Shachnai, Hadas

383

Algorithms for Graphs (Locally) Bounded Treewidth  

E-Print Network [OSTI]

set, vertex cover and independent set. Others used this approach to solve other NP-hard problemsAlgorithms for Graphs of (Locally) Bounded Treewidth by MohammadTaghi Hajiaghayi A thesis presented-hard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness

Hajiaghayi, Mohammad

384

Graph Domination, Coloring and Cliques in Telecommunications  

E-Print Network [OSTI]

Graph Domination, Coloring and Cliques in Telecommunications Balabhaskar Balasundaram and Sergiy for important problems that arise in different areas of wireless telecommunication. In particular, applications The telecommunication industry has always been a host for a wide variety of optimization problems. In recent years

Butenko, Sergiy

385

Optimizing Path Query Performance: Graph Clustering Strategies  

E-Print Network [OSTI]

ywh@us.ibm.com Ning Jingz Changsha Institute of Technology jning@eecs.umich.edu Elke A. Rundensteinerx not incur any run-time cost, requires no auxiliary data structures, and is complimentary to many of the performance of these graph clustering techniques using an actual city road network as well as randomly

386

Connected obstructions to full graph homomorphisms  

Science Journals Connector (OSTI)

Minimal obstructions to full homomorphisms to a graph B have been proved to be of size at most |B|+1. This turns out to require that disconnected obstructions be allowed. In this paper we prove that the size of minimal connected obstructions is at most ...

Pavol Hell, Ale Pultr

2014-10-01T23:59:59.000Z

387

Betti Numbers of Graph Sean Jacques  

E-Print Network [OSTI]

ii Betti Numbers of Graph Ideals Sean Jacques Thesis submitted to the University of She but there are formulae for finding the Betti numbers (part of the information which comprises a minimal free resolution especially explicit or useful descriptions of the Betti numbers. However we restrict our attention to those

Katzman, Moty

388

Graph-Theoretic Scagnostics Leland Wilkinson  

E-Print Network [OSTI]

Tukey and Tukey scagnostics and develop graph- theoretic methods for implementing their procedure, statistical graphics 1 INTRODUCTION Around 20 years ago, John and Paul Tukey developed an ex- ploratory of the method were never published. Paul Tukey did offer more detail at an IMA visualization workshop a few

Grossman, Robert

389

NEST REPRESENTATIONS OF DIRECTED GRAPH ALGEBRAS  

E-Print Network [OSTI]

NEST REPRESENTATIONS OF DIRECTED GRAPH ALGEBRAS KENNETH R. DAVIDSON AND ELIAS KATSOULIS Abstract. This paper is a comprehensive study of the nest rep- resentations for the free semigroupoid algebra LG that the finite dimensional nest representations sep- arate the points in LG, and a fortiori, in T + (G

Katsoulis, Elias G.

390

Senbazuru: A Prototype Spreadsheet Database Management System  

E-Print Network [OSTI]

component is composed of a background extraction pipeline that automatically obtains relational data from spreadsheets, and a repair interface that allows users to manually repair extraction errors. � Tuple Builder on a probabilistic model. Before Repair: ''White, total'' After Repair: ''White, total'' Framework Repair

Michigan, University of

391

Coal Power Plant Database | Open Energy Information  

Open Energy Info (EERE)

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

392

Montana 310 Permit Database | Open Energy Information  

Open Energy Info (EERE)

Permit Database Jump to: navigation, search OpenEI Reference LibraryAdd to library Web Site: Montana 310 Permit Database Abstract Provides access to Montana's 310 permit mapping...

393

GDB - Human Genome Database final report  

SciTech Connect (OSTI)

This is the DOE final report for the GDB, Human Genome Database, project at the Johns Hopkins University.

Talbot, C. Conover, Jr.

2002-01-08T23:59:59.000Z

394

Webinar: Hydrogen Storage Materials Database Demonstration  

Broader source: Energy.gov [DOE]

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

395

Energy Citations Database (ECD) - Architecture  

Office of Scientific and Technical Information (OSTI)

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

396

Energy Citations Database (ECD) - Availability  

Office of Scientific and Technical Information (OSTI)

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

397

The Majorana Parts Tracking Database  

E-Print Network [OSTI]

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

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

2015-01-01T23:59:59.000Z

398

The Majorana Parts Tracking Database  

E-Print Network [OSTI]

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

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

2015-02-05T23:59:59.000Z

399

Technical Database | OpenEI  

Open Energy Info (EERE)

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)

400

A PriorityBased Scheduling Algorithm for RealTime Databases Sang H. Son  

E-Print Network [OSTI]

Science University of Virginia Charlottesville, Virginia 22903, USA Seog Park Department of Computer Science Sogang University Seoul, Korea ABSTRACT Database systems for real­time applications must satisfy integrated manufacturing, aerospace, traffic control systems, nuclear power plants, robotics, military

Son, Sang H.

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


401

The Impact of Databases on Knowledge Transfer: Simulation Providing Craig Schreiber  

E-Print Network [OSTI]

Management, Knowledge Transfer, Organizational Learning, Transactive Memory, Databases, Information and Organizational Systems Carnegie Mellon University Pittsburgh, Pennsylvania 15213 Abstract of Social and Organizational Systems Carnegie Mellon University Wean Hall 1325 Pittsburgh, Pennsylvania

Sadeh, Norman M.

402

DOE Science Showcase - Featured Climate Change Research from DOE Databases  

Office of Scientific and Technical Information (OSTI)

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

403

Webinar: NREL's Fuel Cell Contaminant Database | Department of...  

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

NREL's Fuel Cell Contaminant Database Webinar: NREL's Fuel Cell Contaminant Database Below is the text version of the webinar titled "NREL's Fuel Cell Contaminant Database,"...

404

Buildings Performance Database - Datasets - OpenEI Datasets  

Open Energy Info (EERE)

Buildings Performance Database Dataset Activity Stream Buildings Performance Database The Buildings Performance Database (BPD) unlocks the power of building energy performance...

405

SUN Attribute Database: Discovering, Annotating, and Recognizing Scene Attributes  

E-Print Network [OSTI]

SUN Attribute Database: Discovering, Annotating, and Recognizing Scene Attributes Genevieve attributes. Next, we build the "SUN attribute database" on top of the diverse SUN categorical database. Our

Hays, James

406

Geological and geotechnical databases and developments  

E-Print Network [OSTI]

Geological and geotechnical databases and developments in the Netherlands Robert Hack & Wiebke Tegtmeier Namur, Belgium, 9 October 2007 #12;9 October 2007 Geological and geotech databases in NL - Hack 2007 Geological and geotech databases in NL - Hack & Tegtmeier 3 Surface data: · Climate · Vegetation

Hack, Robert

407

Supporting Database Provenance under Schema Evolution  

E-Print Network [OSTI]

,11] have significantly simplified the problems of preserving the history of the database schemaSupporting Database Provenance under Schema Evolution Shi Gao and Carlo Zaniolo University of California, Los Angeles {gaoshi, zaniolo}@cs.ucla.edu Abstract. Database schema upgrades are common in modern

Zaniolo, Carlo

408

NICMOS HISTORY DATABASE AND April 10, 1998  

E-Print Network [OSTI]

1 NICMOS HISTORY DATABASE AND WEB TOOLS C. Tullos April 10, 1998 ABSTRACT The history of NICMOS. The Database and Data A convenient way of keeping a history of some of the NICMOS instrument parameters parameters apply. Instrument Science Report OSG-CAL 98-01 #12;2 NICMOS HISTORY DATABASE LAYOUT 2. The Web

Sirianni, Marco

409

MIDCONTINENT INTERACTIVE DIGITAL CARBON ATLAS AND RELATIONAL DATABASE (MIDCARB)  

SciTech Connect (OSTI)

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.

Timothy R. Carr; Scott W. White

2003-07-01T23:59:59.000Z

410

Using Heuristic Algorithms to Effectively Schedule Database Utilities*  

E-Print Network [OSTI]

1 Using Heuristic Algorithms to Effectively Schedule Database Utilities* Zusheng Xu and Patrick systems (DBMSs). Data maintenance utilities ensure that the data in tables are stored as efficiently as possible so executing the utilities is crucial to preventing applications from suffering major performance

411

Density Functional Theory-Based Database Development and CALPHAD Automation  

E-Print Network [OSTI]

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

Chen, Long-Qing

412

A typed higher-order calculus for querying XML databases  

Science Journals Connector (OSTI)

As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the relational data model first-order logic, i.e. the Relational Calculus turned ... Keywords: eXten-sible markup language, higher-order logic, object model, query language, type system

Qing Wang; Klaus-Dieter Schewe

2008-01-01T23:59:59.000Z

413

U-233: Oracle Database INDEXTYPE CTXSYS.CONTEXT Bug Lets Remote  

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

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, 11.1.0.7, 11.2.0.2, 11.2.0.3 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

414

Evaluating parallel relational databases for medical data analysis.  

SciTech Connect (OSTI)

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.

2012-03-01T23:59:59.000Z

415

Quantum graph as a quantum spectral filter  

SciTech Connect (OSTI)

We study the transmission of a quantum particle along a straight input-output line to which a graph {Gamma} is attached at a point. In the point of contact we impose a singularity represented by a certain properly chosen scale-invariant coupling with a coupling parameter {alpha}. We show that the probability of transmission along the line as a function of the particle energy tends to the indicator function of the energy spectrum of {Gamma} as {alpha}{yields}{infinity}. This effect can be used for a spectral analysis of the given graph {Gamma}. Its applications include a control of a transmission along the line and spectral filtering. The result is illustrated with an example where {Gamma} is a loop exposed to a magnetic field. Two more quantum devices are designed using other special scale-invariant vertex couplings. They can serve as a band-stop filter and as a spectral separator, respectively.

Turek, Ondrej; Cheon, Taksu [Laboratory of Physics, Kochi University of Technology, Tosa Yamada, Kochi 782-8502 (Japan)] [Laboratory of Physics, Kochi University of Technology, Tosa Yamada, Kochi 782-8502 (Japan)

2013-03-15T23:59:59.000Z

416

V-016: HP Performance Insight Bugs with Sybase Database Let Remote Users  

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

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:

417

Overview of selected molecular biological databases  

SciTech Connect (OSTI)

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

Rayl, K.D.; Gaasterland, T.

1994-11-01T23:59:59.000Z

418

A Parallel Graph Partitioner for STAPL  

E-Print Network [OSTI]

A PARALLEL GRAPH PARTITIONER FOR STAPL A Thesis by NICOLAS CASTET Submitted to the O ce of Graduate Studies of Texas A&M University in partial ful llment of the requirements for the degree of MASTER OF SCIENCE Approved by: Chair... of Committee, Nancy M. Amato Co-Chair of Committee, Lawrence Rauchwerger Committee Member, Marvin L. Adams Department Head, Duncan M. Walker May 2013 Major Subject: Computer Science Copyright 2013 Nicolas Castet ABSTRACT Multi-core architectures...

Castet, Nicolas

2013-04-26T23:59:59.000Z

419

Database Archiving: How to Keep Lots of Data for a Very Long Time, 1st edition  

Science Journals Connector (OSTI)

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

2008-11-01T23:59:59.000Z

420

Database Requirements for Workflow Management in a HighThroughput Genome Laboratory 1  

E-Print Network [OSTI]

Database Requirements for Workflow Management in a High­Throughput Genome Laboratory 1 Anthony J and operationally efficient. A key component of this software is a database management system (DBMS) for controlling constitutes an audit trail, or event history, and has much the same function as a laboratory notebook

Bonner, Anthony

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


421

View Discovery in OLAP Databases through Statistical Combinatorial Optimization  

SciTech Connect (OSTI)

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.

Joslyn, Cliff A.; Burke, Edward J.; Critchlow, Terence J.

2009-05-01T23:59:59.000Z

422

Enhancing the DNA Patent Database  

SciTech Connect (OSTI)

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.

2008-02-18T23:59:59.000Z

423

Materials Inventory Database for the Light Water Reactor Sustainability Program  

SciTech Connect (OSTI)

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

2013-08-01T23:59:59.000Z

424

Object Management Systems  

E-Print Network [OSTI]

Object-Oriented Database Management Systems for EngineeringR. Cassel. Distribution Management Systems: Functions and8-PWR 1988. Network Management Systems 52 Subodh Bapat.

Gollu, Aleks Ohannes

1995-01-01T23:59:59.000Z

425

Locating-total domination in claw-free cubic graphs  

Science Journals Connector (OSTI)

In this paper, we continue the study of locating-total domination in graphs. A set S of vertices of a graph G is a total dominating set of G if every vertex of G is adjacent to a vertex in S . We consider total dominating sets S which have the additional property that distinct vertices in V ( G ) ? S are totally dominated by distinct subsets of the total dominating set. Such a set S is called a locating-total dominating set in G , and the locating-total domination number of G is the minimum cardinality of a locating-total dominating set in G . A claw-free graph is a graph that does not contain K 1 , 3 as an induced subgraph. We show that the locating-total domination number of a claw-free cubic graph is at most one-half its order and we characterize the graphs achieving this bound.

Michael A. Henning; Christian Lwenstein

2012-01-01T23:59:59.000Z

426

CONCEPTUAL DATA MODELING OF THE INTEGRATED DATABASE FOR THE RADIOACTIVE WASTE MANAGEMENT  

SciTech Connect (OSTI)

A study of a database system that can manage radioactive waste collectively on a network has been carried out. A conceptual data modeling that is based on the theory of information engineering (IE), which is the first step of the whole database development, has been studied to manage effectively information and data related to radioactive waste. In order to establish the scope of the database, user requirements and system configuration for radioactive waste management were analyzed. The major information extracted from user requirements are solid waste, liquid waste, gaseous waste, and waste related to spent fuel. The radioactive waste management system is planning to share information with associated companies.

Park, H.S; Shon, J.S; Kim, K.J; Park, J.H; Hong, K.P; Park, S.H

2003-02-27T23:59:59.000Z

427

Sharp thresholds for Hamiltonicity in random intersection graphs  

Science Journals Connector (OSTI)

Random Intersection Graphs, G"n","m","p, is a class of random graphs introduced in Karonski (1999) [7] where each of the n vertices chooses independently a random subset of a universal set of m elements. Each element of the universal sets is chosen independently ... Keywords: Hamilton cycles, Random intersection graph, Sharp threshold, Stochastic order relation between Gn,p and Gn,m,p

Charilaos Efthymiou; Paul G. Spirakis

2010-09-01T23:59:59.000Z

428

k-Boson Quantum Walks Do Not Distinguish Arbitrary Graphs  

E-Print Network [OSTI]

In this paper, we define k-equivalence, a relation on graphs that relies on their associated cellular algebras. We show that a k-Boson quantum walk cannot distinguish pairs of graphs that are k- equivalent. The existence of pairs of k-equivalent graphs has been shown by Ponomarenko et al. [2, 6]. This gives a negative answer to a question posed by Gamble et al. [7].

Jamie Smith

2010-04-01T23:59:59.000Z

429

Ising-like models on arbitrary graphs : the Hadamard way  

E-Print Network [OSTI]

We propose a generic framework to analyse classical Ising-like models defined on arbitrary graphs. The energy spectrum is shown to be the Hadamard transform of a suitably defined vector associated with the graph. This allows a quick computation of this spectrum owing to the existence of a fast Hadamard transform algorithm (used for instance in image ccompression processes). We than go further and apply this formalism to regular graphs, such as hypercubic graphs, for which a simple recurrence relation for the spectrum is given, which speeds up even more its determination. First attempts to analyse partition functions and transfer matrices are also discussed.

Mosseri, Rmy

2014-01-01T23:59:59.000Z

430

Computing the stability number of a graph via linear and ...  

E-Print Network [OSTI]

Throughout the paper A(G) ? Sn will denote the adjacency matrix of the graph G, that is, the (i, ..... Some matlab code that constructs the relevant semidefi-.

2006-04-27T23:59:59.000Z

431

Independent set problems and odd-hole-preserving graph reductions  

E-Print Network [OSTI]

to provide a polynomial-time reduction in the size of the input required to decide the perfection or imperfection of a graph....

Warren, Jeffrey Scott

2009-05-15T23:59:59.000Z

432

Polyhedral graph abstractions and an approach to the Linear Hirsch ...  

E-Print Network [OSTI]

March 17, 2011. Abstract. We introduce a new combinatorial abstraction for the graphs of polyhe- dra. The new abstraction is a flexible framework defined by...

2011-03-17T23:59:59.000Z

433

Isomorphism testing for circulant graphs Cn(a, b)  

E-Print Network [OSTI]

Isomorphism testing for circulant graphs Cn(a, b). Sara Nicoloso ?. Ugo Pietropaoli . March 10, 2010. Abstract. In this paper we focus on connected...

2010-03-10T23:59:59.000Z

434

A notable family of entire intrinsic minimal graph...  

E-Print Network [OSTI]

to C1(O). This notion of C2 surface obviously includes the entire intrinsic graphs ...... F. Serra Cassano, Surface measures in Carnot-Carathodory spaces, Calc.

2006-09-09T23:59:59.000Z

435

The Visualization of Large Database in Stock Market Li Lin, Longbing Cao, Chengqi Zhang  

E-Print Network [OSTI]

and global trend with fish- eye technology. Second, for the result graph, there are many parameters, so we; Fish-eye view; Local details; Global trends; Dimension reducing 1. Introduction In stock market another problem for a trading system. In the paper, we have resolved the two problems with fish- eye

Cao, Longbing

436

Buildings Performance Database | OpenEI  

Open Energy Info (EERE)

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)

437

Life Cycle Inventory Database | Department of Energy  

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

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

438

Nuclear Concrete Materials Database Phase I Development  

SciTech Connect (OSTI)

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

2012-05-01T23:59:59.000Z

439

Graphs are among the most important abstract data structures in computer sci-ence, and the algorithms that operate on them are critical to modern life. Graphs  

E-Print Network [OSTI]

description that assumes a sparse matrix representation of the graph, and operates on that matrix with linear environments (e.g., Matlab ). (2) Ease of implementation. Parallel graph algorithms are notoriously difficult computation of graph algorithms. (3) Performance. Graph algorithms expressed by a series of sparse matrix

Kepner, Jeremy

440

Evaluation of database technologies for the CTBT Knowledge Base prototype  

SciTech Connect (OSTI)

This document examines a number of different software technologies in the rapidly changing field of database management systems, evaluates these systems in light of the expected needs of the Comprehensive Test Ban Treaty (CTBT) Knowledge Base, and makes some recommendations for the initial prototypes of the Knowledge Base. The Knowledge Base requirements are examined and then used as criteria for evaluation of the database management options. A mock-up of the data expected in the Knowledge Base is used as a basis for examining how four different database technologies deal with the problems of storing and retrieving the data. Based on these requirement and the results of the evaluation, the recommendation is that the Illustra database be considered for the initial prototype of the Knowledge Base. Illustra offers a unique blend of performance, flexibility, and features that will aid in the implementation of the prototype. At the same time, Illustra provides a high level of compatibility with the hardware and software environments present at the US NDC (National Data Center) and the PIDC (Prototype International Data Center).

Keyser, R.; Shepard-Dombroski, E.; Baur, D.; Hipp, J.; Moore, S.; Young, C.; Chael, E.

1996-11-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


441

Transparent Cost Database | Open Energy Information  

Open Energy Info (EERE)

Transparent Cost Database Transparent Cost Database Jump to: navigation, search Tool Summary LAUNCH TOOL Name: Transparent Cost Database Agency/Company /Organization: Department of Energy Partner: National Renewable Energy Laboratory Sector: Energy Focus Area: Renewable Energy, Solar, Transportation Topics: Baseline projection, Low emission development planning, -LEDS, Resource assessment, Technology characterizations Resource Type: Dataset, Lessons learned/best practices, Software/modeling tools User Interface: Website Web Application Link: en.openei.org/apps/TCDB/ Cost: Free OpenEI Keyword(s): Featured Equivalent URI: cleanenergysolutions.org/content/united-states-transparent-cost-databa Language: English The Transparent Cost Database collects program cost and performance

442

Buildings Performance Database Recommended Data Fields  

Broader source: Energy.gov [DOE]

Buildings Performance Database Recommended Data Fields, from the U.S. Department of Energy's Office of Energy Efficiency and Renewable Energy.

443

X-RAY MICROBEAM SPEECH PRODUCTION DATABASE  

E-Print Network [OSTI]

X-RAY MICROBEAM SPEECH PRODUCTION DATABASE USER'S HANDBOOK Version 1.0 (June 1994) prepared by John . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Chapter Two: XRMB History

444

Lessons Learned Database | Department of Energy  

Energy Savers [EERE]

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

445

Dynameomics Database of Molecular Dynamics Simulations Project...  

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

in determining protein behavior and function. Accomplishments: Over 11,000 protein folding simulations are now available in the world's largest public database of protein...

446

NAMA Database Wiki | Open Energy Information  

Open Energy Info (EERE)

be undertaken within the NAMA framework. The NAMA Database is an open platform for collaboration and knowledge-sharing. References Retrieved from "http:en.openei.orgw...

447

Estimates of Embodied Global Energy and Air-Emission Intensities of Japanese Products for Building a Japanese InputOutput Life Cycle Assessment Database with a Global System Boundary  

Science Journals Connector (OSTI)

To build a life cycle assessment (LCA) database of Japanese products embracing their global supply chains in a manner requiring lower time and labor burdens, this study estimates the intensity of embodied global environmental burden for commodities produced in Japan. ... This sector is followed by several food- and agriculture-related sectors such as seeds and seedlings (JD11) (?57%), flour and other grain mill products (JD47) (?52%), timber (JD90) (?52%), and Feeds (JD72) (?51%). ...

Keisuke Nansai; Yasushi Kondo; Shigemi Kagawa; Sangwon Suh; Kenichi Nakajima; Rokuta Inaba; Susumu Tohno

2012-08-10T23:59:59.000Z

448

Energy Citations Database (ECD) - Help  

Office of Scientific and Technical Information (OSTI)

Help Help Alerts Basic Search Fielded Search - Sorting - Term searching - Author select - Subject select - Limit to - Date searching Search Tips - General - Case sensitivity - Drop-down menus - Report number searching - Wildcard operators - Phrase/adjacent term searching - Boolean Technical Requirements Search Results - Results - Using the check box - Bibliographic citations - View and download full text - Capture Citations Using Zotero - Download citations using EndNote ECD FAQs Alerts Help Alerts FAQs OSTI FAQs Alerts Alerts provide users with e-mail notification of updates to the Energy Citations Database in specific areas of interest. In order to receive Alerts, you must register. For assistance with Alerts, please see the Alerts Help and Alerts FAQ. Basic Search Enter your search term (s) in the search box and your search will be

449

Central Internet Database (CID) Glossary  

Office of Environmental Management (EM)

Glossary Glossary Central Internet Database CID Photo Banner Glossary # | A | B | C | D | E | F | G | H | I | J | K | L | M N | O | P | Q | R | S | T | U | V | W | X | Y | Z # 11e(2) Byproduct Material Tailings or waste produced by the extraction or concentration of uranium or thorium from any ore processed primarily for its source material (i.e., uranium or thorium) content. This excludes underground ores depleted by uranium solution extraction operations (in situ leaching) that continue to remain underground. 11e(2) byproduct material is defined by law under Section 11e(2) of the Atomic Energy Act as amended by Title II of the Uranium Mill Tailings Radiation Control Act of 1978. A Active Facility A facility that is being used to conduct DOE missions and has not yet been transferred to the Office of Environmental Management (EM) for management and/or cleanup.

450

Glycan fragment database: a database of PDB-based glycan 3D structures  

E-Print Network [OSTI]

The glycan fragment database (GFDB), freely available at http://www.glycanstructure.org, is a database of the glycosidic torsion angles derived from the glycan structures in the Protein Data Bank (PDB). Analogous to protein ...

Jo, Sunhwan; Im, Wonpil

2012-10-25T23:59:59.000Z

451

Database Applications to Integrate Beam Line Optics Changes with the Engineering Databases  

SciTech Connect (OSTI)

The LCLS project databases provide key nomenclature information while integrating many engineering and physics processes in the building of an accelerator. Starting with the elements existing in the beam line optics files, the engineers add non-beam-line elements, and controls engineers assign ''Formal Device Names'' to these elements. Inventory, power supplies, racks, crates and cable plants are databases that are being integrated into the project database. This approach replaces individual spreadsheets and/or integrates standalone existing institutional databases.

Chan, A.; Bellomo, P.; Crane, G.R.; Emma, P.; Grunhaus, E.; Luchini, K.; MacGregor, I.A.; Marsh, D.S.; Pope, R.; Prickett, P.; Rago, C.; Ratcliffe, K.; Shab, T.; /SLAC

2007-07-06T23:59:59.000Z

452

Ising models on power-law random graphs Sander Dommers  

E-Print Network [OSTI]

Ising models on power-law random graphs Sander Dommers Cristian Giardin`a Remco van der Hofstad May 25, 2010 Abstract We study a ferromagnetic Ising model on random graphs with a power-law degree Introduction and results In this article we study the behavior of the Ising model on complex networks

Hofstad, Remco van der

453

GRAPH THEORY AND PFAFFIAN REPRESENTATIONS OF ISING PARTITION FUNCTION.  

E-Print Network [OSTI]

GRAPH THEORY AND PFAFFIAN REPRESENTATIONS OF ISING PARTITION FUNCTION. THIERRY GOBRON Abstract. A well known theorem due to Kasteleyn states that the partition function of an Ising model to the graph. This results both embodies the free fermionic nature of any planar Ising model and eventually

Recanati, Catherine

454

Human-assisted graph search: it's okay to ask questions  

Science Journals Connector (OSTI)

We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) by asking an omniscient human questions of the form "Is there a target ...

Aditya Parameswaran; Anish Das Sarma; Hector Garcia-Molina; Neoklis Polyzotis; Jennifer Widom

2011-02-01T23:59:59.000Z

455

Local algorithms for the prime factorization of strong product graphs  

E-Print Network [OSTI]

Local algorithms for the prime factorization of strong product graphs Marc Hellmuth, Wilfried factorization algorithms is limited in practise by unavoidable noise in the data. A first step towards error-tolerant "approximate" prime factorization, is the development of local approaches that cover the graph by factorizable

Stadler, Peter F.

456

Groups generated by bounded automata and their schreier graphs  

E-Print Network [OSTI]

that the Schreier graphs on levels of automaton groups can be constructed by an iterative procedure of inflation of graphs. This was used to associate a piecewise linear map of the form fK(v) = minA?KAv, where K is a finite set of nonnegative matrices, with every...

Bondarenko, Ievgen

2009-05-15T23:59:59.000Z

457

A SPATIAL WEB GRAPH MODEL WITH LOCAL INFLUENCE REGIONS  

E-Print Network [OSTI]

A SPATIAL WEB GRAPH MODEL WITH LOCAL INFLUENCE REGIONS W. AIELLO, A. BONATO, C. COOPER, J. JANSSEN- served in real-world networks such as the web graph. On the other hand, experimental and heuristic network can be recognized as densely linked subgraphs, or that web pages with many common neigh- bours

Pralat, Pawel

458

Semidefinite programming and eigenvalue bounds for the graph ...  

E-Print Network [OSTI]

The graph partition problem is the problem of partitioning the vertex set of a graph ... In this paper we simplify a known matrix-lifting semidefinite ...... [44] Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones.

2013-11-26T23:59:59.000Z

459

ADAGE: A software package for analyzing graph evolution  

E-Print Network [OSTI]

graph evolution. 2.2 Using ADAGE 2.2.1 Installation ADAGE was built for use on MATLAB 2007 version. In this case input is a string. If the MATLAB matrix has already been saved, simply run > input = loadADAGE: A software package for analyzing graph evolution Mary McGlohon, Christos Faloutsos May 2007

460

MATLAB Tutorial Getting Started with Calculations, Graphing and Programming  

E-Print Network [OSTI]

MATLAB Tutorial Getting Started with Calculations, Graphing and Programming Nicholas R. Kirchner UI 2 Calculations with MATLAB Standard Calculations and Variables Matrices and Vectors 3 Graphing NRK;Matrices and Vectors, Definitions MATLAB is short for MATrix LABoratory. It was built for high-speed matrix

Weinberger, Hans

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


461

New approximation algorithms for minimum cycle bases of graphs  

Science Journals Connector (OSTI)

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0, 1} incidence vector ...

Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail

2007-02-01T23:59:59.000Z

462

Rank Synopses for Efficient Time Travel on the Web Graph  

E-Print Network [OSTI]

Rank Synopses for Efficient Time Travel on the Web Graph Klaus Berberich, Srikanta Bedathur}@mpi-inf.mpg.de ProblemProblem SolutionSolution ExperimentsExperiments Step 1: PageRank Normalization We normalize PageRank scores computed on Gt ( Vt, Et ) (i.e., the graph at time t ) dividing by the lower bound PageRank score

463

Algorithms to Compute Minimum Cycle Basis in Directed Graphs #  

E-Print Network [OSTI]

, . . . ,C d whose incidence vectors permit a unique linear combination of the incidence vector of any cycleAlgorithms to Compute Minimum Cycle Basis in Directed Graphs # Telikepalli Kavitha + Kurt Mehlhorn # Abstract We consider the problem of computing a minimum cycle basis in a di­ rected graph G with m arcs

Mehlhorn, Kurt

464

VIDEO SUMMARIZATION BY VIDEO STRUCTURE ANALYSIS AND GRAPH OPTIMIZATION  

E-Print Network [OSTI]

VIDEO SUMMARIZATION BY VIDEO STRUCTURE ANALYSIS AND GRAPH OPTIMIZATION Shi Lu, Irwin King video summarization method that combines video structure analysis and graph optimiza- tion. First, we analyze the structure of the video, find the boundaries of video scenes, then we calculate each scene

King, Kuo Chin Irwin

465

Video Denoising and Simplification Via Discrete Regularization on Graphs  

E-Print Network [OSTI]

Video Denoising and Simplification Via Discrete Regularization on Graphs Mahmoud Ghoniem, Youssef algorithms for video de- noising and simplification based on discrete regularization on graphs. The main difference between video and image denoising is the temporal redundancy in video sequences. Recent works

Paris-Sud XI, Université de

466

Fast top-k simple shortest paths discovery in graphs  

Science Journals Connector (OSTI)

With the wide applications of large scale graph data such as social networks, the problem of finding the top-k shortest paths attracts increasing attention. This paper focuses on the discovery of the top-k simple shortest paths (paths without ... Keywords: graphs, shortest path, top-k

Jun Gao; Huida Qiu; Xiao Jiang; Tengjiao Wang; Dongqing Yang

2010-10-01T23:59:59.000Z

467

Some Remarks on Factor Graphs Hans-Andrea Loeliger  

E-Print Network [OSTI]

be used and combined in factor graphs. Keywords: factor graphs, turbo signal processing, gradient methodsA(x)fB(x)fC(x). (2) We expand this into f(x) = fA(x)fB(x )fC(x )(x - x )(x - x ), (3) #12;fA x = x fC fB x Figure 2

Loeliger, Hans-Andrea

468

Which Codes Have Cycle-Free Tanner Graphs?  

E-Print Network [OSTI]

, 2, 4, 5, 9, 11, 16, 17, 18, 22, 29, 30]. For example, the well- known turbo codes and turbo decoding-graph representations for turbo codes were introduced in [29, 30], where it is also shown that turbo decoding asymptotically good if the underlying Tanner graph is a sufficiently strong expander. These codes were studied

Karpovsky, Mark

469

Graph-based Image Segmentation Using Weighted Color Patch  

E-Print Network [OSTI]

Graph-based Image Segmentation Using Weighted Color Patch Xiaofang Wang1 , Chao Zhu1 , Charles a new method based on the weighted color patch to compute the weight of edges in an affinity graph with color patches. Furthermore, we assign both local and global weights adaptively for each pixel in a patch

Paris-Sud XI, Université de

470

THE ELECTRICAL RESISTANCE OF A GRAPH CAPTURES ITS  

E-Print Network [OSTI]

THE ELECTRICAL RESISTANCE OF A GRAPH CAPTURES ITS COMMUTE AND COVER TIMES Ashok K. Chandra random walks and electrical networks by showing that resistance in this network is intimately connected of the graph is replaced by a unit resistance. As an example of the interplay between electrical

Borenstein, Elhanan

471

A COMBINATORIAL PROOF OF RAYLEIGH MONOTONICITY FOR GRAPHS  

E-Print Network [OSTI]

of the Rayleigh monotonicity property of graphs. Consider a (linear, resistive) electrical network, AND D.G. WAGNER Abstract. We give an elementary, self-contained, and purely com- binatorial proof allow graphs to have loops and/or mul- tiple edges. The value of ye is interpreted as the electrical

472

Bicyclic graphs with exactly two main signless Laplacian eigenvalues  

E-Print Network [OSTI]

A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected bicyclic graphs with exactly two main eigenvalues are determined.

Huang, He

2012-01-01T23:59:59.000Z

473

Motorcycle Graphs and Straight Skeletons Siu-Wing Cheng  

E-Print Network [OSTI]

Motorcycle Graphs and Straight Skeletons Siu-Wing Cheng Antoine Vigneron March 17, 2005 Abstract We present a new algorithm to compute motorcycle graphs. It runs in O(n n log n) time when n is the number of motorcycles. We give a new characterization of the straight skeleton of a non

Vigneron, Antoine

474

On bounding the bandwidth of graphs with symmetry - Optimization ...  

E-Print Network [OSTI]

Hamming graph H(2,q) (also known as the lattice graph) has bandwidth equal to. (q+1)q. 2. ?1 .... 59. 10 3 120. 72. 75. 76. 90. Table 9: Bounds on the bandwidth of K(v,2) and K(v,3). v d meig .... Freeman, San Francisco, 1979. [19] Graham, A.

2013-08-08T23:59:59.000Z

475

Nuclear Databases: National Resource Nuclear databases consists of carefully organized scientific  

E-Print Network [OSTI]

Nuclear Databases: National Resource Nuclear databases consists of carefully organized scientific information that has been gathered over 50 years of low-energy nuclear physics research worldwide. These powerful databases have enormous value and they represent a genuine national resource. Six core nuclear

Ohta, Shigemi

476

Instability of Bose-Einstein condensation on quantum graphs under repulsive perturbations  

E-Print Network [OSTI]

In this Note we investigate Bose-Einstein condensation in interacting quantum many-particle systems on graphs. We extend previous results obtained for particles on an interval and show that even arbitrarily small repulsive two-particle interactions destroy a condensate in the non-interacting Bose gas. Our results also cover singular two-particle interactions, such as the well-known Lieb-Lininger model, in the thermodynamic limit.

Jens Bolte; Joachim Kerner

2014-11-26T23:59:59.000Z

477

Tri-party agreement databases, access mechanism and procedures. Revision 2  

SciTech Connect (OSTI)

This document contains the information required for the Washington State Department of Ecology (Ecology) and the U.S. Environmental Protection Agency (EPA) to access databases related to the Hanford Federal Facility Agreement and Consent Order (Tri-Party Agreement). It identifies the procedure required to obtain access to the Hanford Site computer networks and the Tri-Party Agreement related databases. It addresses security requirements, access methods, database availability dates, database access procedures, and the minimum computer hardware and software configurations required to operate within the Hanford Site networks. This document supersedes any previous agreements including the Administrative Agreement to Provide Computer Access to U.S. Environmental Protection Agency (EPA) and the Administrative Agreement to Provide Computer Access to Washington State Department of Ecology (Ecology), agreements that were signed by the U.S. Department of Energy (DOE), Richland Operations Office (RL) in June 1990, Access approval to EPA and Ecology is extended by RL to include all Tri-Party Agreement relevant databases named in this document via the documented access method and date. Access to databases and systems not listed in this document will be granted as determined necessary and negotiated among Ecology, EPA, and RL through the Tri-Party Agreement Project Managers. The Tri-Party Agreement Project Managers are the primary points of contact for all activities to be carried out under the Tri-Party Agreement. Action Plan. Access to the Tri-Party Agreement related databases and systems does not provide or imply any ownership on behalf of Ecology or EPA whether public or private of either the database or the system. Access to identified systems and databases does not include access to network/system administrative control information, network maps, etc.

Brulotte, P.J.

1996-01-01T23:59:59.000Z

478

International energy indicators. [Statistical tables and graphs  

SciTech Connect (OSTI)

International statistical tables and graphs are given for the following: (1) Iran - Crude Oil Capacity, Production and Shut-in, June 1974-April 1980; (2) Saudi Arabia - Crude Oil Capacity, Production, and Shut-in, March 1974-Apr 1980; (3) OPEC (Ex-Iran and Saudi Arabia) - Capacity, Production and Shut-in, June 1974-March 1980; (4) Non-OPEC Free World and US Production of Crude Oil, January 1973-February 1980; (5) Oil Stocks - Free World, US, Japan, and Europe (Landed, 1973-1st Quarter, 1980); (6) Petroleum Consumption by Industrial Countries, January 1973-December 1979; (7) USSR Crude Oil Production and Exports, January 1974-April 1980; and (8) Free World and US Nuclear Generation Capacity, January 1973-March 1980. Similar statistical tables and graphs included for the United States include: (1) Imports of Crude Oil and Products, January 1973-April 1980; (2) Landed Cost of Saudi Oil in Current and 1974 Dollars, April 1974-January 1980; (3) US Trade in Coal, January 1973-March 1980; (4) Summary of US Merchandise Trade, 1976-March 1980; and (5) US Energy/GNP Ratio, 1947 to 1979.

Bauer, E.K. (ed.)

1980-05-01T23:59:59.000Z

479

An Experiment on Graph Analysis Methodologies for Scenarios  

SciTech Connect (OSTI)

Visual graph representations are increasingly used to represent, display, and explore scenarios and the structure of organizations. The graph representations of scenarios are readily understood, and commercial software is available to create and manage these representations. The purpose of the research presented in this paper is to explore whether these graph representations support quantitative assessments of the underlying scenarios. The underlying structure of the scenarios is the information that is being targeted in the experiment and the extent to which the scenarios are similar in content. An experiment was designed that incorporated both the contents of the scenarios and analysts graph representations of the scenarios. The scenarios content was represented graphically by analysts, and both the structure and the semantics of the graph representation were attempted to be used to understand the content. The structure information was not found to be discriminating for the content of the scenarios in this experiment; but, the semantic information was discriminating.

Brothers, Alan J.; Whitney, Paul D.; Wolf, Katherine E.; Kuchar, Olga A.; Chin, George

2005-09-30T23:59:59.000Z

480

DATA QUALITY IN GENOME DATABASES (Research Paper)  

E-Print Network [OSTI]

DATA QUALITY IN GENOME DATABASES (Research Paper) Heiko Müller Humboldt University Berlin, Germany@dbis.informatik.hu-berlin.de Abstract: Genome databases store data about molecular biological entities such as genes, proteins, diseases is their importance in the process of drug discovery. Genome data is analyzed and interpreted to gain so-called leads

Weske, Mathias

Note: This page contains sample records for the topic "graph database system" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


481

Nama Database Wiki | Open Energy Information  

Open Energy Info (EERE)

Nama Database Wiki Nama Database Wiki Jump to: navigation, search Tool Summary LAUNCH TOOL Name: NAMA Database Wiki Agency/Company /Organization: Ecofys Sector: Climate, Energy Focus Area: Renewable Energy, Greenhouse Gas Phase: Evaluate Options, Develop Goals, Prepare a Plan Topics: Finance, Low emission development planning, -NAMA Resource Type: Guide/manual, Lessons learned/best practices, Training materials User Interface: Website Complexity/Ease of Use: Simple Website: www.nama-database.org/ The NAMA Database is an expanding resource containing the latest activities taking place around the world on Nationally Appropriate Mitigation Actions (NAMAs). The mission is to create a valuable resource for policy makers, researchers and other interested stakeholders to increase knowledge-sharing

482

Global Renewable Energy Database | Open Energy Information  

Open Energy Info (EERE)

Global Renewable Energy Database Global Renewable Energy Database Jump to: navigation, search Tool Summary Name: Global Renewable Energy Database Agency/Company /Organization: German Aerospace Center (DLR) Sector: Energy Focus Area: Renewable Energy, Solar, Wind Topics: Resource assessment Resource Type: Dataset, Maps Website: www.dlr.de/en/ References: DLR website [1] From 2009-2010 the German Aerospace Center (DLR) will inventory renewable energy resources for energy modeling in impact assessment models which will feed into a database of renewable energy resources in 0.45° spatial and 1h temporal resolution. References ↑ "DLR website" Retrieved from "http://en.openei.org/w/index.php?title=Global_Renewable_Energy_Database&oldid=328731" Category: Tools What links here

483

International Forest Policy Database | Open Energy Information  

Open Energy Info (EERE)

International Forest Policy Database International Forest Policy Database Jump to: navigation, search Tool Summary LAUNCH TOOL Name: International Forest Policy Database Agency/Company /Organization: GTZ Sector: Land Focus Area: Forestry Topics: Policies/deployment programs Resource Type: Dataset Website: www.etfrn.org/etfrn/topics/policy/index.html International Forest Policy Database Screenshot References: GTZ International Forest Policy Database[1] Overview "This topic page is being developed in cooperation with GTZ-IWP, the International Forest Policy project of the German organisation for international cooperation. GTZ-IWP has contributed considerably to the ETFRN NEWS 41/42 on national forest programmes. During this cooperation both GTZ and ETFRN identified a need for a central point of access to information on international forest

484

Graphical description of local Gaussian operations for continuous-variable weighted graph states  

E-Print Network [OSTI]

The form of a local Clifford (LC, also called local Gaussian (LG)) operation for the continuous-variable (CV) weighted graph states is presented in this paper, which is the counterpart of the LC operation of local complementation for qubit graph states. The novel property of the CV weighted graph states is shown, which can be expressed by the stabilizer formalism. It is distinctively different from the qubit weighted graph states, which can not be expressed by the stabilizer formalism. The corresponding graph rule, stated in purely graph theoretical terms, is described, which completely characterizes the evolution of CV weighted graph states under this LC operation. This LC operation may be applied repeatedly on a CV weighted graph state, which can generate the infinite LC equivalent graph states of this graph state. This work is an important step to characterize the LC equivalence class of CV weighted graph states.

Jing Zhang

2008-10-08T23:59:59.000Z

485

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

E-Print Network [OSTI]

ranging from micro- (host level) to macro-scale (enterprise level). Achievements · Major release of Graph Library - Exhibit at GraphLab Conference, July 2014 · Selected publications 1. "Towards A Networks-of-Networks of Machine Learning Research, 2014. Rendering of Network Traffic Data Showing Communication between IP

486

MapGraph: A High Level API for Fast Development of High Performance Graph Analytics on GPUs  

Science Journals Connector (OSTI)

High performance graph analytics are critical for a long list of application domains. In recent years, the rapid advancement of many-core processors, in particular graphical processing units (GPUs), has sparked a broad interest in developing high performance ... Keywords: GPU, Graph analytics, high-level API

Zhisong Fu; Michael Personick; Bryan Thompson

2014-06-01T23:59:59.000Z

487

NGNP Risk Management Database: A Model for Managing Risk  

SciTech Connect (OSTI)

To facilitate the implementation of the Risk Management Plan, the Next Generation Nuclear Plant (NGNP) Project has developed and employed an analytical software tool called the NGNP Risk Management System (RMS). A relational database developed in Microsoft Access, the RMS provides conventional database utility including data maintenance, archiving, configuration control, and query ability. Additionally, the tools design provides a number of unique capabilities specifically designed to facilitate the development and execution of activities outlined in the Risk Management Plan. Specifically, the RMS provides the capability to establish the risk baseline, document and analyze the risk reduction plan, track the current risk reduction status, organize risks by reference configuration system, subsystem, and component (SSC) and Area, and increase the level of NGNP decision making.

John Collins

2009-09-01T23:59:59.000Z

488

On the incompleteness of the AS-level graph: a novel methodology for BGP route collector placement  

Science Journals Connector (OSTI)

In the last decade many studies have used the Internet AS-level topology to perform several analyses, from discovering its graph properties to assessing its impact on the effectiveness of worm-containment strategies. Yet, the BGP data typically used ... Keywords: BGP, autonomous systems, incompleteness, internet, measurement, topology

Enrico Gregori; Alessandro Improta; Luciano Lenzini; Lorenzo Rossi; Luca Sani

2012-11-01T23:59:59.000Z

489

National Spill Test Technology Database  

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

Western Research Institute established, and ACRC continues to maintain, the National Spill Technology database to provide support to the Liquified Gaseous Fuels Spill Test Facility (now called the National HAZMAT Spill Center) as directed by Congress in Section 118(n) of the Superfund Amendments and Reauthorization Act of 1986 (SARA). The Albany County Research Corporation (ACRC) was established to make publicly funded data developed from research projects available to benefit public safety. The founders since 1987 have been investigating the behavior of toxic chemicals that are deliberately or accidentally spilled, educating emergency response organizations, and maintaining funding to conduct the research at the DOEs HAZMAT Spill Center (HSC) located on the Nevada Test Site. ACRC also supports DOE in collaborative research and development efforts mandated by Congress in the Clean Air Act Amendments. The data files are results of spill tests conducted at various times by the Silicones Environmental Health and Safety Council (SEHSC) and DOE, ANSUL, Dow Chemical, the Center for Chemical Process Safety (CCPS) and DOE, Lawrence Livermore National Laboratory (LLNL), OSHA, and DOT; DuPont, and the Western Research Institute (WRI), Desert Research Institute (DRI), and EPA. Each test data page contains one executable file for each test in the test series as well as a file named DOC.EXE that contains information documenting the test series. These executable files are actually self-extracting zip files that, when executed, create one or more comma separated value (CSV) text files containing the actual test data or other test information.

Sheesley, David (Western Research Institute)

490

NREL: U.S. Life Cycle Inventory Database - About the LCI Database Project  

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

About the LCI Database Project About the LCI Database Project The U.S. Life Cycle Inventory (LCI) Database is a publicly available database that allows users to objectively review and compare analysis results that are based on similar data collection and analysis methods. Finding consistent and transparent LCI data for life cycle assessments (LCAs) is difficult. NREL works with LCA experts to solve this problem by providing a central source of critically reviewed LCI data through its LCI Database Project. NREL's High-Performance Buildings research group is working closely with government stakeholders, and industry partners to develop and maintain the database. The 2009 U.S. Life Cycle Inventory (LCI) Data Stakeholder meeting was an important step in the ongoing improvement of the database. Prior to that event, NREL conducted a poll of current and

491

Crawling the Control System  

SciTech Connect (OSTI)

Information about accelerator operations and the control system resides in various formats in a variety of places on the lab network. There are operating procedures, technical notes, engineering drawings, and other formal controlled documents. There are programmer references and API documentation generated by tools such as doxygen and javadoc. There are the thousands of electronic records generated by and stored in databases and applications such as electronic logbooks, training materials, wikis, and bulletin boards and the contents of text-based configuration files and log files that can also be valuable sources of information. The obvious way to aggregate all these sources is to index them with a search engine that users can then query from a web browser. Toward this end, the Google "mini" search appliance was selected and implemented because of its low cost and its simple web-based configuration and management. In addition to crawling and indexing electronic documents, the appliance provides an API that has been used to supplement search results with live control system data such as current values of EPICS process variables and graphs of recent data from the archiver.

Theodore Larrieu

2009-10-01T23:59:59.000Z

492

Efficient broadcast on random geometric graphs  

SciTech Connect (OSTI)

A Randon Geometric Graph (RGG) is constructed by distributing n nodes uniformly at random in the unit square and connecting two nodes if their Euclidean distance is at most r, for some prescribed r. They analyze the following randomized broadcast algorithm on RGGs. At the beginning, there is only one informed node. Then in each round, each informed node chooses a neighbor uniformly at random and informs it. They prove that this algorithm informs every node in the largest component of a RGG in {Omicron}({radical}n/r) rounds with high probability. This holds for any value of r larger than the critical value for the emergence of a giant component. In particular, the result implies that the diameter of the giant component is {Theta}({radical}n/r).

Bradonjic, Milan [Los Alamos National Laboratory; Elsasser, Robert [UNIV OF PADERBORN; Friedrich, Tobias [INTERNATIONAL COMPUTER SCI.; Sauerwald, Thomas [INTERNATIONAL COMPUTER SCI.

2009-01-01T23:59:59.000Z

493

Bicyclic graphs with maximal revised Szeged index  

E-Print Network [OSTI]

The revised Szeged index $Sz^*(G)$ is defined as $Sz^*(G)=\\sum_{e=uv \\in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of vertices equidistant to $u$ and $v$. Hansen used the AutoGraphiX and made the following conjecture about the revised Szeged index for a connected bicyclic graph $G$ of order $n \\geq 6$:

Li, Xueliang

2011-01-01T23:59:59.000Z

494

Renewable Energy and Defense Geospatial Database | Open Energy...  

Open Energy Info (EERE)

Database Jump to: navigation, search OpenEI Reference LibraryAdd to library Web Site: Renewable Energy and Defense Geospatial Database Abstract This database provides GIS data to...

495

High Performance Buildings Database | Open Energy Information  

Open Energy Info (EERE)

High Performance Buildings Database High Performance Buildings Database Jump to: navigation, search The High Performance Buildings Database (HPBD), developed by the United States Department of Energy and the National Renewable Energy Laboratory, is "a unique central repository of in-depth information and data on high-performance, green building projects across the United States and abroad."[1] Map of HPBD entries Loading map... {"format":"googlemaps3","type":"ROADMAP","types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"limit":1000,"offset":0,"link":"all","sort":[""],"order":[],"headers":"show","mainlabel":"-","intro":"","outro":"","searchlabel":"\u2026

496

Argonne TTRDC - D3 (Downloadable Dynamometer Database)  

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

Technology Analysis Transportation Research and Analysis Computing Center Working With Argonne Contact TTRDC Advanced Powertrain Research Facility - Downloadable Dynamometer Database (D3) aprf Advanced Powertrain Research Facility The Downloadable Dynamometer Database (D3) offers publicly available testing data regarding advanced technology vehicles. Derived from independent laboratory testing, the data is intended to enhance the understanding of advanced vehicle technologies for researchers, students, and professionals engaged in energy efficient vehicle research, development and education. Data from this website can only be used with the following attribution: "This data is from the Downloadable Dynamometer Database (http://www.transportation.anl.gov/D3/) and was generated at the Advanced

497

ASYMPTOTIC STUDY OF SUBCRITICAL GRAPH CLASSES MICHAEL DRMOTA, ERIC FUSY, MIHYUN KANG, VERONIKA KRAUS  

E-Print Network [OSTI]

ASYMPTOTIC STUDY OF SUBCRITICAL GRAPH CLASSES MICHAEL DRMOTA, ´ERIC FUSY, MIHYUN KANG, VERONIKA from the so-called "subcritical" graph classes, which include the classes of cacti graphs, outerplanar graphs chosen from subcritical classes. We show that the number gn/n! (resp. gn) of labelled (resp

Paris-Sud XI, Université de

498

THE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER  

E-Print Network [OSTI]

(3) implies that the energy of a tree is a monotonically increasing function of any m(T, k) for the study of the energy of trees, we may consider it also for cycle­containing graphs. For such graphsTHE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER Abstract. The energy of a graph G

Wagner, Stephan

499

Multiclass Diffuse Interface Models for Semi-supervised Learning on Graphs  

E-Print Network [OSTI]

Multiclass Diffuse Interface Models for Semi-supervised Learning on Graphs Cristina Garcia-Cardona1: Graph Segmentation, Diffuse Interfaces, Learning on Graphs. Abstract: We present a graph-based variational algorithm for multiclass classification of high-dimensional data, moti- vated by total variation

Percus, Allon

500

Locating and paired-dominating sets in graphs  

Science Journals Connector (OSTI)

In this paper, we continue the study of paired-domination in graphs introduced by Haynes and Slater [T.W. Haynes, P.J. Slater, Paired-domination in graphs, Networks 32 (1998), 199206]. A paired-dominating set of a graph G with no isolated vertex is a dominating set S of vertices whose induced subgraph has a perfect matching. We consider paired-dominating sets which are also locating sets, that is distinct vertices of G are dominated by distinct subsets of the paired-dominating set. We consider three variations of sets which are paired-dominating and locating sets and investigate their properties.

John McCoy; Michael A. Henning

2009-01-01T23:59:59.000Z