Powered by Deep Web Technologies
Note: This page contains sample records for the topic "queries sparql queries" 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

Zeus: a distributed triple store for proactive SPARQL queries  

Science Journals Connector (OSTI)

The RDF framework is the underpinning element of semantic web stack; its widespread adoption requires efficient tools to store and query RDF data. A number of efficient local RDF stores already exist, while distributed indexing and distributed query processing are only starting to appear; furthermore dynamically growing and fail-safe solutions are not yet available. To remedy this situation, in this paper we present Zeus: an approach for efficient and scalable query processing over RDF graphs based on grid computing. Zeus is based on a distributed architecture, where neither single point of failure nor specialised nodes exist. The query processing framework, presented in the paper, includes a sophisticated query planning and query execution algorithm, which is designed expressively for storage and query of a stream of RDF triples. This mechanism allows Zeus users to register queries that will be notified in real time of new relevant results.

Marcello Leida; Andrej Chu

2014-01-01T23:59:59.000Z

2

Query | Department of Energy  

Office of Environmental Management (EM)

Query Query Query Query1.pdf Query More Documents & Publications DOE Retrospective Review Plan and Burden Reduction Report July 29, 2013 DOE EO 13563 January 2014 Update Report...

3

boolean queries Inverted index  

E-Print Network [OSTI]

boolean queries Inverted index query processing Query optimization boolean model September 9, 2014 1 / 39 #12;boolean queries Inverted index query processing Query optimization Outline 1 boolean queries 2 Inverted index 3 query processing 4 Query optimization 2 / 39 #12;boolean queries Inverted index

Lu, Jianguo

4

Query shredding: efficient relational evaluation of queries over nested multisets  

Science Journals Connector (OSTI)

Nested relational query languages have been explored extensively, and underlie industrial language-integrated query systems such as Microsoft's LINQ. However, relational databases do not natively support nested collections in query results. This can ... Keywords: language-integrated query, querying nested collections

James Cheney; Sam Lindley; Philip Wadler

2014-06-01T23:59:59.000Z

5

Cognos Query Studio NUFinancials  

E-Print Network [OSTI]

@northwestern.edu · Please review this guide before calling the help desk with data definition questions. #12;Cognos Query. Hover over the same items to see the definition in a tool tip. Who has access? · Users with the security-up and down-drill capability, you must have the Ad Hoc Query Author role. Where to get help? · For assistance

Shull, Kenneth R.

6

Query Optimization Techniques Class Hierarchies  

E-Print Network [OSTI]

Query Optimization Techniques Exploiting Class Hierarchies Sophie Cluet 1 Guido Moerkotte 2 1 INRIA Since the introduction of object base management systems (OBMS), many query optimization techniques tailored for object query languages have been proposed. They adapt known optimization techniques

Mannheim, Universität

7

Complex Queries | Open Energy Information  

Open Energy Info (EERE)

Complex Queries Complex Queries < User:Jweers Jump to: navigation, search Contents 1 Using Nested Queries 1.1 Programs 2 Using Inverse Property Ask Query 3 Using Wildcards Plus Array Print with Count 3.1 States start with A (4) Using Nested Queries Complex Help:Inline queries are queries which involve multiple subjects, properties, or nested queries. The following is an example of a nested query which will return only Programs (Category:Programs) in the Energy Sector (Property:ProgramSector = Energy) within the subsector of Wind (Property:Sector = Wind) which have been developed by National Labs (Category:United States Department of Energy National Laboratories). The last piece mentioned is where the nested query comes into play. To find Programs which have been developed by National Labs, we must search the

8

ask queries | OpenEI Community  

Open Energy Info (EERE)

16 May, 2013 - 14:22 Multicolor Maps from Compound Queries ask queries compound queries developer Google maps maps multicolor result formats results Semantic Mediawiki Hi all,...

9

compound queries | OpenEI Community  

Open Energy Info (EERE)

Jweers's picture Submitted by Jweers(83) Contributor 16 May, 2013 - 14:22 Multicolor Maps from Compound Queries ask queries compound queries developer Google maps maps...

10

Two Queries Harry Buhrman  

E-Print Network [OSTI]

Two Queries Harry Buhrman #3; CWI PO Box 94079 1090 GB Amsterdam The Netherlands Lance Fortnow y \\ B) [ (A \\ B). For complexity classes C and D define the class C#1;D as fA#1;B j A 2 C and B 2 Dg

Fortnow, Lance

11

Approximate XML query answers  

Science Journals Connector (OSTI)

The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over the Internet or in large corporate data-stores. Inevitably, this will result ...

Neoklis Polyzotis; Minos Garofalakis; Yannis Ioannidis

2004-06-01T23:59:59.000Z

12

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

13

EIA 176 Query System, 2004  

Gasoline and Diesel Fuel Update (EIA)

4 4 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2004 The EIA-176 Query System is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later. It provides a method of extracting and using the company level data filed on the Form EIA-176, and saving the query results in various media and formats. There are pre-selected data queries, which allow the user to select and run the most often-used queries, as well as the ability to create a customized query. Self-extracting executable files with run-time versions of Access are required to set up the system. You may also download the data tables if you already have Microsoft Access on your computer. For instructions, please refer to the documentation listed below.

14

EIA 176 Query System, 2001  

Gasoline and Diesel Fuel Update (EIA)

1 1 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2001 The EIA-176 Query system is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later. It provides a method of extracting and using the company level data filed on the Form EIA-176, and saving the query results in various media and formats. There are pre-selected data queries, which allow the user to select and run the most often-used queries, as well as the ability to create a customized query. Self-extracting executable files with run-time versions of Access are required to set up the system. You may also download the data tables if you already have Microsoft Access on your computer. For instructions, please read the documentation file(s) listed below

15

EIA 176 Query System, 2003  

Gasoline and Diesel Fuel Update (EIA)

3 3 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2003 The EIA-176 Query System is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later. It provides a method of extracting and using the company level data filed on the Form EIA-176, and saving the query results in various media and formats. There are pre-selected data queries, which allow the user to select and run the most often-used queries, as well as the ability to create a customized query. Self-extracting executable files with run-time versions of Access are required to set up the system. You may also download the data tables if you already have Microsoft Access on your computer. For instructions, please refer to the documentation read the documentation file(s) listed below.

16

Introduction Inverted index Processing Boolean queries Query optimization Web Search and Text Mining  

E-Print Network [OSTI]

Introduction Inverted index Processing Boolean queries Query optimization Web Search and Text Institute of Technology, College of Computing 2011 Gray: Boolean Retrieval 1 / 39 #12;Introduction Inverted index Processing Boolean queries Query optimization Overview 1 Introduction 2 Inverted index 3

Gray, Alexander

17

EIA 176 Query System, 2002  

Gasoline and Diesel Fuel Update (EIA)

2 2 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2002 EIA 176 Query System 2002 Release date: February 2, 2004 Next release date: February 2005 The EIA-176 Query system is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later. It provides a method of extracting and using the company level data filed on the Form EIA-176, and saving the query results in various media and formats. There are pre-selected data queries, which allow the user to select and run the most often-used queries, as well as the ability to create a customized query. Self-extracting executable files with run-time versions of Access are required to set up the system. You may also download the data tables if you already have Microsoft Access on your computer. For instructions, please read the documentation file(s) listed below.

18

Assisting Web Search Using Query Suggestion Based on Word Similarity Measure and Query Modification  

E-Print Network [OSTI]

. For example, when the word "Tiger" is entered by a user, current web search engines are mostly focusedAssisting Web Search Using Query Suggestion Based on Word Similarity Measure and Query Modification search engines is query suggestion (QS), which assists users in formulating keyword queries by suggesting

Ng, Yiu-Kai Dennis

19

Introduction Inverted index Processing Boolean queries Query optimization Course overview Introduction to Information Retrieval  

E-Print Network [OSTI]

Introduction Inverted index Processing Boolean queries Query optimization Course overview Retrieval 1 / 60 #12;Introduction Inverted index Processing Boolean queries Query optimization Course overview Take-away Sch¨utze: Boolean Retrieval 2 / 60 #12;Introduction Inverted index Processing Boolean

Nejdl, Wolfgang

20

Exploiting External Collections for Query Expansion  

Science Journals Connector (OSTI)

A persisting challenge in the field of information retrieval is the vocabulary mismatch between a users information need and the relevant documents. One way of addressing this issue is to apply query modeling: to add terms to the original query ... Keywords: Query modeling, blog post retrieval, external expansion

Wouter Weerkamp; Krisztian Balog; Maarten de Rijke

2012-11-01T23:59:59.000Z

Note: This page contains sample records for the topic "queries sparql queries" 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

Example Queries | Open Energy Information  

Open Energy Info (EERE)

Example Queries Example Queries Jump to: navigation, search Example Queries SEP Funding SEP Funding Alabama 55,570,000 Alaska 28,232,000 Arizona 55,447,000 Arkansas 39,416,000 California 226,093,000 Colorado 49,222,000 Connecticut 38,542,000 Delaware 24,231,000 Florida 126,089,000 Georgia 82,495,000 Hawaii 25,930,000 Idaho 28,572,000 Illinois 101,321,000 Indiana 68,621,000 Iowa 40,546,000 Kansas 38,284,000 Kentucky 52,533,000 Louisiana 71,694,000 Maine 27,305,000 Maryland 51,772,000 Massachusetts 54,911,000 Michigan 82,035,000 Minnesota 54,172,000 Mississippi 40,418,000 Missouri 57,393,000 Montana 25,855,000 Nebraska 30,910,000 Nevada 34,714,000 New Hampshire 25,827,000 New Jersey 73,643,000 New Mexico 31,821,000 New York 123,110,000 North Carolina 75,989,000 North Dakota 24,585,000

22

Restricting query relaxation through user constraints  

SciTech Connect (OSTI)

