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


1

Learning about the world through long-term query logs  

Science Conference Proceedings (OSTI)

In this article, we demonstrate the value of long-term query logs. Most work on query logs to date considers only short-term (within-session) query information. In contrast, we show that long-term query logs can be used to learn about the world we live ... Keywords: data mining, knowledge discovery, query logs, user behavior

Matthew Richardson

2008-10-01T23:59:59.000Z

2

Template:Incentive Type Page Query | Open Energy Information  

Open Energy Info (EERE)

Incentive Type Page Query Jump to: navigation, search This is the 'Incentive Type Page Query' template. If limitrec is not included, default is 1000. limitrec is only for the...

3

Use of Multiword Terms and Query Expansion for Interactive Information Retrieval  

E-Print Network (OSTI)

Use of Multiword Terms and Query Expansion for Interactive Information Retrieval Fidelia Ibekwe in the INEX 2008 Ad- Hoc Retrieval track. We investigated the effect of multiword terms on retrieval-Hoc tasks: Focused retrieval, Relevant-in-Context and Best-in-Context. 1 Introduction The INEX Ad-Hoc track

Paris-Sud XI, Université de

4

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

E-Print Network (OSTI)

a higher probability of being typed than shorter queries. Index Terms: speech, voice, search, Google, query of voice web search (where the query is entered by speaking rather than by keyboard) is sparse, most likely and time in entering their query. Thus, in terms of query entry difficulty, we would expect the benefit

Pregibon, Daryl

5

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

E-Print Network (OSTI)

Cluster-based information retrieval systems often use a similarity measure to compute the association among text documents. In this thesis, we focus on a class of similarity measures named Query-Sensitive Similarity (QSS) measures. Recent studies have shown QSS measures to positively influence the outcome of a clustering procedure. These studies have used QSS measures in conjunction with the ltc term-weighting scheme. Several term-weighting schemes have superseded the ltc term-weighing scheme and demonstrated better retrieval performance relative to the latter. We test whether introducing one of these schemes, INQUERY, will offer any benefit over the ltc scheme when used in the context of QSS measures. The testing procedure uses the Nearest Neighbor (NN) test to quantify the clustering effectiveness of QSS measures and the corresponding term-weighting scheme. The NN tests are applied on certain standard test document collections and the results are tested for statistical significance. On analyzing results of the NN test relative to those obtained for the ltc scheme, we find several instances where the INQUERY scheme improves the clustering effectiveness of QSS measures. To be able to apply the NN test, we designed a software test framework, Ferret, by complementing the features provided by dtSearch, a search engine. The test framework automates the generation of NN coefficients by processing standard test document collection data. We provide an insight into the construction and working of the Ferret test framework.

Kini, Ananth Ullal

2005-12-01T23:59:59.000Z

6

Context-Sensitive Query Auto-Completion ?  

E-Print Network (OSTI)

Query auto completion is known to provide poor predictions of the user’s query when her input prefix is very short (e.g., one or two characters). In this paper we show that context, such as the user’s recent queries, can be used to improve the prediction quality considerably even for such short prefixes. We propose a context-sensitive query auto completion algorithm, NearestCompletion, which outputs the completions of the user’s input that are most similar to the context queries. To measure similarity, we represent queries and contexts as high-dimensional term-weighted vectors and resort to cosine similarity. The mapping from queries to vectors is done through a new query expansion technique that we introduce, which expands a query by traversing the query recommendation tree rooted at the query. In order to evaluate our approach, we performed extensive experimentation over the public AOL query log. We demonstrate that when the recent user’s queries are relevant to the current query she is typing, then after typing a single character, NearestCompletion’s MRR is 48 % higher relative to the MRR of the standard MostPopularCompletion algorithm on average. When the context is irrelevant, however, NearestCompletion’s MRR is essentially zero. To mitigate this problem, we propose HybridCompletion, which is a hybrid of NearestCompletion with MostPopularCompletion. HybridCompletion is shown to dominate both NearestCompletion and MostPopularCompletion, achieving a total improvement of 31.5 % in MRR relative to MostPopular-Completion on average.

Ziv Bar-yossef; Naama Kraus

2011-01-01T23:59:59.000Z

7

Clash of the typings: finding controversies and children's topics within queries  

Science Conference Proceedings (OSTI)

The TadPolemic system identifies whether web search queries (1) are controversial in nature and/or (2) pertain to children's topics. We are incorporating it into a children's web search engine to assist children's search during difficult topics, as well ... Keywords: children's search, controversy detection

Karl Gyllstrom; Marie-Francine Moens

2011-04-01T23:59:59.000Z

8

Query | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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

9

Complex spatio-temporal pattern queries  

Science Conference Proceedings (OSTI)

This paper introduces a novel type of query, what we name Spatio-temporal Pattern Queries (STP). Such a query specifies a spatiotemporal pattern as a sequence of distinct spatial predicates where the predicate temporal ordering (exact or relative) ...

Marios Hadjieleftheriou; George Kollios; Petko Bakalov; Vassilis J. Tsotras

2005-08-01T23:59:59.000Z

10

Generating query substitutions  

Science Conference Proceedings (OSTI)

We introduce the notion of query substitution, that is, generating a new query to replace a user's original search query. Our technique uses modifications based on typical substitutions web searchers make to their queries. In this way the new query is ... Keywords: paraphrasing, query rewriting, query substitution, sponsored search

Rosie Jones; Benjamin Rey; Omid Madani; Wiley Greiner

2006-05-01T23:59:59.000Z

11

Distributed XML Query Processing.  

E-Print Network (OSTI)

??While centralized query processing over collections of XML data stored at a single site is a well understood problem, centralized query evaluation techniques are inherently… (more)

Kling, Patrick

2012-01-01T23:59:59.000Z

12

Mo Type Phase in Long-Term Aged INCONEL Alloy  

Science Conference Proceedings (OSTI)

FORMATION OF A PtzMo TYPE PHASE IN LONG-TERM AGED lNCONEL@ ALLOY 686. Michael G. ... formation of a low-temperature iutermetallic Pt*Mo type .

13

Querying Source Code with Natural Language Markus Kimmig  

E-Print Network (OSTI)

a developer enters a code search query, we first compute its grammatical form. Then, we search the training) corre- sponds to the query form. In other terms, we search the training data for queries that match enters the query "Where is method init() called" the tool might choose method for the "search for

Paris-Sud XI, Université de

14

SavvySearch: A MetaSearch Engine that Learns which Search Engines to Query  

E-Print Network (OSTI)

(query terms) and options for the search. Users typically enter two query terms. The options cover tracks long term performance of search engines on specific query terms to determine which are appropriate the interface for us. 3 #12; Figure 1: User interface to SavvySearch for entering a query 4 #12; Concurrency has

Howe, Adele E.

15

Improving effectiveness of query expansion using information theoretic approach  

Science Conference Proceedings (OSTI)

Automatic Query expansion is a well-known method to improve the performance of information retrieval systems. In this paper we have suggested information theoretic measures to improve efficiency of co-occurrence based automatic query expansion. We have ... Keywords: automatic query expansion, candidate terms, kullback-leibler divergence, relevance feedback, term cooccurrence

Hazra Imran; Aditi Sharan

2010-06-01T23:59:59.000Z

16

Geomodification in query rewriting  

E-Print Network (OSTI)

Web searchers signal their geographic intent by using placenames in search queries. They also indicate their flexibility about geographic specificity by reformulating their queries. We conducted experiments on geomodification in query rewriting. We examine both deliberate query rewriting, conducted in user search sessions, and automated query rewriting, with users evaluating the relevance of geo-modified queries. We find geo-specification in 12.7 % of user query rewrites in search sessions, and show the breakdown into sub-classes such as same-city, same-state, same-country and different-country. We also measure the dependence between US-state-name and distance-of-modified-location-from-originallocation, finding that Vermont web searchers modify their locations greater distances than California web searchers. We also find that automatically-modified queries are perceived as much more relevant when the geographic component is unchanged.

Vivian Wei Zhang; Benjamin Rey; Rosie Jones

2006-01-01T23:59:59.000Z

17

Qunits: queried units in database search  

E-Print Network (OSTI)

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

Nandi, Arnab

2009-01-01T23:59:59.000Z

18

Query Explorativeness for Integrated Search  

E-Print Network (OSTI)

We consider query systems which allow imprecise queries and define a new property called query explorativeness. This property characteri es the transf ormations perf ormed by a system in order to answer imprecise queries, i.e. the system's "work"f or mapping input queries into more precise target queries.

In Heterogeneous Data; Ra Domenig; Klaus R. Dittrich

2002-01-01T23:59:59.000Z

19

Query Selectivity Estimation for Uncertain Data  

E-Print Network (OSTI)

Abstract. Applications requiring the handling of uncertain data have led to the development of database management systems extending the scope of relational databases to include uncertain (probabilistic) data as a native data type. New automatic query optimizations having the ability to estimate the cost of execution of a given query plan, as available in existing databases, need to be developed. For probabilistic data this involves providing selectivity estimations that can handle multiple values for each attribute and also new query types with threshold values. This paper presents novel selectivity estimation functions for uncertain data and shows how these functions can be integrated into PostgreSQL to achieve query optimization for probabilistic queries over uncertain data. The proposed methods are able to handle both attribute- and tuple-uncertainty. Our experimental results show that our algorithms are efficient and give good selectivity estimates with low space-time overhead. 1

Sarvjeet Singh; Chris Mayfield; Rahul Shah; Sunil Prabhakar; Susanne Hambrusch

2008-01-01T23:59:59.000Z

20

Query Suggestions for Mobile Search: Understanding Usage Patterns  

E-Print Network (OSTI)

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

Cortes, Corinna

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


21

Efficient query expansion.  

E-Print Network (OSTI)

??Hundreds of millions of users each day search the web and other repositories to meet their information needs. However, queries can fail to find documents… (more)

Billerbeck, B

2005-01-01T23:59:59.000Z

22

Fano type quantum inequalities in terms of $q$-entropies  

E-Print Network (OSTI)

Generalizations of the quantum Fano inequality are considered. The notion of $q$-entropy exchange is introduced. This quantity is concave in each of its two arguments. For $q\\geq0$, the inequality of Fano type with $q$-entropic functionals is established. The notion of coherent information and the perfect reversibility of a quantum operation are discussed in the context of $q$-entropies. By the monotonicity property, the lower bound of Pinsker type in terms of the trace norm distance is obtained for the Tsallis relative $q$-entropy of order $q=1/2$. For $0\\leq{q}\\leq2$, Fano type quantum inequalities with freely variable parameters are obtained.

Alexey E. Rastegin

2010-10-09T23:59:59.000Z

23

Queries, Data, and Statistics: Pick Two.  

E-Print Network (OSTI)

??The query processor of a relational database system executes declarative queries on relational data using query evaluation plans. The cost of the query evaluation plan… (more)

Mishra, Chaitanya

2010-01-01T23:59:59.000Z

24

Information Retrieval manuscript No. (will be inserted by the editor) When Do People Use Query Suggestion? A Query Suggestion Log Analysis  

E-Print Network (OSTI)

(Authors ’ version. The final publication is available at www.springerlink.com.) Abstract Query suggestion, which enables the user to revise a query with a single click, has become one of the most fundamental features of Web search engines. However, it has not been clear what circumstances cause the user to turn to query suggestion. In order to investigate when and how the user uses query suggestion, we analyzed three kinds of data sets obtained from a major commercial Web search engine, comprising approximately 126 million unique queries, 876 million query suggestions and 306 million action patterns of users. Our analysis shows that query suggestions are often used (1) when the original query is a rare query; (2) when the original query is a single-term query; (3) when query suggestions are unambiguous; (4) when query suggestions are generalizations or error corrections of the original query; and (5) after the user has clicked on several URLs in the first search result page. Our results suggest that search engines should provide better assistance especially when rare or single-term queries are input, and that they should dynamically provide query suggestions according to the searcher’s current state.

Katsumi Tanaka; Tetsuya Sakai

2012-01-01T23:59:59.000Z

25

Answering natural language queries over linked data graphs: a distributional semantics approach  

Science Conference Proceedings (OSTI)

