Sample records for queries sparql queries

  1. IMPLEMENTATION OF INTENTION-DRIVEN SEARCH PROCESSES BY SPARQL QUERIES

    E-Print Network [OSTI]

    Mirbel, Isabelle

    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

  2. Advanced Query for Query Developers

    E-Print Network [OSTI]

    Shull, Kenneth R.

    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

  3. Consistent Query Answering Of Conjunctive Queries Under Primary Key Constraints

    E-Print Network [OSTI]

    Pema, Enela

    2014-01-01T23:59:59.000Z

    Queries and Primary Key Constraints . . . . . . . . . .of Employee w.r.t. the primary key SSN ? {name, salary} . .query answering under primary keys: a characterization of

  4. Query Optimization Techniques Class Hierarchies

    E-Print Network [OSTI]

    Mannheim, Universität

    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

  5. Indexing and Querying Avishek Anand

    E-Print Network [OSTI]

    Nejdl, Wolfgang

    ("spears" AND "britney") OR ("lady" AND "gaga") Phrase queries -- entire phrase present in the same order

  6. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov YouKizildere IRaghuraji Agro Industries Pvt Ltd Jump to:RoscommonSBY Solutions Jump to:SM EnvironmentalSOLvent

  7. Query Racing: Fast Completeness Certification of Query Results

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    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

  8. HYPERION/ODS MODIFYING CANNED QUERIES

    E-Print Network [OSTI]

    Suzuki, Masatsugu

    HYPERION/ODS MODIFYING CANNED QUERIES **Quick review of the Hyperion Query Pane: Sections: Where, Criteria, Views and Joins. Hyperion/ODS Modifying Canned Queries 1 #12;What Canned Queries are Available Note: Go to http://ods.binghamton.edu to view the canned query support documentation for detailed

  9. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic2 OPAM615_CostNSAR - TProcuring SolarNo. 195 -PuebloEnergy AprilQuerylQuery

  10. On Cartesian trees and range minimum queries

    E-Print Network [OSTI]

    Demaine, Erik D.

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

  11. Universit at Konstanz Query Deforestation

    E-Print Network [OSTI]

    Scholl, Marc H.

    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

  12. Top-N Query: Query Language, Distance Function and Processing Strategies

    E-Print Network [OSTI]

    Meng, Weiyi

    Top-N Query: Query Language, Distance Function and Processing Strategies Yuxi Chen, Weiyi Meng@cs.binghamton.edu Abstract. The top-N query problem is to find the N results that satisfy the query condition the best and products are sold on the Internet. This paper addresses three important issues related to the top-N query

  13. Contextual Query Using Bell Tests

    E-Print Network [OSTI]

    Joao Barros; Zeno Toffano; Youssef Meguebli; Bich-Lin Doan

    2013-09-30T23:59:59.000Z

    Tests are essential in Information Retrieval and Data Mining in order to evaluate the effectiveness of a query. An automatic measure tool intended to exhibit the meaning of words in context has been developed and linked with Quantum Theory, particularly entanglement. "Quantum like" experiments were undertaken on semantic space based on the Hyperspace Analogue Language (HAL) method. A quantum HAL model was implemented using state vectors issued from the HAL matrix and query observables, testing a wide range of windows sizes. The Bell parameter S, associating measures on two words in a document, was derived showing peaks for specific window sizes. The peaks show maximum quantum violation of the Bell inequalities and are document dependent. This new correlation measure inspired by Quantum Theory could be promising for measuring query relevance.

  14. Constrained Querying of Multimedia Databases

    E-Print Network [OSTI]

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

    2001-01-01T23:59:59.000Z

    for joining fuzzy result sets. 1.3.1. Multimedia querying The problem of searching multimedia data has received considerable attention in the last few years. The early image query systems, such as IBMs QBIC,14,15,3 MITs Photobook,16,5 the Virage system,4 etc... size size distance motion directional motion motion positional order order order length 0.1 0.3 0.6 0.5 0.5 0.50.50.50.5 Figure 3. Example of a concept representation from the sports video domain. 4. RESEARCH ISSUES In this section, we investigate...

  15. On Querying OBO Ontologies Using a DAG Pattern Query Language

    E-Print Network [OSTI]

    Gupta, Amarnath

    }@sdsc.edu Abstract. The Open Biomedical Ontologies (OBO) is a consortium that serves as a repository of ontologies and query evaluation techniques for the retrieval and manip- ulation of graph-structured data have been investigated since the late 80s [1,2], through the era of object-oriented data models [3,4,5] up to the more

  16. IT Licentiate theses Query Authentication and

    E-Print Network [OSTI]

    Flener, Pierre

    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

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

    E-Print Network [OSTI]

    Ng, Yiu-Kai Dennis

    . 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

  18. Dynamic Query Forms for Database Queries Liang Tang, Tao Li, Yexi Jiang, and Zhiyuan Chen

    E-Print Network [OSTI]

    Li, Tao

    queries on databases. However, the creation of customized queries totally depends on users' manual editing. Different from traditional document retrieval, users in database Liang Tang, Tao Li, and Yexi Jiang1 Dynamic Query Forms for Database Queries Liang Tang, Tao Li, Yexi Jiang, and Zhiyuan Chen

  19. Query Answering in Data Integration Systems

    E-Print Network [OSTI]

    Salloum, Mariam

    2011-01-01T23:59:59.000Z

    the AbeBooks.com data collection. Data Integration Systemquery plans for data integration. In Data Engineering, 2002.Recursive query plans for data integration. Journal of Logic

  20. Qunits: queried units in database search

    E-Print Network [OSTI]

    Nandi, Arnab

    2009-01-01T23:59:59.000Z

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

  1. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic2 OPAM615_CostNSAR - TProcuring SolarNo. 195 -PuebloEnergy AprilQueryl

  2. BayesDB : querying the probable implications of tabular data

    E-Print Network [OSTI]

    Baxter, Jay

    2014-01-01T23:59:59.000Z

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

  3. Reverse Top-k Queries [DRAFT VERSION

    E-Print Network [OSTI]

    Reverse Top-k Queries [DRAFT VERSION] Akrivi Vlachou # , Christos Doulkeridis # , Yannis Kotidis become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries have been mainly studied from the perspective of the user

  4. Fault Tolerant Evaluation of Continuous Selection Queries over Sensor Data

    E-Print Network [OSTI]

    Lazaridis, Iosif; Han, Qi; Mehrotra, Sharad; Venkatasubramanian, Nalini

    2009-01-01T23:59:59.000Z

    Evaluation of Continuous Selection Queries over Sensor Dataevaluation of continuous selection queries (CSQs) over sensor-sensor suffices and there is no Fault Tolerant Evaluation of

  5. REGULAR PATHS IN SPARQL: QUERYING THE NCI THESAURUS

    E-Print Network [OSTI]

    Washington at Seattle, University of

    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

  6. Classifying Web Search Queries to Identify High Revenue Generating Customers

    E-Print Network [OSTI]

    Jansen, James

    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

  7. Learning Semantic Query Suggestions Edgar Meij1

    E-Print Network [OSTI]

    de Rijke, Maarten

    Learning Semantic Query Suggestions Edgar Meij1 , Marc Bron1 , Laura Hollink2 , Bouke Huurnink1 , and Maarten de Rijke1 1 ISLA, University of Amsterdam, Science Park 107, 1098 XG Amsterdam {edgar

  8. Querying Schemas With Access Restrictions

    E-Print Network [OSTI]

    Benedikt, Michael; Ley, Clemens

    2012-01-01T23:59:59.000Z

    We study verification of systems whose transitions consist of accesses to a Web-based data-source. An access is a lookup on a relation within a relational database, fixing values for a set of positions in the relation. For example, a transition can represent access to a Web form, where the user is restricted to filling in values for a particular set of fields. We look at verifying properties of a schema describing the possible accesses of such a system. We present a language where one can describe the properties of an access path, and also specify additional restrictions on accesses that are enforced by the schema. Our main property language, AccLTL, is based on a first-order extension of linear-time temporal logic, interpreting access paths as sequences of relational structures. We also present a lower-level automaton model, Aautomata, which AccLTL specifications can compile into. We show that AccLTL and A-automata can express static analysis problems related to "querying with limited access patterns" that h...

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

    E-Print Network [OSTI]

    Jansen, James

    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

  10. Query Plans for Conventional and Temporal Queries Involving Duplicates and Ordering

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    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

  11. Query optimization in nested relational databases

    E-Print Network [OSTI]

    Rathakrishnan, Balaji

    1992-01-01T23:59:59.000Z

    120 75 Fig. 5. Example for nest 20 this does not apply to nests involving multiple attributes [5]. 3. An unnest operator is an inverse of the nest operator. That is, p[&'](~[&'= &](ff)) = & 4. A nest operator is not always an inverse... IV THE EXTENDED RECURSIVE ALGEBRA . A. The algebra 1 2 3 4 16 16 16 16 18 20 22 24 24 27 28 29 29 34 39 43 44 44 CHAPTER Page V QUERY OPTIMIZATION IN RELATIONAL DATABASES . . 54 A. Steps in query processing . B. Algebraic...

  12. Query-based database policy assurance using semantic web technologies

    E-Print Network [OSTI]

    Soltren, Jos Hiram

    2009-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Prasanna, Viktor K.

    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

  14. On the Equivalence of Distributed Systems with Queries and Communication$

    E-Print Network [OSTI]

    Paris-Sud XI, Universit de

    On the Equivalence of Distributed Systems with Queries and Communication$ Serge Abiteboula , Balder a common goal, such as eval- uating some query. We study the equivalence of such systems. We model for performing tasks such as sending, receiving and querying data. As our model is quite general, the equivalence

  15. On the Equivalence of Distributed Systems with Queries and Communication

    E-Print Network [OSTI]

    Paris-Sud XI, Universit de

    On the Equivalence of Distributed Systems with Queries and Communication Serge Abiteboul INRIA, such as evaluate some query. We study the equivalence of such systems. We model a dis- tributed system such as sending, receiving and querying data. As our model is quite general, the equivalence problem turns out

  16. Roadmap Query for Sensor Network Assisted Navigation in Dynamic Environments

    E-Print Network [OSTI]

    Lu, Chenyang

    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

  17. Asymmetric Structure-Preserving Subgraph Queries for Large Graphs

    E-Print Network [OSTI]

    Choi, Byron "Koon Kau"

    Asymmetric Structure-Preserving Subgraph Queries for Large Graphs Zhe Fan1 Byron Choi1 Jianliang Xu the novel cyclic group based encryption so that query processing is transformed into a series of private are effective. I. INTRODUCTION Subgraph queries (via subgraph isomorphism) are a fun- damental and powerful

  18. A Study of Query Length Avi Arampatzis1

    E-Print Network [OSTI]

    Arampatzis, Avi

    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

  19. A Simple Model for Classifying Web Queries by User Intent

    E-Print Network [OSTI]

    Rosso, Paolo

    Valncia, Spain 3 NLE Lab.- ELiRF, Universitat Politcnica de Valncia, 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

  20. Query Suggestions for Mobile Search: Understanding Usage Patterns

    E-Print Network [OSTI]

    Tomkins, Andrew

    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

  1. XQzip: Querying Compressed XML Using Structural Indexing

    E-Print Network [OSTI]

    Ng, Wilfred Siu Hung

    effective XML compressors, such as XMill, have been recently proposed to solve this data inflation problem years, many XML compressors have been proposed to solve this data inflation problem. There are two types, they do not address the problem of running queries on com- pressed XML data. More recently, some

  2. Query Deforestation Torsten Grust Marc H. Scholl

    E-Print Network [OSTI]

    Grust, Torsten

    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

  3. Variable Interactions in Query-Driven Visualization

    SciTech Connect (OSTI)

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

    2007-10-25T23:59:59.000Z

    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.

  4. Query-Efficient Locally Decodable Codes of Subexponential Length

    E-Print Network [OSTI]

    Chee, Yeow Meng; Ling, San; Wang, Huaxiong; Zhang, Liang Feng

    2010-01-01T23:59:59.000Z

    We develop the algebraic theory behind the constructions of Yekhanin (2008) and Efremenko (2009), in an attempt to understand the ``algebraic niceness'' phenomenon in $\\mathbb{Z}_m$. We show that every integer $m = pq = 2^t -1$, where $p$, $q$ and $t$ are prime, possesses the same good algebraic property as $m=511$ that allows savings in query complexity. We identify 50 numbers of this form by computer search, which together with 511, are then applied to gain improvements on query complexity via Itoh and Suzuki's composition method. More precisely, we construct a $3^{\\lceil r/2\\rceil}$-query LDC for every positive integer $rLDC for every integer $r\\geq 104$, both of length $N_{r}$, improving the $2^r$ queries used by Efremenko (2009) and $3\\cdot 2^{r-2}$ queries used by Itoh and Suzuki (2010). We also obtain new efficient private information retrieval (PIR) schemes from the new query-efficient LDCs.

  5. assisted query reformulation: Topics by E-print Network

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

    Summary: Terms Algorithms, Human Factors, Design Keywords Automatic Query Expansion, Search Behavior, 1 children may make. Most of the search engines offer only the possibility...

  6. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directedAnnualProperty Edit withTianlinPapersWindey Wind GeneratingZhongshengZiboZongshenask queries Home

  7. HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets UsingFast Bitmap Indices

    SciTech Connect (OSTI)

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

    2005-12-07T23:59:59.000Z

    Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user community since they provide multi-dimensional storage and retrieval. However, one of the drawbacks of these storage formats is that they do not support semantic indexing which is important for interactive data analysis where scientists look for features of interests such as ''Find all supernova explosions where energy >105 and temperature >106''. In this paper we present a novel approach called HDF5-FastQuery to accelerate the data access of large HDF5 files by introducing multi-dimensional semantic indexing. Our implementation leverages an efficient indexing technology called ''bitmapindexing'' that has been widely used in the database community. Bitmapindices are especially well suited for interactive exploration of large-scale read-only data. Storing the bitmap indices into the HDF5 file has the following advantages: (a) Significant performance speedup of accessing subsets of multi-dimensional data and (b) portability of the indices across multiple computer platforms. We will present an API that simplifies the execution of queries on HDF5 files for general scientific applications and data analysis. The design is flexible enough to accommodate the use of arbitrary indexing technology for semantic range queries. We will also provide a detailed performance analysis of HDF5-FastQuery for both synthetic and scientific data. The results demonstrate that our proposed approach for multi-dimensional queries is up to a factor of 2 faster than HDF5.

  8. HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets usingFast Bitmap Indices

    SciTech Connect (OSTI)

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

    2006-03-30T23:59:59.000Z

    Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user community since they provide multi-dimensional storage and retrieval. However, one of the drawbacks of these storage formats is that they do not support semantic indexing which is important for interactive data analysis where scientists look for features of interests such as ''Find all supernova explosions where energy > 10{sup 5} and temperature > 10{sup 6}''. In this paper we present a novel approach called HDF5-FastQuery to accelerate the data access of large HDF5 files by introducing multi-dimensional semantic indexing. Our implementation leverages an efficient indexing technology called bitmap indexing that has been widely used in the database community. Bitmap indices are especially well suited for interactive exploration of large-scale read only data. Storing the bitmap indices into the HDF5 file has the following advantages: (a) Significant performance speedup of accessing subsets of multi-dimensional data and (b) portability of the indices across multiple computer platforms. We will present an API that simplifies the execution of queries on HDF5 files for general scientific applications and data analysis. The design is flexible enough to accommodate the use of arbitrary indexing technology for semantic range queries. We will also provide a detailed performance analysis of HDF5-FastQuery for both synthetic and scientific data. The results demonstrate that our proposed approach for multi-dimensional queries is up to a factor of 2 faster than HDF5.

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

  10. Declarative Network Monitoring with an Underprovisioned Query Processor Frederick Reiss

    E-Print Network [OSTI]

    California at Irvine, University of

    interest in bringing the power of declarative queries to passive network monitors [8, 15]. Declar- ative network monitoring setup. real-time data on the status of their networks, network moni- tors need, or parallel hardware [29]. Other systems construct queries by connecting blocks of highly-optimized special

  11. A NOVEL MULTIMEDIA RETRIEVAL TECHNIQUE: PROGRESSIVE QUERY (WHY WAIT?)

    E-Print Network [OSTI]

    Gabbouj, Moncef

    A NOVEL MULTIMEDIA RETRIEVAL TECHNIQUE: PROGRESSIVE QUERY (WHY WAIT?) Serkan Kiranyaz and Moncef@cs.tut.fi, moncef.gabbouj@tut.fi ABSTRACT One of the challenges in the development of content-based multimedia who are accustomed to making queries and thus retrieving any multimedia item from a large scale

  12. Multimedia reporting: building multimedia presentations with query answers

    E-Print Network [OSTI]

    Celentano, Augusto

    Multimedia reporting: building multimedia presentations with query answers Augusto Celentano,ogaggi}@dsi.unive.it Abstract. A multimedia report is a multimedia presentation which integrates data returned by one or more queries to a multimedia database, thus extending the concept of report familiar in traditional structured

  13. Fuzzy Queries in Multimedia Database Systems Ronald Fagin

    E-Print Network [OSTI]

    Fagin, Ron

    Fuzzy Queries in Multimedia Database Systems Ronald Fagin IBM Almaden Research Center Sati Jose, CA differencesbetween multimedia databases (which may contain complicated objects, such as images), and traditional typos of queries. Wr example, in a multimedia databaseit is reasonable and natural to ask for images

  14. Data Models and Query Languages for Linked Geospatial Data

    E-Print Network [OSTI]

    Koubarakis, Manolis

    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

  15. Comp 5311 Database Management Systems 4. Structured Query Language

    E-Print Network [OSTI]

    Papadias, Dimitris

    ;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

  16. On Efficient Matching of Streaming XML Documents and Queries

    E-Print Network [OSTI]

    Lakshmanan, Laks V.S.

    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

  17. Glacier: A Query-to-Hardware Compiler Rene Mueller

    E-Print Network [OSTI]

    Teubner, Jens

    Glacier: A Query-to-Hardware Compiler Rene Mueller rene.mueller@inf.ethz.ch Jens Teubner jens systems. In this demonstration we show Glacier, a library and a compiler that can be employed to implement streaming queries as hardware circuits on FPGAs. Glacier consists of a library of compositional hardware

  18. Approximate Querying in Wireless Sensor Networks Yuzhen Liu Weifa Liang

    E-Print Network [OSTI]

    Liang, Weifa

    of queries in such a database efficiently and effectively. To reduce the energy consumption in sensor Science Australian National University Canberra, ACT 0200, Australia Abstract-In this paper, we study. We build a series of nearly optimal representative routing trees for query evaluation, where

  19. Efficient Complex Query Support for Multiversion XML Documents

    E-Print Network [OSTI]

    Zhang, Donghui

    in supporting complex queries on XML data (e.g., regular path expressions, structural projections, DIFF queries-0070135, IIS-9907477, EIA- 9983445, and the Department of Defense. #12;ideal solution is a version on their repositories of multiversion documents. Specialty warehouses and archives that monitor and collect content from

  20. View-Based Query Processing: On the Relationship Between Rewriting,

    E-Print Network [OSTI]

    Calvanese, Diego

    amounts to computing the tuples satisfying the query in all databases consistent with the views. Rewriting in the setting of semistructured databases, and in particular for the basic query class in this setting, i-0311326, IIS-9908435, IIS-9978135, EIA-0086264, and ANI-0216467, by US-Israel BSF grant 9800096, by Texas

  1. Managing and Querying Transaction-time Databases under Schema Evolution

    E-Print Network [OSTI]

    Zaniolo, Carlo

    Managing and Querying Transaction-time Databases under Schema Evolution Hyun J. Moon UCLA hjmoon of a relational database in XML, whereby the evolution of the schema and its underly- ing database are given is that schema evolution is transparent to the user: she writes queries against the current schema while

  2. A Foundation for Conventional and Temporal Query Optimization

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    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

  3. Indexing and Querying XML Data for Regular Path Expressions

    E-Print Network [OSTI]

    Moon, Bongki

    by generating interactive site maps [19]. To retrieve XML and semi-structured data, several query languages have of XML data sources from docu- ments to databases and object repositories. The common featuresIndexing and Querying XML Data for Regular Path Expressions £ Quanzhong Li Bongki Moon Dept

  4. Energy-Efficient Aggregate Query Evaluation in Sensor Networks

    E-Print Network [OSTI]

    Liang, Weifa

    Energy-Efficient Aggregate Query Evaluation in Sensor Networks Zhuoyuan Tu and Weifa Liang efficiently. This paper considers the aggregate query evaluation in a sensor network database to the base station, which is called in-network aggregation. In other words, a tree rooted at the base station

  5. Compressed bitmap indices for efficient query processing

    SciTech Connect (OSTI)

    Wu, Kesheng; Otoo, Ekow; Shoshani, Arie

    2001-09-30T23:59:59.000Z

    Many database applications make extensive use of bitmap indexing schemes. In this paper, we study how to improve the efficiencies of these indexing schemes by proposing new compression schemes for the bitmaps. Most compression schemes are designed primarily to achieve good compression. During query processing they can be orders of magnitude slower than their uncompressed counterparts. The new schemes are designed to bridge this performance gap by reducing compression effectiveness and improving operation speed. In a number of tests on both synthetic data and real application data, we found that the new schemes significantly outperform the well-known compression schemes while using only modestly more space. For example, compared to the Byte-aligned Bitmap Code, the new schemes are 12 times faster and it uses only 50 percent more space. The new schemes use much less space(<30 percent) than the uncompressed scheme and are faster in a majority of the test cases.

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

    E-Print Network [OSTI]

    Tomkins, Andrew

    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

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

    E-Print Network [OSTI]

    Risch, Tore

    producing Higgs bosons [18] by applying scientific theories expressed as cuts. These complex queries need

  8. Secure quantum private information retrieval using phase-encoded queries

    E-Print Network [OSTI]

    Olejnik, L

    2011-01-01T23:59:59.000Z

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

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

  10. CUCS00400 Automatic Classification of Text Databases Through Query Probing

    E-Print Network [OSTI]

    and focused results than when searching a more general text database. Other services (e.g., Copernic 3://www.searchengineguide.com/ 3 http://www.copernic.com/ 1 #12; databases with queries to determine an approximation

  11. Consumer Query Health Profile Saint Alphonsus Regional Medical Center

    E-Print Network [OSTI]

    Barrash, Warren

    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

  12. Query-Driven Visualization and Analysis

    SciTech Connect (OSTI)

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

    2012-11-01T23:59:59.000Z

    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.

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

    SciTech Connect (OSTI)

    Wu, Jerry; Wu, Kesheng

    2011-04-18T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Shamos, Michael I.

    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

  15. Parallel Index and Query for Large Scale Data Analysis

    SciTech Connect (OSTI)

    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

    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.

  16. Implementing measurements and optimizing queries for the quantum hidden subgroup problem

    E-Print Network [OSTI]

    Shakeel, Asif

    2011-01-01T23:59:59.000Z

    we will refer to as the slate of the query. Let us writeand arbitrary in the slate (state of the response registera character query: its slate is a particular character of

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

    E-Print Network [OSTI]

    Setiono, Rudy

    ;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

  18. TreeQ-VISTA: An Interactive Tree Visualization Tool with Functional Annotation Query Capabilities

    E-Print Network [OSTI]

    2007-01-01T23:59:59.000Z

    TreeQ-VISTA: An Interactive Tree Visualization Tool withto-use multiplatform interactive tool designed for querying

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

    E-Print Network [OSTI]

    Demirbas, Murat

    -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

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

    E-Print Network [OSTI]

    Demirbas, Murat

    -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

  1. Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries

    E-Print Network [OSTI]

    Kambhampati, Subbarao

    . 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

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

    E-Print Network [OSTI]

    Agrawal, Gagan

    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

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

    E-Print Network [OSTI]

    Jansen, James

    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

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

    E-Print Network [OSTI]

    Wong, Limsoon

    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 freetext search: (1

  5. A SingleQuery BiDirectional Probabilistic Roadmap Planner with Lazy Collision Checking

    E-Print Network [OSTI]

    LaValle, Steven M.

    1 A SingleQuery BiDirectional Probabilistic Roadmap Planner with Lazy Collision Checking Gildardo probabilistic roadmap (PRM) planner that is: singlequery --it does not precompute a roadmap, but uses the two the robot's free space by concurrently building a roadmap made of two trees rooted at the query

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

    E-Print Network [OSTI]

    Hiemstra, Djoerd

    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

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

  8. Secure quantum private information retrieval using phase-encoded queries

    SciTech Connect (OSTI)

    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

    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.

  9. Privacy-preserving Queries over Relational Databases Femi Olumofin

    E-Print Network [OSTI]

    Goldberg, Ian

    @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

  10. Public Key Encryption that Allows PIR Queries Eyal Kushilevitz

    E-Print Network [OSTI]

    Ostrovsky, Rafail

    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

  11. Taxonomy and synthesis of Web services querying languages

    E-Print Network [OSTI]

    Bitar, Ibrahim El; Roudies, Ounsa

    2012-01-01T23:59:59.000Z

    Most works on Web services has focused on discovery, composition and selection processes of these kinds of services. Other few works were interested in how to represent Web services search queries. However, these queries cannot be processed by ensuring a high level of performance without being adequately represented first. To this end, different query languages were designed. Even so, in the absence of a standard, these languages are quite various. Their diversity makes it difficult choosing the most suitable language. In fact, this language should be able to cover all types of preferences or requirements of clients such as their functional, nonfunctional,temporal or even specific constraints as is the case of geographical or spatial constraints and meet their needs and preferences helping to provide them the best answer. It must also be mutually simple and imposes no restrictions or at least not too many constraints in terms of prior knowledge to use and also provide a formal or semi-formal queries presentat...

  12. DATA CONCERN AWARE QUERYING FOR THE INTEGRATION OF DATA SERVICES

    E-Print Network [OSTI]

    Dustdar, Schahram

    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

  13. Facilitating Document Annotation using Content and Querying Value

    E-Print Network [OSTI]

    Hristidis, Vagelis

    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

  14. DBDOC: Querying and Browsing Databases and Interrelated Documents

    E-Print Network [OSTI]

    Ordonez, Carlos

    ]: 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

  15. From Structured Documents to Novel Query Facilities \\Lambda

    E-Print Network [OSTI]

    Abiteboul, Serge

    ) 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

  16. PET: Reducing Database Energy Cost via Query Optimization

    E-Print Network [OSTI]

    Tu, Yicheng

    PET: Reducing Database Energy Cost via Query Optimization Zichen Xu The Ohio State University xuz@ece.osu.edu Yi-Cheng Tu The University of South Florida ytu@cse.usf.edu Xiaorui Wang The Ohio State University xwang@ece.osu.edu ABSTRACT Energy conservation is a growing important issue in designing mod- ern

  17. A New ClientServer Architecture for Distributed Query Processing

    E-Print Network [OSTI]

    with an essentially ``free'' backward reduction capability is proposed. We explore in detail the benefits and costsA New ClientServer Architecture for Distributed Query Processing Zhe Li Kenneth A. Ross Computer Science Department Computer Science Department Columbia University Columbia University New York, NY 10027

  18. Multi-Query Feedback Motion Planning with LQR-Roadmaps

    E-Print Network [OSTI]

    Jackson, Daniel

    Multi-Query Feedback Motion Planning with LQR-Roadmaps Anirudha Majumdar School of Engineering "roadmap", with each segment representing a locally optimal trajectory of the system and a continuous) - and for parameterized finite-time invariance around a trajectory, as well as a "roadmap" construction al- gorithm

  19. 0 500 1000 1500 2000 2500 3000 UniqueQueries(%)

    E-Print Network [OSTI]

    Albrecht, Jeannie

    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

  20. Towards Efficient Query Processing on Massive Time-Evolving Graphs

    E-Print Network [OSTI]

    Miller, John A.

    Email: {ar, ara, laks, jam}@cs.uga.edu Abstract--Time evolving graph (TEG) is increasingly being used on massive TEGs is central to building powerful analytic applications for these domains. Unfortunately effective for processing massive TEGs. Towards designing scalable mechanisms for answering TEG queries

  1. STQL --A SPATIO-TEMPORAL QUERY LANGUAGE Martin Erwig

    E-Print Network [OSTI]

    Erwig, Martin

    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

  2. Adaptable Query Optimization and Evaluation in Temporal Middleware

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    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

  3. The Michigan Benchmark: A Microbenchmark for XML Query Processing Systems

    E-Print Network [OSTI]

    Runapongsa, Kanda

    The Michigan Benchmark: A Microbenchmark for XML Query Processing Systems Kanda Runapongsa Jignesh The University of Michigan, Ann Arbor, MI 48109, USA krunapon, jignesh, jag, shurug @eecs is called the Michigan benchmark. In the Michigan benchmark, we primarily attempt to capture the rich

  4. Accelerating Network Traffic Analytics Using Query-DrivenVisualization

    SciTech Connect (OSTI)

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

    2006-07-29T23:59:59.000Z

    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.

  5. Context-Aware Query Classification Huanhuan Cao1

    E-Print Network [OSTI]

    Yang, Qiang

    Context-Aware Query Classification Huanhuan Cao1 Derek Hao Hu2 Dou Shen3 Daxin Jiang4 Jian-Tao Sun {derekhh, qyang}@cse.ust.hk 3,4 {doushen, djiang, jtsun}@microsoft.com ABSTRACT Understanding users' search become one of the most popular tools for Web users to find their desired information. As a result

  6. SMALL PCPS WITH LOW QUERY Prahladh Harsha and Madhu Sudan

    E-Print Network [OSTI]

    Harsha, Prahladh

    SMALL PCPS WITH LOW QUERY COMPLEXITY Prahladh Harsha and Madhu Sudan Abstract. Most known. #12; 2 Harsha & Sudan Subsequently much success has been achieved in improving the parameters of PCPs of Friedl & Sudan (1995), who indicate that NP has PCPs with nearly quadratic size complexity and in which

  7. SMALL PCPS WITH LOW QUERY Prahladh Harsha and Madhu Sudan

    E-Print Network [OSTI]

    Sudan, Madhu

    SMALL PCPS WITH LOW QUERY COMPLEXITY Prahladh Harsha and Madhu Sudan Abstract. Most known;2 Harsha & Sudan Subsequently much success has been achieved in improving the parameters of PCPs of Friedl & Sudan (1995), who indicate that NP has PCPs with nearly quadratic size complexity and in which

  8. Indexing Distributed Complex Data for Complex Queries Egemen Tanin

    E-Print Network [OSTI]

    Samet, Hanan

    of the Digital Government, databases can use many ideas from this domain for scalable exchange of data are fundamental to many data management systems. Their mechanisms heavily rely on creating globally known mappingsIndexing Distributed Complex Data for Complex Queries Egemen Tanin Department of Computer Science

  9. Answering SPARQL Queries over Databases and under OWL 2 QL Entailment Regime

    E-Print Network [OSTI]

    Zakharyaschev, Michael

    of Computer Science and Information Systems, Birkbeck, University of London, U.K. 2 Faculty of Computer Science, Free University of Bozen-Bolzano, Italy 3 IBM T.J. Watson Research Center, Yorktown Heights, NY have been implemented in both academia and industry; e.g., [26,29,23,3,22,14,11,7,19,21]. Most of them

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

    E-Print Network [OSTI]

    Boughamoura, Radhouane; Omri, Mohamed Nazih

    2012-01-01T23:59:59.000Z

    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.

  11. Flexible quantum private queries based on quantum key distribution

    E-Print Network [OSTI]

    Fei Gao; Bin Liu; Qiao-Yan Wen; Hui Chen

    2011-11-07T23:59:59.000Z

    We present a flexible quantum-key-distribution-based protocol for quantum private queries. Similar to M. Jakobi et al's protocol [Phys. Rev. A 83, 022301 (2011)], it is loss tolerant, practical and robust against quantum memory attack. Furthermore, our protocol is more flexible and controllable. We show that, by adjusting the value of $\\theta$, the average number of the key bits Alice obtains can be located on any fixed value the users wanted for any database size. And the parameter $k$ is generally smaller (even $k=1$ can be achieved) when $\\theta<\\pi/4$, which implies lower complexity of both quantum and classical communications. Furthermore, the users can choose a smaller $\\theta$ to get better database security, or a larger $\\theta$ to obtain a lower probability with which Bob can correctly guess the address of Alice's query.

  12. ObjectGlobe: Ubiquitous Query Processing on the Internet

    E-Print Network [OSTI]

    Kemper, Alfons

    for scalable Internet applications, such as business-to-business (B2B) e-commerce systems like SAP's "mySAP capabilities. The goal of the ObjectGlobe project is to establish an open market place in which data and query on the Internet. One of the main challenges in the design of such an open system is to ensure privacy and security

  13. FastQuery: A Parallel Indexing System for Scientific Data

    SciTech Connect (OSTI)

    Chou, Jerry; Wu, Kesheng; Prabhat,

    2011-07-29T23:59:59.000Z

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

  14. QCS: a system for querying, clustering and summarizing documents.

    SciTech Connect (OSTI)

    Dunlavy, Daniel M.; Schlesinger, Judith D. (Center for Computing Sciences, Bowie, MD); O'Leary, Dianne P. (University of Maryland, College Park, MD); Conroy, John M. (Center for Computing Sciences, Bowie, MD)

    2006-10-01T23:59:59.000Z

    Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel hybrid information retrieval system--the Query, Cluster, Summarize (QCS) system--which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of components in the QCS design improves retrievals by providing users more focused information organized by topic. We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) along with the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines. Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence 'trimming', and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format. Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of the design, and the value of this particular combination of modules.

  15. Tractable hypergraph properties for constraint satisfaction and conjunctive queries

    E-Print Network [OSTI]

    Marx, Dniel

    2009-01-01T23:59:59.000Z

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

  16. Large-Scale Continuous Subgraph Queries on Streams

    SciTech Connect (OSTI)

    Choudhury, Sutanay; Holder, Larry; Chin, George; Feo, John T.

    2011-11-30T23:59:59.000Z

    Graph pattern matching involves finding exact or approximate matches for a query subgraph in a larger graph. It has been studied extensively and has strong applications in domains such as computer vision, computational biology, social networks, security and finance. The problem of exact graph pattern matching is often described in terms of subgraph isomorphism which is NP-complete. The exponential growth in streaming data from online social networks, news and video streams and the continual need for situational awareness motivates a solution for finding patterns in streaming updates. This is also the prime driver for the real-time analytics market. Development of incremental algorithms for graph pattern matching on streaming inputs to a continually evolving graph is a nascent area of research. Some of the challenges associated with this problem are the same as found in continuous query (CQ) evaluation on streaming databases. This paper reviews some of the representative work from the exhaustively researched field of CQ systems and identifies important semantics, constraints and architectural features that are also appropriate for HPC systems performing real-time graph analytics. For each of these features we present a brief discussion of the challenge encountered in the database realm, the approach to the solution and state their relevance in a high-performance, streaming graph processing framework.

  17. Web search queries can predict stock market volumes

    E-Print Network [OSTI]

    Bordino, Ilaria; Caldarelli, Guido; Cristelli, Matthieu; Ukkonen, Antti; Weber, Ingmar

    2011-01-01T23:59:59.000Z

    We live in a computerized and networked society where many of our actions leave a digital trace and affect other people's actions. This has lead to the emergence of a new data-driven research field: mathematical methods of computer science, statistical physics and sociometry provide insights on a wide range of disciplines ranging from social science to human mobility. A recent important discovery is that query volumes (i.e., the number of requests submitted by users to search engines on the www) can be used to track and, in some cases, to anticipate the dynamics of social phenomena. Successful exemples include unemployment levels, car and home sales, and epidemics spreading. Few recent works applied this approach to stock prices and market sentiment. However, it remains unclear if trends in financial markets can be anticipated by the collective wisdom of on-line users on the web. Here we show that trading volumes of stocks traded in NASDAQ-100 are correlated with the volumes of queries related to the same sto...

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

    E-Print Network [OSTI]

    Prasanna, Viktor K.

    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

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

    E-Print Network [OSTI]

    Devanbu, Prem

    , 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

  20. TQuEST: Threshold Query Execution for Large Sets of Time Series

    E-Print Network [OSTI]

    Kriegel, Hans-Peter

    TQuEST: Threshold Query Execution for Large Sets of Time Series Johannes A?falg, Hans-Peter Kriegel TQuEST, a powerful query processor for time series databases. TQuEST supports a novel but very useful times. 1 Introduction In this paper, we present TQuEST, a powerful analysis tool for time series

  1. Join Synopses for Approximate Query Answering Swarup Acharya Phillip B. Gibbons Viswanath Poosala Sridhar Ramaswamy

    E-Print Network [OSTI]

    Gibbons, Phillip B.

    optimizer to estimate plan costs; such an application demands very fast response times but not exact answers to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full solely on providing exact answers to queries, in a manner that seeks to minimize response time

  2. Figure 1. IDVL interface showing 12 documents returned for "El Nio" query along with different multimedia

    E-Print Network [OSTI]

    Wactlar, Howard D.

    to evaluate them. We aggregate and integrate video content on-demand to enable summarization and visualization that provides the users with coherent responses to their queries in a useful broader context, perhaps library, i.e., metadata, to return a set of video documents in response to a user query, as shown

  3. Query Planning for Searching Inter-Dependent Deep-web Databases

    E-Print Network [OSTI]

    Agrawal, Gagan

    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

  4. Query Planning for Searching Inter-dependent Deep-Web Databases

    E-Print Network [OSTI]

    Jin, Ruoming

    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

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

    E-Print Network [OSTI]

    Jansen, James

    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

  6. Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps

    E-Print Network [OSTI]

    Kavraki, Lydia E.

    Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps Mert Akinc sample-based method primarily designed for multiple query planning (the Probabilistic Roadmap Method the Probabilistic Roadmap of Trees (PRT), uses a tree algorithm as a subroutine for PRM. The nodes of the PRM

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

    E-Print Network [OSTI]

    Patel, Jignesh

    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

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

    E-Print Network [OSTI]

    Hellerstein, Lisa

    ­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

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

    E-Print Network [OSTI]

    Ricci, Laura

    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

  10. Submitted EDBT 2002, paper ID: 239 Ecient Complex Query Support for Multiversion XML Documents

    E-Print Network [OSTI]

    Tsotras, Vassilis J.

    recent interest in supporting complex queries on XML data (e.g., regular path expressions, structural, Riverside, CA 92521. tsotras@cs.ucr.edu. This work was partially supported by NSF grants IIS-9907477, EIA and queries on their repositories of multiversion documents. Specialty warehouses and archives that monitor

  11. Integrating and Querying Source Code of Programs Working on a Database

    E-Print Network [OSTI]

    Ordonez, Carlos

    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

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

    E-Print Network [OSTI]

    Libre de Bruxelles, Université

    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

  13. Peer-to-Peer Spatial Queries in Sensor Networks Murat Demirbas Hakan Ferhatosmanoglu

    E-Print Network [OSTI]

    Demirbas, Murat

    .ohio-state.edu Abstract Sensor networks, that consist of potentially several thou- sands of nodes each with sensing (heat for monitoring spatial information about a region of interest. Although spatial query execution has been studied. For achieving minimal energy consumption and minimal response time, our query processing model en- sures

  14. PeertoPeer Spatial Queries in Sensor Networks Murat Demirbas Hakan Ferhatosmanoglu

    E-Print Network [OSTI]

    Demirbas, Murat

    ,hakang@cis.ohiostate.edu Abstract Sensor networks, that consist of potentially several thou sands of nodes each with sensing (heat for monitoring spatial information about a region of interest. Although spatial query execution has been studied. For achieving minimal energy consumption and minimal response time, our query processing model en sures

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

    E-Print Network [OSTI]

    Loo, Boon Thau

    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

  16. Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing

    E-Print Network [OSTI]

    Hou, Y. Thomas

    Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing Ning Cao, Zhenyu, Chicago, IL 60616 Email: {cong, kren}@ece.iit.edu Abstract-- In the emerging cloud computing paradigm of privacy-preserving query over encrypted graph-structured data in cloud computing (PPGQ), and establish

  17. Localization in indoor environments by querying omnidirectional visual maps using perspective images

    E-Print Network [OSTI]

    Barreto, Joao

    , not only speeds up the process of acquiring data for creating the map, but also favors scalabilityLocalization in indoor environments by querying omnidirectional visual maps using perspective. The localization is achieved by querying a database of omnidirectional images that constitutes a detailed visual

  18. Joint Video and Text Parsing for Understanding Events and Answering Queries

    E-Print Network [OSTI]

    Zhu, Song Chun

    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

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

    E-Print Network [OSTI]

    Liu, Bing

    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

  20. Private Database Queries Using Quantum States with Limited Coherence Times

    E-Print Network [OSTI]

    Tad Hogg; Li Zhang

    2009-03-31T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

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

    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.

  2. Top-K Queries on Uncertain Data: On Score Distribution and Typical Answers

    E-Print Network [OSTI]

    Ge, Tingjian

    2009-01-01T23:59:59.000Z

    Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important tool for exploring large uncertain data ...

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

  4. A Semantic Perspective on Query Log Analysis Katja Hofmann Maarten de Rijke Bouke Huurnink Edgar Meij

    E-Print Network [OSTI]

    de Rijke, Maarten

    A Semantic Perspective on Query Log Analysis Katja Hofmann Maarten de Rijke Bouke Huurnink Edgar Meij ISLA, University of Amsterdam k.hofmann@uva.nl, mdr@science.uva.nl bhuurnink@uva.nl, edgar

  5. Using Bitmap Indexing Technology for Combined Numerical and TextQueries

    SciTech Connect (OSTI)

    Stockinger, Kurt; Cieslewicz, John; Wu, Kesheng; Rotem, Doron; Shoshani, Arie

    2006-10-16T23:59:59.000Z

    In this paper, we describe a strategy of using compressedbitmap indices to speed up queries on both numerical data and textdocuments. By using an efficient compression algorithm, these compressedbitmap indices are compact even for indices with millions of distinctterms. Moreover, bitmap indices can be used very efficiently to answerBoolean queries over text documents involving multiple query terms.Existing inverted indices for text searches are usually inefficient forcorpora with a very large number of terms as well as for queriesinvolving a large number of hits. We demonstrate that our compressedbitmap index technology overcomes both of those short-comings. In aperformance comparison against a commonly used database system, ourindices answer queries 30 times faster on average. To provide full SQLsupport, we integrated our indexing software, called FastBit, withMonetDB. The integrated system MonetDB/FastBit provides not onlyefficient searches on a single table as FastBit does, but also answersjoin queries efficiently. Furthermore, MonetDB/FastBit also provides avery efficient retrieval mechanism of result records.

  6. An Application of Multivariate Statistical Analysis for Query-Driven Visualization

    SciTech Connect (OSTI)

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

    2010-03-01T23:59:59.000Z

    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.

  7. QuerySpaces on Hadoop for the ATLAS EventIndex

    E-Print Network [OSTI]

    Hrivnac, Julius; The ATLAS collaboration; Cranshaw, Jack; Glasman, Claudia; Favareto, Andrea; Prokoshin, Fedor

    2015-01-01T23:59:59.000Z

    Hadoop-based implementation of the adaptive query engine serving as the back-end for the ATLAS EventIndex. The QuerySpaces implementation handles both original data and search results providing fast and efficient mechanisms for new user queries using already accumulated knowledge for optimisation. Detailed description and statistics about user requests are collected in HBase tables and HDFS files. Requests are associated to their results and a graph of relations between them is created to be used to find the most efficient way of providing answers to new requests The environment is completely transparent to users and is accessible over several command-line interfaces, a Web Service and a programming API.

  8. QuerySpaces on Hadoop for the ATLAS EventIndex

    E-Print Network [OSTI]

    Hrivnac, Julius; The ATLAS collaboration; Cranshaw, Jack; Favareto, Andrea; Prokoshin, Fedor; Glasman, Claudia; Toebbicke, Rainer

    2015-01-01T23:59:59.000Z

    A Hadoop-based implementation of the adaptive query engine serving as the back-end for the ATLAS EventIndex. The QuerySpaces implementation handles both original data and search results providing fast and efficient mechanisms for new user queries using already accumulated knowledge for optimization. Detailed descriptions and statistics about user requests are collected in HBase tables and HDFS files. Requests are associated to their results and a graph of relations between them is created to be used to find the most efficient way of providing answers to new requests The environment is completely transparent to users and is accessible over several command-line interfaces, a Web Service and a programming API.

  9. Query complexity for searching multiple marked states from an unsorted database

    E-Print Network [OSTI]

    Bin Shang

    2006-04-10T23:59:59.000Z

    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.

  10. DMQL: A Data Mining Query Language for Relational Databases \\Lambda Jiawei Han Yongjian Fu Wei Wang Krzysztof Koperski Osmar Zaiane

    E-Print Network [OSTI]

    Fu, Yongjian

    DMQL: A Data Mining Query Language for Relational Databases \\Lambda Jiawei Han Yongjian Fu Wei Wang@cs.sfu.ca Abstract The emerging data mining tools and systems lead naturally to the demand of a powerful data mining. This motivates us to design a data mining query language, DMQL, for mining different kinds of knowledge

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

    E-Print Network [OSTI]

    Lu, Jianguo

    2010-01-01T23:59:59.000Z

    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

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

    E-Print Network [OSTI]

    Zhang, Rui

    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

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

    E-Print Network [OSTI]

    Shahabi, Cyrus

    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

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

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    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

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

  16. Topic Distillation with Query-Dependent Link Connections and Page Characteristics

    E-Print Network [OSTI]

    Wu, Mingfang

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

  17. MQuery: A Visual Query Language for Multimedia, Timeline, and Simulation Data

    E-Print Network [OSTI]

    California at Los Angeles, University of

    MQuery: A Visual Query Language for Multimedia, Timeline, and Simulation Data John David N. Dionisio Alfonso F. C'ardenas Computer Science Department University of California, Los Angeles July 25 of California, Los Angeles Los Angeles, CA 90024 U.S.A. Phone: (310) 8257550 Fax: (310) 8252273 e

  18. MQuery: A Visual Query Language for Multimedia, Timeline, and Simulation Data

    E-Print Network [OSTI]

    California at Los Angeles, University of

    MQuery: A Visual Query Language for Multimedia, Timeline, and Simulation Data John David N. Dionisio Alfonso F. Cardenas Computer Science Department University of California, Los Angeles July 25 of California, Los Angeles Los Angeles, CA 90024 U.S.A. Phone: (310) 825-7550 Fax: (310) 825-2273 e

  19. DEVise: Integrated Querying and Visual Exploration of Large Datasets (DEMO ABSTRACT)

    E-Print Network [OSTI]

    Liblit, Ben

    DEVise: Integrated Querying and Visual Exploration of Large Datasets (DEMO ABSTRACT) M. Livny, R of large tabular datasets (possibly containing or referencing multi­ media objects) from several sources meta­data summarizing the entire dataset, to large subsets of the actual data, to individual data

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

    E-Print Network [OSTI]

    Lu, Jianguo

    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

  1. MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System

    E-Print Network [OSTI]

    Liu, Ling

    System Bugra Gedik and Ling Liu College of Computing, Georgia Institute of Technology {bgedik queries on moving objects in a centralized lo- cation monitoring system. Surprisingly, very few have of MobiEyes, a distributed real-time location monitoring system in a mobile environment. Mobieyes utilizes

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

    E-Print Network [OSTI]

    King, Kuo Chin Irwin

    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

  3. Site-Based Dynamic Pruning for Query Processing in Search Engines

    E-Print Network [OSTI]

    Ulusoy, ?zgür

    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

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

    E-Print Network [OSTI]

    Shahabi, Cyrus

    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

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

    E-Print Network [OSTI]

    Cruz, Isabel F.

    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

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

    E-Print Network [OSTI]

    Shaw, Chris

    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

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

  8. Locality sensitive hashing: a comparison of hash function types and querying mechanisms Loic Pauleve,a

    E-Print Network [OSTI]

    Boyer, Edmond

    . The comparison of random projections, lattice quantizers, k-means and hierarchical k-means reveal algorithms such as a k-means quantizer have been shown to provide excellent vector search performanceLocality sensitive hashing: a comparison of hash function types and querying mechanisms Lo

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

    E-Print Network [OSTI]

    Krishnamachari, Bhaskar

    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

  10. Career Mentor Link For all queries related to the Career Mentor Link

    E-Print Network [OSTI]

    Tobar, Michael

    Career Mentor Link For all queries related to the Career Mentor Link program, contact: Jo Hocking Career Mentor Link Coordinator The University of Western Australia M302, 35 Stirling Highway, Crawley WA.careers.uwa.edu.au CRICOS Provider Code: 00126G CC.005.2009 FAQs What are the time commitments? The Career Mentor Link

  11. Career Mentor Link For all queries related to the Career Mentor Link

    E-Print Network [OSTI]

    Tobar, Michael

    Career Mentor Link For all queries related to the Career Mentor Link programme, contact: Jo Hocking Career Mentor Link Coordinator The University of Western Australia M302, 35 Stirling Highway, Crawley WA! Career Mentor Link Singapore is open to currently enrolled final year UWA students who are returning

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

    E-Print Network [OSTI]

    California at Irvine, University of

    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

  13. Query Based UML Modeling Validation and Verification of the System Model and

    E-Print Network [OSTI]

    Austin, Mark

    1 Query Based UML Modeling Validation and Verification of the System Model and Behavior. UML/SysML was designed to provide simple but powerful constructs for modeling a wide range of systems for a Hydraulic Crane Denny Mathew ENPM 643 System Validation and Verification Instructor: Dr. Mark Austin Fall

  14. Using temporal bursts for query modeling Maria-Hendrike Peetz Edgar Meij Maarten de Rijke

    E-Print Network [OSTI]

    de Rijke, Maarten

    Using temporal bursts for query modeling Maria-Hendrike Peetz Edgar Meij Maarten de Rijke-mail: edgar.meij@uva.nl M. de Rijke e-mail: derijke@uva.nl 123 Inf Retrieval DOI 10.1007/s10791-013-9227-2 #12

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

    E-Print Network [OSTI]

    Zhang, Rui

    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

  16. Querying the Web with Statistical Machine Volker Tresp, Yi Huang, and Maximilian Nickel

    E-Print Network [OSTI]

    Tresp, Volker

    Querying the Web with Statistical Machine Learning Volker Tresp, Yi Huang, and Maximilian Nickel.Tresp@Siemens.com Yi Huang Siemens AG, Otto-Hahn-Ring 6, 81739 Muenchen, e-mail: YiHuang@Siemens.com Maximilian Nickel Ludwig Maximilian University of Munich, e-mail: nickel@dbs.ifi.lmu.de 1 #12;2 Volker Tresp, Yi Huang

  17. Bayesian Reasoning for Sensor Group-Queries and Diagnosis Ankur Jain1

    E-Print Network [OSTI]

    Wang, Yuan-Fang

    collectively as a single group-query that exploits inter-attribute dependencies for deriving cost to achieve two performance goals: 1) conserving power for prolonging useful life, and 2) collecting reliable on costly sensors can be answered efficiently by acquiring data from cheap sensors [9, 8]. In this paper, we

  18. Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks

    E-Print Network [OSTI]

    Wong, Raymond Chi-Wing

    , 20, 30, 33, 34] can only handle relatively small graphs due to high index construction cost and large, in terms of both querying time and indexing costs. Our empirical study shows that our method can handle unweighted scale-free graph G = (V, E), construct a disk-based index for processing This work is licensed

  19. Back to the Roots: A Probabilistic Framework for Query-Performance Prediction

    E-Print Network [OSTI]

    Kurland, Oren

    Back to the Roots: A Probabilistic Framework for Query-Performance Prediction Oren Kurland1 kurland substan- tially in their basic principles, and rely on diverse hypotheses about the characteristics with a basic question that has not been explicitly addressed in

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

    E-Print Network [OSTI]

    Massachusetts at Amherst, University of

    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

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

    E-Print Network [OSTI]

    Zaniolo, Carlo

    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

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

  3. Small PCPs with Low Query Complexity Prahladh Harsha and Madhu Sudan

    E-Print Network [OSTI]

    Sudan, Madhu

    Small PCPs with Low Query Complexity Prahladh Harsha and Madhu Sudan Laboratory for Computer of Friedl and Sudan [8], who indicate that NP has PCPs with nearly quadratic size complexity and in which been substantially improved. Raz and Safra [13] and Arora and Sudan [3] have given highly efficient

  4. Joint Video and Text Parsing for Understanding Events and Answering Queries

    E-Print Network [OSTI]

    Zhu, Song Chun

    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

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

    E-Print Network [OSTI]

    Hsu, Cheng

    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

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

    Mannheim, Universität

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

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

    E-Print Network [OSTI]

    Chang, Shih-Fu

    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

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

    E-Print Network [OSTI]

    Nix, Robert

    2012-01-01T23:59:59.000Z

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

  9. A translation of recursive algebra queries into the access language of a nested relations database prototype

    E-Print Network [OSTI]

    Caulfield, Jonathan

    1989-01-01T23:59:59.000Z

    REFERENCES . 109 APPENDIX A BNF GRAMMAR OF THE QUERY LANGUAGE . . B SELECTION TRANSLATIONS . 114 119 LIST OF FIGURES Figure 1 A First Normal Form Parent and Child Da, tabase Page 2 A Nested Parent and Child Database 3 The EMP Relation 14 ename...='Fred') 5 a(EMP(Childage ? rs) . 6 s'((ename, Child(cname), Skills) EMP) . . 7 The EMP1 Relation . . 8 The EMP2 Relation . . 15 16 18 21 22 9 U(EMP1, EMP2) 10 U'(EMP1, EMP2) . . 11 n(EMp1, EMp2) 12 n'(EMpl, EMp2) . 13 ? (EMP1, EMP2) 14 ? '(EMP1...

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

    SciTech Connect (OSTI)

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

    2008-07-31T23:59:59.000Z

    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.

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

    SciTech Connect (OSTI)

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

    2010-05-11T23:59:59.000Z

    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.

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

    DOE Patents [OSTI]

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

    2006-08-08T23:59:59.000Z

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

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

    Schoenmakers, Berry

    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

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

    California at San Diego, University of

    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

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

    E-Print Network [OSTI]

    Goldberg, Ian

    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

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

    E-Print Network [OSTI]

    Ostrovsky, Rafail

    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

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

    E-Print Network [OSTI]

    Paris-Sud XI, Universit de

    ' 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

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

    E-Print Network [OSTI]

    Li, Chengkai

    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

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

    E-Print Network [OSTI]

    Shahabi, Cyrus

    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

  20. A Query-by-Example Content-Based Image Retrieval System of Non-Melanoma Skin Lesions

    E-Print Network [OSTI]

    Fisher, Bob

    A Query-by-Example Content-Based Image Retrieval System of Non-Melanoma Skin Lesions Lucia classes, including two non-melanoma cancer types are used. Colour and texture features are extracted from for images acquired by epiluminescence microscopy (ELM or dermoscopy) and they focus on melanoma, which

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

    E-Print Network [OSTI]

    Deshpande, Amol

    ://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

  2. A SOM-based Multimodal System for Musical Query-by-Content Kyle Dickerson and Dan Ventura

    E-Print Network [OSTI]

    Martinez, Tony R.

    A SOM-based Multimodal System for Musical Query-by-Content Kyle Dickerson and Dan Ventura Abstract proposed the design of a system that uses a SOM to reduce the dimensionality Kyle Dickerson and Dan Ventura.dickerson@gmail.com, ventura@cs.byu.edu). of the feature space, allowing the use of simple (Euclidean) distance metrics [13

  3. Network Traffic Analysis With Query Driven VisualizationSC 2005HPC Analytics Results

    SciTech Connect (OSTI)

    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

    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.

  4. Energy Information, Data, and other Resources | OpenEI

    Open Energy Info (EERE)

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

  5. Querying graphs with data

    E-Print Network [OSTI]

    Vrgoc, Domagoj

    2014-06-27T23:59:59.000Z

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

  6. SPARQL SAHA, a Configurable Linked Data Editor and Browser as a Service

    E-Print Network [OSTI]

    Hyvnen, Eero

    SPARQL SAHA, a Configurable Linked Data Editor and Browser as a Service Eetu Mkel and Eero first.last@aalto.fi, http://www.seco.tkk.fi/ Abstract. SPARQL SAHA is a linked data editor and browser it was deduced that the SPARQL SAHA linked data editor and browser presented in this paper still has a particular

  7. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are beingZealand Jump to:Ezfeedflag JumpID-fTri Global Energy LLCEnergy)Peteforsyth Jump to:RterrySparql <Sparql2

  8. Probabilistic Evaluation of Counterfactual Queries

    E-Print Network [OSTI]

    Alexander Balke; Judea Pearl

    2011-01-01T23:59:59.000Z

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

  9. Author Queries Journal: Biology Letters

    E-Print Network [OSTI]

    Bruns, Tom

    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

  10. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are beingZealand JumpConceptual Model,DOEHazelPennsylvania: Energy Resources(RECP)Coolers JumpOpenRoadEwingExample

  11. EIA-176 Query System 2008

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOEThe Bonneville Power AdministrationField Campaign:INEA :Work withJerseyMarkets 19, 4:00Markets Full

  12. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directedAnnual Siteof EnergyInnovationin UrbanCityCoatedCommunityCompacTecMenlo AvenueCompiling

  13. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are beingZealand Jump to:Ezfeedflag JumpID-fTri Global Energy LLCEnergy)Peteforsyth Jump to:RterrySparql <

  14. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are beingZealand Jump to:Ezfeedflag JumpID-fTri Global Energy LLCEnergy)Peteforsyth Jump to:RterrySparql

  15. Query-based debugging of distributed systems

    E-Print Network [OSTI]

    Braud, Ryan Evans

    2010-01-01T23:59:59.000Z

    used as the tables primary key. In general, we have oneid column used as its primary key. The time column records a

  16. Network Traffic Analysis With Query Driven Visualization

    E-Print Network [OSTI]

    Fisk, Mike

    , Christopher E. Davis , Rick Olinger , Rob Young , Jim Prewett , Paul Weber , Thomas P.Caudell , E.Wes Bethel

  17. Adaptive Query Based Sampling of Distributed Collections

    E-Print Network [OSTI]

    Baillie, M.

    Baillie,M. Azzopardi,L. Crestani,F. Proceedings of the 13th Symposium on String Processing and Information Retrieval (SPIRE 2006)

  18. Conjunctive Query Containment under Access Limitations

    E-Print Network [OSTI]

    Martinenghi, Davide

    2 both represent city names, and similarly the attributes named Artist represent artist names.1 to access r2. In turn, new tuples from r2 may provide new constants representing city names, that can

  19. Query Generation From Multiple Media Examples

    E-Print Network [OSTI]

    Ren, R.

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

  20. Query Processing on Temporally Evolving Social Data

    E-Print Network [OSTI]

    Huo, Wenyu

    2013-01-01T23:59:59.000Z

    10 Figure 2: The TEG example and its nodes andefficient way, we use the Temporally Evolving Graph (TEG).In a TEG = (V, E, w, t s , t e ), besides the nodes, edges

  1. Keyword query interpretation over structured data

    E-Print Network [OSTI]

    Nejdl, Wolfgang

    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

  2. Enabling Geographical Queries to a Botanical Database

    E-Print Network [OSTI]

    Sato, Go

    2011-11-25T23:59:59.000Z

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

  3. Beyond Simple Aggregates: Indexing for Summary Queries

    E-Print Network [OSTI]

    Yi, Ke "Kevin"

    # 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

  4. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office of Science (SC)Integrated CodesTransparency VisitSilver Toyota1Resourceloading new table Home >

  5. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directedAnnualProperty Edit withTianlinPapersWindey Wind Home Rmckeel's picture Submittedcitingcodesolar Home

  6. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are beingZealand Jump to: navigation, searchOfRoseConcernsCompany Oil and GasOff thedrivingGiven UtilityReleasesUpdate

  7. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are beingZealand Jump to: navigation, searchOfRoseConcernsCompany Oil and GasOff thedrivingGivenGhost"overview

  8. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov YouKizildere IRaghuraji Agro Industries PvtStratosolar Jump to:Holdings Co08.0 -TEEMP Jump to:TIAX LLCTSNergy

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

    E-Print Network [OSTI]

    Zhang, Rui

    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

  10. KeyQuery --A Front End for the Automatic Translation of Keywords into Structured Queries

    E-Print Network [OSTI]

    Erwig, Martin

    pages. For example, a user wants to buy a Honda car and he likes red and blue colors. So he might input ``red blue Honda'' to search the Internet to find some information. The default relation between'', and ``Honda'' will be returned as a result. Other useful pages, which contain only ``red'' and ``Honda

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

    E-Print Network [OSTI]

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

    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

  12. Massive-scale RDF Processing Using Compressed Bitmap Indexes

    SciTech Connect (OSTI)

    Madduri, Kamesh; Wu, Kesheng

    2011-05-26T23:59:59.000Z

    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.

  13. Extracting and Querying Probabilistic Information in BayesStore

    E-Print Network [OSTI]

    Wang, Zhe

    2011-01-01T23:59:59.000Z

    should be part of the primary key of the child, and theA n } contains the primary key. This assumption guaranteesoperation, because all the primary key attributes remain in

  14. Using Bitmap Indexing Technology for Combined Numerical and Text Queries

    E-Print Network [OSTI]

    Stockinger, Kurt; Cieslewicz, John; Wu, Kesheng; Rotem, Doron; Shoshani, Arie

    2006-01-01T23:59:59.000Z

    while a compression scheme for an inverted index gener- allyor a compression method for the in- verted index to compress

  15. Private Queries in Location Based Services: Anonymizers are not Necessary

    E-Print Network [OSTI]

    Curtmola, Reza

    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

  16. Query execution in column-oriented database systems

    E-Print Network [OSTI]

    Abadi, Daniel J

    2008-01-01T23:59:59.000Z

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

  17. Answering Imprecise Queries over Web Databases Ullas Nambiar & Subbarao Kambhampati

    E-Print Network [OSTI]

    Kambhampati, Subbarao

    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

  18. Usefulness of Hyperlink Structure for Query-Biased Topic Distillation

    E-Print Network [OSTI]

    Plachouras, V.; Ounis, I.

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

  19. Network Traffic Analysis with Query-Driven Visualization

    E-Print Network [OSTI]

    Geddes, Cameron Guy Robinson

    Gavrilov, Alex Kent, Christopher E. Davis, Paul Weber, Steve Smith Rick Olinger, Rob Young, Jim Prewitt

  20. Queries with Difference on Probabilistic Databases Sanjeev Khanna

    E-Print Network [OSTI]

    Anderson, Richard

    (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

  1. Directed Social Queries With Transparent User Models Saiph Savage1

    E-Print Network [OSTI]

    California at Santa Barbara, University of

    .forbes@cs, holl@cs}.ucsb.edu 2 Universidad Nacional Autonoma de Mexico {rodrigosavage@comunidad, norma?" Computers Music Pets Cooking Transparent Interface Socially Aware Interface "Mexican Food and Salsa Dancing

  2. CRBTree: An Efficient Indexing Scheme for RangeAggregate Queries ?

    E-Print Network [OSTI]

    Arge, Lars

    database requires efficient exter nal memory (secondary storage) support for its language features. Range processing (OLAP), spatial databases such as geographic information sys tems (GIS), and several other grants ITR--333--1050, EIA--9870724, EIA--997287, and CCR--9732787, and by a grant from the U

  3. Monitoring Continuous Band-Join Queries over Dynamic Data

    E-Print Network [OSTI]

    Agarwal, Pankaj K.

    processing has recently attracted much interest from the database community because of its wide range.Y. is supported by NSF under grants CCR-00-86013, EIA- 01-31905, CCR-02-04118, and DEB-04-25465, by ARO grants W

  4. A System for Query Based Analysis and Visualization

    E-Print Network [OSTI]

    Knowles, David William

    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

  5. A Query Answering System for Data with Evolution Relationships

    E-Print Network [OSTI]

    Velegrakis, Yannis

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

  6. Adaptive information filtering through automatic Boolean query generation

    E-Print Network [OSTI]

    Nichols, Michael Roddy

    1998-01-01T23:59:59.000Z

    potent catalyst of economic and social change. During this author's short lifetime of 22 years, for example, the personal com- puter has evolved from a hobbyist's novelty to a powerful productive tool as important to modern life as the telephone... filters/agents. Of these, the latter two are generated by computer. The first is generally a hand-made index. A web catalog, such as Yahoo[18], acts as a sort of table of contents for the web. Web sites are listed by category in a hierarchical fashion...

  7. Extracting Query Modifications from Nonlinear SVMs Gary William Flake

    E-Print Network [OSTI]

    Giles, C. Lee

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

  8. Consistent Query Answers in Inconsistent Databases Marcelo Arenas

    E-Print Network [OSTI]

    Bertossi, Leopoldo

    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

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

  10. SemiNaive Query Planning For Grid Data Integration

    E-Print Network [OSTI]

    Samoladas, Vasilis

    and bussines computing in the form of support for loosely coupled Virtual Organizations, i.e. the formation

  11. Data Analysis and Query Processing in Wireless Sensor Networks

    E-Print Network [OSTI]

    Chatzimilioudis, Georgios

    2010-01-01T23:59:59.000Z

    5.2.2 Wireless Sensor Networks . . . . . . . . 5.33.1 De?nition of a Wireless Sensor Network . . . . . . .1.1 Introduction to Wireless Sensor Networks 1.2 Motivating

  12. Fast Approximate Evaluation of OLAP Queries for Integrated Statistical Data

    E-Print Network [OSTI]

    Shahabi, Cyrus

    statistical information about energy prod- ucts from several government agencies, such as the Bureau of Labor Statistics, the Energy Information Administration, and the California Energy Commission. Our architecture has of interactivity that some users require. Second, our system can warehouse the information from the data sources

  13. Adaptive information filtering through automatic Boolean query generation

    E-Print Network [OSTI]

    Nichols, Michael Roddy

    1998-01-01T23:59:59.000Z

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

  14. Optimizing database-backed applications with query synthesis

    E-Print Network [OSTI]

    Cheung, Alvin K.

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

  15. Query-based Data Warehousing Tool Rami Rifaieh

    E-Print Network [OSTI]

    Song, Il-Yeol

    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

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

  17. Aqua: A Fast Decision Support System Using Approximate Query Answers

    E-Print Network [OSTI]

    Gibbons, Phillip B.

    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

  18. Mining Databases and Data Streams with Query Languages and Rules

    E-Print Network [OSTI]

    Zaniolo, Carlo

    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

  19. Fault Tolerant Evaluation of Continuous Selection Queries over Sensor Data

    E-Print Network [OSTI]

    Lazaridis, Iosif; Han, Qi; Mehrotra, Sharad; Venkatasubramanian, Nalini

    2009-01-01T23:59:59.000Z

    Design Modelling & Simulation in Engineering International Journal of Navigation and Observation International Journal of Chemical

  20. Distributed query execution on a replicated and partitioned database

    E-Print Network [OSTI]

    Narula, Neha

    2010-01-01T23:59:59.000Z

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

  1. A Live Multimedia Stream Querying System Electrical and Computer

    E-Print Network [OSTI]

    Gupta, Amarnath

    Institute of Technology bliu@ece.gatech.edu Amarnath Gupta San Diego Supercomputer Center University

  2. Estimating the Variance of Query Responses in Hybrid Bayesian Nets

    E-Print Network [OSTI]

    Greiner, Russell

    ) Yasin Abbasi-Yadkori, Russ Greiner, Bret Hoehn Dept of Computing Science University of Alberta Peter

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

  4. Query Planning in the Presence of Overlapping Sources

    E-Print Network [OSTI]

    Khuller, Samir

    or the cardinality of the target object set (TOS) of objects reached in the result. There is also an evaluation cost of reaching the TOS. We present dual problems in selecting the best set of paths. The first problem (number of distinct objects in the TOS). The dual problem is to select a set of paths that satisfies

  5. Query Answering in Distributed Description Faisal Alkhateeb and Antoine Zimmermann

    E-Print Network [OSTI]

    Paris-Sud XI, Universit de

    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

  6. Managing and Querying Web Services Communities: A Survey

    E-Print Network [OSTI]

    Limam, Hela

    2011-01-01T23:59:59.000Z

    With the advance of Web Services technologies and the emergence of Web Services into the information space, tremendous opportunities for empowering users and organizations appear in various application domains including electronic commerce, travel, intelligence information gathering and analysis, health care, digital government, etc. However, the technology to organize, search, integrate these Web Services has not kept pace with the rapid growth of the available information space. The number of Web Services to be integrated may be large and continuously changing. To ease and improve the process of Web services discovery in an open environment like the Internet, it is suggested to gather similar Web services into groups known as communities. Although Web services are intensively investigated, the community management issues have not been addressed yet In this paper we draw an overview of several Web services Communities' management approaches based on some currently existing communities platforms and framework...

  7. Estimating Query Difficulty for News Prediction Retrieval Nattiya Kanhabua

    E-Print Network [OSTI]

    stories, as well as strategies planning and risk management. The aforemen- tioned work has been shown and Retrieval--Retrieval models; H.3.4 [Information Storage and Retrieval]: Systems and Software-genomic society? When can re- newable energy replace fossil fuels? These questions commonly This is a corrected

  8. FACILITATING DATA EXPLORATION: DYNAMIC QUERIES ON A HEALTH STATISTICS MAP

    E-Print Network [OSTI]

    Golbeck, Jennifer

    . A thematic map of the United States is animated by adjusting sliders displayed on the side of the map. A time.g. proposing that a demographic factor might be linked to a cause of death.) More recently thematic maps helped in order to access the exact rate in an area. Research on map graphic design (e.g.. [2]) shows that careful

  9. Dynamaps: Dynamic Queries on a Health Statistics Atlas

    E-Print Network [OSTI]

    Golbeck, Jennifer

    and running on their ordinary staff equipment, a thematic map of the United States is animated by moving color coded for each state (e.g. the Cervix Uteri cancer rate [figure 1]). The states where the cancer rate is high are red (dark on the figure), the states where the rates are low appear blue and the other

  10. Financials Query 9.1 Version Date: April 2013

    E-Print Network [OSTI]

    " or "commercial technical data" pursuant to the applicable Federal Acquisition Regulation and agency- specific, transmit, distribute, exhibit, perform, publish or display any part, in any form, or by any means. Reverse documentation and technical data delivered to U.S. Government customers are "commercial computer software

  11. Minimum-Hot-Spot Query Trees for Wireless Sensor Networks

    E-Print Network [OSTI]

    Zeinalipour, Demetris

    energy source; they have batteries on board. The price to pay is the energy needed for communication] (Figure 1) use a bioenergy harvester that converts liv- ing plant metabolic energy to electricity

  12. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are beingZealand JumpConceptual Model, click here. Category:Conceptual ModelListsPolitical ActionQuantitativeThis is

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

    Energy Savers [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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO Overview OCHCOSystems Analysis Success Stories Systems Analysis SuccessEnergy

  14. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office of Science (SC)IntegratedSpeedingTechnicalPurchase, Delivery, and StorageandQuarterly Coal Allocation

  15. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directedAnnual SiteofEvaluatingGroup |JilinLu anMicrogreenMoon LakeMountain ElectricMt Princeton

  16. Oregon Certified Water Right Examiners Query Webpage | Open Energy

    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 onYou are now leaving Energy.gov You are now leaving Energy.gov YouKizildere I Geothermal Pwer PlantMunhall,Missouri: EnergyExcellenceOfficeOhio:OpowerOrchard

  17. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov YouKizildere IRaghuraji Agro Industries PvtStratosolar Jump to:HoldingsTechint SpasourceFacebookLikeISGANAttribution

  18. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directedAnnual SiteofEvaluatingGroup | OpenHunan Runhua New EnergyIT PowerImagine EnergySwarm Beneath

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

    E-Print Network [OSTI]

    Koubarakis, Manolis

    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

  20. The authors review a log of billions of Web queries that constituted the total query traffic for a 6-month period of

    E-Print Network [OSTI]

    change over time is critical to developing effective, efficientWeb search services.TheWeb is a dynamic

  1. Accelerating semantic graph databases on commodity clusters

    SciTech Connect (OSTI)

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

    2013-10-06T23:59:59.000Z

    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.

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

  3. New Sampling-Based Summary Statistics for Improving Approximate Query Answers

    E-Print Network [OSTI]

    Gibbons, Phillip B.

    techniques for their fast incremental maintenance regardless of the data distribution. We quantify mining [GM95, HHW97]. Moreover, as discussed by Faloutsos er al. [FJS97], sometimes the base data available. Techniques for fast approximate answers can also be used in a more traditional role within

  4. ZStream : a cost-based query processor for composite event detection

    E-Print Network [OSTI]

    Mei, Yuan

    2008-01-01T23:59:59.000Z

    Composite (or Complex) event processing (CEP) systems search sequences of incoming primitive events for occurrences of user-specified event patterns. Recently, they are gaining more and more attention in a variety of areas ...

  5. Bin-Hash Indexing: A Parallel Method for Fast Query Processing

    E-Print Network [OSTI]

    Gosink, Luke J.

    2008-01-01T23:59:59.000Z

    The Bin-Hash index uses a form of compression, implementedbitmap index. Unfor- tunately the compression strategies forcompression strategies, based upon the binning strategies of the binned bitmap index,

  6. Data Parallel Bin-Based Indexing for Answering Queries on Multi-Core Architectures

    E-Print Network [OSTI]

    Gosink, Luke

    2009-01-01T23:59:59.000Z

    a binned bitmap index. Unfortu- nately, bitmap compressioncompression strategy, based upon the binning techniques of the binned bitmap index,index is that storage concerns for indices are ameliorated through specialized compression

  7. Using Bitmap Index for Joint Queries on Structured and Text Data

    E-Print Network [OSTI]

    Stockinger, Kurt

    2009-01-01T23:59:59.000Z

    cient compression algorithm, our compressed bitmap indexes,or a compression method for the inverted index to compresscompression technique, we are able to not only keep the indexes

  8. Detecting Distributed Scans Using High-Performance Query-Driven Visualization

    E-Print Network [OSTI]

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

    2006-01-01T23:59:59.000Z

    forms of bitmap index compression, including WAH. Networkencoded bitmap index with WAH bitmap compression [Wu et al.

  9. Network Traffic Analysis With Query Driven Visualization SC 2005 HPC Analytics Results

    E-Print Network [OSTI]

    , Christopher E. Davis , Rick Olinger , Rob Young , Jim Prewett , Paul Weber , Thomas P. Caudell , E.Wes Bethel

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

    DOE Patents [OSTI]

    Stolte, Chris (Palo Alto, CA); Tang, Diane L. (Palo Alto, CA); Hanrahan, Patrick (Portola Valley, CA)

    2011-02-01T23:59:59.000Z

    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.

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

    DOE Patents [OSTI]

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

    2014-04-29T23:59:59.000Z

    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.

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

    DOE Patents [OSTI]

    Stolte, Chris (Palo Alto, CA); Tang, Diane L. (Palo Alto, CA); Hanrahan, Patrick (Portola Valley, CA)

    2012-03-20T23:59:59.000Z

    In response to a user request, a computer generates a graphical user interface on a computer display. A schema information region of the graphical user interface includes multiple operand names, each operand name associated with one or more fields of a multi-dimensional database. A data visualization region of the graphical user interface includes multiple shelves. Upon detecting a user selection of the operand names and a user request to associate each user-selected operand name with a respective shelf in the data visualization region, the computer generates a visual table in the data visualization region in accordance with the associations between the operand names and the corresponding shelves. The visual table includes a plurality of panes, each pane having at least one axis defined based on data for the fields associated with a respective operand name.

  13. Faster Query Answering in Probabilistic Databases using Read-Once Functions

    E-Print Network [OSTI]

    Anderson, Richard

    .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

  14. I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries

    E-Print Network [OSTI]

    Yi, Ke "Kevin"

    in the computa- tional geometry and database communities because of their many important ap- plications. Range versions of range searching in database applications. Since many such applications involve massive amounts , we can Supported in part by the National Science Foundation through grants CCR-00- 86013, EIA9972879

  15. Nondeterministic Queries in a Relational Grid Information Service Peter A. Dinda Dong Lu

    E-Print Network [OSTI]

    Dinda, Peter A.

    under Grants ANI- 0093221, ACI-0112891, ANI-0301108, EIA-0130869, and EIA-0224449. Any opinions. Our view of a GIS is that it is a database (in the generic sense of the word) of information about a unique identifier, a times- tamp, and a set of attributes. Updates to the database take the form

  16. I/O-Ecient Structures for Orthogonal Range-Max and Stabbing-Max Queries

    E-Print Network [OSTI]

    Arge, Lars

    studied extensively in the computa- tional geometry and database communities because of their many, are some of the most commonly used versions of range searching in database applications. Since many-00- 86013, EIA{9972879, EIA-98-70724, EIA-01-31905, and CCR-02-04118, and by a grant from the U

  17. Continuous Query Processing of Spatio-temporal Data Streams in PLACE

    E-Print Network [OSTI]

    Mokbel, Mohamed F.

    Environments); a scalable location-aware database server currently developed at Pur- due University. The PLACE by the National Sci- ence Foundation under Grants IIS-0093116, EIA-9972883, IIS- 9974255, IIS-0209120, 0010044-CCR, and EIA-9983249. Copyright held by the author(s). Proceedings of the Second Workshop on Spatio- Temporal

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

    E-Print Network [OSTI]

    Duckham, Matt

    Variation in Quality Keywords Spatial data quality; spatial database; relational database management system of existing and proposed spatial data quality management systems. 1 INTRODUCTION Uncertainty has long been systems in the literature for spatial data quality management, highlighting three funda- mentally

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

    E-Print Network [OSTI]

    Azzopardi, L.

    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)

  20. Democratic community-based search with XML full-text queries

    E-Print Network [OSTI]

    Curtmola, Emiran

    2009-01-01T23:59:59.000Z

    forms that we call the deep web. However, in practice, ait ignores entirely the deep web, which is of several orders

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

    E-Print Network [OSTI]

    Hiemstra, Djoerd

    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

  2. CUCS-004-00 Automatic Classification of Text Databases Through Query Probing

    E-Print Network [OSTI]

    results than when searching a more general text database. Other services (e.g., Copernic3 ) combine. [CCD99] probe text 1http://www.invisibleweb.com/ 2http://www.searchengineguide.com/ 3http://www.copernic

  3. The Power of Verification Queries in Message Authentication and Authenticated Encryption

    E-Print Network [OSTI]

    Bernstein, Daniel

    encryption. Keywords: Message authentication, PRFs, Carter-Wegman, symmetric encryption, authenticated-cipher based MACs [5, 22, 10, 4, 11, 20, 17, 18] and Carter-Wegman (CW) ma-schemes [25, 21, 23, 16, 8, 9

  4. The Power of Verification Queries in Message Authentication and Authenticated Encryption

    E-Print Network [OSTI]

    encryption. Keywords: Message authentication, PRFs, CarterWegman, symmetric encryption, authenticatedcipher based MACs [5, 22, 10, 4, 11, 20, 17, 18] and CarterWegman (CW) maschemes [25, 21, 23, 16, 8, 9

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

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

  7. RFID Data Processing with a Data Stream Query Language Yijian Bai

    E-Print Network [OSTI]

    Zaniolo, Carlo

    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

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

    E-Print Network [OSTI]

    Harrison, Susan

    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

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

    E-Print Network [OSTI]

    Carberry, Sandra

    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

  10. A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets

    E-Print Network [OSTI]

    of Western Ontario eschost@uwo.ca July, 2013 hal-00849057,version1-30Jul2013 #12;Abstract A roadmap for computing roadmaps, given by Basu, Pollack and Roy, was sd+1 DO(n2) where the input is given more freedom for the design of algorithms computing roadmaps and led to a first probabilistic roadmap

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

    E-Print Network [OSTI]

    Sudarshan, S.

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

  12. Lower and upper queries for graph-mining Amina Kemmar 1

    E-Print Network [OSTI]

    Boyer, Edmond

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

  13. TAPER: A Two-Step Approach for All-Strong-Pairs Correlation Query

    E-Print Network [OSTI]

    Kumar, Vipin

    Abstract--Given a user-specified minimum correlation threshold and a market-basket database with N items these properties in a filter-and-refine manner. Furthermore, we provide an algebraic cost model which shows mining and databases. It plays an important role in many application domains such as market-basket

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

    E-Print Network [OSTI]

    Hawking, David

    Funnelback Pty Ltd. Canberra ACT 2602, Australia, and RsCS, Australian National University david.hawking@acm.org Timothy Jones Funnelback Pty Ltd. Melbourne VIC 3066, Australia tjones@funnelback.com ABSTRACT Following been gathered and indexed, we build a tool for reordering an ex- isting index and show that it operates

  15. Visual Query Tools for Uncertain Spatio-Temporal Data Katherine Malan

    E-Print Network [OSTI]

    Blake, Edwin

    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

  16. Distributed Structural Relaxation of XPath Queries Georgia Koloniari and Evaggelia Pitoura

    E-Print Network [OSTI]

    Pitoura, Evaggelia

    . To reduce the cost of constructing and maintaining the clustered index, we use a compact data structure-k results, while maintaining a low construction cost for the clustered index. I. INTRODUCTION XML has clustered index aims at reducing communication and processing costs by placing similar data at the same

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

    E-Print Network [OSTI]

    Doherty, Patrick

    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

  18. MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries

    E-Print Network [OSTI]

    Liu, Ling

    , 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

  19. Our reference: ADHOC 588 P-authorquery-v8 AUTHOR QUERY FORM

    E-Print Network [OSTI]

    California at Davis, University of

    nodes in QuRiNet are 29powered by solar energy, and comprise of multiple radios per node. Physical link.esch@elsevier.sps.co.in Fax: +31 2048 52799 Dear Author, Please check your proof carefully and mark all corrections

  20. Decidability of FirstOrder Logic Queries To appear in ICDT 99

    E-Print Network [OSTI]

    Dong, Guozhu

    /or the world wide web. Much of this recent research has been on fundamental problems such as con tainment, implication of dependencies and reasoning in de scription logics. Key words: satisfiability, decidability

  1. Reducing Energy Consumption of Queries in Memory-Resident Database Systems

    E-Print Network [OSTI]

    Kuzmanovic, Aleksandar

    to commercial databases, but ex- isting embedded DBMS software has not provided the ideal fit. Embedded bank is typically much smaller compared to a large monolithic memory). In addition, these memory

  2. Design and Implementation of the QBOE Query Language for Multimedia Database

    E-Print Network [OSTI]

    Chang, Ye-In

    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

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

    E-Print Network [OSTI]

    Chan, Edward P.F.

    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

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

    E-Print Network [OSTI]

    Ordonez, Carlos

    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

  5. P2P query reformulation over BothasView data transformation rules

    E-Print Network [OSTI]

    McBrien, Peter

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

  6. Query-driven Analysis of Plasma-based Particle Acceleration Data

    E-Print Network [OSTI]

    Ruebel, Oliver

    2014-01-01T23:59:59.000Z

    A BSTRACT Plasma-based particle accelerators can produce andof conventional particle accelerators. There is a pressingplasma-based particle accelerator designs. To address this

  7. Time to Leave the Trees: From Syntactic to Conceptual Querying of XML ?

    E-Print Network [OSTI]

    Ludäscher, Bertram

    Altintas Amarnath Gupta San Diego Supercomputer Center University of California, San Diego fludaesch

  8. Declarative Specification of Gene Regulatory Networks and Query Evaluation in PathSys

    E-Print Network [OSTI]

    Gupta, Amarnath

    Abstract) Amarnath Gupta Yang Yang Aditya Bagchi Animesh Ray University of California Indian Statistical

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

    E-Print Network [OSTI]

    Langmead, Christopher James

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

  10. Fjording the Stream: An Architecture for Queries over Streaming Sensor Data Samuel Madden, Michael J. Franklin

    E-Print Network [OSTI]

    California at Irvine, University of

    , are limited by severe power con- straints, and typically sample periodically and push imme- diately, keeping. Researchers at UC Berkeley [15] and other universities have embarked on projects to produce small, wireless, Siemens, and the UC MI- CRO program. guages and operators to this sensor data is highly desirable

  11. Learning polynomials with queries: The highly noisy Oded Goldreich y Ronitt Rubinfeld z Madhu Sudan x

    E-Print Network [OSTI]

    Goldwasser, Shafi

    Madhu Sudan x March 24, 2000 Abstract Given a function f mapping n-variate inputs from a #12;nite #12

  12. Error Analysis of Ia Supernova and Query on Cosmic Dark Energy

    E-Print Network [OSTI]

    Qiuhe Peng; Yiming Hu; Kun Wang; Yu Liang

    2012-01-16T23:59:59.000Z

    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.

  13. Optimized Query Execution in Large Search Engines with Global Page Ordering

    E-Print Network [OSTI]

    Suel, Torsten

    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

  14. Representing and querying regression models in a relational database management system

    E-Print Network [OSTI]

    Thiagarajan, Arvind

    2007-01-01T23:59:59.000Z

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

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

  16. An Event-Based Service Framework for Learning, Querying, and Monitoring Multivariate Time Series

    E-Print Network [OSTI]

    Lin, Jessica

    University, 4400 University Drive MSN 4A5, Fairfax, Virginia 22030-4422, United States {cngan, brodsky rates, and monthly price indices to analyze different states of stock markets. In medical studies pressure and pulse anomalies on electrocardiogram, as well as low birth but high death rates in a #12

  17. A SERVICE FRAMEWORK FOR LEARNING, QUERYING, AND MONITORING MULTIVARIATE TIME SERIES

    E-Print Network [OSTI]

    Lin, Jessica

    Drive MSN 4A5, Fairfax, Virginia 22030- 4422, United States cngan@gmu.edu, brodsky@gmu.edu, jessica monitor daily stock prices, weekly interest rates, and monthly price indices to analyze different states death rates in a population region. To support such decision-marking and determination over multivariate

  18. Human Resources Query Basics 9.1 Version Date: July 2012

    E-Print Network [OSTI]

    " or "commercial technical data" pursuant to the applicable Federal Acquisition Regulation and agency- specific, transmit, distribute, exhibit, perform, publish or display any part, in any form, or by any means. Reverse documentation and technical data delivered to U.S. Government customers are "commercial computer software

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

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742EnergyOn April 23,EnergyChicopeeTechnologyfactTuscarora Phase IIDOE OGain Unauthorized

  20. 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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment of Energy Microsoft Security BulletinDepartment of Energy

  1. Adaptive Query Routing on Distributed Context -The COSINE Framework Lukasz Juszczyk, Harald Psaier, Atif Manzoor, Schahram Dustdar

    E-Print Network [OSTI]

    Dustdar, Schahram

    such as domotics [13], collaborative work- ing environments [8], and many more [3] of which most fall

  2. AUTHOR QUERY FORM Journal: YNIMG Please e-mail or fax your responses and any corrections to

    E-Print Network [OSTI]

    Penny, Will

    and Astronomy, Nottingam, UK 11 b SISTEMIC, Engineering Faculty, Universidad de Antioquia, Medelln, Colombia 12 estimated t-statistic map of power change (1 s pre vs. 1 s post stimulus) in 1530 Hz band power from L = 11 to L = 42 support these data equally well (the curve is not strongly peaked at any harmonic

  3. 208 Int. J. Metadata, Semantics and Ontologies, Vol. 5, No. 3, 2010 Querying structured information sources on the Web

    E-Print Network [OSTI]

    Freire, Juliana

    (UFRGS), Porto Alegre 91501-970, Brazil E-mail: mergen@inf.ufrgs.br *Corresponding author Juliana Freire-970, Brazil E-mail: heuser@inf.ufrgs.br Abstract: To provide access to heterogeneous data distributed over Grande do Sul, Porto Alegre, Brazil. He achieved his MSc title at the same institute. He spent part

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

    E-Print Network [OSTI]

    Mannheim, Universität

    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

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

    E-Print Network [OSTI]

    Gibbons, Phillip B.

    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

  6. Towards Window Stream Queries Over Continuous J.C. Whittier Silvia Nittel Mark A. Plummer Qinghan Liang

    E-Print Network [OSTI]

    Nittel, Silvia

    performance evaluations using the Fukushima nuclear event in March 2011 as a test data set. Categories

  7. ARABIC USER SEARCH QUERY CORRECTION AND EXPANSION T. Rachidi, M. Bouzoubaa, L. Elmortaji, B. Boussouab, and A.Bensaid

    E-Print Network [OSTI]

    Rachidi, Tajje-eddine

    by native Arab speakers from North Africa, the Middle East, as well as Muslims from all over the world transliteration Middle East Television American Table 1. Sample transliterations from English present to English, encountered on the Arabic Web today. English word Arabic transliteration North Africa Arabic

  8. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are beingZealand Jump to: navigation, search OpenEIHesperia, California:Project Jump to:Would You Rebuild aquery data

  9. Toward a Data Scalable Solution for Facilitating Discovery of Science Resources

    SciTech Connect (OSTI)

    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

    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.

  10. U.S. VERSUS EUROPEAN WEB SEARCHING TRENDS Amanda Spink

    E-Print Network [OSTI]

    Jansen, James

    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

  11. Reporting Tools Course ID: FMS121

    E-Print Network [OSTI]

    Shull, Kenneth R.

    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

  12. Reporting Tools Course ID: FMS121

    E-Print Network [OSTI]

    Shull, Kenneth R.

    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

  13. Queries for ecol-89-04-15 1. ED: Petchey is spelled Petchy in Lit Cit. Please reconcile. AP/ccb

    E-Print Network [OSTI]

    Sekercioglu, Cagan Hakki

    species. Based on a global data base, bird assemblages in tropical agroforest ecosystems were comprised habitats. This is important for data-based management of tropical human-dominated landscapes sustaining, California, USA 3 Center for Tropical Research, University of California Los Angeles, Los Angeles, California

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

    E-Print Network [OSTI]

    Hawai'i at Manoa, University of

    , 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

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

    Johnson, Andrew

    , 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

  16. OCONUS and OVERSEAS Per Diem Rates: Query Results http://www.defensetravel.dod.mil/pdcgi/pd-rates/opdrates.cgi[1/23/2014 10:31:28 AM

    E-Print Network [OSTI]

    Hardy, Christopher R.

    /01/2012 LUALUALEI NAVAL MAGAZINE 01/01- 12/31 177 91 52 23 291 07/01/2013 MOLOKAI 01/01- 12/31 131 58 35 14 203 07

  17. Home Page| Database Search| Online Tools| MetaData Query| Standard Criterion| Data Center| About BMICC| Login| | --> English News --> Biology News

    E-Print Network [OSTI]

    Sbester, Andrs

    pipelines, and methane naturally leaking from the seabed, could in future be detected using changes into the atmosphere of gases from the seabed. This applies both to gas extracted by the petrochemical industries and to the methane which is naturally released from the seabed." Natural leaks of methane gas can be damaging

  18. Cite this paper as follows: Lisa (Ling) Liu, Bertrand Meyer and Bernd Schoeller, Using contracts and boolean queries to improve the

    E-Print Network [OSTI]

    Meyer, Bertrand

    Cite this paper as follows: Lisa (Ling) Liu, Bertrand Meyer and Bernd Schoeller, Using contracts And Proofs, ETH Zurich, 5-6 February 2007, eds. Yuri Gurevich and Bertrand Meyer, Lecture Notes in Computer of automatic test generation Lisa (Ling) Liu Bertrand Meyer Bernd Schoeller Chair of Software Engineering, ETH

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

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

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

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

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

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

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

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

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

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

  9. Massive Scale Cyber Traffic Analysis: A Driver for Graph Database Research

    SciTech Connect (OSTI)

    Joslyn, Cliff A.; Choudhury, S.; Haglin, David J.; Howe, Bill; Nickless, William K.; Olsen, Bryan K.

    2013-06-19T23:59:59.000Z

    We describe the significance and prominence of network traffic analysis (TA) as a graph- and network-theoretical domain for advancing research in graph database systems. TA involves observing and analyzing the connections between clients, servers, hosts, and actors within IP networks, both at particular times and as extended over times. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. IPFLOW databases are routinely interrogated statistically and visualized for suspicious patterns. But the ability to cast IPFLOW data as a massive graph and query it interactively, in order to e.g.\\ identify connectivity patterns, is less well advanced, due to a number of factors including scaling, and their hybrid nature combining graph connectivity and quantitative attributes. In this paper, we outline requirements and opportunities for graph-structured IPFLOW analytics based on our experience with real IPFLOW databases. Specifically, we describe real use cases from the security domain, cast them as graph patterns, show how to express them in two graph-oriented query languages SPARQL and Datalog, and use these examples to motivate a new class of "hybrid" graph-relational systems.

  10. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are beingZealand Jump to:Ezfeedflag JumpID-fTri Global Energy LLCEnergy)Peteforsyth Jump

  11. 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 onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directedAnnual SiteofEvaluatingGroup | Open Energy InformationHebeiProgram Jump to: navigation,

  12. Nonparametric Bayesian Policy Priors for Reinforcement Learning

    E-Print Network [OSTI]

    Doshi-Velez, Finale P.

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

  13. Selective Search of Large Text Collections Jamie Callan

    E-Print Network [OSTI]

    Callan, Jamie

    for organizations that have modest computational resources, modest query traffic, and elastic response time

  14. Hierarchical Ranking of Facial Attributes Ankur Datta

    E-Print Network [OSTI]

    California at Santa Barbara, University of

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

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

    Pennock, David M.

    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

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

    Pennock, David M.

    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

  17. Privacy: Swinburne University of Technology collects, uses and destroys your employee information in accordance with the University Employee Records policy. All queries should be made to: riwilliams@swin.edu.au TIMESHEET SESSIONAL ACADEMIC STAFF

    E-Print Network [OSTI]

    Liley, David

    .99 $158.07 LB Lecturing: Developed $182.43 $185.40 $189.11 $192.89 $196.75 $202.65 $210.76 LC Lecturing

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

    E-Print Network [OSTI]

    Greenberg, Harvey J.

    to models used by the Energy Information Administration (EIA). Then, extensions of conventional sensitivity.3 [Data- base Management]: Languages-query languages; H.2.4 [Database Management]: Systems- query

  19. abstract index journal: Topics by E-print Network

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

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

  20. 612 | VOL.8 NO.8 | AUGUST 2011 | nature methods correspondence

    E-Print Network [OSTI]

    Chemicals Container sizeContainer type Container locationPreparation Container a b Enter search term: ExactFreezer. After entering a query at the reagent search page, reagents matching the query are displayed with links

  1. accurate similarity search: Topics by E-print Network

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

    faster query processing time as compared to state-of-the-art indexing methods such as Daylight fingerprints, C-tree and GraphGrep. Conclusions: Efficient similarity query...

  2. BATON: A Balanced Tree Structure for Peer-to-Peer Networks

    E-Print Network [OSTI]

    Jagadish, H.V.

    We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure causing distinctions to be made between nodes ...

  3. 6.893 Database Systems, Fall 2004

    E-Print Network [OSTI]

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

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

  4. Smithsonian/NASA ADS Physics/Geophysics Abstract Service Find Similar Abstracts (with default settings below)

    E-Print Network [OSTI]

    Mojahedi, Mohammad

    Smithsonian/NASA ADS Physics/Geophysics Abstract Service Find Similar Abstracts (with default | Query Form | Preferences | HELP | FAQ Physics/Geophysics arXiv e-prints Send Query Reset #12;

  5. Geothermal National Environmental Policy Act Database on Publicly...

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

    i i QUERY BY ACTIVITY FOR MORE INFORMATION EXAMPLE NEPA DOCUMENT COLLECTION QUERY BY GEOTHERMAL AREA NREL is a national laboratory of the U. S. Department of Energy, Office of...

  6. Self-Image and Strategic Ignorance in Moral Dilemmas

    E-Print Network [OSTI]

    Grossman, Zachary; van der Weele, Jol

    2013-01-01T23:59:59.000Z

    Von Below, N. (1980): Als Hitlers Adjutant 1937-45. Mainz:query Himmler, I did not query Hitler, I did not speak with1970, p. 376). Even Hitler himself practiced strategic

  7. Application of High-performance Visual Analysis Methods to Laser Wakefield Particle Acceleration Data

    E-Print Network [OSTI]

    Rubel, Oliver

    2008-01-01T23:59:59.000Z

    index/query system for data extraction and subsetting. It implements the fastest-known bitmap compression

  8. Intent-Aware Search Result Diversification Rodrygo L. T. Santos

    E-Print Network [OSTI]

    Jose, Joemon M.

    queries (e.g., `zeppelin') have multiple interpretations (e.g., `airship', `band'). On the other hand

  9. A Glance at an Overlooked Part of the World Wide Web

    E-Print Network [OSTI]

    Kuzmanovic, Aleksandar

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

  10. Date March 13, 2012 Invites applications for the following position (s)

    E-Print Network [OSTI]

    knowledge of, Python, Django, jQuery, Version control, SDLC, PHP, CSS, AJAX, XML, Javascript and web

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

    E-Print Network [OSTI]

    Boyer, Edmond

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

  12. LOWER BOUNDS ON LEARNING RANDOM STRUCTURES WITH

    E-Print Network [OSTI]

    Reyzin, Lev

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

  13. Dealing with the Deep Web and all its Quirks Meghyn Bienvenu

    E-Print Network [OSTI]

    Senellart, Pierre

    Dealing with the Deep Web and all its Quirks Meghyn Bienvenu CNRS; Universite 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

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

    E-Print Network [OSTI]

    Lu, Jianguo

    2012-01-01T23:59:59.000Z

    -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

  15. Site-Searching Strategies of Searchers Referred from Search Engines

    E-Print Network [OSTI]

    Jansen, James

    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

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

    E-Print Network [OSTI]

    Saracevic, Tefko

    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

  17. Geospatial Toolkit Help October 2010

    E-Print Network [OSTI]

    is integrated with HOMER, a power system simulation and optimization model, originally developed at NREL a saved query, 26 Remove a query, 26 Troubleshoot a query, 27 Renewable resource data, 28 Geographic toolkit data in your own GIS, 36 File format reference, 37 Glossary, 37 2010 National Renewable

  18. The Case for Fine-Grained Stream Provenance Boris Glavic #

    E-Print Network [OSTI]

    Tatbul, Nesime

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

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

    E-Print Network [OSTI]

    Kemper, Alfons

    : 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

  20. The EXODUS Optimizer Generator Goetz Graefe

    E-Print Network [OSTI]

    Liblit, Ben

    . 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

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

    Tomkins, Andrew

    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

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

    E-Print Network [OSTI]

    Antwerpen, Universiteit

    . 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

  3. Randomized location service in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Bhattacharya, Sangeeta

    2003-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Levin, Judith G.

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

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

    E-Print Network [OSTI]

    Power, J. M

    1991-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

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

    2009-01-01T23:59:59.000Z

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

  7. Information Literacy Program ANU Library anulib.anu.edu.au/training

    E-Print Network [OSTI]

    Information Literacy Program ANU Library anulib.anu.edu.au/training ilp@anu.edu.au Internet......................................................................................... 6 Special Query Types

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

    Office of Scientific and Technical Information (OSTI)

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

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

    Office of Scientific and Technical Information (OSTI)

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

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

    Office of Scientific and Technical Information (OSTI)

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

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

    Office of Scientific and Technical Information (OSTI)

    get the most relevant results quickly The Solution: To simplify searching of multiple resources, OSTI integrated key STI databases into a single-query search Science Accelerator *...

  12. System and method for anomaly detection | OSTI, US Dept of Energy...

    Office of Scientific and Technical Information (OSTI)

    decomposition of the observations, and introducing derived variables to increase storage and query efficiencies. A mathematical model, such as a conditional independence...

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

    Office of Scientific and Technical Information (OSTI)

    query utilizing a combination of surface web and deep web tools (specifically Distributed Explorit from Deep Web Technologies) that can reach where ordinary search engines cannot....

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

  15. asian livestock production: Topics by E-print Network

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

    queries concerning rights and licences, should be addressed by e-mail to P. S. Makkar 6 Sustainable Management of Carbon, Nutrients, and Agrichemicals through Cycling of...

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

  17. analyzers pulse: 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...

  18. accurate search strategies: 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...

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

  20. acquisitions title enhancements: Topics by E-print Network

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

    forms of the terms. AND search operator- The boolean search operator AND combines search terms in a query so that each result contains all the terms specified. Example:...

  1. atc voice communication: 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...

  2. COSC6340: Database Systems Instructor: Carlos Ordonez

    E-Print Network [OSTI]

    Ordonez, Carlos

    available. Topics include the following. Database design: ER model, relational model and algebra, indexing data structures, query optimizer, concurrency control, transaction processing, recovery. Advanced

  3. T-617: BIND RPZ Processing Flaw Lets Remote Users Deny Service

    Broader source: Energy.gov [DOE]

    When a name server is configured with a response policy zone (RPZ), queries for type RRSIG can trigger a server crash.

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

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

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

    Office of Scientific and Technical Information (OSTI)

    features * Accesses 38 databases and almost 2000 websites with 200 million pages of science information via 1 query * Clustering of results by subtopics or dates to help...

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

    Office of Scientific and Technical Information (OSTI)

    STI Access in the Information Age * Single Query Access * Tailored Product Functionalities * Customer Driven Services * Non-Text Media * Web 2.0 Capabilities...

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

    Office of Scientific and Technical Information (OSTI)

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

  9. algimantas paulauskas jana: Topics by E-print Network

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

    technology to ensure both data integrity 7 A new Method to index and query Sets Jorg Hoffmann Jana Koehler Computer Technologies and Information Sciences Websites Summary: :...

  10. alstrup jana kocourkov: Topics by E-print Network

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

    technology to ensure both data integrity 7 A new Method to index and query Sets Jorg Hoffmann Jana Koehler Computer Technologies and Information Sciences Websites Summary: :...

  11. LARGE-SCALE COVER SONG RECOGNITION USING THE 2D FOURIER TRANSFORM MAGNITUDE

    E-Print Network [OSTI]

    Ellis, Dan

    for self-identified cover songs of Lady Gaga on YouTube on November 22nd, 2011. This simple query produces

  12. avg process: Topics by E-print Network

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

    approximate answers that those turned over by a classic DataBase Management System (DBMS). Some applications do not need exact answers. However, flexible querying can be...

  13. ACCESS 2010 Level 1 | Department of Energy

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

    and modify new databases. Course Goals: Identify the basic components of an Access database. Build the structure of a database. Manage data in tables. Query a database. Design...

  14. automatic identification system: Topics by E-print Network

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

    Universidad 3 Automatic feature-queried bird identification system based on entropy and fuzzy similarity Computer Technologies and Information Sciences Websites Summary:...

  15. Unfolding Warping For Object Recognition Janelia Farm Research Campus, Howard Hughes Medical Institute

    E-Print Network [OSTI]

    Central Florida, University of

    a global compact view, called a flat map, so that the query ob- ject can be compared with the model from

  16. The CORAL Deductive System Raghu Ramakrishnan

    E-Print Network [OSTI]

    Sudarshan, S.

    module in the program. In addition, users are permitted to guide query optimization, if desired Foundation Fellowship in Science and Engineering, a Presidential Young Investigator Award with matching

  17. A developer's survey on different cloud platforms

    E-Print Network [OSTI]

    Doan, Dzung

    2009-01-01T23:59:59.000Z

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

  18. Image/Time Series Mining Algorithms: Applications to Developmental Biology, Document Processing and Data Streams

    E-Print Network [OSTI]

    Tataw, Oben Moses

    2013-01-01T23:59:59.000Z

    International Conference on Data Mining (2001). Khairy, K. ,and Eamonn Keogh (2011). Mining Historical Documents forWang, E. J. Keogh. Querying and mining of time series data.

  19. An Overview about the DynaQuest-Framework Marco Grawunder

    E-Print Network [OSTI]

    Appelrath, Hans-Jürgen

    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

  20. XPRESS: A Queriable Compression for XML Data Jun-Ki Min Myung-Jae Park Chin-Wan Chung

    E-Print Network [OSTI]

    Chung, Chin-Wan

    , the disk space and the network bandwidth are wasted. To over- come the verbosity problem, the research on compressors for XML data has been conducted. However, some XML com- pressors do not support querying compressed data, while other XML compressors which support querying compressed data blindly encode tags

  1. Abstract--an interplay between mobile devices and static sensor nodes is envisioned in the near future. This will enable a

    E-Print Network [OSTI]

    Shatz, Sol M.

    the mobility and transmission flexibility of objects at the upper layer. We propose a pull query model constraints encountered in traditional static sensor networks by taking advantage of the more powerful mobile. One of our key goals is to achieve energy-efficient query injection and data collection by leveraging

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

    E-Print Network [OSTI]

    Mirkin, Boris

    , 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

  3. A Search Engine for Natural Language Applications Michael J. Cafarella

    E-Print Network [OSTI]

    Cafarella, Michael J.

    Algorithms, Design, Experimentation, Performance Keywords Search engine, indexing, variables, query, corpus literally millions of queries to search engines, which can overload search engines, and limit both the speedA Search Engine for Natural Language Applications Michael J. Cafarella Department of Computer

  4. Achieving Practical Access Pattern Privacy in Data Outsourcing

    E-Print Network [OSTI]

    Dautrich, Jonathan L.

    2014-01-01T23:59:59.000Z

    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

  5. Repudiative Information Retrieval Dmitri Asonov

    E-Print Network [OSTI]

    Freytag, Johann-Christoph

    , 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

  6. Fast alignment of large genome databases: A Demonstration Tamer Kahveci Ambuj K. Singh

    E-Print Network [OSTI]

    Kahveci, Tamer

    Fast alignment of large genome databases: A Demonstration Tamer Kahveci Ambuj K. Singh Department partially by NSF under grants EIA-0080134, IIS- 9877142, and DBI-0213903. The amount of biological data has and database query techniques and presents new challenges to biological database design. Queries (as mentioned

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

  8. I/O-Conscious Data Preparation for Large-Scale Web Search Engines

    E-Print Network [OSTI]

    Chiueh, Tzi-cker

    a general technique for efficiently car- rying out large sets of simple transformation or queryingI/O-Conscious Data Preparation for Large-Scale Web Search Engines Maxim Lifantsev Tzi-cker Chiueh of the transformation and querying operations that work with the data. This data and processing partitioning is natu

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

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

    2012-03-06T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Lakshmanan, Laks V.S.

    ; 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

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

    E-Print Network [OSTI]

    Kambhampati, Subbarao

    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

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

    E-Print Network [OSTI]

    Zhang, Kang

    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

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

    E-Print Network [OSTI]

    Meng, Weiyi

    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

  14. Fading Away: Dilution and User Behaviour Paul Thomas

    E-Print Network [OSTI]

    Thomas, Paul

    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

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

    E-Print Network [OSTI]

    Pardo, Bryan

    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

  16. ScentTrails: Integrating Browsing and Searching on the Web

    E-Print Network [OSTI]

    Chi, Ed Huai-hsin

    . 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

  17. Independent Study Report University of Pittsburgh

    E-Print Network [OSTI]

    Brusilovsky, Peter

    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

  18. PREFETCHING RESULTS OF WEB SEARCHES Harry Foxwell Daniel A. Menasc

    E-Print Network [OSTI]

    Menasc, Daniel A.

    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

  19. InfoCrystal: A visual tool for information retrieval

    E-Print Network [OSTI]

    Spoerri, Anselm

    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

  20. InfoCrystal: A visual tool for information retrieval

    E-Print Network [OSTI]

    Spoerri, Anselm

    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

  1. Indexing the Trajectories of Moving Objects in Networks Victor Teixeira de Almeida

    E-Print Network [OSTI]

    Güting, Ralf Hartmut

    of the routes. We propose the index in terms of the basic algorithms for insertion and querying. We test our the roads of Germany. In our tests, the MON-Tree showes good scalability when increasing the number operations to support querying. Complete trajectories of the moving objects are stored This work

  2. TITLE: Proteomics COURSE: MED263, "Bioinformatics Applications to Human Disease"

    E-Print Network [OSTI]

    Gleeson, Joseph G.

    . Enter a sensible "Search title" and then upload the PMF1.txt datafile. Using the default settings, use a sensible "Search title" and then enter an appropriate sequence query in the "Query" box. Search Swiss-B search for the structure of this protein in the Protein Data Bank (http

  3. Clustering Moving Objects for Spatiotemporal Selectivity Estimation Qing Zhang Xuemin Lin

    E-Print Network [OSTI]

    Lin, Xuemin

    . To avoid expensive computation costs, we developed linear time heuristics to construct such a histogram of Computer Science and Engineering, University of New South Wales, Sydney, Australia 2052, Email: {qzhang, there are two kinds of queries based on different temporal natures. One is to query historical be havior

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

    E-Print Network [OSTI]

    Kang, Kyoung-Don

    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

  5. Efficient Processing of XML Update Streams Leonidas Fegaras

    E-Print Network [OSTI]

    Fegaras, Leonidas

    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

  6. Sample Applications of the E-utilities Eric Sayers, PhD

    E-Print Network [OSTI]

    Levin, Judith G.

    ($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

  7. Diesel: Applying Privilege Separation to Database Access Adrienne Porter Felt

    E-Print Network [OSTI]

    Wagner, David

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

  8. New Dynamic Construction Techniques Tomas Skopal Jakub Lokoc

    E-Print Network [OSTI]

    Skopal, Tomas

    , most of them require either static or expensive indexing. By contrast, the dynamic M-tree construction retrieval. The number of distance computations spent during index construction is referred to as the construction costs, while query costs represent the computations spent by processing a query. The al- ready

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

    E-Print Network [OSTI]

    Sakellariou, Rizos

    2009-01-01T23:59:59.000Z

    problems [2]. It does not refer only to resources such as CPU power, storage facilities and memory-oriented system for distributed data querying and integration on Grids$ Carmela Comitoa, , Anastasios Gounarisb November 2008 Available online 7 December 2008 Keywords: Data Grids Distributed query processing Wide

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

    E-Print Network [OSTI]

    Paris-Sud XI, Universit de

    , 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

  11. This paper has been submitted to CIKM '97 (pending). A Corpus Analysis Approach for

    E-Print Network [OSTI]

    Kansas, University of

    's query. However, the average query submitted by users to World Wide Web search engines is only two words with related words can improve search performance, but finding and using related words is an open problem. This research uses corpus analysis techniques to automatically discover similar words directly from the contents

  12. Object-Based and Image-Based Object Representations HANAN SAMET

    E-Print Network [OSTI]

    Samet, Hanan

    are distinguished by the manner in which they can be used to answer two fundamental queries in database applications representation; E.5 [Files]: Sorting/searching; H.2.4 [Database Management]: Systems--Query processing, multimedia databases; H.2.8 [Database Management]: Database Applications--Image databases, spatial databases

  13. MAX-PLANCK-INSTITUT.. ( Lower Bounds for Set Intersection

    E-Print Network [OSTI]

    . Mehlhorn R. Raman C. Uhrig MPI- I-92-127 October 1992 o mPD_ _ _ _ _ _ _ IN F 0 R M AT I K _ _ _ _ __ Im Stadtwald 66123 Saarbrcken Germany #12;Lower Bounds for Set Intersection Queries P. Dietz K. Mehlhorn R. Raman C. Uhrig MPI-I-92-127 October 1992 #12;Lower Bounds for Set Intersection Queries PAUL DIETZ KURT

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

    E-Print Network [OSTI]

    Bonaventure, Olivier

    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

  15. Control-Based Quality Adaptation in Data Stream Management Systems

    E-Print Network [OSTI]

    Hefeeda, Mohammed

    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

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

  17. Database Managament IS&M Option Mark Levene

    E-Print Network [OSTI]

    Levene, Mark

    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

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

    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

    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.

  19. Online Search Aids Petroleum Abstracts

    E-Print Network [OSTI]

    Reynolds, Albert C.

    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

  20. USING AN EXTENDED SUFFIX TREE TO SPEED-UP SEQUENCE ALIGNMENT

    E-Print Network [OSTI]

    Wu, Xindong

    USING AN EXTENDED SUFFIX TREE TO SPEED-UP SEQUENCE ALIGNMENT Divya R. Singh Software Engineer biology is the alignment of a given query sequence and sequences in a database to find similar (locally or globally) sequences from the database to the query. Many heuristic algorithms for this problem are based

  1. Spoken Keyword Spotting via Multi-Lattice Alignment Hui Lin, Alex Stupakov and Jeff Bilmes

    E-Print Network [OSTI]

    Bilmes, Jeff

    , or impossible for the user to enter a search query using a standard keyboard. For example, speech queries and a second phone lattice repre- senting a long utterance needing to be searched. We implement this joint representation. Index Terms: speech lattice, keyword spotting, graphical mod- els, lattice alignment 1

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

  3. BioMed Central Page 1 of 6

    E-Print Network [OSTI]

    Barash, Danny

    -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

  4. GhostDB: Hiding Data from Prying Eyes Christophe Salperwyck*

    E-Print Network [OSTI]

    Paris-Sud XI, Universit de

    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

  5. Documentation for database.txt Description

    E-Print Network [OSTI]

    Gilchrist, Michael A.

    . The database should also be importable into standard statistical programs such as SAS, R, or SPlus. Reference querying. Instead we recommend that researchers write their own Perl program for database querying Gilchrist, M.A., L.A. Salter,and A.Wagner. 2003. A statistical framework for combining and interpreting

  6. The Geometry of Uncertainty in Moving Objects Databases

    E-Print Network [OSTI]

    Wolfson, Ouri E.

    The Geometry of Uncertainty in Moving Objects Databases Goce Trajcevski1 , Ouri Wolfson1@arl.mil Abstract. This work addresses the problem of querying moving ob- jects databases. which capture- ing, constructing, and querying a trajectories database. We propose to model a trajectory as a 3D

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

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    .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

  8. Image Content Engine (ICE)

    SciTech Connect (OSTI)

    Brase, J M

    2007-03-26T23:59:59.000Z

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

  9. The Composite OLAP-Object Data Model

    SciTech Connect (OSTI)

    Pourabbas, Elaheh; Shoshani, Arie

    2005-12-07T23:59:59.000Z

    In this paper, we define an OLAP-Object model that combines the main characteristics of OLAP and Object data models in order to achieve their functionalities in a common framework. We classify three different object classes: primitive, regular and composite. Then, we define a query language which uses the path concept in order to facilitate data navigation and data manipulation. The main feature of the proposed language is an anchor. It allows us to fix dynamically an object class (primitive, regular or composite) along the paths over the OLAP-Object data model for expressing queries. The queries can be formulated on objects, composite objects and combination of both. The power of the proposed query language is investigated through multiple query examples. The semantic of different clauses and syntax of the proposed language are investigated.

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

    NA

    2001-02-15T23:59:59.000Z

    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.

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

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

    2001-02-06T23:59:59.000Z

    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.

  12. Forrelation: A Problem that Optimally Separates Quantum from Classical Computing

    E-Print Network [OSTI]

    Scott Aaronson; Andris Ambainis

    2014-11-21T23:59:59.000Z

    We achieve essentially the largest possible separation between quantum and classical query complexities. We do so using a property-testing problem called Forrelation, where one needs to decide whether one Boolean function is highly correlated with the Fourier transform of a second function. This problem can be solved using 1 quantum query, yet we show that any randomized algorithm needs ~sqrt(N)/log(N) queries (improving an ~N^{1/4} lower bound of Aaronson). Conversely, we show that this 1 versus ~sqrt(N) separation is optimal: indeed, any t-query quantum algorithm whatsoever can be simulated by an O(N^{1-1/2t})-query randomized algorithm. Thus, resolving an open question of Buhrman et al. from 2002, there is no partial Boolean function whose quantum query complexity is constant and whose randomized query complexity is linear. We conjecture that a natural generalization of Forrelation achieves the optimal t versus ~N^{1-1/2t} separation for all t. As a bonus, we show that this generalization is BQP-complete. This yields what's arguably the simplest BQP-complete problem yet known, and gives a second sense in which Forrelation "captures the maximum power of quantum computation."

  13. SAPLE: Sandia Advanced Personnel Locator Engine.

    SciTech Connect (OSTI)

    Procopio, Michael J.

    2010-04-01T23:59:59.000Z

    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.

  14. A Simple and Fast Word Spotting Method Alon Kovalchuk, Lior Wolf, and Nachum Dershowitz

    E-Print Network [OSTI]

    Wolf, Lior

    binarized target is resized to fit into a Procrustean bed (that is, a fixed-size rectangle) and represented overlapping candidate targets. Each binary target, as well as the binarized query, is resized to fit a fixed

  15. Visual Memes in Social Media Tracking real-world news on YouTube

    E-Print Network [OSTI]

    Xie, Lexing

    80 100 0 100 200 300 400 500 Swine Flu Earthquake Iran Pakistan text processing ... query definiGon pakistan military pakistan india tension pakistan taliban pakistan bhuEo pakistan ppp pakistan terrorist #12;7 Who

  16. An Expert System for Determining Compliance with the Texas Building Energy Design Standard

    E-Print Network [OSTI]

    Doan, E. C.; Hunn, B. D.; Jones, J. W.; Gatton, T. M.

    1996-01-01T23:59:59.000Z

    an expert system to serve as both the compliance procedure and its documentation. This expert system directs the user with queries (screen menus), prompting the user for all relevant information. A graphical user interface has been developed to facilitate...

  17. Implementation of genomics and bioinformatics approaches for identification and characterization of tomato ripening-related genes

    E-Print Network [OSTI]

    Fei, Zhangjun

    2004-09-30T23:59:59.000Z

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

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

    Office of Scientific and Technical Information (OSTI)

    We need systems, such as federated search, that probe the deep web Federated search drills down to the deep web where scientific databases reside (1) A user types in a query, hits...

  19. Methods for bibliometric analysis of research : renewable energy case study

    E-Print Network [OSTI]

    Ziegler, Blaine E

    2009-01-01T23:59:59.000Z

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

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

    Office of Scientific and Technical Information (OSTI)

    searches via a single query: * DOE research and development (R&D) projects and programs, * Descriptions of R&D projects under way or recently completed, * Major R&D...