This paper describes techniques to restrict and to heuristically control relaxation of deductive database queries. The process of query relaxation provides a user with a means to automatically identify new queries that are related to the user`s original query. However, for large databases, many relaxations may be possible. The methods to control and restrict the relaxation process introduced in this paper focus the relaxation process and make it more efficient. User restrictions over the data base domain may be expressed as user constraints. This paper describes how user constraints can restrict relaxed queries. Also, a set of heuristics based on cooperative answering techniques are presented for controlling the relaxation process. Finally, the interaction of the methods for relaxing queries, processing user constraints, and applying the heuristic rules is described.

Gaasterland, T.

1993-07-01T23:59:59.000Z

23

Query  

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

Queryl Queryl Detailees Name From To Proposed Start Date Proposed End Date Office of the Director of Alex, Aileen DOE/CFO National Intelligence 5/27/2007 5/27/2009 Federal Railroad Alexander, Alice Administration DOE/CFO 7/1/2007 1/1/2008 Arnaudo, Raymond Dept of State DOE/NNSA Moscow Office 3/5/2006 3/3/2008 Cambridge Energy Research Ashley, Peter DOE/PI Associates (CERA) 1/4/2009 3/27/2009 Executive Office of the Barringer, Jody DOE/EE President/OMB 11/16/2008 3/14/2009 Benigni, Deborah Dept of State DOE/IN 4/30/2007 4/30/2009 Federal Bureau of Borgia, Stanley Investigation DOE/IN 6/12/2006 6/12/2008 Federal Bureau of Borgia, Stanley Investigation DOE/IN 6/12/2008 6/12/2009 Department of State/US Brosnahan, Kevin DOE/EE Embassy of Paris 12/1/2007 5/1/2008 Office of the Director of

24

Discovering and Loading Data with Power Query  

Science Journals Connector (OSTI)

Discovering, loading, cleaning, and modifying source data is where Power Query comes in. Using this, the... Data DiscoveryFind and connect to a myriad of data sources ...

Adam Aspin

2014-01-01T23:59:59.000Z

25

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

26

Castor: Using Constraint Programming to Solve SPARQL Queries  

E-Print Network [OSTI]

. 1 Constraint Programming A Constraint Satisfaction Problem (CSP) is a triple (X,D,C) where X of values that can be assigned to x, and C is a set of constraints. A solution to a CSP is an assignment. The root node of the tree is the initial CSP. The children of a node are smaller CSPs such that the union

Deville, Yves

27

Query Expansion Using a Collection Dependent Probabilistic Latent Semantic Thesaurus  

Science Journals Connector (OSTI)

Many queries on collections of text documents are too short to produce informative results. Automatic query expansion is a method of adding terms to the query without interaction from the user in order to obtain ...

Laurence A. F. Park; Kotagiri Ramamohanarao

2007-01-01T23:59:59.000Z

28

HDF5-FastQuery: An API for Simplifying Access to Data Storage, Retrieval, Indexing and Querying  

E-Print Network [OSTI]

Accomplishment HDF5-FastQuery: An API for Simplifying Accessprogramming interface (API) that simplifies data storage andindexing/querying. The API, which we call HDF5-FastQuery,

Bethel, E. Wes; Gosink, Luke; Shalf, John; Stockinger, Kurt; Wu, Kesheng

2006-01-01T23:59:59.000Z

29

T-703: Cisco Unified Communications Manager Open Query Interface...  

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

Communications Manager Open Query Interface Lets Remote Users Obtain Database Contents T-703: Cisco Unified Communications Manager Open Query Interface Lets Remote Users Obtain...

30

E-Print Network 3.0 - ad hoc query Sample Search Results  

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

query Search Powered by Explorit Topic List Advanced Search Sample search results for: ad hoc query...

31

E-Print Network 3.0 - ad hoc queries Sample Search Results  

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

queries Search Powered by Explorit Topic List Advanced Search Sample search results for: ad hoc queries...

32

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

33

Table Name query? | OpenEI Community  

Open Energy Info (EERE)

Table Name query? Home > Groups > Databus Is there an API feature which returns the names of tables? Submitted by Hopcroft on 28 October, 2013 - 15:37 1 answer Points: 0 if you are...

34

XClean: Providing Valid Spelling Suggestions for XML Keyword Queries  

E-Print Network [OSTI]

{yifeil, weiw}@cse.unsw.edu.au Swinburne University of Technology {jianxinli, cliu}@swin.edu.au Abstract with low quality. Query cleaning has been proposed to alleviate this problem by suggesting several that the query result will be empty. An intelligent query cleaning system will suggest the clean query hinrich

Liu, Chengfei

35

Classifying Web Search Queries to Identify High Revenue Generating Customers  

E-Print Network [OSTI]

searching, the set of terms for which a user searches is called the query. If a user enters a query and then clicks on a result, these query terms are embedded within the URL that is passed from the search engineClassifying Web Search Queries to Identify High Revenue Generating Customers Adan Ortiz-Cordova 329

Jansen, James

36

Minimum-Hot-Spot Query Trees for Wireless Sensor Networks  

E-Print Network [OSTI]

an energy- efficient query routing tree. (a) Energy harvesting for battery- less nodes for the (b) Voltree to the querying node. Energy-efficient query routing trees are needed in a plethora of systems such as PeopleMinimum-Hot-Spot Query Trees for Wireless Sensor Networks Georgios Chatzimilioudis Dept

Zeinalipour, Demetris

37

Spatial Data Models and Query Processing Hanan Samet  

E-Print Network [OSTI]

Spatial Data Models and Query Processing Hanan Samet Walid G. Aref Computer Science Department databases. The focus is on data models and query processing. Query optimization in a spatial environment is also brie y discussed. Keywords and phrases: spatial databases, data models, spatial query processing

Samet, Hanan

38

How can I query data on OpenEI and generate a map? | OpenEI Community  

Open Energy Info (EERE)

How can I query data on OpenEI and generate a map? How can I query data on OpenEI and generate a map? Home > Groups > Developer I'd like to have an Ask or SPARQL query display as a map in the OpenEI wiki section. What are the various ways to do that? Submitted by Rmckeel on 22 June, 2012 - 08:00 1 answer Points: 1 For both SPARQL and Ask queries, results containing a location, 2-letter iso code, or coordinates can be displayed as a map using Google's map, geomap, or geochart formats. For both query types, the format is specified with |format=format. OpenEI pulls formats from a variety of extensions, tools and custom solutions. To make things easier, we've created an aggregate help page listing result formats, including the geochart API, here: http://en.openei.org/wiki/Help:FormattingResults Full documentation on Google's geochart API can be found here:

39

How can I query data on OpenEI and generate a map? | OpenEI Community  

Open Energy Info (EERE)

How can I query data on OpenEI and generate a map? How can I query data on OpenEI and generate a map? Home > Groups > Developer I'd like to have an Ask or SPARQL query display as a map in the OpenEI wiki section. What are the various ways to do that? Submitted by Rmckeel on 22 June, 2012 - 08:00 1 answer Points: 1 For both SPARQL and Ask queries, results containing a location, 2-letter iso code, or coordinates can be displayed as a map using Google's map, geomap, or geochart formats. For both query types, the format is specified with |format=format. OpenEI pulls formats from a variety of extensions, tools and custom solutions. To make things easier, we've created an aggregate help page listing result formats, including the geochart API, here: http://en.openei.org/wiki/Help:FormattingResults Full documentation on Google's geochart API can be found here:

40

Failure Analysis in Query Construction: Data and Analysis from A Large Sample of Web Queries  

E-Print Network [OSTI]

­ more details are on its Web site. Excite searches are based on the exact terms that a user enters in the query, however, capitalization is disregarded. Stemming is not available. Multiple term searches return,473 queries from 18,113 users of Excite, a major Web search engine. Given that many digital libraries

Jansen, James

Note: This page contains sample records for the topic "queries sparql queries" 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

E-Print Network 3.0 - assisted query reformulation Sample Search...  

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

query reformulation Page: << < 1 2 3 4 5 > >> 1 Predicting Query Reformulation During Web Searching Summary: and Assistance account for approximately 45 percent of all query...

42

Help:External SPARQL integration | Open Energy Information  

Open Energy Info (EERE)

External SPARQL integration External SPARQL integration Jump to: navigation, search Integrating with Reegle logo.png OpenEI is engaged in an ongoing linked open data collaboration with Reegle[1]. This page serves to document a few of the initial integration techniques. For the purposes of this demonstration, we'll be working with the country of Brazil. The following SPARQL query was used to detect if a country within OpenEI had a corresponding country profiles: {{#sparql: PREFIX reegle: PREFIX country: PREFIX geonames: SELECT ?countryName ?profile WHERE { SERVICE { country:{{#var:Iso3166Alpha2}} geonames:name ?countryName . country:{{#var:Iso3166Alpha2}} reegle:profile ?profile .

43

Query-based database policy assurance using semantic web technologies  

E-Print Network [OSTI]

In this thesis, we present a novel approach to database security which looks at queries instead of the database tables themselves. In doing so, we use a number of Semantic Web technologies to define rules, translate queries, ...

Soltren, Jos Hiram

2009-01-01T23:59:59.000Z

44

On the Query Complexity of Perfect Gate Discrimination  

E-Print Network [OSTI]

On the Query Complexity of Perfect Gate Discrimination Giulio Chiribella1 , Giacomo Mauro D'Ariano2 queries are called at different time steps [5]. T Q C © Giulio Chiribella, Giacomo Mauro D

D'Ariano, Giacomo Mauro

45

Using a Medical Thesaurus to Predict Query Difficulty  

Science Journals Connector (OSTI)

Estimating query performance is the task of predicting the quality of results returned by a search engine in response to a query. In this paper, we focus on pre-retrieval prediction methods for the medical domain...

Florian Boudin; Jian-Yun Nie; Martin Dawes

2012-01-01T23:59:59.000Z

46

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

47

The Spatial Skyline Queries Mehdi Sharifzadeh  

E-Print Network [OSTI]

- tively. We propose two algorithms, B2 S2 and VS2 , for static query points and one algorithm, VCS2 outperform the best competitor approach in terms of processing time by a wide margin (4-6 times better-15, 2006, Seoul, Korea. Copyright 2006 VLDB Endowment, ACM 1-59593-385-9/06/09. team located at different

Shahabi, Cyrus

48

Controller's Office Departmental Queries Revised January 2014  

E-Print Network [OSTI]

need. (Query Viewer Job Aid) NOTE: Please remember that it is necessary to enter the wildcard account use descriptions Account # % FSU_DPT_CODES_CATEGORY_BY_ACCT Purchasing Categories and G/L Accounts % Chartfield 2 % Chartfield 3 % FSU_DPT_LEDGER_SUM_W_CF Net ledger activity for a range of accounting periods

Sura, Philip

49

A Simple Model for Classifying Web Queries by User Intent  

E-Print Network [OSTI]

València, Spain 3 NLE Lab.- ELiRF, Universitat Politècnica de València, Spain 4 PRHLT, Universitat query classification, User intent, Query analysis 1 Introduction Web Search Engines (WSEs) are the most in an interaction with a Web Search Engine. Query Classification based on user intent is different from traditional

Rosso, Paolo

50

Query Suggestions for Mobile Search: Understanding Usage Patterns  

E-Print Network [OSTI]

Inc 1600 Amphitheatre Parkway, Mountain View, CA shumeet@google.com ABSTRACT Entering search terms that users who were asked to enter queries on a search interface with query suggestions rated their workload heavily on suggestions if they are provided. Users who were asked to enter queries on a search interface

Tomkins, Andrew

51

Generalized Labeled LCA Queries Jrmy Barbay, Ehsan Chiniforooshan, Alexander Golynski,  

E-Print Network [OSTI]

Generalized Labeled LCA Queries Jérémy Barbay, Ehsan Chiniforooshan, Alexander Golynski, Jui-Yi Kao without knowing their schema. Among them, lowest common ancestor (LCA) queries were introduced in several variants on labeled trees. We de#28;ne threshold LCA queries to generalize all those variants

Waterloo, University of

52

Natural Gas Annual Respondent Query System  

Gasoline and Diesel Fuel Update (EIA)

loading new table loading new table Home > Natural Gas > Natural Gas Annual Respondent Query System Natural Gas Annual Respondent Query System (EIA-176 Data through 2012) Report: 176 Natural Gas Deliveries 176 Natural Gas Supply Items 176 Natural Gas Other Disposition Items 176 Type of Operations and Sector Items 176 Continuation Text Lines 176 Company List 191 Field Level Storage Data 757 Processing Capacity 176 Custom Report (User-defined) Years: 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 to 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 Sort by: Area, Company, Item Company, Area, Item Item, Area, Company Company: Show only Company ID Show only Company Name Show both Company ID, Name 2012 Total

53

Query optimization in nested relational databases  

E-Print Network [OSTI]

optimization in nested relational systems and does not make any assumptions on the physical implementation of the system. C. Contributions of this research This research could be divided into three phases: 1. Study of query languages and algebras... does so by treating both relation-valued attributes and relations uniformly. Let name be the set of valid names to be used for naming relations and their attributes. 1. Descriptions: A description 6 is an ordered pair (n, s), where n C name...

Rathakrishnan, Balaji

2012-06-07T23:59:59.000Z

54

Multicolor Maps from Compound Queries | OpenEI Community  

Open Energy Info (EERE)

Multicolor Maps from Compound Queries Multicolor Maps from Compound Queries Home > Groups > OpenEI Community Central Jweers's picture Submitted by Jweers(83) Contributor 16 May, 2013 - 14:22 ask queries compound queries developer Google maps maps multicolor result formats results Semantic Mediawiki Hi all, Recently, a couple of people on OpenEI have asked me how to do compound (or multicolor) maps like this one: Thanks to the new Google Maps v3 API, this is really easy. I put together a quick sample of how this is done, complete with code snippits, here: http://en.openei.org/wiki/User:Jweers/Test5. First, create a compound query, then atttribute a custom marker icon to each query using the ;param=value syntax. The new OpenEI maps extension will take care of the rest. Here is an example of it in use on OpenEI by NREL's Geothermal team:

55

www.cnrs.fr Hello jQuery !  

E-Print Network [OSTI]

www.cnrs.fr Hello jQuery ! par Daric Vladimir @IGM #12;JavaScript ?JavaScript ? · Mauvais choix apparaître ...Firefox 1.0.x, quelques problèmes peuvent apparaître ... #12;Hello jQyeryHello jQyery Demo Demo. #12;« Hello jQuery » décortiqué« Hello jQuery » décortiqué · Step 1 : télécharger jQueryStep 1

van Tiggelen, Bart

56

How big must complete XML query languages be?  

Science Journals Connector (OSTI)

Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete -- that is it cannot express every query definable in firstorder logic over the navigational predicates. How can one extend XPath ...

Clemens Ley; Michael Benedikt

2009-03-01T23:59:59.000Z

57

Mercury: Supporting Scalable Multi-Attribute Range Queries  

E-Print Network [OSTI]

Mercury: Supporting Scalable Multi-Attribute Range Queries Ashwin R. Bharambe Mukesh Agrawal 15213 Abstract This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute range- based searches. Mercury differs from previous range-based query systems in that it supports mul

Keinan, Alon

58

Chaining, Referral, Subscription, Leasing: New Mechanisms in Distributed Query Optimization  

E-Print Network [OSTI]

Chaining, Referral, Subscription, Leasing: New Mechanisms in Distributed Query Optimization Arnaud, exploit!) a rich variety of information ow mechanisms like chaining, referral, proxying, brokering referral (following [33]), is when a site A ships a query to a site B and may get back, instead

Pennsylvania, University of

59

Encoding range minima and range top-2 queries  

Science Journals Connector (OSTI)

...problem of supporting lowest common ancestor (LCA) queries on a binary tree, the Cartesian...answer to RMQ(i,j) is the label of the LCA of the nodes labelled by-i and-j. Thus...in 2n+o(n) bits, while supporting LCA queries in O(1) time. 1 Unfortunately...

2014-01-01T23:59:59.000Z

60

Top-Down XML Keyword Query Processing Junfeng Zhou1  

E-Print Network [OSTI]

keyword query w.r.t. LCA/SLCA/ELCA semantics. By "top-down", we mean that we visit all common ancestor (CA to define meaningful results, for which the basic semantics is Lowest Common Ancestor (LCA). Based on LCA, the most widely adopted query semantics are Exclusive LCA (ELCA) [3,7,10,23,27] and Smallest LCA (SLCA) [3

New South Wales, University of

Note: This page contains sample records for the topic "queries sparql queries" 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

Overhead Analysis of Query Localization Optimization and Wenzheng Xu  

E-Print Network [OSTI]

to localize the query flooding to a limited region of the networks. The simulation results in [3] demonstrated of global flooding and provide an optimization solution to it. We finally perform experimental simulations routing histories to localize the query flood to a limited region of a network. However, the lifetime

Liang, Weifa

62

Preserving and Querying Histories of XML-Published Relational Databases  

E-Print Network [OSTI]

Preserving and Querying Histories of XML-Published Relational Databases Fusheng Wang and Carlo the evolution history of such a view as yet another XML document, whereby the complete history of the database, and identify and select those which are best for representing and querying database histories. We show

Zaniolo, Carlo

63

Efficient Complex Query Support for Multiversion XML Documents  

E-Print Network [OSTI]

Efficient Complex Query Support for Multiversion XML Documents Shu-Yao Chien1 , Vassilis J. Tsotras documents represents a critical requirement for many applications. Also, there has been much recent interest). In this paper, we examine the problem of supporting efficiently complex queries on multiversioned XML documents

Zhang, Donghui

64

Query Processing over Incomplete Autonomous Databases Garrett Wolf Hemal Khatri  

E-Print Network [OSTI]

Query Processing over Incomplete Autonomous Databases Garrett Wolf Hemal Khatri Bhaumik Chokshi}@asu.edu ABSTRACT Incompleteness due to missing attribute values (aka "null values") is very common in autonomous missing attributes, even if they wind up being relevant to a user query. Ideally we would like

Kambhampati, Subbarao

65

Optimizing Nested Queries with Parameter Sort Orders Ravindra Guravannavar  

E-Print Network [OSTI]

Optimizing Nested Queries with Parameter Sort Orders Ravindra Guravannavar Ramanujam H.s@sybase.com Indian Institute of Technology Bombay sudarsha@cse.iitb.ac.in Abstract Nested iteration is an important technique for query evaluation. It is the default way of execut- ing nested subqueries in SQL. Although

Sudarshan, S.

66

Nested Queries in Object Bases Sophie Cluet Guido Moerkotte  

E-Print Network [OSTI]

Nested Queries in Object Bases Sophie Cluet Guido Moerkotte INRIA Lehrstuhl f¨ur Informatik III BP for object­oriented (oo) databases allow nested subqueries. This paper contains (1) the first algebra which is capable of handling arbitrary nested queries and (2) the first complete classification of oo nested

Mannheim, Universität

67

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

68

Article ID: Query Translation on the Fly in Deep Web  

E-Print Network [OSTI]

Article ID: Query Translation on the Fly in Deep Web Integration Jiang Fangjiao, Jia Linlin, Meng users to access the desired information, many researches have dedicated to the Deep Web (i.e. Web databases) integration. We focus on query translation which is an important part of the Deep Web integration

69

Combining query translation techniques to improve cross-language information retrieval  

Science Journals Connector (OSTI)

In this paper we address the combination of query translation approaches for cross-language information retrieval (CLIR). We translate queries with Google Translate and extend them with new translations obtained by mapping noun phrases in the query to ...

Benjamin Herbert; Gyrgy Szarvas; Iryna Gurevych

2011-04-01T23:59:59.000Z

70

Natural Gas EIA-176 Query System Readme(1999)  

Gasoline and Diesel Fuel Update (EIA)

176 Query System Readme 176 Query System Readme 1.0 INTRODUCTION TO THE EIA-176 FRONT END QUERY FACILITY This system provides a method of extracting and using the EIA-176 data, and saving the query results in various mediums and formats. There are pre-set data extractions available, which allow the user to select and run the most often-used queries. 1.1 Hardware Requirements The minimum hardware requirements are: - An IBM-compatible personal computer (PC) 386SX 16 MHZ with 2 megabytes RAM. (A 486DX 33MHZ with 4 megabytes RAM is recommended). - MS-DOS operating system (version 3.x or greater), or compatible, or Network operating system capable of emulating MS-DOS. - MS-DOS file handles should be set to at least 50 in the CONFIG.SYS. In Windows NT, this file is called CONFIG.NT.

71

Increasing ask query limit | OpenEI Community  

Open Energy Info (EERE)

Increasing ask query limit Increasing ask query limit Home > Groups > Utility Rate Rmckeel's picture Submitted by Rmckeel(297) Contributor 22 June, 2012 - 09:30 developer utility rate An NREL user who is trying to use the utility rate service was having an issue. He writes "I noticed that any rates past 10,000 are not accessible via json. For example, this query only returns two entries: http://en.openei.org/services/rest/utility_rates?version=latest&format=json_plain&offset=9998&limit=30&detail=basic". Twong mentioned "It looks like there's a default total max limit of 10000 results retrieved, even for special query pages in SemanticMediawiki. $smwgQMaxLimit Maximal number of results ever retrieved, even when using special query pages. Default: 10000"

72

HDF5-FastQuery: An API for Simplifying Access to Data Storage,Retrieval, Indexing and Querying  

SciTech Connect (OSTI)

This work focuses on research and development activities that bridge a gap between fundamental data management technology index, query, storage and retrieval and use of such technology in computational and computer science algorithms and applications. The work has resulted in a streamlined applications programming interface (API) that simplifies data storage and retrieval using the HDF5 data I/O library, and eases use of the FastBit compressed bitmap indexing software for data indexing/querying. The API, which we call HDF5-FastQuery, will have broad applications in domain sciences as well as associated data analysis and visualization applications.

Bethel, E. Wes; Gosink, Luke; Shalf, John; Stockinger, Kurt; Wu,Kesheng

2006-06-15T23:59:59.000Z

73

Effect of pronunciations on OOV queries in spoken term detection  

E-Print Network [OSTI]

The spoken term detection (STD) task aims to return relevant segments from a spoken archive that contain the query terms whether or not they are in the system vocabulary. This paper focuses on pronunciation modeling for ...

Can, Dogan

74

Semantic Load Shedding for Prioritized Continuous Queries over Data Streams  

Science Journals Connector (OSTI)

A data stream management system (DSMS) has to handle high-volume and bursty data streams with large number of continuous queries. When an input rate of any data stream exceeds the system capacity, the DSMS has to...

Jaeseok Park; Haengrae Cho

2005-01-01T23:59:59.000Z

75

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

76

Updating and Querying Databases that Track Mobile Units  

Science Journals Connector (OSTI)

In this paper, we consider databases representing information about moving objects (e.g., vehicles), particularly their location. We address the problems of updating and querying such databases. Specifically, the update problem is to determine when the ...

Ouri Wolfson; A. Prasad Sistla; Sam Chamberlain; Yelena Yesha

1999-07-01T23:59:59.000Z

77

Say What? Why users choose to speak their web queries Maryam Kamvar, Doug Beeferman  

E-Print Network [OSTI]

a higher probability of being typed than shorter queries. Index Terms: speech, voice, search, Google, query of voice web search (where the query is entered by speaking rather than by keyboard) is sparse, most likely on an aggregate level factors that are correlated with a decision to speak a web search query rather than type it

Tomkins, Andrew

78

An Efficient Query Tree Protocol for RFID Tag Anti-Collision  

E-Print Network [OSTI]

An Efficient Query Tree Protocol for RFID Tag Anti-Collision Ming-Kuei Yeh National Taipei Query Tree (EQT) protocol to improve both the Query Tree (QT) protocol and the Collision Tree (CT and the energy consumption is lessened. In the EQT protocol, the timeslots structure, the query and responses

Jiang, Jehn-Ruey

79

Adaptation of the Concept Hierarchy Model with Search Logs for Query Recommendation on Intranets  

E-Print Network [OSTI]

Adaptation of the Concept Hierarchy Model with Search Logs for Query Recommendation on Intranets for query recommendation on Intranets by ranking terms according to the strength of their links to the query for identical queries and rebuilding it from scratch periodically can be extremely inefficient due to the high

Kruschwitz, Udo

80

Condensative Stream Query Language for Data Streams Lisha Ma1 Werner Nutt2 Hamish Taylor1  

E-Print Network [OSTI]

Condensative Stream Query Language for Data Streams Lisha Ma1 Werner Nutt2 Hamish Taylor1 1 School the answer to a similar non-aggregate query making query processing condensative. Cur- rent proposals for declarative query languages over data streams do not support such condensative pro- cessing. Nor is it yet

Taylor, Hamish

Note: This page contains sample records for the topic "queries sparql queries" 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

Design of FastQuery: How to Generalize Indexing and Querying System for Scientific Data  

SciTech Connect (OSTI)

Modern scientific datasets present numerous data management and analysis challenges. State-of-the-art index and query technologies such as FastBit are critical for facilitating interactive exploration of large datasets. These technologies rely on adding auxiliary information to existing datasets to accelerate query processing. To use these indices, we need to match the relational data model used by the indexing systems with the array data model used by most scientific data, and to provide an efficient input and output layer for reading and writing the indices. In this work, we present a flexible design that can be easily applied to most scientific data formats. We demonstrate this flexibility by applying it to two of the most commonly used scientific data formats, HDF5 and NetCDF. We present two case studies using simulation data from the particle accelerator and climate simulation communities. To demonstrate the effectiveness of the new design, we also present a detailed performance study using both synthetic and real scientific workloads.

Wu, Jerry; Wu, Kesheng

2011-04-18T23:59:59.000Z

82

Parallel Index and Query for Large Scale Data Analysis  

SciTech Connect (OSTI)

Modern scientific datasets present numerous data management and analysis challenges. State-of-the-art index and query technologies are critical for facilitating interactive exploration of large datasets, but numerous challenges remain in terms of designing a system for process- ing general scientific datasets. The system needs to be able to run on distributed multi-core platforms, efficiently utilize underlying I/O infrastructure, and scale to massive datasets. We present FastQuery, a novel software framework that address these challenges. FastQuery utilizes a state-of-the-art index and query technology (FastBit) and is designed to process mas- sive datasets on modern supercomputing platforms. We apply FastQuery to processing of a massive 50TB dataset generated by a large scale accelerator modeling code. We demonstrate the scalability of the tool to 11,520 cores. Motivated by the scientific need to search for inter- esting particles in this dataset, we use our framework to reduce search time from hours to tens of seconds.

Chou, Jerry; Wu, Kesheng; Ruebel, Oliver; Howison, Mark; Qiang, Ji; Prabhat,; Austin, Brian; Bethel, E. Wes; Ryne, Rob D.; Shoshani, Arie

2011-07-18T23:59:59.000Z

83

CRAWLING DEEP WEB CONTENT THROUGH QUERY FORMS Jun Liu, Zhaohui Wu, Lu Jiang, Qinghua Zheng, Xiao Liu  

E-Print Network [OSTI]

CRAWLING DEEP WEB CONTENT THROUGH QUERY FORMS Jun Liu, Zhaohui Wu, Lu Jiang, Qinghua Zheng, Xiao: Deep Web, Deep Web Surfacing, Minimum Executable Pattern, Adaptive Query Abstract: This paper proposes-based Deep Web adaptive query method. The query method extends query interface from single textbox to MEP set

Shamos, Michael I.

84

T-703: Cisco Unified Communications Manager Open Query Interface Lets  

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

703: Cisco Unified Communications Manager Open Query Interface 703: Cisco Unified Communications Manager Open Query Interface Lets Remote Users Obtain Database Contents T-703: Cisco Unified Communications Manager Open Query Interface Lets Remote Users Obtain Database Contents August 26, 2011 - 3:45pm Addthis PROBLEM: A vulnerability was reported in Cisco Unified Communications Manager. A remote user can obtain database contents PLATFORM: Cisco Unified Communications Manager 6.x, 7.x, 8.0, 8.5 ABSTRACT: A remote user can obtain database contents, including authentication credentials. reference LINKS: SecurityTracker Alert ID: 1025971 Cisco Document ID: 113190 IMPACT ASSESSMENT: High Discussion: A vulnerability was reported in Cisco Unified Communications Manager. A remote user can obtain database contents. A remote user can access an open

85

WikiTranslate: Query Translation for Cross-Lingual Information Retrieval Using Only Wikipedia  

Science Journals Connector (OSTI)

This paper presents WikiTranslate, a system which performs query translation for cross-lingual information retrieval (CLIR) using only Wikipedia to obtain translations. Queries are mapped to Wikipedia concepts...

Dong Nguyen; Arnold Overwijk; Claudia Hauff

2009-01-01T23:59:59.000Z

86

A Genetic Algorithm for Load Balancing in Parallel Query Evaluation for Deductive Relational Data Bases  

Science Journals Connector (OSTI)

Datalog is a query language for deductive databases. This language allows to evaluate a query incrementally on a network of processes. The tuples flow among them in parallel in order to compute the solution to...

E. Alba; J. F. Aldana; J. M. Troya

1995-01-01T23:59:59.000Z

87

Dynamic LCA Queries on Trees # Richard Cole + Ramesh Hariharan #  

E-Print Network [OSTI]

Dynamic LCA Queries on Trees # Richard Cole + Ramesh Hariharan # Abstract We show how to maintain. The primary use of LCA computations in a su#x tree is to determine the longest common prefix of two substrings common ancestor of the corresponding nodes. The first constant time LCA computation algorithm was due

Cole, Richard

88

Complex Group-By Queries for XML C. Gokhale+  

E-Print Network [OSTI]

CDs, etc. Books are organized by Subject, e.g., physics, chemistry. For each book- termediate result of a query. The catalogue is heteroge- neous: it contains information about books, music, there is information on its Title, Author, Year, #Sold, Price, (publisher) Name, etc. Books may have multiple authors

Ng, Raymond T.

89

PET: Reducing Database Energy Cost via Query Optimization  

E-Print Network [OSTI]

the potential of energy saving. However, the state-of-art architec- ture of DBMS does not take energy usage the existence of and study the energy-saving potential of many energy-efficient query plans. The database increase of energy cost in database services [3, 5]. Techniques such as hard- ware power-model control

Tu, Yicheng

90

Active Query Forwarding in Sensor Networks Narayanan Sadagopan  

E-Print Network [OSTI]

, response latency and storage requirements. We show that with optimal parameter settings, depending on the update frequency, ACQUIRE obtains order of magnitude reduction over FBQ and potentially 60 to 85% energy days with a frequency of 1 measurement per hour") versus One-shot queries, which have a simple response

Krishnamachari, Bhaskar

91

WEB QUERY STRUCTURE: IMPLICATIONS FOR IR SYSTEM DESIGN  

E-Print Network [OSTI]

WEB QUERY STRUCTURE: IMPLICATIONS FOR IR SYSTEM DESIGN Bernard J. Jansen Computer Science Program Military Academy West Point, New York 10996 Please Cite: Jansen, B. J., Spink, A., & Pfaff, A. 2000. Web in the context of the Web (Jansen, Spink, & Saracevic, 2000; Jansen and Pooch (under review), Lawrence & Giles

Jansen, James

92

3-query locally decodable codes of subexponential length  

Science Journals Connector (OSTI)

Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of the codeword is damaged. In a recent work [Yek08] Yekhanin constructs a ... Keywords: PIR schemes, locally decodable codes, private information retrieval schemes

Klim Efremenko

2009-05-01T23:59:59.000Z

93

CAT: Correct Answers of Continuous Queries Using Triggers  

E-Print Network [OSTI]

down the speed between 4:30PM and 9:30PM. Tr1 enters that segment after 4:30PM, and its future portion, issued the query Q1, we have to re-evaluate the answer. Research partially supported by NSF grant EIA-000

Scheuermann, Peter

94

Assertion Absorption in Object Queries over Knowledge Bases  

E-Print Network [OSTI]

Assertion Absorption in Object Queries over Knowledge Bases Jiewen Wu, Alexander Hudek, David Toman contribute to this development by introducing a novel adaptation of bi- nary absorption for DL knowledge satisfaction problems in which consistency is assumed, and then revisit absorption in this new setting. To date

Waterloo, University of

95

A Comparative Study of Code Query Technologies Tiago L. Alves  

E-Print Network [OSTI]

A Comparative Study of Code Query Technologies Tiago L. Alves Jurriaan Hage Peter Rademaker t.alves@sig.eu Jurriaan Hage University of Utrecht, Netherlands jur@cs.uu.nl Peter Rademaker University of Utrecht, Netherlands peter.rademaker@gmail.com Abstract When analyzing software systems we

Utrecht, Universiteit

96

DATA CONCERN AWARE QUERYING FOR THE INTEGRATION OF DATA SERVICES  

E-Print Network [OSTI]

DATA CONCERN AWARE QUERYING FOR THE INTEGRATION OF DATA SERVICES Muhammad Intizar Ali, Reinhard,dustdar}@infosys.tuwien.ac.at Keywords: Data Services, Database as a Service, Data Services Integration, Data Concerns, XQuery. Abstract: There is an increasing trend for organizations to publish data over the web using data services. The published data

Dustdar, Schahram

97

Tools of the Job Queries, Reports, Resources Account Management  

E-Print Network [OSTI]

Tools of the Job ­ Queries, Reports, Resources Account Management The minimum required review trans detail, Ledger, grants award, and Invoice tables. The invoice tables are used by the dean's office of a grant or contract such as the chartstring, begin date, end date, sponsor, etc. The ledger data contains

98

Sequencing XML data and query twigs for fast pattern matching  

Science Journals Connector (OSTI)

We propose a new way of indexing XML documents and processing twig patterns in an XML database. Every XML document in the database can be transformed into a sequence of labels by prfer's method that constructs a one-to-one correspondence between ... Keywords: XML indexing, prfer sequences, twig query processing

Praveen Rao; Bongki Moon

2006-03-01T23:59:59.000Z

99

Type-based detection of XML query-update independence  

Science Journals Connector (OSTI)

This paper presents a novel static analysis technique to detect XML query-update independence, in the presence of a schema. Rather than types, our system infers chains of types. Each chain represents a path that can be traversed on a valid document ...

Nicole Bidoit-Tollu; Dario Colazzo; Federico Ulliana

2012-05-01T23:59:59.000Z

100

Scaling XML query processing: distribution, localization and pruning  

Science Journals Connector (OSTI)

Distributing data collections by fragmenting them is an effective way of improving the scalability of a database system. While the distribution of relational data is well understood, the unique characteristics of the XML data and query model present ... Keywords: Distributed, Localization, Pruning, XML

Patrick Kling; M. Tamer zsu; Khuzaima Daudjee

2011-10-01T23:59:59.000Z

Note: This page contains sample records for the topic "queries sparql queries" 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

WikiTranslate: query translation for cross-lingual information retrieval using only Wikipedia  

Science Journals Connector (OSTI)

This paper presents WikiTranslate, a system which performs query translation for cross-lingual information retrieval (CLIR) using only Wikipedia to obtain translations. Queries are mapped to Wikipedia concepts and the corresponding translations of these ... Keywords: Wikipedia, comparable corpus, cross-lingual information retrieval, query translation, word sense disambiguation

Dong Nguyen; Arnold Overwijk; Claudia Hauff; Dolf R. B. Trieschnigg; Djoerd Hiemstra; Franciska De Jong

2008-09-01T23:59:59.000Z

102

Automatic Reformulation of Children's Search Queries Maarten van Kalsbeek, Joost de Wit, Dolf Trieschnigg,  

E-Print Network [OSTI]

Terms Algorithms, Human Factors, Design Keywords Automatic Query Expansion, Search Behavior, 1 children may make. Most of the search engines offer only the possibility to enter a Boolean queryAutomatic Reformulation of Children's Search Queries Maarten van Kalsbeek, Joost de Wit, Dolf

Hiemstra, Djoerd

103

SEARCHING FOR MULTIMEDIA: AN ANALYSIS OF AUDIO, VIDEO, AND IMAGE WEB QUERIES  

E-Print Network [OSTI]

search engine. From this data set, terms were used to identify queries for audio, image, and video multimedia files by searching for file extensions and matching the filename to terms in the query (WittenSEARCHING FOR MULTIMEDIA: AN ANALYSIS OF AUDIO, VIDEO, AND IMAGE WEB QUERIES Bernard J. Jansen

Jansen, James

104

Query Processing and Inverted Indices in Shared-Nothing Text Document Information Retrieval Systems  

E-Print Network [OSTI]

Query Processing and Inverted Indices in Shared-Nothing Text Document Information Retrieval Systems by the organization of the inverted index. This paper compares the performance impact on query processing of various physical organizations for inverted lists. We present a new probabilistic model of the database and queries

Zimmerman, John

105

Publishing and Querying the Histories of Archived Relational Databases in XML Fusheng Wang Carlo Zaniolo  

E-Print Network [OSTI]

Publishing and Querying the Histories of Archived Relational Databases in XML Fusheng Wang Carlo queries on past content of database relations and their evo- lution. Indeed, using XML, the histories mappings from relations to XML that are most conducive to modeling and query- ing database histories

Zaniolo, Carlo

106

The Effects of Search Engines and Query Operators on Top Ranked Results Bernard J. Jansen  

E-Print Network [OSTI]

The Effects of Search Engines and Query Operators on Top Ranked Results Bernard J. Jansen School of the advanced query operators. Jansen (2000) examines the changes in results when different searching operators queries [3, 4, 8]. Jansen et al. [3] reports a Boolean operator usage of about 8%. Silverstein et al. [8

Jansen, James

107

Fuzzy Rough Set Based Web Query Expansion Martine De Cock and Chris Cornelis  

E-Print Network [OSTI]

Fuzzy Rough Set Based Web Query Expansion Martine De Cock and Chris Cornelis Fuzziness, Krijgslaan 281 (S9), 9000 Gent, Belgium {Martine.DeCock, Chris.Cornelis}@UGent.be Abstract Fuzzy rough set on average -- we focus on query ex- pansion, i.e. the process of adding related terms to the query. Rough set

Gent, Universiteit

108

ANDES: efficient evaluation of NOT-twig queries in relational databases  

Science Journals Connector (OSTI)

Despite a large body of work on XPath query processing in relational environment, systematic study of queries containing not-predicates have received little attention in the literature. Particularly, several xml supports of industrial-strength commercial ... Keywords: NOT-twig, Performance, Plan diagrams, Relational database, Twig evaluation tree, XML query processing, Xpath

Kheng Hong Soh; Ba Quan Truong; Sourav S. Bhowmick

2012-12-01T23:59:59.000Z

109

In-Route Nearest Neighbor Queries Jin Soung Yoo Shashi Shekhar  

E-Print Network [OSTI]

query [4, 14] (e.g., "find the nearest gas station to my hotel"). A variant to the point-NN query is a closest pair query between two point datasets [1, 7] (e.g., "find the pair of a gas station of any point on the line segments [26, 27] (e.g., "find all nearest gas stations on my route from

Shekhar, Shashi

110

SEEDEEP: A System for Exploring and Querying Scientific Deep Web Data Sources  

E-Print Network [OSTI]

SEEDEEP: A System for Exploring and Querying Scientific Deep Web Data Sources Fan Wang Gagan that are hidden behind query forms, thus forming what is re- ferred to as the deep web. In this paper, we propose SEEDEEP, a System for Exploring and quErying scientific DEEP web data sources. SEEDEEP is able

Agrawal, Gagan

111

Fig. 1. The conversational case retrieval process in CCBR CaseQuery := Case-Query-formalize(InitialProblemDescription);  

E-Print Network [OSTI]

Fig. 1. The conversational case retrieval process in CCBR CaseQuery := Case questions to ask the user in the conversational process. There are two ways to realize this task: one successfully probed in the troubleshooting domain [3], and in the selection of products or services in E

Aamodt, Agnar

112

VIQI: A New Approach for Visual Interpretation of Deep Web Query Interfaces  

E-Print Network [OSTI]

Deep Web databases contain more than 90% of pertinent information of the Web. Despite their importance, users don't profit of this treasury. Many deep web services are offering competitive services in term of prices, quality of service, and facilities. As the number of services is growing rapidly, users have difficulty to ask many web services in the same time. In this paper, we imagine a system where users have the possibility to formulate one query using one query interface and then the system translates query to the rest of query interfaces. However, interfaces are created by designers in order to be interpreted visually by users, machines can not interpret query from a given interface. We propose a new approach which emulates capacity of interpretation of users and extracts query from deep web query interfaces. Our approach has proved good performances on two standard datasets.

Boughamoura, Radhouane; Omri, Mohamed Nazih

2012-01-01T23:59:59.000Z

113

FastQuery: A Parallel Indexing System for Scientific Data  

SciTech Connect (OSTI)

Modern scientific datasets present numerous data management and analysis challenges. State-of-the- art index and query technologies such as FastBit can significantly improve accesses to these datasets by augmenting the user data with indexes and other secondary information. However, a challenge is that the indexes assume the relational data model but the scientific data generally follows the array data model. To match the two data models, we design a generic mapping mechanism and implement an efficient input and output interface for reading and writing the data and their corresponding indexes. To take advantage of the emerging many-core architectures, we also develop a parallel strategy for indexing using threading technology. This approach complements our on-going MPI-based parallelization efforts. We demonstrate the flexibility of our software by applying it to two of the most commonly used scientific data formats, HDF5 and NetCDF. We present two case studies using data from a particle accelerator model and a global climate model. We also conducted a detailed performance study using these scientific datasets. The results show that FastQuery speeds up the query time by a factor of 2.5x to 50x, and it reduces the indexing time by a factor of 16 on 24 cores.

Chou, Jerry; Wu, Kesheng; Prabhat,

2011-07-29T23:59:59.000Z

114

U-038: BIND 9 Resolver crashes after logging an error in query.c |  

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

8: BIND 9 Resolver crashes after logging an error in query.c 8: BIND 9 Resolver crashes after logging an error in query.c U-038: BIND 9 Resolver crashes after logging an error in query.c November 16, 2011 - 8:37am Addthis PROBLEM: BIND 9 Resolver crashes after logging an error in query.c. PLATFORM: Multiple version of BIND 9. Specific versions under investigation ABSTRACT: A remote server can cause the target connected client to crash. Organizations across the Internet are reporting crashes interrupting service on BIND 9 nameservers performing recursive queries. Affected servers crash after logging an error in query.c with the following message: "INSIST(! dns_rdataset_isassociated(sigrdataset))" Multiple versions are reported as being affected, including all currently supported release versions of ISC BIND 9. ISC is actively investigating the root cause and

115

V-204: A specially crafted query can cause BIND to terminate abnormally |  

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

V-204: A specially crafted query can cause BIND to terminate V-204: A specially crafted query can cause BIND to terminate abnormally V-204: A specially crafted query can cause BIND to terminate abnormally July 27, 2013 - 4:35am Addthis PROBLEM: A specially crafted query that includes malformed rdata can cause named to terminate with an assertion failure while rejecting the malformed query. PLATFORM: BIND 9.7 ABSTRACT: A specially crafted query sent to a BIND nameserver can cause it to crash (terminate abnormally). REFERENCE LINKS: ISC Knowledge Base CVE-2013-4854 IMPACT ASSESSMENT: High DISCUSSION: BIND is an implementation of the Domain Name System (DNS) protocols. Authoritative and recursive servers are equally vulnerable. Intentional exploitation of this condition can cause a denial of service in all nameservers running affected versions of BIND 9. Access Control Lists do

116

Adaptive Join Query Processing in Data Grids: Exploring Relation Partial Replicas and Load Balancing  

Science Journals Connector (OSTI)

Query processing in data grids is a complex issue due to ... investigates the issues and proposes an adaptive, load-balanced join processing approach. Analytical and experimental...

Donghua Yang; Jianzhong Li; Hong Gao

2007-01-01T23:59:59.000Z

117

Real time search on the web: Queries, topics, and economic value Bernard J. Jansen a,  

E-Print Network [OSTI]

examine aggregate usage of the search engine, including number of users, queries, and terms. We term interest in a topic and the polling nature of real time queries. Concerning search topics geographical affinity, pointing to a location-based aspect to real time search. In terms of economic value, we

Jansen, James

118

Particle swarm optimization with query-based learning for multi-objective power contract problem  

Science Journals Connector (OSTI)

Particle swarm optimization (PSO) is one of the most important research topics on swarm intelligence. Existing PSO techniques, however, still contain some significant disadvantages. In this paper, we present a new QBL-PSO algorithm that uses QBL (query-based ... Keywords: Multi-objective optimization, Particle swarm optimization, Power contract, Query-based learning

Ray-I Chang; Shu-Yu Lin; Yuhsin Hung

2012-02-01T23:59:59.000Z

119

Efficient Query-Based Data Collection for Mobile Wireless Monitoring Applications  

Science Journals Connector (OSTI)

......of applications, including smart battlefield, environment and...whole network into several small grids.) for query and data transmission...maintaining and recalculating the grid would be very high [31...important class of queries that can benefit from algorithms that are tailored......

Long Cheng; Yimin Chen; Canfeng Chen; Jian Ma; Lei Shu; Athanasios V. Vasilakos; Naixue Xiong

2010-12-01T23:59:59.000Z

120

Joint Video and Text Parsing for Understanding Events and Answering Queries  

E-Print Network [OSTI]

1 Joint Video and Text Parsing for Understanding Events and Answering Queries Kewei Tu, Meng Meng to process video and text jointly for understanding events and answering user queries. Our framework produces) in the video and text. The knowledge representation of our framework is based on a spatial-temporal-causal And

Zhu, Song Chun

Note: This page contains sample records for the topic "queries sparql queries" 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

Understanding Query Complexity and its Implications for Energy-Efficient Web Search Emily Bragg,1  

E-Print Network [OSTI]

Understanding Query Complexity and its Implications for Energy-Efficient Web Search Emily Bragg,1 the workload as a large, monolithic piece of software. But a workload is often comprised of many, diverse software tasks. For example, a web search engine executes many individual queries. There is a vast

Lee, Benjamin C.

122

A SpatioTemporal Placement Model for Caching Location Dependent Queries Anand Murugappan and Ling Liu  

E-Print Network [OSTI]

objects of the location queries are still ob- jects such as gas stations, restaurants, or moving objects is driving on the I85 North highway at 60 mph speed, and wants to find the nearest gas stations within certain range. If the query is asking for gas stations within 5 miles, then the spatial validity

Liu, Ling

123

Energy-Efficient Multiple Routing Trees for Aggregate Query Evaluation in Sensor Networks  

E-Print Network [OSTI]

Energy-Efficient Multiple Routing Trees for Aggregate Query Evaluation in Sensor Networks Yuzhen is of paramount importance. Energy-efficient routing trees built for in-network pro- cessing play a central role multiple routing trees in sensor networks for the evaluation of a class of aggre- gate queries including

Liang, Weifa

124

Spatial Querying of Imaging Mass Spectrometry Data for the Biochemical Characterization of Anatomical Regions in Tissue  

E-Print Network [OSTI]

Spatial Querying of Imaging Mass Spectrometry Data for the Biochemical Characterization tissue section. In this paper we develop methods that enable spatial querying of MSI data. The objective that adds spatial information to mass spectral biochemical analysis. It delivers insight into the spatial

125

Supporting retrieval of diverse biomedical data using evidence-aware queries  

Science Journals Connector (OSTI)

Though there have been many advances in providing access to linked and integrated biomedical data across repositories, developing methods which allow users to specify ambiguous and exploratory queries over disparate sources remains a challenge to extracting ... Keywords: Bioinformatics, Data diversity and provenance, Data integration, Database management, Information storage and retrieval, Ontology, Query language

Eithon Cadag; Peter Tarczy-Hornoch

2010-12-01T23:59:59.000Z

126

A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks  

E-Print Network [OSTI]

A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye and B. Sikdar a "Dynamic Query-tree Energy Balancing" (DQEB) protocol to dynamically adjust the tree structure and minimize networks. In [15] it has been shown that the minimum- energy broadcast tree problem is NP

Sikdar, Biplab

127

A LINGUISITICAL ANALYSIS OF WORLD WIDE WEB QUERIES Bernard J. Jansen  

E-Print Network [OSTI]

A LINGUISITICAL ANALYSIS OF WORLD WIDE WEB QUERIES Bernard J. Jansen Computer Science Program@exmail.usma.edu Please Cite: Jansen, B. J., Spink, A., & Pfaff, A. 2000. Linguistic Aspects of Web Queries. American. There is also a growing body of literature focusing on IR in the context of the Web (Croft, 1995; Jansen, Spink

Jansen, James

128

Distributed XML Repositories: Top-down Design and Transparent Query Processing  

E-Print Network [OSTI]

Distributed XML Repositories: Top-down Design and Transparent Query Processing Michael Gertz Jan over the Web. However, design and query processing models for distributed XML data have not yet been studied in detail. The goal of this paper is to study the design and management of distributed XML

Gertz, Michael

129

Performance of a distributed architecture for query processing on workstation clusters  

Science Journals Connector (OSTI)

A network of workstations (NOWs) is an attractive alternative to parallel database systems due to the cost advantage. In a typical database, client workstations (nodes) submit queries/transactions and receive responses from the database server. With ... Keywords: load sharing, networks of workstations, parallel database systems, parallel query processing, workstation clusters

Cyrus Soleimany; Sivarama P. Dandamudi

2003-05-01T23:59:59.000Z

130

QPIAD: Query Processing over Incomplete Autonomous Databases Hemal Khatri Jianchun Fan Yi Chen Subbarao Kambhampati  

E-Print Network [OSTI]

QPIAD: Query Processing over Incomplete Autonomous Databases Hemal Khatri Jianchun Fan Yi Chen.khatri,jcf,yi,rao}@asu.edu Abstract Incompleteness due to missing attribute values (aka "null values") is very common in autonomous missing attributes, even if they wind up being rel- evant to a user query. Ideally we would like

Chen, Yi

131

Query Optimization as a Datalog Program Mengmeng Liu, Zachary G. Ives, and Boon Thau Loo  

E-Print Network [OSTI]

Query Optimization as a Datalog Program Mengmeng Liu, Zachary G. Ives, and Boon Thau Loo University is that of specifying the transformation rules and search process of a query optimizer [1]. In certain emerging domains universally understood than the languages used in transformational optimizers like those generated by Volcano

Loo, Boon Thau

132

Rethinking Query Processing for Energy Efficiency: Slowing Down to Win the Race  

E-Print Network [OSTI]

Rethinking Query Processing for Energy Efficiency: Slowing Down to Win the Race Willis Lang of an energy efficiency metric along with traditional performance metrics. This change is fueled by the growing, real, and urgent demand for energy-efficient database processing. Database query processing engines

Patel, Jignesh

133

GUIDAGE: A FAST AUDIO QUERY GUIDED ASSEMBLAGE Arshia Cont Shlomo Dubnov Gerard Assayag  

E-Print Network [OSTI]

GUIDAGE: A FAST AUDIO QUERY GUIDED ASSEMBLAGE Arshia Cont Shlomo Dubnov G´erard Assayag UCSD, Music for fast and auto- matic retrieval of factors of audio content in a large au- dio database based on user's audio query. The proposed method, unlike most existing systems, takes explicit con- siderations

Paris-Sud XI, Université de

134

Query Planning for Searching Inter-Dependent Deep-web Databases  

E-Print Network [OSTI]

Query Planning for Searching Inter-Dependent Deep-web Databases Fan Wang1 , Gagan Agrawal1 query forms, thus forming what is referred to as the deep web. It is de- sirable to have systems data retrieval from the deep web. However, such systems need to address the following challenges. First

Agrawal, Gagan

135

Query Planning for Searching Inter-dependent Deep-Web Databases  

E-Print Network [OSTI]

Query Planning for Searching Inter-dependent Deep-Web Databases Fan Wang1 , Gagan Agrawal1 query forms, thus forming what is referred to as the deep web. It is de- sirable to have systems data retrieval from the deep web. However, such systems need to address the following challenges. First

Jin, Ruoming

136

Analysis of An Expert Search Query Log Yi Fang, Naveen Somasundaram, Luo Si, Jeongwoo Ko, Aditya P. Mathur  

E-Print Network [OSTI]

more advanced search features, with fewer queries in a session, than general Web search users do common queries, and use more advanced search features, with fewer queries in a session, than general Web universities in Indiana [3]. Besides the basic search function, INDURE also provides an advanced search

Tomkins, Andrew

137

Query PreExecution and Batching in Paradise: ATwoPronged Approach to the Efficient Processing of  

E-Print Network [OSTI]

of Queries on Tape­Resident Raster Images 1 JieBing Yu David J. DeWitt Department of Computer Sciences­ structured organization for tape volumes. Second, the Paradise query processing engine was modified to in tape scheduling, and query batching. A per­ formance evaluation on a working prototype demon­ strates

Liblit, Ben

138

Query Pre-Execution and Batching in Paradise: A Two-Pronged Approach to the Efficient Processing of  

E-Print Network [OSTI]

of Queries on Tape-Resident Raster Images1 JieBing Yu David J. DeWitt Department of Computer Sciences-structured organization for tape volumes. Second, the Paradise query processing engine was modified to incorporate a number of novel mechanisms including query pre-execution, object abstraction, cache-conscious tape

Liblit, Ben

139

Large-scale cross-media retrieval of WikipediaMM images with textual and visual query expansion  

Science Journals Connector (OSTI)

In this paper, we present our approaches for the WikipediaMM task at ImageCLEF 2008. We first experimented with a text-based image retrieval approach with query expansion, where the extension terms were automatically selected from a knowledge base that ... Keywords: cross-media re-ranking, image retrieval, query-dependent visual concept detection, textual query expansion

Zhi Zhou; Yonghong Tian; Yuanning Li; Tiejun Huang; Wen Gao

2008-09-01T23:59:59.000Z

140

LigDig: a web server for querying ligand-protein interactions  

Science Journals Connector (OSTI)

......unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited. LigDig: a web server for querying ligand-protein interactions Jonathan C. Fuller 1 * Michael Martinez 1 Stefan Henrich 1 Antonia Stank 1......

Jonathan C. Fuller; Michael Martinez; Stefan Henrich; Antonia Stank; Stefan Richter; Rebecca C. Wade

2014-11-01T23:59:59.000Z

Note: This page contains sample records for the topic "queries sparql queries" 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

SPARQLGraph: a web-based platform for graphically querying biological Semantic Web databases  

Science Journals Connector (OSTI)

Semantic Web has established itself as a framework for ... and database boundaries. Here, we present a web-based platform for querying biological Semantic Web databases in a graphical way.

Dominik Schweiger; Zlatko Trajanoski; Stephan Pabinger

2014-08-01T23:59:59.000Z

142

An Application of Multivariate Statistical Analysis for Query-Driven Visualization  

SciTech Connect (OSTI)

Abstract?Driven by the ability to generate ever-larger, increasingly complex data, there is an urgent need in the scientific community for scalable analysis methods that can rapidly identify salient trends in scientific data. Query-Driven Visualization (QDV) strategies are among the small subset of techniques that can address both large and highly complex datasets. This paper extends the utility of QDV strategies with a statistics-based framework that integrates non-parametric distribution estimation techniques with a new segmentation strategy to visually identify statistically significant trends and features within the solution space of a query. In this framework, query distribution estimates help users to interactively explore their query's solution and visually identify the regions where the combined behavior of constrained variables is most important, statistically, to their inquiry. Our new segmentation strategy extends the distribution estimation analysis by visually conveying the individual importance of each variable to these regions of high statistical significance. We demonstrate the analysis benefits these two strategies provide and show how they may be used to facilitate the refinement of constraints over variables expressed in a user's query. We apply our method to datasets from two different scientific domains to demonstrate its broad applicability.

Gosink, Luke J.; Garth, Christoph; Anderson, John C.; Bethel, E. Wes; Joy, Kenneth I.

2010-03-01T23:59:59.000Z

143

PRESY: A Context Based Query Reformulation Tool for Information Retrieval on the Web  

E-Print Network [OSTI]

Problem Statement: The huge number of information on the web as well as the growth of new inexperienced users creates new challenges for information retrieval. It has become increasingly difficult for these users to find relevant documents that satisfy their individual needs. Certainly the current search engines (such as Google, Bing and Yahoo) offer an efficient way to browse the web content. However, the result quality is highly based on uses queries which need to be more precise to find relevant documents. This task still complicated for the majority of inept users who cannot express their needs with significant words in the query. For that reason, we believe that a reformulation of the initial user's query can be a good alternative to improve the information selectivity. This study proposes a novel approach and presents a prototype system called PRESY (Profile-based REformulation SYstem) for information retrieval on the web. Approach: It uses an incremental approach to categorize users by constructing a c...

Bouramoul, Abdelkrim; Doan, Bich-Lien; 10.3844/jcssp.2010.470.477

2011-01-01T23:59:59.000Z

144

U-270:Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query  

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

0:Trend Micro Control Manager Input Validation Flaw in Ad Hoc 0:Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query Module Lets Remote Users Inject SQL Commands U-270:Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query Module Lets Remote Users Inject SQL Commands September 28, 2012 - 6:00am Addthis PROBLEM: Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query Module Lets Remote Users Inject SQL Commands PLATFORM: Control Manager - 3.0, 3.5, 5.0, 5.5, 6.0 ABSTRACT: Trend Micro has been notified of a potential product vulnerability in Control Manager. reference LINKS: Trend Micro Technical Support ID 1061043 SecurityTracker Alert ID: 1027584 Secunia Advisory SA50760 CVE-2012-2998 IMPACT ASSESSMENT: Medium Discussion: A vulnerability has been reported in Trend Micro Control Manager, which can

145

A new spatio-temporal prediction approach based on aggregate queries  

Science Journals Connector (OSTI)

The prediction of spatio-temporal data streams which is based on aggregate queries has been an important research direction in the research field of databases. More and more methods have been proposed to obtain approximate aggregate results. However, they will consume a lot of time and storage space. This paper proposes Dynamic Sketch (DS) index by using modified method of Adaptive Multi-dimensional Histogram (AMH*) to intelligently partition static sketch which can improve the approximate quality of aggregate queries in road networks. Then, based on DS index, this paper proposes a new prediction approach over data streams in road networks using Self-Adaptive Exponential Smoothing (SAES).

Jun Feng; Zhonghua Zhu; Yaqing Shi; Liming Xu

2013-01-01T23:59:59.000Z

146

AUDIO SEGMENT RETRIEVAL USING A SHORT DURATION EXAMPLE QUERY Atulya Velivelli, ChengXiang Zhai, and Thomas S. Huang  

E-Print Network [OSTI]

AUDIO SEGMENT RETRIEVAL USING A SHORT DURATION EXAMPLE QUERY Atulya Velivelli, ChengXiang Zhai propose a general approach to audio segment re- trieval using a synthesized HMM. The approach allows a user to query audio data by an example audio segment of a short dura- tion and find similar segments

Zhai, ChengXiang

147

Web Intelligence and Agent Systems: An International Journal 0 (2010) 10 1 Selecting Queries from Sample to Crawl  

E-Print Network [OSTI]

Queries from Sample to Crawl Deep Web Data Sources Yan Wang a Jianguo Lu a,c Jie Liang a Jessica Chen crawl a deep web data source using a set of sample documents. Crawling deep web is the process of collecting data from search interfaces by issuing queries. One of the major challenges in crawling deep web

Lu, Jianguo

148

An efficient parallel pathstack algorithm for processing XML twig queries on multi-core systems  

Science Journals Connector (OSTI)

Multi-cores are more and more popular recently and have being altered the course of computing. Traditional XPath query evaluation algorithms cannot take full advantages of multi-cores, and it is not straightforward to adapt such algorithms on multi-cores. ... Keywords: PathStack, multi-core, parallel, partition

Jianhua Feng; Le Liu; Guoliang Li; Jianhui Li; Yuanhao Sun

2010-04-01T23:59:59.000Z

149

Analyzing the Performance of a Multiobjective GA-P Algorithm for Learning Fuzzy Queries in  

E-Print Network [OSTI]

Analyzing the Performance of a Multiobjective GA-P Algorithm for Learning Fuzzy Queries in a Machine Learning Environment Oscar Cord´on1 , Enrique Herrera-Viedma1 , Mar´ia Luque1 , F´elix de Moya2- tionary algorithms (EAs) [1], such as genetic algorithm-programming (GA-P) [11] or simulated annealing

Fernandez, Thomas

150

Optimizing Repair Programs for Consistent Query Answering Monica Caniupan and Leopoldo Bertossi  

E-Print Network [OSTI]

, a logic programming system that implements the stable models semantics, in particular. We also analyze be restored minimally by inserting Q(a) or elim- inating S(a). The repair program contains the following 1Optimizing Repair Programs for Consistent Query Answering Monica Caniupan and Leopoldo Bertossi

Bertossi, Leopoldo

151

Calder Query Grid Service: Insights and Experimental Evaluation Nithya N. Vijayakumar, Ying Liu and Beth Plale  

E-Print Network [OSTI]

Calder Query Grid Service: Insights and Experimental Evaluation Nithya N. Vijayakumar, Ying Liu to a Grid services framework. Experimental results reveal limits on stream processing rates, providing customized access and mini- mal, efficient preprocessing. We model a data resource as a logical

Plale, Beth

152

Demonstration of User Interfaces for Querying in 3D Architectural Content in PROBADO3D  

E-Print Network [OSTI]

]) (cf. Figure 1(b)). The other uses the modeling capabilities of Google Sketchup [3] (cf. Figure 1(c of the answer models as a query-by-example key. (a) Building model (b) Volume editor (c) Google Sketchup: Google sketchup (2009) http://sketchup.google.com/. #12;

Eckmiller, Rolf

153

Keyword-based, Context-aware Selection of Natural Language Query Patterns  

E-Print Network [OSTI]

Keyword-based, Context-aware Selection of Natural Language Query Patterns Giorgio Orsi Politecnico operational context in many application domains. In these scenarios data access may be thwarted by the scarce in cardiology to support medical personnel in emergency interventions on patients affected by chronic cerebro

Orsi, Giorgio

154

Query Processing for Probabilistic State Diagrams Describing Multiple Robot Navigation in an Indoor Environment  

SciTech Connect (OSTI)

This paper describes the syntax and semantics of multi-level state diagrams to support probabilistic behavior of cooperating robots. The techniques are presented to analyze these diagrams by querying combined robots behaviors. It is shown how to use state abstraction and transition abstraction to create, verify and process large probabilistic state diagrams.

Czejdo, Bogdan [ORNL; Bhattacharya, Sambit [North Carolina Fayetteville State University; Ferragut, Erik M [ORNL

2012-01-01T23:59:59.000Z

155

Video Fingerprinting: Features for Duplicate and Similar Video Detection and Query-based Video Retrieval  

E-Print Network [OSTI]

Video Fingerprinting: Features for Duplicate and Similar Video Detection and Query-based Video and Computer Engineering University of California, Santa Barbara, CA 93106 ABSTRACT A video "fingerprint" is a feature extracted from the video that should represent the video compactly, allowing faster search without

California at Santa Barbara, University of

156

Joint Video and Text Parsing for Understanding Events and Answering Queries  

E-Print Network [OSTI]

1 Joint Video and Text Parsing for Understanding Events and Answering Queries Kewei Tu, Meng Meng, Mun Wai Lee, Tae Eun Choe, Song-Chun Zhu Abstract--We propose a framework for parsing video and text (actions and events) and causal information (causalities between events and fluents) in the video and text

Zhu, Song Chun

157

Topic Distillation with Query-Dependent Link Connections and Page Characteristics  

E-Print Network [OSTI]

6 Topic Distillation with Query-Dependent Link Connections and Page Characteristics MINGFANG WU about a topic. Finding such results is called topic distillation. Previous research has shown statistics. This article presents a new approach to improve topic distillation by exploring the use

Wu, Mingfang

158

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

159

Optimal Ordering of Selections and Joins in Acyclic Queries with Expensive Predicates  

E-Print Network [OSTI]

optimal left­deep trees with cross products for star queries is NP­complete [1]. The first polynomial time tree. The special case is characterized by the following statements: 1. only left­deep trees and projections are generally treated by ''push­down rules''. According to these, selections and projections

Mannheim, Universität

160

ILP, the Blind, and the Elephant: Euclidean Embedding of Co-Proven Queries  

E-Print Network [OSTI]

ILP, the Blind, and the Elephant: Euclidean Embedding of Co-Proven Queries Hannes Schulz1. The situation is very much as in the parable of the blind men and the elephant that appears in many cultures told them, "Hey, there is an elephant in the village today." They had no idea what an elephant is

Behnke, Sven

Note: This page contains sample records for the topic "queries sparql queries" 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

Characterizing Web Search Queries that Match Very Few or No Results  

E-Print Network [OSTI]

Research Center Hannover, Germany altingovde@l3s.de Roi Blanco Yahoo! Research Barcelona, Spain roi accompany the original results with some alternative query suggestions (e.g., with a notification by the search engines via both quantitative analyses and user studies on our data (Section 3). To the best

Ulusoy, ?zgür

162

The Impact of Query Length and Document Length on Book Search Effectiveness  

E-Print Network [OSTI]

search is an important track at INEX ­ books are generally much larger documents than the scientificThe Impact of Query Length and Document Length on Book Search Effectiveness Mingfang Wu, Falk for the Evaluation of XML retrieval (INEX) book search track in 2008, specifically the book retrieval task. Book

Wu, Mingfang

163

Experiments with Document and Query Representations for a Terabyte of Text  

E-Print Network [OSTI]

Experiments with Document and Query Representations for a Terabyte of Text Jaap Kamps1,2 1 ISLA, University of Amsterdam Abstract: As part of the TREC 2006 Terabyte track, we conducted a range of various web-centric document representations based on document-text, incoming anchor-texts, and page

Kamps, Jaap

164

Mining Linguistic Cues for Query Expansion: Applications to Drug Interaction Search  

E-Print Network [OSTI]

Mining Linguistic Cues for Query Expansion: Applications to Drug Interaction Search Sheng Guo answers to this question, by mining the literature, are valuable for pharmaceuti- cal companies, both in designing combination therapies for complex diseases including cancers. We study this problem as one

Ramakrishnan, Naren

165

Query Processing over Incomplete Autonomous Databases Garrett Wolf Hemal Khatri Bhaumik Chokshi Yi Chen Subbarao Kambhampati  

E-Print Network [OSTI]

Query Processing over Incomplete Autonomous Databases Garrett Wolf Hemal Khatri Bhaumik Chokshi Yi to missing attribute values (aka "null values") is very common in autonomous web databases, on which user ac on the strict soundness of answer tuples often ignore tuples with critical missing attributes, even if they wind

Chen, Yi

166

VISUAL QUERY OF TIME-DEPENDENT 3D WEATHER IN A GLOBAL GEOSPATIAL  

E-Print Network [OSTI]

, and investigation as much as other data (e.g., satellite imagery). Indeed, even the National Weather Service is only1 VISUAL QUERY OF TIME-DEPENDENT 3D WEATHER IN A GLOBAL GEOSPATIAL ENVIRONMENT William Ribarsky WEATHER IN A GLOBAL GEOSPATIAL ENVIRONMENT William Ribarsky, Nickolas Faust, Zachary Wartell, Christopher

Shaw, Chris

167

Querying the World Wide Web Alberto O. Mendelzon George A. Mihaila  

E-Print Network [OSTI]

, heterogeneous, distributed collection of documents connected by hypertext links. The most common technology" that index as many documents as they can find by navigating the network. One problem with this is that users), of their strengths and weaknesses, and of the peculiarities of their query interfaces. A more serious problem

Milo, Tova

168

Exploration of the Brain's White Matter Pathways with Dynamic Queries David Akers Anthony Sherbondy Rachel Mackenzie  

E-Print Network [OSTI]

Exploration of the Brain's White Matter Pathways with Dynamic Queries David Akers Anthony Sherbondy information about the structure of white matter within the human brain. Combining DTI data bundles (white matter pathways) that course through the human brain. Neurosci- entists have used

Wandell, Brian A.

169

A Deductive Declarative Object-Oriented Data Model and Query Language based on Narrowing  

E-Print Network [OSTI]

Sciences University of Alabama at Birmingham Birmingham, AL 35294-1170, USA internet: bryant-oriented module for dealing with objects. In [7] we defined a deductive database model (DataFunLog) based and query deductive databases. There was no object-oriented functionality in DataFunLog though. The model we

Bryant, Barrett R.

170

ADeductive Declarative ObjectOriented Data Model and Query Language based on Narrowing  

E-Print Network [OSTI]

Sciences University of Alabama at Birmingham Birmingham, AL 35294­1170, USA internet: bryant­oriented module for dealing with objects. In [7] we defined a deductive database model (DataFunLog) based and query deductive databases. There was no object­oriented functionality in DataFunLog though. The model we

Bayram, Zeki

171

Indexed Step-Wise Semi-Naive Evaluation for Recursive Queries  

E-Print Network [OSTI]

- cation of the step-wise semi-naive evaluation based on the semi-naive build-up of hash tables is proposed for relations generated at intermediate steps of rule r- ings, such as the result of a 1 b in the above exampleIndexed Step-Wise Semi-Naive Evaluation for Recursive Queries Ke Wang Department of Information

Wang, Ke

172

Distributed Manufacturing Networks: Optimization via Preprocessing in Decision Guidance Query Language  

Science Journals Connector (OSTI)

The authors consider optimization problems expressed in Decision Guidance Query Language that may involve linear arithmetic constraints, as well as finite domain and binary variables. They focus on Distributed Manufacturing Network optimization problems ... Keywords: Decision Guidance, Decision Support, Distributed Manufacturing, Manufacturing Network, Optimization

Nathan Egge; Alexander Brodsky; Igor Griva

2012-07-01T23:59:59.000Z

173

Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks  

Science Journals Connector (OSTI)

We propose a novel partition path-based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called block statistic signature (BSS) on the compressed data, which is a simple but ... Keywords: cost model, data compression, markup languages, query processing

Wilfred Ng; Ho-Lam Lau; Aoying Zhou

2008-06-01T23:59:59.000Z

174

TS-IDS Algorithm For Query Selection in the Deep Web Crawling  

E-Print Network [OSTI]

TS-IDS Algorithm For Query Selection in the Deep Web Crawling Yan Wang1 , Jianguo Lu2 , and Jessica. The deep web crawling is the process of collecting data items inside a data source hidden behind searchable of documents and terms involved, calls for new approximation algorithms for efficient deep web data crawling

Lu, Jianguo

175

Integrating SciSPARQL and MATLAB.  

E-Print Network [OSTI]

?? Nowadays many scientific experiment results involve multi-dimensional arrays. It is desirable to store these results in a persistent way and make queries against not (more)

He, Xueming

2014-01-01T23:59:59.000Z

176

SJSU Information Support Services Run a Query info-support@sjsu.edu, 408-924-1530 Page 1  

E-Print Network [OSTI]

....................................................................................................................................................................3 Advanced Search Run a Query info-support@sjsu.edu, 408-924-1530 Page 4 Advanced Search 4. To do an advanced search, click the Advanced Search link. The Advanced Search parameters display. Notes: The other most commonly

Su, Xiao

177

VisualSEEk: a fully automated content-based image query John R. Smith and Shih-Fu Chang  

E-Print Network [OSTI]

VisualSEEk: a fully automated content-based image query system John R. Smith and Shih-Fu Chang Department of Electrical Engineering and Center for Image Technology for New Media Columbia University New

Chang, Shih-Fu

178

A METHOD FOR ESTIMATING GAS PRESSURE IN 3013 CONTAINERS USING AN ISP DATABASE QUERY  

SciTech Connect (OSTI)

The U.S. Department of Energy's Integrated Surveillance Program (ISP) is responsible for the storage and surveillance of plutonium-bearing material. During storage, plutonium-bearing material has the potential to generate hydrogen gas from the radiolysis of adsorbed water. The generation of hydrogen gas is a safety concern, especially when a container is breached within a glove box during destructive evaluation. To address this issue, the DOE established a standard (DOE, 2004) that sets the criteria for the stabilization and packaging of material for up to 50 years. The DOE has now packaged most of its excess plutonium for long-term storage in compliance with this standard. As part of this process, it is desirable to know within reasonable certainty the total maximum pressure of hydrogen and other gases within the 3013 container if safety issues and compliance with the DOE standards are to be attained. The principal goal of this investigation is to document the method and query used to estimate total (i.e. hydrogen and other gases) gas pressure within a 3013 container based on the material properties and estimated moisture content contained in the ISP database. Initial attempts to estimate hydrogen gas pressure in 3013 containers was based on G-values (hydrogen gas generation per energy input) derived from small scale samples. These maximum G-values were used to calculate worst case pressures based on container material weight, assay, wattage, moisture content, container age, and container volume. This paper documents a revised hydrogen pressure calculation that incorporates new surveillance results and includes a component for gases other than hydrogen. The calculation is produced by executing a query of the ISP database. An example of manual mathematical computations from the pressure equation is compared and evaluated with results from the query. Based on the destructive evaluation of 17 containers, the estimated mean absolute pressure was significantly higher (P<.01) than the mean GEST pressure. There was no significant difference (P>.10) between the mean pressures from DR and the calculation. The mean predicted absolute pressure was consistently higher than GEST by an average difference of 57 kPa (8 psi). The mean difference between the estimated pressure and digital radiography was 11 kPa (2 psi). Based on the initial results of destructive evaluation, the pressure query was found to provide a reasonably conservative estimate of the total pressure in 3013 containers whose material contained minimal moisture content.

Friday, G; L. G. Peppers, L; D. K. Veirs, D

2008-07-31T23:59:59.000Z

179

QUERY LANGUAGE MODELING FOR VOICE SEARCH C. Chelba, J. Schalkwyk, T. Brants, V. Ha, B. Harb, W. Neveitt, C. Parada  

E-Print Network [OSTI]

. Neveitt, C. Parada , P. Xu Google, Inc., 1600 Amphiteatre Pkwy, Mountain View, CA 94043, USA ABSTRACT-Ney smoothing and entropy pruning, and found em- pirical evidence that hints at non-stationarity of the query stream, as well as strong dependence on various English locales--USA, Britain and Australia. Index Terms

Tomkins, Andrew

180

Personalized Access to Information by Query Reformulation Based on the State of the Current Task and User Profile  

E-Print Network [OSTI]

/Department of Computer Science University of Paris-Sud 11 Gif Sur Yvette Cedex, France Ounas.Asfari@supelec.fr, Bich-Lien information from secondary information or even noise. Present search engines generally handle search queries, is another solution to overcome the previous problem. Studies on personalized search have focused

Sansonnet, Jean-Paul

Note: This page contains sample records for the topic "queries sparql queries" 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

Context-Sensitive Program Analysis as Database Queries Monica S. Lam John Whaley V. Benjamin Livshits Michael C. Martin  

E-Print Network [OSTI]

information is stored as relations; data ac- cess and analyses are written as Datalog queries. To handle the large number of contexts in a program, the database represents relations with binary decision diagrams been used primarily in compiler optimizations, it is increasingly being used in tools to This material

Yang, Junfeng

182

A Rose is a Roos is a Ruusu: Querying Translations for Web Image Search Janara Christensen Mausam Oren Etzioni  

E-Print Network [OSTI]

) the season, (2) the water body, (3) spring coil, and (4) to jump. Ten out of the first fif- teen Google images for spring relate to the season sense, three to water body, one to coil and none to the jumping with a set of translations. E.g., it returns 38 translations for the coil sense of spring. The user can query

Mausam

183

AutoJoin: Generalizing an Example into an EDM query Jack Mostow and Bao Hong (Lucas) Tan  

E-Print Network [OSTI]

AutoJoin: Generalizing an Example into an EDM query Jack Mostow and Bao Hong (Lucas) Tan mostow to match by accident. The Session Browser [1] shown in Figure 1 is an EDM tool to view data retrieved' */ AND mcq.end_time = se.step_start_time /* '20090331103359' (03/31/2009 10:33:59 AM) */ AND mcq.machine

Mostow, Jack

184

Document and Query Expansion Models for Blog Distillation Jaime Arguello, Jonathan L. Elsas, Changkuk Yoo, Jamie Callan, Jaime G. Carbonell  

E-Print Network [OSTI]

Introduction The CMU submission to the 2008 blog distillation track explored document representation, retrievalDocument and Query Expansion Models for Blog Distillation Jaime Arguello, Jonathan L. Elsas This paper presents the CMU submission to the 2008 TREC blog distillation track. Similar to last year

Murphy, Robert F.

185

Trie Indexes for Efficient XML Query Evaluation Sofia Brenes, Yuqing Wu, Dirk Van Gucht, Pablo Santa Cruz  

E-Print Network [OSTI]

] construct a complete summary of every path in an XML document; the 1-index, 2-index, and T-index [15] useTrie Indexes for Efficient XML Query Evaluation Sof´ia Brenes, Yuqing Wu, Dirk Van Gucht, Pablo indexes and lookup algorithms. In this paper, we leverage the results of our re- search on coupling

Wu, Yuqing Melanie

186

OBSERVER: An Approach for Query Processing in Global Information Systems Based on Interoperation Across Pre-Existing Ontologies  

Science Journals Connector (OSTI)

There has been an explosion in the types, availability and volume of data accessible in an information system, thanks to the World Wide Web (the Web) and related inter-networking technologies. In this environment, there is a critical need to replace ... Keywords: distributed heterogeneous data access, domain ontologies, query processing in global information systems

Eduardo Mena; Arantza Illarramendi; Vipul Kashyap; Amit P. Sheth

2000-04-01T23:59:59.000Z

187

Query Routing: Finding Ways in the Maze of the Deep Web Govind Kabra Chengkai Li Kevin Chen-Chuan Chang  

E-Print Network [OSTI]

Query Routing: Finding Ways in the Maze of the Deep Web Govind Kabra Chengkai Li Kevin Chen-occurrence framework for ranking and select- ing Deep Web sources that provide information relevant to users requirement. Given the huge number of heterogeneous Deep Web data sources, the end users may not know

Li, Chengkai

188

Jansen, B.J. 2003. Operators Not Needed? The Impact of Query Structure on Web Searching Results?. Information Resource Management Association International Conference, p. 814 817. Philadelphia, PA, 18 -21 May 2003.  

E-Print Network [OSTI]

Jansen, B.J. 2003. Operators Not Needed? The Impact of Query Structure on Web Searching Results. Jansen School of Information Sciences and Technology The Pennsylvania State University 001 Thomas Bldg are discussed. INTRODUCTION The vast majority of Web queries contain no query operators (Hoelscher, 1998; Jansen

Jansen, James

189

Use of modular web developments to ease the language barrier of Hypertext Processing and Structured Query Language by Jarrell Dwayne Johnson.  

E-Print Network [OSTI]

Four modules were developed with the extensive use of Personal Home Page (PHP) Hypertext Processing and Structured Query Language (SQL) in order to improve web-integrated capabilities of events planning, user account ...

Johnson, Jarrell Dwayne

2010-01-01T23:59:59.000Z

190

User:Woodjr/Sandbox/Sparql2 | Open Energy Information  

Open Energy Info (EERE)

Sparql2 < User:Woodjr | Sandbox Jump to: navigation, search States of the USA Retrieved from "http:en.openei.orgwindex.php?titleUser:WoodjrSandboxSparql2&oldid293077...

191

Nile: A Query Processing Engine for Data Streams M. A. Hammad, M. F. Mokbel, M. H. Ali, W. G. Aref, A. C. Catlin, A. K. Elmagarmid,  

E-Print Network [OSTI]

the design of "STEAM", Purdue Boiler Makers' stream database system that al- lows for the processing processing engine, "Nile". Nile extends the query processor engine of an object-relational database join: Tracking moving objects in sensor- network databases. In SSDBM, 2003. [2] M. A. Hammad, W. G

Mokbel, Mohamed F.

192

Appears at the Very Large Data Bases Journal, Vol. 4, No. 4, pp. 703726, October 1995 Historical Queries along Multiple Lines of Time Evolution +  

E-Print Network [OSTI]

. There are many database applications however, where it is important to capture the history of the database to addressing historical queries assume a single line of time evolution, i.e., a system (database, relation of these multiple­lines of time evolution problems is that portions of the history are shared; answering historical

Tsotras, Vassilis J.

193

NOVEL O(H(N)+N/H(N)) ALGORITHMIC TECHNIQUES FOR SEVERAL TYPES OF QUERIES AND UPDATES ON ROOTED TREES AND LISTS  

E-Print Network [OSTI]

super-node tree; binary search tree; list Ph.D. Eng. Mugurel Ionu ANDREICA Abstract: In this paper we TREES AND LISTS Mugurel Ionu ANDREICA Computer Science Department, Politehnica University of Bucharest, Bucharest, Romania email: mugurel.andreica@cs.pub.ro Key words: general tree; query; update; compressed

Paris-Sud XI, Université de

194

ExpTreeDB: Web-based query and visualization of manually annotated gene expression profiling experiments of human and mouse from GEO  

Science Journals Connector (OSTI)

......PAPERS DATABASES AND ONTOLOGIES ExpTreeDB: Web-based query and visualization of manually...biotech.bmi.ac.cn/ExpTreeDB . Web site is implemented in Perl, PHP, R...allows keywords and signature search. Other Web servers for analysis and annotation of GEO......

Ming Ni; Fuqiang Ye; Juanjuan Zhu; Zongwei Li; Shuai Yang; Bite Yang; Lu Han; Yongge Wu; Ying Chen; Fei Li; Shengqi Wang; Xiaochen Bo

2014-12-01T23:59:59.000Z

195

Energy Information, Data, and other Resources | OpenEI  

Open Energy Info (EERE)

Web Service Documentation Explore our available Web services. REST - provides a RESTful wrapper around high-value data. Ask queries - inline queries for Semantic MediaWiki SPARQL...

196

Energy Information, Data, and other Resources | OpenEI  

Open Energy Info (EERE)

Documentation Explore our available Web services. REST - provides a RESTful wrapper around high-value data. Ask queries - inline queries for Semantic MediaWiki SPARQL Looking for...

197

Cognos Query Studio NUFinancials  

E-Print Network [OSTI]

consultant@northwestern.edu Please review this guide before calling the help desk with data definition the definition in the Information pane. Hover over the same items to see the definition in a tool tip. Who has to get help? For assistance, contact NUIT Support Center at 847-491-HELP (4357), option 2, or email

Shull, Kenneth R.

198

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

199

User:Woodjr/Sandbox/Sparql3 | Open Energy Information  

Open Energy Info (EERE)

Sparql3 Sparql3 < User:Woodjr‎ | Sandbox Jump to: navigation, search States of the USA which have a geographic "point" defined in DBpedia Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"400px","height":"400px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[]}

200

No O(N) queries for checking if N intervals cover everything or for piercing N pairs of intervals. An O(N log N)-steps algorithm for piercing  

E-Print Network [OSTI]

The complexity of two related geometrical (indeed, combinatorial) problems is considered, measured by the number of queries needed to determine the solution. It is proved that one cannot check in a linear in N number of queries whether N intervals cover a whole interval, or whether for N pairs of intervals on two lines there is a pair of points intersecting each of these pairs of intervals ("piercing all pairs of intervals"). The proofs are related to examples which show that there is no "Helly property" here - the whole set of N may cover the whole interval (resp. may have no pair of points piercing all pairs of intervals) while any proper subset does not. Also, for the piercing problem we outline an algorithm, taking O(N log N) steps, to check whether there is a pair of points piercing all pairs of intervals and if there is, to find it.

Katchalski, Meir

2011-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "queries sparql queries" 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

Maintenance | OpenEI Community  

Open Energy Info (EERE)

sparql and community will continue to function normally. Additionally, web services that rely on Ask queries (utility rate database API) may have some downtime as we transition....

202

Collision detection and proximity queries  

Science Journals Connector (OSTI)

This course will primarily cover widely accepted and proved methodologies in collision detection. In addition more advanced or recent topics such as continuous collision detection, ADFs, and using graphics hardware will be introduced. When appropriate ...

Sunil Hadap; Dave Eberle; Pascal Volino; Ming C. Lin; Stephane Redon; Christer Ericson

2004-08-01T23:59:59.000Z

203

Author Query Form Article ID  

E-Print Network [OSTI]

and clear. Please supply the name of city for the affiliation. Please check: 12 Gb. Is it right? 1 #12 online but will be printed in black and white. Journal Name Energy Systems Article Title Ancillary service capacity optimization for both electric power suppliers and independent system operator Copyright

Sun, Dengfeng

204

Query log driven web search results clustering  

Science Journals Connector (OSTI)

Different important studies in Web search results clustering have recently shown increasing performances motivated by the use of external resources. Following this trend, we present a new algorithm called Dual C-Means, which provides a theoretical background ... Keywords: automatic labeling, dual c-means, evaluation, web search results clustering

Jose G. Moreno; Gal Dias; Guillaume Cleuziou

2014-07-01T23:59:59.000Z

205

Automatic Query Reformulation Based on Divergence  

E-Print Network [OSTI]

Cai,D. van Rijsbergen,C.J. Jose,J.M. Proceedings of the 10th International Conference on Information and Knowledge Management (CIKM) editors: Pagues, H. Liu, L., and Grossman, D. pp 419-426 ACM

Cai, D.

206

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

207

Query Expansion with an Automatically Generated Thesaurus  

Science Journals Connector (OSTI)

This paper describes a new method to automatically obtain a new thesaurus which exploits previously collected information. Our method ... a text collection, a set of source thesauri and other linguistic resources...

Jos R. Prez-Agera; Lourdes Araujo

2006-01-01T23:59:59.000Z

208

DRAFT Chapter 3 Spatial Query Languages  

E-Print Network [OSTI]

in the previous chapter, the relational model has limitations in e#11;ectively handling spatial data. Spatial data with object functionality. This e#11;ort has materialized into a new OR-DBMS standard for SQL: SQL3. Since we. The pictogram- enhanced ER diagram of the database and the example tables are shown in Figure 3.1 and Table 3

Shekhar, Shashi

209

Querying Uncertain Data in Resource Constrained Settings  

E-Print Network [OSTI]

and local flooding. For our simulation experiments wesimulations for both our recovery algorithms. The depth used by the flooding

Meliou, Alexandra

2009-01-01T23:59:59.000Z

210

ICEDB : intermittently-connected continuous query processing  

E-Print Network [OSTI]

Several emerging wireless sensor network applications must cope with a combination of node mobility (e.g., sensors on moving cars) and high data rates (media-rich sensors capturing videos, images, sounds, etc.). Due to ...

Zhang, Yang, S.M. Massachusetts Institute of Technology

2008-01-01T23:59:59.000Z

211

Query Answering in Data Integration Systems  

E-Print Network [OSTI]

is verified, thus Q 6 s search is advanced. First, the topsubsequence search for both Q 5 and Q 6 is advanced. First,thus, the search for both Q 5 and Q 6 is advanced. The

Salloum, Mariam

2011-01-01T23:59:59.000Z

212

Query Processing: The Basics External Sorting  

E-Print Network [OSTI]

) -- Eliminate duplicates on completion of last merge step (no cost) #12; 2 7 Duplicate Elimination . Hash . No index on attr: -- Rows unsorted: Scan all data pages to find rows satisfying the condition. . Cost = F Selection . B + tree index on attr (for equality or range search): -- Locate first leaf page that can

Liu, Yanhong Annie

213

Complex Motion Pattern Queries for Trajectories  

E-Print Network [OSTI]

T 2 and radius ?. . CFE steps to find flock patterns. . .processed from Figure 4.9: CFE steps to find flock patterns.Cluster Filtering Evaluation (CFE ), has two phases: (1) the

Vieira, Marcos Rodrigues

2011-01-01T23:59:59.000Z

214

Query Generation From Multiple Media Examples  

E-Print Network [OSTI]

Ren,R. Jose,J.M. the 7th International Workshop on Content-Based Multimedia Indexing pp 138-143 IEEE Computer Society Press

Ren, R.

215

Pattern Based Feature Construction in Semantic Data Mining  

Science Journals Connector (OSTI)

The authors propose a new method for mining sets of patterns for classification, where patterns are represented as SPARQL queries over RDFS. The method contributes to so-called semantic data mining, a data mining approach where domain ontologies are ... Keywords: Intelligent System, Meta-Learning, Ontology, Pattern Discovery, SPARQL, Semantic Data Mining

Agnieszka ?awrynowicz, J?drzej Potoniec

2014-01-01T23:59:59.000Z

216

Query reformulation using automatically generated query concepts from a document space  

E-Print Network [OSTI]

Chang,Y. Ounis,I. Kim,M. To appear in Information Processing and Management journal (IPM) Elsevier Science

Chang, Y.; Ounis, I.

217

Generation of query-biased concepts using content and structure for query reformulation  

E-Print Network [OSTI]

Chang,Y-J. Wang,J. Lalmas,M. 13th International Conference on Applications of Natural Language to Information Systems (NLDB2008), London pp 136-141 LNCS, Springer

Chang, Y-J.; Wang, J.; Lalmas, M.

218

Template:LabelValuePair | Open Energy Information  

Open Energy Info (EERE)

LabelValuePair LabelValuePair Jump to: navigation, search This is the 'LabelValuePair' template. It is typically used to display the results of an ask or sparql query in a simple label: value format. It is used by many pages, including the sub pages for country profiles, and is most frequently called as the template parameter in a query returned as format=template. For more help on this, see Extension:SparqlExtension, Template Help. Parameters label - The label, property or predicate of the query. value - The value or object specified in the query. Usage It should be called in the following format: {{#sparql SELECT ... |format=template |template=LabelValuePair |.. }} Edit the page to see the template text. Retrieved from "http://en.openei.org/w/index.php?title=Template:LabelValuePair&oldid=37488

219

Massive-scale RDF Processing Using Compressed Bitmap Indexes  

SciTech Connect (OSTI)

The Resource Description Framework (RDF) is a popular data model for representing linked data sets arising from the web, as well as large scienti#12;c data repositories such as UniProt. RDF data intrinsically represents a labeled and directed multi-graph. SPARQL is a query language for RDF that expresses subgraph pattern-#12;nding queries on this implicit multigraph in a SQL- like syntax. SPARQL queries generate complex intermediate join queries; to compute these joins e#14;ciently, we propose a new strategy based on bitmap indexes. We store the RDF data in column-oriented structures as compressed bitmaps along with two dictionaries. This paper makes three new contributions. (i) We present an e#14;cient parallel strategy for parsing the raw RDF data, building dictionaries of unique entities, and creating compressed bitmap indexes of the data. (ii) We utilize the constructed bitmap indexes to e#14;ciently answer SPARQL queries, simplifying the join evaluations. (iii) To quantify the performance impact of using bitmap indexes, we compare our approach to the state-of-the-art triple-store RDF-3X. We #12;nd that our bitmap index-based approach to answering queries is up to an order of magnitude faster for a variety of SPARQL queries, on gigascale RDF data sets.

Madduri, Kamesh; Wu, Kesheng

2011-05-26T23:59:59.000Z

220

Efficient Evaluation of k-NN Queries Using Spatial Mashups  

E-Print Network [OSTI]

factors, e.g., heterogeneous traffic conditions and traffic accidents. Driving time (or travel time networks where the driving time between two locations may vary significantly at different time of the day sensors to compute the best route from a user to an object of interest in terms of the driving time. Thus

Poon, Chung Keung

Note: This page contains sample records for the topic "queries sparql queries" 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

Detecting Cyberbullying: Query Terms and Techniques April Kontostathis  

E-Print Network [OSTI]

networking site where users can ask questions of other users. It appeals primarily to teens and young adults Policy Issues: Abuse and crime involving computers. General Terms Human Factors; Algorithms; Verification ways to use these communities. In particular, we see that teens and young adults are finding new ways

Kontostathis, April

222

QMAS: Querying, Mining And Summarization of Multi-modal Databases  

E-Print Network [OSTI]

'10 conference proceedings by the same co-authors. Work performed during Mr. Cordeiro's visit, and/or their performances degrade if limited images bear initial labels. In this paper, we propose, potential environmental hazards, etc.), or errors in the data collection process. Finally, the user would

223

Query Processing in Mobile Sensor Networks Wang-Chien Lee  

E-Print Network [OSTI]

, a sensor network for air pollution test, where all sensors are scattered in the air and transported to collect the data from the sensors about air pollution and traffic conditions. In comparison, vehicles, animals, air, and water). With self-propelling sensor nodes, a mobile sensor network is self

Giles, C. Lee

224

Estimating Query Difficulty for News Prediction Retrieval Nattiya Kanhabua  

E-Print Network [OSTI]

-genomic society? When can re- newable energy replace fossil fuels? These questions commonly This is a corrected will happen in the eurozone after the financial crisis? How will health care change in the post lives including an energy crisis, the global financial crisis, poli- tics, health care, science

225

IMMPACT: A System for Interactive Proximity Queries On Massive Models  

E-Print Network [OSTI]

it for interaction with a CAD model of a power plant consisting of over 15 million triangles. We are able to perform e.g. submarines, airplanes, power plants etc.. A key component of such environments is the ability, ONR Young Investigator Award, Honda and Intel 1 #12;1 Introduction The current technology for virtual

North Carolina at Chapel Hill, University of

226

Data Analysis and Query Processing in Wireless Sensor Networks  

E-Print Network [OSTI]

an energy source such as AA batteries, solar panels [186],the cost of replacing batteries frequently, especially inenergy provider; they have batteries on board. The autonomy

Chatzimilioudis, Georgios

2010-01-01T23:59:59.000Z

227

Encoding range minima and range top-2 queries  

Science Journals Connector (OSTI)

...give a data structure whose space usage is 2n+o(n) bits...efficiently (in terms of both space and time). We consider the...reach an internal limit of the library to handle large integers: the space usage of the dynamic programing...

2014-01-01T23:59:59.000Z

228

Optimizing Path Query Performance: Graph Clustering Strategies \\Lambda  

E-Print Network [OSTI]

.J. Watson Labs ywh@us.ibm.com Ning Jing z Changsha Institute of Technology jning@eecs.umich.edu Elke A because it does not incur any run­time cost, requires no auxiliary data structures, and is complimentary evaluation of the performance of these graph clustering techniques using an actual city road network as well

229

Mobile delivery of news using hierarchical query-biased summaries  

E-Print Network [OSTI]

Sweeney,S. Crestani,F. Tombros,A. In the Proceedings of the 17th ACM Symposium on Applied Computing, pp.634-639. Madrid, Spain, March 2002. ACM Press

Sweeney, S.; Crestani, F.; Tombros, A.

230

Supporting Semantic Web Search and Structured Queries on Mobile Devices  

E-Print Network [OSTI]

smartphone operating system and desktop, with an interface able to adapt to any resolution and method browsers in use. QPedia should therefore be available on any smartphone operating system and desktop. Staab and R. Studer, editors, Handbook on Ontologies, International Handbooks on Information Systems

Zaniolo, Carlo

231

Query-Driven Network Flow Data Analysis and Visualization  

E-Print Network [OSTI]

and final outcome. 1 http://www-conf.slac.stanford.edu/dmw2004 2 http://sdm.lbl.gov/FastBit 3 K. Wu, W

Geddes, Cameron Guy Robinson

232

RFID Enabled Vehicular Network for Ubiquitous Travel Query  

Science Journals Connector (OSTI)

Fixed infrastructure based wireless network is very expensive to provide total coverage and offer ubiquitous communication capacity. RFID enabled Vehicular Network emerges as an alternative which can leverage mobile nodes to bridge the gap between information ... Keywords: Delay, Mobile Relay, Partially Connected, RFID, Vehicular Ad Hoc Network VANET

ZongWei Luo, Tianle Zhang, Chunlu Wang, Shuihua Han, Mengyuan Dong

2011-07-01T23:59:59.000Z

233

D-SPARQ: Distributed, Scalable and Efficient RDF Query Engine  

E-Print Network [OSTI]

of Dammam, Saudi Arabia. University of New South Wales, High Street, Kensington, NSW, Australia 2052. ssakr

Hitzler, Pascal

234

Influence Zone: Efficiently Processing Reverse k Nearest Neighbors Queries  

E-Print Network [OSTI]

of a gas station. The drivers for which this gas station is one of the k nearest gas stations are its potential customers. In this paper, the objects that provide a facility or service (e.g., gas stations

Lin, Xuemin

235

Usefulness of Hyperlink Structure for Query-Biased Topic Distillation  

E-Print Network [OSTI]

Plachouras,V. Ounis,I. 27th ACM SIGIR Conference on Research and Development in Information Retrieval, Sheffield, UK, July 2004. pp 448-455 ACM Press

Plachouras, V.; Ounis, I.

236

Managing and Querying Transaction-time Databases under Schema Evolution  

E-Print Network [OSTI]

problem of managing the history of database in- formation is now made more urgent and complex by fast evolution history. 1. INTRODUCTION The ability of archiving past database information and supporting when it comes to preservation of the database history. Converting the old database to a new one after

Zaniolo, Carlo

237

Incremental Data Structures and Algorithms for Dynamic Query Interfaces*  

E-Print Network [OSTI]

implementation han- dles an active subset that is an order of magnitude *This paper will be presented as a preview bar that dis- plays the number of hits), and charts (which provide other cumulative information

Shneiderman, Ben

238

Incremental Data Structures and Algorithms for Dynamic Query Interfaces \\Lambda  

E-Print Network [OSTI]

implementation han­ dles an active subset that is an order of magnitude larger than the databases that previous of hits), bars (such as a preview bar that dis­ plays the number of hits), and charts (which provide other

Beigel, Richard

239

Data Analysis and Query Processing in Wireless Sensor Networks  

E-Print Network [OSTI]

4.6.1 Energy-driven Tree Construction (ETC ) . . . . 4.6.2and George Samaras. Etc: Energy-driven tree construction inthe next paragraph. Energy-driven Tree Construction (ETC )

Chatzimilioudis, Georgios

2010-01-01T23:59:59.000Z

240

Query Languages and Tools for XML Documents and Databases  

E-Print Network [OSTI]

for XML (1999) See paper for reference SQL Renamed ANSI­SQL (1986) SQL92 (1992) ANSI and ISO standard By ANSI X3H2, Accepted by ANSI X3H2 still to be completed SEQUEL (1974) By Chamberlain and others at IBM, then becoming an ANSI and ISO standard later as SQL92. In the middle 1980s research was started on a different

Miller, John A.

Note: This page contains sample records for the topic "queries sparql queries" 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

Coverage, Relevance, and Ranking: The Impact of Query Operators on  

E-Print Network [OSTI]

CAROLINE M. EASTMAN University of South Carolina and BERNARD J. JANSEN The Pennsylvania State University: eastman@cse.sc.edu; B. J. Jansen, School of Infor- mation Sciences and Technology, The Pennsylvania State, Pages 383­411. #12;384 · C. M. Eastman and B. J. Jansen 1. INTRODUCTION Searchers seldom use advanced

Jansen, James

242

Searching the Web: The Public and Their Queries Amanda Spink  

E-Print Network [OSTI]

. Jansen Lecturer, Computer Science Program at the University of Maryland (Asian Division), Seoul, 140 popula- tion than non-Web-based information retrieval (IR) systems (Spink, Bateman, & Jansen, 1999 FOR INFORMATION SCIENCE AND TECHNOLOGY, 52(3):226­234, 2001 #12;ples of data (Jansen, Spink, Bateman, & Saracevic

Jansen, James

243

Using Simulated Annealing to Prioritize Query Results: Some Initial Findings  

E-Print Network [OSTI]

. Jansen Dept. Electrical Engineering and Computer Science United States Military Academy West Point, New York 10996 Telephone: (914) 938-5559 FAX: (914) 938-5956 Email: jjansen@acm.org Please Cite: Jansen, B

Jansen, James

244

Querying Large Similar Sequences in a Compressed Format Efficiently  

E-Print Network [OSTI]

amounts of sequence data are being gen- erated daily. For instance, the 1000 genomes project (http about 8.2 billion bases per day, the equivalent of more than two human genomes every 24 hours. Indeed be able to reach the goal of sequencing a human genome for the cost of less than $1,000 within a couple

Xie, Xiaohui Sunney

245

Data Analysis and Query Processing in Wireless Sensor Networks  

E-Print Network [OSTI]

sensor network based home-automation. In EUC Work- shops,158, 92, 119], home and building automation [6, 71], urban

Chatzimilioudis, Georgios

2010-01-01T23:59:59.000Z

246

Query Refinement in Description Logics Using the Rough Set Theory.  

E-Print Network [OSTI]

??Refinamento de consulta consiste de tcnicas que modificam os termos de uma consulta com o objetivo de alterar os resultados obtidos inicialmente. Para a realizao (more)

Henrique Viana Oliveira

2012-01-01T23:59:59.000Z

247

PIMAQS: Platform Independent Multidatabase Administration and Query System  

E-Print Network [OSTI]

characteristic in MDBS is transparency that is the user of MDBS is unaware of accessing different member database language. JDBC allows Java programs to connect to databases on an Intranet or on the Internet. Finally

Gruenwald, Le

248

Uniform Quanti er Elimination and Constraint Query Processing  

E-Print Network [OSTI]

In this paper we have introduced a new variant of the quan-. ti er elimination problem which we call uniform quanti er. elimination. We give an algorithm for...

249

Adaptive information filtering through automatic Boolean query generation  

E-Print Network [OSTI]

The subject of this thesis is the development and graphics. testing of a new algorithm for intelligently altering information content on the World Wide Web and in other similar domains. The approach described in this thesis is a hybrid algorithm...

Nichols, Michael Roddy

1998-01-01T23:59:59.000Z

250

Supporting Agile Organizations with a Decision Guidance Query Language  

Science Journals Connector (OSTI)

Decision optimization is widely used in many decision guidance and support systems DGSS to support business decisions such as procurement, scheduling, and planning. In spite of rapid changes in users' requirements, the implementation of DGSS is typically ... Keywords: Agile Organizations, Decision Guidance, Decision Support, Optimization

Alexander Brodsky; Nathan Egge; X. Wang

2012-04-01T23:59:59.000Z

251

Context-Aware Knowledge Querying in a Networked Enterprise  

E-Print Network [OSTI]

, the increasing amount of heteroge- neous information, available through a variety of information channels, has of information that,within the networked enterprise scenario, may confuse and overwhelm the users in need of high-quality) the access to contextualised data. We show its applicability in the wine produc- tion scenario, where several

Schreiber, Fabio A.

252

Efficient Approximation of Optimization Queries Under Parametric Aggregation Constraints  

E-Print Network [OSTI]

in stock. Cable manufacturers ship their products in units, each having a specific weight and length Consider a large distributor of cables, who main- tains a database relation ¡ keeping track of the products. Assume that relation ¡ has attributes uid (a unit identifier), manufacturer, weight, length and price

Pennsylvania, University of

253

User:Woodjr | Open Energy Information  

Open Energy Info (EERE)

Woodjr Woodjr Jump to: navigation, search My Daughter and I Name Jamey Wood Location Colorado Edits 59997 Friends User Edits Bbush 27 Dbrodt 21 ElaineWood 243 Graham7781 7857 GregZiebold 3711 JZ 42 Rmckeel 1772 Sadiecox 5120 Sm 0 Twichers 0 Twong 24774 I'm Jamey Wood, a member of the OpenEI team at the National Renewable Energy Laboratory. Prior to this, I worked at Sun Microsystems for ten years. And prior to that, I got a computer science degree from the University of Colorado. Sandbox Here are a few items from my personal sandbox that might be of interest to others. Extended Semantic MediaWiki Visualizations GeoMap GoogleEarth Inline SPARQL Queries SPARQL Example 1 (DBpedia Data) SPARQL Example 2 (DBpedia Data) SPARQL Example 3 (DBpedia Data) SPARQL Example 4 (OpenEI Data)

254

Cataloguer makeover  

E-Print Network [OSTI]

Framework (RDF) standard for data encoding ? Web Ontology Language (OWL) Available tools: Relational data RDF data SQL query language ? relational data SPARQL query language ? RDF data SQL does this by accessing tables in relational databases... Examples: Local ontology ? Person unique identifiers ? Organization unique identifiers Examples person file Examples: Karma person file modeling Examples: Karma N-Triples Person file Examples positions file Examples: Karma position file...

Ilik, Violeta

2014-02-28T23:59:59.000Z

255

The 3rd DBCLS BioHackathon: improving life science data integration with Semantic Web technologies  

E-Print Network [OSTI]

then look for sub-graphs that match the graph-pattern specified in the query. For example, the triple-pattern: ?protein "nuclear membrane" could be used to find all of the proteins in a given SPARQL... level, where the concepts of interest can be defined post-facto, after the act of data query and integration. The ease and low-cost of creating and analyzing such datasets would encourage researchers to re-ask their questions in light of new discoveries...

Katayama, Toshiaki; Wilkinson, Mark D; Micklem, Gos; Kawashima, Shuichi; Yamaguchi, Atsuko; Nakao, Mitsuteru; Yamamoto, Yasunori; Okamoto, Shinobu; Oouchida, Kenta; Chun, Hong-Woo; Aerts, Jan; Afzal, Hammad; Antezana, Erick; Arakawa, Kazuharu; Aranda, Bruno; Belleau, Francois; Bolleman, Jerven; Bonnal, Raoul JP; Chapman, Brad; Cock, Peter JA; Eriksson, Tore; Gordon, Paul MK; Goto, Naohisa; Hayashi, Kazuhiro; Horn, Heiko; Ishiwata, Ryosuke; Kaminuma, Eli; Kasprzyk, Arek; Kawaji, Hideya; Kido, Nobuhiro; Kim, Young Joo; Kinjo, Akira R; Konishi, Fumikazu; Kwon, Kyung-Hoon; Labarga, Alberto; Lamprecht, Anna-Lena; Lin, Yu; Lindenbaum, Pierre; McCarthy, Luke; Morita, Hideyuki; Murakami, Katsuhiko; Nagao, Koji; Nishida, Kozo; Nishimura, Kunihiro; Nishizawa, Tatsuya; Ogishima, Soichi; Ono, Keiichiro; Oshita, Kazuki; Park, Keun-Joon; Prins, Pjotr; Saito, Taro L; Samwald, Matthias; Satagopam, Venkata P; Shigemoto, Yasumasa; Smith, Richard; Splendiani, Andrea; Sugawara, Hideaki; Taylor, James; Vos, Rutger A; Withers, David; Yamasaki, Chisato; Zmasek, Christian M; Kawamoto, Shoko; Okubo, Kosaku; Asai, Kiyoshi; Takagi, Toshihisa

2013-02-11T23:59:59.000Z

256

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

257

Large-scale content-based audio retrieval from text queries  

Science Journals Connector (OSTI)

In content-based audio retrieval, the goal is to find sound recordings (audio documents) based on their acoustic features. This content-based approach differs from retrieval approaches that index media files using metadata such as file names and user ... Keywords: content-based audio retrieval, discriminative learning, large scale, ranking

Gal Chechik; Eugene Ie; Martin Rehn; Samy Bengio; Dick Lyon

2008-10-01T23:59:59.000Z

258

WikiTranslate: Query Translation for Cross-lingual Information Retrieval using only Wikipedia  

E-Print Network [OSTI]

. Nguyen, A.Overwijk, C.Hauff, R.B. Trieschnigg, D. Hiemstra, F.M.G. de Jong Twente University dong.p.ng@gmail.com, arnold.overwijk@gmail.com, c.hauff@ewi.utwente.nl, trieschn@ewi.utwente.nl, hiemstra@cs.utwente.nl, f

Hiemstra, Djoerd

259

WikiTranslate: Query Translation for Cross-lingual Information Retrieval using only Wikipedia  

E-Print Network [OSTI]

. Nguyen, A. Overwijk, C. Hauff, R. B. Trieschnigg, D. Hiemstra, F.M.G. de Jong University of Twente, The Netherlands dong.p.ng@gmail.com, arnold.overwijk@gmail.com, c.hauff@ewi.utwente.nl, trieschn

Hiemstra, Djoerd

260

Streaming Covariance Selection with Applications to Adaptive Querying in Sensor Networks  

Science Journals Connector (OSTI)

......London, London, UK Handling editor: Nick Jennings Sensor networks can be naturally...revised 1 December 2009 Handling editor: Nick Jennings 1. INTRODUCTION Advances in data...supported by a Royal Society Wolfson Research Merit Award. APPENDIX: GRADIENT DERIVATION......

Christoforos Anagnostopoulos; Niall M. Adams; David J. Hand

2010-11-01T23:59:59.000Z

Note: This page contains sample records for the topic "queries sparql queries" 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

ISABELA-QA: query-driven analytics with ISABELA-compressed extreme...  

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

Publication Source: SC '11 Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis Publisher: ACM-New York Conference...

262

A journey to Semantic Web query federation in the life sciences  

E-Print Network [OSTI]

Background: As interest in adopting the Semantic Web in the biomedical domain continues to grow, Semantic Web technology has been evolving and maturing. A variety of technological approaches including triplestore technologies, ...

Paschke, Adrian

263

Trending Topics on Twitter Improve the Prediction of Google Hot Queries Federica Giummol  

E-Print Network [OSTI]

.g., nba vs. election 2012). Unfortunately, the details about the technique Twitter uses to generate its, and regarding the U.S. Presidential Elections event. The main issue concerns the different time granularity

Orlando, Salvatore

264

Structured Querying of Annotation-Rich Web Text with Shallow Semantics  

E-Print Network [OSTI]

needs from Web users to search for named entities, e.g., finding all Silicon Valley companies. To accomplish Task 2, our analyst may start with a search on "Silicon Valley company" and scan through the po far been dominated by keyword-based document search. However, recent years have witnessed arising

Li, Chengkai

265

QUERI : Un systme de question-rponse collaboratif et interactif Badis MERDAOUI & Claude FRASSON  

E-Print Network [OSTI]

of question-answer are evolving towards a new generation of search engines. The "user- machine" interaction par une réponse bien spécifique (Oui, Non) et non par une liste de liens hypertextes. Le processus d

Paris-Sud XI, Université de

266

CytoCom: a Cytoscape app to visualize, query and analyse disease comorbidity networks  

Science Journals Connector (OSTI)

......that can be used to search, explore, analyse...disease-disease associations in terms of bipartite graphs...uk 1 Introduction The term comorbidity refers to...disease, user needs to enter the seed disease code in the search box; CytoCom makes......

Mohammad Ali Moni; Haoming Xu; Pietro Li

2014-12-01T23:59:59.000Z

267

LigDig: a web server for querying ligandprotein interactions  

Science Journals Connector (OSTI)

......the compound, and the search does not find (CHEMBL1089962...using a relatively broad search term. The user inputs text...UniChem tool. For the search fructose 1,6-bisphosphate...inhibitor tool. They would enter the uniprot identifier......

Jonathan C. Fuller; Michael Martinez; Stefan Henrich; Antonia Stank; Stefan Richter; Rebecca C. Wade

2014-12-01T23:59:59.000Z

268

Towards Hybrid Online On-Demand Querying of Realtime Data with Stateful Complex Event Processing  

E-Print Network [OSTI]

California Los Angeles, USA {simmhan, prasanna}@usc.edu Abstract--Emerging Big Data applications in areas vast and fast data arriving as streams. These present novel challenges to Big Data management systems deals with the velocity aspect of the 3-V's of Big Data. However, traditional CEP systems do

Prasanna, Viktor K.

269

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

270

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

271

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

272

SPARK: Top-k Keyword Query in Relational Databases Xuemin Lin1  

E-Print Network [OSTI]

/Ben Stiller (#2.1) 2 Movies: "Primetime Glick" (:::: 2001) Tom:::::: Hanks/Ben Stiller (#2.1) Actor

Wang, Wei

273

Democratic community-based search with XML full-text queries  

E-Print Network [OSTI]

Keyword Search for Smallest LCAs in XML Databases. In ACMby computing the least common ancestor (LCA): if !empty(result) lca=LCA($pos1,, $posN) if ! empty(lca)

Curtmola, Emiran

2009-01-01T23:59:59.000Z

274

Detecting Distributed Scans Using High-Performance Query-DrivenVisualization  

SciTech Connect (OSTI)

Modern forensic analytics applications, like network trafficanalysis, perform high-performance hypothesis testing, knowledgediscovery and data mining on very large datasets. One essential strategyto reduce the time required for these operations is to select only themost relevant data records for a given computation. In this paper, wepresent a set of parallel algorithms that demonstrate how an efficientselection mechanism -- bitmap indexing -- significantly speeds up acommon analysist ask, namely, computing conditional histogram on verylarge datasets. We present a thorough study of the performancecharacteristics of the parallel conditional histogram algorithms. Asacase study, we compute conditional histograms for detecting distributedscans hidden in a dataset consisting of approximately 2.5 billion networkconnection records. We show that these conditional histograms can becomputed on interactive timescale (i.e., in seconds). We also show how toprogressively modify the selection criteria to narrow the analysis andfind the sources of the distributed scans.

Stockinger, Kurt; Bethel, E. Wes; Campbell, Scott; Dart, Eli; Wu,Kesheng

2006-09-01T23:59:59.000Z

275

Real-Time Spatio-Temporal Query Processing in Mobile Ad-Hoc Sensor Networks  

E-Print Network [OSTI]

that has multiple sensors (e.g., mo- tion sensors, acoustic sensors, infrared light emitting diodes, and pa

276

ThumbReels: query sensitive web video previews based on temporal, crowdsourced, semantic tagging  

Science Journals Connector (OSTI)

During online search, the user's expectations often differ from those of the author. This is known as the "intention gap" and is particularly problematic when searching for and discriminating between online video content. An author uses description and ... Keywords: crowdsourcing, metadata, thumbnails, thumbreels, video, video summarisation, video surrogates

Barnaby Craggs; Myles Kilgallon Scott; Jason Alexander

2014-04-01T23:59:59.000Z

277

Cost-based Optimization of Complex Scientific Queries Ruslan Fomkin and Tore Risch  

E-Print Network [OSTI]

Physics (HEP), where lots of data to be analyzed are generated by simulation software from the Large.Risch}@it.uu.se Abstract High energy physics scientists analyze large amounts of data looking for interesting events when, new theories, e.g. implemented as filters, can be tested quickly. Our application is High Energy

Risch, Tore

278

TQuEST: Threshold Query Execution for Large Sets of Time Series  

E-Print Network [OSTI]

. environmental air pollution which has gained rapidly increasing attention by many European research projects million time series, each representing the daily course of air pollution parameters1 . It is important data mining in time series databases is essential in many application domains as for instance

Kriegel, Hans-Peter

279

Sequence pattern query processing over out-of-order event streams  

E-Print Network [OSTI]

Complex event processing has become increasingly important in modern applications, ranging from RFID tracking for supply chain management to real-time intrusion detection. A key aspect of complex event processing is to ...

Liu, Mo

280

Scalable InvalidationBased Processing of Queries in Broadcast Push Delivery \\Lambda  

E-Print Network [OSTI]

­poor in comparison to stationary servers. Energy conservation is a ma­ jor concern. The communication environment of Ioannina, Computer Science Department, Technical Report No: 98­021. Submitted for publication. 1 #12; road is asymmetric, in that there is typically more communication capacity from servers to

Pitoura, Evaggelia

Note: This page contains sample records for the topic "queries sparql queries" 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

USERS' INTERACTIONS WITH THE EXCITE WEB SEARCH ENGINE: A QUERY REFORMULATION AND RELEVANCE FEEDBACK ANALYSIS  

E-Print Network [OSTI]

of North Texas spink@lis.admin.unt.edu Major Bernard J. Jansen Department of Electrical Engineering., and Jansen, B. J. 1998. Searching heterogeneous collections on the web: Behavior of Excite users. Information Americans. The Spink, Bateman and Jansen (1999) survey of Excite users shows many users perform successive

Jansen, James

282

E-Print Network 3.0 - anonymized ons queries Sample Search Results  

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

from 18,113 users of Excite, a major Web search engine. Given that many ... Source: Jansen, James - College of Information Sciences and Technology, Pennsylvania State University...

283

Gender-Brand Effect of Search Queries on Sponsored Search Performance  

E-Print Network [OSTI]

5109@ist.psu.edu Bernard J. Jansen Pennsylvania State University College of Information Sciences). Researchers (Jansen, Sobel & Zhang, 2011) have investigated the influence of brand effect on SEM performance on the web, Sanchez- Franco (2006) identifies that attitude plays a strong role for women's shopping. Jansen

Jansen, James

284

Can a Workspace Help to Overcome the Query Formulation Problem in Image Retrieval?  

E-Print Network [OSTI]

Urban,J. Jose,J.M. Proceedings of the 28th European Conference on Information Retrieval (ECIR'06) pp 385??396 Springer Verlag

Urban, J.

285

Faster Query Answering in Probabilistic Databases using Read-Once Functions  

E-Print Network [OSTI]

.4 (a) R = a1 w1 b1 w2 a2 w3 S = a1 c1 v1 b1 c1 v2 a2 c2 v3 a2 d2 v4 T = c1 u1 c2 u2 d2 u3 (b) Q() : -R

Anderson, Richard

286

Reordering an index to speed query processing without loss of effectiveness.  

E-Print Network [OSTI]

of CO2 emissions. To illustrate the importance o while maintaining good compression. Since static scores may not be available until all documents have

Hawking, David

287

Recent Advances in VisIt: AMR Streamlines and Query-Driven Visualization  

SciTech Connect (OSTI)

Adaptive Mesh Refinement (AMR) is a highly effective method for simulations spanning a large range of spatiotemporal scales such as those encountered in astrophysical simulations. Combining research in novel AMR visualization algorithms and basic infrastructure work, the Department of Energy's (DOEs) Science Discovery through Advanced Computing (SciDAC) Visualization and Analytics Center for Enabling Technologies (VACET) has extended VisIt, an open source visualization tool that can handle AMR data without converting it to alternate representations. This paper focuses on two recent advances in the development of VisIt. First, we have developed streamline computation methods that properly handle multi-domain data sets and utilize effectively multiple processors on parallel machines. Furthermore, we are working on streamline calculation methods that consider an AMR hierarchy and detect transitions from a lower resolution patch into a finer patch and improve interpolation at level boundaries. Second, we focus on visualization of large-scale particle data sets. By integrating the DOE Scientific Data Management (SDM) Center's FastBit indexing technology into VisIt, we are able to reduce particle counts effectively by thresholding and by loading only those particles from disk that satisfy the thresholding criteria. Furthermore, using FastBit it becomes possible to compute parallel coordinate views efficiently, thus facilitating interactive data exploration of massive particle data sets.

Weber, Gunther; Ahern, Sean; Bethel, Wes; Borovikov, Sergey; Childs, Hank; Deines, Eduard; Garth, Christoph; Hagen, Hans; Hamann, Bernd; Joy, Kenneth; Martin, David; Meredith, Jeremy; Prabhat,; Pugmire, David; Rubel, Oliver; Van Straalen, Brian; Wu, Kesheng

2009-11-12T23:59:59.000Z

288

Robust Network Monitoring in the presence of Non-Cooperative Traffic Queries  

E-Print Network [OSTI]

, Universitat Polit`ecnica de Catalunya (UPC), Campus Nord, Edif. D6, C. Jordi Girona, 1-3, 08034 Barcelona 1 Introduction The ability to extract detailed information from live traffic streams is critical as well as the types of computations, usually unknown in advance, to be performed on the packet streams

