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

Google maps | OpenEI Community  

Open Energy Info (EERE)

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

2

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

3

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

4

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

5

Strategic Use of Information Technology - Google  

E-Print Network (OSTI)

Many found their way to Google.com because of the positiveAs the number of queries on Google.com grew, Google became a

Chen, Rex; Lam, Oisze; Kraemer, Kenneth

2007-01-01T23:59:59.000Z

6

How does Google work? Three aspects  

E-Print Network (OSTI)

How does Google work? Three aspects: 1 How does Google know what is on the Web? 2 How does Google search the Web for your query phrase? 3 How does Google decide which results you may be interested in? Google is not the first Search Engine, earlier were, for example, Altavista and Yahoo. Google introduced

Rydeheard, David

7

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

8

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:

9

----Google File System Windows IT  

E-Print Network (OSTI)

Essential ---- Google File System web Windows IT Google IT Google Google File System Google File System Datebase Google Google " " Goolge Goolge Google Google Goolge Google ()(,) Google ...... Google IT Google Google Google Google Google "Google " Google 10

10

Google matrix 1 Google matrix  

E-Print Network (OSTI)

Google matrix 1 Google matrix Fig.1. Google matrix of Wikipedia articles network, written [19]) A Google matrix is a particular stochastic matrix that is used by Google's PageRank algorithm be generated iteratively from the Google matrix using the power method. However, in order for the power method

Shepelyansky, Dima

11

Google matrix 1 Google matrix  

E-Print Network (OSTI)

Google matrix 1 Google matrix A Google matrix is a particular stochastic matrix that is used by Google's PageRank algorithm. The matrix represents a graph with edges representing links between pages. The rank of each page can be generated iteratively from the Google matrix using the power method. However

Shepelyansky, Dima

12

Guided Google: A Meta Search Engine and its Implementation using the Google Distributed Web Services  

E-Print Network (OSTI)

1 Guided Google: A Meta Search Engine and its Implementation using the Google Distributed Web in recent years. For instance, Google, which is one of the popular search engines, supports Web Services that allow external applications to issue Web search queries that are actually processed using a Google

Buyya, Rajkumar

13

Toward Google Borders Antoine Mazi`eres  

E-Print Network (OSTI)

Toward Google Borders Antoine Mazi`eres INRA-SenS, LIAFA, Fabelier Paris, France antoine suggestions on Google Search for the query "Why society" represented on a world map (suggestions in red for cultural trends analysis based on Google auto- complete suggestions. We present Zeitgeist Borders

Paris-Sud XI, Université de

14

Google Earth through a Keyhole  

E-Print Network (OSTI)

Google Earth through a Keyhole John Cloud NOAA Central Library #12;#12;Fort Huachuca, Arizona #12;#12;#12;Google Ocean #12;#12;The Roots of Google Earth 2001: Keyhole Corporation founded in Mountain View, California. Develops Keyhole Markup Language (KML), etc. 2003:Keyhole develops EarthSystemTM 2004: Google

Wright, Dawn Jeannine

15

User:Woodjr/Sandbox/GoogleEarth | Open Energy Information  

Open Energy Info (EERE)

experimental "GoogleEarth" result format for ask queries. Based on the Thematic Mapping API. Registered Energy Organizations, by Country (Worldwide, Default Visualization) Array...

16

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

17

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

18

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

19

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

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 developer google" 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

Improving Access to Web Content at Google  

E-Print Network (OSTI)

1 Improving Access to Web Content at Google Loretta Guarino Reid (LorettaGuarino@google.com) Srinivas Annam (AnnamS@google.com) March 12, 2008 #12;2 Overview Accessibility developments for : · Gmail · Search · Toolbar · Maps & Transit · Books · Video & Captions · Short Topics ­ Calendar, Google Groups

Cortes, Corinna

22

2013 Google Inc. All rights reserved. Google and the Google logo are trademarks of Google Inc. Google Anita Borg  

E-Print Network (OSTI)

© 2013 Google Inc. All rights reserved. Google and the Google logo are trademarks of Google Inc. Google Anita Borg Memorial Scholarship 2014 Europe, the Middle East and Africa Dr. Anita Borg (1949 that keep women and minorities from entering computing and technology fields. In honor of her vision, Google

Cengarle, María Victoria

23

Who's Googling What? What Internet Searches Reveal about Hurricane Information Seeking  

Science Conference Proceedings (OSTI)

Two freely available, searchable databases that track the normalized interest in specific search queries, Google Trends and Google Insights, were used to illustrate spatial and temporal patterns in hurricane information seeking. Searches for the word ...

Kathleen Sherman-Morris; Jason Senkbeil; Robert Carver

2011-08-01T23:59:59.000Z

24

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

25

GOOGLE EARTH QUICK GUIDE (1)Google Earth Features  

E-Print Network (OSTI)

GOOGLE EARTH QUICK GUIDE (1)Google Earth Features The Google Earth of the Google Earth window. Often when opening up the Google Earth program, the view Bar Controls View Screen #12;GOOGLE EARTH QUICK GUIDE Controls. The following

Smith-Konter, Bridget

26

Guided Summarization Results GOOGLE Google Inc Run ID ...  

Science Conference Proceedings (OSTI)

Page 1. Guided Summarization Results GOOGLE Google Inc Run ID: GOOGLE1 Overall Responsiveness 1.000 Overall ...

2012-02-27T23:59:59.000Z

27

Google Confidential and Proprietary Google Confidential and Proprietary  

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

Google Confidential and Proprietary Google Confidential and Proprietary Google Confidential and Proprietary Google Confidential and Proprietary Google Inc. March 21, 2013 NREL Webinar How Google gets to "Zero" Google Confidential and Proprietary Industry Average Data Center PUE, 2011 = 1.83 DATA CENTER ENERGY USE IN CONTEXT Google Confidential and Proprietary GOOGLE'S CARBON FOOTPRINT In 2011, Google's electricity consumption was ~2.7M MWh, with a carbon footprint of ~1.7M metric tonnes of CO

28

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

29

Migrated to Google Apps  

E-Print Network (OSTI)

Mail Mail data Migrated to Google Apps Notes Email messages All email in top-level folders (read vs. unread) Folders and nested subfolders (Labels in Gmail) Folders map to labels in Google Mail. Junk E-mail Not migrated. Deleted Items Not migrated. Public folders (Microsoft® Exchange only) Google

Hu, Jie

30

Google Israel is Hiring! Google's mission is to organize the world's information and make it universally accessible  

E-Print Network (OSTI)

Google Israel is Hiring! Google's mission is to organize the world's information and make achieve it. Google's Research and Development Center in Israel is hiring Software Engineers for both Haifa and Tel Aviv offices. To learn more about Google, visit www.google.com/EngineeringEMEA. You can

31

Google Custom Search API [Google search in your hands  

E-Print Network (OSTI)

Google Custom Search API [Google search in your hands] Nicholas Weininger www.google.com/cse code.google.com/apis/customsearch #12;Our mission and history Google Custom Search allows anybody to leverage the Google search platform Used extensively within Google (Help Center, Blogger, etc.) #12;What does a Search API mean to us

Chakrabarti, Soumen

32

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

33

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

34

Atomwirtschaft, Atomtechnik - Google Books  

U.S. Energy Information Administration (EIA)

New! Get Textbooks on Google Play. Rent and save from the world's largest eBookstore. Read, highlight, and take notes, across web, tablet, and phone.

35

GOOGLE SCHOLAR & UC-ELINKS What is Google Scholar?  

E-Print Network (OSTI)

GOOGLE SCHOLAR & UC-ELINKS What is Google Scholar? What is UC-eLinks? Scholar Preferences The UC Libraries are part of Google Scholar's Library Links program. This means UC Davis users can activate UC-eLinks to connect to library-licensed resources in Google Scholar from off campus: Google Scholar, http://scholar.google

Ishida, Yuko

36

Guided Google: A Meta Search Engine and its Implementation Using the Google Distributed Web Services  

E-Print Network (OSTI)

With the ubiquity of the Internet and Web, search engines have been sprouting like mushrooms after a rainfall. However, innovative search engines and guided search capabilities have started appearing only in recent years. For instance, Google, which is one of the popular search engines, supports Web Services that allow external applications to issue Web search queries that are actually processed using a Google's commodity cluster computer made up of 15,000 PC nodes. The goals of these applications are to help ease and guide the searching efforts of novice web users towards their desired objectives. A number of implementations of such services are emerging. This paper proposes a guided meta-search engine, called Guided Google that serves as an advanced interface to the actual Google.com search engine.

Choon Hoong Ding; Rajkumar Buyya

2004-01-01T23:59:59.000Z

37

The Greening of Google  

Science Conference Proceedings (OSTI)

Google's project is the largest corporate installation of solar panels in North America. It has grabbed headlines since Google announced it a year ago. That said, it isn't even in the worldwide top 10 of roof-mounted solar projects. A handful of factories ...

S. Upson

2007-10-01T23:59:59.000Z

38

Google SOAP API Google API Teil II / berblick CVS  

E-Print Network (OSTI)

Google SOAP API CVS Google API Teil II / ?berblick CVS Projektgruppe 520 Rafael Koloch 12. Oktober 2007 Rafael Koloch Google API Teil II / ?berblick CVS #12;Google SOAP API CVS Webservice Denition Webservice Aufruf Webservice Ergebnis auswerten Demonstration ?berblick Google API: Denition des Web

Morik, Katharina

39

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

40

Google Scholar. References  

E-Print Network (OSTI)

This is a list of my publications as of March 2009, with citation counts fetched from Google Scholar at that time. My most highly cited articles are [57, 15, 23,

John Hughes; Thomas Arts; Laura M. Castro; John Hughes; Testing Erlang; Alejandro Russo Koen Claessen; John Hughes; Paul Hudak; John Hughes; Simon Peyton Jones; Philip Wadler; A History

2007-01-01T23:59:59.000Z

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

Introduction To Google  

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

To Google Chromebooks and Chromeboxes Trever Nightingale, NERSCLBL, 10102013 What is a Chromebook? It is a special device* you must buy to get all the features I will discuss....

42

The Google Library Project  

E-Print Network (OSTI)

This is an economic analysis of the Google Library project. I describe the project and outline why it is consistent with the legal doctrine of fair use. I go on to examine the transactions costs associated with optin and opt-out models for publisher participation. I conclude that the Google Library Project is legally sound and economically sensible. In particular, an opt-in model would incur very substantial transactions costs, making the entire undertaking problematic.

Hal R. Varian

2006-01-01T23:59:59.000Z

43

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

44

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:

45

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:

46

Google Scholar Op zoek naar wetenschappelijke artikelen? Google Scholar (Google Wetenschap)  

E-Print Network (OSTI)

Google Scholar Op zoek naar wetenschappelijke artikelen? Google Scholar (Google Wetenschap) helpt u op te sporen wat u met de `gewone' Google niet vindt. Artikel vinden Klik op een zoekresultaat voor de pagina Settings (link in de rechter bovenhoek van het beginscherm van Google Scholar). Geavanceerd

van Rooij, Robert

47

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 Bra; Ion Lungu; Manole Velicanu; Vlad Diaconita; Iuliana Botha

2008-05-01T23:59:59.000Z

48

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

49

Original Google Earth Links | Open Energy Information  

Open Energy Info (EERE)

Original Google Earth Links Jump to: navigation, search Google Earth Google Earth.png Install Google Earth and explore: Renewable Energy Activity, by state Renewable Incentive...

50

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

51

Physics the google way  

E-Print Network (OSTI)

Are we smarter now than Socrates was in his time? Society as a whole certainly enjoys a higher degree of education, but humans as a species probably don't get intrinsically smarter with time. Our knowledge base, however, continues to grow at an unprecedented rate, so how then do we keep up? The printing press was one of the earliest technological advances that expanded our memory and made possible our present intellectual capacity. We are now faced with a new technological advance of the same magnitude--the internet--but how do we use it effectively? A new tool is available on Google (http://www.google.com) that allows a user not only to numerically evaluate equations, but to automatically perform unit analysis and conversion as well, with most of the fundamental physical constants built in.

Ward, D W

2004-01-01T23:59:59.000Z

52

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

53

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

54

Google's Hybrid Approach to Research Alfred Spector  

E-Print Network (OSTI)

Google's Hybrid Approach to Research Alfred Spector Google Inc. azs@google.com Peter Norvig Google Inc. pnorvig@google.com Slav Petrov Google Inc. slav@google.com 1 Introduction In this paper, we describe how we organize Computer Science (CS) research at Google. We focus on how we integrate research

Cortes, Corinna

55

The Facts About Google Book Search What's Google Book Search?  

E-Print Network (OSTI)

The Facts About Google Book Search What's Google Book Search? Google Book Search makes finding books easier. We introduced this program in the fall of 2004 to help users search through the oceans of information contained in the world's books and to help authors and publishers promote their books and expand

56

Google | OpenEI Community  

Open Energy Info (EERE)

Google Home Ianjkalin's picture Submitted by Ianjkalin(84) Contributor 14 July, 2012 - 13:05 Top Innovation Ideas from the New York Energy Data Jam EDI Google Innovation Open Data...

57

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

58

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

59

Virtual Fieldwork Using Google Earth  

E-Print Network (OSTI)

Virtual Fieldwork Using Google Earth Advanced Techniques #12;Digital Explorer 1 Gough Square London Fieldwork Using Google Earth compiled by Jamie Buchanan-Dunlop Digital Explorer 71 Regent Studios 8 Andrews Buchanan-Dunlop © 2008 Google © 2008 Ricardo Sgrillo All rights reserved cover design by rob `at

Smith-Konter, Bridget

60

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

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

Strategic Use of Information Technology - Google  

E-Print Network (OSTI)

100,000 REFERENCES Arnold, S. (2005). Google Technology. In The Google Legacy:How Google's Internet Search is Transforming Application

Chen, Rex; Lam, Oisze; Kraemer, Kenneth

2007-01-01T23:59:59.000Z

62

GOOGLE. UNE ENQUTE. Marin Dacos  

E-Print Network (OSTI)

GOOGLE. UNE ENQU?TE. Marin Dacos Communication prononcée dans le cadre de la journée d'étude « Les printemps 2003). Le principal responsable de cette chute est Google. Ce moteur de renommée mondiale, qui n dites libres, qui sont mises en oeuvre en toute transparence technologique, la réussite de Google réside

Paris-Sud XI, Université de

63

Google Book Search is not Fair Use  

E-Print Network (OSTI)

JOURNAL UCLA SCHOOL OF LAW GOOGLE BOOK SEARCH IS NOT FAIRcopyright litigation over Google Book Search has prompted medisagree, objecting that Googles use might be valuable, but

Lichtman, Douglas

2008-01-01T23:59:59.000Z

64

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

65

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

66

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

67

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

68

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

69

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

70

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

71

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

72

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

73

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

74

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

75

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

76

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

77

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

78

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

79

Google Tools - EETD Followup Seminar  

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

Google Tools - EETD Followup Seminar Speaker(s): Charles Verboom Julie Petersen Date: April 1, 2010 - 12:00pm Location: 90-3122 The IT Division is moving forward with our rollout...

80

OpenEI Community - Google  

Open Energy Info (EERE)

communityblogtop-innovation-ideas-new-york-energy-data-jamcomments EDI Google Innovation Open Data OpenEI Energy Data Jam Sat, 14 Jul 2012 19:05:59 +0000 Ianjkalin...

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

Engineering Reliability into Web Sites: Google SRE  

E-Print Network (OSTI)

Engineering Reliability into Web Sites: Google SRE Alex Perry alex.perry@google.com Santa Monica SRE, Google #12;Abstract This talk introduces Site Reliability Engineering (SRE) at Google, explaining, Santa Monica, Dublin and Kirkland manage Google's many services and websites. They draw upon the Linux

Cortes, Corinna

82

Google au quotidien : le googling ou les habitudes de recherche de l'internaute ordinaire Page 1 sur 12 GOOGLE AU QUOTIDIEN : LE GOOGLING EN PERSPECTIVE  

E-Print Network (OSTI)

Google au quotidien : le googling ou les habitudes de recherche de l'internaute ordinaire Page 1 sur 12 GOOGLE AU QUOTIDIEN : LE GOOGLING EN PERSPECTIVE Philippe Dumas, Professeur en Sciences de l recherche d'information à partir d'une étude sociolinguistique des discours sur Google. Mots clés : Usages

Paris-Sud XI, Université de

83

Deploying Google Search by Voice in Cantonese Yun-Hsuan Sung, Martin Jansche, Pedro J. Moreno  

E-Print Network (OSTI)

was launched in December 2010. Index Terms: voice search, Cantonese speech recognition, mul- tilingual speech to speak search queries instead of entering Chinese characters on mobile devices. We believe ourDeploying Google Search by Voice in Cantonese Yun-Hsuan Sung, Martin Jansche, Pedro J. Moreno

Pregibon, Daryl

84

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

85

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

86

Detecting Adversarial Advertisements in the Wild Google, Inc.  

E-Print Network (OSTI)

Detecting Adversarial Advertisements in the Wild D. Sculley Google, Inc. dsculley@google.com Matthew Eric Otey Google, Inc. otey@google.com Michael Pohl Google, Inc. mpohl@google.com Bridget Spitznagel Google, Inc. drsprite@google.com John Hainsworth Google, Inc. hainsworth@google.com Yunkai Zhou

Cortes, Corinna

87

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

88

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.

89

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

90

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.

91

Google  

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

Search Images Maps Play YouTube News Gmail Drive More Calendar Translate Mobile Books Offers Wallet Shopping Blogger Finance Photos Videos Even more Account Options Sign in...

92

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

93

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

94

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; Yazmn Anglica Ibez-Garca; ?nan Seylan

2011-11-01T23:59:59.000Z

95

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

96

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

97

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

98

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

99

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

100

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

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

Google Earth A Demo on some of the GIS capabilities of Google  

E-Print Network (OSTI)

Google Earth A Demo on some of the GIS capabilities of Google Earth 1- Open Google Earth on your in a Name that you would like to represent your photo on Google Earth f. Navigate to location of the image website for navigating through Google Earth. You can also check out the new features in Version 5 like

Schweik, Charles M.

102

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

103

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"

104

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.

105

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

106

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

107

Google In A Photonic Lattice  

E-Print Network (OSTI)

The quantum version of Google PageRank has recently been investigated by various groups and shown to be quadratically faster in time than the classical PageRank algorithm. In this paper we propose the implementation of Quantum PageRank by a stochastic quantum walk of correlated photons in a photonic waveguide lattice, where we allow the density matrix to evolve according to the Lindblad-Kossakowski master equation. This yields a stationary state, the diagonal of whose density matrix gives the page ranking.

Kallol Roy; Ji Liu; Le Luo; R. Srikanth; Tapan Mishra; Bhanu Das; T. Srinivas

2013-05-08T23:59:59.000Z

108

Using the Google Visualisation API with R: googleVis-0.2.4 Package Vignette  

E-Print Network (OSTI)

The googleVis package provides an interface between R and the Google Visualisation API. The Google Visualisation API offers interactive charts which can be embedded into web pages. The best known of these charts is probably the Motion Chart, popularised by Hans Rosling in his TED talks. The functions of the googleVis package allow the user to visualise data stored in R data frames with the Google Visualisation API without uploading their data to Google. The output of a googleVis function is html code that contains the data and references to JavaScript functions hosted by Google and can be displayed via a browser.

Markus Gesmann; Diego De Castillo

2011-01-01T23:59:59.000Z

109

Google Analytics | OpenEI Community  

Open Energy Info (EERE)

Google Analytics Home Rmckeel's picture Submitted by Rmckeel(287) Contributor 8 November, 2012 - 13:58 OpenEI dashboard Google Analytics mediawiki OpenEI statistics wiki OpenEI web...

110

google hangout | OpenEI Community  

Open Energy Info (EERE)

google hangout Home Graham7781's picture Submitted by Graham7781(1982) Super contributor 21 February, 2013 - 16:32 Energy Secretary Steven Chu to host DOE's first google hangout at...

111

Google Book Search is not Fair Use  

E-Print Network (OSTI)

UCLA SCHOOL OF LAW GOOGLE BOOK SEARCH IS NOT FAIR USE 1copyright litigation over Google Book Search has prompted meomitted)); Wright v. Warner Books, Inc. , 953 F.2d 731,

Lichtman, Douglas

2008-01-01T23:59:59.000Z

112

Director of Engineering, Google Australia and New Zealand Date: Friday 19 August 2011  

E-Print Network (OSTI)

Alan Noble Director of Engineering, Google Australia and New Zealand NICTA Canberra Research and management experience, in Australia, the United States and Japan. Since Feb 2007 he has lead Google's research and development operations in Australia, one of Google's fastest growing engineering centres

Heiser, Gernot

113

A New System to Perform Unsupervised and Supervised Classification of Satellite Images from Google Maps  

E-Print Network (OSTI)

A New System to Perform Unsupervised and Supervised Classification of Satellite Images from Google of satellite images from Google Maps. The system has been developed using the SwingX-WS library Systems ENVI package. Keywords: Satellite image classification, Google Maps. 1. INTRODUCTION The wealth

Plaza, Antonio J.

114

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.

115

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

116

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

117

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

118

Google Earth Tour: How Contaminants Got There  

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

Google Earth Tour: How Contaminants Got There Click here to load the tour...then click the play button below...

119

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

120

The Google Library Project Hal R. Varian  

E-Print Network (OSTI)

The Google Library Project Hal R. Varian January 2006 Revised: February 10, 2006 Abstract This is an economic analysis of the Google Library project. I describe the project and outline why it is consistent-out models for publisher participation. I conclude that the Google Library Project is legally sound

Varian, Hal R.

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

Google Earth Tip Sheet Switch between  

E-Print Network (OSTI)

Google Earth Tip Sheet Hide/Show Sidebar Add Placemark Add Polygon Add Path Add Image Overlay Show/Hide Ruler Show Sunlight Switch between Sky and Earth Email Print View in Google Maps Drag to rotate the view item Stop TourTransparency slider Google Earth User Interface New Placemark Dialog Box Name will appear

Smith-Konter, Bridget

122

GOOGLE BOOK SETTLEMENT: BRILLIANT BUT EVIL?  

E-Print Network (OSTI)

1 GOOGLE BOOK SETTLEMENT: BRILLIANT BUT EVIL? Pamela Samuelson, Berkeley Law Cisco Distinguished Lecture May 13, 2010 OVERVIEW · Google Book Search Project, the lawsuit it k d & f ttli itprovoked under the Google Partner Program · It also includes millions of books from university research library

Sadoulet, Elisabeth

123

Google as a Bookmarking Tool Ryan Jazayeri  

E-Print Network (OSTI)

Google as a Bookmarking Tool by Ryan Jazayeri Submitted to the Department of Electrical Engineering by . . . . . . . . . . . . .. . . . . . . . . . . .. . . . . . . . . . . . .. . . . . . . . . . . . .. . . . . . . . . . . . .. . . . . . . Arthur C. Smith Chairman, Department Committee on Graduate Students #12;2 #12;Google as a Bookmarking of Google to locate previously visited webpages. Instead of bookmarking webpages by their URL, this process

124

Google's Auction for TV Ads Preliminary version  

E-Print Network (OSTI)

Google's Auction for TV Ads Preliminary version Noam Nisan Jason Bayer Deepak Chandra Tal Franji Robert Gardner Yossi Matias Neil Rhodes Misha Seltzer Danny Tom Hal Varian Dan Zigmond Google Inc. Abstract This document describes the auction system used by Google for allocation and pricing of TV ads

Nisan, Noam

125

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

Frdric Roulland; Aaron Kaplan; Stefania Castellani; Claude Roux; Antonietta Grasso; Karin Pettersson; Jacki O'Neill

2007-04-01T23:59:59.000Z

126

BioMon: A Google Earth Based Continuous Biomass Monitoring System (Demo Paper)  

SciTech Connect

We demonstrate a Google Earth based novel visualization system for continuous monitoring of biomass at regional and global scales. This system is integrated with a back-end spatiotemporal data mining system that continuously detects changes using high temporal resolution MODIS images. In addition to the visualization, we demonstrate novel query features of the system that provides insights into the current conditions of the landscape.

Vatsavai, Raju [ORNL

2009-01-01T23:59:59.000Z

127

2010 Google -Map data 2010 Google -Driving directions to 1850 Table Mesa Dr, Boulder, CO 80305  

E-Print Network (OSTI)

©2010 Google - Map data ©2010 Google - Driving directions to 1850 Table Mesa Dr, Boulder, CO 80305 obey all signs or notices regarding your route. Map data ©2010 Google Report a problem Print Send Link, CO 80305 to 1850 Table Mesa... http://maps.google.com/maps?f=d&source=s_d&saddr=32... 1 of 1 9

128

Making Google Maps A comprehensive user guide for creating and using your own online Google Maps  

E-Print Network (OSTI)

1 Making Google Maps A comprehensive user guide for creating and using your own online Google Maps By Devlin Hughes and Brett Jackson Trinity College May 2007 edition #12;2 Chapter 1: Introduction to Google, and are accessible to the public. You can also chose to display a mashup on your website. Mashups use Google Map

Wright, Dawn Jeannine

129

Diffusion des rsultats de la recherche : une nouvelle donne numrique ? GOOGLE SCHOLAR, GOOGLE PRINT...  

E-Print Network (OSTI)

Diffusion des résultats de la recherche : une nouvelle donne numérique ? GOOGLE SCHOLAR, GOOGLE.» (GAR 05) 72 % des universitaires utilisent le moteur Google pour leurs recherches d'articles scientifiques (SWA 05). L'INIST, premier fournisseur français de documents de recherche a fait de Google Scholar

Paris-Sud XI, Université de

130

Adding STARFire Analysis Layers to Google Earth through a KML Network Link 1) Launch Google Earth  

E-Print Network (OSTI)

Adding STARFire Analysis Layers to Google Earth through a KML Network Link 1) Launch Google Earth 2) The network link will be added in the Places control within Google Earth. Select the node level in the tree layers for viewing within Google Earth. Double clicking on a layer will zoom you to the extent

