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

IMPLEMENTATION OF INTENTION-DRIVEN SEARCH PROCESSES BY SPARQL QUERIES  

E-Print Network [OSTI]

IMPLEMENTATION OF INTENTION-DRIVEN SEARCH PROCESSES BY SPARQL QUERIES Olivier Corby INRIA Sophia Antipolis, BP 93, FR-06902 Sophia Antipolis, Cedex France olivier.corby@sophia.inria.fr Catherine Faron-Zucker I3S, Universit´e de Nice Sophia, CNRS, BP 121, FR-06903 Sophia Antipolis, Cedex France catherine

Mirbel, Isabelle

2

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

3

Advanced Query for Query Developers  

E-Print Network [OSTI]

at the front of the row and using the Action drop down menu. HOT Tip! Only Private queries can be saved or private. HOT Tip! Save your queries into a Favorites folder by selecting them in the check box to another user. You should save a Public query as a Private one and then can save/share it with another user

Shull, Kenneth R.

4

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

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 Racing: Fast Completeness Certification of Query Results  

E-Print Network [OSTI]

in an untrusted DBMS. Our main contribution is the concept of "Query Race": we split up a general query require neither previous knowledge of queries nor specific support by the DBMS. We validate our approach been performed is a much harder task, if we intend to maintain DBMS-level efficiency. Many proposal can

Paris-Sud XI, Université de

7

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

8

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

9

SPARQL Query Form | OpenEI  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data CenterFranconia, Virginia:FAQ < RAPID Jump to: navigation, searchVirginiaRooseveltVI Solar Power Plant Jump to:SESAmerica,SP

10

On Cartesian trees and range minimum queries  

E-Print Network [OSTI]

We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the range minimum query problem, a Cartesian tree ...

Demaine, Erik D.

11

Universit at Konstanz Query Deforestation  

E-Print Network [OSTI]

Universit¨ at Konstanz Query Deforestation Torsten Grust Marc H. Scholl Konstanzer Schriften: http://www.informatik.uni--konstanz.de/Schriften #12; Query Deforestation Torsten Grust Marc H. Scholl pursues the goal of employing foldr­build deforestation for the derivation of eOEcient streaming programs

Scholl, Marc H.

12

IT Licentiate theses Query Authentication and  

E-Print Network [OSTI]

IT Licentiate theses 2008-002 Query Authentication and Data Confidentiality in Wireless Sensor of Licentiate of Philosophy in Computer Science at Uppsala University 2008 #12;Query Authentication and Data

Flener, Pierre

13

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

14

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

15

Qunits: queried units in database search  

E-Print Network [OSTI]

Keyword search against structured databases has become a popular topic of investigation, since many users find structured queries too hard to express, and enjoy the freedom of a ``Google-like'' query box into which search terms can be entered. Attempts to address this problem face a fundamental dilemma. Database querying is based on the logic of predicate evaluation, with a precisely defined answer set for a given query. On the other hand, in an information retrieval approach, ranked query results have long been accepted as far superior to results based on boolean query evaluation. As a consequence, when keyword queries are attempted against databases, relatively ad-hoc ranking mechanisms are invented (if ranking is used at all), and there is little leverage from the large body of IR literature regarding how to rank query results. Our proposal is to create a clear separation between ranking and database querying. This divides the problem into two parts, and allows us to address these separately. The first tas...

Nandi, Arnab

2009-01-01T23:59:59.000Z

16

Constrained Querying of Multimedia Databases  

E-Print Network [OSTI]

definitions using SQL and XML (MPEG-7 schema definitions). REFERENCES 1. MPEG-7 applications document v.8.1. ISO/IEC JTC1/SC29/WG11/M4839, MPEG99, July 1999. 2. MPEG-7 requirements document v.10. ISO/IEC JTC1/SC29/WG11/M4839N2996, MPEG99, Oct. 1999. 3. M...Constrained Querying of Multimedia Databases: Issues and Approaches Apostol (Paul) Natseva#3;y John R. Smithb Yuan-Chi Changb Chung-Sheng Lib Jeffrey S. Vittera aDepartment of Computer Science, Duke University, P.O. Box 90129, Durham, NC 27708...

Vitter, Jeffrey Scott; Natsev, Apostol; Smith, John R.; Chang, Yuan-Chi; Li, Chung-Sheng

2001-01-01T23:59:59.000Z

17

Query  

Office of Environmental Management (EM)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf11-161-LNG |September 15,2015 | DepartmentLoans |Queryl Detailees Name From To Proposed

18

BayesDB : querying the probable implications of tabular data  

E-Print Network [OSTI]

BayesDB, a Bayesian database table, lets users query the probable implications of their tabular data as easily as an SQL database lets them query the data itself. Using the built-in Bayesian Query Language (BQL), users ...

Baxter, Jay

2014-01-01T23:59:59.000Z

19

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

20

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

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

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

22

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

23

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

24

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

25

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

26

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

27

Query Plans for Conventional and Temporal Queries Involving Duplicates and Ordering  

E-Print Network [OSTI]

substantially from built- in temporal support in the DBMS. To achieve this, temporal query representation for providing temporal support both via a stand-alone temporal DBMS and via a layer on top of a conventional DBMS. By capturing duplicate removal and retention and order preservation for all queries, as well

Snodgrass, Richard T.

28

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

29

REGULAR PATHS IN SPARQL: QUERYING THE NCI THESAURUS  

E-Print Network [OSTI]

SELECT ?r1 ?r4 FROM htp://example.com/ex> WHERE { ?r1 part ?r2 . ?r2 part ?r3 . ?r3 contains ?r4 - AMIA SELECT ?r1 ?r4 FROM htp://example.com/ex> WHERE { ?r1 part ?r2 . ?r2 part ?r3 . ?r3 contains ?r4 r1 r4 B E 11/11/2008Todd Detwiler - AMIA Er Dr Cr Br 4? 3? 2? 1? SELECT ?r1 ?r4 FROM htp

Washington at Seattle, University of

30

Querying Provenance Information in Distributed Environments Jing Zhao*, Yogesh Simmhan  

E-Print Network [OSTI]

provenance repository shared by that collaboration, while a smart power grid workflow that makes city formalize: provenance retrieval query and provenance filter query. Our problem is motivated by Smart

Prasanna, Viktor K.

31

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

32

SeqWare Query Engine: storing and searching sequence data in the cloud  

E-Print Network [OSTI]

Open Access SeqWare Query Engine: storing and searchingwe present the SeqWare Query Engine which has been createdand tools. Using the query engine, users can load and query

OConnor, Brian D; Merriman, Barry; Nelson, Stanley F

2010-01-01T23:59:59.000Z

33

Query Deforestation Torsten Grust Marc H. Scholl  

E-Print Network [OSTI]

Query Deforestation Torsten Grust Marc H. Scholl 68/1998 Faculty of Mathematics and Computer foldr­build deforestation for the derivation of eOEcient streaming programs ?? programs that do the deforestation idea amenable to a wide range of type constructors and operators. In addition to the removal

Grust, Torsten

34

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

35

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

36

Roadmap Query for Sensor Network Assisted Navigation in Dynamic Environments  

E-Print Network [OSTI]

Roadmap Query for Sensor Network Assisted Navigation in Dynamic Environments Sangeeta Bhattacharya approach that integrates a roadmap based navigation algorithm with a novel WSN query protocol called Roadmap Query (RQ). RQ enables collection of frequent, up-to- date information about the surrounding

Lu, Chenyang

37

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

38

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

39

A Study of Query Length Avi Arampatzis1  

E-Print Network [OSTI]

length, and fit power-law and Poisson distribu- tions to four different query sets. We provide and a power-law distribution for longer queries, that better fits real query length distributions than earlier proposals. Categories and Subject Descriptors: H.3 [Information Storage and Re- trieval]: H.3.3 Information

Arampatzis, Avi

40

Variable Interactions in Query-Driven Visualization  

SciTech Connect (OSTI)

One fundamental element of scientific inquiry is discoveringrelationships, particularly the interactions between different variablesin observed or simulated phenomena. Building upon our prior work in thefield of Query-Driven Visualization, where visual data analysisprocessing is focused on subsets of large data deemed to be"scientifically interesting," this new work focuses on a novel knowledgediscovery capability suitable for use with petascale class datasets. Itenables visual presentation of the presence or absence of relationships(correlations) between variables in data subsets produced by Query-Drivenmethodologies. This technique holds great potential for enablingknowledge discovery from large and complex datasets currently emergingfrom SciDAC and INCITE projects. It is sufficiently generally to beapplicable to any time of complex, time-varying, multivariate data fromstructured, unstructured or adaptive grids.

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

2007-10-25T23: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.


41

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

42

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

43

Data Models and Query Languages for Linked Geospatial Data  

E-Print Network [OSTI]

Data Models and Query Languages for Linked Geospatial Data Manolis Koubarakis, Manos Karpathiotakis,mk,kkyzir,charnik,sioutis}@di.uoa.gr Abstract. The recent availability of geospatial information as linked open data has generated new interest in geospatial query processing and reasoning, a topic with a long tradition of research in the areas

Koubarakis, Manolis

44

Comp 5311 Database Management Systems 4. Structured Query Language  

E-Print Network [OSTI]

;5 Query 1: Find the total number of copies in stock for each poet SELECT poet, SUM (copies_in_stock) as sum FROM writer GROUP BY poet poet sum Douglas Livingstone 23 Mongane Wally 13 poet book copies Wally Must Weep 8 Mongane Wally A Tough Tale 2 #12;6 Query 2: For each poet, find the max, min, avg

Papadias, Dimitris

45

On Efficient Matching of Streaming XML Documents and Queries  

E-Print Network [OSTI]

On Efficient Matching of Streaming XML Documents and Queries Laks V.S. Lakshmanan 1 and P. Sailajacommerce, and supplychain management require the ability to manage large sets of specifications of prod ucts and.g., a document that is streaming by) is quite small compared to the number of registered queries (which can

Lakshmanan, Laks V.S.

46

A Foundation for Conventional and Temporal Query Optimization  

E-Print Network [OSTI]

substantially from built-in temporal support in the DBMS. To achieve this, temporal query representation DBMS architectures and ones where the temporal support is obtained via a layer on top of a conventional DBMS. This foundation captures duplicates and ordering for all queries, as well as coalescing

Snodgrass, Richard T.

47

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

48

PET: Reducing Database Energy Cost via Query Optimization  

E-Print Network [OSTI]

PET: Reducing Database Energy Cost via Query Optimization Zichen Xu The Ohio State University xuz not necessarily have the shortest processing time. This demo proposal introduces PET ­ an energy-aware query op- timization framework that is built as a part of the PostgreSQL ker- nel. PET, via its power cost estimation

Tu, Yicheng

49

Efficient Enumeration for Conjunctive Queries over X-underbar Structures  

E-Print Network [OSTI]

between the generation of two consecutive solutions for frontier is established-tuples of nodes of this tree. Query computing can be seen as a generation process. In this case, one tries to out, an enumeration algorithm is the process of generating one after the other the tuples of a given query Q

Durand, Arnaud - ?quipe de Logique Mathématique, Université Paris 7

50

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.

51

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

52

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

53

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

54

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

55

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

56

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

57

Efficient Complex Query Support for Multiversion XML Documents  

E-Print Network [OSTI]

management system supporting multiple versions of the same document, while avoiding duplicate storage taken by database systems and document management systems have often been different, because complex queries, while document management systems are not, and Databases assume that the order

Zhang, Donghui

58

Secure quantum private information retrieval using phase-encoded queries  

E-Print Network [OSTI]

We propose a quantum solution to the classical private information retrieval (PIR) problem, which allows one to query a database in a private manner. The protocol offers privacy thresholds and allows the user to obtain information from a database in a way that offers the potential adversary, in this model the database owner, no possibility of deterministically establishing the query contents. This protocol may also be viewed as a solution to the symmetrically private information retrieval problem in that it can offer database security (inability for a querying user to steal its contents). Compared to classical solutions, the protocol offers substantial improvement in terms of communication complexity. In comparison with the recent quantum private queries {[}Phys. Rev. Lett. 100, 230502 (2008)] protocol, it is more efficient in terms of communication complexity and the number of rounds, while offering a clear privacy parameter. We discuss the security of the protocol and analyze its strengths and conclude that...

Olejnik, L

2011-01-01T23:59:59.000Z

59

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

60

Compact Data Structures with Fast Queries Daniel K. Blandford  

E-Print Network [OSTI]

.5 Decoding Multiple Gamma Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.6 Rank of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee: Guy E. Blelloch, chair fast queries (and updates) to the data. This thesis describes compact representations of several types

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

Query-Driven Visualization and Analysis  

SciTech Connect (OSTI)

This report focuses on an approach to high performance visualization and analysis, termed query-driven visualization and analysis (QDV). QDV aims to reduce the amount of data that needs to be processed by the visualization, analysis, and rendering pipelines. The goal of the data reduction process is to separate out data that is "scientifically interesting'' and to focus visualization, analysis, and rendering on that interesting subset. The premise is that for any given visualization or analysis task, the data subset of interest is much smaller than the larger, complete data set. This strategy---extracting smaller data subsets of interest and focusing of the visualization processing on these subsets---is complementary to the approach of increasing the capacity of the visualization, analysis, and rendering pipelines through parallelism. This report discusses the fundamental concepts in QDV, their relationship to different stages in the visualization and analysis pipelines, and presents QDV's application to problems in diverse areas, ranging from forensic cybersecurity to high energy physics.

Ruebel, Oliver; Bethel, E. Wes; Prabhat, Mr.; Wu, Kesheng

2012-11-01T23:59:59.000Z

62

Consumer Query Health Profile Saint Alphonsus Regional Medical Center  

E-Print Network [OSTI]

Consumer Query Health Profile Saint Alphonsus Regional Medical Center Query resulted in 570 BSU Classified and Non-Classified employees that participated in the Fall 2004 Health Risk Appraisal. Non.2% 9.6% 7.7% 9.0% Heart Disease 2.3% 2.3% 2.6% 3.1% No Primary Care Physician 33.0% 31.8% 30.0% 24

Barrash, Warren

63

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

64

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.

65

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

66

E ective Query Size Estimation Using Neural Networks Hongjun Lu Rudy Setiono 1  

E-Print Network [OSTI]

;ectively compare di#11;erent query execution plans to select the optimal one. Along with the evolution of DBMS technology, accurate size estimation of query results assumes greater and greater importance

Setiono, Rudy

67

0 500 1000 1500 2000 2500 3000 UniqueQueries(%)  

E-Print Network [OSTI]

90 100 110 Percentcomplete(%) Elapsed time (sec) Kudzu BitTorrent Kudzu: A Self Balancing P2P File strategies · Kudzu takes Gnutella's decentralized model and imposes a self-governing structure on top of it Architecture Query Propagation · A Kudzu network is comprised of a set of functionally homogeneous peers · New

Albrecht, Jeannie

68

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.

69

Accelerating Network Traffic Analytics Using Query-DrivenVisualization  

SciTech Connect (OSTI)

Realizing operational analytics solutions where large and complex data must be analyzed in a time-critical fashion entails integrating many different types of technology. This paper focuses on an interdisciplinary combination of scientific data management and visualization/analysis technologies targeted at reducing the time required for data filtering, querying, hypothesis testing and knowledge discovery in the domain of network connection data analysis. We show that use of compressed bitmap indexing can quickly answer queries in an interactive visual data analysis application, and compare its performance with two alternatives for serial and parallel filtering/querying on 2.5 billion records worth of network connection data collected over a period of 42 weeks. Our approach to visual network connection data exploration centers on two primary factors: interactive ad-hoc and multiresolution query formulation and execution over n dimensions and visual display of then-dimensional histogram results. This combination is applied in a case study to detect a distributed network scan and to then identify the set of remote hosts participating in the attack. Our approach is sufficiently general to be applied to a diverse set of data understanding problems as well as used in conjunction with a diverse set of analysis and visualization tools.

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

2006-07-29T23:59:59.000Z

70

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

71

Facilitating Document Annotation using Content and Querying Value  

E-Print Network [OSTI]

content management software (e.g., Microsoft SharePoint), allow users to share documents and annotate1 Facilitating Document Annotation using Content and Querying Value Eduardo J. Ruiz #1 , Vagelis the generation of the structured metadata by identifying documents that are likely to contain informa- tion

Hristidis, Vagelis

72

DBDOC: Querying and Browsing Databases and Interrelated Documents  

E-Print Network [OSTI]

]: Database Administra- tion--Data warehouse and repository General Terms Management, Documentation, Design 1 to describe this structured data. Managing semi- structured sources, such as documents, text files, web pagesDBDOC: Querying and Browsing Databases and Interrelated Documents Carlos Garcia-Alvarado University