Politècnica de Catalunya, Universitat

289

Poster Abstract: Routing and Processing Multiple Aggregate Queries in Sensor Networks  

E-Print Network [OSTI]

/owner(s). SenSys'06, November 1­3, 2006, Boulder, Colorado, USA. Copyright 2006 ACM 1-59593-343-3/06/0011 ...$5 construction is performed using simple flooding algorithms [2], data-centric reinforcement strategies [1

Martin, Ralph R.

290

Online Submission ID: 0 Detecting Distributed Scans Using High-Performance Query-Driven  

E-Print Network [OSTI]

and destination ports, duration of connection, number of bytes exchanged and so forth. A year's worth of such data and Johnston 2005], traffic volume over ESnet, a production network servicing the U. S. Department of Energy analyzed. For example, to identify unusual activities on TCP ports, we may compute a histogram over

Geddes, Cameron Guy Robinson

291

EQR: A New Energy-Aware Query-based Routing Protocol for Wireless Sensor Networks  

E-Print Network [OSTI]

the consumption of energy throughout the network. In general terms, energy saving protocols are not necessarily to efficiently sup- port the exchange of information--basically by saving processing overhead and thus energy, energy savers and energy balancers. The former try to decrease the energy consumption of the network

Politècnica de Catalunya, Universitat