This paper demonstrates Treo, a natural language query mechanism for Linked Data graphs. The approach uses a distributional semantic vector space model to semantically match user query terms with data, supporting vocabulary-independent (or ... Keywords: distributional-compositional semantics, knowledge graphs, natural language queries, schema-agnostic queries, semantic search

André Freitas; Fabrício F. de Faria; Seán O'Riain; Edward Curry

2013-07-01T23:59:59.000Z

26

Interpretation of coordinations, compound generation, and result fusion for query variants  

Science Conference Proceedings (OSTI)

We investigate interpreting coordinations (e.g. word sequences connected with coordinating conjunctions such as "and" and "or") as logical disjunctions of terms to generate a set of disjunctionfree query variants for information retrieval (IR) queries. ... Keywords: compounds, query structure, query variants, result set fusion

Johannes Leveling

2013-07-01T23:59:59.000Z

27

Multi-aspect query summarization by composite query  

Science Conference Proceedings (OSTI)

Conventional search engines usually return a ranked list of web pages in response to a query. Users have to visit several pages to locate the relevant parts. A promising future search scenario should involve: (1) understanding user intents; (2) providing ... Keywords: composite query, mixture model, query aspect, query summarization

Wei Song; Qing Yu; Zhiheng Xu; Ting Liu; Sheng Li; Ji-Rong Wen

2012-08-01T23:59:59.000Z

28

Complex Queries | Open Energy Information  

Open Energy Info (EERE)

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

29

QueryLines: approximate query for visual browsing  

E-Print Network (OSTI)

We introduce approximate query techniques for searching and analyzing two-dimensional data sets such as line or scatter plots. Our techniques allow users to explore a dataset by defining QueryLines: soft constraints and preferences for selecting and sorting a subset of the data. By using both preferences and soft constraints for query composition, we allow greater flexibility and expressiveness than previous visual query systems. When the user over-constrains a query, for example, a system using approximate techniques can display ¨near misses¨to enable users to quickly and continuously refine queries.

Kathy Ryall; Neal Lesh; Hiroaki Miyashita; Shigeru Makino; Tom Lanning; Tom Lanning; Darren Leigh; Darren Leigh

2005-01-01T23:59:59.000Z

30

Group Nearest Neighbor Queries  

Science Conference Proceedings (OSTI)

Given two sets of points P and Q, a group nearest neighbor(GNN) query retrieves the point(s) of P with the smallestsum of distances to all points in Q. Consider, for instance,three users at locations q1, q2 and q3 that want to find a meeting point (e.g., ...

Dimitris Papadias; Qiongmao Shen; Yufei Tao; Kyriakos Mouratidis

2004-03-01T23:59:59.000Z

31

QueryScope: visualizing queries for repeatable database tuning  

Science Conference Proceedings (OSTI)

Reading and perceiving complex SQL queries has been a time consuming task in traditional database applications for decades. When it comes to decision support systems with automatically generated and sometimes highly nested SQL queries, human understanding ...

Ling Hu; Kenneth A. Ross; Yuan-Chi Chang; Christian A. Lang; Donghui Zhang

2008-08-01T23:59:59.000Z

32

Auditing Categorical SUM, MAX and MIN Queries  

Science Conference Proceedings (OSTI)

Auditing consists in logging answered queries and checking, each time that a new query is submitted, that no sensitive information is disclosed by combining responses to answered queries with the response to the current query. Such a method for controlling ... Keywords: Aggregate function, max-query, min-query, null values, sum-query

Francesco M. Malvestuto

2008-09-01T23:59:59.000Z

33

Mixed mode XML query processing  

Science Conference Proceedings (OSTI)

Querying XML documents typically involves both tree-based navigation and pattern matching similar to that used in structured information retrieval domains. In this paper, we show that for good performance, a native XML query processing system should ...

Alan Halverson; Josef Burger; Leonidas Galanis; Ameet Kini; Rajasekar Krishnamurthy; Ajith Nagaraja Rao; Feng Tian; Stratis D. Viglas; Yuan Wang; Jeffrey F. Naughton; David J. DeWitt

2003-09-01T23:59:59.000Z

34

EIA 176 Query System, 2003  

Annual Energy Outlook 2012 (EIA)

3 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2003 The EIA-176 Query System is a Windows-based system which runs under Windows operating systems 95,...

35

EIA 176 Query System, 2001  

Gasoline and Diesel Fuel Update (EIA)

1 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2001 The EIA-176 Query system is a Windows-based system which runs under Windows operating systems 95,...

36

EIA 176 Query System, 2004  

Gasoline and Diesel Fuel Update (EIA)

4 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2004 The EIA-176 Query System is a Windows-based system which runs under Windows operating systems 95,...

37

EIA 176 Query System, 2002  

Gasoline and Diesel Fuel Update (EIA)

2 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2002 EIA 176 Query System 2002 Release date: February 2, 2004 Next release date: February 2005 The...

38

Automatic categorization of query results  

Science Conference Proceedings (OSTI)

Exploratory ad-hoc queries could return too many answers - a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically categorize the results of SQL queries to address this problem. We dynamically generate ...

Kaushik Chakrabarti; Surajit Chaudhuri; Seung-won Hwang

2004-06-01T23:59:59.000Z

39

Ranking entities using web search query logs  

Science Conference Proceedings (OSTI)

Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In this paper we propose a novel approach to Entity Retrieval by using Web search engine ...

Bodo Billerbeck; Gianluca Demartini; Claudiu S. Firan; Tereza Iofciu; Ralf Krestel

2010-09-01T23:59:59.000Z

40

compound queries | OpenEI Community  

Open Energy Info (EERE)

- 15:22 Multicolor Maps from Compound Queries ask queries compound queries developer Google maps maps multicolor result formats results Semantic Mediawiki Hi all, Recently, a...

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


41

ask queries | OpenEI Community  

Open Energy Info (EERE)

- 15:22 Multicolor Maps from Compound Queries ask queries compound queries developer Google maps maps multicolor result formats results Semantic Mediawiki Hi all, Recently, a...

42

Query clustering using user logs  

Science Conference Proceedings (OSTI)

Query clustering is a process used to discover frequently asked questions or most popular topics on a search engine. This process is crucial for search engines based on question-answering. Because of the short lengths of queries, approaches based on ... Keywords: Query clustering, search engine, user log, web data mining

2002-01-01T23:59:59.000Z

43

A Semantic Graph Query Language  

Science Conference Proceedings (OSTI)

Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.

Kaplan, I L

2006-10-16T23:59:59.000Z

44

Ambiguous queries: test collections need more sense  

Science Conference Proceedings (OSTI)

Although there are many papers examining ambiguity in Information Retrieval, this paper shows that there is a whole class of ambiguous word that past research has barely explored. It is shown that the class is more ambiguous than other word types and ... Keywords: ambiguous queries, diversity, test collections

Mark Sanderson

2008-07-01T23:59:59.000Z

45

Analyzing linguistic structure of web search queries  

Science Conference Proceedings (OSTI)

It is believed that Web search queries are becoming more structurally complex over time. However, there has been no systematic study that quantifies such characteristics. In this thesis, we propose that queries are evolving into a unique linguistic system. ... Keywords: query intent, query segmentation, query structure, query understanding, word co-occurrence networks

Rishiraj Saha Roy

2013-05-01T23:59:59.000Z

46

Semantic optimization techniques for preference queries  

Science Conference Proceedings (OSTI)

Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are parameterized by specific preference relations. Semantic optimization techniques ... Keywords: Integrity constraints, Preference queries, Query evaluation, Query optimization

Jan Chomicki

2007-07-01T23:59:59.000Z

47

Alta Vista: Simple Query "merde d'alors" - CECM  

E-Print Network (OSTI)

Tip: To use all these apples: +apple pie tart cookie torte muffin. Ignored: merde d alors:0. No documents match the query. The term does not appear in the index.

48

Evaluating verbose query processing techniques  

E-Print Network (OSTI)

Verbose or long queries are a small but significant part of the query stream in web search, and are common in other applications such as collaborative question answering (CQA). Current search engines perform well with keyword queries but are not, in general, effective for verbose queries. In this paper, we examine query processing techniques which can be applied to verbose queries prior to submission to a search engine in order to improve the search engine’s results. We focus on verbose queries that have sentence-like structure, but are not simple “wh- ” questions, and assume the search engine is a “black box. ” We evaluated the output of two search engines using queries from a CQA service and our results show that, among a broad range of techniques, the most effective approach is to simply reduce the length of the query. This can be achieved effectively by removing “stop structure ” instead of only stop words. We show that the process of learning and removing stop structure from a query can be effectively automated.

Samuel Huston; W. Bruce Croft

2010-01-01T23:59:59.000Z

49

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

E-Print Network (OSTI)

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

Hiemstra, Djoerd

50

EIA 176 Query System, 2004  

Gasoline and Diesel Fuel Update (EIA)

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

51

EIA 176 Query System, 2001  

Gasoline and Diesel Fuel Update (EIA)

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

52

EIA 176 Query System, 2003  

Gasoline and Diesel Fuel Update (EIA)

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

53

Structured Queries for Legal Search  

Science Conference Proceedings (OSTI)

... Track. It takes the keywords in RequestText to form a bag-of-words query using the “#combine” operator in In- dri. Common ...

2008-02-05T23:59:59.000Z

54

CQ - Code selection through query.  

E-Print Network (OSTI)

??This thesis proposes a query language for code selection. It is designed to work on virtual machine based languages and is intended to be used… (more)

ZENZARO, SIMONE

2010-01-01T23:59:59.000Z

55

Query Expansion for Microblog Retrieval  

Science Conference Proceedings (OSTI)

... Specifically, we used the Google Search API (GSA) to retrieve pages from the Web, and used the titles to expand queries. ...

2012-02-03T23:59:59.000Z

56

Efficient query recommendations in the long tail via center-piece subgraphs  

E-Print Network (OSTI)

We present a recommendation method based on the wellknown concept of center-piece subgraph, that allows for the time/space efficient generation of suggestions also for rare, i.e., long-tail queries. Our method is scalable with respect to both the size of datasets from which the model is computed and the heavy workloads that current web search engines have to deal with. Basically, we relate terms contained into queries with highly correlated queries in a query-flow graph. This enables a novel recommendation generation method able to produce recommendations for approximately 99 % of the workload of a real-world search engine. The method is based on a graph having term nodes, query nodes, and two kinds of connections: term-query and query-query. The first connects a term to the queries in which it is contained, the second connects two query nodes if the likelihood that a user submits the second query after having issued the first one is sufficiently high. On such large graph we need to compute the center-piece subgraph induced by terms contained into queries. In order to reduce the cost of the above computation, we introduce a novel and efficient method based on an inverted index representation of the model. We experiment our solution on two real-world query logs and we show that its effectiveness is comparable (and in some case better) than state-of-the-art methods for head-queries. More importantly, the quality of the recommendations generated remains very high also for long-tail queries, where other methods fail even to produce any suggestion. Finally, we extensively investigate scalability and efficiency issues and we show the viability of our method in real world search engines. 1.

Francesco Bonchi; Raffaele Perego; Hossein Vahabi; Rossano Venturini; Fabrizio Silvestri

2012-01-01T23:59:59.000Z

57

Exploiting underrepresented query aspects for automatic query expansion  

Science Conference Proceedings (OSTI)

Users attempt to express their search goals through web search queries. When a search goal has multiple components or aspects, documents that represent all the aspects are likely to be more relevant than those that only represent some aspects. Current ... Keywords: aspect coverage, global document analysis, query expansion, web search

Daniel Wayne Crabtree; Peter Andreae; Xiaoying Gao

2007-08-01T23:59:59.000Z

58

Using semantic knowledge to improve web query processing  

Science Conference Proceedings (OSTI)

Although search engines are very useful for obtaining information from the World Wide Web, users still have problems obtaining the most relevant information when processing their web queries. Prior research has attempted to use different types of knowledge ...

Jordi Conesa; Veda C. Storey; Vijayan Sugumaran

2006-05-01T23:59:59.000Z

59

Preference formulas in relational queries  

Science Conference Proceedings (OSTI)

The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others, preferences are used for information filtering and extraction to reduce the volume of data presented to the user. They ... Keywords: Preference queries, preferences, query optimization, relational algebra

Jan Chomicki

2003-12-01T23:59:59.000Z

60

Depth estimation for ranking query optimization  

Science Conference Proceedings (OSTI)

A relational ranking query uses a scoring function to limit the results of a conventional query to a small number of the most relevant answers. The increasing popularity of this query paradigm has led to the introduction of specialized rank join operators ... Keywords: DEEP, Data statistics, Depth estimation, Query optimization, Relational ranking query, Top-k

Karl Schnaitter; Joshua Spiegel; Neoklis Polyzotis

2009-04-01T23:59:59.000Z

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


61

Context-sensitive query auto-completion  

Science Conference Proceedings (OSTI)

Query auto completion is known to provide poor predictions of the user's query when her input prefix is very short (e.g., one or two characters). In this paper we show that context, such as the user's recent queries, can be used to improve the prediction ... Keywords: context-awareness, query auto-completion, query expansion

Ziv Bar-Yossef; Naama Kraus

2011-03-01T23:59:59.000Z

62

Bipolar queries: An aggregation operator focused perspective  

Science Conference Proceedings (OSTI)

The concept of a bipolar query, meant as a database query that involves both negative and positive conditions, is discussed from the point of view of flexible database querying and modeling of more sophisticated intentions and preferences of the user. ... Keywords: Aggregation operators, Bipolar queries, Flexible queries, Fuzzy logic, Logical connectives modeling

S?awomir Zadro?ny; Janusz Kacprzyk

2012-06-01T23:59:59.000Z

63

Ontology-based automatic query refinement  

Science Conference Proceedings (OSTI)

The effectiveness of user query plays a vital role in retrieving highly relevant documents in keyword-based search engine. Because of the lack of domain knowledge, users tend to post very short queries, which do not express their information need ... Keywords: automatic query refinement, document retrieval, information retrieval, keywords, ontology, query expansion, retrieval relevancy, search engines, semantic search, user queries

S. Sendhilkumar; G. S. Mahalakshmi; S. N. Rajasekar

2009-07-01T23:59:59.000Z

64

EIA 176 Query System, 2002  

Gasoline and Diesel Fuel Update (EIA)

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

65

SPARQL Query Form | OpenEI  

Open Energy Info (EERE)

624878 Varnish cache server SPARQL Query Form Default Graph URI Query text select distinct ?Concept where a ?Concept LIMIT 100 Display Results As: Auto HTML Spreadsheet XML...

66

RISQ - Query Selection Criteria  

Science Conference Proceedings (OSTI)

Figure 2 - RISQ Search. ... Selected Taxonomy Terms. Threat Analysis. ... To define a custom keyword: Enter the keyword in text form in the box to the left. ...

67

EIA 176 Query System, 2000  

U.S. Energy Information Administration (EIA)

The EIA-176 Query system is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later.

68

EIA 176 Query System, 2004  

U.S. Energy Information Administration (EIA)

The EIA-176 Query System is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later. It provides a method of ...

69

EIA-176 Query System 2005  

U.S. Energy Information Administration (EIA)

Release Date: November 22, 2006 The EIA-176 Query System is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or ...

70

Adaptively parallelizing distributed range queries  

Science Conference Proceedings (OSTI)

We consider the problem of how to best parallelize range queries in a massive scale distributed database. In traditional systems the focus has been on maximizing parallelism, for example by laying out data to achieve the highest throughput. However, ...

Ymir Vigfusson; Adam Silberstein; Brian F. Cooper; Rodrigo Fonseca

2009-08-01T23:59:59.000Z

71

Usability of XML Query Languages.  

E-Print Network (OSTI)

??The eXtensible Markup Language (XML) is a markup language which enables re-use of information. Specific query languages for XML are developed to facilitate this. There… (more)

Graaumans, Joris Petrus Maria

2005-01-01T23:59:59.000Z

72

Natural Gas Annual Respondent Query System  

Gasoline and Diesel Fuel Update (EIA)

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

73

Multi-query SQL progress indicators  

E-Print Network (OSTI)

Abstract. Recently, progress indicators have been proposed for SQL queries in RDBMSs. All previously proposed progress indicators consider each query in isolation, ignoring the impact simultaneously running queries have on each other’s performance. In this paper, we explore a multi-query progress indicator, which explicitly considers concurrently running queries and even queries predicted to arrive in the future when producing its estimates. We demonstrate that multi-query progress indicators can provide more accurate estimates than single-query progress indicators. Moreover, we extend the use of progress indicators beyond being a GUI tool and show how to apply multi-query progress indicators to workload management. We report on an initial implementation of a multi-query progress indicator in PostgreSQL and experiments with its use both for estimating remaining query execution time and for workload management. 1

Gang Luo; Jeffrey F. Naughton; Philip S. Yu

2006-01-01T23:59:59.000Z

74

On implementing provenance-aware regular path queries with relational query engines  

Science Conference Proceedings (OSTI)

Use of graphs is growing rapidly in social networks, semantic web, biological databases, scientific workflow provenance, and other areas. Regular Path Queries (RPQs) can be seen as a core graph query language to answer pattern-based reachability queries. ... Keywords: datalog, graph querying, regular path queries

Saumen Dey; Víctor Cuevas-Vicenttín; Sven Köhler; Eric Gribkoff; Michael Wang; Bertram Ludäscher

2013-03-01T23:59:59.000Z

75

Real life, real users, and real needs: a study and analysis of user queries on the web  

E-Print Network (OSTI)

searches are based on the exact terms that a user enters in the query, however, capitalization terms in addition to terms entered. Search results are provided in ranked relevance order. A number, and use of relevance feedback; (ii) queries Ð the number of search terms, and the use of logic and modi

76

Rapid Development of Web-Based Query Interfaces for XML Datasets with QURSED  

E-Print Network (OSTI)

User Interfaces, XML, Query Interface. 1. INTRODUCTION Web-based query forms and reports (QFRs) allow and reports (QFRs). Each publication element can be classified into one of three types based on its structure, i.e. an article (journal), a book or an inproceedings (conference). While all types of publications

Petropoulos, Michalis

77

SEMISTRUCTURED PROBABILISTIC OBJECT QUERY LANGUAGE (A Query Language for Semistructured Probabilistic Data).  

E-Print Network (OSTI)

??This work presents SPOQL, a structured query language for Semistructured Probabilistic Object (SPO) model [4]. The original query language for semistructured probabilistic database management system… (more)

Gutti, Praveen

2007-01-01T23:59:59.000Z

78

Towards Optimal Multi-Dimensional Query Processing with BitmapIndices  

Science Conference Proceedings (OSTI)

Bitmap indices have been widely used in scientific applications and commercial systems for processing complex, multi-dimensional queries where traditional tree-based indices would not work efficiently. This paper studies strategies for minimizing the access costs for processing multi-dimensional queries using bitmap indices with binning. Innovative features of our algorithm include (a) optimally placing the bin boundaries and (b) dynamically reordering the evaluation of the query terms. In addition, we derive several analytical results concerning optimal bin allocation for a probabilistic query model. Our experimental evaluation with real life data shows an average I/O cost improvement of at least a factor of 10 for multi-dimensional queries on datasets from two different applications. Our experiments also indicate that the speedup increases with the number of query dimensions.

Rotem, Doron; Stockinger, Kurt; Wu, Kesheng

2005-09-30T23:59:59.000Z

79

A system for semantic query optimization  

Science Conference Proceedings (OSTI)

This paper describes a scheme to utilize semantic integrity constraints in optimizing a user specified query. The scheme uses a graph theoretic approach to identify redundant join clauses and redundant restriction clauses specified in a user query. An ...

Sreekumar T. Shenoy; Z. Meral Ozsoyoglu

1987-12-01T23:59:59.000Z

80

Query expansion techniques for question answering  

E-Print Network (OSTI)

Query expansion is a technique used to boost performance of a document retrieval engine, such as those commonly found in question answering (QA) systems. Common methods of query expansion for Boolean keyword-based document ...

Bilotti, Matthew W. (Matthew William), 1981-

2004-01-01T23:59:59.000Z

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


81

Category:Query Results Templates | Open Energy Information  

Open Energy Info (EERE)

Query Results Templates Jump to: navigation, search This is the Query Results Templates category. Pages in category "Query Results Templates" The following 4 pages are in this...

82

A Customized Web Search Engine Using a Tiny WebSQL Query Language  

E-Print Network (OSTI)

and indexed to be stored in the search engine's database. When a user enters a #12; 7 search query After the user enters the keywords as the search query, the search engine will perform the search with the stemming, which is the grammatical variation of search terms such as "eat" and "eating". 3. It cannot

83

Answering XML queries using materialized views revisited  

Science Conference Proceedings (OSTI)

Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whether a query can be answered exclusively using one or multiple materialized ... Keywords: XML, materialized views, xpath query evaluation

Xiaoying Wu; Dimitri Theodoratos; Wendy Hui Wang

2009-11-01T23:59:59.000Z

84

Depth estimation for ranking query optimization  

Science Conference Proceedings (OSTI)

A relational ranking query uses a scoring function to limit the results of a conventional query to a small number of the most relevant answers. The increasing popularity of this query paradigm has led to the introduction of specialized rank join operators ...

Karl Schnaitter; Joshua Spiegel; Neoklis Polyzotis

2007-09-01T23:59:59.000Z

85

MIL primitives for querying a fragmented world  

Science Conference Proceedings (OSTI)

In query-intensive database application areas, like decision support and data mining, systems that use vertical fragmentation have a significant performance advantage. In order to support relational or object oriented applications on top of such a fragmented ... Keywords: Database systems, Main-memory techniques, Query languages, Query optimization, Vertical fragmentation

Peter A. Boncz; Martin L. Kersten

1999-10-01T23:59:59.000Z

86

Efficiently approximating query optimizer plan diagrams  

Science Conference Proceedings (OSTI)

Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the optimizer over the query parameter space. These diagrams have proved to ...

Atreyee Dey; Sourjya Bhaumik; Harish D; Jayant R. Haritsa

2008-08-01T23:59:59.000Z

87

Schemes of storing XML query cache  

Science Conference Proceedings (OSTI)

XML query caching for XML database-backed Web applications began to be investigated recently. However, the issue of how the cached query results are stored has not been addressed despite its practical significance. In this paper, we deal with ... Keywords: DOM, PDOM, XML query cache, XML update, incremental cache refresh

Hyunchul Kang; Seungchul Han; Younghyun Kim

2005-01-01T23:59:59.000Z

88

Query weighting for ranking model adaptation  

Science Conference Proceedings (OSTI)

We propose to directly measure the importance of queries in the source domain to the target domain where no rank labels of documents are available, which is referred to as query weighting. Query weighting is a key step in ranking model adaptation. As ...

Peng Cai; Wei Gao; Aoying Zhou; Kam-Fai Wong

2011-06-01T23:59:59.000Z

89

SENSTRAC: scalable querying of sensor networks from mobile platforms using tracking-style queries  

Science Conference Proceedings (OSTI)

Future applications running on mobile platforms will sometimes need to query sensors and track sensor data over time. This paper proposes a novel, but natural, solution to querying sensors from mobile platforms, based on the publish-subscribe paradigm. ... Keywords: MANET, SENSTRAC, ad hoc networks, mobile networks, publish-subscribe, query, querying sensors, scalability, sensor networks

Stefan Pleisch; Kenneth P. Birman

2008-06-01T23:59:59.000Z

90

Quantum query complexity for qutrits  

Science Conference Proceedings (OSTI)

We compute lower bounds for the exact quantum query complexity of a ternary function f. The lower bound is of order O(log{sub 3}(n)). In case f is symmetric on a sphere then the lower bound is of order O({radical}(n)). This work is a natural continuation of the work of Beals, Buhrman, Cleve, Mosca, and de Wolf on lower limits for binary functions.

Tamir, Boaz [Department of HPS, Bar Ilan University, Ramat Gan (Israel)

2008-02-15T23:59:59.000Z

91

Effective Graph Clustering for Path Queries in Digital Map Databases  

E-Print Network (OSTI)

In this paper, we present an experimental evaluation of graph clustering strategies in terms of their effectiveness in optimizing I/O for path query processing in digital map databases. Clustering optimization is attractive because it does not incurs any run-time cost, and is complimentary to many of the existing techniques in path query optimization. We first propose a novel graph clustering technique, called Spatial Partition Clustering (SPC), that creates balanced partitions of links based on the spatial proximity of their origin nodes. We then select three alternative clustering techniques from the literature, namely two-way partitioning, approximately topological clustering, and random clustering, to compare their performance in path query processing with SPC. Experimental evaluation indicates that our SPC performs the best for the high-locality graphs (such as GIS maps), whereas the two-way partitioning approach performs the best for no-locality random graphs. 1 Introduction 1....

Yun-Wu Huang; Ning Jing; Elke A. Rundensteiner

1996-01-01T23:59:59.000Z

92

Parallel Index and Query for Large Scale Data Analysis  

SciTech Connect

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

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

2011-07-18T23:59:59.000Z

93

Example Queries | Open Energy Information  

Open Energy Info (EERE)

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

94

Real life information retrieval: a study of user queries on the Web  

E-Print Network (OSTI)

related terms in addition to terms entered. Search results are provided in a ranked relevance order data on: (i) queries - the number of search terms, and the use of logic and modifiers, (ii) sessions) terms - their rank/frequency distribution and the most highly used search terms. Common mistakes

Jansen, James

95

Real Life Information Retrieval: A Study Of User Queries On The Web Major Bemard J. Jansen  

E-Print Network (OSTI)

related terms in addition to terms entered. Search results are provided in a ranked relevance order data on: (i) queries - the number of search terms, and the use of logic and modifiers, (ii) terms - their rank/frequency distribution and the most highly used search terms. Common mistakes

Jansen, James

96

Query  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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

97

Structured Query Language for Virtual Observatory  

E-Print Network (OSTI)

Currently two query languages are defined as standards for the Virtual Observatory (VO). Astronomical Data Query Language (ADQL) is used for catalog data query and Simple Image Access Protocol (SIAP) is for image data query. As a result, when we query each data service, we need to know in advance which language is supported and then construct a query language accordingly. The construct of SIAP is simple, but they have a limited capability. For example, there is no way to specify multiple regions in one query, and it is difficult to specify complex query conditions. In this paper, we propose a unified query language for any kind of astronomical database on the basis of SQL99. SQL is a query language optimized for a table data, so to apply the SQL to the image and spectrum data set, the data structure need to be mapped to a table like structure. We present specification of this query language and an example of the architecture for the database system.

Yuji Shirasaki; Masatoshi Ohishi; Yoshihiko Mizumoto; Masahiro Tanaka; Satoshi Honda; Masafumi Oe; Naoki Yasuda; Yoshifumi Masunaga

2004-11-19T23:59:59.000Z

98

Evaluation of top-k OLAP queries using aggregate r–trees  

Science Conference Proceedings (OSTI)

A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example of such a query is “find the 10 combinations of product-type ...

Nikos Mamoulis; Spiridon Bakiras; Panos Kalnis

2005-08-01T23:59:59.000Z

99

Secure quantum private information retrieval using phase-encoded queries  

Science Conference Proceedings (OSTI)

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

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

2011-08-15T23:59:59.000Z

100

Integrating implicit answers with object-oriented queries  

E-Print Network (OSTI)

Queries in object-oriented datab;Lqcs are formulated against a class and retrieve instnnccls of the class sat,is-fying a certain predicate on the att,riblltes of the class. The presence of a class hierarchy, an integral part of any object-oriented data model, allows answers to be expressed implicitly in terms of classes and instances. This enables answers to be provided at different levels of abstraction. Shum and Muntz [SM88] presented a way of providing implicit expressions based on a taxonomy defined over the database. The algorithm presented in [SM88] is optimal in the length of the answer but the clarity of the answer is often poor. In this paper, the fo-cus is on coherent answers: implicit answers that are not necessarily optimal in the number of terms but are easy to comprehend. We show that a uniqlle coherent answer can be obtained efficiently in a top down nlanncr. Since the objective is to provide cohcrcnt, answers, and user queries are formulated by means of query operators to access the database, the standard query operators are redefined to obtain and manipulate coherent answers. Coherent answers are useful in coping with information complexity as they allow answers to be represented ab-stractly and are also a useful rctprescntation tool for complex information systems. 1

Hava T. Siegelmann

1991-01-01T23:59:59.000Z

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


101

Improving query performance in virtual data warehouses  

Science Conference Proceedings (OSTI)

In order to improve the quality of Business Intelligence Systems in an organization we can choose to build the system using BI techniques such as OLAP and data warehousing or by using traditional reports based on SQL queries. The cost and developing ... Keywords: SQL query plans, analytical functions, business intelligence projects, data extraction, indexes, partitioning techniques, query optimization and performance, tuning and optimization, virtual data warehouse

Adela Bâra; Ion Lungu; Manole Velicanu; Vlad Diaconita; Iuliana Botha

2008-05-01T23:59:59.000Z

102

Logical queries over views: Decidability and expressiveness  

Science Conference Proceedings (OSTI)

We study the problem of deciding the satisfiability of first-order logic queries over views, with our aim to delimit the boundary between the decidable and the undecidable fragments of this language. Views currently occupy a central place in database ... Keywords: Löwenheim class, Satisfiability, conjunctive query, containment, database query, database view, decidability, first-order logic, monadic logic, ontology reasoning, unary logic, unary view

James Bailey; Guozhu Dong; Anthony WIDJAJA To

2010-01-01T23:59:59.000Z

103

Effective Structured Query Formulation for Session Search  

Science Conference Proceedings (OSTI)

... For instance, in TREC 2011 session 11 query “hawaii real estate average resale value house or condo news”, we discover that “hawaii real” and ...

2013-02-12T23:59:59.000Z

104

Decision trees with AND, OR queries  

Science Conference Proceedings (OSTI)

We investigate decision trees in which one is allowed to query threshold functions of subsets of variables. We are mainly interested in the case where only queries of AND and OR are allowed. This model is a generalization of the classical decision tree ... Keywords: AND, OR queries, Boolean functions, CRCW PRAM machines, Ethernet channel, complexity, computational complexity, copy computation, decision theory, decision trees, depth-three circuits, determinism, direct sum problem, nondeterminism, parallel time, query threshold functions, random processes, randomization, required decision tree depth, size complexity, threshold-k function, tight lower bound, trees (mathematics), variable subsets

Y. Ben-Asher; I. Newman

1995-06-01T23:59:59.000Z

105

Querying Allocations Using cbank | Argonne Leadership Computing...  

NLE Websites -- All DOE Office Websites (Extended Search)

apply to the resource (machine) to which a user is currently logged in. For example, a query on Surveyor about PROJECTNAME will return information about the Surveyor allocation...

106

Ontology query languages for the Semantic Web.  

E-Print Network (OSTI)

??Ontology languages and corresponding query languages play key roles for representing and processing information about the real world for the emerging Semantic Web. Efforts have… (more)

Zhang, Zhijun

2005-01-01T23:59:59.000Z

107

Predicting Query Performance in Intranet Search  

E-Print Network (OSTI)

Macdonald,C. He,B. Ounis,I. In Proceedings of the ACM SIGIR'05 Query Prediction Workshop. August 19, 2005, Salvador, Brazil.

Macdonald, C.; He, B.; Ounis, I.

108

Query expansion techniques for question answering.  

E-Print Network (OSTI)

??Query expansion is a technique used to boost performance of a document retrieval engine, such as those commonly found in question answering (QA) systems. Common… (more)

Bilotti, Matthew W. (Matthew William), 1981-

2004-01-01T23:59:59.000Z

109

Integrated k-NN query processing based on geospatial data services  

Science Conference Proceedings (OSTI)

Geospatial data service (GDS) is a type of web service that provides access to collections of geospatial data. User can search remote spatial data through the interface provided by service. This paper focuses on integrated k-NN query processing ...

Guifen Tang; Luo Chen; Yunxiang Liu; Shulei Liu; Ning Jing

2005-11-01T23:59:59.000Z

110

Top-k typicality queries and efficient query answering methods on large databases  

Science Conference Proceedings (OSTI)

Finding typical instances is an effective approach to understand and analyze large data sets. In this paper, we apply the idea of typicality analysis from psychology and cognitive science to database query answering, and study the novel problem of answering ... Keywords: Efficient query answering, Top-k query, Typicality analysis

Ming Hua; Jian Pei; Ada W. Fu; Xuemin Lin; Ho-Fung Leung

2009-06-01T23:59:59.000Z

111

Accelerating Network Traffic Analytics Using Query-DrivenVisualization  

SciTech Connect

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

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

2006-07-29T23:59:59.000Z

112

Observing SQL queries in their natural habitat  

Science Conference Proceedings (OSTI)

We describe Habitat, a declarative observational debugger for SQL. Habitat facilitates true language-level (not: plan-level) debugging of, probably flawed, SQL queries that yield unexpected results. Users mark SQL subexpressions ... Keywords: Declarative debugging, SQL, query languages, relational databases

Torsten Grust; Jan Rittinger

2013-04-01T23:59:59.000Z

113

Processing top k queries from samples  

Science Conference Proceedings (OSTI)

Top-k queries are desired aggregation operations on data sets. Examples of queries on network data include the top 100 source AS's, top 100 ports, or top Domain names over IP packets or over IP flow records. Since the complete dataset is often ...

Edith Cohen; Nadav Grossaug; Haim Kaplan

2006-12-01T23:59:59.000Z

114

Ranking class labels using query sessions  

Science Conference Proceedings (OSTI)

The role of search queries, as available within query sessions or in isolation from one another, in examined in the context of ranking the class labels (e.g., brazilian cities, business centers, hilly sites) extracted from Web documents for various ...

Marius Pa?ca

2011-06-01T23:59:59.000Z

115

Queries as anchors: selection by association  

Science Conference Proceedings (OSTI)

This paper introduces a new method for linking the world view of the search engine user community with that of the search engine itself. This new method is based on collecting and aggregating associative query trails in the form of query reformulation ... Keywords: document expansion, index enhancement, reformulation analysis

Einat Amitay; Adam Darlow; David Konopnicki; Uri Weiss

2005-09-01T23:59:59.000Z

116

Query-Answering CG Knowledge Bases  

Science Conference Proceedings (OSTI)

Conceptual graphs are a good choice for constructing and exploiting a knowledge base. In several of our projects (semantic portal for e-tourism, exploitation of digital object corpus, etc.), we have to query such bases. So it is natural to consider queries ...

Michel Leclère; Nicolas Moreau

2008-07-01T23:59:59.000Z

117

Optimized query routing trees for wireless sensor networks  

Science Conference Proceedings (OSTI)

In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be transmitted to the querying node. ... Keywords: Critical path method, Query routing trees, Sensor networks

Panayiotis Andreou; Demetrios Zeinalipour-Yazti; Andreas Pamboris; Panos K. Chrysanthis; George Samaras

2011-04-01T23:59:59.000Z

118

Building an Efficient Preference XML Query Processor  

E-Print Network (OSTI)

Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enabling users to express individual interests and delivering personalized information. As the structure of XML documents plays a major part in retrieval, users often have specific preferences about the structure. For evaluation a query has to be unfolded into an entire set of queries filling the structure with more or less preferred values. Since such structure expansions typically contain redundancies, it is important to identify and simplify necessary expansion queries for effective evaluation. To address these issues, we developed a preference query optimizer that not only determines an optimal set of expansion queries, but also preserves the specific ordering induced by the user preferences with respect to Pareto optimality.

Sungran Cho; Wolf-tilo Balke

2009-01-01T23:59:59.000Z

119

Disambiguated query suggestions and personalized content-similarity and novelty ranking of clustered results to optimize web searches  

Science Conference Proceedings (OSTI)

In this paper, we face the so called ''ranked list problem'' of Web searches, that occurs when users submit short requests to search engines. Generally, as a consequence of terms' ambiguity and polysemy, users engage long cycles of query reformulation ... Keywords: Novelty ranking, Personalized Web results ranking, Query disambiguation, Results clustering, Web meta-searching

Gloria Bordogna; Alessandro Campi; Giuseppe Psaila; Stefania Ronchi

2012-05-01T23:59:59.000Z

120

Natural Gas EIA-176 Query System Readme(1999)  

Annual Energy Outlook 2012 (EIA)

176 Query System Readme 1.0 INTRODUCTION TO THE EIA-176 FRONT END QUERY FACILITY This system provides a method of extracting and using the EIA-176 data, and saving the query...

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


121

A Belief Model of Query Difficulty That Uses Subjective Logic  

Science Conference Proceedings (OSTI)

The difficulty of a user query can affect the performance of Information Retrieval (IR) systems. This work presents a formal model for quantifying and reasoning about query difficulty as follows: Query difficulty is considered to be a subjective belief, ...

Christina Lioma; Roi Blanco; Raquel Mochales Palau; Marie-Francine Moens

2009-09-01T23:59:59.000Z

122

Experimental quantum private queries with linear optics  

Science Conference Proceedings (OSTI)

The quantum private query is a quantum cryptographic protocol to recover information from a database, preserving both user and data privacy: the user can test whether someone has retained information on which query was asked and the database provider can test the amount of information released. Here we discuss a variant of the quantum private query algorithm that admits a simple linear optical implementation: it employs the photon's momentum (or time slot) as address qubits and its polarization as bus qubit. A proof-of-principle experimental realization is implemented.

De Martini, Francesco [Dipartimento di Fisica, dell'Universita 'La Sapienza', Roma 00185 (Italy); Accademia Nazionale dei Lincei, via della Lungara 10, Roma 00165 (Italy); Giovannetti, Vittorio [NEST-CNR-INFM and Scuola Normale Superiore, Piazza dei Cavalieri 7, 56126 Pisa (Italy); Lloyd, Seth [MIT, RLE, and Department of Mechanical Engineering, MIT 3-160, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 (United States); Maccone, Lorenzo [Institute for Scientific Interchange, 10133 Torino (Italy); QUIT, Dip. Fisica A. Volta, 27100 Pavia (Italy); Nagali, Eleonora; Sansoni, Linda; Sciarrino, Fabio [Dipartimento di Fisica, dell'Universita 'La Sapienza', Roma 00185 (Italy)

2009-07-15T23:59:59.000Z

123

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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

124

Ordering the attributes of query results  

Science Conference Proceedings (OSTI)

There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank aggregation, and algorithms for merging of ordered lists. In many applications, ...

Gautam Das; Vagelis Hristidis; Nishant Kapoor; S. Sudarshan

2006-06-01T23:59:59.000Z

125

Probabilistic ranking of database query results  

Science Conference Proceedings (OSTI)

We investigate the problem of ranking answers to a database query when many tuples are returned. We adapt and apply principles of probabilistic models from Information Retrieval for structured data. Our proposed solution is domain independent. It leverages ...

Surajit Chaudhuri; Gautam Das; Vagelis Hristidis; Gerhard Weikum

2004-08-01T23:59:59.000Z

126

Querying Incomplete Data over Extended ER Schemata  

E-Print Network (OSTI)

Since Chen's Entity-Relationship (ER) model, conceptual modeling has been playing a fundamental role in relational data design. In this paper we consider an extended ER (EER) model enriched with cardinality constraints, disjointness assertions, and is-a relations among both entities and relationships. In this setting, we consider the case of incomplete data, which is likely to occur, for instance, when data from different sources are integrated. In such a context, we address the problem of providing correct answers to conjunctive queries by reasoning on the schema. Based on previous results about decidability of the problem, we provide a query answering algorithm that performs rewriting of the initial query into a recursive Datalog query encoding the information about the schema. We finally show extensions to more general settings.

Cali, Andrea

2010-01-01T23:59:59.000Z

127

Table Name query? | OpenEI Community  

Open Energy Info (EERE)

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

128

Indexing a dictionary for subset matching queries  

Science Conference Proceedings (OSTI)

We consider a subset matching variant of the Dictionary Query problem. Consider a dictionary D of n strings, where each string location contains a set of characters drawn from some alphabet ?={1,...,|?|}. Our goal is to ...

Gad M. Landau; Dekel Tsur; Oren Weimann

2010-01-01T23:59:59.000Z

129

Indexing a dictionary for subset matching queries  

Science Conference Proceedings (OSTI)

We consider a subset matching variant of the Dictionary Query problem. Consider a dictionary D of n strings, where each string location contains a set of characters drawn from some alphabet ?. Our goal is to preprocess D so ...

Gad M. Landau; Dekel Tsur; Oren Weimann

2007-10-01T23:59:59.000Z

130

Enabling ?-approximate querying in sensor networks  

Science Conference Proceedings (OSTI)

Data approximation is a popular means to support energy-efficient query processing in sensor networks. Conventional data approximation methods require users to specify fixed error bounds a prior to address the trade-off between result accuracy ...

Liu Yu; Jianzhong Li; Hong Gao; Xiaolin Fang

2009-08-01T23:59:59.000Z

131

The DEDALE system for complex spatial queries  

Science Conference Proceedings (OSTI)

This paper presents DEDALE, a spatial database system intended to overcome some limitations of current systems by providing an abstract and non-specialized data model and query language for the representation and manipulation of spatial objects. DEDALE ...

Stéphane Grumbach; Philippe Rigaux; Luc Segoufin

1998-06-01T23:59:59.000Z

132

Implementing Graph Pattern Queries on a Relational Database  

Science Conference Proceedings (OSTI)

When a graph database is implemented on top of a relational database, queries in the graph query language are translated into relational SQL queries. Graph pattern queries are an important feature of a graph query language. Translating graph pattern queries into single SQL statements results in very poor query performance. By taking into account the pattern query structure and generating multiple SQL statements, pattern query performance can be dramatically improved. The performance problems encountered with the single SQL statements generated for pattern queries reflects a problem in the SQL query planner and optimizer. Addressing this problem would allow relational databases to better support semantic graph databases. Relational database systems that provide good support for graph databases may also be more flexible platforms for data warehouses.

Kaplan, I L; Abdulla, G M; Brugger, S T; Kohn, S R

2007-12-26T23:59:59.000Z

133

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

E-Print Network (OSTI)

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

California at San Diego, University of

134

Query clustering using content words and user feedback  

Science Conference Proceedings (OSTI)

Query clustering is crucial for automatically discovering frequently asked queries (FAQs) or most popular topics on a question-answering search engine. Due to the short length of queries, the traditional approaches based on keywords are not suitable ... Keywords: log mining, query clustering, user feedback, web search

Ji-Rong Wen; Jian-Yun Nie; Hong-Jiang Zhang

2001-09-01T23:59:59.000Z

135

On applying temporal database concepts to event queries  

Science Conference Proceedings (OSTI)

Temporal databases and query languages have been a subject of research for more than 30 years and are a natural fit for expressing queries that involve a temporal dimension. This paper makes an argument for an event query language that incorporates temporal ... Keywords: event processing, temporal databases, temporal queries

Foruhar Ali Shiva; Susan D. Urban

2011-11-01T23:59:59.000Z

136

Semantic errors in SQL queries: a quite complete list  

Science Conference Proceedings (OSTI)

We investigate classes of SQL queries which are syntactically correct, but certainly not intended, no matter for which task the query was written. For instance, queries that are contradictory, i.e. always return the empty set, are obviously not intended. ... Keywords: SQL, SQL exams, bugs, database courses, databases, errors, logical errors, queries, semantic errors, software correctness, static analysis, teaching

Stefan Brass; Christian Goldberg

2006-05-01T23:59:59.000Z

137

Monitoring the dynamic web to respond to continuous queries  

Science Conference Proceedings (OSTI)

Continuous queries are queries for which responses given to users must be continuously updated, as the sources of interest get updated. Such queries occur, for instance, during on-line decision making, e.g., traffic flow control, weather monitoring, ... Keywords: allocation policies, continuous queries

Sandeep Pandey; Krithi Ramamritham; Soumen Chakrabarti

2003-05-01T23:59:59.000Z

138

An interactive visual query interface on spatial/ temporal data  

E-Print Network (OSTI)

Abstract: In this paper a visual approach for the query interface on the spatial/temporal data is described, which is designed for the users who know nothing about query languages. Based on concept of elementary query and query operators, a complex spatial/temporal query could be built as a compound query which is broken down into several interactive iterations. In each of iterations, users just need to build a simple elementary query and select a query operator, which greatly reduces the mental load of users. To make query building more efficient, a novel approach based on the query pattern retrieving and matching is explained and used in the interface. An experimental prototype has been implemented to demonstrate the usability of the interface.

Xin Li; S. K. Chang

2004-01-01T23:59:59.000Z

139

High Statistics Study of Nearby Type 1a Supernovae. QUEST Camera Short Term Maintenance: Final Technical Report  

SciTech Connect

The Quest Camera was installed at the Palomar Obervatory in California. The camera was used to carry out a survey of low redshift Type 1a supernovae.The purpose of this DOE grant was to perform short term maintenance on the QUEST camera.

Baltay, Charles

2012-10-16T23:59:59.000Z

140

Inferring Function Semantics to Optimize Queries  

E-Print Network (OSTI)

The goal of the COKO-KOLA project [10, 9] is to express rules of rule-based optimizers in a manner permitting verification with a theorem prover. In [10], we considered query transformations that were too general to be expressed with rewrite rules. In this paper, we consider the complementary issue of expressing query transformations that are too specifc for rewrite rules. Such transformations require rewrite rules to be supplemented with semantic conditions to guard rule firing. This work considers the expression of such transformations using conditional rewrite rules, and the expression of inference rules to guide the optimizer in deciding if semantic conditions hold. This work differs from existing work in semantic query optimization in that semantic transformations in our framework are verifiable with a theorem prover. Further, our use of inference rules to guide semantic reasoning makes our optimizer extensible in a manner that is complementary to the extensibility benefits of existing rule-based technology. 1

Mitch Cherniack; Stan Zdonik

1998-01-01T23:59:59.000Z

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


141

Query estimation and order-optimized iteration in very large federations  

SciTech Connect

Objectivity federated databases may contain many terabytes of data and span thousands of files. In such an environment, it is often easy for a user to pose a query that may return an iterator over millions of objects, requiring opening thousands of databases. This presentation describes several technologies developed for such settings: (1) a query estimator, which tells the user how many objects satisfy the query, and how many databases will be touched, prior to opening all of those files; (2) an order-optimized iterator, which behaves like an ordinary iterator except that elements are returned in an order optimized for efficient access, presorted by the database (and container) in which they reside; (3) a parallel implementation of the order-optimized iterator, allowing any number of processes in a parallel or distributed system to iterate over disjoint subcollections of terms satisfying the query, partitioned by the database or container in which the items reside. These technologies have been developed for scientific experiments that will require handling thousands of terabytes of data annually, but they are intended to be applicable in other massive data settings as well. In such environments, significant amounts of data will reside on tertiary storage, accessible via Objectivity`s recently-announced HPSS (High Performance Storage System) interface. When deployed in large-scale physics settings later in 1998, the query estimator will further inform the user of the number of tape mounts required to satisfy the query, and provide rough time estimates for data delivery. The order-optimized iterator will be connected to a cache manager that will prefetch from tape to disk the files needed by the query (known from the query estimation step), and will decide which items to deliver to the user next according to the order in which data become available in the disk cache.

Malon, D.M.; HENP Grand Challenge Collaboration

1998-05-04T23:59:59.000Z

142

Petterssen's “Type B”Cyclogenesis in Terms of Discrete, Neutral Eady Modes  

Science Conference Proceedings (OSTI)

We investigate B. Farrell's hypothesis that the development of a surface cyclone with the passage of an upper trough, as observed by S. Pettessen and coworkers, may be understood in terms of an initial-value problem on the Eady model. We consider ...

Richard Rotunno; Maurizio Fantini

1989-12-01T23:59:59.000Z

143

V.: GLOO: A Graphical Query Language for OWL Ontologies. OWLED  

E-Print Network (OSTI)

Abstract. The database usability experience has shown that visual query languages tend to be superior to textual languages in many aspects. By applying this principle in the context of ontologies, we present GLOO, a graphical query language for OWL-DL ontologies. GLOO maps diagrammatic queries to DL based query languages such as nRQL, which is offered by the OWL-DL reasoner Racer. GLOO hides the complexity of a DL query language from users and allows them to query OWL ontologies with less difficulty. 1

Amineh Fadhil; Volker Haarslev

2006-01-01T23:59:59.000Z

144

Query Answering with DBoxes is Hard  

Science Conference Proceedings (OSTI)

Data in description logic knowledge bases is stored in the form of an ABox. ABoxes are often confusing for developers coming from relational databases because an ABox, in contrast to a database instance, provides an incomplete specification. A recently ... Keywords: Description logics, conjunctive queries, hybrid logic, model theory

Enrico Franconi; Yazmín Angélica Ibáñez-García; ?nanç Seylan

2011-11-01T23:59:59.000Z

145

A logic based context query language  

Science Conference Proceedings (OSTI)

Context is a basic ingredient in pervasive computing. It refers to user's both external environment and internal status, implying user's information needs during the interaction between the user and computer systems. By context-awareness, a variety of ... Keywords: context, context query language, temporal description logic

Ling Feng; Junhui Deng; Zhanjiang Song; Wenwei Xue

2010-11-01T23:59:59.000Z

146

Explicit Query Diversification for Geographical Information Retrieval  

E-Print Network (OSTI)

Explicit Query Diversification for Geographical Information Retrieval Davide Buscaldi1 and Paolo in the Geographical Information Retrieval task. This task represent an opportunity to take advantage of diversity not contain enough geographical data. 1 Introduction Diversity search is an Information Retrieval (IR

Paris-Sud XI, Université de

147

Stratified analysis of AOL query log  

Science Conference Proceedings (OSTI)

Characterizing user's intent and behaviour while using a retrieval information tool (e.g. a search engine) is a key question on web research, as it hold the keys to know how the users interact, what they are expecting and how we can provide them information ... Keywords: Query log analysis, User behaviour, User intent, User interactions, User profiling

David J. Brenes; Daniel Gayo-Avello

2009-05-01T23:59:59.000Z

148

Query and update through XML views  

Science Conference Proceedings (OSTI)

XML has become a standard medium for data exchange, and XML views are frequently used as an interface to relational database and XML data. There have been a considerable number of studies on building and querying XML views, while updating related topics ...

Gao Cong

2007-10-01T23:59:59.000Z

149

Answering relationship queries on the web  

Science Conference Proceedings (OSTI)

Finding relationships between entities on the Web, e.g., the connections between different places or the commonalities of people, is a novel and challenging problem. Existing Web search engines excel in keyword matching and document ranking, but they ... Keywords: relationship query, web search

Gang Luo; Chunqiang Tang; Ying-li Tian

2007-05-01T23:59:59.000Z

150

Secure multidimensional range queries in sensor networks  

Science Conference Proceedings (OSTI)

Most future large-scale sensor networks are expected to follow a two-tier architecture which consists of resource-rich master nodes at the upper tier and resource-poor sensor nodes at the lower tier. Sensor nodes submit data to nearby master nodes which ... Keywords: multidimensional range query, security, sensor networks,

Rui Zhang; Jing Shi; Yanchao Zhang

2009-05-01T23:59:59.000Z

151

On-the-fly progress detection in iterative stream queries  

Science Conference Proceedings (OSTI)

Multiple researchers have proposed cyclic query plans for evaluating iterative queries over streams or rapidly changing input. The Declarative Networking community uses cyclic plans to evaluate Datalog programs that track reachability and other graph ...

Badrish Chandramouli; Jonathan Goldstein; David Maier

2009-08-01T23:59:59.000Z

152

EIA 176 Query System, 2002 - U.S. Energy Information ...  

U.S. Energy Information Administration (EIA)

EIA 176 Query System 2002 Release date: February 2, 2004 Next release date: February 2005. The EIA-176 Query system is a Windows-based system which runs under ...

153

The Effectiveness of Query Expansion for Distributed Information Retrieval  

E-Print Network (OSTI)

The Effectiveness of Query Expansion for Distributed Information Retrieval Paul Ogilvie, Jamie information retrieval where complete collection information is available. One might expect that query expansion would then work for distributed information retrieval when complete collection information

Callan, Jamie

154

Framework for querying distributed objects managed by a grid infrastructure  

Science Conference Proceedings (OSTI)

Queries over scientific data often imply expensive analyses of data requiring a lot of computational resources available in Grids. We are developing a customizable query processor built on top of an established Grid infrastructure, the NorduGrid middleware, ...

Ruslan Fomkin; Tore Risch

2005-09-01T23:59:59.000Z

155

Xplus: a SQL-tuning-aware query optimizer  

Science Conference Proceedings (OSTI)

The need to improve a suboptimal execution plan picked by the query optimizer for a repeatedly run SQL query arises routinely. Complex expressions, skewed or correlated data, and changing conditions can cause the optimizer to make mistakes. For example, ...

Herodotos Herodotou; Shivnath Babu

2010-09-01T23:59:59.000Z

156

Query-based database policy assurance using semantic web technologies  

E-Print Network (OSTI)

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

Soltren, José Hiram

2009-01-01T23:59:59.000Z

157

Rule-based query answering method for a knowledge base of economic crimes  

E-Print Network (OSTI)

We present a description of the PhD thesis which aims to propose a rule-based query answering method for relational data. In this approach we use an additional knowledge which is represented as a set of rules and describes the source data at concept (ontological) level. Queries are posed in the terms of abstract level. We present two methods. The first one uses hybrid reasoning and the second one exploits only forward chaining. These two methods are demonstrated by the prototypical implementation of the system coupled with the Jess engine. Tests are performed on the knowledge base of the selected economic crimes: fraudulent disbursement and money laundering.

Bak, Jaroslaw

2011-01-01T23:59:59.000Z

158

Selective Sampling Using the Query by Committee Algorithm  

Science Conference Proceedings (OSTI)

We analyze the “query by committee” algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the two-member committee algorithm achieves information gain with positive lower bound, then the ... Keywords: Bayesian Learning, experimental design, query learning, selective sampling

Yoav Freund; H. Sebastian Seung; Eli Shamir; Naftali Tishby

1997-09-01T23:59:59.000Z

159

Probabilistic information retrieval approach for ranking of database query results  

Science Conference Proceedings (OSTI)

We investigate the problem of ranking the answers to a database query when many tuples are returned. In particular, we present methodologies to tackle the problem for conjunctive and range queries, by adapting and applying principles of probabilistic ... Keywords: Probabilistic information retrieval, automatic ranking, experimentation, indexing, relational queries, user survey, workload

Surajit Chaudhuri; Gautam Das; Vagelis Hristidis; Gerhard Weikum

2006-09-01T23:59:59.000Z

160

Analyzing, Detecting, and Exploiting Sentiment in Web Queries  

Science Conference Proceedings (OSTI)

The Web contains an increasing amount of biased and opinionated documents on politics, products, and polarizing events. In this article, we present an indepth analysis of Web search queries for controversial topics, focusing on query sentiment. To this ... Keywords: Opinionated queries, Web search, sentiment analysis

Sergiu Chelaru, Ismail Sengor Altingovde, Stefan Siersdorfer, Wolfgang Nejdl

2013-12-01T23:59:59.000Z

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


161

Users, Queries and Documents: A Unified Representation for Web Mining  

Science Conference Proceedings (OSTI)

The collective feedback of the users of an Information Retrieval system has been proved to be useful in many tasks. A popular approach in the literature is to process the logs stored by Internet Service Providers (ISP), Intranet proxies or Web search ... Keywords: Web Logs, User Feedback, Query Clustering, Query Recommendations, Query Suggestions

Michelangelo Diligenti; Marco Gori; Marco Maggini

2009-09-01T23:59:59.000Z

162

A Simple Model for Classifying Web Queries by User Intent  

E-Print Network (OSTI)

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

Rosso, Paolo

163

Data summaries for on-demand queries over linked data  

Science Conference Proceedings (OSTI)

Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering. However, this time-consuming pre-processing phase however leverages the ... Keywords: index structures, linked data, rdf querying

Andreas Harth; Katja Hose; Marcel Karnstedt; Axel Polleres; Kai-Uwe Sattler; Jürgen Umbrich

2010-04-01T23:59:59.000Z

164

Behavior-driven clustering of queries into topics  

Science Conference Proceedings (OSTI)

Categorization of web-search queries in semantically coherent topics is a crucial task to understand the interest trends of search engine users and, therefore, to provide more intelligent personalization services. Query clustering usually relies on lexical ... Keywords: mission, query log, topic, user intent, user profiling

Luca Maria Aiello; Debora Donato; Umut Ozertem; Filippo Menczer

2011-10-01T23:59:59.000Z

165

Using histograms to estimate answer sizes for XML queries  

Science Conference Proceedings (OSTI)

Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimization. Even at the user level, predictions of the total result size can be valuable ... Keywords: XML, estimation, histogram, schema

Yuqing Wu; Jignesh M. Patel; H. V. Jagadish

2003-03-01T23:59:59.000Z

166

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

Science Conference Proceedings (OSTI)

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.

Dunlavy, Daniel M.

2006-08-01T23:59:59.000Z

167

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

SciTech Connect

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.

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

168

Quantum query complexity of some graph problems  

E-Print Network (OSTI)

Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Theta(n^{3/2}) in the matrix model and in Theta(sqrt{nm}) in the array model, while the complexity of Connectivity is also in Theta(n^{3/2}) in the matrix model, but in Theta(n) in the array model. The upper bounds utilize search procedures for finding minima of functions under various conditions.

Christoph Durr; Mark Heiligman; Peter Hoyer; Mehdi Mhalla

2004-01-15T23:59:59.000Z

169

Variable Interactions in Query-Driven Visualization  

SciTech Connect

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

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

2007-10-25T23:59:59.000Z

170

Large-Scale Continuous Subgraph Queries on Streams  

SciTech Connect

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.

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

2011-11-30T23:59:59.000Z

171

An Improved Query for the Hidden Subgroup Problem  

E-Print Network (OSTI)

An equal superposition query with |0> in the response register is used in the "standard method" of single-query algorithms for the hidden subgroup problem (HSP). Here we introduce a different query, the character query, generalizing the well-known phase kickback trick. This query maximizes the success probability of subgroup identification under a uniform prior, for the HSP in which the oracle functions take values in a finite abelian group. We then apply our results to the case when the subgroups are drawn from a set of conjugate subgroups and obtain a success probability greater than that found by Moore and Russell.

Asif Shakeel

2011-01-05T23:59:59.000Z

172

Using lexico-semantic information for query expansion in passage retrieval for question answering  

Science Conference Proceedings (OSTI)

In this paper we investigate the use of several types of lexico-semantic information for query expansion in the passage retrieval component of our QA system. We have used four corpus-based methods to acquire semantically related words, and we have used ...

Lonneke van der Plas; Jörg Tiedemann

2008-08-01T23:59:59.000Z

173

Automatic discovery of query-classdependent models for multimodal search  

E-Print Network (OSTI)

We develop a framework for the automatic discovery of query classes for query-class-dependent search models in multimodal retrieval. The framework automatically discovers useful query classes by clustering queries in a training set according to the performance of various unimodal search methods, yielding classes of queries which have similar fusion strategies for the combination of unimodal components for multimodal search. We further combine these performance features with the semantic features of the queries during clustering in order to make discovered classes meaningful. The inclusion of the semantic space also makes it possible to choose the correct class for new, unseen queries, which have unknown performance space features. We evaluate the system against the TRECVID 2004 automatic video search task and find that the automatically discovered query classes give an improvement of 18% in MAP over hand-defined query classes used in previous works. We also find that some hand-defined query classes, such as “Named Person ” and “Sports ” do, indeed, have similarities in search method performance and are useful for query-class-dependent multimodal search, while other hand-defined classes, such as “Named Object” and “General Object” do not have consistent search method performance and should be split apart or replaced with other classes. The proposed framework is general and can be applied to any new domain without expert domain knowledge.

Lyndon S. Kennedy; Apostol (Paul) Natsev; Shih-fu Chang

2005-01-01T23:59:59.000Z

174

Multicolor Maps from Compound Queries | OpenEI Community  

Open Energy Info (EERE)

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

175

Intentional query suggestion: making user goals more explicit during search  

E-Print Network (OSTI)

student.tugraz.at The degree to which users ’ make their search intent explicit can be assumed to represent an upper bound on the level of service that search engines can provide. In a departure from traditional query expansion mechanisms, we introduce Intentional Query Suggestion as a novel idea that is attempting to make users ’ intent more explicit during search. In this paper, we present a prototypical algorithm for Intentional Query Suggestion and we discuss corresponding data from comparative experiments with traditional query suggestion mechanisms. Our preliminary results indicate that intentional query suggestions 1) diversify search result sets (i.e. it reduces result set overlap) and 2) have the potential to yield higher click-through rates than traditional query suggestions.

Markus Strohmaier; Mark Kröll; Christian Körner

2009-01-01T23:59:59.000Z

176

Use of Query Concepts and Information Extraction to Improve ...  

Science Conference Proceedings (OSTI)

Page 1. Use of Query Concepts and Information Extraction to Improve Information Retrieval Effectiveness David O. Holmes M. Catherine McCabe ...

177

Scheduling for in-network sensor query processing.  

E-Print Network (OSTI)

??xi, 135 leaves : ill. ; 30 cm HKUST Call Number: Thesis CSED 2008 Wu In-network query processing for sensor networks is a cross-layer paradigm,… (more)

Wu, Hejun

2008-01-01T23:59:59.000Z

178

IMPLEMENTATION FOR A COHERENT KEYWORD-BASED XML QUERY LANGUAGE.  

E-Print Network (OSTI)

??Due to the increasing pervasiveness of data sets using the XML data format,numerous query languages have been proposed that exploit the structure inherent in XML.… (more)

Potturi, Venkatakalyan

2007-01-01T23:59:59.000Z

179

Form EIA-176 Query System - Energy Information Administration  

U.S. Energy Information Administration (EIA)

Form EIA-176 Query System . User’s guide . Version 7.0 . Energy Information Administration U.S. Department of Energy ...

180

Runway Incursion Database (RWS) - Data Query Tool | Data.gov  

NLE Websites -- All DOE Office Websites (Extended Search)

Runway Incursion Database (RWS) - Data Query Tool Safety DataTools Apps Challenges Resources Blogs Let's Talk Safety You are here Data.gov Communities Safety Data Runway...

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


181

Implementation of the Clinical Research Query Interface VISAGE.  

E-Print Network (OSTI)

??An innovative new query interface called VISAGE (VISual AGgregator and Explorer) has been developed for use in the PhysioMIMI system. This interface consists of three… (more)

Sandberg, Neil L.

2010-01-01T23:59:59.000Z

182

Template:CompanyCsvPostOffsetQuery | Open Energy Information  

Open Energy Info (EERE)

template. It should be called in the following format: CompanyCsvPostOffsetQuery |cat |offset |limit |searchlabel Retrieved from "http:en.openei.orgw...

183

Form EIA-176 Query System - Energy Information Administration  

U.S. Energy Information Administration (EIA)

The EIA-176 Query System is a PC-based system for users to produce reports and ... The View EIA-176 Company Menu lets you control this display.

184

Form EIA-176 Query System - Energy Information Administration  

U.S. Energy Information Administration (EIA)

Form EIA-176 Query System Getting Started Guide Version 7.0 Energy Information Administration U.S. Department of Energy October ...

185

Characterizing statistical query learning: simplified notions and proofs  

Science Conference Proceedings (OSTI)

The Statistical Query model was introduced in [6] to handle noise in the well-known PAC model. In this model the learner gains information about the target concept by asking for various statistics about it. Characterizing the number of queries required ...

Balázs Szörényi

2009-10-01T23:59:59.000Z

186

The linguistic structure of English web-search queries  

Science Conference Proceedings (OSTI)

Web-search queries are known to be short, but little else is known about their structure. In this paper we investigate the applicability of part-of-speech tagging to typical English-language web search-engine queries and the potential value of these ...

Cory Barr; Rosie Jones; Moira Regelson

2008-10-01T23:59:59.000Z

187

Enhancing query translation with relevance feedback in translingual information retrieval  

Science Conference Proceedings (OSTI)

As an effective technique for improving retrieval effectiveness, relevance feedback (RF) has been widely studied in both monolingual and translingual information retrieval (TLIR). The studies of RF in TLIR have been focused on query expansion (QE), in ... Keywords: Query expansion, Relevance feedback, Translation enhancement, Translingual information retrieval

Daqing He; Dan Wu

2011-01-01T23:59:59.000Z

188

Selectivity Estimation for Spatio-Temporal Queries to Moving Objects  

E-Print Network (OSTI)

omni@islab.kaist.ac.kr chungcw@cs.kaist.ac.kr Divisionof ComputerScience Department of Electrical of selection queries: one for historical positions of moving objects and the other for future positions the selection query efficiently, an accu- rate estimation of the selectivity is required. The selectivity

Chung, Chin-Wan

189

Characterizing the usability of interactive applications through query log analysis  

Science Conference Proceedings (OSTI)

People routinely rely on Internet search engines to support their use of interactive systems: they issue queries to learn how to accomplish tasks, troubleshoot problems, and otherwise educate themselves on products. Given this common behavior, we argue ... Keywords: query log analysis, usability

Adam Fourney; Richard Mann; Michael Terry

2011-05-01T23:59:59.000Z

190

A natural language query interface to structured information  

Science Conference Proceedings (OSTI)

Accessing structured data such as that encoded in ontologies and knowledge bases can be done using either syntactically complex formal query languages like SPARQL or complicated form interfaces that require expensive customisation to each particular ... Keywords: conceptual search, querying, searching, user interfaces

Valentin Tablan; Danica Damljanovic; Kalina Bontcheva

2008-06-01T23:59:59.000Z

191

Efficient top-k processing over query-dependent functions  

Science Conference Proceedings (OSTI)

We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter value is specified in the query. For example, online retail stores rank items ...

Lin Guo; Sihem Amer Yahia; Raghu Ramakrishnan; Jayavel Shanmugasundaram; Utkarsh Srivastava; Erik Vee

2008-08-01T23:59:59.000Z

192

Agent-Based Spatial Query Optimization in a Grid Environment  

Science Conference Proceedings (OSTI)

Resource management and optimization among autonomous spatial databases in a grid environment is always a challenge task. In this paper, we introduce a BDI Agent model for cooperating complex spatial query optimization task in a grid environment. Spatial ... Keywords: BDI Agent, grid, spatial query optimization

Yufei Bai; Xiujun Ma; Kunqing Xie; Cuo Cai; Ke Li

2008-12-01T23:59:59.000Z

193

Scalable distributed indexing and query processing over Linked Data  

Science Conference Proceedings (OSTI)

Linked Data is becoming the core part of modern Web applications and thus efficient access to structured information expressed in RDF gains paramount importance. A number of efficient local RDF stores exist already, while distributed indexing and distributed ... Keywords: Decentralized data management, Distributed indexing, Distributed storage, Linked Data, Query processing, Structured queries

Marcel Karnstedt; Kai-Uwe Sattler; Manfred Hauswirth

2012-01-01T23:59:59.000Z

194

Selectivity Estimation of Window Queries for Line Segment Datasets  

E-Print Network (OSTI)

{499, Washington, DC, 1993. 11] J. Orenstein. Spatial query processing in an object- oriented database system- ples of Database Systems,pages 214{221, Washington, DC, 1993. 13] G. Proietti and C. FaloutsosSelectivity Estimation of Window Queries for Line Segment Datasets Guido Proietti Dept. of Computer

Faloutsos, Christos

195

FACILITATING OPEN VOCABULARY SPOKEN TERM DETECTION USING A MULTIPLE PASS HYBRID SEARCH ALGORITHM  

E-Print Network (OSTI)

term detection involves fast search of large repositories of audio documents from query terms entered a query term has been entered by the user, a first pass search is performed to identify candidate audioFACILITATING OPEN VOCABULARY SPOKEN TERM DETECTION USING A MULTIPLE PASS HYBRID SEARCH ALGORITHM

Rose, Richard

196

Hourly analysis of a very large topically categorized web query log  

Science Conference Proceedings (OSTI)

We review a query log of hundreds of millions of queries that constitute the total query traffic for an entire week of a general-purpose commercial web search service. Previously, query logs have been studied from a single, cumulative view. In contrast, ... Keywords: query log analysis, web search

Steven M. Beitzel; Eric C. Jensen; Abdur Chowdhury; David Grossman; Ophir Frieder

2004-07-01T23:59:59.000Z

197

Learning to suggest: a machine learning framework for ranking query suggestions  

Science Conference Proceedings (OSTI)

We consider the task of suggesting related queries to users after they issue their initial query to a web search engine. We propose a machine learning approach to learn the probability that a user may find a follow-up query both useful and relevant, ... Keywords: machine learning, query log mining, query suggestion, search assistance

Umut Ozertem; Olivier Chapelle; Pinar Donmez; Emre Velipasaoglu

2012-08-01T23:59:59.000Z

198

Continuous K-Nearest Neighbor Query for Moving Objects with Uncertain Velocity  

Science Conference Proceedings (OSTI)

One of the most important queries in spatio-temporal databases that aim at managing moving objects efficiently is the continuous K-nearest neighbor (CKNN) query. A CKNN query is to retrieve the K-nearest neighbors (KNNs) ... Keywords: K-nearest neighbors, continuous K-nearest neighbor query, moving objects, moving query object, spatio-temporal databases

Yuan-Ko Huang; Chao-Chun Chen; Chiang Lee

2009-03-01T23:59:59.000Z

199

Natural Gas EIA-176 Query System Readme(1999)  

Gasoline and Diesel Fuel Update (EIA)

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

200

Increasing ask query limit | OpenEI Community  

Open Energy Info (EERE)

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

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


201

Inferring query performance using pre-retrieval predictors  

E-Print Network (OSTI)

Abstract. The prediction of query performance is an interesting and important issue in Information Retrieval (IR). Current predictors involve the use of relevance scores, which are time-consuming to compute. Therefore, current predictors are not very suitable for practical applications. In this paper, we study a set of predictors of query performance, which can be generated prior to the retrieval process. The linear and non-parametric correlations of the predictors with query performance are thoroughly assessed on the TREC disk4 and disk5 (minus CR) collections. According to the results, some of the proposed predictors have significant correlation with query performance, showing that these predictors can be useful to infer query performance in practical applications. 1

Ben He; Iadh Ounis

2004-01-01T23:59:59.000Z

202

VisTool: a Visual Tool for Querying Relational Databases  

E-Print Network (OSTI)

In this paper we describe VisTool, a prototype tool for querying relational databases by means of the visual query language VISIONARY. INTRODUCTION VISIONARY [1] is based on an iconic-diagrammatic paradigm used for both data and query representation. The external data model is called vision and is made up of the visual primitives of concept and association; the external query model is based on the definition of a dynamic and adaptive perspective for accessing data. The internal data model is relational, and the internal query model is SQL. The mapping between the visual and the relational worlds is established through an intermediate graph-based level. VISIONARY is mainly directed to naive and occasional users, who have no experience with data models and only have a general idea about the contents of the database; for this reason, the expressive power of VISIONARY is limited...

Francesca Benzi; Dario Maio; Stefano Rizzi

1998-01-01T23:59:59.000Z

203

Web Service Composition Through Declarative Queries: The Case of Conjunctive Queries with Union and Negation  

E-Print Network (OSTI)

A web service operation can be seen as a function op: X1,...,Xn ? Y1,...,Ym having an input message (request) with n arguments (parts), and an output message (response) with m parts [4, Section 2.2]. For example, opB: Author ?{(ISBN, Title)} may implement a books search service, returning for a given author A a list of books authored by A. We propose to model such operations as relations with access pattern, here: B oio (ISBN, Author, Title), where ‘oio ’ indicates that a value for the second attribute must be given as input, while the other attribute values can be retrieved as output. In this way, a family of web service operations over k attributes can be concisely described as a relation R(A1,...,Ak) with an associated set of access patterns P?{i, o} k. Since we model web services as relations with access patterns, we can now use queries as a declarative specifications for web service composition: e.g., the query Q(I, A, T) ? ? B(I, A, T),C(I,A), ¬L(I) asks for books available through a store B which are contained in a catalog C, but not in the local library L. Let the only access patterns be B ioo, B oio, C oo, and L o. If we try to execute Q from left to right, neither pattern for B works since we either lack an ISBN I or an author A. However, Q is feasible since we can execute it by first calling C(I,A) which binds both I and A; after that, calling B ioo (or B oio) will work. Calling ¬L(I) first and then B does not work: a negated call can only filter out answers, but cannot produce any new variable bindings. 2. Formal Results We study the problem of deciding whether a query Q is feasible, i.e., whether there exists a logically equivalent query Q ? that can be executed observing the limited access patterns given by the web service (source) relations. Executability depends on the specific syntactic form of a query, while feasibility is a more “robust ” semantic notion, in-

Bertram Ludäscher; Alan Nash

2004-01-01T23:59:59.000Z

204

Dynamic plan migration for snapshot-equivalent continuous queries in data stream systems  

Science Conference Proceedings (OSTI)

A data stream management system executes a large number of continuous queries in parallel. As stream characteristics and query workload change over time, the plan initially installed for a continuous query may become inefficient. As a consequence, the ...

Jürgen Krämer; Yin Yang; Michael Cammert; Bernhard Seeger; Dimitris Papadias

2006-03-01T23:59:59.000Z

205

Querying for Feature Extraction and Visualization in Climate Modeling  

SciTech Connect

The ultimate goal of data visualization is to clearly portray features relevant to the problem being studied. This goal can be realized only if users can effectively communicate to the visualization software what features are of interest. To this end, we describe in this paper two query languages used by scientists to locate and visually emphasize relevant data in both space and time. These languages offer descriptive feedback and interactive refinement of query parameters, which are essential in any framework supporting queries of arbitrary complexity. We apply these languages to extract features of interest from climate model results and describe how they support rapid feature extraction from large datasets.

Johnson, C. Ryan [University of Tennessee, Knoxville (UTK); Glatter, Markus [University of Tennessee, Knoxville (UTK); Kendall, Wesley [University of Tennessee, Knoxville (UTK); Huang, Jian [University of Tennessee, Knoxville (UTK); Hoffman, Forrest M [ORNL

2009-01-01T23:59:59.000Z

206

Appendix B – Pre-Selected Query Items - U.S. Energy ...  

U.S. Energy Information Administration (EIA)

Appendix B – Pre-Selected Query Items Description Memo Units Answers to Question in Part II about Alternative Fuel Vehicles This Query has the answers from

207

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

SciTech Connect

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

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

2006-06-15T23:59:59.000Z

208

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

Science Conference Proceedings (OSTI)

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

Wu, Jerry; Wu, Kesheng

2011-04-18T23:59:59.000Z

209

Multiple Example Queries in Content-Based Image Retrieval  

Science Conference Proceedings (OSTI)

Content-Based Image Retrieval (cbir) is the practical class of techniques used for information retrieval from large image collections. Many CBIR systems allow users to specify their information need by providing an example image. This query-by-example ...

Seyed M. M. Tahaghoghi; James A. Thom; Hugh E. Williams

2002-09-01T23:59:59.000Z

210

TOP-K projection queries for probabilistic business processes  

Science Conference Proceedings (OSTI)

A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specifications are extremely valuable for companies. In particular, given a BP ...

Daniel Deutch; Tova Milo

2009-03-01T23:59:59.000Z

211

Intuitive Interaction with Encrypted Query Execution in DataStorm  

Science Conference Proceedings (OSTI)

The encrypted execution of database queries promises powerful security protections, however users are currently unlikely to benefit without significant expertise. In this demonstration, we illustrate a simple workflow enabling users to design secure ...

Ken Smith; Ameet Kini; William Wang; Chris Wolf; M. David Allen; Andrew Sillers

2012-04-01T23:59:59.000Z

212

Processing Private Queries over Untrusted Data Cloud through Privacy Homomorphism  

E-Print Network (OSTI)

Tong, Hong Kong SAR, China {haibo,xujl,csren,bchoi}@comp.hkbu.edu.hk Abstract--Query processing directory and another on anti-diabetic drugs, together give a higher confidence that the user is probably

Xu, Jianliang

213

Adaptive Support of Range Queries via Push-Pull Algorithms  

Science Conference Proceedings (OSTI)

In many real time interactive simulations the problem of interest management is that of filtering updates through application-specified range queries. This "associative' form of memory access is often implemented more simply as a reference memory access ...

Rob Minson; Georgios Theodoropoulos

2007-06-01T23:59:59.000Z

214

Processing nested complex sequence pattern queries over event streams  

Science Conference Proceedings (OSTI)

Complex event processing (CEP) has become increasingly important for tracking and monitoring applications ranging from health care, supply chain management to surveillance. These monitoring applications submit complex event queries to track sequences ...

Mo Liu; Medhabi Ray; Elke A. Rundensteiner; Daniel J. Dougherty; Chetan Gupta; Song Wang; Ismail Ari; Abhay Mehta

2010-09-01T23:59:59.000Z

215

Form EIA-176 Query System Getting Started Guide Version 2  

U.S. Energy Information Administration (EIA)

1.0 Introduction 1.1 Purpose and Functions The EIA-176 Query System is a PC-based system for users to produce reports and extract data from the Energy Information ...

216

EIA 176 Query System, 2001 - Energy Information Administration  

U.S. Energy Information Administration (EIA)

The EIA-176 Query system is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later.

217

Form EIA-176 Query System - Energy Information Administration  

U.S. Energy Information Administration (EIA)

1.0 Introduction 1.1 Purpose and Functions The EIA-176 Query System is a PC-based system for users to produce reports and extract data from the Energy Information ...

218

On Graph Based Interaction for Semantic Query Languages  

Science Conference Proceedings (OSTI)

In the last years, several proposals have been presented concerning graphical query languages working on diagrammatic representations of semantic data models. Such proposals are mainly based on two different user interaction modalities, i.e., to allow ...

Giuseppe Santucci

1996-09-01T23:59:59.000Z

219

EIA-176 Query System 2007 - Energy Information Administration  

U.S. Energy Information Administration (EIA)

You may download the data tables if you already have Microsoft Access 2000-2003 on your computer or download the query system via a zip file if you do not have ...

220

Query reformulation and refinement using NLP-based sentence clustering  

Science Conference Proceedings (OSTI)

We have developed an interactive query refinement tool that helps users search a knowledge base for solutions to problems with electronic equipment. The system is targeted towards non-technical users, who are often unable to formulate precise problem ...

Frédéric Roulland; Aaron Kaplan; Stefania Castellani; Claude Roux; Antonietta Grasso; Karin Pettersson; Jacki O'Neill

2007-04-01T23:59:59.000Z

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


221

Comprehensive Metadata Query Interface for Heterogeneous Data Archives Based on Open Source PostgreSQL ORDBMS  

E-Print Network (OSTI)

We use PostgreSQL DBMS for storing XML metadata, described by the IVOA Characterisation Data Model. Initial XML type support in the PostgreSQL has recently been implemented. We make heavy use of this feature in order to provide comprehensive search over Characterisation metadata tree. We built a prototype of the Characterisation metadata query service, implementing two access methods: (1) HTTP-GET/POST based interface implements almost direct translation of the query parameter name into XPath of the data model element in the XML serialisation; (2) Web-Service based interface to receive XQuery which is also directly translated into XPath. This service will be used in the ASPID-SR archive, containing science-ready data obtained with the Russian 6-m telescope.

Ivan Zolotukhin; Nikolay Samokhvalov; Francois Bonnarel; Igor Chilingarian

2007-11-02T23:59:59.000Z

222

An Information-Theoretic Privacy Criterion for Query Forgery in Information Retrieval  

E-Print Network (OSTI)

In previous work, we presented a novel information-theoretic privacy criterion for query forgery in the domain of information retrieval. Our criterion measured privacy risk as a divergence between the user's and the population's query distribution, and contemplated the entropy of the user's distribution as a particular case. In this work, we make a twofold contribution. First, we thoroughly interpret and justify the privacy metric proposed in our previous work, elaborating on the intimate connection between the celebrated method of entropy maximization and the use of entropies and divergences as measures of privacy. Secondly, we attempt to bridge the gap between the privacy and the information-theoretic communities by substantially adapting some technicalities of our original work to reach a wider audience, not intimately familiar with information theory and the method of types.

Rebollo-Monedero, David; Forné, Jordi

2011-01-01T23:59:59.000Z

223

Hourly analysis of a very large topically categorized web query log  

E-Print Network (OSTI)

We review a query log of hundreds of millions of queries that constitute the total query traffic for an entire week of a generalpurpose commercial web search service. Previously, query logs have been studied from a single, cumulative view. In contrast, our analysis shows changes in popularity and uniqueness of topically categorized queries across the hours of the day. We examine query traffic on an hourly basis by matching it against lists of queries that have been topically pre-categorized by human editors. This represents 13 % of the query traffic. We show that query traffic from particular topical categories differs both from the query stream as a whole and from other categories. This analysis provides valuable insight for improving retrieval effectiveness and efficiency. It is also relevant to the development of enhanced query disambiguation, routing, and caching algorithms.

Steven M. Beitzel; Eric C. Jensen; Abdur Chowdhury; David Grossman; Ophir Frieder

2004-01-01T23:59:59.000Z

224

High Performance Visualization using Query-Driven Visualizationand Analytics  

Science Conference Proceedings (OSTI)

Query-driven visualization and analytics is a unique approach for high-performance visualization that offers new capabilities for knowledge discovery and hypothesis testing. The new capabilities akin to finding needles in haystacks are the result of combining technologies from the fields of scientific visualization and scientific data management. This approach is crucial for rapid data analysis and visualization in the petascale regime. This article describes how query-driven visualization is applied to a hero-sized network traffic analysis problem.

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

2006-06-15T23:59:59.000Z

225

Query Routing in Large-scale Digital Library Systems  

E-Print Network (OSTI)

Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the increasing volume and diversity of digital information available online have led to a growing problem that conventional data management systems do not have, namely #nding which information sources out of many candidate choices are the most relevant to answer a given user query.We refer to this problem as the query routing problem.

Ling Liu

1997-01-01T23:59:59.000Z

226

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

Open Energy Info (EERE)

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

227

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

Open Energy Info (EERE)

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

228

Type F: Oceanic-ridge, Basaltic Resource | Open Energy Information  

Open Energy Info (EERE)

source source History View New Pages Recent Changes All Special Pages Semantic Search/Querying Get Involved Help Apps Datasets Community Login | Sign Up Search Page Edit History Facebook icon Twitter icon » Type F: Oceanic-ridge, Basaltic Resource Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Print PDF Type F: Oceanic-ridge, Basaltic Resource Dictionary.png Type F: Oceanic-ridge, Basaltic Resource: No definition has been provided for this term. Add a Definition Brophy Occurrence Models This classification scheme was developed by Brophy, as reported in Updating the Classification of Geothermal Resources.[1] Type A: Magma-heated, Dry Steam Resource Type B: Andesitic Volcanic Resource Type C: Caldera Resource Type D: Sedimentary-hosted, Volcanic-related Resource Type E: Extensional Tectonic, Fault-Controlled Resource

229

Type B: Andesitic Volcanic Resource | Open Energy Information  

Open Energy Info (EERE)

source source History View New Pages Recent Changes All Special Pages Semantic Search/Querying Get Involved Help Apps Datasets Community Login | Sign Up Search Page Edit History Facebook icon Twitter icon » Type B: Andesitic Volcanic Resource Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Print PDF Type B: Andesitic Volcanic Resource Dictionary.png Type B: Andesitic Volcanic Resource: No definition has been provided for this term. Add a Definition Brophy Occurrence Models This classification scheme was developed by Brophy, as reported in Updating the Classification of Geothermal Resources.[1] Type A: Magma-heated, Dry Steam Resource Type B: Andesitic Volcanic Resource Type C: Caldera Resource Type D: Sedimentary-hosted, Volcanic-related Resource Type E: Extensional Tectonic, Fault-Controlled Resource

230

Proceedings of EACL '99 Finding content-bearing terms using term similarities  

E-Print Network (OSTI)

Proceedings of EACL '99 Finding content-bearing terms using term similarities Justin Picard.picard@seco.unine.ch Abstract This paper explores the issue of using dif- ferent co-occurrence similarities between terms for separating query terms that are useful for retrieval from those that are harmful. The hypothesis under

231

Comparing crowd-based, game-based, and machine-based approaches in initial query and query refinement tasks  

Science Conference Proceedings (OSTI)

Human computation techniques have demonstrated their ability to accomplish portions of tasks that machine-based techniques find difficult. Query refinement is a task that may benefit from human involvement. We conduct an experiment that evaluates the ...

Christopher G. Harris; Padmini Srinivasan

2013-03-01T23:59:59.000Z

232

Extensible/Rule Based Query Rewrite Optimization in Starburst Hamid Pirahesh  

E-Print Network (OSTI)

@cs.berkeley.edu, hasan@hpl.hp.com Abstract This paper describes the Query Rewrite facility of the Starburst extensible, suggesting that Query Rewrite in general --- and these rewrite rules in particular --- are an essential step during Query Rewrite. Although it is accepted doctrine that query languages should be declarative, we

Hellerstein, Joseph M.

233

Search here... Submit Query Advertise About Us  

E-Print Network (OSTI)

arrays complex. Organic LEDs (OLEDs) on the other hand have been introduced into some consumer to rubber. The devices can be placed sparsely enough that a bright layer of them is practically transparent that's see-through," Professor Rogers explained. He said that the nearer-term applications

Rogers, John A.

234

On concurrency control in sliding window queries over data streams  

E-Print Network (OSTI)

Work done while the author was visiting the University of Waterloo. Data stream systems execute a dynamic workload of long-running and one-time queries, with the streaming inputs typically bounded by sliding windows. For efficiency, windows may be advanced periodically by replacing the oldest part of the window with a batch of newly arrived data. Existing work on stream processing assumes that a window cannot be advanced while it is being accessed by a query. In this paper, we argue that concurrent processing of queries (reads) and window-slides (writes) is required by data stream systems in order to allow prioritized query scheduling and improve the freshness of answers. We prove that the traditional notion of conflict serializability is insufficient in this context and define stronger isolation levels that restrict the allowed serialization orders. We also design and experimentally evaluate a transaction scheduler that efficiently enforces the new isolation levels by taking advantage of the access patterns of sliding window queries. 1

Lukasz Golab; Kumar Gaurav Bijay; M. Tamer Özsu

2006-01-01T23:59:59.000Z

235

Raising the IQ in full-text searching via intelligent querying  

SciTech Connect

Current Information Retrieval (IR) technologies allow for efficient access to relevant information, provided that user selected query terms coincide with the specific linguistical choices made by the authors whose works constitute the text-base. Therefore, the challenge is to enhance the limited searching capability of state-of-the-practice IR. This can be done either with augmented clients that overcome current server searching deficiencies, or with added capabilities that can augment searching algorithms on the servers. The technology being investigated is that of deductive databases, with a set of new techniques called cooperative answering. This technology utilizes semantic networks to allow for navigation between possible query search term alternatives. The augmented search terms are passed to an IR engine and the results can be compared. The project utilizes the OSTI Environment, Safety and Health Thesaurus to populate the domain specific semantic network and the text base of ES&H related documents from the Facility Profile Information Management System as the domain specific search space.

Kero, R.; Russell, L.; Swietlik, C. [Argonne National Lab., IL (United States); Morgan, C. [USDOE/Environment, Safety and Health (EH-5) (United States); Clayton, C.; Dunlap, K. [USDOE Office of Scientific and Technical Information, Oak Ridge, TN (United States)

1994-11-01T23:59:59.000Z

236

Short-Term PV Generation System Direct Power Prediction Model on Wavelet Neural Network and Weather Type Clustering  

Science Conference Proceedings (OSTI)

With the increase of the capacity of PV generated systems, how to eliminate the problem caused by the randomness of power output for photovoltaic system becomes more significant. Most of the existing photovoltaic prediction is Based on the solar radiation. ... Keywords: PV generation system, Wavelet neural network, Weather type clustering, Direct prediction

Ying Yang, Lei Dong

2013-08-01T23:59:59.000Z

237

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

NLE Websites -- All DOE Office Websites (Extended Search)

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

238

Optimal query/update tradeoffs in versioned dictionaries  

E-Print Network (OSTI)

External-memory dictionaries are a fundamental data structure in file systems and databases. Versioned (or fully-persistent) dictionaries have an associated version tree where queries can be performed at any version, updates can be performed on leaf versions, and any version can be `cloned' by adding a child. Various query/update tradeoffs are known for unversioned dictionaries, many of them with matching upper and lower bounds. No fully-versioned external-memory dictionaries are known with optimal space/query/update tradeoffs. In particular, no versioned constructions are known that offer updates in $o(1)$ I/Os using O(N) space. We present the first cache-oblivious and cache-aware constructions that achieve a wide range of optimal points on this tradeoff.

Byde, Andrew

2011-01-01T23:59:59.000Z

239

Optimizing RDF(S) queries on cloud platforms  

Science Conference Proceedings (OSTI)

Scalable processing of Semantic Web queries has become a critical need given the rapid upward trend in availability of Semantic Web data. The MapReduce paradigm is emerging as a platform of choice for large scale data processing and analytics due to ... Keywords: hadoop, mapreduce, rdf(s), sparql

HyeongSik Kim, Padmashree Ravindra, Kemafor Anyanwu

2013-05-01T23:59:59.000Z

240

Query-Independent learning to rank for RDF entity search  

Science Conference Proceedings (OSTI)

The amount of structured data is growing rapidly. Given a structured query that asks for some entities, the number of matching candidate results is often very high. The problem of ranking these results has gained attention. Because results in ... Keywords: information retrieval, learning to rank, semantic search

Lorand Dali; Blaž Fortuna; Thanh Tran Duc; Dunja Mladeni?

2012-05-01T23:59:59.000Z

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


241

Federated Querying Architecture with Clinical & Translational Health IT Application  

Science Conference Proceedings (OSTI)

We present a software architecture that federates data from multiple heterogeneous health informatics data sources owned by multiple organizations. The architecture builds upon state-of-the-art open-source Java and XML frameworks in innovative ways. ... Keywords: Clinical and translational health informatics, Federated query, Heterogeneous data sources, OSGi enterprise service bus, Web services

Oren E. Livne; N. Dustin Schultz; Scott P. Narus

2011-10-01T23:59:59.000Z

242

Towards the taxonomy-oriented categorization of yellow pages queries  

Science Conference Proceedings (OSTI)

Yellow pages search is a popular service that provides a means for finding businesses close to particular locations. The efficient search of yellow pages is becoming a rapidly evolving research area. The underlying data maintained in yellow pages search ... Keywords: Yellow pages query categorization, category filter, category mapping function, flexible framework

Zhisheng Li; Xiangye Xiao; Meng Wang; Chong Wang; Xufa Wang; Xing Xie

2012-03-01T23:59:59.000Z

243

Mining Query Logs: Turning Search Usage Data into Knowledge  

Science Conference Proceedings (OSTI)

Web search engines have stored in their logs information about users since they started to operate. This information often serves many purposes. The primary focus of this survey is on introducing to the discipline of query mining by showing its foundations ...

Fabrizio Silvestri

2010-01-01T23:59:59.000Z

244

Scalable in situ scientific data encoding for analytical query processing  

Science Conference Proceedings (OSTI)

The process of scientific data analysis in high-performance computing environments has been evolving along with the advancement of computing capabilities. With the onset of exascale computing, the increasing gap between compute performance and I/O bandwidth ... Keywords: compression, exascale computing, indexing, query processing

Sriram Lakshminarasimhan; David A. Boyuka; Saurabh V. Pendse; Xiaocheng Zou; John Jenkins; Venkatram Vishwanath; Michael E. Papka; Nagiza F. Samatova

2013-06-01T23:59:59.000Z

245

Query and Predicate Emptiness in Description Logics Franz Baader  

E-Print Network (OSTI)

for basic members of the ALC family to un- decidable for ALC extended with functional roles (ALCF). Note for ALCF, which should be contrasted with the decidability of query entailment and containment in this DL with and without the UNA. An analogous statement fails for ALCF, e.g. because the ABox A = {f(a, b), f(a, b )}, f

Wolter, Frank

246

Layered Models Top-Down Querying of Normal Logic Programs  

Science Conference Proceedings (OSTI)

For practical applications, the use of top-down query-driven proof-procedures is essential for an efficient use and computation of answers using Logic Programs as knowledge bases. Additionally, abductive reasoning on demand is intrinsically a top-down ... Keywords: Relevance, Semantics, Smodels, XSB-XASP

Luís Moniz Pereira; Alexandre Miguel Pinto

2009-01-01T23:59:59.000Z

247

Data sampling control, compression and query in sensor networks  

Science Conference Proceedings (OSTI)

Nodes in wireless sensor networks have very limited storage capacity, computing ability and battery power. Node failure and communication link disconnection occur frequently, which means weak services of the network layer. Sensed data is inaccurate which ... Keywords: data accuracy, data compression, data sampling, energy efficiency, power limitation, query, sampling frequency control, sensor networks

Jinbao Li; Jianzhong Li

2007-04-01T23:59:59.000Z

248

CQ-Buddy: Harnessing Peers For Distributed Continuous Query Processing  

E-Print Network (OSTI)

In this paper, we present the design and evaluation of CQ-Buddy, a peer-to-peer (p2p) continuous query (CQ) processing system that is distributed, and highly-scalable. CQ-Buddy exploits the differences in capabilities ...

Ng, Wee Siong

249

Mining web query logs to analyze political issues  

Science Conference Proceedings (OSTI)

We present a novel approach to using anonymized web search query logs to analyze and visualize political issues. Our starting point is a list of politically annotated blogs (left vs. right). We use this list to assign a numerical political leaning to ... Keywords: opinion mining and sentiment analysis, partisanship, political leaning, web search logs

Ingmar Weber; Venkata Rama Kiran Garimella; Erik Borra

2012-06-01T23:59:59.000Z

250

Selectivity Estimation of Window Queries for Line Segment Datasets  

E-Print Network (OSTI)

Intl. Conf. on Information and Knowledge Management, pages 490--499, Washington, DC, 1993. [11] J 214--221, Washington, DC, 1993. [13] G. Proietti and C. Faloutsos. Accurate modeling of region dataSelectivity Estimation of Window Queries for Line Segment Datasets Guido Proietti 1 Christos

251

Maximizing Throughput for Queries over Streaming Sensor Data  

E-Print Network (OSTI)

of Computer Science The George Washington University Washington, DC, USA Email: {joegomes throughput for sliding window based multi-join queries over con- tinuous sensor data streams. We develop joining two unbounded streams. Therefore it is more sensible and useful to impose window predicates

Choi, Hyeong-Ah

252

Database design and querying within the fuzzy semantic model  

Science Conference Proceedings (OSTI)

Fuzzy semantic model (FSM) is a data model that uses basic concepts of semantic modeling and supports handling fuzziness, uncertainty and imprecision of real-world at the attribute, entity and class levels. The paper presents the principles and constructs ... Keywords: Database design, Flexible querying, Fuzzy database, Semantic modeling

Rafik Bouaziz; Salem Chakhar; Vincent Mousseau; Sudha Ram; Abdelkader Telmoudi

2007-11-01T23:59:59.000Z

253

DATA CONCERN AWARE QUERYING FOR THE INTEGRATION OF DATA SERVICES  

E-Print Network (OSTI)

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

Dustdar, Schahram

254

Towards a characterization of order-invariant queries over tame structures  

Science Conference Proceedings (OSTI)

This work deals with the expressive power of logics on finite structures with access to an additional “arbitrary” linear order. The queries that can be expressed this way are the order-invariant queries for the logic. For the standard ...

Michael Benedikt; Luc Segoufin

2005-08-01T23:59:59.000Z

255

Benefits of path summaries in an XML query optimizer supporting multiple access methods  

Science Conference Proceedings (OSTI)

We compare several optimization strategies implemented in an XML query evaluation system. The strategies incorporate the use of path summaries into the query optimizer, and rely on heuristics that exploit data statistics.We present experimental results ...

Attila Barta; Mariano P. Consens; Alberto O. Mendelzon

2005-08-01T23:59:59.000Z

256

Natural Gas EIA-176 Query System Readme - U.S. Energy ...  

U.S. Energy Information Administration (EIA)

EIA-176 Query System Readme 1.0 INTRODUCTION TO THE EIA-176 FRONT END QUERY FACILITY This system provides a method of extracting and using the EIA-176 data, and ...

257

Efficient Range and Join Query Processing in Massively Distributed Peer-to-Peer Networks.  

E-Print Network (OSTI)

??Peer-to-peer (P2P) has become a modern distributed computing architecture that supports massively large-scale data management and query processing. Complex query operators such as range operator… (more)

Wang, Qiang

2008-01-01T23:59:59.000Z

258

Energy and quality aware query processing in wireless sensor database systems  

Science Conference Proceedings (OSTI)

Query processing has been studied extensively in traditional database systems. However, few existing methods can be directly applied to wireless sensor database systems (WSDSs) due to their characteristics, such as decentralized nature, limited computational ... Keywords: Energy reservation, Energy-efficiency, Imagine chain, Multipath routing, Query optimization, Query processing, Space vector model, Wireless sensor database system, k-Partial cover set problem

Qingchun Ren; Qilian Liang

2007-05-01T23:59:59.000Z

259

Analysis of multiple query reformulations on the web: The interactive information retrieval context  

Science Conference Proceedings (OSTI)

This study examines the facets and patterns of multiple Web query reformulations with a focus on reformulation sequences. Based on IR interaction models, it was presumed that query reformulation is the product of the interaction between the user and ... Keywords: Interactive information retrieval, Query reformulation, Web search engine, Web searching

Soo Young Rieh; Hong (Iris) Xie

2006-05-01T23:59:59.000Z

260

Blind chance: on potential trust friends query in mobile social networks  

Science Conference Proceedings (OSTI)

Potential-Trust-Friends-Query is an important query in mobile social network, as it enables users to discover and interact with others happen to be in their physical vicinity. In our context, we attempt to find top-k mobile users for such query. ... Keywords: check-in history, mobile social network, potential friends, trust

Jinzeng Zhang, Xiaofeng Meng

2013-06-01T23:59:59.000Z

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


261

Efficient processing of multiple continuous skyline queries over a data stream  

Science Conference Proceedings (OSTI)

Given a set of data objects, the skyline query returns the objects that are not dominated by others. Although skyline computation has been studied extensively for static data, there has been relatively less work on data streams. Recently, a few methods ... Keywords: Continuous query, Data stream, Multiple skyline query

Yu Won Lee; Ki Yong Lee; Myoung Ho Kim

2013-02-01T23:59:59.000Z

262

Semantics and implementation of continuous sliding window queries over data streams  

Science Conference Proceedings (OSTI)

In recent years the processing of continuous queries over potentially infinite data streams has attracted a lot of research attention. We observed that the majority of work addresses individual stream operations and system-related issues rather than ... Keywords: Semantics, continuous queries, data streams, query optimization

Jürgen Krämer; Bernhard Seeger

2009-04-01T23:59:59.000Z

263

A Query-based Pre-retrieval Model Selection Approach to Information Retrieval  

E-Print Network (OSTI)

A Query-based Pre-retrieval Model Selection Approach to Information Retrieval Ben He and Iadh Ounis to the same cluster. 1 Introduction An information retrieval (IR) system receives a query from the user}@dcs.gla.ac.uk Abstract In this paper, we propose a query-based pre-retrieval approach to the model selection problem

Jose, Joemon M.

264

Applying Heuristics to Improve A Genetic Query Optimisation Process in Information Retrieval  

E-Print Network (OSTI)

Applying Heuristics to Improve A Genetic Query Optimisation Process in Information Retrieval L@irit.fr Abstract This work presents a genetic approach for query optimisation in information retrieval the genetic exploration process to the information retrieval task. Experiments with AP documents and queries

Paris-Sud XI, Université de

265

Dependency-aware reordering for parallelizing query optimization in multi-core CPUs  

Science Conference Proceedings (OSTI)

The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evaluating redundant sub-plans. The number of alternative QEPs ... Keywords: multi-cores, parallel databases, query optimization

Wook-Shin Han; Jinsoo Lee

2009-06-01T23:59:59.000Z

266

"I know what you did last summer": query logs and user privacy  

Science Conference Proceedings (OSTI)

We investigate the subtle cues to user identity that may be exploited in attacks on the privacy of users in web search query logs. We study the application of simple classifiers to map a sequence of queries into the gender, age, and location of the user ... Keywords: k-anonymity, privacy, query log analysis

Rosie Jones; Ravi Kumar; Bo Pang; Andrew Tomkins

2007-11-01T23:59:59.000Z

267

Efficient discrete-time simulations of continuous-time quantum query algorithms  

E-Print Network (OSTI)

The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuously in time. Interesting algorithms have been discovered in this model, such as an algorithm for evaluating nand trees more efficiently than any classical algorithm. Subsequent work has shown that there also exists an efficient algorithm for nand trees in the discrete query model; however, there is no efficient conversion known for continuous-time query algorithms for arbitrary problems. We show that any quantum algorithm in the continuous-time query model whose total query time is T can be simulated by a quantum algorithm in the discrete query model that makes O[T log(T) / log(log(T))] queries. This is the first upper bound that is independent of the driving operations (i.e., it holds even if the norm of the driving Hamiltonian is very large). A corollary is that any lower bound of T queries for a problem in the discrete-time query model immediately carries over to a lower bound of \\Omega[T log(log(T))/log (T)] in the continuous-time query model.

R. Cleve; D. Gottesman; M. Mosca; R. D. Somma; D. L. Yonge-Mallo

2008-11-26T23:59:59.000Z

268

Evaluation of a flowchart-based EHR query system: A case study of RetroGuide  

Science Conference Proceedings (OSTI)

Provision of query systems which are intuitive for non-experts has been recognized as an important informatics challenge. We developed a prototype of a flowchart-based analytical framework called RetroGuide that enables non-experts to formulate query ... Keywords: Biomedical informatics, Data warehouse, Evaluation, Informatics, Mixed-method, Query system, RetroGuide, SQL

Vojtech Huser; Scott P. Narus; Roberto A. Rocha

2010-02-01T23:59:59.000Z

269

Ontology-driven relational query formulation using the semantic and assertional capabilities of OWL-DL  

Science Conference Proceedings (OSTI)

This work investigates the extent to which domain knowledge, expressed in a domain ontology, can assist end-users in formulating relational queries that can be executed over a complex relational database. In this regard, an ontology-driven query formulation ... Keywords: Data retrieval, Domain knowledge, Information systems, Ontology, Query formulation

K. Munir; M. Odeh; R. Mcclatchey

2012-11-01T23:59:59.000Z

270

A safe-exit approach for efficient network-based moving range queries  

Science Conference Proceedings (OSTI)

Query processing on road networks has been extensively studied in recent years. However, the processing of moving queries on road networks has received little attention. This paper studies the efficient processing of moving range queries on road networks. ... Keywords: Spatial, Temporal databases

Duncan Yung; Man Lung Yiu; Eric Lo

2012-02-01T23:59:59.000Z

271

An Energy Efficient Path Finding Query Protocol in Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

In many applications, the query mechanism would co-exist with the data collection at the same time. If these two mechanisms can be combined, the query could utilize some information from the data collection and get benefits on the robustness and stability. ... Keywords: Query, Data Collection, Sharing, Distributed, Self-adapting, CTP

Zhiqi Wang; Liang Chen; Zusheng Zhang; Fengqi Yu

2010-12-01T23:59:59.000Z

272

On efficiently processing nearest neighbor queries in a loosely coupled set of data sources  

Science Conference Proceedings (OSTI)

We propose a family of algorithms for processing nearest neighbor (NN) queries in an integration middleware that provides federated access to numerous loosely coupled, autonomous data sources connected through the internet. Previous approaches for parallel ... Keywords: data integration, distributed query processing, federated database system, kNN, nearest neighbors, parallel query processing

Thomas Schwarz; Markus Iofcea; Matthias Grossmann; Nicola Hönle; Daniela Nicklas; Bernhard Mitschang

2004-11-01T23:59:59.000Z

273

Type A: Magma-heated, Dry Steam Resource | Open Energy Information  

Open Energy Info (EERE)

source source History View New Pages Recent Changes All Special Pages Semantic Search/Querying Get Involved Help Apps Datasets Community Login | Sign Up Search Page Edit History Facebook icon Twitter icon » Type A: Magma-heated, Dry Steam Resource Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Print PDF Type A: Magma-heated, Dry Steam Resource Dictionary.png Type A: Magma-heated, Dry Steam Resource: No definition has been provided for this term. Add a Definition Brophy Occurrence Models This classification scheme was developed by Brophy, as reported in Updating the Classification of Geothermal Resources.[1] Type A: Magma-heated, Dry Steam Resource Type B: Andesitic Volcanic Resource Type C: Caldera Resource Type D: Sedimentary-hosted, Volcanic-related Resource Type E: Extensional Tectonic, Fault-Controlled Resource

274

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

Science Conference Proceedings (OSTI)

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

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

2008-07-31T23:59:59.000Z

275

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

DOE Green Energy (OSTI)

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

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

2008-07-31T23:59:59.000Z

276

FastQuery: A Parallel Indexing System for Scientific Data  

SciTech Connect

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

Chou, Jerry; Wu, Kesheng; Prabhat,

2011-07-29T23:59:59.000Z

277

The Framework for Approximate Queries on Simulation Data  

SciTech Connect

AQSim is a system intended to enable scientists to query and analyze a large volume of scientific simulation data. The system uses the state of the art in approximate query processing techniques to build a novel framework for progressive data analysis. These techniques are used to define a multi-resolution index, where each node contains multiple models of the data. The benefits of these models are two-fold: (1) they are compact representations, reconstructing only the information relevant to the analysis, and (2) the variety of models capture different aspects of the data which may be of interest to the user but are not readily apparent in their raw form. To be able to deal with the data interactively, AQSim allows the scientist to make an informed tradeoff between query response accuracy and time. In this paper, we present the framework of AQSim with a focus on its architectural design. We also show the results from an initial proof-of-concept prototype developed at LLNL. The presented framework is generic enough to handle more than just simulation data.

Abdulla, G; Baldwin, C; Critchlow, T; Kamimura, R; Lee, B; Musick, R; Snapp, R; Tang, N

2001-09-27T23:59:59.000Z

278

Glossary of Sewing Terms  

E-Print Network (OSTI)

This publication lists common terms used in sewing. It includes definitions of garment types, fabric qualities, notions and construction procedures.

2006-05-01T23:59:59.000Z

279

Online query answering with differential privacy: a utility-driven approach using Bayesian inference  

E-Print Network (OSTI)

Data privacy issues frequently and increasingly arise for data sharing and data analysis tasks. In this paper, we study the problem of online query answering under the rigorous differential privacy model. The existing interactive mechanisms for differential privacy can only support a limited number of queries before the accumulated cost of privacy reaches a certain bound. This limitation has greatly hindered their applicability, especially in the scenario where multiple users legitimately need to pose a large number of queries. To minimize the privacy cost and extend the life span of a system, we propose a utility-driven mechanism for online query answering using Bayesian statistical inference. The key idea is to keep track of the query history and use Bayesian inference to answer a new query using previous query answers. The Bayesian inference algorithm provides both optimal point estimation and optimal interval estimation. We formally quantify the error of the inference result to determine if it satisfies t...

Xiao, Yonghui

2012-01-01T23:59:59.000Z

280

Review of effects of long-term aging on the mechanical properties and microstructures of Types 304 and 316 stainless steel  

SciTech Connect

Because commercial liquid metal fast breeder reactor (LMFBR) are designed to last for 40 years or more, an understanding of the mechanical behavior of the structural alloys used in them is required for times on the order of 2.5 x 10/sup 5/ h (assuming a 70% availability factor). Types 304 and 316 stainless steel are used extensively in LMFBR systems. At the beginning of life these alloys are in a metastable state and evolve to a more stable state and, therefore, more stable microstructure during plant operation. Correlations of microstructures and mechanical properties during aging under representative LMFBR temperature and loading conditions are desirable from the standpoint of assuring safe, reliable, and economic plant operation. We reviewed the mechanical properties and microstructures of types 304 and 316 stainless steel wrought alloys after long-term aging in air for times up to 9 x 10/sup 4/ h (about 10-1/2 years). The principal effect of such aging is to reduce low temperature fracture toughness (as measured by Charpy impact test) and tensile ductility. Examples are cited, however, where, because stable microstructures are achieved, these as well as strength-related properties can be expected to remain adequate for anticipated service life conditions. 16 refs., 19 figs.

Horak, J.A.; Sikka, V.K.; Raske, D.T.

1985-01-01T23:59:59.000Z

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


281

Term similarity-based query expansion for cross-language information retrieval  

E-Print Network (OSTI)

Adriani,M. van Rijsbergen,C.J. Proceedings of European Conference on Digital Libraries (ECDL 99) pp 311-322

Adriani, M.

282

Unsupervised speech processing with applications to query-by-example spoken term detection  

E-Print Network (OSTI)

This thesis is motivated by the challenge of searching and extracting useful information from speech data in a completely unsupervised setting. In many real world speech processing problems, obtaining annotated data is not ...

Zhang, Yaodong, Ph. D. Massachusetts Institute of Technology

2013-01-01T23:59:59.000Z

283

MetaBrowser: A combined browsing, query, and analysis tool  

SciTech Connect

The MetaBrowser design is based on the premise that scientists should not be forced to learn new languages or commands for finding the data they are interested in and for selecting subsets of the data for further analysis. Furthermore, there should be a single system that permits browsing, query, and analysis of the data, so that the scientist does not have to switch between systems. The current version for the MetaBrowser was designed for the DOE CEDR (Comprehensive Epidemiological Data Resource) project, but the same principles can apply to other scientific disciplines. Browsing and query should be combined. It is quite natural for a user to explore the information in the database before deciding what subset of the data to select for further analysis. In general, if there is a large number of datasets (i.e. databases) in the system, then the user would want to find out information about the various datasets (called metadata), before choosing one or more datasets for further exploration. Thus, a metadatabase that holds information about datasets in the systems must exist.

Shoshani, A.; Szeto, E.

1991-04-01T23:59:59.000Z

284

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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

285

VISIONARY: a visual query language based on the user viewpoint approach  

E-Print Network (OSTI)

Query languages for RDBMSs lack in intuitive understanding; this precludes inexperienced users from taking advantage of them. The adoption of a visual interface can simplify the query formulation process by enabling users to interact with a friendly environment. In this work we propose a visual query language based on a hybrid iconic-diagrammatic paradigm, used for both data and query representation. The external data model is called vision and comprises the visual primitives of concept- represented by the combination of text and icon, and association- represented by a name and a multiplicity for each possible orientation. The external query model is based on the definition of a user viewpoint, which is a perspective for accessing data defined dynamically by selecting a concept of primary interest for formulating each query. 1

Francesca Benzi; Dario Maio; Stefano Rizzi

1996-01-01T23:59:59.000Z

286

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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

287

You Provide the Search Term, Green Energy Portal Provides the Concepts |  

Office of Scientific and Technical Information (OSTI)

You Provide the Search Term, Green Energy Portal Provides the Concepts You Provide the Search Term, Green Energy Portal Provides the Concepts NEWS MEDIA CONTACT: Cathey Daniels, (865) 576-9539 FOR IMMEDIATE RELEASE September 7, 2011 You Provide the Search Term, Green Energy Portal Provides the Concepts New Semantic Search Technology plus Auto-complete Gets You a More Direct Line to Rich Scientific Content When you type "solar power" into a search box, are you looking for information on solar farms, solar radiation, or solar electric power plants? The U.S. Department of Energy (DOE) Green Energy portal can now map your keyword query to scientific concepts. This semantic technique, called "keyword to concept mapping," is applied to your search behind the scenes and helps hone your search for more efficient knowledge access and

288

EIA-176 Query System 2006 - U.S. Energy Information Administration ...  

U.S. Energy Information Administration (EIA)

The query system application is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later.

289

Query Expansion Research and Application in Search Engine Based on Concepts Lattice.  

E-Print Network (OSTI)

??Formal concept analysis is increasingly applied to query expansion and data mining problems. In this paper I analyze and compare the current concept lattice construction… (more)

Cui, Jun

2009-01-01T23:59:59.000Z

290

Adaptive Range Counting and Other Frequency-Based Range Query Problems.  

E-Print Network (OSTI)

??We consider variations of range searching in which, given a query range, our goal is to compute some function based on frequencies of points that… (more)

Wilkinson, Bryan T.

2012-01-01T23:59:59.000Z

291

Event-Driven Dynamic Query Model for Sleep Study Outcomes Research.  

E-Print Network (OSTI)

??This research work presents a software solution, called PSG Query System, for sleep study clinicians and researchers as a part of an integrated effort for… (more)

Jain, Sulabh

2012-01-01T23:59:59.000Z

292

Towards musical query-by-semantic-description using the CAL500 data set  

Science Conference Proceedings (OSTI)

Query-by-semantic-description (QBSD)is a natural paradigm for retrieving content from large databases of music. A major impediment to the development of good QBSD systems for music information retrieval has been the lack of a cleanly-labeled, publicly-available, ... Keywords: content-based music information retrieval, query-by-semantic-description, supervised multi-class classification

Douglas Turnbull; Luke Barrington; David Torres; Gert Lanckriet

2007-07-01T23:59:59.000Z

293

Reordering an index to speed query processing without loss of effectiveness  

Science Conference Proceedings (OSTI)

Following Long and Suel, we empirically investigate the importance of document order in search engines which rank documents using a combination of dynamic (query-dependent) and static (query-independent) scores, and use document-at-a-time (DAAT) processing. ... Keywords: efficiency and effectiveness, enterprise search, information retrieval, inverted files

David Hawking; Timothy Jones

2012-12-01T23:59:59.000Z

294

A knowledge infrastructure for intelligent query answering in location-based services  

Science Conference Proceedings (OSTI)

Intelligent query answering in Location-based Services refers to their capability to provide mobile users with personalized and contextualized answers. Personalization is expected to lead to answers that better match user's interests, as inferable from ... Keywords: Context-awareness, Contextualization, Location-based services, Ontology, Personalization, Query answering, User profile

Shijun Yu; Stefano Spaccapietra

2010-07-01T23:59:59.000Z

295

Inferring the demographics of search users: social data meets search queries  

Science Conference Proceedings (OSTI)

Knowing users' views and demographic traits offers a great potential for personalizing web search results or related services such as query suggestion and query completion. Such signals however are often only available for a small fraction of search ... Keywords: personalized search, social networks, user demographics

Bin Bi, Milad Shokouhi, Michal Kosinski, Thore Graepel

2013-05-01T23:59:59.000Z

296

Robust runtime optimization and skew-resistant execution of analytical SPARQL queries on pig  

Science Conference Proceedings (OSTI)

We describe a system that incrementally translates SPARQL queries to Pig Latin and executes them on a Hadoop cluster. This system is designed to work efficiently on complex queries with many self-joins over huge datasets, avoiding job failures even in ...

Spyros Kotoulas; Jacopo Urbani; Peter Boncz; Peter Mika

2012-11-01T23:59:59.000Z

297

Answering ad hoc aggregate queries from data streams using prefix aggregate trees  

Science Conference Proceedings (OSTI)

In some business applications such as trading management in financial institutions, it is required to accurately answer ad hoc aggregate queries over data streams. Materializing and incrementally maintaining a full data cube or even its compression or ... Keywords: Aggregate query, Data cube, Data stream, Data warehousing, Online analytic processing (OLAP)

Moonjung Cho; Jian Pei; Ke Wang

2007-08-01T23:59:59.000Z

298

ISABELA-QA: query-driven analytics with ISABELA-compressed extreme-scale scientific data  

Science Conference Proceedings (OSTI)

Efficient analytics of scientific data from extreme-scale simulations is quickly becoming a top-notch priority. The increasing simulation output data sizes demand for a paradigm shift in how analytics is conducted. In this paper, we argue that query-driven ... Keywords: compression, data reduction, data-intensive computing, high performance applications, query-driven analytics

Sriram Lakshminarasimhan; John Jenkins; Isha Arkatkar; Zhenhuan Gong; Hemanth Kolla; Seung-Hoe Ku; Stephane Ethier; Jackie Chen; C. S. Chang; Scott Klasky; Robert Latham; Robert Ross; Nagiza F. Samatova

2011-11-01T23:59:59.000Z

299

Minimizing I/O Costs of Multi-Dimensional Queries with BitmapIndices  

Science Conference Proceedings (OSTI)

Bitmap indices have been widely used in scientific applications and commercial systems for processing complex,multi-dimensional queries where traditional tree-based indices would not work efficiently. A common approach for reducing the size of a bitmap index for high cardinality attributes is to group ranges of values of an attribute into bins and then build a bitmap for each bin rather than a bitmap for each value of the attribute. Binning reduces storage costs,however, results of queries based on bins often require additional filtering for discarding it false positives, i.e., records in the result that do not satisfy the query constraints. This additional filtering,also known as ''candidate checking,'' requires access to the base data on disk and involves significant I/O costs. This paper studies strategies for minimizing the I/O costs for ''candidate checking'' for multi-dimensional queries. This is done by determining the number of bins allocated for each dimension and then placing bin boundaries in optimal locations. Our algorithms use knowledge of data distribution and query workload. We derive several analytical results concerning optimal bin allocation for a probabilistic query model. Our experimental evaluation with real life data shows an average I/O cost improvement of at least a factor of 10 for multi-dimensional queries on datasets from two different applications. Our experiments also indicate that the speedup increases with the number of query dimensions.

Rotem, Doron; Stockinger, Kurt; Wu, Kesheng

2006-03-30T23:59:59.000Z

300

An approach to solve division-like queries in fuzzy object databases  

Science Conference Proceedings (OSTI)

The division operator is well known in the context of fuzzy relational databases. Fuzzy approaches to this operator can be found in the literature to solve flexible queries: these approaches try to compute to which extent each element of a candidate ... Keywords: Division, Flexible queries, Fuzzy object databases, Inclusion

Nicolás Marín; Carlos Molina; Olga Pons; M. Amparo Vila

2012-06-01T23:59:59.000Z

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


301

Group-based Query Learning for rapid diagnosis in time-critical situations  

E-Print Network (OSTI)

In query learning, the goal is to identify an unknown object while minimizing the number of "yes or no" questions (queries) posed about that object. We consider three extensions of this fundamental problem that are motivated by practical considerations in real-world, time-critical identification tasks such as emergency response. First, we consider the problem where the objects are partitioned into groups, and the goal is to identify only the group to which the object belongs. Second, we address the situation where the queries are partitioned into groups, and an algorithm may suggest a group of queries to a human user, who then selects the actual query. Third, we consider the problem of query learning in the presence of persistent query noise, and relate it to group identification. To address these problems we show that a standard algorithm for query learning, known as the splitting algorithm or generalized binary search, may be viewed as a generalization of Shannon-Fano coding. We then extend this result to t...

Bellala, Gowtham; Scott, Clayton

2009-01-01T23:59:59.000Z

302

Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching  

Science Conference Proceedings (OSTI)

Pivot-based algorithms are effective tools for proximity searching in metric spaces. They allow trading space overhead for number of distance evaluations performed at query time. With additional search structures (that pose extra space overhead) they ... Keywords: fixed queries tree, metric spaces, range search, similarity search

Edgar Chávez; José L. Marroquín; Gonzalo Navarro

2001-06-01T23:59:59.000Z

303

CoCache: query processing based on collaborative caching in P2P systems  

Science Conference Proceedings (OSTI)

In this paper, we propose CoCache, a P2P query processing architecture that enables sophisticated optimization techniques. CoCache is different from existing P2P query processing systems in three ways. First, a coordinator overlay network (CON) maintaining ...

Weining Qian; Linhao Xu; Shuigeng Zhou; Aoying Zhou

2005-04-01T23:59:59.000Z

304

Efficient exact edit similarity query processing with the asymmetric signature scheme  

Science Conference Proceedings (OSTI)

Given a query string Q, an edit similarity search finds all strings in a database whose edit distance with Q is no more than a given threshold t. Most existing method answering edit similarity queries rely on a signature scheme to generate candidates ... Keywords: Q-gram, approximate pattern matching, edit distance, similarity join, similarity search

Jianbin Qin; Wei Wang; Yifei Lu; Chuan Xiao; Xuemin Lin

2011-06-01T23:59:59.000Z

305

Weakly-supervised discovery of named entities using web search queries  

Science Conference Proceedings (OSTI)

A seed-based framework for textual information extraction allows for weakly supervised extraction of named entities from anonymized Web search queries. The extraction is guided by a small set of seed named entities, without any need for handcrafted extraction ... Keywords: knowledge acquisition, named entities, query logs, unstructured text, weakly supervised information extraction

Marius Pa?ca

2007-11-01T23:59:59.000Z

306

FICSR: feedback-based inconsistency resolution and query processing on misaligned data sources  

Science Conference Proceedings (OSTI)

A critical reality in data integration is that knowledge from different sources may often be conflicting with each other. Conflict resolutioncan be costly and, if done without proper context, can be ineffective. In this paper, we propose a novel query-driven ... Keywords: conflicts, query processing, reasoning with misaligned data, relevance feedback, taxonomy

Yan Qi; K. Selçuk Candan; Maria Luisa Sapino

2007-06-01T23:59:59.000Z

307

Seeding simulated queries with user-study data forpersonal search evaluation  

Science Conference Proceedings (OSTI)

In this paper we perform a lab-based user study (n=21) of email re-finding behaviour, examining how the characteristics of submitted queries change in different situations. A number of logistic regression models are developed on the query data to explore ... Keywords: email re-finding, evaluation, personal search, user study

David Elsweiler; David E. Losada; José C. Toucedo; Ronald T. Fernandez

2011-07-01T23:59:59.000Z

308

A top-down approach for compressing data cubes under the simultaneous evaluation of multiple hierarchical range queries  

Science Conference Proceedings (OSTI)

A novel top-down compression technique for data cubes is introduced and experimentally assessed in this paper. This technique considers the previously unrecognized case in which multiple Hierarchical Range Queries (HRQ), a very useful class ... Keywords: Advanced OLAP, Compressing data cubes under simultaneous multiple OLAP queries, Multi-objective compression of data cubes, Multiple-query data cube compression techniques

Alfredo Cuzzocrea

2010-06-01T23:59:59.000Z

309

Bacteria Types  

NLE Websites -- All DOE Office Websites (Extended Search)

Bacteria Types Bacteria Types Name: Evelyn Location: N/A Country: N/A Date: N/A Question: What is the significance of S. marcescens,M.luteus, S.epidermidis, and E. Coli? Which of these are gram-positive and gram-negative, and where can these be found? Also, what problems can they cause? When we culture these bacteria, we used four methods: plates, broth, slants, and pour plates. The media was made of TSB, TSA, NAP, and NAD. What is significant about these culturing methods? Replies: I could give you the answer to that question but it is more informative, and fun, to find out yourself. Start with the NCBI library online (http://www.ncbi.nlm.nih.gov/) and do a query with the species name, and 'virulence' if you want to know what they're doing to us. Have a look at the taxonomy devision to see how they are related. To find out if they're gram-pos or neg you should do a gram stain if you can. Otherwise you'll find that information in any bacteriology determination guide. Your question about the media is not specific enough so I can't answer it.

310

TreeQ-VISTA: An Interactive Tree Visualization Tool withFunctional Annotation Query Capabilities  

SciTech Connect

Summary: We describe a general multiplatform exploratorytool called TreeQ-Vista, designed for presenting functional annotationsin a phylogenetic context. Traits, such as phenotypic and genomicproperties, are interactively queried from a relational database with auser-friendly interface which provides a set of tools for users with orwithout SQL knowledge. The query results are projected onto aphylogenetic tree and can be displayed in multiple color groups. A richset of browsing, grouping and query tools are provided to facilitatetrait exploration, comparison and analysis.Availability: The program,detailed tutorial and examples are available online athttp://genome-test.lbl.gov/vista/TreeQVista.

Gu, Shengyin; Anderson, Iain; Kunin, Victor; Cipriano, Michael; Minovitsky, Simon; Weber, Gunther; Amenta, Nina; Hamann, Bernd; Dubchak,Inna

2007-05-07T23:59:59.000Z

311

Short-Term Ice Accretion Forecasts for Electric Utilities Using the Weather Research and Forecasting Model and a Modified Precipitation-Type Algorithm  

Science Conference Proceedings (OSTI)

The Weather Research and Forecasting model (WRF) is used to provide 6–12-h forecasts of the necessary input parameters to a separate algorithm that determines the most likely precipitation type at each model grid point. In instances where ...

Arthur T. DeGaetano; Brian N. Belcher; Pamela L. Spier

2008-10-01T23:59:59.000Z

312

From regular expressions to nested words: unifying languages and query execution for relational and XML sequences  

Science Conference Proceedings (OSTI)

There is growing interest in query language extensions for pattern matching over event streams and stored database sequences, due to the many important applications that such extensions make possible. The push for such extensions has led DBMS vendors ...

Barzan Mozafari; Kai Zeng; Carlo Zaniolo

2010-09-01T23:59:59.000Z

313

Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data  

Science Conference Proceedings (OSTI)

Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be expressed as queries selecting objects that satisfy complex local conditions ...

Ruslan Fomkin; Tore Risch

2009-06-01T23:59:59.000Z

314

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

E-Print Network (OSTI)

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

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

315

Adaptive stream filters for entity-based queries with non-value tolerance  

Science Conference Proceedings (OSTI)

We study the problem of applying adaptive filters for approximate query processing in a distributed stream environment. We propose filter bound assignment protocols with the objective of reducing communication cost. Most previous works focus on value-based ...

Reynold Cheng; Ben Kao; Sunil Prabhakar; Alan Kwan; Yicheng Tu

2005-08-01T23:59:59.000Z

316

Evaluating probability threshold k-nearest-neighbor queries over uncertain data  

Science Conference Proceedings (OSTI)

In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these uncertain databases, an important query is the Probabilistic k-Nearest-Neighbor ...

Reynold Cheng; Lei Chen; Jinchuan Chen; Xike Xie

2009-03-01T23:59:59.000Z

317

A corpus analysis approach for automatic query expansion and its extension to multiple databases  

Science Conference Proceedings (OSTI)

Searching online text collections can be both rewarding and frustrating. While valuable information can be found, typically many irrelevant documents are also retrieved, while many relevant ones are missed. Terminology mismatches between the user's ... Keywords: query expansion

Susan Gauch; Jianying Wang; Satya Mahesh Rachakonda

1999-07-01T23:59:59.000Z

318

Approximate query answering in unstructured peer-to-peer databases.  

E-Print Network (OSTI)

??Peer-to-peer networks are considered the new generation of distributed databases, termed peer-to-peer databases. With very large size, open architecture, and extreme dynamism and autonomy, approximate… (more)

Banaei-Kashani, Farnoush

2007-01-01T23:59:59.000Z

319

Energy-Efficient Dry-Type Distribution Transformers: New Opportunities to Cut Energy Bills and Lock-in Long-Term Energy Savings  

E-Print Network (OSTI)

Nearly 90% of the electricity that powers the industrial sector flows through dry-type distribution transformers. These transformers are very efficient- most convert in excess of 95% of input power to output power. However, because transformers are generally energized 24 hours per day, 365 days per year, even small efficiency improvements can yield big energy and dollar savings for power users. Until now, energy-efficient dry-type transformers have been hard to identify. As a result, most users either have failed to specify efficiency at all or relied on the imperfect indicator of low temperature rise. Most manufactures have not offered an "energy-efficient" product line. Now, the National Electrical Manufacturers' Association (NEMA), the transformer manufacturers' trade association, has published a standard defining energy-efficient transformers. This new standard, NEMA standard TP-1, makes it easier for vendors, specifiers, contractors and end-users to identify and determine the cost-effectiveness of energy-efficient transformers. In addition, some manufacturers are beginning to offer equipment lines specifically designed to meet the energy efficiency levels defined in NEMA standard TP-1.

deLaski, A.; Suozzo, M.

1998-04-01T23:59:59.000Z

320

Flu Terms Defined  

NLE Websites -- All DOE Office Websites (Extended Search)

Flu Terms Defined H1N1 Influenza is a respiratory disease of pigs caused by type A influenza viruses that causes regular outbreaks in pigs. People do not normally get H1N1 flu, but...

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


321

An Application of Multivariate Statistical Analysis for Query-Driven Visualization  

Science Conference Proceedings (OSTI)

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

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

2010-03-01T23:59:59.000Z

322

Visionary: a viewpoint-based visual language for querying relational databases  

E-Print Network (OSTI)

The adoption of a visual interface can simplify the query formulation process in DBMSs by enabling naive users to interact with a friendly environment. In this work we propose a visual query language based on a diagrammatic paradigm, used for both data and query representation. The external data model is called vision and is made up of the visual primitives of concept and association. The external query model is based on the definition of a viewpoint, which is a perspective for accessing data defined dynamically by selecting a concept of primary interest. Internally, the data model is relational and the query language is SQL. An intermediate graph-based model ensures consistent mapping between the visual and the relational worlds. Our language has been implemented within a tool which can be mounted on top of any relational DBMS supporting ODBC. The system has been tested with naive users; the results of the experiment are reported and compared with those obtained with other visual languages. Keywords and phrases: VPL-II.B.1: Diagrammatic languages, VPL-V.B: Database languages 1

Francesca Benzi; Dario Maio; Stefano Rizzi

1999-01-01T23:59:59.000Z

323

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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

324

Adaptive time-to-live strategies for query result caching in web search engines  

E-Print Network (OSTI)

Abstract. An important research problem that has recently started to receive attention is the freshness issue in search engine result caches. In the current techniques in literature, the cached search result pages are associated with a fixed time-to-live (TTL) value in order to bound the staleness of search results presented to the users, potentially as part of a more complex cache refresh or invalidation mechanism. In this paper, we propose techniques where the TTL values are set in an adaptive manner, on a per-query basis. Our results show that the proposed techniques reduce the fraction of stale results served by the cache and also decrease the fraction of redundant query evaluations on the search engine backend compared to a strategy using a fixed TTL value for all queries.

Sadiye Alici; Ismail Sengor Altingovde; Rifat Ozcan; B. Barla Cambazoglu; Özgür Ulusoy

2012-01-01T23:59:59.000Z

325

A Framework for Moving Sensor Data Query and Retrieval of Dynamic Atmospheric Events  

E-Print Network (OSTI)

Abstract. One challenge in Earth science research is the accurate and efficient ad-hoc query and retrieval of Earth science satellite sensor data based on user-defined criteria to study and analyze atmospheric events such as tropical cyclones. The problem can be formulated as a spatiotemporal join query to identify the spatio-temporal location where moving sensor objects and dynamic atmospheric event objects intersect, either precisely or within a user-defined proximity. In this paper, we describe an efficient query and retrieval framework to handle the problem of identifying the spatio-temporal intersecting positions for satellite sensor data retrieval. We demonstrate the effectiveness of our proposed framework using sensor measurements from QuikSCAT (wind field measurement) and TRMM (precipitation vertical profile measurements) satellites, and the trajectories of the tropical cyclones occurring in the North Atlantic Ocean in 2009. Key words: data retrieval, satellite data, atmospheric events, spatiotemporal

Shen-shyang Ho; Wenqing Tang; W. Timothy Liu; Markus Schneider

2010-01-01T23:59:59.000Z

326

Query-Driven Visualization of Time-Varying Adaptive Mesh Refinement Data  

Science Conference Proceedings (OSTI)

The visualization and analysis of AMR-based simulations is integral to the process of obtaining new insight in scientific research. We present a new method for performing query-driven visualization and analysis on AMR data, with specific emphasis on time-varying AMR data. Our work introduces a new method that directly addresses the dynamic spatial and temporal properties of AMR grids which challenge many existing visualization techniques. Further, we present the first implementation of query-driven visualization on the GPU that uses a GPU-based indexing structure to both answer queries and efficiently utilize GPU memory. We apply our method to two different science domains to demonstrate its broad applicability.

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

2008-08-01T23:59:59.000Z

327

Bridging the Virtual Observatory and the GRID with the query element  

E-Print Network (OSTI)

The current generation of Grid infrastructures designed for production activity is strongly computing oriented and tuned on the needs of applications that requires intensive computations. Problems arise when trying to use such Grids to satisfy the sharing of data-oriented and service-oriented resources as happens in the IVOA community. We have designed, developed and implemented a Grid query element to access data source from an existing production Grid environment. We also enhanced the Grid middleware model (collective resources and sites) to manage Data Sources extending the Grid semantic. The query element and the modified grid Information System are able to connect the Grid environment to Virtual Observatory resources. A specialized query element is designed to work as Virtual Observatory resource in the Grid so than an Astronomer can access Virtual Observatory data using the IVOA standards.

G. Taffoni; E. Ambrodsi; C. Vuerli; A. Barisani; R. Smareglia; A. Volpato; S. Pastore; A. Baruffolo; A. Ghiselli; F. Pasian; L. Benacchio

2006-05-05T23:59:59.000Z

328

An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation  

E-Print Network (OSTI)

This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target keyword in an ordered list of the i-th block. Apart from much studied polynomial and adversary methods for quantum query complexity lower bounds, our argument shows that the multiple-block ordered search needs a large number of nonadaptive oracle queries on a black-box model of quantum computation that is also supplemented with advice. Our argument is also applied to the notions of computational complexity theory: quantum truth-table reducibility and quantum truth-table autoreducibility.

Harumichi Nishimura; Tomoyuki Yamakami

2003-11-29T23:59:59.000Z

329

CSCE4350 SQL Query Assignment Date Issued: 9/20/2012  

E-Print Network (OSTI)

. List all customers 3. Find loan number, branch name, and the loan amount multiplied by 10 of each loan, loan number and loan amount of all customers having a loan at the Downtown branch. 7. Find the names with the query number, e.g Part A.1. Make sure your file runs before submitting it because the TA will check

Huang, Yan

330

A framework for distributed mediation of temporal-abstraction queries to clinical databases  

Science Conference Proceedings (OSTI)

Objective:: The specification and creation of a distributed system that integrates medical knowledge bases with time-oriented clinical databases; the goal is to answer complex temporal queries regarding both raw data and its abstractions, such as are ... Keywords: Clinical systems, Knowledge-based systems, Mediators, Medical informatics, Temporal abstraction, Temporal reasoning

David Boaz; Yuval Shahar

2005-05-01T23:59:59.000Z

331

Optimization of continuous query processing for RFID sensor tag data stream  

Science Conference Proceedings (OSTI)

In RFID system, RFID tags emit data continuously and sensed by RFID access point. RFID data are appears in form of stream data items to RFID host. By this RFID data collecting, RFID system provides identification information of objects which tags attached ... Keywords: RFID sensor tag, RFID system, continuous query, data stream management system

Yongxu Piao; Wooseok Ryu; Haipeng Zhang; Bonghee Hong

2009-11-01T23:59:59.000Z

332

Some modifications of bucket-based algorithms for query rewriting using views  

Science Conference Proceedings (OSTI)

Query rewriting using views is an important topic in data integration. A number of rewriting algorithms, such as the SVB algorithm, the MiniCon algorithm and the inverse rules algorithm, have been developed. All the algorithms can generate a maximally-contained ...

Qingyuan Bai; Jun Hong; Michael F. McTear

2004-10-01T23:59:59.000Z

333

Optimization of Accurate Top-k Query in Sensor Networks with Cached Data  

E-Print Network (OSTI)

-pan,li-ml,wu-my}@cs.sjtu.edu.cn Wei Shu Department of Electrical and Computer Engineering The University of New Mexico Albuquerque, NM to the rate at which it consumes energy. Additionally, the radio communication is orders of magnitude more sensor readings to optimize the query processing. By using the aggregated historical data in intermediate

334

Remote sensing image segmentation by active queries Devis Tuia a,n  

E-Print Network (OSTI)

Remote sensing image segmentation by active queries Devis Tuia a,n , Jordi Mun~oz-Mari´ b , Gustavo Multiscale image segmentation Remote sensing Hyperspectral imagery Multispectral imagery a b s t r a c- istics in a compact way. For remote sensing image segmentation, the selected samples are the most

Camps-Valls, Gustavo

335

Query Answering over DL ABoxes: How to Pick the Relevant Symbols  

E-Print Network (OSTI)

is decidable in ALC and ALCI, but relevance regarding instance queries is unde- cidable in ALCF and relevance.g., for ALCF. To see this, take T = { ( 1 r) A} and = {r}. Then A is IQ- and CQ-relevant with UNA due of IQ- (and thus also CQ-) relevance, and a NExpTimeNP upper bound; for ALCF, we prove undecidability

Lutz, Carsten

336

Not so creepy crawler: easy crawler generation with standard xml queries  

Science Conference Proceedings (OSTI)

Web crawlers are increasingly used for focused tasks such as the extraction of data from Wikipedia or the analysis of social networks like last.fm. In these cases, pages are far more uniformly structured than in the general Web and thus crawlers can ... Keywords: data extraction, web crawler, web query, xml

Franziska von dem Bussche; Klara Weiand; Benedikt Linse; Tim Furche; François Bry

2010-04-01T23:59:59.000Z

337

A Hybrid Query Language for an Extended Entity-Relationship Model  

E-Print Network (OSTI)

We present the hybrid query language HQL/EER for an Extended Entity-Relationship model. As its main characteristic, this language allows a user to use both graphical and textual elements in the formulation of one and the same query. We demonstrate the lookand -feel of this query language by means of examples, and show how syntax and semantics of this language are formally defined using programmed graph rewriting systems. Although we present the language in the context of the EER model, the concept of hybrid languages is applicable in the context of other database models as well. We illustrate this claim by discussing a prototype implementation of a Hybrid Query Tool based on an object-oriented approach, namely the Object Modeling Technique (OMT). 1 Introduction The database research efforts of the past decade have provided us with a wide range of both database models and systems, allowing the user to perform complex manipulations on data structures of high modeling power. Th...

Marc Andries; Gregor Engels

1993-01-01T23:59:59.000Z

338

Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set  

Science Conference Proceedings (OSTI)

Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve known substructures in the data, the Protein-Protein Interactions (PPIs) networks. ... Keywords: Graph query, pattern matching, dynamic programming, protein-protein interactions networks.

Guillaume Blin; Florian Sikora; Stephane Vialette

2010-10-01T23:59:59.000Z

339

A path-traceable query routing mechanism for search in unstructured peer-to-peer networks  

Science Conference Proceedings (OSTI)

Unstructured Peer-to-Peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. Searching for content in unstructured P2P networks is a challenging task because the distribution of objects ... Keywords: Dynamic network, Network topologies, Peer-to-peer (P2P), Query routing

Ming Xu; Shuigeng Zhou; Jihong Guan; Xiaohua Hu

2010-03-01T23:59:59.000Z

340

Divide-and-query and subterm dependency tracking in the mercury declarative debugger  

Science Conference Proceedings (OSTI)

We have implemented a declarative debugger for Mercury that is capable of finding bugs in large, long-running programs. This debugger implements several search strategies. We discuss the implementation of two of these strategies and the conditions under ... Keywords: algorithmic debugging, declarative debugging, divide-and-query, program slicing

Ian MacLarty; Zoltan Somogyi; Mark Brown

2005-09-01T23:59:59.000Z

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


341

Visualizing the results of interactive queries for geographic data on mobile devices  

Science Conference Proceedings (OSTI)

The capabilities of current mobile computing devices such as PDAs and mobile phones are making it possible to design and develop mobile GIS applications that provide users with geographic data management and cartographic presentations in the field. However, ... Keywords: GIS, dynamic queries, mobile devices, visualization

Stefano Burigat; Luca Chittaro

2005-11-01T23:59:59.000Z

342

Schema-as-you-go: on probabilistic tagging and querying of wide tables  

Science Conference Proceedings (OSTI)

The emergence of Web 2.0 has resulted in a huge amount of heterogeneous data that are contributed by a large number of users, engendering new challenges for data management and query processing. Given that the data are unified from various sources and ... Keywords: dynamic instantiation, probabilistic tagging, wide table

Meiyu Lu; Divyakant Agrawal; Bing Tian Dai; Anthony K.H. Tung

2011-06-01T23:59:59.000Z

343

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

SciTech Connect

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

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

2012-01-01T23:59:59.000Z

344

An incremental approach to closest pair queries in spatial networks using best-first search  

Science Conference Proceedings (OSTI)

This paper addresses the problem of k Closest Pairs (kCP) query in spatial network databases. A Best-First search approach namely BFCP (Best-First Closest Pair) is proposed. Given two data sets of objects in a spatial network, BFCP first finds the 1st ... Keywords: buffer management, closest pair, location-based services, spatial networks

Chunan Chen; Weiwei Sun; Baihua Zheng; Dingding Mao; Weimo Liu

2011-08-01T23:59:59.000Z

345

Parallelization of XPath queries using multi-core processors: challenges and experiences  

Science Conference Proceedings (OSTI)

In this study, we present experiences of parallelizing XPath queries using the Xalan XPath engine on shared-address space multi-core systems. For our evaluation, we consider a scenario where an XPath processor uses multiple threads to concurrently navigate ...

Rajesh Bordawekar; Lipyeow Lim; Oded Shmueli

2009-03-01T23:59:59.000Z

346

Adaptive Optimization of Join Trees for Multi-join Queries over Sensor Streams  

E-Print Network (OSTI)

Hyeong-Ah Choi Department of Computer Science The George Washington University Washington, DC, USA Email window based multi-join queries over continuous data streams and prove its NP-Hardness. We present stream, sliding windows, adaptive optimization, dynamic program- ming I. INTRODUCTION Due to advancements

Choi, Hyeong-Ah

347

Efficient and robust query processing in dynamic environments using random walk techniques  

Science Conference Proceedings (OSTI)

Many existing systems for sensor networks rely on state information stored in the nodes for proper operation (e.g., pointers to parent in a spanning tree, routing information, etc). In dynamic environments, such systems must adopt failure recovery mechanisms, ... Keywords: query processing, random walk, sensor networks

Chen Avin; Carlos Brito

2004-04-01T23:59:59.000Z

348

Detecting distributed scans using high-performance query-driven visualization  

Science Conference Proceedings (OSTI)

Modern forensic analytics applications, like network traffic analysis, perform high-performance hypothesis testing, knowledge discovery and data mining on very large datasets. One essential strategy to reduce the time required for these operations is ... Keywords: data mining, network connection analysis, network security, query-driven visualization, visual analytics

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

2006-11-01T23:59:59.000Z

349

Querying Large Geo Image Databases: A Case Study1 PETER BAUMANN  

E-Print Network (OSTI)

of the Bavarian Land Survey Authority. The state of Bavaria covers 20% of the area of Germany; its aerial photo|hoefner|schatz}@active-knowledge.com Abstract: Online services based on extremely large volumes of aerial and satellite imagery are be- coming query support for the functionality sketched. Providing maps and aerial imagery of Bavaria is the task

Baumann, Peter

350

Ficsr: Feedback-based InConSistency Resolution and query processing on misaligned data sources  

E-Print Network (OSTI)

A critical reality in data integration is that knowledge from different sources may often be conflicting with each other. Conflict resolution can be costly and, if done without proper context, can be ineffective. In this paper, we propose a novel query-driven and feedback-based approach (FICSR 1) to conflict resolution when integrating data sources. In particular, instead of relying on traditional model based definition of consistency, we introduce a ranked interpretation. This not only enables FICSR to deal with the complexity of the conflict resolution process, but also helps achieve a more direct match between the users ’ (subjective) interpretation of the data and the system’s (objective) treatment of the available alternatives. Consequently, the ranked interpretation leads to new opportunities for bi-directional (data informs ? ? user) feedback cycle for conflict resolution: given a query, (a) a preliminary ranking of candidate results on data can inform the user regarding constraints critical to the query, while (b) user feedback regarding the ranks can be exploited to inform the system about user’s relevant domain knowledge. To enable this feedback process, we develop data structures and algorithms for efficient off-line conflict/agreement analysis of the integrated data as well as for on-line query processing, candidate result enumeration, and validity analysis. The results are brought together and evaluated in the FICSR system.

Yan Qi; K. Selçuk Candan

2007-01-01T23:59:59.000Z

351

The time-based data partitioning method for XML query optimization  

Science Conference Proceedings (OSTI)

With today's technology it is essential that databases operate efficiently and effectively. Temporal databases are a case in point with reference to data and volume of material. This paper proposes an XML temporal database model, and importantly, an ... Keywords: XML, XMLTable, XPath, XQuery, partitioning, query performance, temporal databases

Majed Abdullah Algarni

2011-12-01T23:59:59.000Z

352

Towards OLAP query reformulation in peer-to-peer data warehousing  

Science Conference Proceedings (OSTI)

Inter-business collaborative contexts prefigure a distributed scenario where companies organize and coordinate themselves to develop common and shared opportunities. Traditional business intelligence systems do not provide support to this end. Peer Data ... Keywords: data warehouse integration, peer-to-peer architecture, query reformulation, schema mapping

Matteo Golfarelli; Federica Mandreoli; Wilma Penzo; Stefano Rizzi; Elisa Turricchia

2010-10-01T23:59:59.000Z

353

Using query-relevant documents pairs for cross-lingual information retrieval  

Science Conference Proceedings (OSTI)

The world wide web is a natural setting for cross-lingual information retrieval. The European Union is a typical example of a multilingual scenario, where multiple users have to deal with information published in at least 20 languages. Given queries ...

David Pinto; Alfons Juan; Paolo Rosso

2007-09-01T23:59:59.000Z

354

Medical image databases content-based queries partitioning on a grid1 Johan Montagnata, Vincent Bretonb, Isabelle Magnina  

E-Print Network (OSTI)

Medical image databases content-based queries partitioning on a grid1 Johan Montagnata, Vincent study the impact of executing a medical image database query application on the grid. For lowering Introduction Medical imaging is data intensive due to the size of medical images. Digital medical images

Paris-Sud XI, Université de

355

Using ECA rules to implement mobile query agents for fast-evolving pure P2P database systems  

Science Conference Proceedings (OSTI)

A challenging issue in fast-evolving pure P2P networks is the design of an appropriate mechanism for processing queries. Since both the data content of the peers as well as their acquaintances, change rapidly the typical P2P querying techniques become ... Keywords: ECA model, P2P systems, mobile agents, mobile databases

Verena Kantere; Aris Tsois

2005-05-01T23:59:59.000Z

356

ETTA-IM: A deep web query interface matching approach based on evidence theory and task assignment  

Science Conference Proceedings (OSTI)

Integrating Deep Web data sources require highly accurate matches between the attributes of the query interfaces. While interface matching has received more attentions recently, current approaches are still not sufficiently perfect: (a) they all suppose ... Keywords: Deep Web, Query interface matching, Schema matching, Web data integration

Yongquan Dong; Qingzhong Li; Yanhui Ding; Zhaohui Peng

2011-08-01T23:59:59.000Z

357

Type systems for dummies  

Science Conference Proceedings (OSTI)

We extend Pure Type Systems with a function turning each term M of type A into a dummy |M| of the same type (|.| is not an identity, in that M ? |M|). Intuitively, a dummy represents an unknown, canonical object of the given type: dummies are opaque ... Keywords: canonical element, proof irrelevance, pure type system

Andrea Asperti; Ferruccio Guidi

2012-01-01T23:59:59.000Z

358

Terms and Conditions  

NLE Websites -- All DOE Office Websites (Extended Search)

Terms and Conditions Terms and Conditions Terms and Conditions As a premier national research and development laboratory, LANL seeks to do business with qualified companies that offer value and high quality products and services. Contact Small Business Office (505) 667-4419 Email Use information below as guideline to doing business An "Appendix SFA-1" contains FAR and DEAR Clauses that are incorporated by reference into a particular subcontract. "Exhibit A General Conditions" are the general terms and conditions applicable to a particular subcontract. Note: The contents of the SFA-1 and Exhibit A (below) are not the only terms and conditions that will be in a LANS subcontract but represent the terms that generally do not change in a particular type of procurement. The

359

Terms and Definitions Index by Type  

Science Conference Proceedings (OSTI)

... CCS; cell probe model; cellular automaton; centroid; certificate; chain; child; ... transition; transition function; transitive; transitive closure; transitive reduction ...

2013-06-26T23:59:59.000Z

360

Semantic Features for Classifying Referring Search Terms  

SciTech Connect

When an internet user clicks on a result in a search engine, a request is submitted to the destination web server that includes a referrer field containing the search terms given by the user. Using this information, website owners can analyze the search terms leading to their websites to better understand their visitors needs. This work explores some of the features that can be used for classification-based analysis of such referring search terms. We present initial results for the example task of classifying HTTP requests countries of origin. A system that can accurately predict the country of origin from query text may be a valuable complement to IP lookup methods which are susceptible to the obfuscation of dereferrers or proxies. We suggest that the addition of semantic features improves classifier performance in this example application. We begin by looking at related work and presenting our approach. After describing initial experiments and results, we discuss paths forward for this work.

May, Chandler J.; Henry, Michael J.; McGrath, Liam R.; Bell, Eric B.; Marshall, Eric J.; Gregory, Michelle L.

2012-05-11T23:59:59.000Z

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


361

Non-Uniform Data Complexity of Query Answering in Description Logics  

E-Print Network (OSTI)

In ontology-based data access (OBDA), ontologies are used as an interface for querying instance data. Since in typical applications the size of the data is much larger than the size of the ontology and query, data complexity is the most important complexity measure. In this paper, we propose a new method for investigating data complexity in OBDA: instead of classifying whole logics according to their complexity, we aim at classifying each individual ontology within a given master language. Our results include a P/coNP-dichotomy theorem for ontologies of depth one in the description logic ALCFI, the equivalence of a P/coNP-dichotomy theorem for ALC/ALCI-ontologies of unrestricted depth to the famous dichotomy conjecture for CSPs by Feder and Vardi, and a non-P/coNP-dichotomy theorem for ALCF-ontologies.

Carsten Lutz; Frank Wolter

2012-01-01T23:59:59.000Z

362

Renewable Energy Terms of Reference: Laws, Policies and Regulations | Open  

Open Energy Info (EERE)

form form View source History View New Pages Recent Changes All Special Pages Semantic Search/Querying Get Involved Help Apps Datasets Community Login | Sign Up Search Page Edit with form History Facebook icon Twitter icon » Renewable Energy Terms of Reference: Laws, Policies and Regulations Jump to: navigation, search Tool Summary LAUNCH TOOL Name: Renewable Energy Terms of Reference: Laws, Policies and Regulations Agency/Company /Organization: World Bank Sector: Energy Focus Area: Renewable Energy Topics: Policies/deployment programs Website: web.worldbank.org/WBSITE/EXTERNAL/TOPICS/EXTENERGY2/EXTRENENERGYTK/0,, References: Renewable Energy Terms of Reference: Laws, Policies and Regulations[1] Resources Sustainable Service Delivery Model Through Distributed Renewable

363

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

SciTech Connect

This paper presents a new parallel indexing data structure for answering queries. The index, called Bin-Hash, offers extremely high levels of concurrency, and is therefore well-suited for the emerging commodity of parallel processors, such as multi-cores, cell processors, and general purpose graphics processing units (GPU). The Bin-Hash approach first bins the base data, and then partitions and separately stores the values in each bin as a perfect spatial hash table. To answer a query, we first determine whether or not a record satisfies the query conditions based on the bin boundaries. For the bins with records that can not be resolved, we examine the spatial hash tables. The procedures for examining the bin numbers and the spatial hash tables offer the maximum possible level of concurrency; all records are able to be evaluated by our procedure independently in parallel. Additionally, our Bin-Hash procedures access much smaller amounts of data than similar parallel methods, such as the projection index. This smaller data footprint is critical for certain parallel processors, like GPUs, where memory resources are limited. To demonstrate the effectiveness of Bin-Hash, we implement it on a GPU using the data-parallel programming language CUDA. The concurrency offered by the Bin-Hash index allows us to fully utilize the GPU's massive parallelism in our work; over 12,000 records can be simultaneously evaluated at any one time. We show that our new query processing method is an order of magnitude faster than current state-of-the-art CPU-based indexing technologies. Additionally, we compare our performance to existing GPU-based projection index strategies.

Bethel, Edward W; Gosink, Luke J.; Wu, Kesheng; Bethel, Edward Wes; Owens, John D.; Joy, Kenneth I.

2008-06-27T23:59:59.000Z

364

Query Tool  

Science Conference Proceedings (OSTI)

... It is based upon Tcl/Tk 8.0 with a tree viewing extension, TkTree 4.2, and builds upon the SP SGML parser/validator software. ...

365

PubMed is a database of biomedical research literature that provides bibliographic information such as MEDLINE, as well as the following  

E-Print Network (OSTI)

the "Search" button executes a search with the entered term. Search summary By default, PubMed displays search into the query box (I). Custom query terms, such as search history numbers, can be manually entered in the query H J K C D A B F I #12;Searching PubMed Typing query terms in the search box, the autocomplete

Levin, Judith G.

366

Type-checking injective pure type systems  

Science Conference Proceedings (OSTI)

Injective pure type systems form a large class of pure type systems for which one can compute by purely syntactic means two sorts elmt(?∣M) and sort(?∣M), where ? is a pseudo-context and M is a pseudo-term, ...

Gilles Barthe

1999-11-01T23:59:59.000Z

367

User's manual for QUERY: a computer program for retrieval of environmental data  

DOE Green Energy (OSTI)

QUERY is a computer program used for the retrieval of environmental data. The code was developed in support of the Imperial Valley Environmental Project of the Environmental Sciences division at Lawrence Livermore Laboratory to handle a multitude of environmentally related information. The program can run in either an interactive mode or production mode to retrieve these data. In either case, the user specifies a set of search constraints and then proceeds to select an output format from a menu of output options or to specify the output format according to his immediate needs. Basic data statistics can be requested. Merging of disparate data bases and subfile extraction are elementary.

Nyholm, R.A.

1979-03-06T23:59:59.000Z

368

Solving Similarity Joins and Range Queries in Metric Spaces with the List of Twin Clusters  

E-Print Network (OSTI)

The metric space model abstracts many proximity or similarity problems, where the most frequently considered primitives are range and k-nearest neighbor search, leaving out the similarity join, an extremely important primitive. In fact, despite the great attention that this primitive has received in traditional and even multidimensional databases, little has been done for general metric databases. We solve two variants of the similarity join problem: (1) range joins: Given two sets of objects and a distance threshold r, find all the object pairs (one from each set) at distance at most r; and (2) k-closest pair joins: Find the k closest object pairs (one from each set). For this sake, we devise a new metric index, coined List of Twin Clusters (LTC), which indexes both sets jointly, instead of the natural approach of indexing one or both sets independently. Finally, we show how to use the LTC in order to solve classical range queries. Our results show significant speedups over the basic quadratic-time naive alternative for both join variants, and that the LTC is competitive with the original list of clusters when solving range queries. Furthermore, we show that our technique has a great potential for improvements.

Rodrigo Paredes; Nora Reyes

2008-01-01T23:59:59.000Z

369

Terms with unbounded demonic and angelic nondeterminacy  

Science Conference Proceedings (OSTI)

We show how to introduce demonic and angelic nondeterminacy into the term language of each type in typical programming or specification language. For each type we introduce (binary infix) operators @? and @? on terms of the type, corresponding to demonic ... Keywords: Angelic nondeterminacy, Demonic nondeterminacy, Free completely distributive lattice, Nondeterminism

Joseph M. Morris; Malcolm Tyrrell

2007-03-01T23:59:59.000Z

370

Counting and generating lambda terms Katarzyna Grygiel  

E-Print Network (OSTI)

Counting and generating lambda terms Katarzyna Grygiel Theoretical Computer Science Department assistants. However, few is known about combinatorial properties of lambda terms, in particular, about many terms of a given size are there? What is a "typical" structure of a simply typed term? Despite

Paris-Sud XI, Université de

371

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

SciTech Connect

The multi-core trend in CPUs and general purpose graphics processing units (GPUs) offers new opportunities for the database community. The increase of cores at exponential rates is likely to affect virtually every server and client in the coming decade, and presents database management systems with a huge, compelling disruption that will radically change how processing is done. This paper presents a new parallel indexing data structure for answering queries that takes full advantage of the increasing thread-level parallelism emerging in multi-core architectures. In our approach, our Data Parallel Bin-based Index Strategy (DP-BIS) first bins the base data, and then partitions and stores the values in each bin as a separate, bin-based data cluster. In answering a query, the procedures for examining the bin numbers and the bin-based data clusters offer the maximum possible level of concurrency; each record is evaluated by a single thread and all threads are processed simultaneously in parallel. We implement and demonstrate the effectiveness of DP-BIS on two multi-core architectures: a multi-core CPU and a GPU. The concurrency afforded by DP-BIS allows us to fully utilize the thread-level parallelism provided by each architecture--for example, our GPU-based DP-BIS implementation simultaneously evaluates over 12,000 records with an equivalent number of concurrently executing threads. In comparing DP-BIS's performance across these architectures, we show that the GPU-based DP-BIS implementation requires significantly less computation time to answer a query than the CPU-based implementation. We also demonstrate in our analysis that DP-BIS provides better overall performance than the commonly utilized CPU and GPU-based projection index. Finally, due to data encoding, we show that DP-BIS accesses significantly smaller amounts of data than index strategies that operate solely on a column's base data; this smaller data footprint is critical for parallel processors that possess limited memory resources (e.g., GPUs).

Gosink, Luke; Wu, Kesheng; Bethel, E. Wes; Owens, John D.; Joy, Kenneth I.

2009-06-02T23:59:59.000Z

372

Web queries with style: Rendering xcerpt programs with css-ng  

E-Print Network (OSTI)

Abstract. Styling and formatting of XML documents for various target media is often specified with the Cascading Style Sheet (CSS) language. An appealing feature of CSS is that it specifies formatting instructions using rather simple guarded rules. A limitation of CSS is that it focuses on static formatting rules. As a consequence scripting languages such as ECMA Script are used in practice for dynamic adaptation of formatting. CSS NG is a novel extension of CSS 3, the newest version of CSS, introducing just a few rules for a dynamic rendering and for markup visualization. This limited extension of CSS 3 turns out to make possible a rather advanced visualization of programs. This article (1) introduces into the extensions of CSS NG with respect to CSS 3, (2) describes a proof-of-concept prototype implementation of CSS NG, and (3) demonstrates CSS NG on Xcerpt query programs. 1

François Bry; Christoph Wieser

2006-01-01T23:59:59.000Z

373

Value-of-Information based Middleware for Autonomic Querying of Distributed Sensor Databases  

SciTech Connect

With particular focus on distributed situational awareness in defense and security applications, we propose a value-of-information based middleware framework as a paradigm shift from crawl-index based centralized search. The proposed approach seeks to improve efficiency in search and retrieval by transforming sensors into programmable information points and enabling ubiquitous data and software flows through the infrastructure of the distributed network. We explain the different components of such a middleware framework to organize, tag and notify emerging spatial, temporal and causal patterns from the sensor measurements. We conclude the paper with a brief discussion on the top-down programming model that can realize the framework as a reconfigurable sensor query system.

Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL

2010-01-01T23:59:59.000Z

374

Glossary Term - Beta Decay  

NLE Websites -- All DOE Office Websites (Extended Search)

Avogadro's Number Avogadro's Number Previous Term (Avogadro's Number) Glossary Main Index Next Term (Beta Particle) Beta Particle Beta Decay Beta decay results in the emission of an electron and antineutrino, or a positron and neutrino. Beta decay is one process that unstable atoms can use to become more stable. There are two types of beta decay, beta-minus and beta-plus. During beta-minus decay, a neutron in an atom's nucleus turns into a proton, an electron and an antineutrino. The electron and antineutrino fly away from the nucleus, which now has one more proton than it started with. Since an atom gains a proton during beta-minus decay, it changes from one element to another. For example, after undergoing beta-minus decay, an atom of carbon (with 6 protons) becomes an atom of nitrogen (with 7 protons).

375

The view-selection problem has an exponential-time lower bound for conjunctive queries and views  

Science Conference Proceedings (OSTI)

The view-selection problem is to design and materialize a set of views over a database schema, such that the choice of views minimizes the cost of evaluating the selected workload of queries, and the combined size of the materialized views does not exceed ...

Rada Chirkova

2002-06-01T23:59:59.000Z

376

Parallel database processing on a 100 Node PC cluster: cases for decision support query processing and data mining  

Science Conference Proceedings (OSTI)

We developed a PC cluster system consists of 100 PCs. Each PC employs the 200MHz Pentium Pro CPU and is connected with others through an ATM switch. We picked up two kinds of data intensive applications. One is decision support query processing. And ...

Takayuki Tamura; Masato Oguchi; Masaru Kitsuregawa

1997-11-01T23:59:59.000Z

377

A comparison of the usability of performing ad hoc querying on dimensionally modeled data versus operationally modeled data  

Science Conference Proceedings (OSTI)

To study the usability of dimensionally modeled data (DMD), we conducted an experiment involving 113 participants to analyze their performance in ad hoc querying tasks. The results show that DMD's usability is high according to both objective and subjective ... Keywords: Business intelligence, Data models, Dimensionally modeled data, Learnability, Usability

DušAn VujošEvi?; Ivana Kova?Evi?; Milija Suknovi?; Nenad Lali?

2012-12-01T23:59:59.000Z

378

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

E-Print Network (OSTI)

Google Hot Queries Federica Giummolè Università Ca' Foscari Venezia, Italy Email: giummole publishes a list of trending topics by monitoring and analyzing tweets from its users. Similarly, Google that social trends fired by Twitter may help explain and predict web trends derived from Google. Indeed, we

Orlando, Salvatore

379

An interoperable, data-structure-neutral component for mesh query and manipulation.  

Science Conference Proceedings (OSTI)

Much of the effort required to create a new simulation code goes into developing infrastructure for mesh data manipulation, adaptive refinement, design optimization, and so forth. This infrastructure is an obvious target for code reuse, except that implementations of these functionalities are typically tied to specific data structures. In this article, we describe a software component---an abstract data model and programming interface---designed to provide low-level mesh query and manipulation support for meshing and solution algorithms. The component's data model provides a data abstraction, completely hiding all details of how mesh data is stored, while its interface defines how applications can interact with that data. Because the component has been carefully designed to be general purpose and efficient, it provides a practical platform for implementing high-level mesh operations independently of the underlying mesh data structures. After describing the data model and interface, we provide several usage examples, each of which has been used successfully with multiple implementations of the interface functionality. The overhead due to accessing mesh data through the interface rather than directly accessing the underlying mesh data is shown to be acceptably small.

Ollivier-Gooch, C.; Diachin, L.; Shephard, M. S.; Tautges, T.; Kraftcheck, J.; Leung, V.; Luo, X.; Miller, M. (Mathematics and Computer Science); (Univ. of British Columbia); (LLNL); (Rensselaer Polytechnic Inst.); (Univ. of Wisconsin); (SNL); (LLNL)

2010-01-01T23:59:59.000Z

380

The clouds of physics and Einstein's last query: Can quantum mechanics be derived from general relativity?  

E-Print Network (OSTI)

Towards the end of the 19th century, Kelvin pronounced as the "clouds of physics" 1) the failure of the Michelson-Morely experiment to detect an ether wind, 2) the violation of the classical mechanical equipartition theorem in statistical thermodynamics. And he believed that the removal of these clouds would bring physics to an end. But as we know, the removal of these clouds led to the two great breakthoughts of modern physics: 1) The theory of relativity, and 2) to quantum mechanics. Towards the end of the 20th century more clouds of physics became apparent. They are 1) the riddle of quantum gravity, 2) the superluminal quantum correlations, 3) the small cosmological constant. Furthermore, there is the riddle of dark energy making up 70% of the physical universe, the non-baryonic cold dark matter making up 26% and the very small initial entropy of the universe. An attempt is made to explain the importance of these clouds for the future of physics. Conjectures for a possible solution are presented. they have to do with Einstein's last query: "Can quantum mechanics be derived general relativity", and with the question is there an ether?