131

2010 Google -Map data 2010 Google, Sanborn -Driving directions to Tureaud Elementary School  

E-Print Network (OSTI)

©2010 Google - Map data ©2010 Google, Sanborn - Driving directions to Tureaud Elementary School St, New Orleans, LA 70112 to Tureaud Elementary ... http://maps.google data ©2010 Google Report a problem Tureaud Elementary School 2021 Pauger Street New Orleans, LA 70116

132

2010 Google -Map data 2010 Google, Sanborn -Driving directions to St Peter Claver School  

E-Print Network (OSTI)

©2010 Google - Map data ©2010 Google, Sanborn - Driving directions to St Peter Claver School (504.google.com/maps?client=firefox-a&rls=org.mozilla:e... 1 of 2 9/2/10 10:45 AM #12;Hide Driving directions ©2010 Google Report a problem St Peter Claver School 1020 North Prieur Street New Orleans, LA 70116

133

Google Comes to Campus The Challenges of Search: Lessons from Google  

E-Print Network (OSTI)

Google Comes to Campus The Challenges of Search: Lessons from Google WHO: Dr. Peter Norvig.m. Sponsored by the Caltech Student Chapter of SIAM. Google is hiring! We're looking for software engineers (BS View and Santa Monica). E-mail resumes with unoffical transcripts to collegejobs@google.com. © 2004

Barr, Al

134

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

135

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; Vctor Cuevas-Vicenttn; Sven Khler; Eric Gribkoff; Michael Wang; Bertram Ludscher

2013-03-01T23:59:59.000Z

136

Flint: Google-basing the Web  

E-Print Network (OSTI)

Several Web sites deliver a large number of pages, each publishing data about one instance of some real world entity, such as an athlete, a stock quote, a book. Even though it is easy for a human reader to recognize these instances, current search engines are unaware of them. Technologies for the Semantic Web aim at achieving this goal; however, so far they have been of little help in this respect, as semantic publishing is very limited. We have developed a system, called FLINT, for automatically searching, collecting and indexing Web pages that publish data representing an instance of a certain conceptual entity. FLINT takes as input a small set of labeled sample pages: it automatically infers a description of the underlying conceptual entity and then searches the Web for other pages containing data representing the same entity. FLINT automatically extracts data from the collected pages and stores them into a semi-structured self-describing database, such as Google Base. Also, the collected pages can be used to populate a custom search engine; to this end we rely on the facilities provided by Google Co-op. 1.

Lorenzo Blanco; Valter Crescenzi; Paolo Merialdo; Paolo Papotti; Roma Tre

2008-01-01T23:59:59.000Z

137

V-019: Google Chrome Multiple Vulnerabilities | Department of...  

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

19: Google Chrome Multiple Vulnerabilities V-019: Google Chrome Multiple Vulnerabilities November 8, 2012 - 6:00am Addthis PROBLEM: Google Chrome Multiple Vulnerabilities PLATFORM:...

138

Workshop Bucarest Le monde selon Google  

E-Print Network (OSTI)

Workshop Bucarest Le monde selon Google 2-4 juillet 2005 Moteurs de recherche et maîtrise de l'information : faut-il former à Google et comment ? Par Alexandre Serres, Maître de Conférences, URFIST de Rennes recherche d'information sur Internet Faut-il former à Google ? Enoncée ainsi, la question risque de paraître

Paris-Sud XI, Université de

139

OpenEI Community - google hangout  

Open Energy Info (EERE)

hangout open to the public tomorrow afternoon to answer questions related to the Sunshot Initiative.

More about the google.comevents...

140

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

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

Description of the Google update summarizer at TAC-2011  

Science Conference Proceedings (OSTI)

Page 1. Description of the Google update summarizer at TAC-2011 Jean-Yves Delort Google Research Brandschenkestrasse ...

2012-03-27T23:59:59.000Z

142

Webmail by Google Migration Checklist for Outlook users  

E-Print Network (OSTI)

Webmail by Google Migration Checklist for Outlook users During your transition to Webmail by Google you must use the Webmail by Google Web Interface located at: http://webmail.njit.edu 1. Configure your Outlook Client: Install and run Google Apps Sync from http://ist.njit.edu/google/sync/. Google Apps Sync

Hu, Jie

143

Using google analytics to explore ETDs use  

Science Conference Proceedings (OSTI)

This poster presents preliminary Google Analytics usage data for a collection of electronic theses and dissertations (ETDs). Correlation of page views with page type, user location, and source (referring link) shows that, during the study period, most ... Keywords: ETDs, evaluation, google analytics, usage, web analytics, web metrics

Midge Coates

2013-07-01T23:59:59.000Z

144

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

145

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

146

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

147

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

148

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

149

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

150

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

151

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

152

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

153

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

154

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

155

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

156

Wind for Schools Portal Developer Resources | Open Energy Information  

Open Energy Info (EERE)

Developer Resources Developer Resources Jump to: navigation, search Wind for Schools Portal Home Comparison Motion Chart Educational Resources Data, APIs and Visualizations - introduction for aspiring developers Are you looking to get raw data from Wind for Schools Portal? Or perhaps you'd like to modify an existing visualization? This page shows details on how to query data and modify or create your own visualizations. All of the Wind for Schools Portal data is open. Because it is updated real-time, it is unique, interesting data that you can download, analyze and visualize. Data Wind data is aggregated daily to Google Fusion Tables. This data is such that SQL-like queries can be made against it and a visualization created. Generate an API key for your usage at Google API console. This API

157

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

158

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

159

Context-Sensitive Query Auto-Completion ?  

E-Print Network (OSTI)

Query auto completion is known to provide poor predictions of the users query when her input prefix is very short (e.g., one or two characters). In this paper we show that context, such as the users 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 users 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 users queries are relevant to the current query she is typing, then after typing a single character, NearestCompletions MRR is 48 % higher relative to the MRR of the standard MostPopularCompletion algorithm on average. When the context is irrelevant, however, NearestCompletions 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

160

Syntactically annotated Ngrams for Google Books  

E-Print Network (OSTI)

In this thesis, we present a new edition of the Google Books Ngram Corpus, describing how often words and phrases were used over a period of five centuries, in eight languages; it aggregates data from 6% of all books ever ...

Lin, Yuri, M. Eng. Massachusetts Institute of Technology

2012-01-01T23:59:59.000Z

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

ALS Operating Schedule on Google Calendar  

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

ALS Operating Schedule on Google Calendar Print ALS Operating Schedule Your browser does not appear to support JavaScript, but this page needs to use JavaScript to display...

162

Google Crisis Map for Hurricane Sandy  

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

The Google Crisis Map has power outage information, shelter and recovery centers, local emergency Twitter feeds, FEMA disaster declared areas and more. | This map is created and maintained by...

163

ALS Operating Schedule on Google Calendar  

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

Operating Schedule on Google Calendar Print ALS Operating Schedule Your browser does not appear to support JavaScript, but this page needs to use JavaScript to display correctly....

164

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

165

Join Us Thursday, Feb. 21 for a Google+ Hangout on the Impact of Open Data  

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

Thursday, Feb. 21 for a Google+ Hangout on the Impact of Thursday, Feb. 21 for a Google+ Hangout on the Impact of Open Data Join Us Thursday, Feb. 21 for a Google+ Hangout on the Impact of Open Data February 20, 2013 - 5:17pm Addthis Join Us Thursday, Feb. 21 for a Google+ Hangout on the Impact of Open Data Matthew Loveless Matthew Loveless Data Integration Specialist, Office of Public Affairs How can I participate? Sign up at the Google+ Event page. Tweet questions to @ENERGY with the hashtag #AskEnergy. Ask us on the Energy Department's Facebook and Google+ pages. Email questions to newmedia@hq.doe.gov. Last Friday, we launched an early version of Energy.gov/Data, a site that will become a central resource for developers, journalists, researchers, and citizens who are looking for energy data and resources, as well as

166

Customizing your Google Scholar Settings University of Saskatchewan Library  

E-Print Network (OSTI)

Customizing your Google Scholar Settings University of Saskatchewan Library Enabling FindIt!/SFX in Google ScholarTM To enable FindIt!, the Library's OpenURL linking service, in Google ScholarTM on your personal computer: 1. Start at the Google ScholarTM homepage at http://scholar.google.ca/ 2. Select

Peak, Derek

167

Google Apps Connector for BlackBerry Enterprise Server Users  

E-Print Network (OSTI)

Google Apps Connector for BlackBerry Enterprise Server Users Google Apps Connector for BlackBerry Enterprise Server is a Google offering that lets you access your Google Apps Mail, Calendar, and Contacts through your native BlackBerry applications. Key Features of Using the Google Apps Connector Updates Mail

Hu, Jie

168

Google Maps -hampton inn rochester http://maps.google.com/ 1 of 2 9/29/05 13:25  

E-Print Network (OSTI)

Google Maps - hampton inn rochester http://maps.google.com/ 1 of 2 9/29/05 13:25 A Hampton Inn 717: 36 Hotels. Google Maps hampton inn rochester #12;Google Maps - hampton inn rochester http://maps.google

Richmond, Michael W.

169

Track NERSC Scheduled and Unscheduled Outages in Google Calendar  

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

Track NERSC Outages in Google Calendar Track NERSC Outages in Google Calendar March 22, 2013 by Jack Deslippe (0 Comments) Outages are now available in Google calendar form. You...

170

VIDEO: Watch the Solar Decathlon 2013 Google+ Hangout | Department...  

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

Watch the Solar Decathlon 2013 Google+ Hangout VIDEO: Watch the Solar Decathlon 2013 Google+ Hangout September 19, 2013 - 2:26pm Addthis Miss the Solar Decathlon 2013 Google+...

171

Video: Watch the Clean Cities Google+ Hangout | Department of...  

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

Video: Watch the Clean Cities Google+ Hangout Video: Watch the Clean Cities Google+ Hangout June 21, 2013 - 4:15pm Addthis Miss the Clean Cities Google+ Hangout? Watch a recording...

172

Google+ Hangout on Wind Energy in America | Department of Energy  

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

Google+ Hangout on Wind Energy in America Google+ Hangout on Wind Energy in America Our special Google+ Hangout on Wind Energy in America will begin at 3 pm ET. If you don't see...

173

2009 Google -Map data 2009 Tele Atlas -Terms of Use 4025 Albert St, Regina, SK to University Dr W -Google Maps http://maps.google.ca/  

E-Print Network (OSTI)

©2009 Google - Map data ©2009 Tele Atlas - Terms of Use 4025 Albert St, Regina, SK to University Dr W - Google Maps http://maps.google.ca/ 2 of 3 4/22/2009 4:38 PM #12;Walking directions are in beta Regina, SK University Dr W 4025 Albert St, Regina, SK to University Dr W - Google Maps http://maps.google

Argerami, Martin

174

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

175

Get to Know Google... Because They Know You  

E-Print Network (OSTI)

Get to Know Google... Because They Know You Ethics and Law on the Electronic Frontier, 6.0 Personal Data Collection by Google Services 2.1 Google's Search Engine 2.1.1 How Google Search Works 2.1.2 Information Google Records with Google Search 2.1.2.1 Cookies 2.1.2.2 IP Address 2.1.2.3 Browser Configuration

Matwin, Stan

176

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

177

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

178

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

179

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

180

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.

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

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

182

Google.org-Backed Potter Drilling Blazing Geothermal Trail |...  

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

Other Agencies You are here Home Google.org-Backed Potter Drilling Blazing Geothermal Trail Google.org-Backed Potter Drilling Blazing Geothermal Trail September 22, 2010...

183

Google Crisis Map for Hurricane Sandy | Department of Energy  

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

Map for Hurricane Sandy Google Crisis Map for Hurricane Sandy The Google Crisis Map has power outage information, shelter and recovery centers, local emergency Twitter feeds,...

184

INL's Move to Google Apps Enables Flexibility, Scalability |...  

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

INL's Move to Google Apps Enables Flexibility, Scalability INL's Move to Google Apps Enables Flexibility, Scalability December 7, 2011 - 1:42pm Addthis Brent Stacey, Chief...

185

Secretary Chu Announces New Funding and Partnership with Google...  

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

Funding and Partnership with Google to Promote Electric Vehicles Secretary Chu Announces New Funding and Partnership with Google to Promote Electric Vehicles April 19, 2011 -...

186

NEHRP - Northern California LiDAR Hillshades in Google ...  

Science Conference Proceedings (OSTI)

Library. Northern California LiDAR Hillshades in Google Earth. ... Increasing the disk cache size in Google Earth to 2000MB is advised. ...

187

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

188

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

189

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

190

Google scholar's ranking algorithm: The impact of citation counts (an empirical study). to be published  

E-Print Network (OSTI)

Google Scholar is one of the major academic search engines but its ranking algorithm for academic articles is unknown. In recent studies we partly reverse-engineered the algorithm. This paper presents the results of our third study. While the first study provided a broad overview and the second study focused on researching the impact of citation counts, the current study focused on analyzing the correlation of an articles age and its ranking in Google Scholar. In other words, it was analyzed if older/recent published articles are more/less likely to appear in a top position in Google Scholars result lists. For our study, age and rankings of 1,099,749 articles retrieved via 2,100 search queries were analyzed. The analysis revealed that an articles age seems to play no significant role in Google Scholars ranking algorithm. It is also discussed why this might lead to a suboptimal ranking. 1.

Jran Beel

2009-01-01T23:59:59.000Z

191

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

192

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

193

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

194

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

195

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

196

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 Leclre; Nicolas Moreau

2008-07-01T23:59:59.000Z

197

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

198

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

199

Discovering groups of people in Google news  

Science Conference Proceedings (OSTI)

In this paper, we study the problem of content-based social network discovery among people who frequently appear in world news. Google news is used as the source of data. We describe a probabilistic framework for associating people with groups. A low-dimensional ... Keywords: probabilistic latent semantic indexing, social network analysis, text mining, topic evolution

Dhiraj Joshi; Daniel Gatica-Perez

2006-10-01T23:59:59.000Z

200

May 2009 Page 1 Google General Searching  

E-Print Network (OSTI)

more to open Alerts. Type or copy search terms (use keywords or any of these tips) and set options domain such as .gov, .edu, or from a specific website, e.g., on the Adv Search form, enter cdc.gov or useTips May 2009 Page 1 Google ­ General Searching Tip #1: Phrase: Use quotation marks to keep words

California at San Diego, University of

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

Google your math : sustaining a sociocultural environment through collaborative online participation in algebra  

E-Print Network (OSTI)

Google Your Math: Sustaining aImplementation and Revision of Google Your Math Google Your Math<<<<<<<. VIII.

Samaniego, Kimberly Anne OBrien

2010-01-01T23:59:59.000Z

202

Google's PageRank: The Math Behind the Search Engine  

E-Print Network (OSTI)

Google's PageRank: The Math Behind the Search Engine Rebecca S. Wills Department of Mathematics on a given day. Even though there are many internet search engines, Google, Yahoo!, and MSN receive over 81 equals that of Google [11], Google continues to thrive as the search engine of choice receiving over 46

Lakoba, Taras I.

203

Google's Loss: The Public's Gain APRIL 28, 2011  

E-Print Network (OSTI)

Google's Loss: The Public's Gain APRIL 28, 2011 Robert Darnton Musée du Louvre, Paris Jean a postmortem on Google's attempt to digitize and sell millions of books, despite the decision by Judge Denny Chin on March 23 to reject the agreement that seemed to make Google's project possible. Google Book

Hofri, Micha

204

COMUNICATO STAMPA La Sapienza sale sulla "nuvola" di Google  

E-Print Network (OSTI)

COMUNICATO STAMPA La Sapienza sale sulla "nuvola" di Google Sarà la più grande comunità di studenti in Europa interconnessa grazie ai servizi cloud Google Apps for Education Roma, 28 febbraio 2012 ­ Google e Internet Google Apps for Education. Ogni studente avrà da subito una propria casella email accessibile da

Di Pillo, Gianni

205

Minimizing Change Aversion for the Google Drive Launch  

E-Print Network (OSTI)

Minimizing Change Aversion for the Google Drive Launch Abstract Change aversion is a natural of the Google Docs List to Google Drive, a product for file storage in the cloud. We describe actions­May 2, 2013, Paris, France. ACM 978-1-4503-1952-2/13/04. Aaron Sedley Google, Inc. 1600 Amphitheatre

Cortes, Corinna

206

Energy Secretary Steven Chu to host DOE's first google hangout at 2 EST |  

Open Energy Info (EERE)

Energy Secretary Steven Chu to host DOE's first google hangout at 2 EST Energy Secretary Steven Chu to host DOE's first google hangout at 2 EST Home > Groups > OpenEI Community Central Graham7781's picture Submitted by Graham7781(1992) Super contributor 21 February, 2013 - 15:32 DOE energy secretary google hangout OpenEI Solar Power Steven Chu Sunshot Initiative The DOE Energy Secretary Steven Chu will be hosting a google hangout open to the public tomorrow afternoon to answer questions related to the Sunshot Initiative. More about the Google Hangout tomorrow: "InFebruary 2011, Energy Secretary Steven Chu launched the SunShot Initiative -- a national endeavor to get solar cost-competitive with fossil fuels and without subsidies by the end of the decade. Just two years later, we've made remarkable progress in accelerating the development of

207

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

208

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

209

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

210

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

211

result formats | OpenEI Community  

Open Energy Info (EERE)

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

212

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

213

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

214

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

215

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

216

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

217

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

218

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

219

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

220

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

Stphane Grumbach; Philippe Rigaux; Luc Segoufin

1998-06-01T23:59:59.000Z

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

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

222

Google's Deep-Web Crawl Jayant Madhavan David Ko Lucja Kot  

E-Print Network (OSTI)

Google's Deep-Web Crawl Jayant Madhavan David Ko Lucja Kot Google Inc. Google Inc. Cornell University jayant@google.com dko@google.com lucja@cs.cornell.edu Vignesh Ganapathy Alex Rasmussen Alon Halevy Google Inc. University of California, San Diego Google Inc. vignesh@google.com arasmuss

Halevy, Alon

223

Join a White House Google+ Hangout with Energy Secretary Moniz...  

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

Join a White House Google+ Hangout with Energy Secretary Moniz & EPA Administrator McCarthy Moderated by Grist Join a White House Google+ Hangout with Energy Secretary Moniz & EPA...

224

Google and the proper antitrust scrutiny of orphan books  

E-Print Network (OSTI)

We examine the consumer-welfare implications of Google's project to scan a large proportion of the world's books into digital form and to make these works accessible to consumers through Google Book Search (GBS). In response ...

Hausman, Jerry A.

225

T-711: Fraudulent Google Digital Certificates Could Allow Man...  

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

11: Fraudulent Google Digital Certificates Could Allow Man-in-the-Middle Attacks T-711: Fraudulent Google Digital Certificates Could Allow Man-in-the-Middle Attacks September 7,...

226

T-574: Google Chrome Multiple Flaws Let Remote Users Execute...  

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

4: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code T-574: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code March 10, 2011 - 3:05pm Addthis...

227

This Thursday: Google+ Hangout on Securing the Smart Grid | Department...  

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

This Thursday: Google+ Hangout on Securing the Smart Grid This Thursday: Google+ Hangout on Securing the Smart Grid May 14, 2013 - 1:54pm Addthis April Saylor April Saylor Former...

228

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

229

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

230

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

231

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

232

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

233

Supporting our scientists with Google Earth-based UIs.  

SciTech Connect

Google Earth and Google Maps are incredibly useful for researchers looking for easily-digestible displays of data. This presentation will provide a step-by-step tutorial on how to begin using Google Earth to create tools that further the mission of the DOE national lab complex.

Scott, Janine

2010-10-01T23:59:59.000Z

234

Campus leaders see huge potential in Google's plans  

E-Print Network (OSTI)

Campus leaders see huge potential in Google's plans to make Kansas City, Kan., the pilot for its superfast Internet service. Exactly what that poten- tial is, no one knows for cer- tain, not even Google 35 percent of capacity. And now Google wants to put that same 1 gig pipeline into most homes and busi

Albertini, David

235

GOOGLE BOOK SEARCH & THE FUTURE OF BOOKS IN  

E-Print Network (OSTI)

1 GOOGLE BOOK SEARCH & THE FUTURE OF BOOKS IN CYBERSPACE Pamela Samuelson, Berkeley Law School IP would get paid for their works ­ Google could recoup its costs by commercializing the books ­ We expect Google to price things low because that's what they've done so far so library fears seemed exaggerated

Sadoulet, Elisabeth

236

Burning Man at Google: a cultural infrastructure for  

E-Print Network (OSTI)

Burning Man at Google: a cultural infrastructure for new media production FRED TURNER Stanford's bohemian ethos supports new forms of production emerging in SiliconValley and especially at Google to shape and legitimate the collaborative manufacturing processes driving the growth of Google and other

Straight, Aaron

237

Map data 2012 Google -Walking directions are in beta.  

E-Print Network (OSTI)

Map data ©2012 Google - Walking directions are in beta. Use caution ­ This route may be missing route accordingly. You must obey all signs or notices regarding your route. Map data ©2012 Google Hilton. Hilton Garden Inn West Lafayette Wabash Landing, 356 ... http://maps.google.com/ 1 of 1 06/29/2012 09

238

January 29, 2011 Google Finds It Hard to Reinvent  

E-Print Network (OSTI)

January 29, 2011 Google Finds It Hard to Reinvent Philanthropy By STEPHANIE STROM and MIGUEL HELFT JUST before Google first sold its shares to the public in 2004, Larry Page, one of its founders of Google's profits, 1 percent of its equity and a significant amount of its employees' time to the effort

Snider, Barry B.

239

Google Sky, WorldWide Telescope & Celestia in the  

E-Print Network (OSTI)

Google Sky, WorldWide Telescope & Celestia in the Undergraduate Non-Science Major Classroom & Lab of Public Outreach Dept.Astronomy & Astrophysics University of Chicago Sky #12;Google Sky, World interactive labs and self-directed modules that utilize new, emerging, software tools, specifically Google Sky

Collar, Juan I.

240

Google matrix analysis of DNA sequences Vivek Kandiah1  

E-Print Network (OSTI)

1 Google matrix analysis of DNA sequences Vivek Kandiah1 , Dima L. Shepelyansky1, 1 Laboratoire de.quantware.ups-tlse.fr/dima Abstract For DNA sequences of various species we construct the Google matrix G of Markov tran- sitions their statistical similarity from the view point of Markov chains. The properties of other eigenstates of the Google

Shepelyansky, Dima

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

Google's Auction for Radio and TV Ads Preliminary version  

E-Print Network (OSTI)

Google's Auction for Radio and TV Ads Preliminary version Noam Nisan Jason Bayer Deepak Chandra Tal Franji Robert Gardner Yossi Matias Neil Rhodes Misha Seltzer Danny Tom Hal Varian Dan Zigmond Google Inc. Abstract This document describes the auction system used by Google for allocation and pricing of TV ads

Cortes, Corinna

242

Google Energy's Shift into Renewables case 1-429-226  

E-Print Network (OSTI)

Google Energy's Shift into Renewables case 1-429-226 April 3, 2012 Published by Globa rather than to illustrate either effective or ineffective handling of an administrative situation. Google is not a conventional company. We do not intend to become one. --Co-founder Larry Page, before Google's IPO in 2004

Edwards, Paul N.

243

Is the Proposed Google Book Settlement "Fair"? Pamela Samuelson*  

E-Print Network (OSTI)

1 Is the Proposed Google Book Settlement "Fair"? Pamela Samuelson* Introduction Class action.1 The class at issue in the Authors Guild v. Google case now consists of all owners of copyrights settlement of the Authors Guild v. Google lawsuit.3 A ruling on this settlement is expected in the late

Sadoulet, Elisabeth

244

Google Search Web www.nanotech-now.com  

E-Print Network (OSTI)

Google Search Web www.nanotech-now.com Our NanoNews Digest Sponsors www.pcb123.com Feedback - Ads by Google Home > Press > Researchers bend light through waveguides in colloidal crystals Abstract news from around the world, FREE Full Name Email Address Subscribe Ads by Google Nano News MEMS News

Braun, Paul

245

Google Explores the 10th Mermaids and Sea Serpents  

E-Print Network (OSTI)

Google Explores the 10th Planet Mermaids and Sea Serpents NASA has spent tens of billions of Planet Earth and Planet Ocean is highlighted by the computer program and image repository Google Earth altimeter data may be used to predict bathymetry at a scale of 6-9 km. The ability to use Google Earth below

Vernon, Frank

246

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

247

U-122 Google Chrome Two Code Execution Vulnerabilities | Department of  

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

2 Google Chrome Two Code Execution Vulnerabilities 2 Google Chrome Two Code Execution Vulnerabilities U-122 Google Chrome Two Code Execution Vulnerabilities March 12, 2012 - 7:00am Addthis PROBLEM: Google Chrome Two Code Execution Vulnerabilities PLATFORM: Google Chrome 17.x ABSTRACT: Two vulnerabilities have been reported in Google Chrome, which can be exploited by malicious people to compromise a user's system. reference LINKS: Secunia Advisory SA48321 SecurityTracker Alert ID: 1026776 CVE-2011-3046 IMPACT ASSESSMENT: High Discussion: A vulnerability was reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system. A remote user can create specially crafted HTML that, when loaded by the target user, will trigger an unspecified flaw and execute arbitrary code (outside of the

248

U-100: Google Chrome Multiple Vulnerabilities | Department of Energy  

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

0: Google Chrome Multiple Vulnerabilities 0: Google Chrome Multiple Vulnerabilities U-100: Google Chrome Multiple Vulnerabilities February 10, 2012 - 7:00am Addthis PROBLEM: Multiple vulnerabilities have been reported in Google Chrome, where some have an unknown impact and others can be exploited by malicious people to bypass certain security restrictions, manipulate certain data, and compromise a user's system. PLATFORM: Google Chrome 16.x ABSTRACT: A remote user can create a specially crafted content that, when loaded by the target user, will execute arbitrary code on the target system. The code will run with the privileges of the target user. Reference LINKS: Google Announcements and Release Channel Secunia Advisory SA47938 Security Tracker ID 1026654 IMPACT ASSESSMENT: High Discussion: Multiple vulnerabilities have been reported in Google Chrome, where some

249

V-208: Google Chrome Multiple Vulnerabilities | Department of Energy  

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

8: Google Chrome Multiple Vulnerabilities 8: Google Chrome Multiple Vulnerabilities V-208: Google Chrome Multiple Vulnerabilities August 1, 2013 - 2:32am Addthis PROBLEM: Multiple unspecified vulnerabilities in Google Chrome before 28.0.1500.95 allow attackers to cause a denial of service or possibly have other impact via unknown vectors. PLATFORM: Google Chrome 28.x ABSTRACT: Some vulnerabilities have been reported in Google Chrome which allows attackers to access and compromise a user's system. REFERENCE LINKS: Secunia Advisory SA54325 CVE-2013-2881 CVE-2013-2882 CVE-2013-2883 CVE-2013-2884 CVE-2013-2885 CVE-2013-2886 IMPACT ASSESSMENT: High DISCUSSION: Several vulnerabilities have been reported in Google Chrome, where some have an unknown impact and others can be exploited by malicious people to

250

U-249: Google Chrome Multiple Vulnerabilities | Department of Energy  

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

49: Google Chrome Multiple Vulnerabilities 49: Google Chrome Multiple Vulnerabilities U-249: Google Chrome Multiple Vulnerabilities August 31, 2012 - 6:00am Addthis PROBLEM: Google Chrome Multiple Vulnerabilities PLATFORM: Google Chrome 21.x ABSTRACT: Multiple vulnerabilities have been reported in Google Chrome. reference LINKS: Secunia Advisory SA50447 Stable Channel Update CVE-2012-2865 CVE-2012-2866 CVE-2012-2867 CVE-2012-2868 CVE-2012-2869 CVE-2012-2870 CVE-2012-2871 CVE-2012-2872 IMPACT ASSESSMENT: High Discussion: Multiple vulnerabilities have been reported in Google Chrome, where some have an unknown impact and others can be exploited by malicious people to conduct cross-site scripting attacks and compromise a user's system. 1) An out-of-bounds read error exists when handling line breaks. 2) A bad cast error exists within run-ins.

251

V-105: Google Chrome Multiple Vulnerabilities | Department of Energy  

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

5: Google Chrome Multiple Vulnerabilities 5: Google Chrome Multiple Vulnerabilities V-105: Google Chrome Multiple Vulnerabilities March 6, 2013 - 12:09am Addthis PROBLEM: Google Chrome Multiple Vulnerabilities PLATFORM: Google Chrome prior to 25.0.1364.152. ABSTRACT: Multiple vulnerabilities have been reported in Google Chrome REFERENCE LINKS: Stable Channel Update Secunia Advisory SA52454 CVE-2013-0902 CVE-2013-0903 CVE-2013-0904 CVE-2013-0905 CVE-2013-0906 CVE-2013-0907 CVE-2013-0908 CVE-2013-0909 CVE-2013-0910 CVE-2013-0911 IMPACT ASSESSMENT: High DISCUSSION: Multiple vulnerabilities in Google Chrome may have an unknown impact and others can be exploited by malicious people to compromise a user's system. 1) A use-after-free error exists in frame loader. 2) A use-after-free error exists in browser navigation handling.

252

Google Web APIs - an Instrument for Webometric Analyses?  

E-Print Network (OSTI)

Introduction The analysis of the Internet and its applications touches upon varied fields of research such as information science, computer science, economics, and psychology. One reason for the growing scientific interest in the Internet is the already high and still growing amount of web users, applications, contents, and web servers worldwide. Despite a variety of different search engines, there is no doubt about the predominance of Google search engine technology today. Among the factors that have added decisively to Google's success are that over a long period of time, Google has offered the largest index, innovative new services and highly optimized performance and usability. This poster introduces Google Web APIs (Google APIs) as an instrument and playground for webometric studies. Several examples of Google APIs implementations are given. Our examples show that this Google Web Service can be used successfully for informetric Internet based studies albeit with some restriction

Philipp Mayr; Fabio Tosques

2005-01-01T23:59:59.000Z

253

Quantum Google in a Complex Network  

E-Print Network (OSTI)

We investigate the behavior of the recently proposed quantum Google algorithm, or quantum PageRank, in large complex networks. Applying the quantum algorithm to a part of the real World Wide Web, we find that the algorithm is able to univocally reveal the underlying scale-free topology of the network and to clearly identify and order the most relevant nodes (hubs) of the graph according to their importance in the network structure. Moreover, our results show that the quantum PageRank algorithm generically leads to changes in the hierarchy of nodes. In addition, as compared to its classical counterpart, the quantum algorithm is capable to clearly highlight the structure of secondary hubs of the network, and to partially resolve the degeneracy in importance of the low lying part of the list of rankings, which represents a typical shortcoming of the classical PageRank algorithm. Complementary to this study, our analysis shows that the algorithm is able to clearly distinguish scale-free networks from other widespread and important classes of complex networks, such as Erd\\H{o}s-R\\'enyi networks and hierarchical graphs. We show that the ranking capabilities of the quantum PageRank algorithm are related to an increased stability with respect to a variation of the damping parameter $\\alpha$ that appears in the Google algorithm, and to a more clearly pronounced power-law behavior in the distribution of importance among the nodes, as compared to the classical algorithm. Finally, we study to which extent the increased sensitivity of the quantum algorithm persists under coordinated attacks of the most important nodes in scale-free and Erd\\H{o}s-R\\'enyi random graphs.

G. D. Paparo; M. Mueller; F. Comellas; M. A. Martin-Delgado

2013-03-15T23:59:59.000Z

254

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

255

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

256

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

257

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

258

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

259

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

260

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

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

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

262

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

263

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

264

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

265

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

266

Update: Idaho National Laboratory Goes Google | Department of Energy  

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

Update: Idaho National Laboratory Goes Google Update: Idaho National Laboratory Goes Google Update: Idaho National Laboratory Goes Google August 27, 2012 - 3:38pm Addthis In August, INL moved more than 4,000 employees to Google Apps for Government - a first step in our overall cloud integration strategy to support INL with enhanced communication and collaboration to meet mission needs. As part of INL's High Performance Workplace initiative, Google Apps for Government has been implemented at Idaho National Laboratory (INL). Located in southeastern Idaho on nearly 900 square miles of desert, INL supports the U.S. Department of Energy's mission in nuclear energy, energy and environment, and national and homeland security research. As part of INL's approach to invest in capability rather than a technology, Google Apps for Government is a FISMA moderate cloud solution

267

V-038: Google Chrome Two Vulnerabilities | Department of Energy  

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

8: Google Chrome Two Vulnerabilities 8: Google Chrome Two Vulnerabilities V-038: Google Chrome Two Vulnerabilities December 3, 2012 - 1:00am Addthis PROBLEM: Google Chrome Two Vulnerabilities PLATFORM: The vulnerabilities are reported in versions prior to 23.0.1271.95. ABSTRACT: Two vulnerabilities have been reported in Google Chrome REFERENCE LINKS: Stable Channel Update Secunia Advisory SA51447 CVE-2012-5137 CVE-2012-5138 IMPACT ASSESSMENT: High DISCUSSION: Two vulnerabilities have been reported in Google Chrome, where one has an unknown impact and the other can be exploited by malicious people to compromise a user's system. 1) An error exists when handling file paths. 2) A use-after-free error exists when handling media sources. The vulnerabilities are reported in versions prior to 23.0.1271.95. IMPACT:

268

V-121: Google Chrome Multiple Vulnerabilities | Department of Energy  

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

1: Google Chrome Multiple Vulnerabilities 1: Google Chrome Multiple Vulnerabilities V-121: Google Chrome Multiple Vulnerabilities March 28, 2013 - 12:29am Addthis PROBLEM: Google Chrome Multiple Vulnerabilities PLATFORM: versions prior to 26.0.1410.43. ABSTRACT: Multiple vulnerabilities have been reported in Google Chrome REFERENCE LINKS: Secunia Advisory SA52761 CVE-2013-0916 CVE-2013-0917 CVE-2013-0918 CVE-2013-0919 CVE-2013-0920 CVE-2013-0921 CVE-2013-0922 CVE-2013-0923 CVE-2013-0924 CVE-2013-0925 CVE-2013-0926 IMPACT ASSESSMENT: High DISCUSSION: Multiple vulnerabilities have been reported in Google Chrome, where one has an unknown impact and others can be exploited by malicious people to bypass certain security restrictions and compromise a user's system. IMPACT: 1) A use-after-free error exists in Web Audio.

269

V-097: Google Chrome Multiple Vulnerabilities | Department of Energy  

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

7: Google Chrome Multiple Vulnerabilities 7: Google Chrome Multiple Vulnerabilities V-097: Google Chrome Multiple Vulnerabilities February 22, 2013 - 6:00am Addthis PROBLEM: Multiple vulnerabilities have been reported in Google Chrome PLATFORM: The vulnerabilities are reported in versions prior to Google Chrome 24.x ABSTRACT: Multiple vulnerabilities have been reported in Google Chrome, where some have an unknown impact and others can be exploited by malicious people to bypass certain security restrictions and compromise a user's system. REFERENCE LINKS: Secunia Advisory SA52320 Chrome Stable Channel Update CVE-2013-0879 CVE-2013-0880 CVE-2013-0881 CVE-2013-0882 CVE-2013-0883 CVE-2013-0884 CVE-2013-0885 CVE-2013-0886 CVE-2013-0887 CVE-2013-0888 CVE-2013-0889 CVE-2013-0890 CVE-2013-0891 CVE-2013-0892 CVE-2013-0893

270

V-116: Google Picasa BMP and TIFF Images Processing Vulnerabilities |  

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

6: Google Picasa BMP and TIFF Images Processing Vulnerabilities 6: Google Picasa BMP and TIFF Images Processing Vulnerabilities V-116: Google Picasa BMP and TIFF Images Processing Vulnerabilities March 21, 2013 - 6:00am Addthis PROBLEM: Two vulnerabilities have been discovered in Google Picasa PLATFORM: Google Picasa Version 3.9.0 build 136.09 for Windows/3.9.14.34 for Mac ABSTRACT: Two vulnerabilities have been discovered in Google Picasa, which can be exploited by malicious people to compromise a user's system. REFERENCE LINKS: Secunia Advisory SA51652 Picasa Release Notes IMPACT ASSESSMENT: High DISCUSSION: 1) A sign extension error when processing the color table of a BMP image can be exploited to cause a heap-based buffer overflow via a BMP image with a specially crafted "biBitCount" field. 2) The application bundles a vulnerable version of LibTIFF.

271

V-224: Google Chrome Multiple Vulnerabilities | Department of Energy  

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

4: Google Chrome Multiple Vulnerabilities 4: Google Chrome Multiple Vulnerabilities V-224: Google Chrome Multiple Vulnerabilities August 22, 2013 - 1:05am Addthis PROBLEM: Multiple vulnerabilities have been reported in Google Chrome, where some have an unknown impact and others can be exploited by malicious, local users to disclose potentially sensitive information and by malicious people to compromise a user's system. PLATFORM: Google Chrome 28.x ABSTRACT: The vulnerabilities are reported in versions prior to 29.0.1547.57 REFERENCE LINKS: Secunia Advisory ID: 1028921 CVE-2013-2887 CVE-2013-2900 CVE-2013-2901 CVE-2013-2902 CVE-2013-2903 CVE-2013-2904 CVE-2013-2905 IMPACT ASSESSMENT: High DISCUSSION: Multiple vulnerabilities have been reported in Google Chrome, where some have an unknown impact and others can be exploited by malicious, local users to disclose

272

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

273

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

274

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

275

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

276

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

277

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

278

NIST Paper Submission Abstract _CT-Google _DRAFT _Feb 6 ...  

Science Conference Proceedings (OSTI)

DigiCert-Google Abstract Certificate Transparency Submitted for NIST Workshop to be held April 10-11, 2013 Submitted February 15, 2013 ...

2013-03-12T23:59:59.000Z

279

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

280

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

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

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

282

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

283

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

284

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; Jrgen Umbrich

2010-04-01T23:59:59.000Z

285

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

286

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

287

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

288

Google Maps -highland hospital rochester new york http://maps.google.com/ 1 of 2 9/29/05 13:21  

E-Print Network (OSTI)

Google Maps - highland hospital rochester new york http://maps.google.com/ 1 of 2 9/29/05 13 Hospital: Gift Shop 1000 South Ave, Rochester, NY 14620 (585) 341-8040 - 1.4 mi S Google Maps highland hospital rochester new york #12;Google Maps - highland hospital rochester new york http://maps.google

Richmond, Michael W.

289

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

290

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

291

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

292

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

293

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

294

Tracing the Birth of an OSN: Social Graph and Profile Analysis in Google+  

E-Print Network (OSTI)

Tracing the Birth of an OSN: Social Graph and Profile Analysis in Google+ Doris Schi¨oberg Fabian of Google launch- ing the Google+ OSN. Through multiple crawls of the Google+ OSN, before and after of the birth of an OSN. Our findings underline the impact of peculiar aspects of Google+ such as (a) Google

Schmid, Stefan

295

Let us compare Google+ with existing social networks. 5. Take-Aways  

E-Print Network (OSTI)

Let us compare Google+ with existing social networks. 5. Take-Aways 4. Public Profiles Google for roughly 25% of all Google+ users. 1. What is interesting about Google+? 2. Background and Methodology Google launched Google+ on June 28, 2011 as a so called beta-test. An invitation was necessary to join

Schmid, Stefan

296

Searching for Googles Value: Using Prediction Markets to Forecast Market Capitalization Prior to an Initial Public Offering  

E-Print Network (OSTI)

IPO underpricing is endemic. Many theories have been developed to explain it. To inform theory and to investigate the practical application of prediction markets in an IPO setting, we conducted markets designed to forecast post-IPO valuations before a particularly unique IPO: Google. The combination of results from these markets and the unique features of the IPO help us distinguish between underpricing theories. The evidence leans against theories which require large payments to buyers to overcome problems of asymmetric information between issuers and buyers. It is most consistent with theories where underpricing is in exchange for future benefits. The prediction market results also show that it is possible to forecast post-IPO market values and, therefore, avoid losses associated with underpricing when a firm wishes to do so.

unknown authors

2005-01-01T23:59:59.000Z

297

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

298

Google+ Hangout Energy 101: Fuel Cells | Department of Energy  

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

Google+ Hangout Energy 101: Fuel Cells Google+ Hangout Energy 101: Fuel Cells Google+ Hangout Energy 101: Fuel Cells Watch a Google+ Hangout on Energy 101: Fuel Cells on Thursday, January 16, at 2 p.m. ET. If the video doesn't start at 2 p.m., you might need to refresh your browser. Join us on Thursday, January 16, at 2 p.m. ET for a Google+ Hangout on Energy 101: Fuel Cells. Whether you want to know about how they work or when fuel cell electric vehicles will hit the road or how much fuel cells could reduce carbon pollution, now is your chance to ask the experts. Joining the live discussion will be: Dr. Sunita Satyapal, Director of the Energy Department's Fuel Cell Technologies Office. Satyapal can answer questions about how fuel cells work, growth in the marketplace and the Energy Department's role in

299

Google Book Search: Document understanding on a massive scale  

E-Print Network (OSTI)

Unveiled in late 2004, Google Book Search is an ambitious program to make all the worlds books discoverable online. The sheer scale of the problem brings a number of unique document analysis and understanding challenges that are outlined in this paper. We also go over some of the ways that Google is working with the document analysis research community to help push the state of the art. Google Book Search started as a dream: the dream by Google co-founders Larry Page and Sergey Brin that one day, all the worlds books might be discoverable online, through a kind of electronic and distributed Library of Alexandria. Today, thanks to advances in scanning and storage technology, to significant investment by Google and to a lot of hard work by a lot of dedicated Googlers and partners, this dream is well on its way to becoming a reality. Google Book Search, originally named Google Print, was launched in late 2004. Over a million books have been scanned to date and Google Book Search is already the largest Virtual Card Catalog in existence. Google Book Search is a huge endeavor: estimates for the number of books ever published range from 50 millions to 200 millions, and well over 100,000 new books are published annually. Making a significant dent at scanning or acquiring this content in electronic form has required a multifaceted aproach. First, partnerships with publishers were established, allowing Gogle to get access to mostly recent books directly from publishers. Second, our Library Program was put in place and Google entered into agreements with a number of libraries to scan their collections. Four major libraries joined the program when it was unveiled over two years ago and to date, over twenty libraries have signed up. More details are available at

Luc Vincent

2007-01-01T23:59:59.000Z

300

GOOgle Features and anatomY (GOOFY) Project Proposal  

E-Print Network (OSTI)

Google is a huge and powerful search engine. It provides lots of services e.g.: Google Directory, Google Groups, Google Scholar, etc. I dont want to present them as theyre easy to find. What Id like to show are system features and system anatomy. How does it work? How did it start? When does it fail? More and less common knowledge about Google. 2 Project Stages 1. history + common knowledge (total 2h- already done + 1h presentation) authors, name, place, motivation- mainly taken from the first paper about Google [?] improvement over the years 2. system features (total- 12h + 2h presentation) PageRank- read [?], search for modern algorithms 6h anchor texts- how do they use them? 2h other features 4h 3. system anatomy (architecture) (total 12h + 2h presentation) architecture overview from [?] 1h- already done data structures from [?] 3h crawlers 5h indexers 3h 4. problems, failures (total>9h + 2h presentation) problems with PageRank- anyone can get you! 3h Search Engine Optimization (SEO)- how can you trick Google? 6h anything interesting I find during searching for above xh 3

Anna Moleda

2005-01-01T23:59:59.000Z

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

Google matrix and Ulam networks of intermittency maps  

E-Print Network (OSTI)

We study the properties of the Google matrix of an Ulam network generated by intermittency maps. This network is created by the Ulam method which gives a matrix approximant for the Perron-Frobenius operator of dynamical map. The spectral properties of eigenvalues and eigenvectors of this matrix are analyzed. We show that the PageRank of the system is characterized by a power law decay with the exponent $\\beta$ dependent on map parameters and the Google damping factor $\\alpha$. Under certain conditions the PageRank is completely delocalized so that the Google search in such a situation becomes inefficient.

Leonardo Ermann; Dima D. L. Shepelyansky

2009-11-19T23:59:59.000Z

302

Google Newspaper Search Image Processing and Analysis Pipeline Krishnendu Chaudhury, Ankur Jain, Sriram Thirthala, Vivek Sahasranaman, Shobhit Saxena,  

E-Print Network (OSTI)

Google Newspaper Search ­ Image Processing and Analysis Pipeline Krishnendu Chaudhury, Ankur Jain, Sriram Thirthala, Vivek Sahasranaman, Shobhit Saxena, Selvam Mahalingam Google Engineering krish@google.com, jainaj@google.com, tvnsriram@google.com, svivek@google.com, selvam@google.com Abstract The Google

Cortes, Corinna

303

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

304

VIDEO: Watch the Solar Decathlon 2013 Google+ Hangout | Department of  

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

VIDEO: Watch the Solar Decathlon 2013 Google+ Hangout VIDEO: Watch the Solar Decathlon 2013 Google+ Hangout VIDEO: Watch the Solar Decathlon 2013 Google+ Hangout September 19, 2013 - 2:26pm Addthis Miss the Solar Decathlon 2013 Google+ Hangout? Watch a recording of it above. Rebecca Matulka Rebecca Matulka Digital Communications Specialist, Office of Public Affairs For two years, collegiate teams from around the world have been designing and building energy-efficient solar-powered houses for the U.S. Department of Energy Solar Decathlon 2013. With the competition just two weeks away, many teams are busy putting the final touches on their houses and preparing to transport them to the competition site in Irvine, California. Yesterday, team members from Arizona State University and the University of New Mexico, Santa Clara University, Team Alberta, Team Capitol DC and

305

Video: Watch the Open Data Google+ Hangout | Department of Energy  

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

Watch the Open Data Google+ Hangout Watch the Open Data Google+ Hangout Video: Watch the Open Data Google+ Hangout February 21, 2013 - 5:10pm Addthis Did you miss our open data hangout? View it here. Matthew Loveless Matthew Loveless Data Integration Specialist, Office of Public Affairs Want more info? Check out these open data resources. Thank you to everyone who tuned in to our Google+ Hangout on the "Impact of Open Data." If you weren't able to attend, a recording of the discussion is available above. We hope to offer many more Hangouts with Energy Department and private sector energy experts, so check out Energy.gov/Live for upcoming events. In case you missed it, "open data" means data that is not only available, but also accessible. The value of open data is empowering building owners,

306

Using prediction markets to track information flows: Evidence from Google  

E-Print Network (OSTI)

In the last three years, Google has conducted the largest corporate experiment with prediction markets we are aware of. In this paper, we illustrate how markets can be used to study how an organization processes information. We document a number of biases in Googles markets, most notably an optimistic bias. Newly hired employees are on the optimistic side of these markets, and optimistic biases are significantly more pronounced on days when Google stock is appreciating. We find correlated trading among employees who sit within a few feet of one another and employees with social or work relationships. The results are interesting in light of recent research on the role of optimism in entrepreneurial firms, as well as recent work on the importance of geographic and social proximity in explaining information flows in firms and markets. 1

Bo Cowgill; Justin Wolfers; Wharton U. Penn; Eric Zitzewitz; Ulrike Malmendier; Kevin M. Murphy; Michael Ostrovsky; Paul Oyer; Parag Pathak; Tanya Rosenblat

2008-01-01T23:59:59.000Z

307

Improving search quality of the Google search appliance  

E-Print Network (OSTI)

In this thesis, we describe various experiments on the ranking function of the Google Search Appliance to improve search quality. An evolutionary computation framework is implemented and applied to optimize various parameter ...

Nguyen, Huy, M. Eng (Huy Le). Massachusetts Institute of Technology

2009-01-01T23:59:59.000Z

308

U-220: Google Android DNS Resolver Randomization Flaw Lets Remote...  

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

Off-by-one Bug Lets Remote Users Deny Service U-271: Google Android Dialer TEL URL Handling Flaw Lets Remote Users Deny Service V-065: Adobe Flash Player Buffer Overflow...

309

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 Krll; Christian Krner

2009-01-01T23:59:59.000Z

310

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

311

Still All on One Server: Perforce at Scale Dan Bloch, Google Inc.  

E-Print Network (OSTI)

Still All on One Server: Perforce at Scale Dan Bloch, Google Inc. May 21, 2011 Abstract Google runs. Perforce at Google Google's main Perforce server supports over twelve thousand users, has more than in the low hundreds of thousands of files. We have a single large depot with almost all of Google's projects

Cortes, Corinna

312

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

313

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

314

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

315

Form EIA-176 Query System - Energy Information Administration  

U.S. Energy Information Administration (EIA)

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

316

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

317

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

318

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.

319

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

320

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

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

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

322

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

323

Google your math : sustaining a sociocultural environment through collaborative online participation in algebra  

E-Print Network (OSTI)

student computer. 2. Go to Google.com and Login. 3. Find thestudent computer. 2. Go to Google.com and Login. Return tostudent computer. 2. Go to Google.com and Login. Return to

Samaniego, Kimberly Anne OBrien

2010-01-01T23:59:59.000Z

324

About Us Nanotechnology News Columns Products Directories Career Center My Account Google Search  

E-Print Network (OSTI)

About Us Nanotechnology News Columns Products Directories Career Center My Account Google Search. Bookmark: The latest news from around the world, FREE Subscribe Ads by Google Teleportation Nanotechnology.fluigent.com Ads by Google Nanotechnology Now - Press Release

Leigh, David A.

325

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

Balzs Szrnyi

2009-10-01T23:59:59.000Z

326

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

327

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

328

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

329

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

330

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

331

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

332

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

333

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

334

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

335

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

336

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

337

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

338

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.

339

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

340

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

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

Finding Alternative Water Sources for Power Plants with Google Earth |  

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

Finding Alternative Water Sources for Power Plants with Google Finding Alternative Water Sources for Power Plants with Google Earth Finding Alternative Water Sources for Power Plants with Google Earth May 29, 2013 - 12:07pm Addthis A sample image from the AWSIS system. A sample image from the AWSIS system. Gayland Barksdale Technical Writer, Office of Fossil Energy Sobering news from experts: Rising populations, regional droughts, and decreasing groundwater levels are draining the nation's fresh water supply. And it's not just that we're using that water for our personal consumption; even the electricity we rely on to power our society requires a lot of water. In fact, major energy producers - like coal-fired power plants, which produce about 40 percent of our electricity - require about 150 billion gallons of fresh water per day to produce the electricity we

342

Finding Alternative Water Sources for Power Plants with Google Earth |  

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

Finding Alternative Water Sources for Power Plants with Google Finding Alternative Water Sources for Power Plants with Google Earth Finding Alternative Water Sources for Power Plants with Google Earth May 29, 2013 - 12:07pm Addthis A sample image from the AWSIS system. A sample image from the AWSIS system. Gayland Barksdale Technical Writer, Office of Fossil Energy Sobering news from experts: Rising populations, regional droughts, and decreasing groundwater levels are draining the nation's fresh water supply. And it's not just that we're using that water for our personal consumption; even the electricity we rely on to power our society requires a lot of water. In fact, major energy producers - like coal-fired power plants, which produce about 40 percent of our electricity - require about 150 billion gallons of fresh water per day to produce the electricity we

343

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 Ludscher; Alan Nash

2004-01-01T23:59:59.000Z

344

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 searchers current state.

Katsumi Tanaka; Tetsuya Sakai

2012-01-01T23:59:59.000Z

345

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

Jrgen Krmer; Yin Yang; Michael Cammert; Bernhard Seeger; Dimitris Papadias

2006-03-01T23:59:59.000Z

346

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 systems (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 users 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. Seluk Candan

2007-01-01T23:59:59.000Z

347

Google + Hangout: Women Leading STEM October 22, 2013 | Department of  

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

Google + Hangout: Women Leading STEM October 22, 2013 Google + Hangout: Women Leading STEM October 22, 2013 Google + Hangout: Women Leading STEM October 22, 2013 September 23, 2013 6:00PM EDT There's an old axiom that you can't be what you can't see. Perhaps if you think about what inspired you to enter into your current job, or line of study, you'll recognize a role model or two that inspired you to take your current path. That's why NASA and the Energy Department are teaming up on Tuesday October 22, 2013 at 4:30pm EST to host the Women Leading STEM Google+ Hangout, showcasing women in STEM at agencies that are changing the world and addressing the serious shortage of women and girls engaged in STEM fields in the United States. Join the White House Council on Women and Girls, Women @ Energy and Women @ NASA to hear from women leading the way in transformative science,

348

Phoogle the Web - Google's Approach of Spatial Data Visualisation  

E-Print Network (OSTI)

The word "Phoogle" is an artificial word that was created for this paper and stands for Photogrammetry and Google. In this paper it is shown how these two different things - a measurement technology and an internet search machine - are connected and how this connection will open new business models.

Volker Walter; Volker Walter Stuttgart

2005-01-01T23:59:59.000Z

349

Customizing your Google Scholar Settings University of Saskatchewan Library  

E-Print Network (OSTI)

from the top of your Google Scholar screen before you enter your search terms. 3. Select Library Links screen, enter your search terms. 7. From your search results, choose Fulltext@UofSLibrary to view from the left side of the screen. 4. In the Library Links text box enter university of saskatchewan

Peak, Derek

350

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

351

Theory Research at Google Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman  

E-Print Network (OSTI)

Theory Research at Google Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman of research interest to theoretical computer scientists that arise, in particular at Google. Google presents a unique work environment for research. · Google's business comprises making accessible the information

Nisan, Noam

352

User Experience at Google Focus on the user and all else will follow  

E-Print Network (OSTI)

User Experience at Google ­ Focus on the user and all else will follow Abstract This paper presents an overview of the User Experience (UX) team at Google. We focus on four aspects of working within Google work. Keywords Google, organizational overview, user experience, design, research ACM Classification

Cortes, Corinna

353

James Kuffner (CMU/Google) ICRA2011 : Workshop on Motion Planning for Physical Robots Digital Human  

E-Print Network (OSTI)

James Kuffner (CMU/Google) ICRA2011 : Workshop on Motion Planning for Physical Robots Digital Human-time research at Google) 1 #12;James Kuffner (CMU/Google) ICRA2011 : Workshop on Motion Planning for Physical Asimo HRP2 HRP3 2 #12;James Kuffner (CMU/Google) ICRA2011 : Workshop on Motion Planning for Physical

North Carolina at Chapel Hill, University of

354

UC-eLinks and Google Scholar Setting Up Scholar Preferences  

E-Print Network (OSTI)

UC-eLinks and Google Scholar Page 1 04/08 Setting Up Scholar Preferences The University of California has worked with Google Scholar (www.scholar.google.com) to make it easy to determine if a specific interesting articles. When on campus, UC-eLinks will appear automatically in Google Scholar. If you are off

California at San Diego, University of

355

Fig.1. Google matrix of Wikipedia articles network, written in the  

E-Print Network (OSTI)

Fig.1. Google matrix of Wikipedia articles network, written in the bases of PageRank index; fragment of top 200 X 200 matrix elements is shown, total size N=3282257 (from [19]) Google matrix From Wikipedia, the free encyclopedia A Google matrix is a particular stochastic matrix that is used by Google

Shepelyansky, Dima

356

Mobile Search with Text Messages: Designing the User Experience for Google SMS  

E-Print Network (OSTI)

Mobile Search with Text Messages: Designing the User Experience for Google SMS Rudy Schusteritsch Google 1600 Amphitheatre Parkway Mountain View, CA 94043 rudy@google.com Shailendra Rao Department of Communication Stanford University Stanford, CA 94305 shailo@stanford.edu Kerry Rodden Google 1600 Amphitheatre

Cortes, Corinna

357

MMDS 08 Edward Chang, Google 1 Mining LargeMining Largescale Social Networksscale Social Networks  

E-Print Network (OSTI)

MMDS 08 Edward Chang, Google 1 Mining LargeMining Largescale Social Networksscale Social Networks Challenges & Scalable SolutionsChallenges & Scalable Solutions Edward Chang Google Research #12;MMDS 08 Edward Chang, Google 2 Collaborators · Prof. Chih-Jen Lin (NTU) · Hongjie Bai (Google) · Wen-Yen Chen

Chang, Edward Y.

358

Google: An Application of Linear Algebra (The mathematics of a great success)  

E-Print Network (OSTI)

Google: An Application of Linear Algebra (The mathematics of a great success) Peter Butkovic Peter Butkovic Google: An Application of Linear Algebra #12;Peter Butkovic Google: An Application of Linear Algebra #12;Peter Butkovic Google: An Application of Linear Algebra #12;Hyun's Map of the Web Peter

Butkovic, Peter

359

How Google is using Linked Data Today and Vision For Tomorrow  

E-Print Network (OSTI)

How Google is using Linked Data Today and Vision For Tomorrow Thomas Steiner 1 , Rapha¨el Troncy2 and Michael Hausenblas3 1 Google Germany GmbH, ABC-Str. 19, 20354 Hamburg, Germany, google.com> 2 how modern search engines, such as Google, make use of Linked Data spread in Web pages for displaying

Cortes, Corinna

360

Using RefWorks with Google Docs In your browser turn OFF Pop Up blockers  

E-Print Network (OSTI)

Using RefWorks with Google Docs In your browser turn OFF Pop Up blockers 1. Log in to Google Docs and RefWorks on separate browser Tabs. 2. Compose your document in Google Docs. When you need to insert to be cited. Copy and Paste the citation place marker with curly brackets into the Google Doc. Click "Clear

MacMillan, Andrew

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

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

362

Gmail & Calenda Lab Google Labs are experimental features that you can add to Gmail and Google Calendar to customize and enhance  

E-Print Network (OSTI)

Gmail & Calenda Lab Abo Lab Google Labs are experimental features that you can add to Gmail and Google Calendar to customize and enhance your inbox and calendar. To help you get started, we've put or Google Calendar, click Se ing > Lab . 2. For each lab you want to use, click Enable. If you want to stop

Hu, Jie

363

COMPUTER APPLICATIONS IN THE GEOSCIENCES In this lab we will use Google Earth (Part 1) and Google Earth Pro (Part 2) to  

E-Print Network (OSTI)

COMPUTER APPLICATIONS IN THE GEOSCIENCES 1 In this lab we will use Google Earth (Part 1) and Google Earth Pro (Part 2) to inspect a few different geographic regions and a large earthquake data set. In Google Earth, you will learn to create placemarks with text, web links, movies, and more. You will also

Smith-Konter, Bridget

364

Tracing the birth of an osn: Social graph and profile analysis in google  

E-Print Network (OSTI)

This paper leverages the unique opportunity of Google launching the Google+ OSN. Through multiple crawls of the Google+ OSN, before and after the official public release of the network, our results provide insights into the social graph dynamics of the birth of an OSN. Our findings underline the impact of peculiar aspects of Google+ such as (a) Googles large initial user base taken over from other Google products and (b) Google+s provision for asymmetric friendships, on its graph structure, especially in light of previously studied OSN graphs. In addition, we study the geographic distribution of the users and links of Google+, and correlate the social graph with additional information available from the public profiles.

Doris Schiberg; Fabian Schneider; Harald Schiberg; Stefan Schmid; Steve Uhlig; Anja Feldmann; Tu Berlin; Telekom Innovation Laboratories

2012-01-01T23:59:59.000Z

365

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

366

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

367

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

368

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

369

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

370

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

371

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

372

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.

373

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

374

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.

375

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

376

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

377

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

378

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

379

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

380

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

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

Sky in Google Earth: The Next Frontier in Astronomical Data Discovery and Visualization  

E-Print Network (OSTI)

Astronomy began as a visual science, first through careful observations of the sky using either an eyepiece or the naked eye, then on to the preservation of those images with photographic media and finally the digital encoding of that information via CCDs. This last step has enabled astronomy to move into a fully automated era -- where data is recorded, analyzed and interpreted often without any direct visual inspection. Sky in Google Earth completes that circle by providing an intuitive visual interface to some of the largest astronomical imaging surveys covering the full sky. By streaming imagery, catalogs, time domain data, and ancillary information directly to a user, Sky can provide the general public as well as professional and amateur astronomers alike with a wealth of information for use in education and research. We provide here a brief introduction to Sky in Google Earth, focusing on its extensible environment, how it may be integrated into the research process and how it can bring astronomical research to a broader community. With an open interface available on Linux, Mac OS X and Windows, applications developed within Sky are accessible not just within the Google framework but through any visual browser that supports the Keyhole Markup Language. We present Sky as the embodiment of a virtual telescope.

Ryan Scranton; Andrew Connolly; Simon Krughoff; Jeremy Brewer; Alberto Conti; Carol Christian; Brian McLean; Craig Sosin; Greg Coombe; Paul Heckbert

2007-09-05T23:59:59.000Z

382

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

383

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; Fabrcio F. de Faria; Sen O'Riain; Edward Curry

2013-07-01T23:59:59.000Z

384

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

385

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.

386

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.

387

11/29/2006 -10:00 am -11:30 am Room:San Polo -3503 (ISD Campus) Just Google It! -Google Earth and Autodesk MapGuide  

E-Print Network (OSTI)

11/29/2006 - 10:00 am - 11:30 am Room:San Polo - 3503 (ISD Campus) Just Google It! - Google EarthGuide with Google Earth. We will examine the steps to publish layers via MapGuide Studio and then create Google.autodesk.com/AUOnline #12;#12;Just Google It! Google Earth and MapGuide Enterprise Integration 2 Introduction Google Earth

Ahmad, Sajjad

388

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

389

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

390

Better Buildings Neighborhood Program: Workforce Development  

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

on Twitter Bookmark Better Buildings Neighborhood Program: Workforce Development on Google Bookmark Better Buildings Neighborhood Program: Workforce Development on Delicious...

391

Google search = About 145,000 results (0.09 seconds) If you have a LEGO  

E-Print Network (OSTI)

Google search = About 145,000 results (0.09 seconds) If you have a LEGO® MINDSTORMS® NXT robotics to show beginners how to design robots, an entertaining ... books.google.com Resources For more ideas

Keinan, Alon

392

T-554: Race condition in Google Chrome before 9.0.597.84 allows...  

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

4: Race condition in Google Chrome before 9.0.597.84 allows remote attackers to execute arbitrary code T-554: Race condition in Google Chrome before 9.0.597.84 allows remote...

393

U-041: Google Chrome Out-of-Bounds Write Error Lets Remote Users...  

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

1: Google Chrome Out-of-Bounds Write Error Lets Remote Users Execute Arbitrary Code U-041: Google Chrome Out-of-Bounds Write Error Lets Remote Users Execute Arbitrary Code November...

394

V-184: Google Chrome Flash Plug-in Lets Remote Users Conduct...  

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

4: Google Chrome Flash Plug-in Lets Remote Users Conduct Clickjacking Attacks V-184: Google Chrome Flash Plug-in Lets Remote Users Conduct Clickjacking Attacks June 24, 2013 -...

395

V-109: Google Chrome WebKit Type Confusion Error Lets Remote...  

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

9: Google Chrome WebKit Type Confusion Error Lets Remote Users Execute Arbitrary Code V-109: Google Chrome WebKit Type Confusion Error Lets Remote Users Execute Arbitrary Code...

396

U-271: Google Android Dialer TEL URL Handling Flaw Lets Remote...  

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

1: Google Android Dialer TEL URL Handling Flaw Lets Remote Users Deny Service U-271: Google Android Dialer TEL URL Handling Flaw Lets Remote Users Deny Service October 1, 2012 -...

397

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

398

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

399

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

400

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

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

UTILIZING GOOGLE EARTH AS A GIS PLATFORM FOR WEATHER APPLICATIONS Travis M. Smith1,2  

E-Print Network (OSTI)

UTILIZING GOOGLE EARTH AS A GIS PLATFORM FOR WEATHER APPLICATIONS Travis M. Smith1,2 and Valliappa Lakshmanan1,2 1 U. of Oklahoma/CIMMS; 2 NOAA/NSSL 1. Introduction Google Earth (formerly known as Keyhole; http://earth.google.com) is a free-for- personal-use application that streams high- resolution static

Smith, Travis

402

Finding scientific articles 1. Find a specific article using google scholar or  

E-Print Network (OSTI)

#12;Finding scientific articles 1. Find a specific article using google scholar or web of science articles 1. Find a specific article using google scholar or web of science by searching for author name using google scholar or web of science by searching for author name + title, year or journal name 2

Schweik, Charles M.

403

Google matrix and Ulam networks of intermittency maps L. Ermann and D. L. Shepelyansky  

E-Print Network (OSTI)

Google matrix and Ulam networks of intermittency maps L. Ermann and D. L. Shepelyansky Laboratoire the properties of the Google matrix of an Ulam network generated by intermittency maps. This network is createdRank of the system is characterized by a power law decay with the exponent dependent on map parameters and the Google

Giraud, Olivier

404

Why We Are Able to Google Internet and the World Web Panel, March 25, 2009  

E-Print Network (OSTI)

Why We Are Able to Google Internet and the World Web Panel, March 25, 2009 Dr. Alfred Z. Spector VP, Research and Special Initiatives Google, Inc. Internet and the World Web Panel, March 25, 2009 Computing Research that Changed the World WWhhyy WWee''rree AAbbllee ttoo #12;2 Why We're Able to Google ABSTRACT Dr

Cortes, Corinna

405

GOOGLE AND GIS INTEGRATED ON THE ARM WEBSITE: A WORK IN PROGRESS  

E-Print Network (OSTI)

GOOGLE AND GIS INTEGRATED ON THE ARM WEBSITE: A WORK IN PROGRESS A. Cialella and R. Wagener Upton, NY 11973-5000 www.bnl.gov ABSTRACT Google Maps API scripting code was embedded in the ARM Web pages to geographically represent the ACRF Sites globally. Google Maps API includes the capability

406

Google Matrix Analysis of DNA Sequences Vivek Kandiah, Dima L. Shepelyansky*  

E-Print Network (OSTI)

Google Matrix Analysis of DNA Sequences Vivek Kandiah, Dima L. Shepelyansky* Laboratoire de sequences of various species we construct the Google matrix G of Markov transitions between nearby words from the view point of Markov chains. The properties of other eigenstates of the Google matrix are also

Shepelyansky, Dima

407

Google, ou comment s'imposer comme un point de passage oblig 1. Introduction  

E-Print Network (OSTI)

Google, ou comment s'imposer comme un point de passage obligé 1. Introduction Chaque jour des centaines de millions d'internautes utilisent Google gratuitement pour effectuer leurs recherches Google est devenu une véritable passerelle entre les ressources Internet et les internautes s'imposant à

Paris-Sud XI, Université de

408

Themenvorschlag Bachelor-oder Masterarbeit 6. Februar 2013 Abhorsichere PIN Eingabe mit Google Glasses  

E-Print Network (OSTI)

Themenvorschlag Bachelor- oder Masterarbeit 6. Februar 2013 Abh¨orsichere PIN Eingabe mit Google://www.ekaay.com/PIN k¨onnte zusammmen mit der Augmented Reality Technik "Google Glasses" dazu genutzt werden, den abh Schnittstellen von "Google Glasses" zu erkun- den. Vor allem die zum Handy, denn dort sollte der Login und das

Borchert, Bernd

409

A New Tool for Information Extraction and Mining from Satellite Imagery Available from Google Maps Engine  

E-Print Network (OSTI)

n.1 A New Tool for Information Extraction and Mining from Satellite Imagery Available from Google available in web mapping service applications such as Google Maps, which now provides high information extraction and mining tasks via the Google Maps application programming interface (API). In fact

Plaza, Antonio J.

410

Data Management Projects at Google Michael Cafarella Edward Chang Andrew Fikes Alon Halevy Wilson Hsieh  

E-Print Network (OSTI)

Data Management Projects at Google Michael Cafarella Edward Chang Andrew Fikes Alon Halevy Wilson of the ongoing research projects related to structured data management at Google today. The organization of Google encourages research scientists to work closely with engineering teams. As a result, the research

Cafarella, Michael J.

411

Correct your text with Google Stephanie Jacquemont, Francois Jacquenet, Marc Sebban  

E-Print Network (OSTI)

Correct your text with Google St´ephanie Jacquemont, Franc¸ois Jacquenet, Marc Sebban Laboratoire that are identified as potential misspellings. We propose to use the Google search engine and some machine learning are used to ask some help from Google. Wondering which of the various spellings of a word is the right one

Paris-Sud XI, Université de

412

Google Book Search and the Future of Books in Cyberspace Pamela Samuelson  

E-Print Network (OSTI)

1 Google Book Search and the Future of Books in Cyberspace Pamela Samuelson INTRODUCTION One, is the massive digitization project that Google, Inc. has undertaken in partnership with more than forty major research libraries and thirty thousand publishers.1 Google has already scanned and digitized the contents

Sadoulet, Elisabeth

413

Integrated Google Maps and Smooth Street View Videos for Route Planning National Taiwan University  

E-Print Network (OSTI)

Integrated Google Maps and Smooth Street View Videos for Route Planning Chi Peng National Taiwan that takes start and end points as the input, and will automatically connect to the Google Maps with Street a smooth scenic video from the starting point to the destination, which combines the Google Maps to provide

Ouhyoung, Ming

414

Google matrix, dynamical attractors, and Ulam networks D. L. Shepelyansky1,2  

E-Print Network (OSTI)

Google matrix, dynamical attractors, and Ulam networks D. L. Shepelyansky1,2 and O. V. Zhirov3,2 1 the properties of the Google matrix generated by a coarse-grained Perron-Frobenius operator of the Chirikov with a strong concentration of PageRank. A variation in the Google parameter or other parameters

Shepelyansky, Dima

415

Visualization of Folktales on a Map by Coupling Dynamic DEVS Simulation within Google Earth  

E-Print Network (OSTI)

Visualization of Folktales on a Map by Coupling Dynamic DEVS Simulation within Google Earth, Google Earth API, Dynamic variable structures Abstract: This paper deals with dynamic visualization of folktales on a map. The visualization is performed using a coupling of dynamic simulation with the google

Paris-Sud XI, Université de

416

Downloading GPS Point into Google Earth 1. Attach your GPS receiver to the GPS cord located at your computer.  

E-Print Network (OSTI)

Downloading GPS Point into Google Earth 1. Attach your GPS receiver to the GPS cord located at your menu of "Save as type" and select "Google Earth Format(*.kml). Then click "Save" and "OK". Opening your file in Google Earth: 1. Open Google Earth. 2. On the Google Earth menu, click "File" and then "Open

417

Query expansion via library classification system  

Science Conference Proceedings (OSTI)

Managing the development and delivery of multilingual electronic library services is one of the major current challenges for making digital content in Europe more accessible, usable and exploitable. Digital libraries and OPACbased traditional libraries ...

Alessio Bosca; Luca Dini

2008-09-01T23:59:59.000Z

418

04/02/13 14:38Giacomo D'Ariano -Google Scholar Citations Page 2 of 4http://scholar.google.com/citations?user=WRGm7mEAAAAJ&hl=en  

E-Print Network (OSTI)

04/02/13 14:38Giacomo D'Ariano - Google Scholar Citations Page 2 of 4http://scholar.google Paris 132 2001 #12;04/02/13 14:38Giacomo D'Ariano - Google Scholar Citations Page 3 of 4http://scholar.google are estimated and are determined automatically by a computer program. ©2012 Google - About Google Scholar - All

D'Ariano, Giacomo Mauro

419

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

420

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 developer google" 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

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

422

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

423

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

424

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

425

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

426

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

Lus Moniz Pereira; Alexandre Miguel Pinto

2009-01-01T23:59:59.000Z

427

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

428

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

429

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

430

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

431

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

432

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

433

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

434

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

435

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

436

T-683:Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code  

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

83:Google Chrome Multiple Flaws Let Remote Users Execute 83:Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code T-683:Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code August 3, 2011 - 3:45pm Addthis PROBLEM: Multiple vulnerabilities were reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system. PLATFORM: Google Chrome prior to 13.0.782.107 ABSTRACT: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code. reference LINKS: Google Chrome advisory Update Chromium Security SecurityTracker Alert ID: 1025882 CVE-2011-2819 IMPACT ASSESSMENT: Medium Discussion: A remote user can create a specially crafted HTML that, when loaded by the target user, will execute arbitrary code on the target system. The code will run with the privileges of the target user.

437

T-574: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code  

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

74: Google Chrome Multiple Flaws Let Remote Users Execute 74: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code T-574: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code March 10, 2011 - 3:05pm Addthis PROBLEM: Multiple vulnerabilities were reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system. A remote user can bypass the pop-up blocker. PLATFORM: Google Chrome prior to 10.0.648.127 ABSTRACT: Multiple vulnerabilities have been reported in Google Chrome, where some have an unknown impact while others can be exploited by malicious people bypass certain security restrictions, disclose system information, and compromise a user's system. reference LINKS: Secunia Advisory: SA43683 Google Chrome Support Chrome Stable Release SecurityTracker Alert ID:1025181

438

Your Mission: To become familiar with the major plate boundaries through exploration of plate tectonic features using Google Earth.  

E-Print Network (OSTI)

boundaries through exploration of plate tectonic features using Google Earth. Your Supplies: (1) A computer with internet access and the Google Earth program of Earth's tectonic plates using Google Earth. To do this, login

Smith-Konter, Bridget

439

Ecological Evaluation of Persuasive Messages Using Google AdWords  

E-Print Network (OSTI)

In recent years there has been a growing interest in crowdsourcing methodologies to be used in experimental research for NLP tasks. In particular, evaluation of systems and theories about persuasion is difficult to accommodate within existing frameworks. In this paper we present a new cheap and fast methodology that allows fast experiment building and evaluation with fully-automated analysis at a low cost. The central idea is exploiting existing commercial tools for advertising on the web, such as Google AdWords, to measure message impact in an ecological setting. The paper includes a description of the approach, tips for how to use AdWords for scientific research, and results of pilot experiments on the impact of affective text variations which confirm the effectiveness of the approach.

Guerini, Marco; Stock, Oliviero

2012-01-01T23:59:59.000Z

440

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

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

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

442

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

443

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

444

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

445

Everythings real about the Google Online Marketing Challenge Dr Peter Ling, School of Communications and Arts, Edith Cowan University When Google introduced its first global Google Online Marketing Challenge in 2008,  

E-Print Network (OSTI)

in 1600 teams actually participated in the Challenge by creating AdWords (short online advertisements that appear with keyword search) LIVE campaigns for 1, 600 clients (Google, 2008a). What cultural values motivated the various stakeholders in the Challenge: Google, professors, students, and businesses? Google Google was motivated by corporate values of providing hands-on learning for undergraduate and graduate students in business-related disciplines such as advertising, ecommerce, management information systems, and marketing. As Google obtains 95 % of its income from AdWords (J. Murphy, personal communication, 26 Feb, 2009), the Challenge was a way to create top-of-mind awareness among professors, students who would be future business employees, and businesses that have not used AdWords in the last six months preceding the Challenge period and would benefit from a test-drive of a three-week campaign with US$200 sponsored by Google. Driven by values of providing all students an equal opportunity to participate in the

unknown authors

2008-01-01T23:59:59.000Z

446

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

447

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

448

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

449

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

450

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

Jrgen Krmer; Bernhard Seeger

2009-04-01T23:59:59.000Z

451

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.

452

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

453

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

454

"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

455

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

456

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

457

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

458

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

459

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

460

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 Hnle; Daniela Nicklas; Bernhard Mitschang

2004-11-01T23:59:59.000Z

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

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

462

U-213: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code  

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

U-213: Google Chrome Multiple Flaws Let Remote Users Execute U-213: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code U-213: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code July 16, 2012 - 7:00am Addthis PROBLEM: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code PLATFORM: Version(s): prior to 20.0.1132.57 ABSTRACT: Several vulnerabilities were reported in Google Chrome. reference LINKS: Stable Channel Update SecurityTracker Alert ID: 1027249 IMPACT ASSESSMENT: High Discussion: Several vulnerabilities were reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system. A remote user can create a specially crafted content that, when loaded by the target user, will execute arbitrary code on the target system. The code will run with the privileges of the target user.

463

Join a White House Google+ Hangout with Energy Secretary Moniz & EPA  

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

a White House Google+ Hangout with Energy Secretary Moniz & a White House Google+ Hangout with Energy Secretary Moniz & EPA Administrator McCarthy Moderated by Grist Join a White House Google+ Hangout with Energy Secretary Moniz & EPA Administrator McCarthy Moderated by Grist September 20, 2013 - 1:20pm Addthis Join a White House Google+ Hangout with Energy Secretary Moniz & EPA Administrator McCarthy Moderated by Grist Marissa Newhall Marissa Newhall Managing Editor, Energy.gov How can I participate? Tune in Monday, September 23, at 12:15 p.m. EDT by visiting WhiteHouse.gov or the White House Google+ page. Submit your questions now or during the Hangout on Grist.org or on Twitter using the hashtag #ActOnClimate. Editor's note (Sept. 23, 2013): Unfortunately, due to a scheduling conflict, the Google+ Hangout with Secretary Moniz and Administrator

464

V-035: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code  

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

5: Google Chrome Multiple Flaws Let Remote Users Execute 5: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code V-035: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code November 28, 2012 - 1:00am Addthis PROBLEM: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code PLATFORM: Version(s): prior to 23.0.1271.91 ABSTRACT: Several vulnerabilities were reported in Google Chrome. REFERENCE LINKS: Release updates from the Chrome team SecurityTracker Alert ID: 1027815 Secunia Advisory SA51437 CVE-2012-5130 CVE-2012-5131 CVE-2012-5132 CVE-2012-5133 CVE-2012-5134 CVE-2012-5135 CVE-2012-5136 IMPACT ASSESSMENT: High DISCUSSION: Several vulnerabilities were reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system. A remote user can create specially crafted content that, when loaded by the

465

This Thursday: Google+ Hangout on Securing the Smart Grid | Department of  

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

This Thursday: Google+ Hangout on Securing the Smart Grid This Thursday: Google+ Hangout on Securing the Smart Grid This Thursday: Google+ Hangout on Securing the Smart Grid May 14, 2013 - 1:54pm Addthis April Saylor April Saylor Former Digital Outreach Strategist, Office of Public Affairs Sign up at the Google+ Event page. Tweet questions to @ENERGY with the hashtag #AskEnergy. Ask us on Facebook and Google+. Email questions to newmedia@hq.doe.gov. Happening now on energy.gov/live Join us this Thursday, May 16 at 2:00pm EDT for a Google+ Hangout on Securing the Smart Grid. Panelists from across the power systems industry will discuss a critical element of a secure and resilient electric power system, the smart grid cybersecurity workforce. Grid security professionals are the workers at the core of a secure and resilient national electric system. As part of the Energy Department's

466

U-133: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code  

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

33: Google Chrome Multiple Flaws Let Remote Users Execute 33: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code U-133: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code March 26, 2012 - 3:35am Addthis PROBLEM: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code PLATFORM: Google Chrome prior to 17.0.963.83 ABSTRACT: Multiple vulnerabilities were reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system. reference LINKS: SecurityTracker Alert ID: 1026841 CVE-2011-3049 Secunia Advisory SA48512 IMPACT ASSESSMENT: High Discussion: A remote user can create specially crafted content that, when loaded by the target user, will execute arbitrary code on the target system. The code will run with the privileges of the target user. A use-after-free may occur

467

Secretary Chu to Visit Google Headquarters During Trip to San Francisco |  

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

Google Headquarters During Trip to San Google Headquarters During Trip to San Francisco Secretary Chu to Visit Google Headquarters During Trip to San Francisco October 21, 2010 - 12:00am Addthis Washington, DC - During a visit to San Francisco tomorrow, Friday, Oct. 22, U.S. Energy Secretary Steven Chu will visit Google, Inc. headquarters to participate in a fireside chat with company employees to discuss the Obama Administration's vision for a clean and renewable energy economy. While at Google, Secretary Chu will also participate in a series of briefings with company researchers and scientists to learn more about the company's innovative ventures in the energy sector. WHAT: U.S. Energy Secretary Steven Chu to participate in fireside chat at Google, Inc. WHEN: Friday, October 22, 2010

468

V-035: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code  

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

5: Google Chrome Multiple Flaws Let Remote Users Execute 5: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code V-035: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code November 28, 2012 - 1:00am Addthis PROBLEM: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code PLATFORM: Version(s): prior to 23.0.1271.91 ABSTRACT: Several vulnerabilities were reported in Google Chrome. REFERENCE LINKS: Release updates from the Chrome team SecurityTracker Alert ID: 1027815 Secunia Advisory SA51437 CVE-2012-5130 CVE-2012-5131 CVE-2012-5132 CVE-2012-5133 CVE-2012-5134 CVE-2012-5135 CVE-2012-5136 IMPACT ASSESSMENT: High DISCUSSION: Several vulnerabilities were reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system. A remote user can create specially crafted content that, when loaded by the

469

V-184: Google Chrome Flash Plug-in Lets Remote Users Conduct Clickjacking  

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

4: Google Chrome Flash Plug-in Lets Remote Users Conduct 4: Google Chrome Flash Plug-in Lets Remote Users Conduct Clickjacking Attacks V-184: Google Chrome Flash Plug-in Lets Remote Users Conduct Clickjacking Attacks June 24, 2013 - 12:56am Addthis PROBLEM: Google Chrome Flash Plug-in Lets Remote Users Conduct Clickjacking Attacks PLATFORM: Google Chrome prior to 27.0.1453.116 ABSTRACT: A vulnerability was reported in Google Chrome. REFERENCE LINKS: Stable Channel Update SecurityTracker Alert ID: 1028694 CVE-2013-2866 IMPACT ASSESSMENT: Medium DISCUSSION: A remote user can create specially crafted Flash content that, when loaded by the target user, will display the Flash settings in a transparent manner, which may allow the remote user to cause the target user to modify their Flash settings. This may allow the remote user to obtain potentially

470

Join Us Tuesday, Jan. 15 for a Google+ Hangout on Critical Materials |  

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

Us Tuesday, Jan. 15 for a Google+ Hangout on Critical Us Tuesday, Jan. 15 for a Google+ Hangout on Critical Materials Join Us Tuesday, Jan. 15 for a Google+ Hangout on Critical Materials January 14, 2013 - 3:23pm Addthis What are critical materials? We will be answering that question and more tomorrow during our first Google+ Hangout. | Infographic by Sarah Gerrity, Energy Department. What are critical materials? We will be answering that question and more tomorrow during our first Google+ Hangout. | Infographic by Sarah Gerrity, Energy Department. Rebecca Matulka Rebecca Matulka Digital Communications Specialist, Office of Public Affairs How can I participate? Tweet questions to @ENERGY with the hashtag #AskEnergy. Ask us on the Energy Department's Facebook and Google+ pages. Email questions to newmedia@hq.doe.gov.

471

U-213: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code  

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

3: Google Chrome Multiple Flaws Let Remote Users Execute 3: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code U-213: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code July 16, 2012 - 7:00am Addthis PROBLEM: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code PLATFORM: Version(s): prior to 20.0.1132.57 ABSTRACT: Several vulnerabilities were reported in Google Chrome. reference LINKS: Stable Channel Update SecurityTracker Alert ID: 1027249 IMPACT ASSESSMENT: High Discussion: Several vulnerabilities were reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system. A remote user can create a specially crafted content that, when loaded by the target user, will execute arbitrary code on the target system. The code will run with the privileges of the target user.

472

T-716: Google SketchUp v8.x - '.DAE' File Memory Corruption Vulnerability |  

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

6: Google SketchUp v8.x - '.DAE' File Memory Corruption 6: Google SketchUp v8.x - '.DAE' File Memory Corruption Vulnerability T-716: Google SketchUp v8.x - '.DAE' File Memory Corruption Vulnerability September 14, 2011 - 9:28am Addthis PROBLEM: Attackers may exploit this issue to execute arbitrary code in the context of the application. Failed attacks will cause denial-of-service conditions. PLATFORM: Google SketchUp 8 is vulnerable; other versions may also be affected. ABSTRACT: Google SketchUp v8.x - '.DAE' File Memory Corruption Vulnerability reference LINKS: Vulnerability-Lab SketchUp Downloads IMPACT ASSESSMENT: Medium Discussion: A Memory Corruption vulnerability is detected on the Google s SketchUp v8.x. The vulnerability is caused by an memory corruption when processing corrupt DAE files through the filter, which could be exploited by attackers

473

V-109: Google Chrome WebKit Type Confusion Error Lets Remote Users Execute  

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

09: Google Chrome WebKit Type Confusion Error Lets Remote Users 09: Google Chrome WebKit Type Confusion Error Lets Remote Users Execute Arbitrary Code V-109: Google Chrome WebKit Type Confusion Error Lets Remote Users Execute Arbitrary Code March 12, 2013 - 12:11am Addthis PROBLEM: Google Chrome WebKit Type Confusion Error Lets Remote Users Execute Arbitrary Code PLATFORM: Google Chrome prior to 25.0.1364.160 ABSTRACT: A vulnerability was reported in Google Chrome. REFERENCE LINKS: Stable Channel Update SecurityTracker Alert ID: 1028266 CVE-2013-0912 IMPACT ASSESSMENT: Medium DISCUSSION: A remote user can cause arbitrary code to be executed on the target user's system. A remote user can create specially crafted HTML that, when loaded by the target user, will trigger a type confusion error in WebKit and execute arbitrary code on the target system. The code will run with the privileges

474

T-711: Fraudulent Google Digital Certificates Could Allow Man-in-the-Middle  

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

711: Fraudulent Google Digital Certificates Could Allow 711: Fraudulent Google Digital Certificates Could Allow Man-in-the-Middle Attacks T-711: Fraudulent Google Digital Certificates Could Allow Man-in-the-Middle Attacks September 7, 2011 - 9:30am Addthis PROBLEM: A fraudulent Google.com digital certificate was issued by a certificate authority. This certificate could allow an unauthenticated, remote attacker to access sensitive user data via a man-in-the-middle attack. PLATFORM: Most Microsoft Windows operating systems, DigiNotar is a CA in the Trusted Root Certification Authorities certificate store. Multiple browsers, including Microsoft Internet Explorer, Google Chrome, and Mozilla Firefox could also be configured with the compromised CA as one of their trusted issuers. ABSTRACT: Fraudulent Google Digital Certificates Could Allow Man-in-the-Middle

475

Enabling FindIt!/SFX in Google ScholarTM To enable FindIt!, the Library's OpenURL linking service, in Google ScholarTM on your personal  

E-Print Network (OSTI)

Enabling FindIt!/SFX in Google ScholarTM To enable FindIt!, the Library's OpenURL linking service, in Google ScholarTM on your personal computer: 1. Start at the Google ScholarTM homepage (http://scholar.google.ca/). 2. Select "Scholar Preferences". 3. In the "Library Links" box

Peak, Derek

476

www.i2e.com.es El framework Google Web Toolkit  

E-Print Network (OSTI)

www.i2e.com.es El framework Google Web Toolkit Emilio Bravo Garcia #12;www.i2e.com.es En esta presentación se va a realizar una introducción a Google Web Toolkit (en adelante GWT). GWT es una tecnología desarrollada por Google para acelerar el desarrollo de Aplicaciones Ricas de Internet (RIA) y mejorar la

Escolano, Francisco

477

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

478

Google Yahoo! Web http://www.wul.waseda.ac.jp/etclibs.html  

E-Print Network (OSTI)

4 5 1 478 5 6000 2 3 4 PC 5 Google Yahoo! Web 1 http://www.wul.waseda.ac.jp/etclibs.html 2 3 4 5 65 #12;4 4.1 4.1.1 6 WINE 11,709 7 Web Wikipedia WINE Web Google 8 Web Web PDF Word Excel blog Consumer://www.wul.waseda.ac.jp/CLIB/ref-j.html 9 1 10http://ja.wikipedia.org/ 66 #12;4.1. 11 Google Scholar12 Google Books13 Web 3 4.1.2 1 4

Kasahara, Hironori

479

@Google: Eric Isaacs - What does it mean to change the game?...  

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

@Google: Eric Isaacs - What does it mean to change the game? Share Browse By - Any - Energy -Energy efficiency --Vehicles ---Alternative fuels ---Automotive engineering ---Diesel...

480

U-004:Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary...  

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

ASSESSMENT: High Discussion: Multiple vulnerabilities were reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system. The code...

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

The Economists' Voice www.bepress.com/ev November 2009 The Berkeley Electronic Press The Google Book Settlement  

E-Print Network (OSTI)

-- The Economists' Voice www.bepress.com/ev November 2009© The Berkeley Electronic Press The Google in favor of the proposed settlement of the Authors Guild v. Google lawsuit that charged Google with copyright infringe- ment for digitizing millions of books for its Google Book Search (GBS) initiative. I

Sadoulet, Elisabeth

482

International Conference on Computer Systems and Technologies -CompSysTech'10 An Experiment with Using Google Tools  

E-Print Network (OSTI)

with Using Google Tools for Project Supervision at Tertiary Education Jií Srba Abstract: Problem oriented and coordination management tools for the support of group work. An experiment using a combination of Google Groups on, we chose to focus on Google Groups and other related technology. Google Groups is a service from

Srba, Jiri

483

Measurement Sites in Google Earth These files contain measurement site locations for various atmospheric monitoring networks and NARSTO Projects in  

E-Print Network (OSTI)

Measurement Sites in Google Earth These files contain measurement site locations for various atmospheric monitoring networks and NARSTO Projects in Google Earth coverages with links to additional site TN Ozone Study) q MILAGRO Sites q TEXAQS2000 TNRCC CAMS Obtain Google Earth Files The Google Earth

484

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

485

"Sergey Brin is Batman": google's project glass and the instigation of computer adoption in popular culture  

Science Conference Proceedings (OSTI)

The emergence of Google Glass, a prototype for a transparent Heads-Up Display available for the everyday consumer, is the first public conceptualization of a mainstream augmented-reality wearable eye display. Google's promotional material frames Glass ... Keywords: augmented reality, batman, computer adoption, computer platform, discourse analysis, humanities, popular culture, user experience, wearable eye display

Isabel Pedersen; Doug Trueman

2013-04-01T23:59:59.000Z

486

T-604: Google Chrome updated version of the Adobe Flash player | Department  

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

4: Google Chrome updated version of the Adobe Flash player 4: Google Chrome updated version of the Adobe Flash player T-604: Google Chrome updated version of the Adobe Flash player April 15, 2011 - 4:30am Addthis PROBLEM: Chrome Stable and Beta channels have been updated to 10.0.648.134 for Windows, Mac, Linux and Chrome Frame PLATFORM: Windows, Mac, Linux and Chrome Frame ABSTRACT: The Chrome Stable channel has been updated to 10.0.648.205 for Windows, Mac, Linux and Chrome Frame. This release contains a new version of Adobe Flash 0-Day CVE-2011-0611. Update also includes a fix for a security vulnerability Critical CVE-2011-1300: Off-by-three in GPU process, CVE-2011-1301: Use-after-free in the GPU process, and CVE-2011-1302: Heap overflow in the GPU process. OTHER LINKS: Google Chrome Releases - Google Chrome Browser

487

U-143: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code  

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

3: Google Chrome Multiple Flaws Let Remote Users Execute 3: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code U-143: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code April 9, 2012 - 7:00am Addthis PROBLEM: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code PLATFORM: Version(s): prior to 18.0.1025.151 ABSTRACT: Multiple vulnerabilities were reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system. reference LINKS: SecurityTracker Alert ID: 1026892 CVE-2011-3066 Secunia Advisory SA48732 IMPACT ASSESSMENT: High Discussion: A remote user can create specially crafted content that, when loaded by the target user, will execute arbitrary code on the target system. The code will run with the privileges of the target user. An out-of-bounds memory

488

U-041: Google Chrome Out-of-Bounds Write Error Lets Remote Users Execute  

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

1: Google Chrome Out-of-Bounds Write Error Lets Remote Users 1: Google Chrome Out-of-Bounds Write Error Lets Remote Users Execute Arbitrary Code U-041: Google Chrome Out-of-Bounds Write Error Lets Remote Users Execute Arbitrary Code November 18, 2011 - 9:00am Addthis PROBLEM: Google Chrome Out-of-Bounds Write Error Lets Remote Users Execute Arbitrary Code. PLATFORM: Version(s) prior to 15.0.874.121 ABSTRACT: A remote user can create HTML that, when loaded by the target user, will execute arbitrary code on the target user's system. reference LINKS: Stable Channel Update CVE-2011-3900 SecurityTracker Alert ID: 1026338 IMPACT ASSESSMENT: High Discussion: A vulnerability was reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system. A remote user can create specially crafted HTML that, when loaded by the target user,

489

U-220: Google Android DNS Resolver Randomization Flaw Lets Remote Users  

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

0: Google Android DNS Resolver Randomization Flaw Lets Remote 0: Google Android DNS Resolver Randomization Flaw Lets Remote Users Poison the DNS Cache U-220: Google Android DNS Resolver Randomization Flaw Lets Remote Users Poison the DNS Cache July 25, 2012 - 7:00am Addthis PROBLEM: Google Android DNS Resolver Randomization Flaw Lets Remote Users Poison the DNS Cache PLATFORM: Version(s): 4.0.4 and prior versions ABSTRACT: A remote user can poison the DNS cache. reference LINKS: IBM Application Security Research Group SecurityTracker Alert ID: 1027291 Bugtraq ID: 523624 CVE-2012-2808 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in Google Android. The res_randomid() function, which bases a return value on the process ID and the current time, is called twice in quick succession. As a result, the effective

490

T-697: Google Chrome Prior to 13.0.782.107 Multiple Security  

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

97: Google Chrome Prior to 13.0.782.107 Multiple Security 97: Google Chrome Prior to 13.0.782.107 Multiple Security Vulnerabilities T-697: Google Chrome Prior to 13.0.782.107 Multiple Security Vulnerabilities August 19, 2011 - 3:02pm Addthis PROBLEM: Attackers can exploit these issues to execute arbitrary code in the context of the browser or cause denial-of-service conditions; other attacks may also be possible. PLATFORM: Cross Platform: Google Chrome Prior to 13.0.782.107: Versions and Vulnerabilities (Details) ABSTRACT: Attackers can exploit these issues to execute arbitrary code in the context of the browser or cause denial-of-service conditions; other attacks may also be possible. The Chromium Projects Security Overview. reference LINKS: SecurityFocus: Google Chrome Prior to 13.0.782.107 Multiple Security Vulnerabilities

491

U-277: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code  

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

7: Google Chrome Multiple Flaws Let Remote Users Execute 7: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code U-277: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code October 9, 2012 - 6:00am Addthis PROBLEM: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code PLATFORM: Version(s): prior to 22.0.1229.92 ABSTRACT: Several vulnerabilities were reported in Google Chrome. reference LINKS: SecurityTracker Alert ID: 1027617 Stable Channel Update CVE-2012-2900 CVE-2012-5108 CVE-2012-5109 CVE-2012-5110 CVE-2012-5111 IMPACT ASSESSMENT: High Discussion: A remote user can create specially crafted content that, when loaded by the target user, will execute arbitrary code on the target system. The code will run with the privileges of the target user. A crash may occur in Skia text rendering [CVE-2012-2900].

492

U-160: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code  

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

60: Google Chrome Multiple Flaws Let Remote Users Execute 60: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code U-160: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code May 2, 2012 - 7:00am Addthis PROBLEM: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code PLATFORM: Prior to 18.0.1025.168 ABSTRACT: Several vulnerabilities were reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system reference LINKS: SecurityTracker Alert ID: 1027001 CVE-2011-3078 CVE-2011-3079 CVE-2011-3080 IMPACT ASSESSMENT: High Discussion: A remote user can create specially crafted content that, when loaded by the target user, will trigger a use-after-free, validation error, or race condition and execute arbitrary code on the target system. The code will

493

Join Secretary Chu Tomorrow for a Google+ Hangout on America's Growing  

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

Secretary Chu Tomorrow for a Google+ Hangout on America's Secretary Chu Tomorrow for a Google+ Hangout on America's Growing Solar Industry Join Secretary Chu Tomorrow for a Google+ Hangout on America's Growing Solar Industry February 21, 2013 - 3:06pm Addthis Join Secretary Chu Tomorrow for a Google+ Hangout on America's Growing Solar Industry Niketa Kumar Niketa Kumar Public Affairs Specialist, Office of Public Affairs How can I participate? Sign up at the Google+ Event page. Email questions to newmedia@hq.doe.gov, and tweet questions to @ENERGY using #AskEnergy. Tune in at 2pm ET on energy.gov/live. Over the past four years, solar energy generation in the U.S. has more than doubled. At the same time, the cost of solar power continues to fall each year and American companies and workers are helping to lead the way with

494

U-160: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code  

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

0: Google Chrome Multiple Flaws Let Remote Users Execute 0: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code U-160: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code May 2, 2012 - 7:00am Addthis PROBLEM: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code PLATFORM: Prior to 18.0.1025.168 ABSTRACT: Several vulnerabilities were reported in Google Chrome. A remote user can cause arbitrary code to be executed on the target user's system reference LINKS: SecurityTracker Alert ID: 1027001 CVE-2011-3078 CVE-2011-3079 CVE-2011-3080 IMPACT ASSESSMENT: High Discussion: A remote user can create specially crafted content that, when loaded by the target user, will trigger a use-after-free, validation error, or race condition and execute arbitrary code on the target system. The code will

495

U-077: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code  

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

7: Google Chrome Multiple Flaws Let Remote Users Execute 7: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code U-077: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code January 9, 2012 - 9:15am Addthis PROBLEM: Google Chrome Multiple Flaws Let Remote Users Execute Arbitrary Code PLATFORM: Version(s): prior to 16.0.912.75 ABSTRACT: A remote user may be able to execute arbitrary code on the target system. reference LINKS: Google Chrome Releases Chromium Security SecurityTracker Alert ID:1026487 IMPACT ASSESSMENT: High Discussion: A remote user can create specially crafted content that, when loaded by the target user, will execute arbitrary code on the target system. The code will run with the privileges of the target user. Specially crafted animation frames can trigger a use-after-free memory

496

Join Secretary Chu Tomorrow for a Google+ Hangout on America's Growing  

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

Join Secretary Chu Tomorrow for a Google+ Hangout on America's Join Secretary Chu Tomorrow for a Google+ Hangout on America's Growing Solar Industry Join Secretary Chu Tomorrow for a Google+ Hangout on America's Growing Solar Industry February 21, 2013 - 3:06pm Addthis Join Secretary Chu Tomorrow for a Google+ Hangout on America's Growing Solar Industry Niketa Kumar Niketa Kumar Public Affairs Specialist, Office of Public Affairs How can I participate? Sign up at the Google+ Event page. Email questions to newmedia@hq.doe.gov, and tweet questions to @ENERGY using #AskEnergy. Tune in at 2pm ET on energy.gov/live. Over the past four years, solar energy generation in the U.S. has more than doubled. At the same time, the cost of solar power continues to fall each year and American companies and workers are helping to lead the way with

497

Google Crisis Map for Hurricane Sandy | Department of Energy  

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

Accelerating Offshore Wind Development Accelerating Offshore Wind Development Concentrating Solar Power Facilities Concentrating Solar Power Facilities ARPA-e OPEN 2012 Projects...

498

Query processing using negative and temporal tuples in stream query engines  

Science Conference Proceedings (OSTI)

In this paper, we analyze how stream monotonicity classification can be adopted for the introduced developed model, which processes both temporal and negative events. As we show, information about stream monotonicity can be easily used to optimize individual ...

Marcin Gorawski; Aleksander Chrszcz

2009-10-01T23:59:59.000Z

499

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

500

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