292

Continuous Monitoring of Top-k Queries over Sliding Kyriakos Mouratidis1  

E-Print Network [OSTI]

can be expressed either in terms of the number of active tuples or time units. We propose a general also maintains book-keeping in- formation. We present two processing techniques: the first one computes communication and sensor networks, stock market trading, profile-based marketing, etc. Consider, for instance

Papadias, Dimitris

293

Answering Aggregate Keyword Queries on Relational Databases Using Minimal Group-bys  

E-Print Network [OSTI]

, a customer planning his vacation, is interested in seeing space shuttles, riding motorcycle and experiencing American food. He can search the event calendar using the set of keywords {"space shuttle", "motorcycle have space shuttles, motorcycle, and American food all together if he visits Texas in December

Pei, Jian

294

Query-Based Sampling: Can we do Better than Random? Almer S. Tigelaar  

E-Print Network [OSTI]

a search interface. These are part of the deep web. Using conventional crawling to index the content, easily indexable, pages. The deep web consists of content that is generated dynam- ically in response of deep web pages that provide search services like this is estimated by one study to be five hundred

Hiemstra, Djoerd

295

A Context-based Model for Web Query Reformulation Ounas Asfari, Bich-Lin Doan, Yolaine Bourda  

E-Print Network [OSTI]

.asfari@supelc.fr, bich-lien.doan@supelec.fr, yolaine.bourda@supelec.fr Jean-Paul Sansonnet LIMSI-CNRS, University of the user is a real challenge in the Web Search, owing to the increase of heterogeneous resources on the web

Sansonnet, Jean-Paul

296

A social marketing approach to implementing evidence-based practice in VHA QUERI: the TIDES depression collaborative care model  

E-Print Network [OSTI]

vafacts.asp] Kotler P: Marketing management 11th edition.2003. Andreasen A: Marketing Social Change San Francisco:Roberto N, Lee N: Social marketing: Improving the quality of