Friedwardt Winterberg

2008-05-20T23:59:59.000Z

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


381

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

E-Print Network (OSTI)

Medical Image Content-Based Queries using the Grid J. Montagnat1, H. Duque12, J.M. Pierson2, V: johan@creatis.insa-lyon.fr phone: +33 492 94 27 20 fax: +33 492 94 28 98 Running title: Medical Image Content-Based Queries Keywords: Medical imaging, grid computing, medical database, content-based query 1

Paris-Sud XI, Université de

382

Short-Term Energy Outlook  

Gasoline and Diesel Fuel Update (EIA)

(83/3Q) (83/3Q) Short-Term Energy Outlook iuarterly Projections August 1983 Energy Information Administration Washington, D.C. 20585 t rt jrt- .ort- iort- iort- iort- nort- lort- '.ort- ort- Tt- .-m .erm -Term -Term -Term -Term -Term -Term -Term -Term -Term -Term -Term -Term Term .-Term -Term xrm Energy Energy Energy Energy Energy Energy Energy Energy Energy Energy Energy Energy Energy Energy Energy Energy Energy Energy Energy Energy Energy ^nergy -OJ.UUK Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Outlook Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term Short-Term

383

Types of quantum information  

E-Print Network (OSTI)

Quantum, in contrast to classical, information theory, allows for different incompatible types (or species) of information which cannot be combined with each other. Distinguishing these incompatible types is useful in understanding the role of the two classical bits in teleportation (or one bit in one-bit teleportation), for discussing decoherence in information-theoretic terms, and for giving a proper definition, in quantum terms, of ``classical information.'' Various examples (some updating earlier work) are given of theorems which relate different incompatible kinds of information, and thus have no counterparts in classical information theory.