Ordonez, Carlos

73

From Structured Documents to Novel Query Facilities \\Lambda  

E-Print Network [OSTI]

) can bring a lot of benefit to documents management, e.g., recovery, concurrency control and high levelFrom Structured Documents to Novel Query Facilities \\Lambda V. Christophides, S. Abiteboul, S.Schollg@inria.fr February 29, 1996 Abstract Structured documents (e.g., SGML) can benefit a lot from database support

Abiteboul, Serge

74

STQL --A SPATIO-TEMPORAL QUERY LANGUAGE Martin Erwig  

E-Print Network [OSTI]

evolutions of spatial objects over time. We consider spatio- temporal operations that are particularly useful is to provide a DBMS data model and query language capable of handling such time-dependent geome- tries. Thereby. Our modeling also includes the sim- pler, discrete case where temporal evolutions are stepwise

Erwig, Martin

75

Adaptable Query Optimization and Evaluation in Temporal Middleware  

E-Print Network [OSTI]

that such data- base applications may benefit substantially from built-in temporal support in the DBMS the DBMS proper or as a source level translation from temporal queries to conventional SQL. This paper proposes a new approach: using a middleware component on top of a conventional DBMS. This component accepts

Snodgrass, Richard T.

76

Public Key Encryption that Allows PIR Queries Eyal Kushilevitz  

E-Print Network [OSTI]

Public Key Encryption that Allows PIR Queries Dan Boneh Eyal Kushilevitz Rafail Ostrovsky William E to create a public- key encryption scheme for Alice that allows PIR searching over encrypted documents. Our allows for Single-Database PIR writing with sublinear communication complexity, which we consider

77

Secure quantum private information retrieval using phase-encoded queries  

SciTech Connect (OSTI)

We propose a quantum solution to the classical private information retrieval (PIR) problem, which allows one to query a database in a private manner. The protocol offers privacy thresholds and allows the user to obtain information from a database in a way that offers the potential adversary, in this model the database owner, no possibility of deterministically establishing the query contents. This protocol may also be viewed as a solution to the symmetrically private information retrieval problem in that it can offer database security (inability for a querying user to steal its contents). Compared to classical solutions, the protocol offers substantial improvement in terms of communication complexity. In comparison with the recent quantum private queries [Phys. Rev. Lett. 100, 230502 (2008)] protocol, it is more efficient in terms of communication complexity and the number of rounds, while offering a clear privacy parameter. We discuss the security of the protocol and analyze its strengths and conclude that using this technique makes it challenging to obtain the unconditional (in the information-theoretic sense) privacy degree; nevertheless, in addition to being simple, the protocol still offers a privacy level. The oracle used in the protocol is inspired both by the classical computational PIR solutions as well as the Deutsch-Jozsa oracle.