Luck, Jeff; Hagigi, Fred; Parker, Louise E; Yano, Elizabeth M; Rubenstein, Lisa V; Kirchner, JoAnn E

2009-01-01T23:59:59.000Z

297

A MACHINE LEARNING APPROACH TO QUERY TIME-SERIES MICROARRAY DATA SETS FOR FUNCTIONALLY RELATED GENES USING HIDDEN MARKOV MODELS  

E-Print Network [OSTI]

Microarray technology captures the rate of expression of genes under varying experimental conditions. Genes encode the information necessary to build proteins; proteins used by cellular functions exhibit higher rates of ...

Senf, Alexander J.

2011-02-04T23:59:59.000Z

298

Supporting Event-based Unified Data Access/query over Integrated Data-views for Decision Making in Geographic  

E-Print Network [OSTI]

Systems (GIS) increasingly relies on analyses of spatial data in map- based formats. Maps are complex, GIS, federation, Web Services, information rendering, Service Oriented Architecture. Abstract-warning systems. Decision making in Geographic Information Systems (GIS) increasingly relies on analyses

299

Efficient Sketches for the Set Query Problem We develop an algorithm for estimating the values of a vector  

E-Print Network [OSTI]

for Massive Data Algorithmics, funded by the Danish National Research Associa- tion), NSF grant CCF-0728645 solutions. This includes model-based compressive sens- ing [BCDH10], which imposes additional constraints that the histogram of coefficient size follow a Zipfian (or power law) distribution. A sparse recovery algorithm