Robert B. Griffiths

2007-07-25T23:59:59.000Z

384

Cluster-based query expansion using language modeling for biomedical literature retrieval.  

E-Print Network (OSTI)

??The tremendously huge volume of biomedical literature, scientists' specific information needs, long terms of multiples words, and fundamental problems of synonym and polysemy have been… (more)

Xu, Xuheng

2011-01-01T23:59:59.000Z

385

Flu Terms Defined  

NLE Websites -- All DOE Office Websites (Extended Search)

Flu Terms Defined Flu Terms Defined H1N1 Influenza is a respiratory disease of pigs caused by type A influenza viruses that causes regular outbreaks in pigs. People do not normally get H1N1 flu, but human infections can and do happen. H1N1 flu viruses have been reported to spread from person-to-person, but in the past, this transmission was limited and not sustained beyond three people. Avian flu (AI) is caused by influenza viruses that occur naturally among wild birds. Low pathogenic AI is common in birds and causes few problems. Highly pathogenic H5N1 is deadly to domestic fowl, can be transmitted from birds to humans, and is deadly to humans. There is virtually no human immunity and human vaccine availability is very limited. Pandemic flu is virulent human flu that causes a global outbreak, or pandemic, of serious illness. Because there is little natural immunity, the disease can spread easily from person to person. Currently, there is no pandemic flu.