Olejnik, Lukasz [CERN, 1211 Geneva 23, Switzerland and Poznan Supercomputing and Networking Center, Noskowskiego 12/14, PL-61-704 Poznan (Poland)

2011-08-15T23:59:59.000Z

78

Privacy-preserving Queries over Relational Databases Femi Olumofin  

E-Print Network [OSTI]

@cs.uwaterloo.ca Abstract--We explore how Private Information Retrieval (PIR) can help users keep their sensitive with PIR by hiding sensitive constants contained in the predicates of a query. Experimental results to provide such information. The problem addressed by private information retrieval (PIR) [4], [13

Goldberg, Ian

79

Public Key Encryption that Allows PIR Queries Eyal Kushilevitz  

E-Print Network [OSTI]

Public Key Encryption that Allows PIR Queries Dan Boneh Eyal Kushilevitz Rafail Ostrovsky William E. In this paper, we show how to create a public-key encryption scheme for Alice that allows PIR searching over allows for Single-Database PIR writing with sublinear communication complexity, which we consider

Ostrovsky, Rafail

80

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

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

Active Query Forwarding in Sensor Networks Narayanan Sadagopan  

E-Print Network [OSTI]

in this paper to calculate the energy costs associated with ACQUIRE. The models permit us to characterize schemes such as flooding-based querying (FBQ) and expanding ring search (ERS), in terms of energy usage data, this simple approach can be highly inefficient. In the context of energy-starved sensor networks

Krishnamachari, Bhaskar

82

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

83

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

84

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

85

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

86

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

87

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

88

Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries  

E-Print Network [OSTI]

. Example: Suppose a user is searching a car database for "sedans". Since most sedans have unique model names, the user must convert the general query sedan to queries binding the attribute Model. To find all sedans in the database, the user must iteratively change her search criteria and submit queries

Kambhampati, Subbarao

89

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1 An In-Network Querying Framework for Wireless  

E-Print Network [OSTI]

-network querying in a distributed, lightweight, resilient and energy-efficient manner. We address these challenges by exploiting location information and geometry of the network and propose an in-network querying framework our framework to achieve complex range-based querying. To this end, we use a multi

Demirbas, Murat

90

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1 An In-Network Querying Framework for Wireless  

E-Print Network [OSTI]

-network querying in a distributed, lightweight, resilient and energy-efficient manner. We address these challenges by exploiting location information and geometry of the network and propose an in-network querying framework of inquiries, we further extend our framework to achieve complex range-based querying. To this end, we use

Demirbas, Murat

91

A Protein Patent Query System Powered By Kleisli Jing Chen Limsoon Wong Louxin Zhang  

E-Print Network [OSTI]

A Protein Patent Query System Powered By Kleisli Jing Chen Limsoon Wong Louxin Zhang Bio effectively query protein patents. This system uses Kleisli to tie to­ gether the following sources to answer queries on protein patents that are considerably more demanding than simple free­text search: (1

Wong, Limsoon

92

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

93

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

94

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

95

Tractable hypergraph properties for constraint satisfaction and conjunctive queries  

E-Print Network [OSTI]

An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP instances (i.e., where each constraint involves only two variables), the situation is well understood: the complexity of the problem essentially depends on the treewidth of the graph of the constraints. However, this is not the correct answer if constraints with unbounded number of variables are allowed, and in particular, for CSP instances arising from query evaluation problems in database theory. Formally, if H is a class of hypergraphs, then let CSP(H) be CSP restricted to instances whose hypergraph is in H. Our goal is to characterize those classes of hypergraphs for which CSP(H) is polynomial-time solvable or fixed-parameter tractable, parameterized by the number of variables. Note that in the applications related to database query evaluation, we usually assume that the numbe...

Marx, Dniel

2009-01-01T23:59:59.000Z

96

Learning ReadOnce Formulas with Queries Dana Angluin \\Lambda Lisa Hellerstein y Marek Karpinski z  

E-Print Network [OSTI]

­once formulas [26]. We also show that no polynomial time algorithm using only membership queries or only kinds of queries. The main results are a polynomial time algorithm for exact identification of monotone on the notion of a minimally adequate teacher [1]). Our results improve on Valiant's previous results for read

Hellerstein, Lisa

97

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.

98

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

99

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

100

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

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

DDT: A Distributed Data Structure for the Support of P2P Range Query  

E-Print Network [OSTI]

DDT: A Distributed Data Structure for the Support of P2P Range Query Davide Carff, Massimo Coppola expressivity by maintenance a distributed index of resources. We propose the Distributed Digest Trie (DDT) a distributed data structure which is based on a trie structure. The DDT im- proves the DHT query expressivity

Ricci, Laura

102

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

103

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

104

Integrating and Querying Source Code of Programs Working on a Database  

E-Print Network [OSTI]

management system (DBMS). As a result, we present QDPC, a novel system that allows the inte- gration and flexible querying within a DBMS of source code and a database's schema. The integration focuses on obtain a DBMS. These sum- marization tables are then analyzed with SQL queries to find matches that are related

Ordonez, Carlos

105

Algebra-to-SQL Query Translation for Spatio-Temporal Databases  

E-Print Network [OSTI]

of transforming the queries expressed for the conceptual schema into an operational query for a target DBMS or GIS their applications, such specifications must be translated into the operational model of current DBMS or GIS who have little technical knowledge of the underlying DBMS or GIS software. #12;The MurMur project

Libre de Bruxelles, Université

106

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

107

Static Checking of Dynamically Generated Queries in Database Applications Carl Gould, Zhendong Su, and Premkumar Devanbu  

E-Print Network [OSTI]

, WHOLESALE, and TYPE, among others. The RETAIL and WHOLESALE columns are both of type in- teger, indicatingBound != null) { query += "WHOLESALE > " + lowerBound + " AND "; } query += "TYPE IN (" + get to be executed is: SELECT '$' || (RETAIL/100) FROM INVENTORY WHERE WHOLESALE > 595 AND TYPE IN (SELECT TY

Devanbu, Prem

108

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

E-Print Network [OSTI]

that is frequently accessed (hot data) is on fast storage compared to less-frequently accessed data (warm and cold like e- commerce and energy industry require both online and on- demand queries to be performed over to support scalable data storage and on-demand querying over large volumes of data. These systems usually

Prasanna, Viktor K.

109

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

110

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

111

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

112

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

113

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

114

Private Database Queries Using Quantum States with Limited Coherence Times  

E-Print Network [OSTI]

We describe a method for private database queries using exchange of quantum states with bits encoded in mutually incompatible bases. For technology with limited coherence time, the database vendor can announce the encoding after a suitable delay to allow the user to privately learn one of two items in the database without the ability to also definitely infer the second item. This quantum approach also allows the user to choose to learn other functions of the items, such as the exclusive-or of their bits, but not to gain more information than equivalent to learning one item, on average. This method is especially useful for items consisting of a few bits by avoiding the substantial overhead of conventional cryptographic approaches.

Tad Hogg; Li Zhang

2009-03-31T23:59:59.000Z

115

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

116

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

117

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

118

Querying Multiple Sets of Discovered Rules Rule mining is an important data mining task that has been  

E-Print Network [OSTI]

operating on multiple rulebases because many practically important data mining queries naturally requireQuerying Multiple Sets of Discovered Rules ABSTRACT Rule mining is an important data mining task querying of multiple data mining rulebases to retrieve interesting rules. In this paper, we propose a new

Liu, Bing

119

Fast and Effective Query Refinement Bienvenido V'elez 1 , Ron Weiss 1 , Mark A. Sheldon 2 , David K. Gifford 1  

E-Print Network [OSTI]

Fast and Effective Query Refinement Bienvenido V'elez 1 , Ron Weiss 1 , Mark A. Sheldon 2 , David K Corporation Abstract Query Refinement is an essential information retrieval tool that interactively recommends­ cal query refinement algorithm that refines multiple term queries by dynamically combining precomputed

Gifford, David K.

120

CORI Project: 2008-44 30 June 2010 Coastal Habitat Mapping Query Manual  

E-Print Network [OSTI]

GIS Query]. 5. Determining the mapped distribution and shoreline length of the canopy kelps Macrocystis (giant kelp), Nereocystis (bull kelp), and Alaria fistulosa (dragon kelp) (MAC, NER, and ALF biobands

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

General Strategy for Querying Web Sources in a Data Federation Environment  

E-Print Network [OSTI]

Modern database management systems are supporting the inclusion and querying of non-relational sources within a data federation environment via wrappers. Wrapper development for Web sources, however, is a convolution of ...

Firat, Aykut

122

Construction of Query Concepts in a Document space based on Data Mining Techniques  

E-Print Network [OSTI]

Chang,Y. Kim,M. Ounis,I. In Proceedings of the 6th International Conference On Flexible Query Answering Systems (FQAS 2004), Lecture Notes in Artificial Intelligence, June 24-26 2004, Lyon, France. Sun Microsystems Inc.

Chang, Y.; Kim, M.; Ounis, I.

123

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

124

Roadmap Query Protocols for Sensor Network Guided Navigation in Dynamic Environments  

E-Print Network [OSTI]

Autonomous mobile entity navigation through dynamic and unknown environments is an essential part of many mission critical applications like search and rescue and fire fighting. The dynamism of the environment makes it particularly difficult to achieve navigation using just on-board sensors and existing navigation methods. This motivates the integration of wireless sensor networks with navigation. The ease of deployment of a wireless sensor network along with its capability of collecting and delivering information about the surrounding environment makes it feasible to use wireless sensor networks to aid navigation in dynamic environments. In this paper, we present integrated navigation and network query strategies that achieve good navigation performance with low network communication cost. The reduced communication cost not only increases network lifetime but also improves navigation performance by increasing network responsiveness, which is required to maintain a high degree of awareness in dynamic environments. The proposed strategies include a roadmap based navigation strategy coupled with two different query strategies called Roadmap Query (RQ) and Robust Roadmap Query (RRQ). The query strategies are optimized for the roadmap based navigation strategy, and are shown, through simulation under realistic fire scenarios, to outperform existing approaches in terms of both navigation performance and communication cost. We also present a mobile agent based implementation of RQ and provide empirical results of its performance on a Mica2 mote testbed.

Sangeeta Bhattacharya; et al.

125

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

126

Query complexity for searching multiple marked states from an unsorted database  

E-Print Network [OSTI]

An important and usual problem is to search all states we want from a database with a large number of states. In such, recall is vital. Grover's original quantum search algorithm has been generalized to the case of multiple solutions, but no one has calculated the query complexity in this case. We will use a generalized algorithm with higher precision to solve such a search problem that we should find all marked states and show that the practical query complexity increases with the number of marked states. In the end we will introduce an algorithm for the problem on a ``duality computer'' and show its advantage over other algorithms.

Bin Shang

2006-04-10T23:59:59.000Z

127

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 30, NO. 2, FEBRUARY 2012 433 Secure Cooperative Data Storage and Query  

E-Print Network [OSTI]

mobile-sink visit. Despite rapid progress in storage technology, this approach remains economically Cooperative Data Storage and Query Processing in Unattended Tiered Sensor Networks Rui Zhang, Student Member. Such a cooperative data storage and query processing paradigm offers a number of advantages over traditional

Zhang, Rui

128

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

129

Performance of Adaptive Query Processing in the Mariposa Distributed Database Management System  

E-Print Network [OSTI]

present performance results which show that in multi-user situations, when response time is used assigns a price to perform a service and may adjust its prices as it sees fit. In designing Mariposa such as the effect of supply and demand on prices. We investigate the benefits of adaptive distributed query

California at Irvine, University of

130

Secure Multidimensional Range Queries in Sensor Rui Zhang, Jing Shi, and Yanchao Zhang  

E-Print Network [OSTI]

in storage technology, it remains econom- ically infeasible to furnish individual sensor nodes, which may the queries from the network owner on behalf of sensor nodes. Relying on master nodes for data storage storage [1­4] such that data continuously produced by sensor nodes are stored inside the network

Zhang, Rui

131

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

132

Query-driven Analysis of Plasma-based Particle Acceleration Data Oliver Rubel  

E-Print Network [OSTI]

Query-driven Analysis of Plasma-based Particle Acceleration Data Oliver R¨ubel LBNL Cameron G. R. Geddes LBNL Min Chen LBNL Estelle Cormier-Michel Tech-X Corp. E. W. Bethel LBNL x(x106 ) 2000 4000

133

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

134

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

135

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

136

Exploiting Reflection to Add Persistence and Query Optimization to a Statically Typed Object-Oriented Language  

E-Print Network [OSTI]

programming language (PPL) that also provides one or more collection types and supports the processing (optimization) of queries on collections. A PPL is a programming language in which created objects processing PL DBPL PPL Figure 1: Transition from programming language to database programming language. #12

Massachusetts at Amherst, University of

137

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

138

Site-To-Site (S2S) Searching with Query Routing Using Distributed Registrars  

E-Print Network [OSTI]

Site-To-Site (S2S) Searching with Query Routing Using Distributed Registrars Wan Yeung Wong Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin, Hong Kong wywong@cse.cuhk.edu.hk Irwin King Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin

King, Kuo Chin Irwin

139

Site-Based Dynamic Pruning for Query Processing in Search Engines  

E-Print Network [OSTI]

Site-Based Dynamic Pruning for Query Processing in Search Engines Ismail Sengor Altingovde, Engin Demir, Fazli Can, ?zgür Ulusoy Computer Engineering Department, Bilkent University, Ankara 06800, Turkey {ismaila, endemir, canf, oulusoy}@cs.bilkent.edu.tr ABSTRACT Web search engines typically index

Ulusoy, ?zgür

140

GeoDec: A Framework to Effectively Visualize and Query Geospatial Data for Decision-Making  

E-Print Network [OSTI]

GeoDec: A Framework to Effectively Visualize and Query Geospatial Data for Decision-Making Cyrus-to-end system that enables geospatial decision-making by virtualizing the real-world geolocations. With GeoDec, first the geolocation of interest is rapidly and realistically simulated and all relevant geospatial

Shahabi, Cyrus

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

Data Integration for Querying Geospatial Isabel F. Cruz and Huiyong Xiao  

E-Print Network [OSTI]

Data Integration for Querying Geospatial Sources Isabel F. Cruz and Huiyong Xiao Department of Computer Science University of Illinois at Chicago {ifc | hxiao}@cs.uic.edu Abstract. Geospatial data and is critical in emergency management. However, geospatial data are distributed, complex, and heterogeneous due

Cruz, Isabel F.

142

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

E-Print Network [OSTI]

1 VISUAL QUERY OF TIME-DEPENDENT 3D WEATHER IN A GLOBAL GEOSPATIAL ENVIRONMENT William Ribarsky and Spatial Analysis Technologies, Georgia Institute of Technology This Technical Report is a draft WEATHER IN A GLOBAL GEOSPATIAL ENVIRONMENT William Ribarsky, Nickolas Faust, Zachary Wartell, Christopher

Shaw, Chris

143

Breaking POET Authentication with a Single Query Jian Guo, Jeremy Jean, Thomas Peyrin, and Lei Wang  

E-Print Network [OSTI]

Breaking POET Authentication with a Single Query Jian Guo, J´er´emy Jean, Thomas Peyrin, and Lei article, we describe a very practical and simple attack on the au- thentication part of POET authenticated encryption mode proposed at FSE 2014. POET is a provably secure scheme that was designed to resist various

144

Optimizing Data Replication for Expanding Ring-based Queries in Wireless Sensor  

E-Print Network [OSTI]

Optimizing Data Replication for Expanding Ring-based Queries in Wireless Sensor Networks Bhaskar are disseminated using expand- ing rings. We obtain closed-form approximations for the expected energy costs such as changes, movements and failures of nodes in the net- work). Randomized storage can also provide for a more

Krishnamachari, Bhaskar

145

Scalable Architecture and Query Optimization for Transaction-time DBs with Evolving Schemas  

E-Print Network [OSTI]

problems in preserva- tion, retrieval and querying of databases with intense evolution his- tories, i is easily deployed by plugging into existing DBMS replication technologies, leading to very low overhead such as `flashback' [1] and the new temporal constructs pushed in the SQL standards by the main DBMS vendors [2

Zaniolo, Carlo

146

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

147

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

148

Public Key Encryption that Allows PIR Queries Dan Boneh # Eyal Kushilevitz + Rafail Ostrovsky #  

E-Print Network [OSTI]

Public Key Encryption that Allows PIR Queries Dan Boneh # Eyal Kushilevitz + Rafail Ostrovsky a public­key encryption scheme for Alice that allows PIR searching over encrypted documents. Our solution­trivially small communication complexity. The main technique of our solution also allows for Single­Database PIR

149

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

150

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.

151

A Market Mechanism for Participatory Global Query: A First Step of Enterprise Resources Self-Allocation  

E-Print Network [OSTI]

Institute Troy, New York 12180-3590 Information Technology and Management, 2004 Abstract The problem.g., drilling through supply chains. These collaborative queries deserve a new paradigm that equally account. Traditional single databases, federated databases, and even the new XML-based Internet databases subscribe

Hsu, Cheng

152

A lattice-based query system for assessing the quality of hydro-ecosystems  

E-Print Network [OSTI]

A lattice-based query system for assessing the quality of hydro-ecosystems Agn`es Braud1 Cristina used for building a hierarchy of site pro- files which are annotated by hydro in the project. This paper presents an application of Galois lattices to the hydro-ecological domain, focussing

Paris-Sud XI, Université de

153

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

154

A Digital Watermarking Approach to Secure and Precise Range Query Processing in Sensor Networks  

E-Print Network [OSTI]

of sending to the sink via multiple hops, which saves energy for sensors. Second, storage nodes store sensor or incomplete query results to the sink. In this paper, we aim to design a secure protocol that allows storage, Changsha, Hunan, 41008, China BloomReach Inc., Mountain View, CA 94041 Department of Computer Science

Liu, Alex X.

155

Predicting Query Difficulty on the Web by Learning Visual Clues Eric C. Jensen, Steven M. Beitzel,  

E-Print Network [OSTI]

Online, Inc. Dulles, VA 20166 cabdur@aol.com ABSTRACT We describe a method for predicting query to retrieve, such as metasearch. Categories and Subject Descriptors H.3.5 [Information Storage and Retrieval]: Online Information Services ­ Web-based services General Terms Algorithms, Performance, Experimentation

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

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

158

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

159

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

160

Voronoi-based Geospatial Query Processing with MapReduce Afsin Akdogan, Ugur Demiryurek, Farnoush Banaei-Kashani, and Cyrus Shahabi  

E-Print Network [OSTI]

Voronoi-based Geospatial Query Processing with MapReduce Afsin Akdogan, Ugur Demiryurek, Farnoush Angeles, CA 90089 [aakdogan, demiryur, banaeika, shahabi]@usc.edu Abstract Geospatial queries (GQ) have of parallel geospatial query processing with the MapReduce programming model. Our proposed approach creates

Shahabi, Cyrus

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

[22] S. T. Shenoy and Z. M. Ozsoyoglu. A system for semantic query optimization. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 181--195, San  

E-Print Network [OSTI]

, and A. Zachmann for their help in ``getting the prototype running.'' Especially K. Peithner (query

Mannheim, Universität

162

Efficient Query Verification on Outsourced Data: A Game-Theoretic Approach  

E-Print Network [OSTI]

To save time and money, businesses and individuals have begun outsourcing their data and computations to cloud computing services. These entities would, however, like to ensure that the queries they request from the cloud services are being computed correctly. In this paper, we use the principles of economics and competition to vastly reduce the complexity of query verification on outsourced data. We consider two cases: First, we consider the scenario where multiple non-colluding data outsourcing services exist, and then we consider the case where only a single outsourcing service exists. Using a game theoretic model, we show that given the proper incentive structure, we can effectively deter dishonest behavior on the part of the data outsourcing services with very few computational and monetary resources. We prove that the incentive for an outsourcing service to cheat can be reduced to zero. Finally, we show that a simple verification method can achieve this reduction through extensive experimental evaluatio...

Nix, Robert

2012-01-01T23:59:59.000Z

163

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

164

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

165

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

SciTech Connect (OSTI)

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

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

2010-05-11T23:59:59.000Z

166

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

DOE Patents [OSTI]

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

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

2006-08-08T23:59:59.000Z

167

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

168

Effective March 26, 2012, "Order History" in Marketplace will be replaced with "Order Query" a faster, easier way to lookup past order information.  

E-Print Network [OSTI]

Orders or Invoices. 2. What are you searching for? Enter key terms like Requisition/PO Numbers criteria entered. Filter query criteria after search is performed. In addition to the extensive Advanced, a Supplier name or a Catalog number Hint: Click "Query" for a complete list of available search terms. 3

California at San Diego, University of

169

Appears in Secure Data Management: Second VLDB Workshop--SDM 2005, Lecture Notes in Computer Science 3674 (2005) 3346. Springer-Verlag. Experiments With Queries Over Encrypted  

E-Print Network [OSTI]

Appears in Secure Data Management: Second VLDB Workshop--SDM 2005, Lecture Notes in Computer which data was queried. The idea behind PIR is to replicate the data among several non that no server will learn the whole query by itself. Chor et al [4] prove that PIR with a single server can only

Schoenmakers, Berry

170

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

171

Model-based Querying in Sensor Networks Amol Deshpande, University of Maryland, http://www.cs.umd.edu/~amol  

E-Print Network [OSTI]

://db.lcs.mit.edu/madden SYNONYMS Approximate querying; Model-driven data acquisition DEFINITION The data generated by sensor is required to complement the sensor data. Models can help provide more robust interpretations of sensor readings: by accounting for spatial or temporal biases in the observed data, by identifying sensors

Deshpande, Amol

172

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

173

GeoDec : A Multi-Layered Query Processing Framework for Spatio-Temporal Data (Demo Paper)  

E-Print Network [OSTI]

of today's ever growing and dy- namic geospatial data requires the development of novel vi- sual analysis--complexity mea- sures, performance measures General Terms Geospatial data, visual analysis, spatio capable of supporting queries and visualizations of real- world geospatial data sets. We show, for various

Shahabi, Cyrus

174

One (Block) Size Fits All: PIR and SPIR with Variable-Length Records via Multi-Block Queries  

E-Print Network [OSTI]

One (Block) Size Fits All: PIR and SPIR with Variable-Length Records via Multi-Block Queries Ryan-theoretic private information retrieval (IT-PIR) scheme. Our new multi-block IT-PIR trades off some Byzantine costs within a small factor of the lowest possible. With our new multi-block IT-PIR protocol

Goldberg, Ian

175

Public Key Encryption that Allows PIR Queries Dan Boneh # Eyal Kushilevitz + Rafail Ostrovsky # William E. Skeith III  

E-Print Network [OSTI]

Public Key Encryption that Allows PIR Queries Dan Boneh # Eyal Kushilevitz + Rafail Ostrovsky a public­key encryption scheme for Alice that allows PIR searching over encrypted documents. Our solution­trivially small communication complexity. The main technique of our solution also allows for Single­Database PIR

Ostrovsky, Rafail

176

Initial queries into the notion of Power Users of Technology -Investigating ideas of production, competence and identity  

E-Print Network [OSTI]

' or young people's1 use of technology. What distinguishes the Power User research initiative and makes1 Initial queries into the notion of Power Users of Technology - Investigating ideas of production, which I find very important in order to un- derstand the notion of "Power Users of Technology

Paris-Sud XI, Universit de

177

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

178

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

179

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

180

Network Traffic Analysis With Query Driven VisualizationSC 2005HPC Analytics Results  

SciTech Connect (OSTI)

Our analytics challenge is to identify, characterize, and visualize anomalous subsets of large collections of network connection data. We use a combination of HPC resources, advanced algorithms, and visualization techniques. To effectively and efficiently identify the salient portions of the data, we rely on a multi-stage workflow that includes data acquisition, summarization (feature extraction), novelty detection, and classification. Once these subsets of interest have been identified and automatically characterized, we use a state-of-the-art-high-dimensional query system to extract data subsets for interactive visualization. Our approach is equally useful for other large-data analysis problems where it is more practical to identify interesting subsets of the data for visualization than to render all data elements. By reducing the size of the rendering workload, we enable highly interactive and useful visualizations. As a result of this work we were able to analyze six months worth of data interactively with response times two orders of magnitude shorter than with conventional methods.

Stockinger, Kurt; Wu, Kesheng; Campbell, Scott; Lau, Stephen; Fisk, Mike; Gavrilov, Eugene; Kent, Alex; Davis, Christopher E.; Olinger,Rick; Young, Rob; Prewett, Jim; Weber, Paul; Caudell, Thomas P.; Bethel,E. Wes; Smith, Steve

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.


181

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.

182

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.

183

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

184

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

185

Query | Department of Energy  

Office of Environmental Management (EM)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of Energy Power.pdf11-161-LNG |September 15,2015 | DepartmentLoans |Queryl Detailees Name From To

186

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.

187

Author Queries Journal: Biology Letters  

E-Print Network [OSTI]

later in the fruiting season. This study of relationships between morphological and eco- logical a strong relation- ship between spore size and time of fruiting; on average, a doubling of spore size

Bruns, Tom

188

EIA-176 Query System 2008  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) " ,"ClickPipelines AboutDecember 2005 (Thousand9,0, 1997 http://www.eia.doe.govMarkets 9, 4:00 pm See

189

Probabilistic Evaluation of Counterfactual Queries  

E-Print Network [OSTI]

D. 1993. Probabilistic Horn abduction and Bayesian networks.two essential compo- nents: abduction (to abduce plausible

Alexander Balke; Judea Pearl

2011-01-01T23:59:59.000Z

190

Complex Queries | Open Energy Information  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Office of Inspector GeneralDepartmentAUDITOhioOglesby,Sullivan,InformationInformationCaliforniaUSComplex

191

Example Queries | Open Energy Information  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home5b9fcbce19 NoPublic Utilities Address:011-DNA Jump37. It isInformationexplains a4Evendale, Ohio:Fieldblog/2781

192

User:Woodjr/Sandbox/Sparql3 | Open Energy Information  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home5b9fcbce19 No revisionEnvReviewNonInvasiveExplorationUT-gTagusparkCalculatorEnviroenergy2005NickNigroSparql <Sparql3 <

193

User:Woodjr/Sandbox/Sparql4 | Open Energy Information  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home5b9fcbce19 No revisionEnvReviewNonInvasiveExplorationUT-gTagusparkCalculatorEnviroenergy2005NickNigroSparql <Sparql3

194

User:Woodjr/Sandbox/Sparql | Open Energy Information  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home5b9fcbce19 No revisionEnvReviewNonInvasiveExplorationUT-gTagusparkCalculatorEnviroenergy2005NickNigroSparql < User:Woodjr‎

195

User:Woodjr/Sandbox/Sparql2 | Open Energy Information  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home5b9fcbce19 No revisionEnvReviewNonInvasiveExplorationUT-gTagusparkCalculatorEnviroenergy2005NickNigroSparql <

196

Beyond Simple Aggregates: Indexing for Summary Queries  

E-Print Network [OSTI]

# of employees #12;3-1 Reporting vs. Aggregation Date Keyword 2011.04.08 Masters 2011 2011.04.08 Libya 2011.04.07 Japan nuclear crisis 2011.04.07 Libya · · · 2011.03.11 Japan earthquake 2011.03.11 Japan tsunami 2011 2011.04.08 Libya 2011.04.07 Japan nuclear crisis 2011.04.07 Libya · · · 2011.03.11 Japan earthquake

Yi, Ke "Kevin"

197

Keyword query interpretation over structured data  

E-Print Network [OSTI]

Write TID AID PID Paper TID Cite TID PID1 V = {Author, Write, Paper, Cite} E = {Author.TID -> Write.AID, Paper.TID -> Write.PID, Paper.TID -> Cite.PID1, Paper.TID -> Cite.PID2} Primary keys: Author.TID, Write.TID. Paper.TID, Cite.TID Text attributes: Author.Name, Paper.Title 7 PID TID Title PID1 PID2 Elena Demidova

Nejdl, Wolfgang

198

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

199

Enabling Geographical Queries to a Botanical Database  

E-Print Network [OSTI]

Conservation of the lowland savanna ecosystem in Belize Project (Defra 17-022) has created a database of savanna plant collections in the country. Some of the collections have accurate positional coordinates measured by GPS devices while the others...

Sato, Go

2011-11-25T23:59:59.000Z

200

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

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

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

202

Query optimization in nested relational databases  

E-Print Network [OSTI]

by, attr(A) = (N ~ 3y C scheme(A) h N = name(y)). (2. 2) 12 Note that definition 2. 2 uses the scheme() notation to extract the scheme of A as it is a name whereas definition 2. 1 uses sch() to extract the schema component of the nested...(R) be a relation-valued attribute. Let X = attr(R) ? B' and attr(B') = (Br Bz '' B }. Then unnesting of R on B' is defined as: sch(p[B'](R)) = sch(R) ? ((B', scheme(B'))) U ((A, scheme(A))[A 6 attr(B')} val(p[B'](R)) = (t [ (3s C val(R)), (t(X) =s...

Rathakrishnan, Balaji

1992-01-01T23:59:59.000Z

203

Natural Gas Annual Respondent Query System  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLas Conchas recoveryLaboratory | NationalJohn Cyber Security NuclearNew testloading new table

204

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.

205

Table Name query? | OpenEI Community  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home5b9fcbce19 No revisionEnvReviewNonInvasiveExplorationUT-g GrantAtlas (PACAOpenSummersideJumpSyria: EnergyTESTTMATWSquery? Home

206

ask queries | OpenEI Community  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Office of InspectorConcentrating SolarElectric Coop,SaveWhiskey Flats GeothermalElectric Coop

207

compound queries | OpenEI Community  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Office of InspectorConcentrating SolarElectric Coop,SaveWhiskey Flats GeothermalElectric Coop Home7 August, Home

208

OpenEI Community - ask queries  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home5b9fcbce19 No revision hasInformation Earth'sOklahoma/Geothermal < Oklahomast, 2012Coast UtilitiesUpdate Meeting

209

OpenEI Community - compound queries  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home5b9fcbce19 No revision hasInformation Earth'sOklahoma/Geothermal < Oklahomast, 2012Coast UtilitiesUpdateHighwayoverview

210

Advanced IR Seminar 2007, LTI Structured Querying of WebStructured Querying of Web  

E-Print Network [OSTI]

facts of these predicates ­ scientist(Einstein), invented(Edison, light bulb) ­ TEXTRUNNER(07) · Extract.g. invented(Tesla, Fluorescent-Lighting),0.95 #12;Experiment ResultExperiment Result R lt f t i d· Results

Murphy, Robert F.

211

The V*-Diagram: A Query-Dependent Approach to Moving KNN Queries  

E-Print Network [OSTI]

and Software Engineering University of Melbourne Victoria, Australia NICTA Victoria Laboratory Australia a fee and/or special permission from the publisher, ACM. VLDB `08, August 24-30, 2008, Auckland, New

Zhang, Rui

212

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.

213

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

214

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

215

Modeling and Querying Context-Aware Personal Information Spaces  

E-Print Network [OSTI]

data model depending on his needs.The meta-model that we propose allows users creating personal valuation. Keywords: Personal Information Management, Ontologies, Contextual data 1 Introduction Personal of personal information managed by the user ap- plications. Indeed, many data present in one application can

Poizat, Pascal

216

Optimizing database-backed applications with query synthesis  

E-Print Network [OSTI]

Object-relational mapping libraries are a popular way for applications to interact with databases because they provide transparent access to the database using the same language as the application. Unfortunately, using ...

Cheung, Alvin K.

217

Detecting Dominant Locations from Search Queries , Chuang Wang  

E-Print Network [OSTI]

Forman 4 , Yansheng Lu 2 , Wei-Ying Ma 3 , Ying Li 1 1 Microsoft Corporation, One Microsoft Way, Redmond, WA 98052, USA {leew, yingli}@microsoft.com 2 Department of Computer Science, Huazhong University

Narasayya, Vivek

218

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

219

Structural Function Inlining Technique for Structurally Recursive XML Queries  

E-Print Network [OSTI]

-Ki Min Chin-Wan Chung Information Technology Lab., LG Electronics Institute of Technology Division of Computer Science, Korea Advanced Institute of Science and Technology cwpark@LG-Elite.com, {jkmin

Chung, Chin-Wan

220

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

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

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

222

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

223

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.

224

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.

225

Extracting Query Modifications from Nonlinear SVMs Gary William Flake  

E-Print Network [OSTI]

information when monitoring UF6 gas in pipes. 1/18/2011 11-008 C11043 getMirFiles.sh, Version 0.x Code

Giles, C. Lee

226

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

227

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

228

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

229

Consistent Query Answers in Inconsistent Databases Marcelo Arenas  

E-Print Network [OSTI]

is proved as well. 1 Introduction Integrity constraints capture an important normative aspect of every of consistent answer in a relational database that may violate given integrity constraints. This notion are consistent with the integrity constraints and which are not. In this pa per, we provide a logical

Bertossi, Leopoldo

230

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

231

anonymized ons queries: Topics by E-print Network  

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

We present an evaluation experiment that compares the of use of Tor (The second generation Onion Router) on a global ONSDNS setup, with respect to benefits, limitations, and...

232

Query-based Data Warehousing Tool Rami Rifaieh  

E-Print Network [OSTI]

between the source and the target data. Thus, we allow DBMS to play an expanded role as a data to provide evolution is a hard task and time consuming. In order to simplify this task, a full implementation allow DBMS to play an expanded role as a data transformation engine as well as a data store. Therefore

Song, Il-Yeol

233

annotation query capabilities: Topics by E-print Network  

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

for building cooperative data driven applications in domains characterized by a rapid evolution of knowledge. We will point out the semantic capabilities of annotated databases...

234

Aqua: A Fast Decision Support System Using Approximate Query Answers  

E-Print Network [OSTI]

commercial relational DBMS. Aqua precomputes synopses (special sta- tistical summaries) of the original data and stores them in the DBMS. It provides approximate an- swers (with quality guarantees) by rewriting on top of any SQL- compliant DBMS managing a data warehouse. Aqua pre- computes statistical summaries

Gibbons, Phillip B.

235

Mining Databases and Data Streams with Query Languages and Rules  

E-Print Network [OSTI]

that are beyond the reach of traditional Data Base Management Systems (DBMS), data mining stands out because of Inductive DBMS can become a reality. In this paper, we first discuss technical de- velopments that have occurred since the very notion of Inductive DBMS emerged as a result of the seminal papers authored

Zaniolo, Carlo

236

Distributed query execution on a replicated and partitioned database  

E-Print Network [OSTI]

Web application developers partition and replicate their data amongst a set of SQL databases to achieve higher throughput. Given multiple copies of tables partioned different ways, developers must manually select different ...

Narula, Neha

2010-01-01T23:59:59.000Z

237

Private Queries in Location Based Services: Anonymizers are not Necessary  

E-Print Network [OSTI]

Retrieval (PIR). Our framework does not re- quire a trusted third party, since privacy is achieved via computations. Contrary to common belief, the experimental results suggest that PIR approaches incur reasonable over- head and are applicable in practice. Categories and Subject Descriptors H.2.0 [General]: Security

Curtmola, Reza

238

Query execution in column-oriented database systems  

E-Print Network [OSTI]

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

Abadi, Daniel J

2008-01-01T23:59:59.000Z

239

Answering Imprecise Queries over Web Databases Ullas Nambiar & Subbarao Kambhampati  

E-Print Network [OSTI]

to unsatisfactory results. For example, suppose a user wishes to search for sedans priced around 10000 in a used car an autonomous Web database projecting relation R, find all tuples of R that show similarity to Q above

Kambhampati, Subbarao

240

Queries with Difference on Probabilistic Databases Sanjeev Khanna  

E-Print Network [OSTI]

(0.1) c1 a2 v2(0.5) c2 a3 v3(0.2) c3 a2 v4(0.9) T a1 w1(0.3) a2 w2(0.4) a3 w3(0.6) (a) q(x) : -R(x, y), S

Anderson, Richard

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

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

242

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

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

Identity Services Engine Discloses Authentication Credentials to Remote Users V-036: EMC Smarts Network Configuration Manager Database Authentication Bypass Vulnerability...

243

Query Answering in Distributed Description Faisal Alkhateeb and Antoine Zimmermann  

E-Print Network [OSTI]

hal-00817804,version1-25Apr2013 Author manuscript, published in "Proc. conference on New technologies homogeneous data, and they might prove useless if different ontologies are developed for a different context

Paris-Sud XI, Universit de

244

Querying Allocations Using cbank | Argonne Leadership Computing Facility  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLas ConchasPassive Solar HomePromising Science for1 2011 Publicationsand Allocation Management

245

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

246

A System for Query Based Analysis and Visualization  

E-Print Network [OSTI]

to another, i.e., an energetic particle that is either "passing" or "trapped." Underlying our technique is the usage of bitmap index- ing [WOS02] to accele

Knowles, David William

247

A Query Answering System for Data with Evolution Relationships  

E-Print Network [OSTI]

.g., student to professor, research lab to independent corporate entity) are unaccounted for. This kind

Velegrakis, Yannis

248

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

249

Increasing ask query limit | OpenEI Community  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Office of InspectorConcentrating Solar Power BasicsGermany:Information IDSDloomis's picture

250

Multicolor Maps from Compound Queries | OpenEI Community  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Office of InspectorConcentrating Solar Powerstories onFocus Area EnergyMohawkaccrediation of NIE) Jump to:Open

251

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

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious Rank EERE:YearRound-Up from the GridwiseSiteDepartmentChallengeCompliance7/109 TORNADO46: Debian

252

Category:Query Results Templates | Open Energy Information  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home5b9fcbce19 NoPublic Utilities Address: 160Benin: EnergyBostonFacilityCascadeJump to:Lists Jump to:PoliticalProductionResults

253

Template:Incentive Type Page Query | Open Energy Information  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data CenterFranconia, Virginia:FAQ < RAPID Jump to:Seadov Pty LtdSteen,Ltd Jump to:TaosISGANAttribution Jump to: navigation, search This

254

The Spatiotemporal RDF Store Strabon Kostis Kyzirakos, Manos Karpathiotakis, Konstantina Bereta, George Garbis,  

E-Print Network [OSTI]

of the project TELEIOS2 . Strabon is a semantic geospatial DBMS for storing and querying geospatial data in most cases performs better than any other geospatial DBMS that has been competed with. The valid timeSPARQL and extend Strabon with valid time support, in order be able to retrieve the evolution of the land cover

Koubarakis, Manolis

255

DBridge: A Program Rewrite Tool for Set-Oriented Query Execution  

E-Print Network [OSTI]

-- We present DBridge, a novel static analysis and program transformation tool to optimize database from static analysis of the program. The proposed program transformation rules are powerful enough optimzier and the language compiler re- spectively, leaving out many optimization opportunities. Our tool

Sudarshan, S.

256

Lower and upper queries for graph-mining Amina Kemmar 1  

E-Print Network [OSTI]

, and Mohammed Ouali 1 1 Laboratoire LITIO, Universit´e d'Oran BP 1524, El-M'Naouer, 31000 Oran, Alg´erie 2

Boyer, Edmond

257

RealTime SpatioTemporal Query Processing in Mobile AdHoc Sensor Networks  

E-Print Network [OSTI]

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

258

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

259

Visual Query Tools for Uncertain Spatio-Temporal Data Katherine Malan  

E-Print Network [OSTI]

Science University of Cape Town 7701 Rondebosch 21 6502665 kath cs.uct.ac.za Gary Department of Computer Science University of Cape Town 7701 Fiondebosch 21 6502666 gaz@cs.uct.ac.za Edwin Blake Department

Blake, Edwin

260

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

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

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

262

MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries  

E-Print Network [OSTI]

, distributed algorithms, mobile data management. 1 INTRODUCTION WITH the growing availability of mobile-sensitive resource management. The former uses location data to tailor the information delivered to the mobile users traffic and weather. Examples include systems for fleet manage- ment, mobile workforce management

Liu, Ling

263

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

264

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

265

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

266

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

267

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

268

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

269

RFID Data Processing with a Data Stream Query Language Yijian Bai  

E-Print Network [OSTI]

UCLA bai@cs.ucla.edu Fusheng Wang Peiya Liu Integrated Data Systems Department Siemens Corporate Research { fusheng.wang, peiya.liu}@siemens.com Carlo Zaniolo Shaorong Liu Department of Computer Science, and transformed into semantic data, and integrated into business applica- tions. Indeed, RFID data are highly

Zaniolo, Carlo

270

Queries for ecol-92-02-09 1. Au: Pages available? AP/PR  

E-Print Network [OSTI]

expected by chance. However, experimental species additions and removals did not affect extinction; plant colonization; plant extinction; serpentine soils; species addition and removal; species richness; temporal variation. INTRODUCTION While local species richness is ultimately a product of extinction

Harrison, Susan

271

Design and Implementation of the QBOE Query Language for Multimedia Database  

E-Print Network [OSTI]

properties of multimedia applications, traditional record-based DBMS techniques are not e ective of data, and many special properties of multimedia applications, traditional record-based DBMS tech model that allows a very natural and exible de nition and evolution of the schema which can represent

Chang, Ye-In

272

QL/G A Query Language for Geometric Data Edward P.F. Chan & Rupert Zhu  

E-Print Network [OSTI]

be expressed with the language. To facilitate the evolution of applications and to tailor to individual need A geometric database management system (DBMS) is a data base system with capabilities for the representation

Chan, Edward P.F.

273

A Data Mining System Based on SQL Queries and UDFs for Relational Databases  

E-Print Network [OSTI]

files, outside a DBMS, mainly due to the following reasons. It is easier to develop efficient algorithms in a traditional programming language. The in- tegration of data mining algorithms into a DBMS is difficult given the DBMS for data min- ing processing, which creates a performance bottleneck and eliminates important data

Ordonez, Carlos

274

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.

275

P2P query reformulation over BothasView data transformation rules  

E-Print Network [OSTI]

and Alexandra Poulovassilis 2 1 Dept. of Computing, Imperial College, Univ. of London, pjm@doc.ic.ac.uk 2 School

McBrien, Peter

276

Temporal-logics as query languages for Dynamic Bayesian Networks: Application to  

E-Print Network [OSTI]

of a particular hypothesis or theory. As such, a model has two phases in its lifecycle. In the first phase

Langmead, Christopher James

277

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

278

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

2014-04-29T23:59:59.000Z

279

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

280

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

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

6.893 Problem Set 2 1 Problem Set 2: Query Optimization  

E-Print Network [OSTI]

tries to get customers to buy a one-year 'service contract' with the vacuums he sells. Bob visits customers who have bought a service contract and maintains their vacuum for them. Thus, for each sale, Bob wants to keep track of the sales price and the type of service contract (if any) attached to the sale

282

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

283

Error Analysis of Ia Supernova and Query on Cosmic Dark Energy  

E-Print Network [OSTI]

Some serious faults in error analysis of observations for SNIa have been found. Redoing the same error analysis of SNIa, by our idea, it is found that the average total observational error of SNIa is obviously greater than $0.55^m$, so we can't decide whether the universe is accelerating expansion or not.

Qiuhe Peng; Yiming Hu; Kun Wang; Yu Liang

2012-01-16T23:59:59.000Z

284

Optimized Query Execution in Large Search Engines with Global Page Ordering  

E-Print Network [OSTI]

techniques that compute or approx- imate term-based ranking functions without scan- ning over the full inverted lists. Over the last few years, search engines have in- corporated new types of ranking techniques CAREER Award NSF CCR-0093400 and the New York State Center for Advanced Technology in Telecommuni

Suel, Torsten

285

Representing and querying regression models in a relational database management system  

E-Print Network [OSTI]

Curve fitting is a widely employed, useful modeling tool in several financial, scientific, engineering and data mining applications, and in applications like sensor networks that need to tolerate missing or noisy data. ...

Thiagarajan, Arvind

2007-01-01T23:59:59.000Z

286

A New Storage Scheme for Approximate Location Queries in Object Tracking Sensor Networks  

E-Print Network [OSTI]

for energy efficiency. We develop an Energy-conserving Approximate StoragE (EASE) scheme to efficiently the network lifetime by a factor of 2-5. Index Terms: Energy efficiency, data dissemination, data storage.g., in a hard-to-reach area). Thus, energy efficiency is a critical consideration in the design of large- scale

Lee, Dongwon

287

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

288

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

289

Using Contextually Closed Queries for Local Closed-World Reasoning in Rough Knowledge  

E-Print Network [OSTI]

that arise unexpectedly and demand immediate #12;220 P. Doherty, J. Kachniarz, A. Szalas response with little room for deliberation as to what the best response should be. Deliberative capabilities are useful CCQs is co-NPTIME com- plete, but we isolate a number of important practical cases where polynomial

Doherty, Patrick

290

Building Simulated Queries for Known-Item Topics: An Analysis using Six European Languages  

E-Print Network [OSTI]

Azzopardi,L. de Rijke,M. Balog,K. To appear in the Proceedings of the 30th Annual ACM Conference on Research and Development in Information Retrieval (SIGIR 2007)

Azzopardi, L.

291

Our reference: JBB 2049 P-authorquery-v8 AUTHOR QUERY FORM  

E-Print Network [OSTI]

Coppice (SRC) for farm-scale plant and invertebrate communities in the agri-environment Rebecca Rowe 1 (ground flora and winged invertebrates) varied between mature willow Short Rotation Coppice (SRC) and two

292

Towards Finding Relevant Information Graphics: Identifying the Independent and Dependent Axis from User-written Queries  

E-Print Network [OSTI]

Towards Finding Relevant Information Graphics: Identifying the Independent and Dependent Axis from of Computer and Information Science University of Delaware Newark, DE 19716 Abstract Information graphics (non-pictorial graphics such as bar charts and line graphs) contain a great deal of knowl- edge. Information retrieval

Carberry, Sandra

293

On the effect of INQUERY term-weighting scheme on query-sensitive similarity measures  

E-Print Network [OSTI]

and demonstrated better retrieval performance relative to the latter. We test whether introducing one of these schemes, INQUERY, will offer any benefit over the ltc scheme when used in the context of QSS measures. The testing procedure uses the Nearest Neighbor (NN...

Kini, Ananth Ullal

2006-04-12T23:59:59.000Z

294

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

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "ofEarly Career Scientists' Research Petroleum ReserveDepartmentScripting AttacksThereDepartmentExecute

295

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

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustion |Energy Usage »of EnergyTheTwo New Energy Storage6 (07/03) OMB Control2:Department of

296

Our reference: RENE 4564 P-authorquery-v9 AUTHOR QUERY FORM  

E-Print Network [OSTI]

Keywords: Wind potential Wind energy Climate changes Wind scenarios a b s t r a c t Brazil's wind energy emis- sions. The potential inland wind power resources in Brazil could reach more than 145,000 MW assistance. #12;The impacts of global climate changes on the wind power density in Brazil Q2 Enio B. Pereira

297

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

298

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

299

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

300

A Study on Microblog and Search Engine User Behaviors: How Twitter Trending Topics Help Predict Google Hot Queries  

E-Print Network [OSTI]

of Google trends, perform poorly. On the other hand, we validate the forecasting power of Twitter by showing as significant the past values of Twitter 60% of times. Moreover, we discover that a Twitter trend causes a similar Google trend to later occur about 43% of times. In the end, we show that the very best-performing

Orlando, Salvatore

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

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

302

Extensible Query Processing in Starburst Laura M. Haas, J.C. Freytag 1, G.M. Lohman, and H. Pirahesh  

E-Print Network [OSTI]

the increasing de- mands of the various applications that would like to use a DBMS. Each kind of application poses new requirements for the DBMS. The Starburst project at IBM's Almaden Research Center aims to extend relational DBMS technology to bridge this gap between applications and the DBMS. While providing

Mannheim, Universität

303

The ALqua Approximate Query Answering System Swar,up Acharya Phillip B. Gibbons Viswanath Poosala Sridhar Ramaswamy*  

E-Print Network [OSTI]

applications. It has been designed to run on top of any commercial relational DBMS. Aqua precom:putes synopses (special statistical summaries) of the original data and stores them in the DBMS. It provides approximate-compliant DBMS managing a data ware- house. Aqua precomputes statistical summaries, called synopses

Gibbons, Phillip B.

304

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

305

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

306

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

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home5b9fcbce19 No revision hasInformation Earth's Heat Jump to:PhotonHolyName HousingIII Wind FarmWould You Rebuild a Townquery

307

Reporting Tools Course ID: FMS121  

E-Print Network [OSTI]

Reporting Tools Course ID: FMS121 PS Query 03/31/2009 © 2009 Northwestern University FMS121 0 Introduction to Query For Query Developers Query is an ad-hoc reporting tool that allows you to retrieve data will have access to both query viewer and query manager pages. #12;Reporting Tools Course ID: FMS121 PS

Shull, Kenneth R.

308

Reporting Tools Course ID: FMS121  

E-Print Network [OSTI]

Reporting Tools Course ID: FMS121 PS Query 03/31/2009 © 2009 Northwestern University FMS121 0 Introduction to Query For Query Viewers Query is an ad-hoc reporting tool that allows you to retrieve data will have access to both query viewer and query manager pages. #12;Reporting Tools Course ID: FMS121 PS

Shull, Kenneth R.

309

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

310

Toward a Data Scalable Solution for Facilitating Discovery of Science Resources  

SciTech Connect (OSTI)

Science is increasingly motivated by the need to process larger quantities of data. It is facing severe challenges in data collection, management, and processing, so much so that the computational demands of data scaling are competing with, and in many fields surpassing, the traditional objective of decreasing processing time. Example domains with large datasets include astronomy, biology, genomics, climate/weather, and material sciences. This paper presents a real-world use case in which we wish to answer queries pro- vided by domain scientists in order to facilitate discovery of relevant science resources. The problem is that the metadata for these science resources is very large and is growing quickly, rapidly increasing the need for a data scaling solution. We propose a system SGEM designed for answering graph-based queries over large datasets on cluster architectures, and we re- port performance results for queries on the current RDESC dataset of nearly 1.4 billion triples, and on the well-known BSBM SPARQL query benchmark.

Weaver, Jesse R.; Castellana, Vito G.; Morari, Alessandro; Tumeo, Antonino; Purohit, Sumit; Chappell, Alan R.; Haglin, David J.; Villa, Oreste; Choudhury, Sutanay; Schuchardt, Karen L.; Feo, John T.

2014-12-31T23:59:59.000Z

311

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

312

Scalable Visual Queries for Data Exploration on Large, High-Resolution 3D Displays Khairi Reda, Andrew Johnson, Victor Mateevitsi, Catherine Offord and Jason Leigh  

E-Print Network [OSTI]

, University of Illinois at Chicago, Chicago, Illinois, USA Dept. of Ecology and Evolutionary Biology within the context of a behavioral ecology case study. We also share our observations from a pilot user however is naturally biased towards narratives that conform to the analyst's intuition [2]. Our perception

Johnson, Andrew

313

Queries for ecap-19-03-08 1. ED: Chloupka is spelled Chaloupka in Lit Cit. Please reconcile. AP/ccb  

E-Print Network [OSTI]

, Corvallis, Oregon 97331 USA Abstract. Population viability analysis (PVA) to forecast extinction risk is a commonly used tool in decision- and policy-making processes of governments and conservation organizations be considered in assessment model development. Population viability analysis (PVA), including extinc- tion risk

Hawai'i at Manoa, University of

314

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

315

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

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

aces quarks: Topics by E-print Network  

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

Figure 1. Arrows show the flow of information. Retrieval Session Engine Manager Text DB DBMS Internet Query Web Browser Search Result CGI Query Clickthrough Data Figure 1:...

318

ace mcci tests: Topics by E-print Network  

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

Figure 1. Arrows show the flow of information. Retrieval Session Engine Manager Text DB DBMS Internet Query Web Browser Search Result CGI Query Clickthrough Data Figure 1:...

319

aedes aegypti suggests: Topics by E-print Network  

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

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

320

adenylate cyclase suggests: Topics by E-print Network  

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

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

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

archaea suggests previously: Topics by E-print Network  

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

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

322

adhd suggests differential: Topics by E-print Network  

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

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

323

ai-2 receptors suggests: Topics by E-print Network  

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

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

324

analyses suggest multiple: Topics by E-print Network  

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

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

325

analysis suggests vcam1: Topics by E-print Network  

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

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

326

astrocytes suggests regional: Topics by E-print Network  

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

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

327

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.

328

Hierarchical Ranking of Facial Attributes Ankur Datta  

E-Print Network [OSTI]

to queries containing facial attributes, such as baldness, presence of beard, sunglasses, eyeglasses, hat

California at Santa Barbara, University of

329

Nonparametric Bayesian Policy Priors for Reinforcement Learning  

E-Print Network [OSTI]

We consider reinforcement learning in partially observable domains where the agent can query an expert for

Doshi-Velez, Finale P.

330

Eric J. Glover, Gary W. Flake, Steve Lawrence, William P. Birmingham, Andries Kruger, C. Lee Giles, David M. Pennock. Improving Category Specific Web Search by Learning Query Modifications, Symposium on Applications and  

E-Print Network [OSTI]

Eric J. Glover, Gary W. Flake, Steve Lawrence, William P. Birmingham, Andries Kruger, C. Lee Giles J. Glover 1;2 , Gary W. Flake 1 , Steve Lawrence 1 , William P. Birmingham 2 , Andries Kruger 1 , C

Pennock, David M.

331

Eric J. Glover, Gary W. Flake, Steve Lawrence, William P. Birmingham, Andries Kruger, C. Lee Giles, David M. Pennock. Improving Category Specific Web Search by Learning Query Modifications, Symposium on Applications and  

E-Print Network [OSTI]

Eric J. Glover, Gary W. Flake, Steve Lawrence, William P. Birmingham, Andries Kruger, C. Lee Giles J. Glover ¢¡ £ , Gary W. Flake , Steve Lawrence , William P. Birmingham £ , Andries Kruger

Pennock, David M.

332

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

333

Help:External SPARQL integration | Open Energy Information  

Open Energy Info (EERE)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Office of InspectorConcentrating Solar Power BasicsGermany: EnergyPower Finance Jump737002°,HavanaElor Program

334

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"

335

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-

336

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

337

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

338

LOWER BOUNDS ON LEARNING RANDOM STRUCTURES WITH  

E-Print Network [OSTI]

of Learning Parity PAC PAC w/ noise "noisy parity" Statistical Queries Yes [Gauss] O(2n/logn) [BKW] maybe

Reyzin, Lev

339

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

340

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

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

WeMiT: Web-Mining for Translation Mathieu Roche 1 and Oana Mihaela Garbasevschi 2  

E-Print Network [OSTI]

of PMI-IR algorithm (Pointwise Mutual Information and Information Retrieval) [9]. PMI-IR queries the Web

Boyer, Edmond

342

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

343

A Glance at an Overlooked Part of the World Wide Web  

E-Print Network [OSTI]

that about 42.7% of internet users visit porno- graphic websites. Pornography related queries to search en

Kuzmanovic, Aleksandar

344

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

345

http://www-db.in.tum.de/research/projects/StreamGlobe Optimization Techniques  

E-Print Network [OSTI]

: Redundant transmission of data streams Redundant execution of stream transforming operators Transmissionhttp://www-db.in.tum.de/research/projects/StreamGlobe Optimization Techniques: In-network query processing o Distribute query processing operators in the network (query shipping) o Early filtering

Kemper, Alfons

346

The EXODUS Optimizer Generator Goetz Graefe  

E-Print Network [OSTI]

. Algebraic transformation rules are translated into an execut- able query optimizer, which transforms query for an existing operator in the query language. To achieve this, the EXODUS design consists of a powerful, highlyThe EXODUS Optimizer Generator Goetz Graefe David J. DeWitt Computer Sciences Department University

Liblit, Ben

347

Site-Searching Strategies of Searchers Referred from Search Engines  

E-Print Network [OSTI]

1 Site-Searching Strategies of Searchers Referred from Search Engines Adan Ortiz-Cordova College and then submit multiple broad queries on the site-search engine, (2) the navigators who submit a query to the major search engine that is part of a URL and then submit specific queries to the site-search engine

Jansen, James

348

The Case for Fine-Grained Stream Provenance Boris Glavic #  

E-Print Network [OSTI]

). This limitation was imposed by high-throughput requirements and an anticipated lack of application demand for more generation Provenance retrieval Relevant events & queries Lifetime Retrieval Response times Ad-hoc human queries, all events retention period for indicators Point & Analytic queries offline Event ware- housing

Tatbul, Nesime

349

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

350

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

351

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

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

arXiv:cs.DB/0112011v25Feb2003 Interactive Constrained Association Rule Mining  

E-Print Network [OSTI]

. After this relatively expensive operation, the actual data mining queries issued by the user then amount]. It motivated the idea of a "data mining query language" [8, 9, 12, 13, 19] and was stressed again by Ng, Lakshmanan, Han and Pang [21]. A data mining query language allows the user to ask for specific subsets

Antwerpen, Universiteit

355

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

356

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

357

Randomized location service in Mobile Ad Hoc Networks  

E-Print Network [OSTI]

I 3. Pcrccntagc of outdated values for Algorithm II 4. Pcrccntage of outdated values for Algorithm III. , 5. Distribution of query' results lor Algorithm I with grid size 300x300m 7 6. Distribution ol' query results (or Algonthm I with gnd size... 500x500m . . . . . . z 7. Distribution of query results for Algorithm I with grid size 750x750m . . . . , . 8. Distribution of query results for Algorithm I with grid size 1000x I 000m . . 9. Distribution of query results for Algorithm II with grid...

Bhattacharya, Sangeeta

2003-01-01T23:59:59.000Z

358

Comparing object oriented and traditional designs for a forest pest management decision support system  

E-Print Network [OSTI]

developed for a forest pest management decision support system (DSS) to simulate the pattern of functional reusability during system evolution. Each design model was constructed using the Nexpert Object expert system development shell. The 00 design used... CONTROL PLAN PEST SURVEY ES POPULATION DBMS PIANT SPATIAL ANIMAL INSEC'I POPULATION COMPUTER LIFE STAGE PLANT POPULATION~ TOP~ BIOLOGICAL SIMULATION~ WEATHER TREE PHYSICAL~~ SOIL MANAGEMENT FIRE SPATIAL QUERY SUITABILITY QUERY SIMULATION QUERY...

Power, J. M

1991-01-01T23:59:59.000Z

359

Space-Efficient Framework for Top-k String Retrieval Problems (extended abstract)  

E-Print Network [OSTI]

strings for a given query pattern P. This involves somewhat more advanced query functionality than the usual pattern matching, as some notion of most relevant is involved. In information retrieval literature, this task is best achieved by using inverted... compared well with inverted indexes in their space utilization but also provided query functionality for arbitrary patterns. Since then, designing succinct or compressed data structures for text problems has been a thriving field of research with many...

Hon, Wing-Kai; Shah, Rahul; Vitter, Jeffrey Scott

2009-01-01T23:59:59.000Z

360

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

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

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

362

E-Print Network 3.0 - aportes al conocimiento Sample Search Results  

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

clculo, etc.). Conocimientos de bases de datos. Programacin para entornos... Web con PHP y Javascript (jQuery, Ajax). Conocimientos generales sobre manipulacin de objetos...

363

E-Print Network 3.0 - aporte al conocimiento Sample Search Results  

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

clculo, etc.). Conocimientos de bases de datos. Programacin para entornos... Web con PHP y Javascript (jQuery, Ajax). Conocimientos generales sobre manipulacin de objetos...

364

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

365

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

366

Website Policies and Important Links | Scientific and Technical...  

Office of Scientific and Technical Information (OSTI)

requests initiated by any network host, individual user, or automated means to query, capture, or download data from this system. As of October 3, 2011 the following thresholds...

367

E-Print Network 3.0 - anhydride iii dfa Sample Search Results  

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

Our algorithm has a quadratic query complexity in the product of sizes Source: Wang, Bow-Yaw - Institute of Information Science, Academia Sinica (Taiwan) Collection: Computer...

368

acute acid loading an: Topics by E-print Network  

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

7 queries Meagher, Mary 29 An Automatic Load Sharing Approach for a DFIG Based Wind Generator in a Microgrid Engineering Websites Summary: An Automatic Load Sharing Approach...

369

access devices evaluation: Topics by E-print Network  

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

unnecessarily long query processing times, since web accesses exhibit high and variable latency. Fortunately, web sources can be probed in parallel, and each source can typically...

370

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

371

From Predictive to Prescriptive Analytics - Optimization Online  

E-Print Network [OSTI]

ML have enabled applications that predict, for example, consumer demand for video games (Y ) based on online web-search queries (X) (Choi and Varian...

Nathan Kallus

2015-02-09T23:59:59.000Z

372

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

373

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

374

A developer's survey on different cloud platforms  

E-Print Network [OSTI]

NET API and an HTTP REST API. Addi- tionally, there areed query language; the HTTP REST API uses the ADO.NET Data

Doan, Dzung

2009-01-01T23:59:59.000Z

375

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

376

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

377

assay improves accuracy: Topics by E-print Network  

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

Summary: the performance of a prototype ser- vice allowing users to enter query terms to an online search engine by voice of search terms. Methods are investigated for...

378

analyzing electrographic status: Topics by E-print Network  

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

queries containing geographic terms. In particular, an investigation into what people search for when they use geographic terms, the ways in which they describe a geographic...

379

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1 A Predictive-Reactive Method for Improving the  

E-Print Network [OSTI]

applications, need to process queries and transactions in a timely fashion using fresh (temporally consistent quote queries and trade transactions should be processed within the acceptable response time bound using be processed in a timely manner using fresh data representing the current traffic status. Most existing (non

Kang, Kyoung-Don

380

Efficient Processing of XML Update Streams Leonidas Fegaras  

E-Print Network [OSTI]

real-time constraints using limited resources. The frequency and the volatility of stream data make the way to the result display, which prints the query answers. That way, the result display prints the query results continuously, replacing old results with new. The novelty of our approach is in the use

Fegaras, Leonidas

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

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

382

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

383

ACEEE Int. J. on Communication, Vol. 01, No. 03, Dec 2010 2010 ACEEE  

E-Print Network [OSTI]

, Mobile data, Query management. I. INTRODUCTION With recent advances in wireless technologies of Technology,Tiruchirappalli ,India. 2 saro_manj@yahoo.com Abstract - Location based mobile services (LBS is highly significant. This paper focuses on query management in mobile environments to locate the most

Paris-Sud XI, Universit de

384

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

385

Online Search Aids Petroleum Abstracts  

E-Print Network [OSTI]

to enter the words for the query. The center frame will display the list of terms resulting from the queryOnline Search Aids User Guide Petroleum Abstracts® A Division of The University of Tulsa July 1. A compilation of relevant E&P technical index terms and their relationships, covering the areas of geology

Reynolds, Albert C.

386

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

387

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

388

An Adaptive Algorithm for Selecting Profitable Keywords for Search-Based Advertising Services  

E-Print Network [OSTI]

offered by search en- gines. These services enable companies to promote their products to consumers based on their search queries. In most search-based advertising services, a company selects a set of keywords enable companies to promote their products to targeted groups of consumers based on their search queries

Rusmevichientong, Paat

389

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

390

InfoCrystal: A visual tool for information retrieval  

E-Print Network [OSTI]

of interest. The InfoCrystal allows users to specify Boolean as well as vector-space queries graphically continuous, multi-variate fields that vary over space and time. Hence, the transformation problem the InfoCrystalTM, that can be used as a visualiza- tion tool as well as a visual query language to help

Spoerri, Anselm

391

InfoCrystal: A visual tool for information retrieval  

E-Print Network [OSTI]

of interest. The lnfocrystal allows users to specify Boolean as well as vector- space queries graphically C r y s t a l T M ,that can be used as a visualization tool as well as a visual query lan- guage more readily than a direct analysis of the numbers would. Similarly, information visualization seeks

Spoerri, Anselm

392

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

393

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

394

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

395

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.

396

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

397

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

398

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

399

Peter R. Pietzuch prp@doc.ic.ac.uk  

E-Print Network [OSTI]

Scope · Using sensors to understand geological evolution ­ Many sources: seismometers, GPS stations, ... http://www.earthscope.org E How do you process all this data? #12;Traditional Databases ·Database Management System (DBMS): · Data relatively static but queries dynamic 7 DBMS Data Queries Results Index ­ Persistent relations

Bonaventure, Olivier

400

Control-Based Quality Adaptation in Data Stream Management Systems  

E-Print Network [OSTI]

in a traditional DBMS, the processing of continuous queries in a data stream management system (DSMS) needs elements. Processing of data streams brings great challenges to DBMS design for two major reasons. First Management Systems 747 very common in data stream applications. Unlike those in a traditional DBMS, queries

Hefeeda, Mohammed

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

Malicious-Client Security in Blind Seer: A Scalable Private DBMS  

E-Print Network [OSTI]

Malicious-Client Security in Blind Seer: A Scalable Private DBMS Ben Fisch, Binh Vo, Fernando Krell DBMS that affords both client query privacy and server data protection. It also provides the ability satisfying any query of its choice, thus violating basic security features of any standard DBMS. In sum

402

Database Managament IS&M Option Mark Levene  

E-Print Network [OSTI]

Database Managament IS&M Option Mark Levene Email: m.levene@dcs.bbk.ac.uk Web: http://www.dcs.bbk.ac.uk/~mark/ Lecture Plan 1. Introduction to Databases 2. Data Modelling with the Entity-Relationship Model 3 and Referential Integrity 4. Querying a Relational Database (a) Querying a Single Table (b) Aggregating

Levene, Mark

403

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 comprises 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); Hart, Michelle L. (Richland, WA); Hatley, Wes L. (Kennewick, WA)

2008-05-13T23:59:59.000Z

404

Template-Based Modeling of Protein Structure David Constant  

E-Print Network [OSTI]

will obviously have an effect on the quality of the ultimate model that is predicted. In recent years, the line this method. Simple BLAST searches comparing sequences to sequences can be sufficient for very easy queries the query to templates using sequence profiles generated by PSI- BLAST or HMM can result

405

BioMed Central Page 1 of 6  

E-Print Network [OSTI]

-similar to the query. FASH offers an alternative approach to Blast/Fasta for querying long RNA/DNA sequences. FASH. Although packages such as BLAST [2] and FASTA [3] are tremendously useful, alternative approaches may nucleotide) has the effect of switching the "match-path" to an adjacent diagonal. If gaps are randomly

Barash, Danny

406

GhostDB: Hiding Data from Prying Eyes Christophe Salperwyck*  

E-Print Network [OSTI]

one direction: from public to private. This demonstration shows GhostDB's query processing in action Imagine that you have been entrusted with private data, such as corporate product information, sensitive queries whose result will combine private and public data, but private data must not be revealed, say

Paris-Sud XI, Universit de

407

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

408

Achieving Practical Access Pattern Privacy in Data Outsourcing  

E-Print Network [OSTI]

security, the server must evaluate each query over all bits in the database, making PIRsecurity, the server must evaluate each query over all bits in the database, making PIRsecurity. Bandwidth Cost Enhancements We now present three enhancements to OS+PIR

Dautrich, Jonathan L.

2014-01-01T23:59:59.000Z

409

Repudiative Information Retrieval Dmitri Asonov  

E-Print Network [OSTI]

, that a record retrieved is or is not the j-th record for any 1 j N. The first problem is called PIR, and we call the second problem the RIR problem. State of the art PIR protocols with optimal query response- ening PIR to RIR. In particular, we propose a RIR protocol with optimal query response time

Freytag, Johann-Christoph

410

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

411

An Overview about the DynaQuest-Framework Marco Grawunder  

E-Print Network [OSTI]

framework (Sdf) provides a special vocabulary, that consists of several parts (see Fig. 1). RDF Schema SDF Schema SDF Datatypes SDF Units SDF Mappings SDF Functions SDF Constraints SDF Predicates SDF Quality Global Schema Local SourcesLocal SourcesLocal Sources ...User Query SDF Query SDF Descriptions SDF Unit

Appelrath, Hans-Jürgen

412

Building Fuzzy Thematic Clusters and Mapping Them to Higher Ranks in a Taxonomy  

E-Print Network [OSTI]

, Moscow, RF 3 Computer Science Department and Centre for Artificial Intelligence (CENTRIA), Faculdade de as a query set. To lift a query set to higher ranks of the taxonomy, we develop an original recursive a framework for representation of the activities of an organization or any other system under consideration

Mirkin, Boris

413

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.

414

Diesel: Applying Privilege Separation to Database Access Adrienne Porter Felt  

E-Print Network [OSTI]

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

Wagner, David

415

Complexity Boundaries for Generalized Guarded Existential Rules  

E-Print Network [OSTI]

of the conjunctive query entail- ment problem for classes of existential rules (also called Tuple-Generating, namely (weakly) frontier- guarded rules. We provide a generic algorithm for query entailment with gbts complexity. Secondly, we classify several gbts classes, whose complexity was unknown, namely frontier

Paris-Sud XI, Université de

416

Data warehousing and on-line analytical processing (OLAP) are essential elements of decision support, which has  

E-Print Network [OSTI]

; front end client tools for querying and data analysis; server extensions for efficient query processing analysis, risk analysis, credit card analysis, and fraud detection), transportation (for fleet management of decision support, which has increasingly become a focus of the database industry. Many commercial products

Lakshmanan, Laks V.S.

417

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

418

A System for the Static Analysis of XPath PIERRE GENEV`ES and NABIL LAYAIDA  

E-Print Network [OSTI]

.3 [Database Management]: Systems--Query Processing; D.3.1 [Programming Languages]: Formal Definitions digital/hard copy of all or part of this material without fee for personal or classroom use provided and optimization of the query itself [Genev`es and Vion-Dury 2004a], which aim at enforcing operational properties

Paris-Sud XI, Université de

419

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

420

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

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

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

422

A TRANSPORTATION RISK ASSESSMENT TOOL FOR ANALYZING THE TRANSPORT OF SPENT NUCLEAR FUEL AND HIGH-LEVEL RADIOACTIVE WASTE TO THE PROPOSED YUCCA MOUNTAIN REPOSITORY  

SciTech Connect (OSTI)

The Yucca Mountain Draft Environmental Impact Statement (DEIS) analysis addressed the potential for transporting spent nuclear fuel and high-level radioactive waste from 77 origins for 34 types of spent fuel and high-level radioactive waste, 49,914 legal weight truck shipments, and 10,911 rail shipments. The analysis evaluated transportation over 59,250 unique shipment links for travel outside Nevada (shipment segments in urban, suburban or rural zones by state), and 22,611 links in Nevada. In addition, the analysis modeled the behavior of 41 isotopes, 1091 source terms, and used 8850 food transfer factors (distinct factors by isotope for each state). The analysis also used mode-specific accident rates for legal weight truck, rail, and heavy haul truck by state, and barge by waterway. This complex mix of data and information required an innovative approach to assess the transportation impacts. The approach employed a Microsoft{reg_sign} Access database tool that incorporated data from many sources, including unit risk factors calculated using the RADTRAN IV transportation risk assessment computer program. Using Microsoft{reg_sign} Access, the analysts organized data (such as state-specific accident and fatality rates) into tables and developed queries to obtain the overall transportation impacts. Queries are instructions to the database describing how to use data contained in the database tables. While a query might be applied to thousands of table entries, there is only one sequence of queries that is used to calculate a particular transportation impact. For example, the incident-free dose to off-link populations in a state is calculated by a query that uses route segment lengths for each route in a state that could be used by shipments, populations for each segment, number of shipments on each segment, and an incident-free unit risk factor calculated using RADTRAN IV. In addition to providing a method for using large volumes of data in the calculations, the queries provide a straight-forward means used to verify results. Another advantage of using the MS Access database was the ability to develop query hierarchies using nested queries. Calculations were broken into a series of steps, each step represented by a query. For example, the first query might calculate the number of shipment kilometers traveled through urban, rural and suburban zones for all states. Subsequent queries could join the shipment kilometers query results with another table containing unit risk factors calculated using RADTRAN IV to produce radiological impacts. Through the use of queries, impacts by origin, mode, fuel type or many other parameters can be obtained. The paper will show both the flexibility of the assessment tool and the ease it provides for verifying results.

NA

2001-02-15T23:59:59.000Z

423

The Development of an Effective Transportation Risk Assessment Model for Analyzing the Transport of Spent Fuel and High-Level Radioactive Waste to the Proposed Yucca Mountain Repository  

SciTech Connect (OSTI)

Past approaches for assessing the impacts of transporting spent fuel and high-level radioactive waste have not been effectively implemented or have used relatively simple approaches. The Yucca Mountain Draft Environmental Impact Statement (DEIS) analysis considers 83 origins, 34 fuel types, 49,914 legal weight truck shipments, 10,911 rail shipments, consisting of 59,250 shipment links outside Nevada (shipment kilometers and population density pairs through urban, suburban or rural zones by state), and 22,611 shipment links in Nevada. There was additional complexity within the analysis. The analysis modeled the behavior of 41 isotopes, 1091 source terms, and used 8850 food transfer factors (distinct factors by isotope for each state). The model also considered different accident rates for legal weight truck, rail, and heavy haul truck by state, and barge by waterway. To capture the all of the complexities of the transportation analysis, a Microsoft{reg_sign} Access database was created. In the Microsoft{reg_sign} Access approach the data is placed in individual tables and equations are developed in queries to obtain the overall impacts. While the query might be applied to thousands of table entries, there is only one equation for a particular impact. This greatly simplifies the validation effort. Furthermore, in Access, data in tables can be linked automatically using query joins. Another advantage built into MS Access is nested queries, or the ability to develop query hierarchies. It is possible to separate the calculation into a series of steps, each step represented by a query. For example, the first query might calculate the number of shipment kilometers traveled through urban, rural and suburban zones for all states. Subsequent queries could join the shipment kilometers query results with another table containing the state and mode specific accident rate to produce accidents by state. One of the biggest advantages of the nested queries is in validation. Temporarily restricting the query to one origin, one shipment, or one state and validating that the query calculation is returning the expected result allows simple validation. The paper will show the flexibility of the assessment tool to consider a wide variety of impacts. Through the use of pre-designed queries, impacts by origin, mode, fuel type or many other parameters can be obtained.

McSweeney; Thomas; Winnard; Ross; Steven B.; Best; Ralph E.

2001-02-06T23:59:59.000Z

424

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

425

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.

426

areva np cr2o3-doped: Topics by E-print Network  

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

that hard sets S for NP must have exponential density, i.e. |Sn| 2n for some > 0 for Turing reductions that make n1- queries. In addition we study the instance complexity of...

427

: 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

428

Distributed mobile platforms and applications for intelligent transportation systems  

E-Print Network [OSTI]

Smartphones are pervasive, and possess powerful processors, multi-faceted sensing, and multiple radios. However, networked mobile apps still typically use a client-server programming model, sending all shared data queries ...

Gao, Jason Hao

2013-01-01T23:59:59.000Z

429

Utility Of The American Viticultural Areas Of Texas Information Systems (AVATXIS) As A Tool In The Characterization Of The Texas Wine Regions  

E-Print Network [OSTI]

viticulturists better understand wine growing regions in Texas. The application allows users to spatially query and visualize a range of edaphic and climatic factors that influence vine growth and grape production. By providing growers a wide variety of climatic...

Takow, Elvis

2010-01-16T23:59:59.000Z

430

2005, Open Geospatial Consortium, Inc. 2005, Open Geospatial Consortium, Inc. OGC Web Services: IntegratingOGC Web Services: Integrating  

E-Print Network [OSTI]

for NASA)(Why WMS for NASA) Sam A. Bacharach Executive Director, Outreach www.opengeospatial.org 703 Buildings Roads Images Targets Boundaries ... Catalog View Common interfaces enable interoperability Queries

431

Towards a better insight of RDF triples Ontology-guided Storage system abilities  

E-Print Network [OSTI]

Towards a better insight of RDF triples Ontology-guided Storage system abilities Olivier Cur´e1 to such queries, one has to give a special attention to the storage system associated to the triples. In fact, RDF

Paris-Sud XI, Université de

432

Data Management Research at the Technical University of Crete  

E-Print Network [OSTI]

and Computer Engineering, Production Engineering and Management, Mineral Resources Engineering, Environ- mental for tracking complex, holistic queries that provide a global view of the data by combining and correlat- ing

Garofalakis, Minos

433

E-Print Network 3.0 - annular core research reactor Sample Search...  

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

data buse. m a x . RO char.ioKji RESEARCH REACTORS. U ;I.I-I 1 ..-i-.' 2 -lltM. This profile... retrieves all references about research reactors. Normally a query consisting of...

434

Texas Rice, Highlights in Research  

E-Print Network [OSTI]

&M University and the owner of the herbicide resistance gene associated with Clearfield Technology, BASF. X-rice: Texas Mutant Rice That May Answer Query For Function Controlled By Specific Dna Sequence Mutants are odds since these usually have unusual...

2006-01-01T23:59:59.000Z

435

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

436

Face Recognition in MediaQ MediaQ Face Recognition Analytics  

E-Print Network [OSTI]

and Ying? User Query: When does George appear in this video? ... George @ frame 1, 2, 3... Ying @ frame 6, 7, 8... George Ying Yuwei Add new face? IMSC Retreat 2013 Face Recognition with Eigenface Algorithm

Shahabi, Cyrus

437

Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers, pages 12081217, Dublin, Ireland, August 23-29 2014.  

E-Print Network [OSTI]

. For instance, for the query "Libya conflict", our system will return important events related to the Libya measures" to protect civilians in Libya, where a revolt is under way against the regime of Moamer Kadhafi

438

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

439

Unmasking the Wiesner : a technological transformation : this is not a building  

E-Print Network [OSTI]

Introduction: A Technological Transformation The proposition to be argued is that architecture has the potential to reawaken us to the most basic and satisfying nuances of human experience. In this thesis the query is made ...

Spampanato, Maryellen

1993-01-01T23:59:59.000Z

440

from Proceedings of the Fifth Canadian Conference on Computational Geometry, pp 291296 An Output Sensitive Algorithm for the  

E-Print Network [OSTI]

in a considerable speed increase over existing algorithms that answer intensity queries. The umbra and penumbra compute a subset of the shadow boundaries which includes the boundaries of the umbra and penumbra regions

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


441

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

442

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

443

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

444

Goal-oriented Web search  

E-Print Network [OSTI]

We have designed and implemented a Goal-oriented Web application to search videos, images, and news by querying YouTube, Truveo, Google and Yahoo search services. The Planner module decomposes functionality in Goals and ...

Williamson, Victor Lamont

2010-01-01T23:59:59.000Z

445

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

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

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

446

Practical Comprehensive Bounds on Surreptitious Communication Over DNS  

E-Print Network [OSTI]

receive sur- reptitiously through DNS queries to an upper bound specified by a site's security policy either a 0 bit or a 1 bit.1 It will prove intractable for a site's security analysts (or any detection

Paxson, Vern

447

E-Print Network 3.0 - artichoke leaf extract Sample Search Results  

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

Inference with Partial Ranking Queries Jonathan Huang Summary: ) item i2 if the rank of i1 is less than the rank of i2. For example, might be Artichoke, Broccoli... ,...

448

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

449

A Probabilistic Framework to Learn from Multiple Annotators with Time-Varying Accuracy  

E-Print Network [OSTI]

cleaner, bet- ter quality labels without extensive label queries. 1 Introduction In many data mining become careless with time due to fatigue effects, but may be refreshed for future labeling sessions

Carbonell, Jaime

450

Remote data access and analysis using SciDB  

E-Print Network [OSTI]

SciDB is an innovative data analysis system that provides fast querying and manipulation of large amounts of time-series, scientific data. This thesis describes the design of a framework that provides a user interface to ...

Anderson, Alan M., M. Eng. Massachusetts Institute of Technology

2012-01-01T23:59:59.000Z

451

Capturing Data Uncertainty in High-Volume Stream Processing  

E-Print Network [OSTI]

We present the design and development of a data stream system that captures data uncertainty from data collection to query processing to final result generation. Our system focuses on data that is naturally modeled as continuous random variables. For such data, our system employs an approach grounded in probability and statistical theory to capture data uncertainty and integrates this approach into high-volume stream processing. The first component of our system captures uncertainty of raw data streams from sensing devices. Since such raw streams can be highly noisy and may not carry sufficient information for query processing, our system employs probabilistic models of the data generation process and stream-speed inference to transform raw data into a desired format with an uncertainty metric. The second component captures uncertainty as data propagates through query operators. To efficiently quantify result uncertainty of a query operator, we explore a variety of techniques based on probability and statisti...

Diao, Yanlei; Liu, Anna; Peng, Liping; Sutton, Charles; Tran, Thanh; Zink, Michael

2009-01-01T23:59:59.000Z

452

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

453

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

454

Eleventh Biennial Report May 2011 March 2013  

E-Print Network [OSTI]

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.2.5 Software and Services . . . . . . . . . . . . . . . . . . . . . . . . . 12 1.2.6 Impact of Protein Interactions, Olga Kalinina 91 17 Querying, Indexing, and Discovery in Dynamic Data, Sebastian

455

Articulated Objects  

E-Print Network [OSTI]

Detection of articulated objects in images, including location and state, is an important and challenging task in many object tracking applications. Image edges have proven to be a key feature, although their quality is influenced by many factors. In this paper, we propose a novel edge gradient-based template matching method for object detection. In contrast to other methods, ours does not perform any binarization or discretization during the online matching. This is facilitated by a new continuous edge gradient similarity measure. Its main components are a novel edge gradient operator, which is applied to query and template images, and the formulation as a convolution, which can be computed very efficiently in Fourier space. Our method consists of a preprocessing stage for the template images, a simple preprocessing of the query image, and our similarity measure between template and query image, which yields a confidence map for the query image. The resulting

Daniel Mohr; Gabriel Zachmann; Ifi-- Impressum; Daniel Mohr; Gabriel Zachmann

456

Presented at Workshop on Distributed Data & Structures -WDAS-2002, University Paris 9 Dauphine, March 20-23, 2002  

E-Print Network [OSTI]

high performing stream-oriented DBMS is being developed for representing and querying non-relational DBMS engine. Sections of the streams are materialized in the node databases and numerical algorithms

457

Automated Physical Designers: What You See is (Not) What You Get  

E-Print Network [OSTI]

and materialized views) may improve query execution performance by several orders of magnitude. Commercial DBMS design has become extremely popular and most commercial DBMS ven- dors nowadays offer physical designers

458

Distributed DBMS Introduction  

E-Print Network [OSTI]

Distributed DBMS Outline Introduction What is a distributed DBMS Problems Current state-of-affairs Background Distributed DBMS Architecture Distributed Database Design Semantic Data Control Distributed Query Processing Distributed Transaction Management Parallel Database Systems Distributed Object DBMS

Chen, Yangjun

459

CryptDB: A Practical Encrypted Relational DBMS  

E-Print Network [OSTI]

CryptDB is a DBMS that provides provable and practical privacy in the face of a compromised database server or curious database administrators. CryptDB works by executing SQL queries over encrypted data. At its core are ...

Popa, Raluca Ada

2011-01-26T23:59:59.000Z

460

Database Structure and Visualization Software for Microbial Physiology Data INTRODUCTION  

E-Print Network [OSTI]

Database Structure and Visualization Software for Microbial Physiology Data INTRODUCTION Nicholas includes database input. Other related information can be entered through the website. The relational structure of the database is responsible for associating related data A structured query is sent

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

Local computation algorithms for graphs of non-constant degrees  

E-Print Network [OSTI]

In the model of local computation algorithms (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve time ...

Yodpinyanee, Anak

2014-01-01T23:59:59.000Z

462

SIAM/ASA J. UNCERTAINTY QUANTIFICATION c xxxx Society for Industrial and Applied Mathematics Vol. xx, pp. x xx  

E-Print Network [OSTI]

media flows (e.g. groundwater, Li-ion batteries or fuel cells), models in finance or inverse problems or optimization. Such a multi-query situation requires the numerical solution of the PDE for many instances

Haasdonk, Bernard

463

CarSpeak: a content-centric network for autonomous driving  

E-Print Network [OSTI]

This paper introduces CarSpeak, a communication system for autonomous driving. CarSpeak enables a car to query and access sensory information captured by other cars in a manner similar to how it accesses information from ...

Suresh Kumar, Swarun

464

CarSpeak : a content-centric network for autonomous driving  

E-Print Network [OSTI]

We introduce CarSpeak, a communication system for autonomous driving. CarSpeak enables a car to query and access sensory information captured by other cars in a manner similar to how it accesses information from its local ...

Suresh Kumar, Swarun

2012-01-01T23:59:59.000Z

465

Data sharing in neuroimaging research  

E-Print Network [OSTI]

federation or mediation (e.g. , NIF, NITRC), most cognitivefrom within the community. NIF allows researchers to querybroad and powerful scope of NIFs query engine perhaps make

2012-01-01T23:59:59.000Z

466

Brede tools and federating online neuroinformatics databases Finn Arup Nielsen  

E-Print Network [OSTI]

Information Framework (NIF) that uses the Neuro- science Information Framework standardized (NIF- STD) ontology (Bug et al, 2008). With this ontology NIF performs term expansion from a user query. The expanded

467

A Prototype System for Transnational Information Sharing and Process Coordination S. Su, J. Fortes, T. R. Kasad, M. Patil, A. Matsunaga, and M. Tsugawa, University of Florida  

E-Print Network [OSTI]

Abuse Control Council, Belize M. Herrera, National Drug Council, Dominican Republic Abstract Global problems such as disease detection and control, terrorism, immigration and border control, illicit drug, constraints, regulations, and security and privacy rules by integrating a distributed query processor

Carbonell, Jaime

468

Users Frequently Asked Questions | National Nuclear Security...  

National Nuclear Security Administration (NNSA)

A. No. Do not reuse transaction numbers. Each transaction number must be unique in order for the NMMSS to process transactions properly and to assure that data queries select...

469

Introduction The Bureau of Transportation Statistics reports that in  

E-Print Network [OSTI]

departed from US airports1). Following essentially every landing, lavatories are ser- viced, with the wasteMed was queried using search terms (aircraft or airline or airplane) with (lavatory or wastewater or sewage

Illinois at Chicago, University of

470

Model for a web based medical technology assessment system  

E-Print Network [OSTI]

will form the backbone of this system. Various queries can be run to produce the desired results. This system will provide a means for assessing the currently available medical technology. Based on the information present in the system clinical engineers...

Prabhu, Gopal

1999-01-01T23:59:59.000Z

471

Ormolu : generating runtime monitors from alloy models  

E-Print Network [OSTI]

This thesis presents Ormolu, a runtime monitor used for monitoring distributed systems. Given an Alloy model, Ormolu generates a database schema and translates the constraints of the model to queries over the database. The ...

Reeves, Dwayne Lloyd

2011-01-01T23:59:59.000Z

472

Zero-shot Entity Extraction from Web Pages June 23, 2014  

E-Print Network [OSTI]

natural causes of global warming lsu football coaches bf3 submachine guns badminton tournaments foods high. airlines of italy natural causes of global warming lsu football coaches 8 #12;Query Generation Breadth

Pratt, Vaughan

473

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

474

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

475

Advanced Semantic Search: The Medical World as an Example  

E-Print Network [OSTI]

to be specific. · The example query "Which disease has the symptom of coughing?" brings a result set in hakia of coughing?" #12;20 4. Handling Concept Matching · Perhaps the most challenging functionality among all

Shamir, Ron

476

Dr. Jianlin Cheng Department of Computer Science  

E-Print Network [OSTI]

;Applications of a posterior belief #12;An Example Flu Fever High Temperature Cough #12;An Example ­ Combining Evidences Flu Fever High Temperature Cough #12;Inferential query 3: most probable assignment #12;Inferential

Cheng, Jianlin Jack

477

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

478

Parallel Accelerated Isocontouring for Out-of-Core Visualization C. L. Bajaj V. Pascucci D. Thompson X. Y. Zhang  

E-Print Network [OSTI]

of the current query isocontour. This approach has come to be known as accel- erated isocontouring. Early work]. The same goal was addressed more recently with the particle- based method [7]. Several algorithms have been

Pascucci, Valerio

479

aids reference center: Topics by E-print Network  

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

them by entering keywords, using pre?defined subject terms or constructing complex search queries using Boolean logic. Below the search term field, users will find a list of...

480

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

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

International Journal of Cooperative Information Systems c World Scientific Publishing Company  

E-Print Network [OSTI]

Query Processing Using Generalized Filter 1. Introduction Government agencies and large organizations, become an important cooperate asset. Due to historical reasons, these data are typically owned, managed the Land Department), infrastructure information (from the Transport Department and utilities companies

Liu, Chengfei

482

Logic Programming Infrastructure for Inferences on FrameNet  

E-Print Network [OSTI]

BMW buying Rover one might enter a query like (1) into a search engine. (1) BMW buy Rover results that are formulated e.g. in finite form (BMW buys Rover), relevant pages using semantically

Baumgartner, Peter

483

An extended abstract of this paper appears in ICICS 2007, S. Qing, H. Imai, and G. Wang (Eds.), volume 4861 of LNCS, pp. 69-82, Sringer-Verlag, 2007.  

E-Print Network [OSTI]

's identity only by a party who possesses an open authority. In such environment, there exists a group manager of the BMW- model [6], where the anonymity of the members relies on the adversary can not make any query

484

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

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

and WorldWideScience.org, the patron gains access to multiple, geographically dispersed deep web databases and can search all of the constituent sources with a single query. Add...

485

Publications about OSTI | OSTI, US Dept of Energy, Office of...  

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

and WorldWideScience.org, the patron gains access to multiple, geographically dispersed deep web databases and can search all of the constituent sources with a single query...

486

Towards Privacy Preserving of Forensic DNA Databases  

E-Print Network [OSTI]

Protecting privacy of individuals is critical for forensic genetics. In a kinship/identity testing, related DNA profiles between user's query and the DNA database need to be extracted. However, unrelated profiles cannot be revealed to each other...

Liu, Sanmin

2012-02-14T23:59:59.000Z

487

Mission-Critical Platform for Online Transaction Processing (OLTP) SQL Server 2008 Mission-Critical Platform for OLTP Data Solutions  

E-Print Network [OSTI]

Mission-Critical Platform for Online Transaction Processing (OLTP) SQL Server 2008 Mission Data Collector to troubleshoot and tune SQL Server 2008 instances. Help ensure compliance 2008 high- performance query processing engine for industry leading performance and scalability. Define

Bernstein, Phil

488

Space-Efficient Multi-Dimensional Range Marek Karpinski and Yakov Nekrich  

E-Print Network [OSTI]

-dimensional range reporting queries in O(log log U + (log log n)3 + k) time and uses O(n log n) space, where U(logd-2 n + k) time and uses O(n logd-2+ n) space for an arbitrary constant > 0. Recently, Nekrich [11 queries in O(logd-3 n/(log log n)d-5 + k) time and uses O(n logd-2+ n) space for d > 3. See Table 1

Eckmiller, Rolf

489

Quantum Certificate Complexity Scott Aaronson #  

E-Print Network [OSTI]

(f) # D (f ), and that Q 0 (f) # R 0 (f). 1 If f is partial (i.e. S #= {0, 1} n ), then Q 2 (f) canQuantum Certificate Complexity Scott Aaronson # Abstract Given a Boolean function f , we study two . 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

490

Universal Wireless Event Monitoring System  

E-Print Network [OSTI]

of remote query sensor systems have been investigated and various products have been developed for sensing different applications like water leakage, temperature, pressure, gas, diaper wetting etc [2-7]. The wireless link in these systems which is needed...-9]. One of the means of remote query sensing is the direct measurement of impedance of antenna which is wirelessly connected to the sensor. By measuring the impedance of the antenna using instrument like Impedance analyzer or network analyzer, the exact...

Yambem, Lamyanba

2012-10-19T23:59:59.000Z

491

Geometric Algorithms for Modeling, Motion, and Animation (GAMMA): Collision Detection Videos from the University of North Carolina GAMMA Research Group  

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

Physically based modeling simulations depend highly on the physical interaction between objects in a scene. Complex physics engines require fast, accurate, and robust proximity queries to maintain a realistic simulation at interactive rates. We couple our proximity query research with physically based modeling to ensure that our packages provide the capabilities of today's physics engines.[Copied from http://www.cs.unc.edu/~geom/collide/index.shtml

492

Personal Digital Assistant PDA ----Location Based  

E-Print Network [OSTI]

, xur],[ ybl, yur ]) k k=100 K k k- AminAmin kLk k Amax TmaxTmax kAminLocation Anonymization ConstraintsAmax TmaxLocation Service Quality Constraints 3.3 3.3.1 id, loc, query id loc (x,y)query GPS / l- l- k- l- k l- l l- l- m-invariant 2 29 #12;[22] A B C D E F R1 R2 R3 6 Outlier 6

493

Fast quantum algorithm for numerical gradient estimation  

E-Print Network [OSTI]

Given a blackbox for f, a smooth real scalar function of d real variables, one wants to estimate the gradient of f at a given point with n bits of precision. On a classical computer this requires a minimum of d+1 blackbox queries, whereas on a quantum computer it requires only one query regardless of d. The number of bits of precision to which f must be evaluated matches the classical requirement in the limit of large n.

Stephen P. Jordan

2005-01-02T23:59:59.000Z

494

A Unified Approach for Physically-Based Simulations and Haptic Rendering  

E-Print Network [OSTI]

Figure 1: Our new data structure, the Inner Sphere Tree, is based on sphere packings in arbitrary polygonal objects (left). They are suitable for different kinds of geometric queries, namely proximity queries (middle) and the penetration volume (right). Based on our new geometric data structure, the inner sphere trees, we present fast and stable algorithms for different kinds of collision detection queries between rigid objects at haptic rates. Namely, proximity queries and the penetration volume, which is related to the water displacement of the overlapping region and thus corresponds to a physically motivated force. The latter allows us to define a novel penalty-based collision response scheme that provides continuous forces and torques which are applicable to physically-based simulations as well as to haptic rendering scenarios. Moreover, we present a time-critical version of the penetration volume computation that is able to achieve very tight bounds within a fixed budget of query time. The main idea of our new data structure is to bound the object from the inside with a set of non-overlapping bounding volumes. The results show performance at haptic rates both for proximity and penetration volume queries, independent from the polygon count of the objects.

Rene Weller; Gabriel Zachmann

495

Identification of a reversible quantum gate: assessing the resources  

E-Print Network [OSTI]

We assess the resources needed to identify a reversible quantum gate among a finite set of alternatives, including in our analysis both deterministic and probabilistic strategies. Among the probabilistic strategies we consider unambiguous gate discrimination, where errors are not tolerated but inconclusive outcomes are allowed, and we prove that parallel strategies are sufficient to unambiguously identify the unknown gate with minimum number of queries. This result is used to provide upper and lower bounds on the query complexity and on the minimum ancilla dimension. In addition, we introduce the notion of generalized t-designs, which includes unitary t-designs and group representations as special cases. For gates forming a generalized t-design we give an explicit expression for the maximum probability of correct gate identification and we prove that there is no gap between the performances of deterministic strategies an those of probabilistic strategies. Hence, evaluating of the query complexity of perfect deterministic discrimination is reduced to the easier problem of evaluating the query complexity of unambiguous discrimination. Finally, we consider discrimination strategies where the use of ancillas is forbidden, providing upper bounds on the number of additional queries needed to make up for the lack of entanglement with the ancillas.

Giulio Chiribella; Giacomo Mauro D'Ariano; Martin Roetteler

2014-09-12T23:59:59.000Z

496

Inner Sphere Trees  

E-Print Network [OSTI]

We present a novel geometric data structure for collision detection at haptic rates between arbitrary rigid objects. Our data structure, which we call inner sphere trees, efficiently supports both proximity queries and the penetration volume. The latter is related to the water displacement of the overlapping region and, thus, corresponds to a physically motivated force. Moreover, we present a time-critical version of the penetration volume computation that is able to achieve very good estimates of the penetration volume within a fixed budget of query time. In order to build our new hierarchy, we propose to use an AI clustering algorithm, which we extend and adapt here. The results show extremely good performance of our algorithms both for proximity and penetration volume queries for models consisting

Rene Weller; Gabriel Zachmann

497

Method for localizing and isolating an errant process step  

DOE Patents [OSTI]

A method for localizing and isolating an errant process includes the steps of retrieving from a defect image database a selection of images each image having image content similar to image content extracted from a query image depicting a defect, each image in the selection having corresponding defect characterization data. A conditional probability distribution of the defect having occurred in a particular process step is derived from the defect characterization data. A process step as a highest probable source of the defect according to the derived conditional probability distribution is then identified. A method for process step defect identification includes the steps of characterizing anomalies in a product, the anomalies detected by an imaging system. A query image of a product defect is then acquired. A particular characterized anomaly is then correlated with the query image. An errant process step is then associated with the correlated image.

Tobin, Jr., Kenneth W. (Harriman, TN); Karnowski, Thomas P. (Knoxville, TN); Ferrell, Regina K. (Knoxville, TN)

2003-01-01T23:59:59.000Z

498

Geographica: A Benchmark for Geospatial RDF Stores  

E-Print Network [OSTI]

Geographica: A Benchmark for Geospatial RDF Stores George Garbis, Kostis Kyzirakos, and Manolis. Geospatial extensions of SPARQL like GeoSPARQL and stSPARQL have recently been defined and corresponding geospatial RDF stores have been implemented. However, there is no widely used bench- mark for evaluating

Koubarakis, Manolis

499

Calling on a million minds for community annotation in WikiProteins  

E-Print Network [OSTI]

search engine be case insensitive and find CLB2 based on the query term Clb2, but in a wider context, case insensitivity leads to aggravation of the ambiguity prob- lem. For example, in PubMed, the query 'Clb2' delivers papers on dental self... '. Furthermore, the authors of this abstract have used several constructs that make text mining difficult as they enter conjugate terms such as 'mitotic cyclin (Clb2)-bound Cdc28 (Cdk1 homolog)', 'Clb2-Cdc28', 'Clb2-Cdc28-phos- phorylated Swe1', 'Cdc28/Cdk1...

Mons, Barend; Ashburner, Michael; Chichester, Christine; van Mulligen, Erik; Weeber, Marc; den Dunnen, Johan T; Musen, Marc; Cockerill, Matthew; Hermjakob, Henning; Packer, Abel; Pacheco, Roberto; Lewis, Suzanna; Berkeley, Alfred; Melton, William; Barris, Nickolas; Borner, Katy; Meijssen, Gerard; Moeller, Erik; Roes, Peter Jan; Mons, Albert; van Ommen, Gert; Wales, Jimmy; Bairoch, Amos

2008-05-28T23:59:59.000Z

500

Annotated Bibliography for the DEWPOINT project  

SciTech Connect (OSTI)

This bibliography covers aspects of the Detection and Early Warning of Proliferation from Online INdicators of Threat (DEWPOINT) project including 1) data management and querying, 2) baseline and advanced methods for classifying free text, and 3) algorithms to achieve the ultimate goal of inferring intent from free text sources. Metrics for assessing the quality and correctness of classification are addressed in the second group. Data management and querying include methods for efficiently storing, indexing, searching, and organizing the data we expect to operate on within the DEWPOINT project.

Oehmen, Christopher S.

2009-04-21T23:59:59.000Z