300

All | OpenEI Community  

Open Energy Info (EERE)

ask queries Type Term Title Author Replies Last Post sort icon Blog entry ask queries Multicolor Maps from Compound Queries Jweers 16 May 2013 - 14:2...

Note: This page contains sample records for the topic "queries sparql queries" 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

result formats | OpenEI Community  

Open Energy Info (EERE)

Jweers's picture Submitted by Jweers(83) Contributor 16 May, 2013 - 14:22 Multicolor Maps from Compound Queries ask queries compound queries developer Google maps maps...

302

author | OpenEI Community  

Open Energy Info (EERE)

13 13 Varnish cache server Home Groups Community Central Green Button Applications Developer Utility Rate FRED: FRee Energy Database More Public Groups Private Groups Features Groups Blog posts Content Stream Documents Discussions Polls Q & A Events Notices My stuff Energy blogs 429 Throttled (bot load) Error 429 Throttled (bot load) Throttled (bot load) Guru Meditation: XID: 2142234313 Varnish cache server author Home Developer Description: Developer community for OpenEI data, and helpful information for OpenEI wiki authors Enabling developers to use energy web services on OpenEI, REEGLE.info, Data.gov and across the web. We help developers find quality data, understand data provenance and assist with web service integration. We also help "power wiki" users develop complex Ask queries, SPARQL queries

303

power user | OpenEI Community  

Open Energy Info (EERE)

5 5 Varnish cache server Home Groups Community Central Green Button Applications Developer Utility Rate FRED: FRee Energy Database More Public Groups Private Groups Features Groups Blog posts Content Stream Documents Discussions Polls Q & A Events Notices My stuff Energy blogs 429 Throttled (bot load) Error 429 Throttled (bot load) Throttled (bot load) Guru Meditation: XID: 2142234815 Varnish cache server power user Home Developer Description: Developer community for OpenEI data, and helpful information for OpenEI wiki authors Enabling developers to use energy web services on OpenEI, REEGLE.info, Data.gov and across the web. We help developers find quality data, understand data provenance and assist with web service integration. We also help "power wiki" users develop complex Ask queries, SPARQL queries

304

A group housing society ontology in Swoop 2.3 Beta 4 and Protege 3.4.4  

Science Journals Connector (OSTI)

Ontology creation using various editors like Protg and SWOOP plays a significant role in Semantic Web. In this paper, we illustrate the creation of a housing society ontology viz, 'Jawaharlal CGHS ontology' using Swoop and Protg, the most commonly used ontology editors. We are using Swoop 2.3 Beta 4 editor where super class and sub class hierarchy and instances have been presented with the query retrieval process using 'Fly the MotherShip' option in advanced tab and show the 'general concept inclusion axiom', 'class expression table' for relations in classes and subclasses. Then, the same ontology is created using Protg 3.4.4 and finally illustrates using the OWL code to obtain ontology class hierarchy (subject/object relationship) in Protege by executing a SPARQL query.

Sanjay Kumar Malik; S.A.M. Rizvi

2014-01-01T23:59:59.000Z

305

Energy Information, Data, and other Resources | OpenEI  

Open Energy Info (EERE)

Ask queries Ask queries OpenEI's wiki uses Semantic Mediawiki (SMW). SMW provides inline queries in the form of an Ask query, which can also be modified into a web service (see...

306

U.S. VERSUS EUROPEAN WEB SEARCHING TRENDS Amanda Spink  

E-Print Network [OSTI]

and structure, (2) mean query and session durations, (3) search terms per query, and (4) terms in queries, and seconds, Query: user terms as entered. We analyzed user: Sessions - entire query sequence by a user; Queries - one or more entered terms; Terms - any string of characters bounded by white space. Table 1

Jansen, James

307

GEMS (Gene Expression Metasignatures), a Web Resource for Querying Meta-analysis of Expression Microarray Datasets: 17?-Estradiol in MCF-7 Cells  

Science Journals Connector (OSTI)

...expression microarray dataset contributions from...for the cancer and nuclear receptor signaling...each individual dataset. Backed by the...gene expression by nuclear receptors, their...expression microarray dataset contributions from...for the cancer and nuclear receptor signaling...

Scott A. Ochsner; David L. Steffen; Susan G. Hilsenbeck; Edward S. Chen; Christopher Watkins; and Neil J. McKenna

2009-01-01T23:59:59.000Z

308

Nile: A Query Processing Engine for Data Streams W. G. Aref, A. K. Elmagarmid, M. H. Ali, A. C. Catlin, M. G. Elfeky, M. Eltabak, T. Ghanem, R.  

E-Print Network [OSTI]

. Introduction This demonstration presents the design of "STEAM", Purdue Boiler Makers' stream database system of an object-relational database management system to support data streams. Our approach is motivated

Ilyas, Ihab Francis

309

out destroying the 1D C-R property, it is necessary and sufficient that the same record appear in two queries.  

E-Print Network [OSTI]

Mathematics. McGraw-Hill, New York, 1968. 5. Hall, Jr., M. Combinatorial Theory. Blaisdell Pub. Co., Waltham-R property is [(m -- 1)/2]. There are m records; hence the redundancy is rn(m -- 1) -- m[(m -- 1)/2] --1

Lamport ,Leslie

310

Joint Top-K Spatial Keyword Query Processing Dingming Wu, Man Lung Yiu, Gao Cong, and Christian S. Jensen, Fellow, IEEE  

E-Print Network [OSTI]

-8200 Aarhus, Denmark. E-mail: csj@cs.au.dk p1 q3 q1 {pizza, grill} {curry, sushi}{curry, seafood} Q p3 p2 q2 {sushi, soup, curry} {seafood, grill, sushi} {seafood, sushi} p4 {soup, steak} Q Fig. 1. Top1 prefers `curry' and `sushi,' user q2 prefers `seafood' and `sushi,' and user q3 prefers `curry

Yiu, Man Lung

311

Analysis of different approaches for storing GML documents  

Science Journals Connector (OSTI)

The fact that GML is an XML encoding allows it to be queried. In order to query a GML document we have designed a query language over GML/XML enriched with spatial operators. This query language has an underlying data model and algebra that supplies ... Keywords: GML, spatial queries

J. E. Crcoles; P. Gonzlez

2002-11-01T23:59:59.000Z

312

What do you wish OpenEI would work more on? | OpenEI Community  

Open Energy Info (EERE)

What do you wish OpenEI would work more on? What do you wish OpenEI would work more on? Home > Groups > Developer Rmckeel's picture Submitted by Rmckeel(297) Contributor 25 May, 2012 - 13:48 developer web services The Utility Rate web service 0% (0 votes) The Incentive web service 0% (0 votes) Web services to query by geographic location or shape 0% (0 votes) Mediawiki Ask examples & tutorials 0% (0 votes) SPARQL examples & tutorials 0% (0 votes) Total votes: 0 See our services page for information on how to access our web services! Groups: Developer Login to post comments Latest polls Rmckeel What do you wish OpenEI would work more on? Posted: 25 May 2012 - 13:48 by Rmckeel Groups Menu You must login in order to post into this group. Latest polls comments No comments have been made yet Recent content

313

OpenEI Community - Maintenance  

Open Energy Info (EERE)

maintenance maintenance March 8-9, 2013 http://en.openei.org/community/blog/openei-maintenance-march-8-9-2013  We would like to inform the OpenEI community that OpenEI will be undergoing a significant software upgrade during a maintenance window this weekend.  We will be upgrading the wiki and semantic mediawiki portions of OpenEI, which means /datasets, /apps, /lod, /sparql and /community will continue to function normally.  Additionally, web services that rely on Ask queries (utility rate database API) may have some downtime as we transition.read more

314

OpenEI maintenance March 8-9, 2013 | OpenEI Community  

Open Energy Info (EERE)

OpenEI maintenance March 8-9, 2013 OpenEI maintenance March 8-9, 2013 Home > Groups > Utility Rate Rmckeel's picture Submitted by Rmckeel(297) Contributor 8 March, 2013 - 14:23 developer Maintenance OpenEI We would like to inform the OpenEI community that OpenEI will be undergoing a significant software upgrade during a maintenance window this weekend. We will be upgrading the wiki and semantic mediawiki portions of OpenEI, which means /datasets, /apps, /lod, /sparql and /community will continue to function normally. Additionally, web services that rely on Ask queries (utility rate database API) may have some downtime as we transition. OpenEI will begin maintenance at 5pm MST Friday, March 8th, 2013. This means that the /wiki URLs will go into read-only mode and editing pages will not be possible. Maintenance is expected to end by 5pm MST Saturday,

315

Developer | OpenEI Community  

Open Energy Info (EERE)

Type Term Title Author Replies Last Post sort icon Blog entry compound queries Multicolor Maps from Compound Queries Jweers 16 May 2013 - 14:22...

316

Domain specific ontology based semantic knowledge representation for efficient intelligent information retrieval; -.  

E-Print Network [OSTI]

??solutions. When specifying a search, users enter a small number of terms in the query. Yet the query describes the information need and is commonly (more)

Goudarm, Rayangouda

2012-01-01T23:59:59.000Z

317

Predicting Onsite Searching Using Referral Keywords: The Relationship between Search Engine and Website Search.  

E-Print Network [OSTI]

??In this research, I analyze the relationship between referral queries of major web search engines and the subsequent onsite search queries of visitors that begin (more)

Ortiz-Cordova, Adan

2013-01-01T23:59:59.000Z

318

Microsoft Word - CafeExpressSecurityFormFinal June 2012 v2.doc  

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

and Supply Chain included BudgetCOA Sponsored Program Mgmt Salary Access Ad Hoc Query Viewer Ad Hoc Query Author (training required) Approvals (indicate values...

319

Caf Systems Express Access Form  

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

for all departments and projects where row level security has been indicated. Ad Hoc Query Viewer - Provides the ability to run reports created by Ad Hoc Query Authors...

320

E-Print Network 3.0 - allocation suitability score Sample Search...  

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

A particularity of SbQA is that it allocates queries while considering both query load Source: Ecole Polytechnique, Centre de mathmatiques Collection: Mathematics 8...

Note: This page contains sample records for the topic "queries sparql queries" 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

E-Print Network 3.0 - adistal enhancer element Sample Search...  

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

enhancer element Page: << < 1 2 3 4 5 > >> 1 Aggregate Nearest Neighbor Queries in Spatial Databases Summary: be a set of query points. We define the aggregate distance...

322

An OpenEI development teaser: finding companies related to carrots | OpenEI  

Open Energy Info (EERE)

An OpenEI development teaser: finding companies related to carrots An OpenEI development teaser: finding companies related to carrots Home > Groups > OpenEI Community Central Rmckeel's picture Submitted by Rmckeel(297) Contributor 3 February, 2010 - 10:02 imported OpenEI OpenEI offers linked open energy data to the world. OpenEI engineers have made a section on OpenEI to showcase some SPARQL queries, but even a skilled web developer or analyst may be daunted by this new query language, and not know what to do with it. Today, I'll show how to take advantage of this from a developer or analyst's point of view. It's a little known fact that OpenEI has DSIREusa.org incentive database available in a structured, open format - so let's get our feet wet playing with that. If you don't already have a Yahoo account, get one and go to the YQL

323

Caf Systems Central Security Access Form  

E-Print Network [OSTI]

and Procurement Tracking Reports (Encumbrances, Delivery, Change Order History) SCH_SUPPLY_CHAIN Ad Hoc Query Runner Ability to run reports created by Ad Hoc Query Authors CAFE_NU_COGNOS_AD_HOC_VIEWERS Ad Hoc Query Author (Training Required) Access to Query Studio to create, build, and save reports CAFE_NU_COGNOS_AD_HOC

Shull, Kenneth R.

324

LCA-based Selection for XML Document Collections Georgia Koloniari  

E-Print Network [OSTI]

LCA-based Selection for XML Document Collections Georgia Koloniari Department of Computer Science in the collection to the query. We consider keyword queries and support Lowest Common Ancestor (LCA) semantics of the LCA of those nodes in the XML docu- ment that contain the query keywords. To avoid evaluating queries

Pitoura, Evaggelia

325

Simonas Saltenis daisy.cs.aau.dk  

E-Print Network [OSTI]

query: Where are the gas stations within five miles of my location? Nearest-neighbor query: Where nearest gas station? Public queries over private data x How many cars in on the E45 north in Aalborg of 5 nearest Toyota maintenance stations? · Location-based advertisement/entertainment: Range query

Kaiserslautern, Universität

326

Medical Image Content-Based Queries using the Grid J. Montagnat1, H. Duque12, J.M. Pierson2, V. Breton3, L. Brunie2, and I. E. Magnin1  

E-Print Network [OSTI]

in deploying a medical application on a large scale grid testbed. Our pilot application is a hybrid metadata applications to grid infrastructures. 1 Introduction Digital medical images represent tremendous amounts, grids offer an infrastructure for: · sharing data and building virtual databases distributed over

Paris-Sud XI, Université de

327

F.Giannotti, S.Greco, D.Sacc`a and C. Zaniolo / Programming with NonDet. 33 [23] S. Greco, D. Sacc`a, and C. Zaniolo, DATALOG Queries with Stratified Negation and Choice  

E-Print Network [OSTI]

Classes, Handbook of Theoretical Computer Sci­ ence, Vol. 1, J. Leewen ed. North­Holland,1990, pp.67 Science, Leewen ed. North­Holland,1990, pp.1075--1155. [27] P. Kolaitis. The Expressive Power, pp.109--133. [43] A. Van Gelder, K.A. Ross, and J.S. Schlipf, The well­founded semantics for general

Zaniolo, Carlo

328

International Office -Ruth L Hello and welcome to today's web chat! Chatting today will be Tamara Francis -one of our trained immigration advisers -who will be on hand to answer any queries about the Tier 4 visa.  

E-Print Network [OSTI]

International Office - Ruth L Hello and welcome to today's web chat! Chatting today will be Tamara on the screen, anshul1208 Hello anshul1208 Hello Everyone International Office - Ruth L anshul1208 - hello! Do you have any questions for us? sunera Hey:) International Office - Ruth L sunera - hello :) krishna990

Barker, Jon

329

Introduction: Administration  

E-Print Network [OSTI]

. In a heavily loaded system, the DBA will forbid that ad­hoc queries are entered during standard working hours per min). ``Load profile'': List of DB commands with frequencies. Of course, the queries

Brass, Stefan

330

Enzymes of the shikimic acid pathway encoded in the genome of a basal metazoan, Nematostella vectensis, have microbial origins  

Science Journals Connector (OSTI)

...VDQHIKGLQAMGAEVRVEHGYVQAQVPRLKGARLFTDMVTVTGTENLMMAACLAQGETVI 182 Query 181 ENAAMEAEIDDLVCMLRKMGAQIDKNRDTKTWFITGVSSLHGADHGVVPDRIVAGTYAVA 240 ENAA E E+ DL L MGAQI T I GV +LHGA H ++PDRI GTY A Sbjct 183 ENAAREPEVVDLANCLVAMGAQI-SGAGTDVIRIRGVDALHGATHRIMPDRIETGTYLCA 241 Query 241 AVMTGGELTLT-LGPCPVPALMGCVLTCLRAAGAEVMELAEGIRVRGGRRPRSVSITTSP...

Antonio Starcevic; Shamima Akthar; Walter C. Dunlap; J. Malcolm Shick; Daslav Hranueli; John Cullum; Paul F. Long

2008-01-01T23:59:59.000Z

331

An Attack on CFB Mode Encryption as Used by OpenPGP  

Science Journals Connector (OSTI)

This paper describes an adaptive chosen-ciphertext attack on the Cipher Feedback (CFB) mode of encryption as used in OpenPGP...15 oracle queries for the initial setup work and 215 oracle queries for each block. S...

Serge Mister; Robert Zuccherato

2006-01-01T23:59:59.000Z

332

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-

333

QoS-Driven Load Shedding on Data Streams  

Science Journals Connector (OSTI)

In this thesis, we are working on the optimized execution of very large number of continuous queries defined on data streams. Our scope includes both classical query optimization issues adapted to the stream d...

Nesime Tatbul

2002-01-01T23:59:59.000Z

334

Math 142 Calculus II Winter 2012 Instructor: Dr. Dylan Retsek  

E-Print Network [OSTI]

at the end of the quarter. 4. Query. Two students will be drawn randomly for a daily query at the beginning of humankind. True understanding will come only to those who vigorously seek it. We are here to become

Retsek, Dylan Q.

335

UNIVERSITY OF WISCONSIN Collaborators  

E-Print Network [OSTI]

that quantitatively studied human's ability to actively select good queries in category learning. #12;Alien Eggs #12;Alien Eggs #12;Alien Eggs #12;Alien Eggs #12;Alien Eggs Active learning required 3 queries (in

Zhu, Xiaojin "Jerry"

336

Punctuated data streams  

Science Journals Connector (OSTI)

As most current query processing architectures are already pipelined, it seems logical to apply them to data streams. However, two classes of query operators are impractical for processing long or unbounded data streams. Unbounded stateful operators ...

Peter A. Tucker / David Maier

2005-01-01T23:59:59.000Z

337

E-Print Network 3.0 - automated content-based image Sample Search...  

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

Sciences 78 IFQ: A Visual Query Interface and Query Generator for Object-based Media Retrieval Summary: ,March 1996. 9 John R. Smith and Shin-Fu Chang. VisualSEEk a...

338

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

339

Does the Utility Rates service on OpenEI return/display the latest data or  

Open Energy Info (EERE)

Does the Utility Rates service on OpenEI return/display the latest data or Does the Utility Rates service on OpenEI return/display the latest data or only approved data? Home > Groups > Utility Rate I'm using SAM to download OpenEI utility rates and was wondering if I'm downloading the latest rates that have been entered, or only downloading the rates that have been approved. Submitted by Sfomail on 11 July, 2012 - 13:53 2 answers Points: 1 The web service at http://en.openei.org/services/, which is used by SAM, currently uses the "ask query" method of accessing OpenEI data. That runs through http://en.openei.org/wiki/Special:Ask. In the future (2013 or after?) we may use a different method of back-end data access through our SPARQL endpoint - time will tell. Performing a test on this data, I discovered that Special:Ask, and thus OpenEI utility rate services and SAM,

340

The Thesaurus for French Local Archives and the Semantic Web  

Science Journals Connector (OSTI)

Abstract The role of controlled vocabularies is more and more important in the management and retrieval (search) of resources. As essential components of the Semantic Web, authority systems are exposed as Linked Data and used as pivots in projects and applications to facilitate search and linking of resources. The Archives of France (an agency of the Ministry of Culture) seized the opportunity of making available on the web the thesaurus for local archives to test Linked Data technologies. Since January 2011, a website makes it possible to browse the thesaurus, to download RDF/XML documents but also to search via SPARQL which is the query language for RDF structured data (see: http://data.culture.fr/thesaurus/). This project was also an opportunity to align data with other controlled vocabularies and resources (thesaurus RAMEAU and Dbpedia) and to implement a solution for persistent identifiers of concepts of the thesaurus. This paper presents this open government data initiative, aiming not only to establish an interoperability framework between archival data, but also to consider archival data with other cultural data.

Claire Sibille-de Grimoard

2014-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "queries sparql queries" 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

Does the Utility Rates service on OpenEI return/display the latest data or  

Open Energy Info (EERE)

Does the Utility Rates service on OpenEI return/display the latest data or Does the Utility Rates service on OpenEI return/display the latest data or only approved data? Home > Groups > Utility Rate I'm using SAM to download OpenEI utility rates and was wondering if I'm downloading the latest rates that have been entered, or only downloading the rates that have been approved. Submitted by Sfomail on 11 July, 2012 - 13:53 2 answers Points: 1 The web service at http://en.openei.org/services/, which is used by SAM, currently uses the "ask query" method of accessing OpenEI data. That runs through http://en.openei.org/wiki/Special:Ask. In the future (2013 or after?) we may use a different method of back-end data access through our SPARQL endpoint - time will tell. Performing a test on this data, I discovered that Special:Ask, and thus OpenEI utility rate services and SAM,

342

Bayesian Sets Zoubin Ghahramani  

E-Print Network [OSTI]

are relevant to the cluster, while the query "Bush", "Putin", "Blair" suggests that current and world leader

Ghahramani, Zoubin

343

SPEAK4IT: MULTIMODAL INTERACTION IN THE WILD MICHAEL JOHNSTON AND PATRICK EHLEN  

E-Print Network [OSTI]

to specifying queries by voice (e.g., "bike repair shops near the Golden Gate Bridge") users can combine speech

Fisher, Kathleen

344

Speak4it: Multimodal Interaction for Local Search Patrick Ehlen  

E-Print Network [OSTI]

. In addition to specifying queries by voice (e.g., "bike repair shops near the golden gate bridge") users can

Fisher, Kathleen

345

Towards Secure Cyberinfrastructure for Sharing Border Information  

E-Print Network [OSTI]

Mexico, and the Mexican state of Chihuahua. In such situations, a correct re­ sponse to the user's query

Ward, Karen

346

How to E#ciently Process Uncertainty within a Cyberinfrastructure without Sacrificing  

E-Print Network [OSTI]

of Chihuahua. In such situations, a correct response to the user's query requires that we access these pieces

Kreinovich, Vladik

347

Slide14 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

Advanced Search (cont.) Again, the query is sent to all the portals in parallel, in real time and returned....

348

Electricity Monthly Update - Energy Information Administration  

Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]

Electricity Glossary FAQS Overview Data Electricty Data Browser (interactive query tool with charting & mapping) Summary Sales (consumption), revenue, prices & customers...

349

Strategic Use of Information Technology - Google  

E-Print Network [OSTI]

google/technology.pdf Barroso, L. A. , Dean, J. , & Holzle,Cost Query Source: Barroso, et al, 2003. Performance To

Chen, Rex; Lam, Oisze; Kraemer, Kenneth

2007-01-01T23:59:59.000Z

350

0018-9162/07/$25.00 2007 IEEE58 Computer Published by the IEEE Computer Society C O V E R F E A T U R E  

E-Print Network [OSTI]

query terms across search mediums might suggest that the number of terms Understanding the needs on a speech interface to search4 also found that the average length of spoken queries to Google was 2.1 terms few search results. It's surprising that mobile users don't enter shorter queries given the difficulty

Tomkins, Andrew

351

March 2002 107 W E B T E C H N O L O G I E S  

E-Print Network [OSTI]

and a personalization portal. Its searches are based on the exact terms a user enters in a query. Capitalization machine. · Time of day--in hours, minutes, and seconds. · Query--user terms as entered. We analyzed 29 percent entered three or more unique queries. Users typically do not add or delete many terms

Saracevic, Tefko

352

Search-As-You-Type: Opportunities and Challenges and Guoliang Li  

E-Print Network [OSTI]

systems return answers after a user submits a complete query. Users often feel "left in the dark" when repository. With limited knowledge about the data, a user often feels "left in the dark" when issuing queries "on the fly" as a user types in a keyword query letter by letter. For instance, consider the Web

Li, Chen

353

Efficient Fuzzy Type-Ahead Search in XML Data  

E-Print Network [OSTI]

knowledge about the data, often the user feels "left in the dark" when issuing queries, and has to use a try. Keyword search is a widely accepted search paradigm for querying document systems and the World Wide Web about the data, often the user feels "left in the dark" when issuing queries, and has to use a try

Li, Guoliang

354

Search and Replication in Unstructured Peer-to-Peer Networks Edith Cohen  

E-Print Network [OSTI]

over network topology or data placement. However, the flooding-based query algorithm used in Gnutella become overwhelmed by the query-induced load. This paper explores, through simulation, various algorithm based on multiple random walks that resolves queries almost as quickly as Gnutella's flooding

Keinan, Alon

355

Pointbased Temporal Extensions of SQL and their Efficient Implementation  

E-Print Network [OSTI]

for references to time, while still achieving efficient query evalua­ tion. The proposed language, SQL/TP query evaluation procedure is based on a compilation technique that translates SQL/TP queries to SQL/92 of temporal extension of SQL3 to the ISO and ANSI standardization committees. The goal of this chapter

Toman, David

356

Noname manuscript No. (will be inserted by the editor)  

E-Print Network [OSTI]

Noname manuscript No. (will be inserted by the editor) Query Processing Over Incomplete Autonomous in autonomous web databases, on which user accesses are usually supported through mediators. Traditional query missing attributes, even if they wind up being relevant to a user query. Ideally we would like

Kambhampati, Subbarao

357

A Data Model for Data Integration  

Science Journals Connector (OSTI)

Data integration systems provide a uniform query interface (UQI) to multiple, autonomous data sources [Alon Y. Halevy. Answering queries using views: A survey. The VLDB Journal, 10(4):270-294, 2001]. This paper presents the universal data model (UDM) ... Keywords: Data Integration, Data Model, Query Languages

James J. Lu

2006-03-01T23:59:59.000Z

358

Web Intelligence and Agent Systems: An International Journal 10 (2012) 7588 75 DOI 10.3233/WIA-2012-0232  

E-Print Network [OSTI]

-2012-0232 IOS Press Selecting queries from sample to crawl deep web data sources Yan Wang a,*, Jianguo of selecting queries to efficiently crawl a deep web data source using a set of sample documents. Crawling deep challenges in crawling deep web is the selection of the queries so that most of the data can be retrieved

Lu, Jianguo

359

Dealing with the Deep Web and all its Quirks Meghyn Bienvenu  

E-Print Network [OSTI]

Dealing with the Deep Web and all its Quirks Meghyn Bienvenu CNRS; Universit´e Paris-Sud meghyn harvest, query, or combine Deep Web sources. Yet, in addition to well-studied aspects of the problem such as query answering using views, access limitations, or top-k querying, the Deep Web exhibits a number