386

Explain Spires Terms  

NLE Websites -- All DOE Office Websites (Extended Search)

Spires terms Enter term below Example:   index :: Browse Examples Search Help :: About Explain SPIRES TopCites HEP Reviews SPIRES News Playground Preprint listings Resources...

387

Status Company Terminal Term  

NLE Websites -- All DOE Office Websites (Extended Search)

Status of Short-Term Applications to Export Previously Imported LNG (as of March 5, 2013) Status Company Terminal Term (Years) Authorized Volume (Equivalent Bcf in natural gas)...

388

Glossary Term - Tritium  

NLE Websites -- All DOE Office Websites (Extended Search)

Titans Previous Term (Titans) Glossary Main Index Next Term (Uranus) Uranus Tritium Discovered in 1934, tritium is an unstable isotope of the element hydrogen. An atom of tritium...

389

Glossary Term - Pluto  

NLE Websites -- All DOE Office Websites (Extended Search)

Pallas Previous Term (Pallas) Glossary Main Index Next Term (Positron) Positron Pluto A computer enhanced image of Pluto made from Hubble Space Telescope images taken in 1994....

390

Glossary Term - Cloud Chamber  

NLE Websites -- All DOE Office Websites (Extended Search)

Ceres Previous Term (Ceres) Glossary Main Index Next Term (Composition of the Earth's Atmosphere) Composition of the
Earth's Atmosphere Cloud Chamber A cloud chamber showing the...

391

Glossary Term - Beta Particle  

NLE Websites -- All DOE Office Websites (Extended Search)

Decay Previous Term (Beta Decay) Glossary Main Index Next Term (Bohr Radius) Bohr Radius Beta Particle Beta particles are either electrons or positrons ejected from the nucleus....

392

Glossary Term - Alpha Particle  

NLE Websites -- All DOE Office Websites (Extended Search)

Decay Previous Term (Alpha Decay) Glossary Main Index Next Term (Atomic Number) Atomic Number Alpha Particle alphaparticle.gif Produced during alpha decay, an alpha particle is a...

393

Glossary Term - Deuterium  

NLE Websites -- All DOE Office Websites (Extended Search)

Cyclotron Previous Term (Cyclotron) Glossary Main Index Next Term (Deuteron) Deuteron Deuterium Discovered in 1932 by Harold C. Urey, deuterium is a stable isotope of the element...

394

Glossary Term - Pallas  

NLE Websites -- All DOE Office Websites (Extended Search)

Nucleus Previous Term (Nucleus) Glossary Main Index Next Term (Pluto) Pluto Pallas Pallas is an asteroid located between the orbits of Mars and Jupiter. Discovered on March 28,...

395

Glossary Term - Prometheus  

NLE Websites -- All DOE Office Websites (Extended Search)

Positron Previous Term (Positron) Glossary Main Index Next Term (Proton) Proton Prometheus In Greek mythology, Promethus was the son of the Titan Iapetus. He fought with Zeus...

396

Glossary Term - Neutron Emission  

NLE Websites -- All DOE Office Websites (Extended Search)

Neutron Previous Term (Neutron) Glossary Main Index Next Term (Niobe) Niobe Neutron Emission After neutron emission, an atom contains one less neutron. Neutron emission is one...

397

Glossary Term - Atomic Number  

NLE Websites -- All DOE Office Websites (Extended Search)

Particle Previous Term (Alpha Particle) Glossary Main Index Next Term (Avogadro's Number) Avogadro's Number Atomic Number Silver's atomic number is 47 The atomic number is equal to...

398

Glossary Term - Proton Emission  

NLE Websites -- All DOE Office Websites (Extended Search)

Proton Previous Term (Proton) Glossary Main Index Next Term (Quark) Quark Proton Emission After proton emission, an atom contains one less proton. Proton emission is one process...

399

Glossary Term - Cyclotron  

NLE Websites -- All DOE Office Websites (Extended Search)

of the
Earth's Atmosphere Previous Term (Composition of the Earth's Atmosphere) Glossary Main Index Next Term (Deuterium) Deuterium Cyclotron A cyclotron is a device used to...

400

Glossary Term - Proton  

NLE Websites -- All DOE Office Websites (Extended Search)

Prometheus Previous Term (Prometheus) Glossary Main Index Next Term (Proton Emission) Proton Emission Proton A Proton Protons are positively charged particles found within atomic...

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


401

Glossary Term - Alpha Decay  

NLE Websites -- All DOE Office Websites (Extended Search)

Universe Previous Term (10 Most Abundant Elements in the Universe) Glossary Main Index Next Term (Alpha Particle) Alpha Particle Alpha Decay Alpha Decay Diagram Alpha decay is one...

402

Glossary Term - Neutron  

NLE Websites -- All DOE Office Websites (Extended Search)

Neutrino Previous Term (Neutrino) Glossary Main Index Next Term (Neutron Emission) Neutron Emission Neutron A Neutron Neutrons are uncharged particles found within atomic nuclei....

403

Glossary Term - Isotope  

NLE Websites -- All DOE Office Websites (Extended Search)

Helios Previous Term (Helios) Glossary Main Index Next Term (Joule) Joule Isotope The Three Isotopes of Hydrogen - Protium, Deuterium and Tritium Atoms that have the same number of...

404

Glossary Term - Positron  

NLE Websites -- All DOE Office Websites (Extended Search)

Pluto Previous Term (Pluto) Glossary Main Index Next Term (Prometheus) Prometheus Positron A Positron The antimatter counterpart of the electron, positrons were discovered in 1932...

405

Glossary Term - Niobe  

NLE Websites -- All DOE Office Websites (Extended Search)

Neutron Emission Previous Term (Neutron Emission) Glossary Main Index Next Term (Nucleus) Nucleus Niobe In Greek mythology, Niobe was the daughter of Tantalus. She was punished by...

406

Glossary Term - Lepton  

NLE Websites -- All DOE Office Websites (Extended Search)

Joule Previous Term (Joule) Glossary Main Index Next Term (Liquid Nitrogen) Liquid Nitrogen Lepton Leptons are particles with little mass that interact through the electromagnetic...

407

CHEMICAL ENGINEERING Fall Term Spring Term  

E-Print Network (OSTI)

CHEMICAL ENGINEERING CURRICULUM Fall Term Spring Term EGGG 101 Introduction to Engineering (FYE) 2 CHEG 112 Introduction to Chemical Engineering 3 CHEM 111 General Chemistry 3 CHEM 112 General Chemistry and Writing 3 Breadth Requirement Elective 1 3 15 17 CHEG 231 Chemical Engineering Thermodynamics 3 CHEG 325

Lee, Kelvin H.

408

CHEMICAL ENGINEERING Fall Term Spring Term  

E-Print Network (OSTI)

CHEMICAL ENGINEERING CURRICULUM FALL 2010 Fall Term Spring Term EGGG 101 Introduction to Chemical Engineering 3 MATH 242 Analytic Geometry & Calculus B 4 MATH 243 Analytic Geometry & Calculus C 4 Critical Reading and Writing 3 Breadth Requirement Elective 1 3 15 17 CHEG 231 Chemical Engineering

Lee, Kelvin H.

409

Financial and Economic Terms  

E-Print Network (OSTI)

This publication lists and defines many financial and economic terms with which producers should be familiar.

McCorkle, Dean; Klinefelter, Danny A.

2008-12-05T23:59:59.000Z

410

Glossary of Terms  

Science Conference Proceedings (OSTI)

...Glossary of Terms, Surface Engineering, Vol 5, ASM Handbook, ASM International, 1994, p 944â??973...

411

Ramanujan's type series are recorded with in - CECM  

E-Print Network (OSTI)

Ramanujan Type Series. Ramanujan's remarkable series for include. This series adds roughly eight digits per term. Gosper in 1985 computed 17 million terms ...

412

Award Types  

NLE Websites -- All DOE Office Websites (Extended Search)

nuclear deterrent; reduce global threats; and solve other emerging national security and energy challenges. Contact Awards Team (505) 667-7824 Email Types of Awards The Awards...

413

Query and Visualization of extremely large network datasets over the web using Quadtree based KML Regional Network Links  

SciTech Connect

Geographic data sets are often very large in size. Interactive visualization of such data at all scales is not easy because of the limited resolution of the monitors and inability of visualization applications to handle the volume of data. This is especially true for large vector datasets. The end user s experience is frequently unsatisfactory when exploring such data over the web using a naive application. Network bandwidth is another contributing factor to the low performance. In this paper, a Quadtree based technique to visualize extremely large spatial network datasets over the web is described. It involves using custom developed algorithms leveraging a PostGIS database as the data source and Google Earth as the visualization client. This methodology supports both point and range queries along with non-spatial queries. This methodology is demonstrated using a network dataset consisting of several million links. The methodology is based on using some of the powerful features of KML (Keyhole Markup Language). Keyhole Markup Language (KML) is an Open Geospatial Consortium (OGC) standard for displaying geospatial data on Earth browsers. One of the features of KML is the notion of Network Links. Using network links, a wide range of geospatial data sources such as geodatabases, static files and geospatial data services can be simultaneously accessed and visualized seamlessly. Using the network links combined with Level of Detail principle, view based rendering and intelligent server and client-side caching, scalability in visualizing extremely large spatial datasets can be achieved.

Dadi, Upendra [ORNL; Liu, Cheng [ORNL; Vatsavai, Raju [ORNL

2009-01-01T23:59:59.000Z

414

Glossary Term - Dry Ice  

NLE Websites -- All DOE Office Websites (Extended Search)

Deuteron Previous Term (Deuteron) Glossary Main Index Next Term (Electron) Electron Dry Ice A block of dry ice sublimating on a table. Dry ice is the solid form of carbon dioxide...

415

Glossary Term - Avogadro's Number  

NLE Websites -- All DOE Office Websites (Extended Search)

Atomic Number Previous Term (Atomic Number) Glossary Main Index Next Term (Beta Decay) Beta Decay Avogadro's Number Avogadro's number is the number of particles in one mole of a...

416

Glossary Term - Vanadis  

NLE Websites -- All DOE Office Websites (Extended Search)

Van de Graaff Generator Previous Term (Van de Graaff Generator) Glossary Main Index Next Term (10 Most Abundant Compounds in the Earth's Crust) 10 Most Abundant Compounds
in the...

417

Glossary Term - Liquid Nitrogen  

NLE Websites -- All DOE Office Websites (Extended Search)

Lepton Previous Term (Lepton) Glossary Main Index Next Term (Mercury) Mercury Liquid Nitrogen Liquid nitrogen boils in a frying pan on a desk. The liquid state of the element...

418

Glossary Term - Mercury  

NLE Websites -- All DOE Office Websites (Extended Search)

Liquid Nitrogen Previous Term (Liquid Nitrogen) Glossary Main Index Next Term (Mole) Mole Mercury Mercury as seen by the Mariner 10 spacecraft on March 24, 1974. Mercury is the...

419

Glossary Term - Mole  

NLE Websites -- All DOE Office Websites (Extended Search)

Mercury Previous Term (Mercury) Glossary Main Index Next Term (Neptune) Neptune Mole A mole of a substance is the mass, in grams, that is numerically equal to that substance's...

420

Glossary Term - Helios  

NLE Websites -- All DOE Office Websites (Extended Search)

Half-life Previous Term (Half-life) Glossary Main Index Next Term (Isotope) Isotope Helios The sun seen in Hydrogen-alpha light. In Greek mythology, Helios was god of the sun....

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


421

Glossary Term - Nucleus  

NLE Websites -- All DOE Office Websites (Extended Search)

Niobe Previous Term (Niobe) Glossary Main Index Next Term (Pallas) Pallas Nucleus The nucleus of a nitrogen-14 atom. Discovered by Ernest Rutherford in 1911, the nucleus is the...

422

Glossary Term - Deuteron  

NLE Websites -- All DOE Office Websites (Extended Search)

Deuterium Previous Term (Deuterium) Glossary Main Index Next Term (Dry Ice) Dry Ice Deuteron A Deuteron The nucleus of a deuterium atom. A deuteron consists of one proton and one...

423

Glossary Term - Joule  

NLE Websites -- All DOE Office Websites (Extended Search)

Isotope Previous Term (Isotope) Glossary Main Index Next Term (Lepton) Lepton Joule A joule is the amount of work done when a force of one Newton is applied through a distance of...

424

Glossary Term - Catalyst  

NLE Websites -- All DOE Office Websites (Extended Search)

Bohr Radius Previous Term (Bohr Radius) Glossary Main Index Next Term (Ceres) Ceres Catalyst A catalyst is a substance that increases the speed of a chemical reaction without being...

425

Glossary Term - Thor  

NLE Websites -- All DOE Office Websites (Extended Search)

Tantalus Previous Term (Tantalus) Glossary Main Index Next Term (Titans) Titans Thor In Norse mythology, Thor is the god of thunder and the son of Odin and Earth. Thor possesses a...

426

Glossary Term - Titans  

NLE Websites -- All DOE Office Websites (Extended Search)

Thor Previous Term (Thor) Glossary Main Index Next Term (Tritium) Tritium Titans In Greek mythology, the Titans are the offspring of Earth and Sky and ruled before being overthrown...

427

Glossary Term - Gluon  

NLE Websites -- All DOE Office Websites (Extended Search)

Volt (eV) Previous Term (Electron Volt (eV)) Glossary Main Index Next Term (Half-life) Half-life Gluon Gluons are the particles responsible for binding quarks to each other....

428

Melanin Types  

NLE Websites -- All DOE Office Websites (Extended Search)

Melanin Types Melanin Types Name: Irfan Location: N/A Country: N/A Date: N/A Question: What are different types of melanins? And what are the functions of these types? Replies: Hi Irfan! Melanin is a dark compound or better a photoprotective pigment. Its major role in the skin is to absorb the ultraviolet (UV) light that comes from the sun so the skin is not damaged. Sun exposure usually produces a tan at the skin that represents an increase of melanin pigment in the skin. Melanin is important also in other areas of the body, as the eye and the brain., but it is not completely understood what the melanin pigment does in these areas. Melanin forms a special cell called melanocyte. This cell is found in the skin, in the hair follicle, and in the iris and retina of the eye.

429

Type systems  

Science Conference Proceedings (OSTI)

The study of type systems has emerged as one of the most active areas of research in programming languages, with applications in software engineering, language design, high-performance compiler implementation, and security. This chapter discusses the ...

Benjamin C. Pierce

2003-01-01T23:59:59.000Z

430

jQuery v1.7.2 jquery.com | jquery.org/license  

Science Conference Proceedings (OSTI)

(function(a,b){function cy(a){return f.isWindow(a)?a:a.nodeType===9?a. defaultView||a.parentWindow:!1}function cu(a){if(!cj[a]){var b=c.body,d=f ...

2013-05-30T23:59:59.000Z

431

Improving MPI communication via data type fission  

Science Conference Proceedings (OSTI)

Message Passing Interface (MPI) messages are centered around transmitting instances of MPI data types. The data types represented in MPI terms are usually modeled after data types native to the application. If a user does not want to transmit a field ... Keywords: MPI, communication, data type fission, static transformation

Ben Perry; Martin Swany

2010-06-01T23:59:59.000Z

432

Property:Incentive/Terms | Open Energy Information  

Open Energy Info (EERE)

Terms Terms Jump to: navigation, search Property Name Incentive/Terms Property Type Text Description Terms. Pages using the property "Incentive/Terms" Showing 25 pages using this property. (previous 25) (next 25) A AEP Ohio - Renewable Energy Credit (REC) Purchase Program (Ohio) + RECs must be registered in the PJM-GATS Customer must have an interconnection agreement with AEP Ohio. APS - Solutions for Business Financing (Arizona) + 3.99% or higher (see website for details)Available for retrofit projects only through the comprehensive Solutions for Business program. Projects must qualify for a rebate under the Solutions for Business program. Work must be performed by Solutions for Business Trade Ally. Adams Electric Cooperative - Energy Efficiency Loan Program (Pennsylvania) + Rate: 4.5%-5% Repayment Terms: up to 7 years

433

Long-Term Surveillance  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Long-Term Surveillance Long-Term Surveillance Operations and Maintenance Fiscal Year 2013 Year-End Summary Report September 2013 LMS/ESL/S10692 ESL-RPT-2013-03 This page intentionally left blank LMS/ESL/S10692 ESL-RPT-2013-03 Long-Term Surveillance Operations and Maintenance Fiscal Year 2013 Year-End Summary Report September 2013 This page intentionally left blank U.S. Department of Energy Long-Term Surveillance Operations and Maintenance FY 2013 Year-End Summary Report September 2013 Doc. No. S10692 Page i Contents Abbreviations .................................................................................................................................. ii 1.0 Introduction ............................................................................................................................1

434

Pennsylvania Source Term Tracking System  

SciTech Connect

The Pennsylvania Source Term Tracking System tabulates surveys received from radioactive waste generators in the Commonwealth of radioactive waste is collected each quarter from generators using the Low-Level Radioactive Waste Management Quarterly Report Form (hereafter called the survey) and then entered into the tracking system data base. This personal computer-based tracking system can generate 12 types of tracking reports. The first four sections of this reference manual supply complete instructions for installing and setting up the tracking system on a PC. Section 5 presents instructions for entering quarterly survey data, and Section 6 discusses generating reports. The appendix includes samples of each report.

1992-08-01T23:59:59.000Z

435

IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 9, NO. 4, AUGUST 2001 427 The Performance of Query Control Schemes for the  

E-Print Network (OSTI)

IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 9, NO. 4, AUGUST 2001 427 The Performance of Query received June 3, 1999; revised February 1, 2000; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor C. This is in contradiction with the fact that all updates in the wireless com- munication environment travel over the air

Haas, Zygmunt J.

436

Irregular term courses (These do not roll to future terms) Irregular term courses are allowed only in fall and spring terms. Irregular term courses  

E-Print Network (OSTI)

Irregular term courses (These do not roll to future terms) · Irregular term courses are allowed only in fall and spring terms. Irregular term courses in spring term cannot roll into summer term(s), no exceptions. · A course ending one day or more beyond the last final exam day for the fall term is considered

Bolding, M. Chad

437

Library Terms That Users Understand  

E-Print Network (OSTI)

data resources about Library Terms That Users Understand ©terminology is a major factor. Terms most often cited asHumanities    or Social Sciences Terms most often cited as

Kupersmith, John

2012-01-01T23:59:59.000Z

438

Cornman's definition of observation terms  

Science Conference Proceedings (OSTI)

reconcile what is described in mentalistic terms with materialism. ... It is clearly important that the observation terms should not include terms which are ...

439

Terms and Conditions  

NLE Websites -- All DOE Office Websites (Extended Search)

Terms and Conditions Terms and Conditions R&D Overview 100G Testbed Testbed Description Testbed Results Current Testbed Research Proposal Process Terms and Conditions Virtual Circuits (OSCARS) Performance (perfSONAR) Tools Development Green Networking Authentication & Trust Federation (ATF) Partnerships Contact Us Technical Assistance: 1 800-33-ESnet (Inside the US) 1 800-333-7638 (Inside the US) 1 510-486-7600 (Globally) 1 510-486-7607 (Globally) Report Network Problems: trouble@es.net Provide Web Site Feedback: info@es.net Terms and Conditions Researchers must provide ESnet copies of any articles, presentations, and publications based on testbed research for posting on the ESnet Testbed web site. All publications based on work conducted on the testbed must include the following statement:

440

Type: Renewal  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

1 INCITE Awards 1 INCITE Awards Type: Renewal Title: -Ab Initio Dynamical Simulations for the Prediction of Bulk Properties‖ Principal Investigator: Theresa Windus, Iowa State University Co-Investigators: Brett Bode, Iowa State University Graham Fletcher, Argonne National Laboratory Mark Gordon, Iowa State University Monica Lamm, Iowa State University Michael Schmidt, Iowa State University Scientific Discipline: Chemistry: Physical INCITE Allocation: 10,000,000 processor hours Site: Argonne National Laboratory Machine (Allocation): IBM Blue Gene/P (10,000,000 processor hours) Research Summary: This project uses high-quality electronic structure theory, statistical mechanical methods, and

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


441

Tradeo s in the Intensional Representation of Lambda Terms  

E-Print Network (OSTI)

Tradeo#11;s in the Intensional Representation of Lambda Terms Chuck Liang 1 and Gopalan Nadathur 2 depend on the implementation of an intensional view of the terms of suitable typed lambda calculi. Re#12: the de Bruijn representation of bound variables, the explicit encoding of substitutions in terms

Nadathur, Gopalan

442

Interactive Analysis of Large Network Data Collections UsingQuery-Driven Visualization  

Science Conference Proceedings (OSTI)

Realizing operational analytics solutions where large and complex data must be analyzed in a time-critical fashion entails integrating many different types of technology. Considering the extreme scale of contemporary datasets, one significant challenge is to reduce the duty cycle in the analytics discourse process. This paper focuses on an interdisciplinary combination of scientific data management and visualization/analysis technologies targeted at reducing the duty cyclein hypothesis testing and knowledge discovery. We present an application of such a combination in the problem domain of network traffic data analysis. Our performance experiment results, including both serial and parallel scalability tests, show that the combination can dramatically decrease the analytics duty cycle for this particular application. The combination is effectively applied to the analysis of network traffic data to detect slow and distributed scans, which is a difficult-to-detect form of cyber attack. Our approach is sufficiently general to be applied to a diverse set of data understanding problems as well as used in conjunction with a diverse set of analysis and visualization tools.

Bethel, E. Wes; Campbell, Scott; Dart, Eli; Lee, Jason; Smith,Steven A.; Stockinger, Kurt; Tierney, Brian; Wu, Kesheng

2005-12-01T23:59:59.000Z

443

Facility Type!  

Office of Legacy Management (LM)

ITY: ITY: --&L~ ----------- srct-r~ -----------~------~------- if yee, date contacted ------------- cl Facility Type! i I 0 Theoretical Studies Cl Sample 84 Analysis ] Production 1 Diepasal/Storage 'YPE OF CONTRACT .--------------- 1 Prime J Subcontract&- 1 Purchase Order rl i '1 ! Other information (i.e., ---------~---~--~-------- :ontrait/Pirchaee Order # , I C -qXlJ- --~-------~~-------~~~~~~ I I ~~~---~~~~~~~T~~~ FONTRACTING PERIODi IWNERSHIP: ,I 1 AECIMED AECMED GOVT GOUT &NTtiAC+OR GUN-I OWNED ----- LEEE!? M!s LE!Ps2 -LdJG?- ---L .ANDS ILJILDINGS X2UIPilENT IRE OR RAW HA-I-L :INAL PRODUCT IASTE Z. RESIDUE I I kility l pt I ,-- 7- ,+- &!d,, ' IN&"E~:EW AT SITE -' ---------------- , . Control 0 AEC/tlED managed operations

444

Property:Study Type | Open Energy Information  

Open Energy Info (EERE)

Type Type Jump to: navigation, search This is a property of type Page. Pages using the property "Study Type" Showing 22 pages using this property. D Distributed Generation Study/10 West 66th Street Corp + Long-term Monitoring + Distributed Generation Study/615 kW Waukesha Packaged System + Laboratory Test + Distributed Generation Study/Aisin Seiki G60 at Hooligans Bar and Grille + Field Test + Distributed Generation Study/Arrow Linen + Long-term Monitoring + Distributed Generation Study/Dakota Station (Minnegasco) + Case Study + Distributed Generation Study/Elgin Community College + Case Study + Distributed Generation Study/Emerling Farm + Long-term Monitoring + Distributed Generation Study/Floyd Bennett + Long-term Monitoring + Distributed Generation Study/Harbec Plastics + Long-term Monitoring +

445

Dictionary of petroleum terms  

Science Conference Proceedings (OSTI)

Terms included in the dictionary come from writers and contributors of the Petroleum Extension Service of Texas (PETEC), which constantly revises and updates the material to keep it current. Over 170 pages of petroleum-related words include those involving exploration, production, processing, transport, marketing, and use. Lists of abbreviations, units, and metric equivalents and prefixes follow the dictionary.

Leecraft, J. (ed.)

1983-01-01T23:59:59.000Z

446

TRW JAPANESE FAST DATA FINDER Matt Mettler  

E-Print Network (OSTI)

boolean search. The user is provided with an expandable boolean form in which to enter query terms. Kana to contain docu- ments in multiple languages. Query terms entered in Japa- nese could match against terms are entered by selecting the appropriate entry mode and typing Romaji. Kanji terms are entered

447

Types of Lighting in Commercial Buildings - Lighting Types  

U.S. Energy Information Administration (EIA) Indexed Site

Lighting Types Lighting Types The following are the most widely used types of lighting equipment used in commercial buildings. Characteristics such as energy efficiency, light quality, and lifetime vary by lamp type. Standard Fluorescent A fluorescent lamp consists of a sealed gas-filled tube. The gas in the tube consists of a mixture of low pressure mercury vapor and an inert gas such as argon. The inner surface of the tube has a coating of phosphor powder. When an electrical current is applied to electrodes in the tube, the mercury vapor emits ultraviolet radiation which then causes the phosphor coating to emit visible light (the process is termed fluorescence). A ballast is required to regulate and control the current and voltage. Two types of ballasts are used, magnetic and electronic. Electronic ballasts

448

Attachment J TERMS AND CONDITIONS  

E-Print Network (OSTI)

Attachment J TERMS AND CONDITIONS AWARD # PON-10-603 #12;TERMS AND CONDITIONS TABLE OF CONTENTS ............................................................................... 24 i #12;TERMS AND CONDITIONS 1. Grant Agreement This project is being funded with a grant from is comprised of the grant funding award, the Terms and Conditions, and all attachments. These Terms

449

Attachment K TERMS AND CONDITIONS  

E-Print Network (OSTI)

Attachment K TERMS AND CONDITIONS AWARD # #12;TERMS AND CONDITIONS TABLE OF CONTENTS SECTION PAGE ............................................................................... 24 i #12;TERMS AND CONDITIONS 1. Grant Agreement This project is being funded with a grant from, the Terms and Conditions, and all attachments. These Terms and Conditions are standard requirements

450

Number: 1894 Type: factoid ...  

Science Conference Proceedings (OSTI)

... type> Type: factoid Description: How high is the pitcher's mound? ... 2047 Type: factoid Description: How close is Mercury to ...

2003-08-04T23:59:59.000Z

451

ShortShort--Term Energy Outlook Term Energy Outlook  

U.S. Energy Information Administration (EIA)

U.S. Energy Information Administration Independent Statistics & Analysis ShortShort--Term Energy Outlook Term Energy Outlook Chart Gallery for Chart Gallery for ...

452

Mosaic neurofibromatosis type 1  

E-Print Network (OSTI)

with neurofibromatosis type 1 (NF1) with microdeletionsM, Huson S. Mosaic (segmental) neurofibromatosis type 1and type 2: no longer neurofibromatosis type 5. Am J Med

Liang, Christine; Schaffer, Julie V

2008-01-01T23:59:59.000Z

453

Glossary Term - Neptune  

NLE Websites -- All DOE Office Websites (Extended Search)

Mole Mole Previous Term (Mole) Glossary Main Index Next Term (Neutrino) Neutrino Neptune Neptune as seen by the Voyager II spacecraft on August 14, 1989. Neptune is the eighth planet from the sun and takes 165 years to orbit the sun once. Neptune is about 4 times larger than the Earth and is about 17 times as massive. Neptune was discovered on September 23, 1846 based on calculations done by the French astronomer Urbain LeVerrier and the English astronomer John Adams. Neptune is also the Roman name for Poseidon, the god of the sea and earthquakes. Neptune was the son of Chronus and Rhea and carries the trident, a three pronged spear. Planetary Data Distance from Sun Length of Day Length of Year Radius Mass 30.069 AU 16.1 hours 164.79 years 24,764 km 1.02*1026 kg Known Satellites

454

Glossary Term - Electron Capture  

NLE Websites -- All DOE Office Websites (Extended Search)

Electron Electron Previous Term (Electron) Glossary Main Index Next Term (Electron Volt (eV)) Electron Volt (eV) Electron Capture After electron capture, an atom contains one less proton and one more neutron. Electron capture is one process that unstable atoms can use to become more stable. During electron capture, an electron in an atom's inner shell is drawn into the nucleus where it combines with a proton, forming a neutron and a neutrino. The neutrino is ejected from the atom's nucleus. Since an atom loses a proton during electron capture, it changes from one element to another. For example, after undergoing electron capture, an atom of carbon (with 6 protons) becomes an atom of boron (with 5 protons). Although the numbers of protons and neutrons in an atom's nucleus change

455

Glossary Term - Ceres  

NLE Websites -- All DOE Office Websites (Extended Search)

Catalyst Catalyst Previous Term (Catalyst) Glossary Main Index Next Term (Cloud Chamber) Cloud Chamber Ceres Ceres is an asteroid located between the orbits of Mars and Jupiter. Discovered on January 1, 1801 by Giuseppi Piazzi, Ceres was the first asteroid ever discovered. With a diameter of 1025 kilometers (637 miles), Ceres is also the largest known asteroid. Ceres is also the Roman name for the Greek goddess Demeter, the elder sister of Zeus and daughter of Cronus and Rhea. Demeter was the goddess of grain and helped the crops grow. One day her daughter, Persephone, was abducted by Hades. While Demeter searched for her missing daughter, no crops grew and people starved. Persephone was eventually found, but Hades refused to let her leave the underworld. As a compromise, Persephone is

456

Long Term Innovative Technologies  

NLE Websites -- All DOE Office Websites (Extended Search)

DOE's Hydrogen and DOE's Hydrogen and Fuel Cell Technologies, Fuel Cell Presolicitation Workshop Bryan Pivovar With Input/Feedback from Rod Borup (LANL), Debbie Myers (ANL), DOE and others as noted in presentation Lakewood, CO March 16, 2010 Long Term Innovative Technologies National Renewable Energy Laboratory Innovation for Our Energy Future Innovative/Long Term and RELEVANT Mission of DOE Mission of EERE (Applied Program) Mission of HFCT To enable the widespread commercialization of hydrogen and fuel cells in diverse sectors of the economy-with emphasis on applications that will most effectively strengthen the nation's energy security and improve our stewardship of the environment-through research, development, and demonstration of critical improvements in the technologies, and through diverse activities to overcome

457

Glossary Term - Uranus  

NLE Websites -- All DOE Office Websites (Extended Search)

Tritium Tritium Previous Term (Tritium) Glossary Main Index Next Term (Van de Graaff Generator) Van de Graaff Generator Uranus Uranus as seen by the Voyager II spacecraft. Uranus is the seventh planet from the sun and takes 84 years to orbit the sun once. Uranus is about 4 times larger than the Earth and is about 14.5 times as massive. Uranus was discovered on March 13, 1781 by William Herschel. In greek mythology, Uranus was Father Sky. Planetary Data Distance from Sun Length of Day Length of Year Radius Mass 19.191 AU 17.2 hours 84.01 years 25,559 km 8.68*1025 kg Known Satellites Name Distance from Uranus Rotational Period Orbital Period Radius Cordelia 49,770 km -unknown- 0.335034 days 21 km Ophelia 53,790 km -unknown- 0.376400 days 23 km Bianca 59,170 km -unknown- 0.434579 days 27 km

458

Crop Insurance Terms and Definitions  

E-Print Network (OSTI)

This publication is a glossary of terms used by the crop insurance industry. There are definitions for terms used in crop insurance documents and for terms pertaining to coverage levels, farming, reports, units and parties to contracts.

Stokes, Kenneth; Waller, Mark L.; Outlaw, Joe; Barnaby, G. A. Art

2008-10-17T23:59:59.000Z

459

Glossary of nuclear criticality terms  

SciTech Connect

This is a glossary of terms generally encountered in the literature of nuclear criticality and criticality safety. Terms sometimes misused are emphasized. 7 refs.

Paxton, H.C.

1989-10-01T23:59:59.000Z

460

Short-Term Energy Outlook  

U.S. Energy Information Administration (EIA) Indexed Site

U.S. Energy Information Administration Independent Statistics & Analysis Short Short- -Term Energy Outlook Term Energy Outlook Chart Gallery for Chart Gallery for November...

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


461

DRAFT Glossary of AFIS Terms  

Science Conference Proceedings (OSTI)

Page 1. DRAFT Glossary of AFIS Terms Latent Print AFIS Interoperability Working Group Page 2. DRAFT Glossary of AFIS Terms 2 ...

2012-05-04T23:59:59.000Z

462

Reports and Queries  

NLE Websites -- All DOE Office Websites (Extended Search)

Acquisition Database: containing information on DOE's performance in establishing Environmental Management Systems and meeting pollution prevention goals. 2004 Annual Progress...

463

Observed Long-Term Trends for Agroclimatic Conditions in Canada  

Science Conference Proceedings (OSTI)

A set of agroclimatic indices representing Canadian climatic conditions for field crop production are analyzed for long-term trends during 1895–2007. The indices are categorized for three crop types: cool season, warm season, and overwintering. ...

Budong Qian; Xuebin Zhang; Kai Chen; Yang Feng; Ted O’Brien

2010-04-01T23:59:59.000Z

464

Type checking and normalisation.  

E-Print Network (OSTI)

??This thesis is about Martin-Löf's intuitionistic theory of types (type theory). Type theory is at the same time a formal system for mathematical proof and… (more)

Chapman, James Maitland

2009-01-01T23:59:59.000Z

465

Hybrid type checking  

E-Print Network (OSTI)

Phase distinctions in type theory. Manuscript, 1988. [10]Typechecking dependent types and subtypes. In Lecture notesF. Pfenning. Intersection types and computational effects.

Flanagan, C

2006-01-01T23:59:59.000Z

466

Type 2 segmental glomangiomas  

E-Print Network (OSTI)

skin disorders: different types of severitiy reflectevidence for dichotomous types of severitiy. Arch Dermatol9. Happle R, König A. Type 2 segmental manifestation of

Hoekzema, Rick; Zonneveld, Ingrid M; Wal, Allard C van der

2010-01-01T23:59:59.000Z

467

Writing with Complex Type  

E-Print Network (OSTI)

29] Middendorp, J. 2004. Dutch type. 010 Publishers. [30]A. Hyland. 1992. Twentieth-century type. Laurence King. [7]Robertson. 2005. From Movable Type to Moving Type-Evolution

Lewis, Jason; Nadeau, Bruno

2009-01-01T23:59:59.000Z

468

Glossary of Terms  

E-Print Network (OSTI)

Fiscal Year – The Council operates on a federal fiscal year (FFY) that begins on October 1 and ends on September 30. Focus Area – The Council has selected five areas on which to focus the remaining funds, four of which are addressed in this Invitation: herring, long-term monitoring of marine conditions and injured resources, harbor protection and marine restoration and lingering oil. Plan – is a multi-year program request for funding that includes all administrative and costs to run each program area. Preferred Proposer – after reviewing proposals submitted under this Invitation, the Council will identify a Preferred Proposer for each focus area and direct Council staff to work with each Preferred Proposer to revise the subject proposals to satisfy any scientific, technical or programmatic concerns. This identification is not a commitment to fund. Program – is a 20-year plan for spending the funds for each program area. Program Science Panel – a panel of scientific experts to review potential projects and give guidance and oversight on the direction of the program; is not required to be independent from the program.

unknown authors

2010-01-01T23:59:59.000Z

469

abstract data type  

Science Conference Proceedings (OSTI)

Definition of abstract data type, possibly with links to more information and implementations. NIST. abstract data type. (definition). ...

2013-11-08T23:59:59.000Z

470

Short-Term Energy Outlook  

U.S. Energy Information Administration (EIA)

U.S. Energy Information Administration | Short-Term Energy Outlook July 2013 1 July 2013 Short-Term Energy Outlook (STEO) Highlights The U.S. Energy Information ...

471

Zambia-Long-Term Generation Expansion Study | Open Energy Information  

Open Energy Info (EERE)

Zambia-Long-Term Generation Expansion Study Zambia-Long-Term Generation Expansion Study Jump to: navigation, search Logo: Zambia-Long-Term Generation Expansion Study Name Zambia-Long-Term Generation Expansion Study Agency/Company /Organization Argonne National Laboratory Sector Energy Topics Implementation, GHG inventory, Background analysis Resource Type Software/modeling tools, Lessons learned/best practices Website http://www.dis.anl.gov/pubs/61 Country Zambia UN Region Eastern Africa References Zambia-Long-Term Generation Expansion Study[1] Abstract The objective of this study is to analyze possible long-term development options of the Zambian electric power system in the period up to 2015. Overview "The objective of this study is to analyze possible long-term development options of the Zambian electric power system in the period up to 2015. The

472

Glossary of Terms in TDE  

Science Conference Proceedings (OSTI)

Glossary of Terms used in ThermoData Engine (TDE): Alternative Equations (Navigation Tree item): For most properties ...

2012-10-19T23:59:59.000Z

473

ATTACHMENT E TERMS AND CONDITIONS  

E-Print Network (OSTI)

ATTACHMENT E TERMS AND CONDITIONS TABLE OF CONTENTS SECTION PAGE NO. 1. Vehicle Buy-Down Incentive Program Agreement................................................ 1 2. Term of the Agreement..................................................................................................... 14 #12;TERMS AND CONDITIONS 1. Vehicle Buy-Down Incentive Program Agreement The Vehicle Buy

474

Long-term testing  

SciTech Connect

Land-based gas turbines are significantly different from automotive gas turbines in that they are designed to operate for 50,000 h or greater (compared to 5,000--10,000 h). The primary goal of this research is to determine the long-term survivability of ceramic materials for industrial gas turbine applications. Research activities in this program focus on the evaluation of the static tensile creep and stress rupture (SR) behavior of three commercially available structural ceramics which have been identified by the gas turbine manufacturers as leading candidates for use in industrial gas turbines. For each material investigated, a minimum of three temperatures and four stresses will be used to establish the stress and temperature sensitivities of the creep and SR behavior. Because existing data for many candidate structural ceramics are limited to testing times less than 2,000 h, this program will focus on extending these data to times on the order of 10,000 h, which represents the lower limit of operating time anticipated for ceramic blades and vanes in gas turbine engines. A secondary goal of the program will be to investigate the possibility of enhancing life prediction estimates by combining interrupted tensile SR tests and tensile dynamic fatigue tests in which tensile strength is measured as a function of stressing rate. The third goal of this program will be to investigate the effects of water vapor upon the SR behavior of the three structural ceramics chosen for the static tensile studies by measuring the flexural strength as a function of stressing rate at three temperatures.

Ferber, M.; Graves, G.A. Jr.

1994-12-31T23:59:59.000Z

475

Type C: Caldera Resource | Open Energy Information  

Open Energy Info (EERE)

C: Caldera Resource C: Caldera Resource Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Print PDF Type C: Caldera Resource Dictionary.png Type C: Caldera Resource: No definition has been provided for this term. Add a Definition Brophy Occurrence Models This classification scheme was developed by Brophy, as reported in Updating the Classification of Geothermal Resources. Type A: Magma-heated, Dry Steam Resource Type B: Andesitic Volcanic Resource Type C: Caldera Resource Type D: Sedimentary-hosted, Volcanic-related Resource Type E: Extensional Tectonic, Fault-Controlled Resource Type F: Oceanic-ridge, Basaltic Resource Caldera resources may be found in many tectonic settings but are defined by their caldera structures which control the flow of the fluids in the system.

476

Types of Costs Types of Cost Estimates  

E-Print Network (OSTI)

05-1 · Types of Costs · Types of Cost Estimates · Methods to estimate capital costs MIN E 408) costs apply to those items that are consumed in production process and are roughly proportional to level in cash flow analysis and in the decision to use the equipment for reclamation? Types of Costs #12

Boisvert, Jeff

477

Types of Costs Types of Cost Estimates  

E-Print Network (OSTI)

· Types of Costs · Types of Cost Estimates · Methods to estimate capital costs MIN E 408: Mining the equipment for reclamation? Types of Costs #12;· Marginal Cost: ­ Change in total cost ­ Any production process involves fixed and variable costs. As production increases/expands, fixed costs are unchanged, so

Boisvert, Jeff

478

Renewable Energy Institutional Arrangements for Implementation Terms of  

Open Energy Info (EERE)

Renewable Energy Institutional Arrangements for Implementation Terms of Renewable Energy Institutional Arrangements for Implementation Terms of Reference Jump to: navigation, search Tool Summary LAUNCH TOOL Name: Renewable Energy Institutional Arrangements for Implementation Terms of Reference Agency/Company /Organization: World Bank Sector: Energy Focus Area: Solar Topics: Implementation, Market analysis Resource Type: Guide/manual Website: web.worldbank.org/WBSITE/EXTERNAL/TOPICS/EXTENERGY2/EXTRENENERGYTK/0,, References: Renewable Energy Institutional Arrangements for Implementation Terms of Reference[1] Resources Solar Home Systems Business Planning Advisory Services Preparation, Administration, Monitoring and Evaluation of the Solar Battery Charging Stations Subproject Off-Grid Rural Electrification Project Advisor PV Market Study

479

Long-Term Stewardship Study  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Office of Long Term Stewardship Office of Long Term Stewardship LONG-TERM STEWARDSHIP STUDY Volume I - Report Prepared to comply with the terms of a settlement agreement: Natural Resources Defense Council, et al. v. Richardson, et al., Civ. No. 97-936 (SS) (D.D.C. Dec. 12, 1998). Final Study October 2001 - i - Foreword The Department of Energy (DOE) has prepared this Long-term Stewardship Study ("Study" or "Final Study") to comply with the terms of a settlement agreement between DOE, the Natural Resources Defense Council, and 38 other plaintiffs [Natural Resources Defense Council, et al. v. Richardson, et al., Civ. No. 97-936 (SS) (D.D.C. Dec. 12, 1998)]. The Study describes and analyzes several issues and a variety of information associated with long-term stewardship. The Study

480

Identify types of development and climate impacts that are country  

Open Energy Info (EERE)

source source History View New Pages Recent Changes All Special Pages Semantic Search/Querying Get Involved Help Apps Datasets Community Login | Sign Up Search Page Edit History Facebook icon Twitter icon » Identify types of development and climate impacts that are country priorities Jump to: navigation, search Stage 3 LEDS Home Introduction to Framework Assess current country plans, policies, practices, and capacities Develop_BAU Stage 4: Prioritizing and Planning for Actions Begin execution of implementation plans 1.0. Organizing the LEDS Process 1.1. Institutional Structure for LEDS 1.2. Workplan to Develop the LEDS 1.3. Roles and responsibilities to develop LEDS 2.1. Assess current country plans, policies, practices, and capacities 2.2. Compile lessons learned and good practices from ongoing and

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


481

Term Appointments | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Term Appointments Term Appointments Term Appointments A term appointment is a non-permanent time limited appointment for a period of more than 1 year but not more than 4 years. The appointment allows eiligibility for benefits and retirement coverage. Reasons for making a term appointment include but are not limited to: project work, extraordinary workload, scheduled abolishment, reorganization, uncertainty of future funding, or the need to maintain permanent positions for placement of employees who would otherwise be displaced from other parts of the organization. OPM may authorize exceptions beyond the 4-year limit when the extension is appropriately justifiable. For example, if the deadline of a major project is extended and the employee's term appointment is at the end of its time

482

ARM - Measurement - Cloud type  

NLE Websites -- All DOE Office Websites (Extended Search)

type ARM Data Discovery Browse Data Comments? We would love to hear from you Send us a note below or call us at 1-888-ARM-DATA. Send Measurement : Cloud type Cloud type such as...

483

RENEWABLE ENERGY Medium-Term  

E-Print Network (OSTI)

Please note that this PDF is subject to specific restrictions that limit its use and distribution. The terms and conditions are available online at

unknown authors

2012-01-01T23:59:59.000Z

484

Lovelock Terms and BRST Cohomology  

E-Print Network (OSTI)

Lovelock terms are polynomial scalar densities in the Riemann curvature tensor that have the remarkable property that their Euler-Lagrange derivatives contain derivatives of the metric of order not higher than two (while generic polynomial scalar densities lead to Euler-Lagrange derivatives with derivatives of the metric of order four). A characteristic feature of Lovelock terms is that their first nonvanishing term in the expansion of the metric around flat space is a total derivative. In this paper, we investigate generalized Lovelock terms defined as polynomial scalar densities in the Riemann curvature tensor and its covariant derivatives (of arbitrarily high but finite order) such that their first nonvanishing term in the expansion of the metric around flat space is a total derivative. This is done by reformulating the problem as a BRST cohomological one and by using cohomological tools. We determine all the generalized Lovelock terms. We find, in fact, that the class of nontrivial generalized Lovelock terms contains only the usual ones. Allowing covariant derivatives of the Riemann tensor does not lead to new structure. Our work provides a novel algebraic understanding of the Lovelock terms in the context of BRST cohomology.

S. Cnockaert; M. Henneaux

2005-04-20T23:59:59.000Z

485

Long-Term Environmental Stewardship  

NLE Websites -- All DOE Office Websites (Extended Search)

Long-Term Environmental Stewardship Long-Term Environmental Stewardship The Long-Term Environmental Stewardship Program ensures protection of human health and the environment, following site remediations. Contact Environmental Communication & Public Involvement P.O. Box 1663 MS M996 Los Alamos, NM 87545 (505) 667-0216 Email Continuing environmental commitment Long-term stewardship activities are designed to prevent exposures to residual contamination and waste including groundwater monitoring ongoing pump-and-treatment activities maintenance of barriers and other contaminant structures periodic inspections control of site access posted signs Long-term environmental stewardship (LTES) data access DOE requires that data used to make decisions concerning LTES conditions be readily accessible to the public. To accomplish this, sample analysis data

486

U.S. VERSUS EUROPEAN WEB SEARCHING TRENDS Amanda Spink  

E-Print Network (OSTI)

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

Jansen, James

487

Typing constraint logic programs  

Science Conference Proceedings (OSTI)

We present a prescriptive type system with parametric polymorphism and subtyping for constraint logic programs. The aim of this type system is to detect programming errors statically. It introduces a type discipline for constraint logic programs and ... Keywords: Constraint logic programming, Metaprogramming, Prolog, subtyping, type systems

François Fages; Emmanuel Coquery

2001-11-01T23:59:59.000Z

488

Electricity storage for short term power system service (Smart Grid  

Open Energy Info (EERE)

storage for short term power system service (Smart Grid storage for short term power system service (Smart Grid Project) Jump to: navigation, search Project Name Electricity storage for short term power system service Country Denmark Coordinates 56.26392°, 9.501785° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":56.26392,"lon":9.501785,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

489

Gesture Search: A Tool for Fast Mobile Data Access Google Research  

E-Print Network (OSTI)

various types of data items by entering a textual query at a single place, e.g., the Quick Search Box, entering a search query requires a user to scan and type on tiny keys in a keypad, which can be stressful. Gesture Search also allows multiple search terms and toler- ates misspellings. Lastly, Gesture Search

Pregibon, Daryl

490

Flowsheets and source terms for radioactive waste projections  

Science Conference Proceedings (OSTI)

Flowsheets and source terms used to generate radioactive waste projections in the Integrated Data Base (IDB) Program are given. Volumes of each waste type generated per unit product throughput have been determined for the following facilities: uranium mining, UF/sub 6/ conversion, uranium enrichment, fuel fabrication, boiling-water reactors (BWRs), pressurized-water reactors (PWRs), and fuel reprocessing. Source terms for DOE/defense wastes have been developed. Expected wastes from typical decommissioning operations for each facility type have been determined. All wastes are also characterized by isotopic composition at time of generation and by general chemical composition. 70 references, 21 figures, 53 tables.

Forsberg, C.W. (comp.)

1985-03-01T23:59:59.000Z

491

Short-Term Energy Outlook  

U.S. Energy Information Administration (EIA)

DOE/EIA-0202(98/3Q) Distribution Category UC-950 Short-Term Energy Outlook July 1998 Energy Information Administration Office of Energy Markets and End Use

492

More on the term Fission?  

NLE Websites -- All DOE Office Websites (Extended Search)

information, and he certainly did. His insight into the origin of the term "fission" expanded greatly on the mere mention I had made of it in the Y-12 history column he...

493

Interpretations of the JEBAR Term  

Science Conference Proceedings (OSTI)

In diagnostic calculations of the ocean's circulation, the so-called JEBAR (joint effect of baroclinicity and relief) term may induce a significant depth-average current field, as has been noted in the oceanographic literature. Here we present ...

Gordon Mertz; Daniel G. Wright

1992-03-01T23:59:59.000Z

494

Does the term structure forecast  

E-Print Network (OSTI)

provides more accurate forecasts of real consumption growth14. Harvey, C.R. (1989): \\Forecasts of economic growth fromC.R. (1993): \\Term structure forecasts economic growth", Fi-

Berardi, Andrea; Torous, Walter

2002-01-01T23:59:59.000Z

495

Regular Object Types  

E-Print Network (OSTI)

Regular expression types have been proposed as a foundation for statically typed processing of XML and similar forms of tree-structured data. To date, however, regular expression types have been explored in special-purpose languages (e.g., XDuce, CDuce, and XQuery) with type systems designed around regular expression types "from the ground up." The goal of the Xtatic language is to bring regular expression types to a broad audience by offering them as a lightweight extension of a popular object-oriented language, C#. We develop...

Vladimir Gapeyev; Benjamin C. Pierce

2003-01-01T23:59:59.000Z

496

Environmental Management Long-Term Stewardship Transition Guidance  

Science Conference Proceedings (OSTI)

Long-term stewardship consists of those actions necessary to maintain and demonstrate continued protection of human health and the environment after the completion of facility cleanup. Long-term stewardship is administered and overseen by the U.S. Department of Energy Environmental Management Office of Science and Technology. This report describes the background of long-term stewardship and gives general guidance about considerations when ownership and/or responsibility of a site should be transferred to a long-term stewardship program. This guidance document will assist the U.S. Department of Energy in: (a) ensuring that the long-term stewardship program leads transition planning with respect to facility and site areas, and (b) describing the classes and types of criteria and data required to initiate transition for areas and sites where the facility mission has ended and cleanup is complete.

Kristofferson, Keith

2001-11-01T23:59:59.000Z

497

Long-Term Surveillance Plan  

E-Print Network (OSTI)

NRC in the referenced letter have been addressed and are reflected in this submittal. This Long Term Surveillance Plan (LTSP) is intended to satisfy the requirements set forth in 10 CFR 40.28 whereby the long-term custodian must provide an LTSP to the NRC as a step in the licensing/license termination process. Please call me at (970) 248-6037 if you have questions. Sincerely, Enclosures cc w/enclosure:

Mail Stop Ta; M. Plessinger Mactec-ers

2001-01-01T23:59:59.000Z

498

Types of Radiation Exposure  

NLE Websites -- All DOE Office Websites (Extended Search)

External Irradiation Contamination Incorporation Biological Effects of Acute, Total Body Irradiation Managing Radiation Emergencies Procedure Demonstration Types of radiation...

499

Types of Lighting | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Types of Lighting Types of Lighting Types of Lighting October 17, 2013 - 5:36pm Addthis When it comes to lighting options, you have a number of choices. | Photo courtesy of Clean Energy Resource Teams. When it comes to lighting options, you have a number of choices. | Photo courtesy of Clean Energy Resource Teams. You have several options to consider when selecting what type of lighting you should use in your home. When selecting energy-efficient lighting, it's a good idea to understand basic lighting terms and principles. Also, it helps to explore your lighting design options if you haven't already. This will help narrow your selection. Types of lighting include: Fluorescent

500

Type B Drum packages  

Science Conference Proceedings (OSTI)

The Type B Drum package is a container in which a single drum containing Type B quantities of radioactive material will be packaged for shipment. The Type B Drum containers are being developed to fill a void in the packaging and transportation capabilities of the US Department of Energy (DOE), as no double containment packaging for single drums of Type B radioactive material is currently available. Several multiple-drum containers and shielded casks presently exist. However, the size and weight of these containers present multiple operational challenges for single-drum shipments. The Type B Drum containers will offer one unshielded version and, if needed, two shielded versions, and will provide for the option of either single or double containment. The primary users of the Type B Drum container will be any organization with a need to ship single drums of Type B radioactive material. Those users include laboratories, waste retrieval facilities, emergency response teams, and small facilities.

Edwards, W.S.

1995-11-01T23:59:59.000Z