Senellart, Pierre

360

Microsoft Word - NG_ResQrySys_UsersGuide_Nov2013  

Gasoline and Diesel Fuel Update (EIA)

Natural Gas Information Natural Gas Information Annual Respondent Query System User's Guide November 2013 Prepared by: 5418 Seminary Road Alexandria, VA 22311 Prepared for: Natural Gas Reserves Division Office of Oil, Gas and Coal Supply Statistics Energy Information Administration Department of Energy 1000 Independence Avenue, S.W. Washington, D.C. 20585 ii Natural Gas Information Annual Respondent Query System User's Guide Natural Gas Information Annual Respondent Query System User's Guide Table of Contents Introduction ................................................................................................................................................... 1 Hardware/Software Requirements ................................................................................................................ 1

Note: This page contains sample records for the topic "queries sparql queries" 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

Performing a Person Search using Banner 7.x Page 1 of 8  

E-Print Network [OSTI]

the query or click the 11th icon from the left on the tool bar [note: if you put the cursor over the icon it should say `Execute Query']. Execute Query icon looks like: #12;Performing a Person Search using Banner 7 [Shift]+[F3] or o double click on the record you want to select or o click the 3rd icon from the left

362

NCBI Handout Series | CDD | Last Update August 19, 2013 Contact: info@ncbi.nlm.nih.gov CDD: Conserved Domain Database  

E-Print Network [OSTI]

.ncbi.nlm.nih.gov/pub/mmdb/cdd/ Searching CDD with text query Entering a set of query terms in the search box and pressing the "Search and is extensively linked with other NCBI data. CDs can be found by direct text searching from the CDD homepage is represented in scoremat format and these scoremats have been made available for search with a pro- tein query

Levin, Judith G.

363

If you would like any more information on Newsletter items, or have any comments or queries, please contact us by email at: history@qub.ac.uk or anthropology@qub.ac.uk, by phone at (0)28 90975101, or visit our website at  

E-Print Network [OSTI]

://enigmafrankryan.com/ . Staff news: Many congratulations to James and Carol Davis on the birth of their son Benjamin. Three, in Parliamentary History, xxxi (2012), pp 80­98 Keith Jeffery, ,,The Imperial Conference, the Committee of Imperial

Müller, Jens-Dominik

364

11/3/08 2:45 PMCASES WITHOUT BORDERS; At the Old Swimming Hole, a Vicious Cycle Thrives -New York Times Page 1 of 3http://query.nytimes.com/gst/fullpage.html?res=9F00EFDA1E3DF931A35752C1A9629C8B63&sec=&spon=&pagewanted=print  

E-Print Network [OSTI]

. MCNEIL JR. The pond was about the size of a school swimming pool, except it was surrounded by dry mud11/3/08 2:45 PMCASES WITHOUT BORDERS; At the Old Swimming Hole, a Vicious Cycle Thrives - New York=&spon=&pagewanted=print November 2, 2004 CASES WITHOUT BORDERS; At the Old Swimming Hole, a Vicious Cycle Thrives By DONALD G

Davis, Richard E.

365

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.

366

RAPID/Roadmap/3-ID-d | Open Energy Information  

Open Energy Info (EERE)

meets any of the sets of conditions below, you may need to complete this permit or process. Regulations Not available Resources SET VARIABLES FOR USE WITH RESOURCE QUERY...

367

E-Print Network 3.0 - advanced telemedicine development Sample...  

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

b ** Summary: Networks, Telemedicine, CAC, QoS, Data Query 1. INTRODUCTION Advances in micro-electro-mechanical systems... QoS Considerations in Wireless Sensor Networks for...

368

Slide21 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

With just one click, your query will be sent from the server in Oak Ridge, TN, to databases around the globe...

369

Slide23 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

With just one click, your query will be sent from the server in Oak Ridge, TN, to databases around the globe...

370

Slide23 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

Your query will return to your desktop from the server in Oak Ridge, TN, with a list of results in "real time."...

371

RAPID/Roadmap/18-HI-a | Open Energy Information  

Open Energy Info (EERE)

to complete this permit or process. Regulations H.A.R. 11-281 - Underground Storage Tanks Resources SET VARIABLES FOR USE WITH RESOURCE QUERY Land Use Hawaii...

372

V-139: Cisco Network Admission Control Input Validation Flaw...  

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

Sensitive Information U-270:Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query Module Lets Remote Users Inject SQL Commands U-015: CiscoWorks Common...

373

E-Print Network 3.0 - age ad multos Sample Search Results  

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

Summary: evaluation of the authorized views is highly required. To this end, ad-hoc query evaluation techniques... of lightness, battery life, security and production...

374

Slide18 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

OSTI InnovationAdvancing Science through Knowledge Discovery Making hundreds of databases searchable with a single query. WorldWideScience.org - A global science gateway...

375

RAPID/Geothermal | Open Energy Information  

Open Energy Info (EERE)

source History View New Pages Recent Changes All Special Pages Semantic SearchQuerying Get Involved Help Apps Datasets Community Login | Sign Up Search Page Edit History Facebook...

376

File:Minorpermforms format 8-30-04.pdf | Open Energy Information  

Open Energy Info (EERE)

source History View New Pages Recent Changes All Special Pages Semantic SearchQuerying Get Involved Help Apps Datasets Community Login | Sign Up Search File Edit History Facebook...

377

File:01WAALandUsePlanning.pdf | Open Energy Information  

Open Energy Info (EERE)

source History View New Pages Recent Changes All Special Pages Semantic SearchQuerying Get Involved Help Apps Datasets Community Login | Sign Up Search File Edit History Facebook...

378

File:08-CO-c - State Transmission Process.pdf | Open Energy Informatio...  

Open Energy Info (EERE)

source History View New Pages Recent Changes All Special Pages Semantic SearchQuerying Get Involved Help Apps Datasets Community Login | Sign Up Search File Edit History Facebook...

379

File:04NVBTemporaryUseOfGroundWaterForExploration.pdf | Open...  

Open Energy Info (EERE)

source History View New Pages Recent Changes All Special Pages Semantic SearchQuerying Get Involved Help Apps Datasets Community Login | Sign Up Search File Edit History Facebook...

380

File:2-17-05 Pre-Application checklist.pdf | Open Energy Information  

Open Energy Info (EERE)

source History View New Pages Recent Changes All Special Pages Semantic SearchQuerying Get Involved Help Apps Datasets Community Login | Sign Up Search File Edit History Facebook...

Note: This page contains sample records for the topic "queries sparql queries" 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

File:08FDBFERCOrderNo.792Process.pdf | Open Energy Information  

Open Energy Info (EERE)

source History View New Pages Recent Changes All Special Pages Semantic SearchQuerying Get Involved Help Apps Datasets Community Login | Sign Up Search File Edit History Facebook...

382

File:0 - Overall Flow (Solar).pdf | Open Energy Information  

Open Energy Info (EERE)

source History View New Pages Recent Changes All Special Pages Semantic SearchQuerying Get Involved Help Apps Datasets Community Login | Sign Up Search File Edit History Facebook...

383

Allocations | Argonne Leadership Computing Facility  

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

Allocation Management Determining Allocation Requirements Querying Allocations Using cbank MiraCetusVesta Tukey Policies Documentation Feedback Please provide feedback to help...

384

E-Print Network 3.0 - assigning computational phantoms Sample...  

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

computing and maintaining phantoms may reduce the overall... query pro- cessing cost due to shared ... Source: Zhang, Rui - Department of Computer Science and Software...

385

E-Print Network 3.0 - alphavirus-derived small rnas Sample Search...  

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

RNAs is queried by a second PCR-based amplification method with primers complementary... Identification of many microRNAs that copurify with polyribosomes in mammalian neurons...

386

OREIS Enhancements  

Office of Environmental Management (EM)

will be required. Efforts are currently underway to add ROD shape files to the OREIS Spatial Query Tool. Shape files must be attribute defined: actual land surveys (capped...

387

A Distribution Oblivious Scalable Approach for Large-Scale Scientific...  

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

common to most higher-level SDP applications. Based on distribution-independent parallel spatial data structures, develop core parallel region query algorithms whose runtimes are...

388

RAPID/Tools | Open Energy Information  

Open Energy Info (EERE)

Querying Get Involved Help Apps Datasets Community Login | Sign Up Search Page Edit History Facebook icon Twitter icon RAPIDTools < RAPID(Redirected from RAPIDResources)...

389

RAPID/Tools | Open Energy Information  

Open Energy Info (EERE)

Querying Get Involved Help Apps Datasets Community Login | Sign Up Search Page Edit History Facebook icon Twitter icon RAPIDTools < RAPID Jump to: navigation, search...

390

E-Print Network 3.0 - archive vista results Sample Search Results  

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

and Alta Vista.com for providing the Web query data sets without which thay Source: Jansen, James - College of Information Sciences and Technology, Pennsylvania State University...

391

RAPID/Roadmap/5-TX-a | Open Energy Information  

Open Energy Info (EERE)

Units: Contiguity of Acreage and Exception 16 TAC 3.33: Geothermal Resource Production Test Forms Required Resources SET VARIABLES FOR USE WITH RESOURCE QUERY Well Field Texas...

392

E-Print Network 3.0 - activation measure pam13 Sample Search...  

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

learning Uncertainty sampling Version space reduction and query by committee Expected error Source: Mitchell, Tom - School of Computer Science, Carnegie Mellon University...

393

Slide7 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

Single-Query Search The Challenge: Researchers needed help sorting through the numerous products to get the most relevant results quickly The Solution: To simplify searching of...

394

E-Print Network 3.0 - advanced beta thalassemia Sample Search...  

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

Processing Archiving & Query Simple and Advanced... ) Insight into function and disease (sickle cell anemia, thalassemia)5 Oth i h l bi Lodish ... Source: Hewins, Roger H.-...

395

Slide12 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

Science Accelerator http:www.scienceaccelerator.gov OSTI's over-arching product Users can search all OSTI's public products with a single query Eliminates work and time required...

396

E-Print Network 3.0 - anti-arrhythmic anti-hypertensiveanti...  

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

Chemistry & High-Throughput Screening., in press Summary: on the reductive amination and Ugi reactions using as queries a known anti-arrhythmic agent and a product inhibitor...

397

Slide08 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

2005 MetaRank: More sophisticated relevancy ranking of results using more metadata Advanced search and Boolean operators: More precise query using AND, OR or NOT;...

398

E-Print Network 3.0 - anatomical database generation Sample Search...  

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

to the Human Brain Project Summary: database. The application is demonstrated as a query interface to the University of Washington Brain... that utilize standard relational...

399

E-Print Network 3.0 - activity rules periodic Sample Search Results  

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

Active and Deductive Databases by Institut fur Informatik ---Report 70 Summary: , passive query rules and active transition rules within a simple, yet flexible logical...

400

Slide19 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

at 2100+ Websites and 42 Databases with One Query * Searches selected websites ("surface web") and databases ("deep web") from one search point * Combines results from all sources,...

Note: This page contains sample records for the topic "queries sparql queries" 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

Slide04 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

1,950+ Websites and 38 Databases with One Query * Searches selected websites ("surface web") and databases ("deep web") from one search point * Combines results from all sources...

402

Slide05 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

Deep Web Solution: Federated Searching * A single user query simultaneously sent to multiple deep web databases. * Federated search engine sorts and presents results in...

403

Application Programming Interface | Department of Energy  

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

(API). Using the API, users can query the same analytical tools available through the web interface, without compromising the security or anonymity of the database. The API...

404

E-Print Network 3.0 - athman bouguettaya boualem Sample Search...  

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

3 4 5 > >> 1 Guest Editorial: Special Section on Query Models and Efficient Selection of Web Services Summary: , Member, IEEE, and Athman Bouguettaya, Fellow, IEEE ...

405

alleged social implications: Topics by E-print Network  

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

understanding of the dynamics that drive the creation of user generated content in social media. This process suggests the need for an extension for the structured query language...

406

RAPID/Roadmap/11-FD-a | Open Energy Information  

Open Energy Info (EERE)

SET VARIABLES FOR USE WITH RESOURCE QUERY Land Use Federal BLM - Final Programmatic Environmental Impact Statement for Geothermal Leasing in the Western United States BLM IM...

407

E-Print Network 3.0 - attribute pair-based visual Sample Search...  

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

Collection: Computer Technologies and Information Sciences 68 Generating Advanced Query Interfaces Dongwon Lee Divesh Srivastava Dimitra Vista Summary: visual components: The...

408

RAPID/Roadmap/11-FD-b | Open Energy Information  

Open Energy Info (EERE)

SET VARIABLES FOR USE WITH RESOURCE QUERY Land Use Federal BLM - Final Programmatic Environmental Impact Statement for Geothermal Leasing in the Western United States BLM IM...

409

RAPID/Roadmap/1 (2) | Open Energy Information  

Open Energy Info (EERE)

SET VARIABLES FOR USE WITH RESOURCE QUERY Land Use Federal BLM - Final Programmatic Environmental Impact Statement for Geothermal Leasing in the Western United States Bureau...

410

Natural Gas Annual, 2000  

Gasoline and Diesel Fuel Update (EIA)

EIA-176 Query system is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later. It provides a method of extracting and using the company level data filed on the Form EIA-176, and saving the query results in various media and formats. There are pre-selected data queries, which allow the user to select and run the most often-used queries, as well as the ability to create a customized query. Self-extracting executable files with run-time versions of Access are required to set up the system. You may also download the data tables if you already have Microsoft Access on your computer. For instructions, please read the documentation file(s) listed below. EIA-176 Query system is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later. It provides a method of extracting and using the company level data filed on the Form EIA-176, and saving the query results in various media and formats. There are pre-selected data queries, which allow the user to select and run the most often-used queries, as well as the ability to create a customized query. Self-extracting executable files with run-time versions of Access are required to set up the system. You may also download the data tables if you already have Microsoft Access on your computer. For instructions, please read the documentation file(s) listed below. Entire . Entire EIA-176 Query System with run time version of Access. EXE

411

44 Health Libraries Group 2004 Health Information and Libraries Journal, 21, pp.4451 Blackwell Publishing, Ltd.  

E-Print Network [OSTI]

provide insights into medical and health-related web querying and suggests some implications for the use44 © Health Libraries Group 2004 Health Information and Libraries Journal, 21, pp.44­51 Blackwell Publishing, Ltd. A study of medical and health queries to web search engines Amanda Spink*, Yin Yang, Jim

Jansen, James

412

Personalised Information Retrieval: survey and classification  

Science Journals Connector (OSTI)

Information Retrieval (IR) systems assist users in finding information from the myriad of information resources available on the Web. A traditional characteristic of IR systems is that if different users submit the same query, the system would yield ... Keywords: Adaptive hypermedia, Evaluation, Information Retrieval, Multilingual Information Retrieval, Personalisation, Query adaptation, Result adaptation, Search history, Survey, User interests, User modelling

M. Rami Ghorab; Dong Zhou; Alexander O'connor; Vincent Wade

2013-09-01T23:59:59.000Z

413

Independent Study Report University of Pittsburgh  

E-Print Network [OSTI]

be understood as for finding out popular ones in terms of links 1 #12;among documents. Social search is another interest can use similar query terms for the same task and their search experiments can be shared. Based on this observation, social search approach exploits past search histories. When a user enters a query, the social

Brusilovsky, Peter

414

PREFETCHING RESULTS OF WEB SEARCHES Harry Foxwell Daniel A. Menasc  

E-Print Network [OSTI]

services. A user wishes to locate Web sites that match query keywords. A query term or phrase is entered advertising images and text. A search for a common term such as "dinosaur" may return tens of thousandsPREFETCHING RESULTS OF WEB SEARCHES Harry Foxwell Daniel A. Menascé Sun Microsystems Dept

Menascé, Daniel A.

415

ScentTrails: Integrating Browsing and Searching on the Web  

E-Print Network [OSTI]

. Searching is the process of entering a search query (usually a list of keywords) into a search engine, which are more appropriately termed by Jul and Furnas [1997] as "search by navigation" and "search by query," respectively, but we will use the more common terms "browsing" and "searching.") Authors' addresses: Chris

Chi, Ed Huai-hsin

416

The VocalSearch Music Search Engine Bryan Pardo, David Little, Rui Jiang, Hagai Livni, Jinyu Han  

E-Print Network [OSTI]

queries, queries entered as music notation, and text-based lyrics search. Users are also ableThe VocalSearch Music Search Engine Bryan Pardo, David Little, Rui Jiang, Hagai Livni, Jinyu Han@gmail.com ABSTRACT The VocalSearch system is a music search engine developed at Northwestern University and available

Pardo, Bryan

417

Fading Away: Dilution and User Behaviour Paul Thomas  

E-Print Network [OSTI]

entering another query into the search interface) than a user who has found a large number of relevant, hoping for better results; 3. Switching to a different search engine and entering the same query, hoping@unimelb.edu.au ABSTRACT When faced with a poor set of document summaries on the first page of returned search results

Thomas, Paul

418

Site-Searching Strategies of Searchers Referred from Search Engines  

E-Print Network [OSTI]

the referral queries and associated site-search queries at the session level from searchers coming from web of referral keywords (i.e., search terms) used at the major search engine. Of the six, the three major to uncover different site-search strategies that manifest depending on the referral keyword used at the major

Jansen, James

419

Performance of Time Warp Protocols for Transaction Management in ObjectOriented Systems  

E-Print Network [OSTI]

+. The interactive nature of Query Driven Simulation requires the rapid execution of simulation models. Ideally is an approach to simula­ tion modeling and analysis that uses database technology to automate the storage and retrieval of simulation data and simulation models. The fundamental tenet of Query Driven Simulation

Miller, John A.

420

Performance of Time Warp Protocols for Transaction Management in Object-Oriented Systems  

E-Print Network [OSTI]

. The interactive nature of Query Driven Simulation requires the rapid execution of simulation models. Ideally is an approach to simula- tion modeling and analysis that uses database technology to automate the storage and retrieval of simulation data and simulation models. The fundamental tenet of Query Driven Simulation

Miller, John A.

Note: This page contains sample records for the topic "queries sparql queries" 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

Data-Driven Synthesis for Object-Oriented Frameworks Kuat Yessenov Zhilei Xu Armando Solar-Lezama  

E-Print Network [OSTI]

Data-Driven Synthesis for Object-Oriented Frameworks Kuat Yessenov Zhilei Xu Armando Solar a simple query synthesizes code that interacts with the framework. The query consists of names of two frame challenge: establishing an interaction between two framework classes. The problem arises from the way object

Jackson, Daniel

422

Attacking Suggest Boxes in Web Applications Over HTTPS Using Side-Channel  

E-Print Network [OSTI]

. At company scale, a look at the search history of competitors can be used to predict their future actions can be used on search engines such as Google or Bing to retrieve the client's search query to uniquely map a search query to a web traffic signature and hence stochastic algorithms must be used

Rioul, Olivier

423

Efficient Data Management for Knowledge Discovery in Large-Scale Geospatial Imagery Collections  

SciTech Connect (OSTI)

We describe the results of our investigation on supporting ad-hoc and continuous queries over data streams. The major problem we address here is how to identify and utilize metadata for smart caching and to support queries over streaming and archived or historical data.

Baldwin, C; Abdulla, G

2006-01-24T23:59:59.000Z

424

Future Generation Computer Systems 25 (2009) 511524 Contents lists available at ScienceDirect  

E-Print Network [OSTI]

. 1. Introduction The Grid is an effective infrastructure for the coordinated use and sharing-oriented system for distributed data querying and integration on Grids$ Carmela Comitoa, , Anastasios Gounarisb November 2008 Available online 7 December 2008 Keywords: Data Grids Distributed query processing Wide

Sakellariou, Rizos

425

Multidimensional structured data visualization method and apparatus, text visualization method and apparatus, method and apparatus for visualizing and graphically navigating the world wide web, method and apparatus for visualizing hierarchies  

DOE Patents [OSTI]

A method of displaying correlations among information objects includes receiving a query against a database; obtaining a query result set; and generating a visualization representing the components of the result set, the visualization including one of a plane and line to represent a data field, nodes representing data values, and links showing correlations among fields and values. Other visualization methods and apparatus are disclosed.

Risch, John S. (Kennewick, WA); Dowson, Scott T. (West Richland, WA)

2012-03-06T23:59:59.000Z

426

Quantum Certificate Complexity Scott Aaronson #  

E-Print Network [OSTI]

, that Q 0 (f) # R 0 (f), and that Q E (f) # D (f). If f is partial (i.e. Dom (f) #= {0, 1} n ), then Q 2Quantum Certificate Complexity Scott Aaronson # Computer Science Division University of California . Then the deterministic query complexity D (f) is the minimum number of queries to the y i 's needed to evaluate f , if Y

Aaronson, Scott

427

Predicting the Click-Through-Rate of Advertisements for Sponsored Search  

E-Print Network [OSTI]

green tea $0.3 green tea $0.4 green tea from china $0.5 green tea for weight loss $1.00 ·Advertiser bids tea" and advertiser's bidded phrase "green tea from china" Today's talk will focus on advance match(click|query,ad) time- stamp cookie Query Title Creative URL Pos Click ? 110298 dskhjfH green tea

Baeza-Yates, Ricardo

428

A Functional Description of ANALYZE: A Computer-Assisted Analysis System  

E-Print Network [OSTI]

and Behavioral Sciences-economics; K.6.3 [Management of Computing and Information Systems]: Software Management approaches are described: dimensional reduction and search for embedded ' structures, notably netforms.3 [Data- base Management]: Languages-query languages; H.2.4 [Database Management]: Systems- query

Greenberg, Harvey J.

429

Math 142 Calculus II Winter 2014 Instructor: Dr. Dylan Retsek  

E-Print Network [OSTI]

and a final exam at the end of the quarter. 4. Query. Two students will be drawn randomly for a daily query in the history of humankind. True understanding will come only to those who vigorously seek it. We are here

Retsek, Dylan Q.

430

Topic initiator detection on the world wide web  

Science Journals Connector (OSTI)

In this paper we introduce a new Web mining and search technique - Topic Initiator Detection (TID) on the Web. Given a topic query on the Internet and the resulting collection of time-stamped web documents which contain the query keywords, the task of ... Keywords: information retrieval, ranking, topic initiator, web mining

Xin Jin; Scott Spangler; Rui Ma; Jiawei Han

2010-04-01T23:59:59.000Z

431

A Polynomial Time Incremental Algorithm for Learning DFA  

E-Print Network [OSTI]

and membership queries. This algorithm is an extension of Angluin's ID pro­ cedure to an incremental framework that the modified hypoth­ esis is consistent with all examples observed thus far. The algorithm is guaranteed a knowledgeable teacher who responds to queries generated by the learner. Angluin's ID algorithm learns the target

Honavar, Vasant

432

Bridging Relational Database History and the Web: the XML Approach  

E-Print Network [OSTI]

Bridging Relational Database History and the Web: the XML Approach Fusheng Wang Integrated Data and queries, and make it easy to pub- lish database history to the Web. In this paper, we focus on the problem of preserving, publishing, and querying ef- ficiently the history of a relational database. Past research

Zaniolo, Carlo

433

ukasiewicz Logic: From Proof Systems To Logic Programming  

Science Journals Connector (OSTI)

......n, n ? n)}, a contradiction. The next step is to show that all valid atomic (and hence also irreducible) queries suc- ceed in GDL. To this end we introduce a translation from irreducible queries containing propositional variables q1, . . . , qn into......

George Metcalfe; Nicola Olivetti; Dov Gabbay

2005-09-01T23:59:59.000Z

434

Pointbased Temporal Extension of SQL David Toman  

E-Print Network [OSTI]

as a basis for a temporal extension of SQL. The proposed language---SQL/TP---extends the syntax and semantics. This way SQL/TP also fixes many problems present in query languages that use explicit interval­based temporal attributes. In addition, SQL/TP queries can still be efficiently evaluated over a compact interval

Toman, David

435

IIT at TREC-2003 Task Classification & Document Structure for  

E-Print Network [OSTI]

IIT at TREC-2003 Task Classification & Document Structure for Known-Item Search Steve Beitzel, Eric on fusion of result sets generated by query runs over independent parts of the document structure. Our task the median. Keywords: Known-item search, document structure retrieval, query task classification Introduction

436

Adaptive Multiparty Non-interactive Key Exchange Without Setup In The Standard Model  

E-Print Network [OSTI]

proceed, let us review at a high level the utility and security of multiparty NIKE. We consider a setting a public value. Utility: Consider any subset of the parties who wish to derive a common secret key in the ensuing. - Query the challenger to register an honest party ­ upon this query, the challenger outputs

437

GIS IN SOIL & WATER SCIENCE On-Campus Section 8197  

E-Print Network [OSTI]

with and create GIS maps in ArcMap Access and query a GIS database Describe two common GIS data structures Change the coordinate system and map projection used to display a dataset Query and analyze GIS dataSWS 4720C GIS IN SOIL & WATER SCIENCE On-Campus Section 8197 Fall 2014 Instructor Wade Ross wader

Ma, Lena

438

GIS IN SOIL & WATER SCIENCE On-Campus Section 8197  

E-Print Network [OSTI]

it can do. Work with and create GIS maps in ArcMap. Access and query a GIS database. Describe two a dataset. Query and analyze GIS data. Create presentation-quality maps and graphs DELIVERY MODE: · CourseSWS 4720C GIS IN SOIL & WATER SCIENCE On-Campus Section 8197 Fall 2013 Instructor Susan Curry

Ma, Lena

439

GIS IN SOIL & WATER SCIENCE Distance Education Sections  

E-Print Network [OSTI]

is and what it can do. Work with and create GIS maps in ArcMap. Access and query a GIS database. Describe a dataset. Query and analyze GIS data. Create presentation-quality maps and graphs DELIVERY MODE: · CourseSWS 4720C GIS IN SOIL & WATER SCIENCE Distance Education Sections Fall 2013 Instructor Susan Curry

Ma, Lena

440

ukasiewicz Logic: From Proof Systems To Logic Programming  

Science Journals Connector (OSTI)

......y. da fact(x): x is a dangerous factory. toxic(x): x is...lives in y. aff he(x): the health of x is affected. factory...a2, v2). The query "how dangerous is factory a1?" can then...query "How much is Mary's health affected?", written as......

George Metcalfe; Nicola Olivetti; Dov Gabbay

2005-09-01T23:59:59.000Z

Note: This page contains sample records for the topic "queries sparql queries" 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

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

442

Sequential and spontaneous star formation around the mid-infrared halo H II region KR 140  

Science Journals Connector (OSTI)

......Catalog (2MASS PSC) using the online gator query tool at the Infrared Science Archive...The 2MASS PSC was queried using the gator software at IRSA. All of the catalogue...A-D][A-D][A-D] in sql used by gator. This research has made extensive use......

C. R. Kerton; K. Arvidsson; Lewis B. G. Knee; C. Brunt

2008-04-01T23:59:59.000Z

443

Transform (60833005, 60573091), 863 2007AA01Z1552009AA011904  

E-Print Network [OSTI]

Transform (60833005, 60573091), 863 2007AA01Z1552009AA011904 200800020002 xfmeng@ruc.edu.cn Transform ( 100872) (wwcd2005@163.com) Algebra-based Transform query optimization strategy Wang Wei 100872) Abstract XQuery/Update defines a special Transform query, which is similar to be hypothetical

444

Sample Applications of the E-utilities Eric Sayers, PhD  

E-Print Network [OSTI]

($url); #parse WebEnv and QueryKey EntrezProgrammingUtilitiesHelpEntrezProgrammingUtilitiesHelp #12;$web = $1 if ($output =~ /WebEnv>(\\S+)Env>/); $key = $1 if ($output =~ /Key>(\\d+)/); ### include this code for ESearch-ESummary #assemble the esummary URL $url = $base . "esummary.fcgi?db=$db&query_key=$key&WebEnv=$web

Levin, Judith G.

445

Porting a web-based mapping application to a smartphone app  

Science Journals Connector (OSTI)

NewsStand is a Web-based mapping application that we have developed to enable searching for spatially-referenced information by using a map query interface. Previously, we adapted the Web version to execute on mobile devices such as smartphones where ... Keywords: app, map query interface, newsstand, smartphone, touch screen gesturing interface

Hanan Samet; Marco D. Adelfio; Brendan C. Fruin; Michael D. Lieberman; Benjamin E. Teitler

2011-11-01T23:59:59.000Z

446

2007 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics October 21-24, 2007, New Paltz, NY PROBABILISTIC MODEL BASED SIMILARITY MEASURES FOR AUDIO  

E-Print Network [OSTI]

2007 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics October 21-24, 2007, New Paltz, NY PROBABILISTIC MODEL BASED SIMILARITY MEASURES FOR AUDIO QUERY-BY-EXAMPLE Tuomas Virtanen This paper proposes measures for estimating the similarity of two audio signals, the objective being in query

Virtanen, Tuomas

447

TsingNUS: A Location-Based Service System Towards Guoliang Li  

E-Print Network [OSTI]

the nearest gas station or restaurant. She has a search requirement that the answers should be in front of her between the query and objects. For example, if a user wants to find a gas station nearby, she can issue a keyword query "gas station" to an LBS system, which returns the relevant gas stations by considering

Li, Guoliang

448

Topic Sensitive SourceRank: Extending SourceRank for Performing Context-Sensitive Search over Deep Web  

E-Print Network [OSTI]

of the foremost challenges for searching deep-web. For a user query, source selection involves selecting a subset of deep-web sources expected to provide relevant answers to the user query. Existing source selection, given the autonomous and uncurated nature of deep-web, have be- come indispensible for searching deep-web

Kambhampati, Subbarao

449

B. Benatallah et al. (Eds.): WISE 2007, LNCS 4831, pp. 1325, 2007. Springer-Verlag Berlin Heidelberg 2007  

E-Print Network [OSTI]

Heidelberg 2007 Querying Capability Modeling and Construction of Deep Web Sources Liangcai Shu1 , Weiyi Meng1 at Chicago, Chicago, IL 60607, U.S.A yu@cs.uic.edu Abstract. Information in a deep Web source can be accessed interfaces of deep Web sources such as deep Web crawling and comparison-shopping. Analyzing the querying

Meng, Weiyi

450

Abstract -This paper discusses the current landscape of the services available over the Web and proposes a  

E-Print Network [OSTI]

the "deep Web" provides online queries through Web pages for users to access the hidden databases-end databases is defined as the so-called Deep Web. Apart from the Web query interfaces supported by databases-based and not necessarily supported by databases. Similar to the Deep Web, these Web pages also provide services for users

Zhang, Kang

451

Parallel Index  

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

Parallel Parallel Index and Query for Large Scale Data Analysis Jerry Chou Kesheng Wu Oliver Rübel Mark Howison Ji Qiang Prabhat Brian Austin E. Wes Bethel Rob D. Ryne Arie Shoshani ABSTRACT Modern scientific datasets present numerous data manage- ment and analysis challenges. State-of-the-art index and query technologies are critical for facilitating interactive ex- ploration of large datasets, but numerous challenges remain in terms of designing a system for processing general scien- tific datasets. The system needs to be able to run on dis- tributed multi-core platforms, efficiently utilize underlying I/O infrastructure, and scale to massive datasets. We present FastQuery, a novel software framework that address these challenges. FastQuery utilizes a state-of-the- art index and query technology (FastBit) and is designed to process massive datasets on modern supercomputing

452

U-039: ISC Update: BIND 9 Resolver crashes after logging an error in  

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

9: ISC Update: BIND 9 Resolver crashes after logging an error 9: ISC Update: BIND 9 Resolver crashes after logging an error in query.c U-039: ISC Update: BIND 9 Resolver crashes after logging an error in query.c November 16, 2011 - 2:30pm Addthis PROBLEM: ISC Update: BIND 9 Resolver crashes after logging an error in query.c. PLATFORM: Versions of BIND, 9.4-ESV, 9.6-ESV, 9.7.x, 9.8.x ABSTRACT: A remote server can cause the target connected client to crash. Organizations across the Internet are reporting crashes interrupting service on BIND 9 nameservers performing recursive queries. Affected servers crash after logging an error in query.c with the following message: "INSIST(! dns_rdataset_isassociated(sigrdataset))" Multiple versions are reported as being affected, including all currently supported release versions of ISC BIND 9. ISC is actively investigating the root cause and

453

Studying and analysing students web search behaviours within three Jordanian universities  

Science Journals Connector (OSTI)

The World Wide Web has become a phenomenon. The web is a crucial source of information for almost every person. Peoples with different jobs using the internet to meet their professional needs, and the university students constitute a large segment of those people who use the internet frequently to accomplish their information needs. This research has conducted an investigation to determine how Jordanian university students are using the web, what are the characteristics of queries used when searching the internet, what are the top searched queries, ..., etc. All these goals are achieved after extracting different queries and information from these web log files and analysing them. Results have showed that students are interested in topics related to entertainment and society more than topics related to their studies. Students submit short queries consisting of 1, 2, or 3 terms with little usage of different query operators. Unsurprisingly, they use Google as the preferred search engine and Arabic as the preferred search language.

Abdullah Hamdi Wahbeh; Mohammed Naji Al-Kabi; Majdi Ahmad Maabreh; Izzat Mahmoud Al-Smadi; Emad Mahmoud Al-Shawakfa

2014-01-01T23:59:59.000Z

454

Image Content Engine (ICE)  

SciTech Connect (OSTI)

The Image Content Engine (ICE) is being developed to provide cueing assistance to human image analysts faced with increasingly large and intractable amounts of image data. The ICE architecture includes user configurable feature extraction pipelines which produce intermediate feature vector and match surface files which can then be accessed by interactive relational queries. Application of the feature extraction algorithms to large collections of images may be extremely time consuming and is launched as a batch job on a Linux cluster. The query interface accesses only the intermediate files and returns candidate hits nearly instantaneously. Queries may be posed for individual objects or collections. The query interface prompts the user for feedback, and applies relevance feedback algorithms to revise the feature vector weighting and focus on relevant search results. Examples of feature extraction and both model-based and search-by-example queries are presented.

Brase, J M

2007-03-26T23:59:59.000Z

455

SAPLE: Sandia Advanced Personnel Locator Engine.  

SciTech Connect (OSTI)

We present the Sandia Advanced Personnel Locator Engine (SAPLE) web application, a directory search application for use by Sandia National Laboratories personnel. SAPLE's purpose is to return Sandia personnel 'results' as a function of user search queries, with its mission to make it easier and faster to find people at Sandia. To accomplish this, SAPLE breaks from more traditional directory application approaches by aiming to return the correct set of results while placing minimal constraints on the user's query. Two key features form the core of SAPLE: advanced search query interpretation and inexact string matching. SAPLE's query interpretation permits the user to perform compound queries when typing into a single search field; where able, SAPLE infers the type of field that the user intends to search on based on the value of the search term. SAPLE's inexact string matching feature yields a high-quality ranking of personnel search results even when there are no exact matches to the user's query. This paper explores these two key features, describing in detail the architecture and operation of SAPLE. Finally, an extensive analysis on logged search query data taken from an 11-week sample period is presented.

Procopio, Michael J.

2010-04-01T23:59:59.000Z

456

Reply to comment | OSTI, US Dept of Energy, Office of Scientific and  

Office of Scientific and Technical Information (OSTI)

Reply to comment Reply to comment Slide22 Submitted by gibsone on Fri, 2013-08-30 06:49 FY2010-ICSTI Slide22 Here's how it works ... 1. A Chinese scientist submits a query in Chinese to Multilingual WorldWideScience.org. 2. MWWS.org uses Microsoft to translate the Chinese query into individual languages of source databases (English, French, Portuguese, Russian, etc.) 3. MWWS.org sends the translated queries to corresponding databases, which search their contents and return results in native languages to MWWS.org. 4. MWWS.org uses Microsoft to translate native language results into Chinese and presents results to the user in relevance-ranked order. Conversely, an English-speaking user could have a query translated into languages of non-English databases and then get results back in English.

457

Slide22 | OSTI, US Dept of Energy, Office of Scientific and Technical  

Office of Scientific and Technical Information (OSTI)

Slide22 Slide22 Slide22 Here's how it works ... 1. A Chinese scientist submits a query in Chinese to Multilingual WorldWideScience.org. 2. MWWS.org uses Microsoft to translate the Chinese query into individual languages of source databases (English, French, Portuguese, Russian, etc.) 3. MWWS.org sends the translated queries to corresponding databases, which search their contents and return results in native languages to MWWS.org. 4. MWWS.org uses Microsoft to translate native language results into Chinese and presents results to the user in relevance-ranked order. Conversely, an English-speaking user could have a query translated into languages of non-English databases and then get results back in English. Add new comment Original Thumbnail Mobile_320x340 Icon_64x64

458

Reply to comment | OSTI, US Dept of Energy, Office of Scientific and  

Office of Scientific and Technical Information (OSTI)

Reply to comment Reply to comment Slide11 Submitted by gibsone on Fri, 2013-08-30 06:44 FY2010-ARPA Slide11 Here's how it works ... 1. A Chinese scientist submits a query in Chinese to Multilingual WorldWideScience.org. 2. MWWS.org uses Microsoft to translate the Chinese query into individual languages of source databases (English, French, Portuguese, Russian, etc.) 3. MWWS.org sends the translated queries to corresponding databases, which search their contents and return results in native languages to MWWS.org. 4. MWWS.org uses Microsoft to translate native language results into Chinese and presents results to the user in relevance-ranked order. Conversely, an English-speaking user could have a query translated into languages of non-English databases and then get results back in English.

459

Slide11 | OSTI, US Dept of Energy, Office of Scientific and Technical  

Office of Scientific and Technical Information (OSTI)

Slide11 Slide11 Slide11 Here's how it works ... 1. A Chinese scientist submits a query in Chinese to Multilingual WorldWideScience.org. 2. MWWS.org uses Microsoft to translate the Chinese query into individual languages of source databases (English, French, Portuguese, Russian, etc.) 3. MWWS.org sends the translated queries to corresponding databases, which search their contents and return results in native languages to MWWS.org. 4. MWWS.org uses Microsoft to translate native language results into Chinese and presents results to the user in relevance-ranked order. Conversely, an English-speaking user could have a query translated into languages of non-English databases and then get results back in English. Add new comment Original Thumbnail Mobile_320x340 Icon_64x64

460

Slide29 | OSTI, US Dept of Energy, Office of Scientific and Technical  

Office of Scientific and Technical Information (OSTI)

Slide29 Slide29 Slide29 Here's how it will work... 1. A Chinese scientist submits a query in Chinese to Multilingual WorldWideScience.org. 2. WWS.org uses Microsoft to translate the Chinese query into individual languages of source databases (English, French, Portuguese, Russian, etc.) 3. Multilingual WWS.org sends the translated queries to corresponding databases, which search their contents and return results in native languages. 4. WWS.org uses Microsoft to translate native language results into Chinese and presents results to the user in relevance-ranked order. Conversely, an English-speaking user could have a query translated into languages of non-English databases and then get results back in English. Add new comment Original Thumbnail Mobile_320x340 Icon_64x64

Note: This page contains sample records for the topic "queries sparql queries" 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

Reply to comment | OSTI, US Dept of Energy, Office of Scientific and  

Office of Scientific and Technical Information (OSTI)

Reply to comment Reply to comment Slide29 Submitted by gibsone on Fri, 2013-08-30 07:19 FY2010-cendi-warnick Slide29 Here's how it will work... 1. A Chinese scientist submits a query in Chinese to Multilingual WorldWideScience.org. 2. WWS.org uses Microsoft to translate the Chinese query into individual languages of source databases (English, French, Portuguese, Russian, etc.) 3. Multilingual WWS.org sends the translated queries to corresponding databases, which search their contents and return results in native languages. 4. WWS.org uses Microsoft to translate native language results into Chinese and presents results to the user in relevance-ranked order. Conversely, an English-speaking user could have a query translated into languages of non-English databases and then get results back in English.

462

Slide13 | OSTI, US Dept of Energy, Office of Scientific and Technical  

Office of Scientific and Technical Information (OSTI)

Slide13 Slide13 Slide13 Surface Web Deep Web databases Federated search drills down to the deep Web where scientific databases reside. Unlike the Google sitemap protocol solution, federated search places no burden on the database owners. We need systems, such as federated search, that probe the deep Web. Federated search is a different kind of web search architecture. When the user places a query on a federated search application, like Science.gov, the query is transmitted to the server that hosts the application. The server then translates the query so that is understandable by a host of remote databases, and then transmits the translated queries. The remote databases execute the search, and report back the results to the server that hosts the application. The host server then combines the hits from all the databases, and sorts

463

Reply to comment | OSTI, US Dept of Energy, Office of Scientific and  

Office of Scientific and Technical Information (OSTI)

Reply to comment Reply to comment Slide13 Submitted by gibsone on Thu, 2013-08-22 10:20 FY2008-dtic Slide13 Surface Web Deep Web databases Federated search drills down to the deep Web where scientific databases reside. Unlike the Google sitemap protocol solution, federated search places no burden on the database owners. We need systems, such as federated search, that probe the deep Web. Federated search is a different kind of web search architecture. When the user places a query on a federated search application, like Science.gov, the query is transmitted to the server that hosts the application. The server then translates the query so that is understandable by a host of remote databases, and then transmits the translated queries. The remote databases execute the search, and report back the results to the

464

Materialization Strategies in a Column-Oriented DBMS  

E-Print Network [OSTI]

There has been renewed interest in column-oriented database architectures in recent years. For read-mostly query workloads such as those found in data warehouse and decision support applications, ``column-stores'' have ...

Abadi, Daniel J.

2006-11-27T23:59:59.000Z

465

E-Print Network 3.0 - a2 domain facilitate Sample Search Results  

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

-Adobe-Photoshop (A2) (A3) D 100% 3 C 100% 3 Q 90% 4 10% 0.5 min() (P) min() enables Search-Adobe-URL Query... (). The enables NLE between ... Source: Massachusetts at...

466

Open-domain textual question answering techniques  

Science Journals Connector (OSTI)

Textual question answering is a technique of extracting a sentence or text snippet from a document or document collection that responds directly to a query. Open-domain textual question answering presupposes that questions are natural and unrestricted ...

Sanda M. Harabagiu; Steven J. Maiorano; Marius A. Pa?ca

2003-09-01T23:59:59.000Z

467

Bag of visual words model for videos segmentation into scenes  

Science Journals Connector (OSTI)

With the advancement in multimedia technologies, the video databases are exponentially increasing in size which are creating many challenges for efficient indexing and retrieval of the videos. Interactive and efficient search engines allow users to query ...

Junaid Baber; Shin'ichi Satoh; Nitin Afzulpurkar; Chadaporn Keatmanee

2013-08-01T23:59:59.000Z

468

Monitoring jobs with qs  

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

Jobs Monitoring jobs with qs Monitoring jobs with qs qs is an alternative tool to the SGE-provided qstat for querying the queue status developed at NERSC. qs provides an...

469

Eurographics Symposium on Rendering (2006) Tomas Akenine-Mller and Wolfgang Heidrich (Editors)  

E-Print Network [OSTI]

of the power plant model; b) bounding boxes of suc- cessful (green) and wasted (red) occlusion queries using walkthroughs, the user navi- gates through a complex virtual environment. Often the user can only see

Behnke, Sven

470

Slide25 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

With just one click, your query will be sent from our server in Oak Ridge, TN, to databases around the world. Those databases will return results in real time that will then be...

471

Slide11 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

with full-text single-query searching across databases residing at different agencies. * Currently searches DOE, EPA, NIH, NSF, SBA, USDA * DTIC and NASA to be added early CY09...

472

slide11 | OSTI, US Dept of Energy, Office of Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

Big 3", provides single-query searching of 200 million pages of U.S. government science information from 18 U.S. Government science organizations including Energy, NASA, EPA, NIH...

473

RAPID/Roadmap/18-CO-a | Open Energy Information  

Open Energy Info (EERE)

42 U.S.C. 6901 - Solid Waste Disposal Act 7 C.C.R. 1101-14 - Underground Storage Tanks and Aboveground Storage tanks Resources SET VARIABLES FOR USE WITH RESOURCE QUERY Land...

474

Methods for bibliometric analysis of research : renewable energy case study  

E-Print Network [OSTI]

This paper presents methods and software implementation for analyzing a field of research through the use of bibliometrics, i.e., information about published journal articles. Online publication search engines are queried, ...

Ziegler, Blaine E

2009-01-01T23:59:59.000Z

475

A Polynomial Model of Surgical Gestures for Real-Time Retrieval of Surgery Videos  

Science Journals Connector (OSTI)

This paper introduces a novel retrieval framework for surgery videos. Given a query video, the goal is to retrieve videos in which similar surgical gestures appear. In this framework, the motion content of sho...

Gwnol Quellec; Mathieu Lamard

2013-01-01T23:59:59.000Z

476

Progress in the Application of Natural Language Processing to Information Retrieval Tasks  

Science Journals Connector (OSTI)

......difficult to handle but is a fundamental stumbling block to effective...used in queries or in texts. Fundamental issues and questions dealing...1983). 36. U. Zernik, On 'Diesel Train 1 Engines' and 'To Train2 Airline Pilots......

Alan F. Smeaton

1992-06-01T23:59:59.000Z

477

Resource Determination and Allocation in Sensor Networks: A Hybrid Approach  

Science Journals Connector (OSTI)

......networks, providing the infrastructure to support their coordination...as stationary, mobile and hybrid. In stationary sensor networks...semantic description and query for grid workflow. SKG '07: Proc...Semantics, Knowledge and Grid, Washington, DC, USA, pp......

Murat Sensoy; Thao Le; Wamberto W. Vasconcelos; Timothy J. Norman; Alun D. Preece

2011-03-01T23:59:59.000Z

478

E-Print Network 3.0 - architectures security standards Sample...  

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

descriptions and queries. A refined matching algorithm... deploying a secure Service Oriented Architecture (SOA) system. NRL Release Number 05-1226-0470 12;1484 A... this work to...

479

E-Print Network 3.0 - andrew landstrm dag Sample Search Results  

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

answering least common ancestor queries on directed acyclic graphs (DAGs... ). An LCA w of nodes u and v in a DAG is an ancestor of both u and v where w has no...

480

Improving Performance on Data-Intensive Applications Using a Load Balancing Methodology Based on Divisible Load Theory  

Science Journals Connector (OSTI)

Data-intensive applications are those that explore, query ... , and, in general, process very large data sets. Generally, these applications can be ... implementations show severe performance problems mainly due ...

Claudia Rosas; Anna Sikora; Josep Jorba

2014-02-01T23:59:59.000Z

Note: This page contains sample records for the topic "queries sparql queries" 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

Load Shedding in Data Stream Systems  

Science Journals Connector (OSTI)

Systems for processing continuous monitoring queries over data streams must be adaptive because data streams are often bursty and data characteristics may vary over time. In this ... the ability to gracefully deg...

Brian Babcock; Mayur Datar; Rajeev Motwani

2007-01-01T23:59:59.000Z

482

Optimizing Database Load and Extract for Big Data Era  

Science Journals Connector (OSTI)

With growing and pervasive interest in Big Data, SQL relational databases need to compete with data management by Hadoop, NoSQL and NoDB. ... by query processing. But SQL databases require data in-place before qu...

K. T. Sridhar; M. A. Sakkeer

2014-01-01T23:59:59.000Z

483

Index Selection for OLAP \\Lambda Himanshu Gupta Venky Harinarayan y Anand Rajaraman  

E-Print Network [OSTI]

address of V. Harinarayan and A. Rajaraman: Jun­ glee Corp., Palo Alto, CA. 1 Introduction Decision to minimize the time needed to execute a given population of queries. An algorithm that was both polynomial­t

Ullman, Jeffrey D.

484

C.R.S. 37-90.5-103 Geothermal Resources Definitions | Open Energy...  

Open Energy Info (EERE)

form View source History View New Pages Recent Changes All Special Pages Semantic SearchQuerying Get Involved Help Apps Datasets Community Login | Sign Up Search Page Edit with...

485

: Helmholtz machine estimation .  

E-Print Network [OSTI]

: Helmholtz machine density estimation . . : . . . (supervised learning) , (active learning) (query learning) [1, 3]. . (unsupervised learning), . , [5]. . Helmholtz machine , . Helmholtz machine : Helmholtz machine [2] . Helmholtz machine (generative network) (recognition network) . , , . Helmholtz machine (self

486

Math 241 Honors Calculus IV Winter 2013 Instructor: Dr. Dylan Retsek  

E-Print Network [OSTI]

midterms and a final exam at the end of the quarter. 4. Query. Two students will be drawn randomly intellectual achievements in the history of humankind. True understanding will come only to those who

Retsek, Dylan Q.

487

Math 143 Calculus III Fall 2013 Instructor: Dr. Dylan Retsek  

E-Print Network [OSTI]

. Examination. There will be a midterm and a final exam at the end of the quarter. 4. Query. Two students of the greatest intellec- tual achievements in the history of humankind. True understanding will come only

Retsek, Dylan Q.

488

Multimodal Dialogue in Mobile Local Search Patrick Ehlen  

E-Print Network [OSTI]

queries or commands to the application. For example, a user might say, "gas stations," while say "gas stations" while tracing a route on which to search for gas stations, or, "Are there any nail

Fisher, Kathleen

489

Design of a Personalized Lighting Control System Enabled by a Space Model  

E-Print Network [OSTI]

-functional system requirements which inform system design. The structure of a proposed space model and space model queries are described and illustrated with examples. Implementation environments for system modules and data communication between modules...

Suter, G.; Petrushevski, F.; Sipetic, M.

2011-01-01T23:59:59.000Z

490

SensorWeb 3.0 Software Release Notes March 27, 2009, Melbourne, Australia  

E-Print Network [OSTI]

, query and control of sensors. 1. Observation and Measurement (O&M) ­ Information model and XML encodings to the O&M information model, from a single sensor or a collection of sensors. It is also used to describe

Melbourne, University of

491

SensorWeb 3.1 Software Release Notes May 11, 2009, Melbourne, Australia  

E-Print Network [OSTI]

, query and control of sensors. 1. Observation and Measurement (O&M) ­ Information model and XML encodings to the O&M information model, from a single sensor or a collection of sensors. It is also used to describe

Buyya, Rajkumar

492

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

493

Implementation of genomics and bioinformatics approaches for identification and characterization of tomato ripening-related genes  

E-Print Network [OSTI]

.?????????. 138 28 Sample TED expression ratio search form and result???? 139 29 Data mining tools in TED.??????????????. 140 30 TED TC mining query form and its results. ???????. 142 xi LIST OF TABLES TABLE...

Fei, Zhangjun

2004-09-30T23:59:59.000Z

494

A Digital Library Approach to the Reconstruction of Ancient Sunken Ships  

E-Print Network [OSTI]

on query expansion and improving relevance. This is accomplished with the implementation of an algorithm that derives relationships from terms in a specialized glossary, combining them with properties and concepts expressed in an ontology. The main...

Monroy Cobar, Carlos A.

2011-10-21T23:59:59.000Z

495

PDSF at NERSC - Site Report ? HEPiX Spring 2012 Workshop  

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

Ethernet switch and to which switch port every new node is connected 2. When a new node boots, it is allocated a temporary IP address and requests "discovery". 3. xCAT queries...

496

A class of warm Jupiters with mutually inclined, apsidally misaligned close friends  

Science Journals Connector (OSTI)

...Queried from the Exoplanet Orbit Database (EOD) at exoplanets.org...use the corrected elements reported by the EOD. 55 Pilyavsky G. Mahadevan S. Kane...20034250 58 Original solution listed in EOD. 59 Correia A. C. M. Udry S. Mayor...

Rebekah I. Dawson; Eugene Chiang

2014-10-10T23:59:59.000Z

497

BUILDING REMOTE SENSING APPLICATIONS USING SCIENTIFIC DATABASE AND SEMANTIC WEB TECHNOLOGIES  

E-Print Network [OSTI]

it bases its innovation to the state of the art on its orig- inal contributions to data models, query. Giammatteo, M. Sagona, S. Perelli (Advanced Computer Systems), T. Reitz, E. Klien, R. Gregor (Fraunhofer Inst

Koubarakis, Manolis

498

Sifting Through a Trillion Electrons  

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

Science, Hopper Linda Vu, lvu@lbl.gov, +1 510 495 2402 VPIC1.jpg After querying a dataset of approximately 114,875,956,837 particles for those with Energy values less than...

499

NREL: Energy Analysis - Jon Weers  

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

303-275-3701 E-mail: jon.weers@nrel.gov Areas of expertise Interactive web applications (PHP, jQuery, javascript, Python, Mongo, MySQL) Custom visualizations Project management...

500

PHP Programmer Looking for a PHP programmer with MVC framework experience. Position is a part time effort for a  

E-Print Network [OSTI]

PHP Programmer Looking for a PHP programmer with MVC framework experience. Position is a part time available. Other technologies involved in the project: - jQuery - PHP (Yii) - Apache - MySQL - AWS (EC2

Pohl, Karsten