text:
Office of Scientific and Technical Information
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
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
ISABELA-QA: query-driven analytics with ISABELA-compressed extreme-scale scientific data
Efficient analytics of scientific data from extreme-scale simulations is quickly becoming a top-notch priority. The increasing simulation output data sizes demand for a paradigm shift in how analytics is conducted. In this paper, we argue that query-driven ... Keywords: compression, data reduction, data-intensive computing, high performance applications, query-driven analytics
Sriram Lakshminarasimhan; John Jenkins; Isha Arkatkar; Zhenhuan Gong; Hemanth Kolla; Seung-Hoe Ku; Stephane Ethier; Jackie Chen; C. S. Chang; Scott Klasky; Robert Latham; Robert Ross; Nagiza F. Samatova
Scalable in situ scientific data encoding for analytical query processing
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
Extreme Chromatography: Faster, Hotter, SmallerChapter 11 Thin-layer Chromatography with Direct Mass Spectrometric Analyte Detection
Extreme Chromatography: Faster, Hotter, Smaller Chapter 11 Thin-layer Chromatography with Direct Mass Spectrometric Analyte Detection Methods and Analyses eChapters Methods - Analyses Books 04CB35E30FA9A40A756B0EB2011A879E AOCS Press
Effective March 26, 2012, "Order History" in Marketplace will be replaced with "Order Query" a faster, easier way to lookup past order information.
E-Print Network (OSTI)
Orders or Invoices. 2. What are you searching for? Enter key terms like Requisition/PO Numbers criteria entered. Filter query criteria after search is performed. In addition to the extensive Advanced, a Supplier name or a Catalog number Hint: Click "Query" for a complete list of available search terms. 3
California at San Diego, University of
Robust runtime optimization and skew-resistant execution of analytical SPARQL queries on pig
We describe a system that incrementally translates SPARQL queries to Pig Latin and executes them on a Hadoop cluster. This system is designed to work efficiently on complex queries with many self-joins over huge datasets, avoiding job failures even in ...
Spyros Kotoulas; Jacopo Urbani; Peter Boncz; Peter Mika
Faster Than Light?
It is argued that special relativity remains a viable physical theory even when there is permitted signals traveling faster than light.
Robert Geroch
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...
Generating query substitutions
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
Improving query performance in virtual data warehouses
In order to improve the quality of Business Intelligence Systems in an organization we can choose to build the system using BI techniques such as OLAP and data warehousing or by using traditional reports based on SQL queries. The cost and developing ... Keywords: SQL query plans, analytical functions, business intelligence projects, data extraction, indexes, partitioning techniques, query optimization and performance, tuning and optimization, virtual data warehouse
Adela B�ra; Ion Lungu; Manole Velicanu; Vlad Diaconita; Iuliana Botha
Distributed XML Query Processing.
??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
Geomodification in query rewriting
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
Query Explorativeness for Integrated Search
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
Solar Smarter Faster | Department of Energy
Home Solar Smarter Faster Solar Smarter Faster Addthis Description As part of the SunShot Initiative, U.S. Department of Energy Secretary Steven Chu announced on April 15th...
Efficient query expansion.
??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
Evaluation of a flowchart-based EHR query system: A case study of RetroGuide
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
Queries, Data, and Statistics: Pick Two.
??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
Multi-aspect query summarization by composite query
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
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
Auditing Categorical SUM, MAX and MIN Queries
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
QueryLines: approximate query for visual browsing
We introduce approximate query techniques for searching and analyzing two-dimensional data sets such as line or scatter plots. Our techniques allow users to explore a dataset by defining QueryLines: soft constraints and preferences for selecting and sorting a subset of the data. By using both preferences and soft constraints for query composition, we allow greater flexibility and expressiveness than previous visual query systems. When the user over-constrains a query, for example, a system using approximate techniques can display �near misses�to enable users to quickly and continuously refine queries.
Kathy Ryall; Neal Lesh; Hiroaki Miyashita; Shigeru Makino; Tom Lanning; Tom Lanning; Darren Leigh; Darren Leigh
compound queries | OpenEI Community
- 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...
ask queries | OpenEI Community
QueryScope: visualizing queries for repeatable database tuning
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
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,...
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,...
EIA 176 Query System, 2004
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,...
EIA 176 Query System, 2002
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...
Automatic categorization of query results
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
Mixed mode XML query processing
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
Smarter Faster Smarter Faster Solar Smarter Faster Addthis Description As part of the SunShot Initiative, U.S. Department of Energy Secretary Steven Chu announced on April 15th the selection of up to $112.5 million over five years for funding to support the development of advanced solar photovoltaic (PV)-related manufacturing processes throughout the United States. The effort is led by Sematech, with a proven track record in breathing life back into the US semiconduster industry, and in partnership with CNSE, The College of Nanoscale Science and Engineering. Speakers Dan Armbrust, Pradeep Haldar, Dan Hallady, Alain Kaloyeros Duration 3:07 Credit Energy Department Video SAM ARMBRUST (President and CEO, Sematech): SunShot represents a very serious approach by the United States government, recognizing that we are
Analytical Division
Analytical Division Common (non-systematic) Names for Fatty Acids Analytical Division Analytical Chemistry Divisions Analytical Division Common (non-
Group Nearest Neighbor Queries
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
Query clustering using user logs
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
A Semantic Graph Query Language
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
Analyzing linguistic structure of web search queries
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
Semantic optimization techniques for preference queries
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
Answering ad hoc aggregate queries from data streams using prefix aggregate trees
In some business applications such as trading management in financial institutions, it is required to accurately answer ad hoc aggregate queries over data streams. Materializing and incrementally maintaining a full data cube or even its compression or ... Keywords: Aggregate query, Data cube, Data stream, Data warehousing, Online analytic processing (OLAP)
Moonjung Cho; Jian Pei; Ke Wang
Faster Dissociation: Aryl Halide Radical Anions
NLE Websites -- All DOE Office Websites (Extended Search)
Faster Dissociation: Measured Rates and Computed Effects on Barriers in Faster Dissociation: Measured Rates and Computed Effects on Barriers in Aryl Halide Radical Anions Norihiko Takeda, Pavel V. Poliakov, Andrew R. Cook, and John R. Miller J. Am. Chem. Soc. 126, 4301-4309 (2004). [Find paper at ACS Publications] Abstract: Carbon-halogen bond dissociation rates for a series of aryl halide radical anions (ArX-·: X = Cl, Br) in NMP were measured at room temperature by pulse radiolysis with 10-11 s time resolution. To obtain accurate dissociation rates, care was taken to measure and correct for competing decay channels. The observed rates correlated well with activation energies computed in the gas phase by density functional (DFT) calculations. The rates did not correlate well with electron affinities or dissociation energies obtained by the same computational methods, although such
Evaluating verbose query processing techniques
Verbose or long queries are a small but significant part of the query stream in web search, and are common in other applications such as collaborative question answering (CQA). Current search engines perform well with keyword queries but are not, in general, effective for verbose queries. In this paper, we examine query processing techniques which can be applied to verbose queries prior to submission to a search engine in order to improve the search engine�s results. We focus on verbose queries that have sentence-like structure, but are not simple �wh- � questions, and assume the search engine is a �black box. � We evaluated the output of two search engines using queries from a CQA service and our results show that, among a broad range of techniques, the most effective approach is to simply reduce the length of the query. This can be achieved effectively by removing �stop structure � instead of only stop words. We show that the process of learning and removing stop structure from a query can be effectively automated.
Samuel Huston; W. Bruce Croft
Optimizing RDF(S) queries on cloud platforms
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
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.
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.
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
Query Expansion for Microblog Retrieval
... Specifically, we used the Google Search API (GSA) to retrieve pages from the Web, and used the titles to expand queries. ...
CQ - Code selection through query.
??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)
Structured Queries for Legal Search
... Track. It takes the keywords in RequestText to form a bag-of-words query using the �#combine� operator in In- dri. Common ...
Depth estimation for ranking query optimization
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
Bipolar queries: An aggregation operator focused perspective
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
Ontology-based automatic query refinement
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
Context-sensitive query auto-completion
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
Exploiting underrepresented query aspects for automatic query expansion
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
Towards Optimal Multi-Dimensional Query Processing with BitmapIndices
Bitmap indices have been widely used in scientific applications and commercial systems for processing complex, multi-dimensional queries where traditional tree-based indices would not work efficiently. This paper studies strategies for minimizing the access costs for processing multi-dimensional queries using bitmap indices with binning. Innovative features of our algorithm include (a) optimally placing the bin boundaries and (b) dynamically reordering the evaluation of the query terms. In addition, we derive several analytical results concerning optimal bin allocation for a probabilistic query model. Our experimental evaluation with real life data shows an average I/O cost improvement of at least a factor of 10 for multi-dimensional queries on datasets from two different applications. Our experiments also indicate that the speedup increases with the number of query dimensions.
Rotem, Doron; Stockinger, Kurt; Wu, Kesheng
Preference formulas in relational queries
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
Complex spatio-temporal pattern queries
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
Building Science Solutions Faster and Better
eere.energy.gov eere.energy.gov Webinar questions should be directed to: firstname.lastname@example.com 2 | Building America eere.energy.gov Building Science Solutions - Faster and Better Sam Rashkin Michael Baechler Linda Connell Building America Solution Center October 11, 2012 3 | Building America eere.energy.gov Building America Solution Center Overview 4 | Building America eere.energy.gov World Class Research... ... at Your Finger Tips 5 | Building America eere.energy.gov Is: Easy Access to World-Class Research: * Guidance for Applying Targeted Energy Measures * Tool for Users to Prepare Customized Project Content * Source for Proven Performance * Link to Full References Is Not: * Design Tool for Customized Energy Packages What the DOE Building America Solution Center 'Is' & 'Is Not'
SPARQL Query Form | OpenEI
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...
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.
Multi-query SQL progress indicators
Abstract. Recently, progress indicators have been proposed for SQL queries in RDBMSs. All previously proposed progress indicators consider each query in isolation, ignoring the impact simultaneously running queries have on each other�s performance. In this paper, we explore a multi-query progress indicator, which explicitly considers concurrently running queries and even queries predicted to arrive in the future when producing its estimates. We demonstrate that multi-query progress indicators can provide more accurate estimates than single-query progress indicators. Moreover, we extend the use of progress indicators beyond being a GUI tool and show how to apply multi-query progress indicators to workload management. We report on an initial implementation of a multi-query progress indicator in PostgreSQL and experiments with its use both for estimating remaining query execution time and for workload management. 1
Gang Luo; Jeffrey F. Naughton; Philip S. Yu
Hot water can freeze faster than cold?!?
We review the Mpemba effect, where intially hot water freezes faster than initially cold water. While the effect appears impossible at first sight, it has been seen in numerous experiments, was reported on by Aristotle, Francis Bacon, and Descartes, and has been well-known as folklore around the world. It has a rich and fascinating history, which culminates in the dramatic story of the secondary school student, Erasto Mpemba, who reintroduced the effect to the twentieth century scientific community. The phenomenon, while simple to describe, is deceptively complex, and illustrates numerous important issues about the scientific method: the role of skepticism in scientific inquiry, the influence of theory on experiment and observation, the need for precision in the statement of a scientific hypothesis, and the nature of falsifiability. We survey proposed theoretical mechanisms for the Mpemba effect, and the results of modern experiments on the phenomenon. Studies of the observation that hot water pipes are more likely to burst than cold water pipes are also described.
Monwhea Jeng
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.
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 ...
EIA-176 Query System 2005
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 ...
Adaptively parallelizing distributed range queries
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
Usability of XML Query Languages.
??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
On implementing provenance-aware regular path queries with relational query engines
Use of graphs is growing rapidly in social networks, semantic web, biological databases, scientific workflow provenance, and other areas. Regular Path Queries (RPQs) can be seen as a core graph query language to answer pattern-based reachability queries. ... Keywords: datalog, graph querying, regular path queries
Saumen Dey; V�ctor Cuevas-Vicentt�n; Sven K�hler; Eric Gribkoff; Michael Wang; Bertram Lud�scher
Detecting distributed scans using high-performance query-driven visualization
Modern forensic analytics applications, like network traffic analysis, perform high-performance hypothesis testing, knowledge discovery and data mining on very large datasets. One essential strategy to reduce the time required for these operations is ... Keywords: data mining, network connection analysis, network security, query-driven visualization, visual analytics
Kurt Stockinger; E. Wes Bethel; Scott Campbell; Eli Dart; Kesheng Wu
SEMISTRUCTURED PROBABILISTIC OBJECT QUERY LANGUAGE (A Query Language for Semistructured Probabilistic Data).
??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
Extreme Chromatography: Faster, Hotter, SmallerChapter 3 Chiral Separations
Extreme Chromatography: Faster, Hotter, Smaller Chapter 3 Chiral Separations Methods and Analyses eChapters Methods - Analyses Books Downloadable pdf of Chapter 3 Chiral Separations from ...
Minimizing I/O Costs of Multi-Dimensional Queries with BitmapIndices
Bitmap indices have been widely used in scientific applications and commercial systems for processing complex,multi-dimensional queries where traditional tree-based indices would not work efficiently. A common approach for reducing the size of a bitmap index for high cardinality attributes is to group ranges of values of an attribute into bins and then build a bitmap for each bin rather than a bitmap for each value of the attribute. Binning reduces storage costs,however, results of queries based on bins often require additional filtering for discarding it false positives, i.e., records in the result that do not satisfy the query constraints. This additional filtering,also known as ''candidate checking,'' requires access to the base data on disk and involves significant I/O costs. This paper studies strategies for minimizing the I/O costs for ''candidate checking'' for multi-dimensional queries. This is done by determining the number of bins allocated for each dimension and then placing bin boundaries in optimal locations. Our algorithms use knowledge of data distribution and query workload. We derive several analytical results concerning optimal bin allocation for a probabilistic query model. Our experimental evaluation with real life data shows an average I/O cost improvement of at least a factor of 10 for multi-dimensional queries on datasets from two different applications. Our experiments also indicate that the speedup increases with the number of query dimensions.
Category:Query Results Templates | Open Energy Information
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...
Can we build software faster and better and cheaper?
"Faster, Better, Cheaper" (FBC) was a development philosophy adopted by the NASA administration in the mid to late 1990s. that lead to some some dramatic successes such as Mars Pathfinder as well as a number highly publicized mission failures, such as ... Keywords: COCOMO, faster better cheaper, predictor models, simulated annealing, software engineering, software processes
Tim Menzies; Oussama El-Rawas; Jairus Hihn; Barry Boehm
A system for semantic query optimization
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
Query expansion techniques for question answering
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-
SENSTRAC: scalable querying of sensor networks from mobile platforms using tracking-style queries
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
Schemes of storing XML query cache
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
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 ...
MIL primitives for querying a fragmented world
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
Efficiently approximating query optimizer plan diagrams
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
Answering XML queries using materialized views revisited
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
Query weighting for ranking model adaptation
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
Structured Query Language for Virtual Observatory
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
Context-Sensitive Query Auto-Completion ?
Query auto completion is known to provide poor predictions of the user�s query when her input prefix is very short (e.g., one or two characters). In this paper we show that context, such as the user�s recent queries, can be used to improve the prediction quality considerably even for such short prefixes. We propose a context-sensitive query auto completion algorithm, NearestCompletion, which outputs the completions of the user�s input that are most similar to the context queries. To measure similarity, we represent queries and contexts as high-dimensional term-weighted vectors and resort to cosine similarity. The mapping from queries to vectors is done through a new query expansion technique that we introduce, which expands a query by traversing the query recommendation tree rooted at the query. In order to evaluate our approach, we performed extensive experimentation over the public AOL query log. We demonstrate that when the recent user�s queries are relevant to the current query she is typing, then after typing a single character, NearestCompletion�s MRR is 48 % higher relative to the MRR of the standard MostPopularCompletion algorithm on average. When the context is irrelevant, however, NearestCompletion�s MRR is essentially zero. To mitigate this problem, we propose HybridCompletion, which is a hybrid of NearestCompletion with MostPopularCompletion. HybridCompletion is shown to dominate both NearestCompletion and MostPopularCompletion, achieving a total improvement of 31.5 % in MRR relative to MostPopular-Completion on average.
Ziv Bar-yossef; Naama Kraus
Quantum query complexity for qutrits
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)
Example Queries | Open Energy Information
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
Coupling of Two Motor Proteins: a New Motor Can Move Faster
We study the effect of a coupling between two motor domains in highly-processive motor protein complexes. A simple stochastic discrete model, in which the two parts of the protein molecule interact through some energy potential, is presented. The exact analytical solutions for the dynamic properties of the combined motor species, such as the velocity and dispersion, are derived in terms of the properties of free individual motor domains and the interaction potential. It is shown that the coupling between the motor domains can create a more efficient motor protein that can move faster than individual particles. The results are applied to analyze the motion of helicase RecBCD molecules.
Evgeny B. Stukalin; Hubert Phillips III; Anatoly B. Kolomeisky
Logical queries over views: Decidability and expressiveness
We study the problem of deciding the satisfiability of first-order logic queries over views, with our aim to delimit the boundary between the decidable and the undecidable fragments of this language. Views currently occupy a central place in database ... Keywords: L�wenheim class, Satisfiability, conjunctive query, containment, database query, database view, decidability, first-order logic, monadic logic, ontology reasoning, unary logic, unary view
James Bailey; Guozhu Dong; Anthony WIDJAJA To
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
Effective Structured Query Formulation for Session Search
... For instance, in TREC 2011 session 11 query �hawaii real estate average resale value house or condo news�, we discover that �hawaii real� and ...
Decision trees with AND, OR queries
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
Querying Allocations Using cbank | Argonne Leadership Computing...
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...
Ontology query languages for the Semantic Web.
??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
Predicting Query Performance in Intranet Search
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.
Query expansion techniques for question answering.
??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)
Qunits: queried units in database search
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
Faster plant growth in a safe, economical way
Faster plant growth in a safe, economical way Faster plant growth in a safe, economical way Faster plant growth in a safe, economical way When applied to plants, Take-Off(tm) speeds crop emergence, increases growth rates and yields, improves stress tolerance and nutrient value, and reduces need for nitrogen fertilizers. April 3, 2012 Farmer in wheat field inspecting wheat Biagro Western offers Take-Off(tm), a metabolic plant stimulant that will allow farmers to increase crop carbon fixation and thereby increase nitrate uptake and nitrogen use efficiency. The new product speeds plants to maturity, allowing the plants to more efficiently assimilate nitrogen by coordinating the nitrogen uptake and photosynthesis processes. Field tests show that Take-Off(tm) reduced nitrogen inputs by 25 to 35 percent.
Bearing Analytics | Department of Energy
Bearing Analytics Bearing Analytics National Clean Energy Business Plan Competition 2013 355 likes Bearing Analytics Purdue University Avoidable bearing failures cost the US industrial economy $50B in damage and downtime every year. Current bearing health monitoring systems do not adequately detect failure until it is too late. Bearing Analytics offers a patent-pending micro-sensor technology that monitors temperature and vibration directly on the bearing cage helping predict performance degradation and impending failure while improving operating, performance, and energy efficiencies. Our technology does all of that with a better accuracy, faster response time, and increased reliability over any other competing solution today. We intend to target the wind turbine industry as our initial target point
Learning about the world through long-term query logs
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
Optimized query routing trees for wireless sensor networks
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
Top-k typicality queries and efficient query answering methods on large databases
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
Nuclear Analytical Chemistry Portal
NIST Home > Nuclear Analytical Chemistry Portal. Nuclear Analytical Chemistry Portal. ... see all Nuclear Analytical Chemistry news ... ...
Ranking class labels using query sessions
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
Query-Answering CG Knowledge Bases
Conceptual graphs are a good choice for constructing and exploiting a knowledge base. In several of our projects (semantic portal for e-tourism, exploitation of digital object corpus, etc.), we have to query such bases. So it is natural to consider queries ...
Michel Lecl�re; Nicolas Moreau
Observing SQL queries in their natural habitat
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
Queries as anchors: selection by association
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
Processing top k queries from samples
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
A Belief Model of Query Difficulty That Uses Subjective Logic
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
Natural Gas EIA-176 Query System Readme(1999)
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...
Large-Scale Continuous Subgraph Queries on Streams
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.
Building an Efficient Preference XML Query Processor
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
Query Selectivity Estimation for Uncertain Data
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
T-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...
The Analytical Division is comprised of members with a variety of interests, including: chromatography (liquid, gas-liquid, high-performance liquid column, thin-layer, and supercritical-fluid), electrophoresis, spectroscopy (UV, IR, NMR, light-scattering)
NREL: News Feature - Biomass Analysis Tool Is Faster, More Precise
Biomass Analysis Tool Is Faster, More Precise Biomass Analysis Tool Is Faster, More Precise February 26, 2013 Photo of a left hand holding a rectangular tray that has 48 cups, each holding a small amount of a biomass sample. Below the tray is a slice of a poplar tree, about an inch thick and a foot in diameter. Enlarge image This tray of 80-milliliter samples was taken from a standard poplar tree, such as the one pictured here. It is ready to be loaded into NREL's molecular beam mass spectrometer for rapid analysis of the cell wall chemistry of each sample. Credit: Dennis Schroeder A screening tool from the U.S. Department of Energy's National Renewable Energy Laboratory (NREL) eases and greatly quickens one of the thorniest tasks in the biofuels industry: determining cell wall chemistry to find plants with ideal genes.
Implementing Graph Pattern Queries on a Relational Database
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
RAPIDD Gives ALS Users a Faster Path to Beam Time
RAPIDD Gives ALS Users a Faster RAPIDD Gives ALS Users a Faster Path to Beam Time RAPIDD Gives ALS Users a Faster Path to Beam Time Print Monday, 28 October 2013 08:31 ALS users are invited to check out our web pages detailing our new RAPIDD proposal process. This combined process for Rapid Access Proposals, Industry, and Director's Discretion beam time accommodates users who require limited but rapid access to the ALS. Proposals may be submitted at any time. RAPIDD complements the existing six-month General User Proposal process, which remains the access mechanism of choice for users who require significant beam time for an extended program of research, or for those wanting to perform complex experiments involving setup or reorganization of equipment at a beamline. The ALS structural biology community has been using RAPIDD for a year, with 160 proposals receiving beam time in that period. As of July 2013, RAPIDD access was extended to beamlines 7.3.3 (SAXS/WAXS), 8.3.2 (microtomography) and 11.3.1 (small molecule crystallography) and to users from industrial groups.
Enterprise analytics.
Ranking search results is a thorny issue for enterprise search. Search engines rank results using a variety of sophisticated algorithms, but users still complain that search can't ever seem to find anything useful or relevant! The challenge is to provide results that are ranked according to the users definition of relevancy. Sandia National Laboratories has enhanced its commercial search engine to discover user preferences, re-ranking results accordingly. Immediate positive impact was achieved by modeling historical data consisting of user queries and subsequent result clicks. New data is incorporated into the model daily. An important benefit is that results improve naturally and automatically over time as a function of user actions. This session presents the method employed, how it was integrated with the search engine,metrics illustrating the subsequent improvement to the users search experience, and plans for implementation with Sandia's FAST for SharePoint 2010 search engine.
Spomer, Judith E.
Experimental quantum private queries with linear optics
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)
Ordering the attributes of query results
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
Probabilistic ranking of database query results
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
Indexing a dictionary for subset matching queries
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
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 ...
Enabling ?-approximate querying in sensor networks
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
Querying Incomplete Data over Extended ER Schemata
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
Table Name query? | OpenEI Community
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...
The DEDALE system for complex spatial queries
This paper presents DEDALE, a spatial database system intended to overcome some limitations of current systems by providing an abstract and non-specialized data model and query language for the representation and manipulation of spatial objects. DEDALE ...
St�phane Grumbach; Philippe Rigaux; Luc Segoufin
On applying temporal database concepts to event queries
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
Query clustering using content words and user feedback
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
Monitoring the dynamic web to respond to continuous queries
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
Querying Source Code with Natural Language Markus Kimmig
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
Semantic errors in SQL queries: a quite complete list
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
Analytical Microscopy
DOE Green Energy (OSTI)
In the Analytical Microscopy group, within the National Center for Photovoltaic's Measurements and Characterization Division, we combine two complementary areas of analytical microscopy--electron microscopy and proximal-probe techniques--and use a variety of state-of-the-art imaging and analytical tools. We also design and build custom instrumentation and develop novel techniques that provide unique capabilities for studying materials and devices. In our work, we collaborate with you to solve materials- and device-related R&D problems. This sheet summarizes the uses and features of four major tools: transmission electron microscopy, scanning electron microscopy, the dual-beam focused-ion-beam workstation, and scanning probe microscopy.
Not Available
An interactive visual query interface on spatial/ temporal data
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
Analytical Dashboards
Energy.gov (U.S. Department of Energy (DOE))
Analytical Dashboards facilitates easy access to essential high-level corporate-wide safety performance information through key metrics, charts, graphs, and text bullets to provide both managers and operations personnel with a current perspective on safety performance within the Department.
Analytical Dashboards Analytical Dashboards Public Final Occurrence Reports: Searchable information on DOE's Final Occurrence Reports since 2009, available to the public and updated daily. Computerized Accident Incident Reporting System (CAIRS) - Injury and Illness Dashboard: The Injury and Illness Dashboard is a tool that allows users to easily explore DOE occupational safety and health injury and illness information. Its features include: Graphical and tabular depictions of injury and illness information Calendar year and fiscal year incidence rates for DOE and DOE contractor total recordable cases (TRC) of injuries and illnesses and cases involving days away from work or on job transfer or restriction (DART) due to injury or illness Incidence rates of injuries and illnesses by DOE program
V.: GLOO: A Graphical Query Language for OWL Ontologies. OWLED
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
Inferring Function Semantics to Optimize Queries
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
On-the-fly progress detection in iterative stream queries
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
EIA 176 Query System, 2002 - U.S. Energy Information ...
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 ...
The Effectiveness of Query Expansion for Distributed Information Retrieval
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
Framework for querying distributed objects managed by a grid infrastructure
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
Template:Incentive Type Page Query | Open Energy Information
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...
Xplus: a SQL-tuning-aware query optimizer
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
Query-based database policy assurance using semantic web technologies
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
Query Answering with DBoxes is Hard
Data in description logic knowledge bases is stored in the form of an ABox. ABoxes are often confusing for developers coming from relational databases because an ABox, in contrast to a database instance, provides an incomplete specification. A recently ... Keywords: Description logics, conjunctive queries, hybrid logic, model theory
Enrico Franconi; Yazm�n Ang�lica Ib��ez-Garc�a; ?nan� Seylan
A logic based context query language
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
Ambiguous queries: test collections need more sense
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
Explicit Query Diversification for Geographical Information Retrieval
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
Answering relationship queries on the web
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
Secure multidimensional range queries in sensor networks
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
Stratified analysis of AOL query log
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
Query and update through XML views
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
Ranking entities using web search query logs
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
Value of Faster Computation for Power Grid Operation
As a result of the grid evolution meeting the information revolution, the power grid is becoming far more complex than it used to be. How to feed data in, perform analysis, and extract information in a real-time manner is a fundamental challenge in today�s power grid operation, not to mention the significantly increased complexity in the smart grid environment. Therefore, high performance computing (HPC) becomes one of the advanced technologies used to meet the requirement of real-time operation. This paper presents benefit case studies to show the value of fast computation for operation. Two fundamental operation functions, state estimation (SE) and contingency analysis (CA), are used as examples. In contrast with today�s tools, fast SE can estimate system status in a few seconds�comparable to measurement cycles. Fast CA can solve more contingencies in a shorter period, reducing the possibility of missing critical contingencies. The benefit case study results clearly show the value of faster computation for increasing the reliability and efficiency of power system operation.
Chen, Yousu; Huang, Zhenyu; Elizondo, Marcelo A.
Discrete Momentum Mechanics and Faster Than Light Transition
In this work a new mechanics will be studied which is based on the hypothesis that the change of linear momentum of a particle happens as a discrete pulses. By using this hypothesis and by considering Newton's relation between energy and momentum, and the law of mass and energy conservation as a priori, the Einstein dispersion relation can be derived as a zero approximation without using Lorentz transformations. Other terms will be derived as a corrections to this relation. It will be shown that the effect of the corrections will be smaller and smaller with the increase of momentum. The work will offer an explanation of why the velocity of light seems to be constant regardless of the velocity of the source, and under which condition this will be changed. Also a prediction is made that faster than light transition could happen theoretically under certain conditions, and a nonzero mass photon can exist in nature. The work is purely classical in the sense that it doesn't involve any uncertainty relations.
Munir Al-Hashimi
Bin-Hash Indexing: A Parallel Method for Fast Query Processing
This paper presents a new parallel indexing data structure for answering queries. The index, called Bin-Hash, offers extremely high levels of concurrency, and is therefore well-suited for the emerging commodity of parallel processors, such as multi-cores, cell processors, and general purpose graphics processing units (GPU). The Bin-Hash approach first bins the base data, and then partitions and separately stores the values in each bin as a perfect spatial hash table. To answer a query, we first determine whether or not a record satisfies the query conditions based on the bin boundaries. For the bins with records that can not be resolved, we examine the spatial hash tables. The procedures for examining the bin numbers and the spatial hash tables offer the maximum possible level of concurrency; all records are able to be evaluated by our procedure independently in parallel. Additionally, our Bin-Hash procedures access much smaller amounts of data than similar parallel methods, such as the projection index. This smaller data footprint is critical for certain parallel processors, like GPUs, where memory resources are limited. To demonstrate the effectiveness of Bin-Hash, we implement it on a GPU using the data-parallel programming language CUDA. The concurrency offered by the Bin-Hash index allows us to fully utilize the GPU's massive parallelism in our work; over 12,000 records can be simultaneously evaluated at any one time. We show that our new query processing method is an order of magnitude faster than current state-of-the-art CPU-based indexing technologies. Additionally, we compare our performance to existing GPU-based projection index strategies.
Bethel, Edward W; Gosink, Luke J.; Wu, Kesheng; Bethel, Edward Wes; Owens, John D.; Joy, Kenneth I.
A Simple Model for Classifying Web Queries by User Intent
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
Using histograms to estimate answer sizes for XML queries
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
Data summaries for on-demand queries over linked data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering. However, this time-consuming pre-processing phase however leverages the ... Keywords: index structures, linked data, rdf querying
Andreas Harth; Katja Hose; Marcel Karnstedt; Axel Polleres; Kai-Uwe Sattler; J�rgen Umbrich
Selective Sampling Using the Query by Committee Algorithm
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
Probabilistic information retrieval approach for ranking of database query results
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
Analyzing, Detecting, and Exploiting Sentiment in Web Queries
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
Query Suggestions for Mobile Search: Understanding Usage Patterns
Inc 1600 Amphitheatre Parkway, Mountain View, CA firstname.lastname@example.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
Behavior-driven clustering of queries into topics
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
Users, Queries and Documents: A Unified Representation for Web Mining
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
Improving effectiveness of query expansion using information theoretic approach
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
Oak Ridge Finds Ways to Remove K-25 Faster, Cheaper | Department of Energy
Finds Ways to Remove K-25 Faster, Cheaper Finds Ways to Remove K-25 Faster, Cheaper Oak Ridge Finds Ways to Remove K-25 Faster, Cheaper February 1, 2012 - 12:00pm Addthis Oak Ridge Finds Ways to Remove K-25 Faster, Cheaper Oak Ridge Finds Ways to Remove K-25 Faster, Cheaper Oak Ridge Finds Ways to Remove K-25 Faster, Cheaper Oak Ridge Finds Ways to Remove K-25 Faster, Cheaper OAK RIDGE, Tenn. - K-25, once the world's largest building under one roof, reflects less of its former title every day. Due to the partnership between the U.S Department of Energy (DOE) Office of Environmental Management (EM) cleanup team and Oak Ridge's prime environmental management contractor, URS | CH2M Oak Ridge, LLC (UCOR), the 44-acre, multi-level uranium-enrichment superstructure is in the advanced stages of demolition.
Nuclear Analytical Methods
... Nuclear Analytical Methods. Research activities in the Nuclear Analytical Methods Group are focused on the science that ...
An Improved Query for the Hidden Subgroup Problem
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
Automatic discovery of query-classdependent models for multimodal search
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
Quantum query complexity of some graph problems
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
Variable Interactions in Query-Driven Visualization
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.
Natural Gas Annual Respondent Query System
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
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their potential to speed up applications, as well as their reduced power consumption, ... Keywords: columnar storage, flash memory, join index, late materialization, semi-join reduction, ssd
Dimitris Tsirogiannis; Stavros Harizopoulos; Mehul A. Shah; Janet L. Wiener; Goetz Graefe
Top Ten Interaction Challenges in Extreme-Scale Visual Analytics
The chapter presents ten selected user interfaces and interaction challenges in extreme-scale visual analytics. The study of visual analytics is often referred to as 'the science of analytical reasoning facilitated by interactive visual interfaces' in the literature. The discussion focuses on the issues of applying visual analytics technologies to extreme-scale scientific and non-scientific data ranging from petabyte to exabyte in sizes. The ten challenges are: in situ interactive analysis, user-driven data reduction, scalability and multi-level hierarchy, representation of evidence and uncertainty, heterogeneous data fusion, data summarization and triage for interactive query, analytics of temporally evolving features, the human bottleneck, design and engineering development, and the Renaissance of conventional wisdom. The discussion addresses concerns that arise from different areas of hardware, software, computation, algorithms, and human factors. The chapter also evaluates the likelihood of success in meeting these challenges in the near future.
Wong, Pak C.; Shen, Han-Wei; Chen, Chaomei
Runtime Reprioritization for Online Aggregation Queries.
??The need for interactive ad-hoc analytics has been steadily rising. The traditional batch processing of large data takes order of seconds to several minutes for� (more)
Tunga Gopinath, Karthik
Intentional query suggestion: making user goals more explicit during search
student.tugraz.at The degree to which users � make their search intent explicit can be assumed to represent an upper bound on the level of service that search engines can provide. In a departure from traditional query expansion mechanisms, we introduce Intentional Query Suggestion as a novel idea that is attempting to make users � intent more explicit during search. In this paper, we present a prototypical algorithm for Intentional Query Suggestion and we discuss corresponding data from comparative experiments with traditional query suggestion mechanisms. Our preliminary results indicate that intentional query suggestions 1) diversify search result sets (i.e. it reduces result set overlap) and 2) have the potential to yield higher click-through rates than traditional query suggestions.
Markus Strohmaier; Mark Kr�ll; Christian K�rner
Multicolor Maps from Compound Queries | OpenEI Community
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:
Analytical Division Student Award
Awarded to graduate student(s) in the field of lipid analytical chemistry. Analytical Division Student Award Divisions achievement agricultural analytical application award awards biotechnology detergents distinguished division Divisions edible fa
Use of Query Concepts and Information Extraction to Improve ...
Page 1. Use of Query Concepts and Information Extraction to Improve Information Retrieval Effectiveness David O. Holmes M. Catherine McCabe ...
Scheduling for in-network sensor query processing.
??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
??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
Form EIA-176 Query System - Energy Information Administration
Form EIA-176 Query System . User�s guide . Version 7.0 . Energy Information Administration U.S. Department of Energy ...
Runway Incursion Database (RWS) - Data Query Tool | Data.gov
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...
Implementation of the Clinical Research Query Interface VISAGE.
??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.
Template:CompanyCsvPostOffsetQuery | Open Energy Information
template. It should be called in the following format: CompanyCsvPostOffsetQuery |cat |offset |limit |searchlabel Retrieved from "http:en.openei.orgw...
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.
Form EIA-176 Query System Getting Started Guide Version 7.0 Energy Information Administration U.S. Department of Energy October ...
Say What? Why users choose to speak their web queries Maryam Kamvar, Doug Beeferman
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
Continuous K-Nearest Neighbor Query for Moving Objects with Uncertain Velocity
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
Learning to suggest: a machine learning framework for ranking query suggestions
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
Hourly analysis of a very large topically categorized web query log
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
Information Retrieval manuscript No. (will be inserted by the editor) When Do People Use Query Suggestion? A Query Suggestion Log Analysis
(Authors � version. The final publication is available at www.springerlink.com.) Abstract Query suggestion, which enables the user to revise a query with a single click, has become one of the most fundamental features of Web search engines. However, it has not been clear what circumstances cause the user to turn to query suggestion. In order to investigate when and how the user uses query suggestion, we analyzed three kinds of data sets obtained from a major commercial Web search engine, comprising approximately 126 million unique queries, 876 million query suggestions and 306 million action patterns of users. Our analysis shows that query suggestions are often used (1) when the original query is a rare query; (2) when the original query is a single-term query; (3) when query suggestions are unambiguous; (4) when query suggestions are generalizations or error corrections of the original query; and (5) after the user has clicked on several URLs in the first search result page. Our results suggest that search engines should provide better assistance especially when rare or single-term queries are input, and that they should dynamically provide query suggestions according to the searcher�s current state.
Katsumi Tanaka; Tetsuya Sakai
Selectivity Estimation for Spatio-Temporal Queries to Moving Objects
firstname.lastname@example.com email@example.com 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
Characterizing the usability of interactive applications through query log analysis
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
A natural language query interface to structured information
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
Characterizing statistical query learning: simplified notions and proofs
The Statistical Query model was introduced in [6] to handle noise in the well-known PAC model. In this model the learner gains information about the target concept by asking for various statistics about it. Characterizing the number of queries required ...
Bal�zs Sz�r�nyi
The linguistic structure of English web-search queries
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
Selectivity Estimation of Window Queries for Line Segment Datasets
{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
Agent-Based Spatial Query Optimization in a Grid Environment
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
Scalable distributed indexing and query processing over Linked Data
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
Efficient top-k processing over query-dependent functions
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
Enhancing query translation with relevance feedback in translingual information retrieval
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
Dynamic plan migration for snapshot-equivalent continuous queries in data stream systems
A data stream management system executes a large number of continuous queries in parallel. As stream characteristics and query workload change over time, the plan initially installed for a continuous query may become inefficient. As a consequence, the ...
J�rgen Kr�mer; Yin Yang; Michael Cammert; Bernhard Seeger; Dimitris Papadias
Inferring query performance using pre-retrieval predictors
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
VisTool: a Visual Tool for Querying Relational Databases
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
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.
Increasing ask query limit | OpenEI Community
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"
Extreme Chromatography: Faster, Hotter, SmallerChapter 9 Nano-liquid Chromatographic Separations
Extreme Chromatography: Faster, Hotter, Smaller Chapter 9 Nano-liquid Chromatographic Separations Methods and Analyses eChapters Methods - Analyses Books Downloadable pdf of Chapter 9 Nano-liquid Chromatographic Separ
Appendix B � Pre-Selected Query Items - U.S. Energy ...
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
Real-time spatio-temporal analytics using Microsoft StreamInsight
Microsoft StreamInsight (StreamInsight, for brevity) is a platform for developing and deploying streaming applications that run continuous queries over high-rate streaming events. StreamInsight adopts a temporal stream model to handle imperfections in ... Keywords: SQL server, StreamInsight, analytics, complex event processing, data streaming, spatio-temporal
Mohamed Ali; Badrish Chandramouli; Balan S. Raman; Ed Katibah
Photo of the Week: Faster than the Speed of Light | Department of Energy
Photo of the Week: Faster than the Speed of Light Photo of the Week: Faster than the Speed of Light Photo of the Week: Faster than the Speed of Light July 24, 2013 - 2:00pm Addthis If you've ever heard the thunderous sound of a sonic boom, you've experienced the shock waves in the air created by an object traveling faster than the speed of sound. But what happens when an object travels faster than the speed of light? At Jefferson Laboratory, construction is underway to upgrade the Continuous Electron Beam Accelerator Facility (CEBAF) and the CEABF Large Acceptance Spectrometer (CLAS12) at Hall B. During the experiments, the accelerator will shoot electrons at speeds faster than the speed at which light travels in the same medium, creating shock waves that emit a blue light, known as Cherenkov light -- this light is equivalent to the sonic boom. By recording data from Cherenkov light, scientists will be able to map a nucleon's three-dimensional spin.
Web Service Composition Through Declarative Queries: The Case of Conjunctive Queries with Union and Negation
A web service operation can be seen as a function op: X1,...,Xn ? Y1,...,Ym having an input message (request) with n arguments (parts), and an output message (response) with m parts [4, Section 2.2]. For example, opB: Author ?{(ISBN, Title)} may implement a books search service, returning for a given author A a list of books authored by A. We propose to model such operations as relations with access pattern, here: B oio (ISBN, Author, Title), where �oio � indicates that a value for the second attribute must be given as input, while the other attribute values can be retrieved as output. In this way, a family of web service operations over k attributes can be concisely described as a relation R(A1,...,Ak) with an associated set of access patterns P?{i, o} k. Since we model web services as relations with access patterns, we can now use queries as a declarative specifications for web service composition: e.g., the query Q(I, A, T) ? ? B(I, A, T),C(I,A), �L(I) asks for books available through a store B which are contained in a catalog C, but not in the local library L. Let the only access patterns be B ioo, B oio, C oo, and L o. If we try to execute Q from left to right, neither pattern for B works since we either lack an ISBN I or an author A. However, Q is feasible since we can execute it by first calling C(I,A) which binds both I and A; after that, calling B ioo (or B oio) will work. Calling �L(I) first and then B does not work: a negated call can only filter out answers, but cannot produce any new variable bindings. 2. Formal Results We study the problem of deciding whether a query Q is feasible, i.e., whether there exists a logically equivalent query Q ? that can be executed observing the limited access patterns given by the web service (source) relations. Executability depends on the specific syntactic form of a query, while feasibility is a more �robust � semantic notion, in-
Bertram Lud�scher; Alan Nash
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.
Mound Laboratory: Analytical Capability
The Monsanto Research Corporation, Mound Laboratory Analytical Capability report is intended to fulfill a customer need for basic information concerning Mound Laboratory's analytical instrumentation and techniques.
Hendrickson, E. L.
Analytical Microscopy Group Homepage
... research on autoradiography and nuclear track methods ... and standards that address critical challenges in ... Public Safety and Security in Analytical ...
Querying for Feature Extraction and Visualization in Climate Modeling
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
HDF5-FastQuery: An API for Simplifying Access to Data Storage,Retrieval, Indexing and Querying
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
Processing Private Queries over Untrusted Data Cloud through Privacy Homomorphism
Tong, Hong Kong SAR, China {haibo,xujl,csren,email@example.com Abstract--Query processing directory and another on anti-diabetic drugs, together give a higher confidence that the user is probably
Xu, Jianliang
Adaptive Support of Range Queries via Push-Pull Algorithms
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
Query reformulation and refinement using NLP-based sentence clustering
We have developed an interactive query refinement tool that helps users search a knowledge base for solutions to problems with electronic equipment. The system is targeted towards non-technical users, who are often unable to formulate precise problem ...
Fr�d�ric Roulland; Aaron Kaplan; Stefania Castellani; Claude Roux; Antonietta Grasso; Karin Pettersson; Jacki O'Neill
Processing nested complex sequence pattern queries over event streams
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
Multiple Example Queries in Content-Based Image Retrieval
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
TOP-K projection queries for probabilistic business processes
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
Alta Vista: Simple Query "merde d'alors" - CECM
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.
Form EIA-176 Query System Getting Started Guide Version 2
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 ...
EIA 176 Query System, 2001 - Energy Information Administration
On Graph Based Interaction for Semantic Query Languages
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
EIA-176 Query System 2007 - Energy Information Administration
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 ...
Using semantic knowledge to improve web query processing
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
Intuitive Interaction with Encrypted Query Execution in DataStorm
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
Interpretation of coordinations, compound generation, and result fusion for query variants
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
SavvySearch: A MetaSearch Engine that Learns which Search Engines to Query
(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.
Extensible/Rule Based Query Rewrite Optimization in Starburst Hamid Pirahesh
@cs.berkeley.edu, email@example.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.
Answering natural language queries over linked data graphs: a distributional semantics approach
This paper demonstrates Treo, a natural language query mechanism for Linked Data graphs. The approach uses a distributional semantic vector space model to semantically match user query terms with data, supporting vocabulary-independent (or ... Keywords: distributional-compositional semantics, knowledge graphs, natural language queries, schema-agnostic queries, semantic search
Andr� Freitas; Fabr�cio F. de Faria; Se�n O'Riain; Edward Curry
Query Routing in Large-scale Digital Library Systems
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
Comparing crowd-based, game-based, and machine-based approaches in initial query and query refinement tasks
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
A logical treatment of special relativity, with and without faster-than-light observers
There are three goals of this thesis. First: to present a concise yet accessible description of basic mathematical logic and model theory. Second: to develop an axiomatization of special relativity using only two undefined predicates. Ideally, these axioms should be empirically verifiable and supported by a large body of evidence. Finally: to weaken this axiomatization so as to allow for the existence of faster-than-light observers, which are normally excluded from the theory of special relativity. The modifications to the axiom system should be as slight as possible, and should be motivated by the question: what features of the original axiom system preclude the existence of faster-than-light observers?
Benjamin Hoffman
Design of FastQuery: How to Generalize Indexing and Querying System for Scientific Data
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
Analytical Chemistry Databases and Links
Analytical chemistry websites, humor, Material Safety Data Sheets,Patent Information, and references. Analytical Chemistry Databases and Links Analytical Chemistry acid analysis Analytical Chemistry aocs applicants april articles atomic)FluorometryDiffer
Extreme Chromatography: Faster, Hotter, SmallerChapter 4 High-temperature Liquid Chromatography
Extreme Chromatography: Faster, Hotter, Smaller Chapter 4 High-temperature Liquid Chromatography Methods and Analyses eChapters Methods - Analyses Books A0E60F9889E91C3C140760EF7AE5F026 AOCS Press Downloadable pdf...
Extreme Scale Visual Analytics
Extreme-scale visual analytics (VA) is about applying VA to extreme-scale data. The articles in this special issue examine advances related to extreme-scale VA problems, their analytical and computational challenges, and their real-world applications.
Wong, Pak C.; Shen, Han-Wei; Pascucci, Valerio
On concurrency control in sliding window queries over data streams
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
Parallel Index and Query for Large Scale Data Analysis
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
Optimal query/update tradeoffs in versioned dictionaries
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
Effective Graph Clustering for Path Queries in Digital Map Databases
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
T-703: Cisco Unified Communications Manager Open Query Interface Lets
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
Utility rate change propagation is now much faster | OpenEI Community
rate change propagation is now much faster rate change propagation is now much faster Home > Groups > Utility Rate Rmckeel's picture Submitted by Rmckeel(297) Contributor 19 March, 2013 - 16:30 developer Semantic Mediawiki Utility Rates Good news, everyone! Changes to the utility rate template or fields cause small updates on all 29K+ utility rates on OpenEI, which takes time to process. Older versions of mediawiki and semantic mediawiki were not as efficient at handling these. Preliminary results after changing a field and tweaking job run speeds shows a ~60X improvement in speed. Changes to utility rates can now be propagated to the entire database in approximately 35 minutes - before it took more than one day. We are hopeful we will keep seeing various benefits from the upgrade process.
Welcome to Analytical Labs
We've been part of the SRS family for over 50 years. Mission To safely operate nuclear and environmental laboratories in providing the highest quality analytical services to all of...
SRL online Analytical Development
The Savannah River Site is operated by the Westinghouse Savannah River Co. for the Department of Energy to produce special nuclear materials for defense. R&D support for site programs is provided by the Savannah River Laboratory, which I represent. The site is known primarily for its nuclear reactors, but actually three fourths of the efforts at the site are devoted to fuel/target fabrication, fuel/target reprocessing, and waste management. All of these operations rely heavily on chemical processes. The site is therefore a large chemical plant. There are then many potential applications for process analytical chemistry at SRS. The Savannah River Laboratory (SRL) has an Analytical Development Section of roughly 65 personnel that perform analyses for R&D efforts at the lab, act as backup to the site Analytical Laboratories Department and develop analytical methods and instruments. I manage a subgroup of the Analytical Development Section called the Process Control & Analyzer Development Group. The Prime mission of this group is to develop online/at-line analytical systems for site applications.
Jenkins, C.W.
The Savannah River Site is operated by the Westinghouse Savannah River Co. for the Department of Energy to produce special nuclear materials for defense. R D support for site programs is provided by the Savannah River Laboratory, which I represent. The site is known primarily for its nuclear reactors, but actually three fourths of the efforts at the site are devoted to fuel/target fabrication, fuel/target reprocessing, and waste management. All of these operations rely heavily on chemical processes. The site is therefore a large chemical plant. There are then many potential applications for process analytical chemistry at SRS. The Savannah River Laboratory (SRL) has an Analytical Development Section of roughly 65 personnel that perform analyses for R D efforts at the lab, act as backup to the site Analytical Laboratories Department and develop analytical methods and instruments. I manage a subgroup of the Analytical Development Section called the Process Control Analyzer Development Group. The Prime mission of this group is to develop online/at-line analytical systems for site applications.
About Analytical Labs
LOOKING FOR THE RIGHT MIX IN ANALYTICAL SERVICES? LOOKING FOR THE RIGHT MIX IN ANALYTICAL SERVICES? Let's break it down. Analytical Laboratories at the SRS offers a wide-range of analytical capabilities; extensive and highly-specialized facilities; in-depth talent; and an unsurpassed record for providing our customers with the highest quality of service. We've served our nation for more than 50 years. Now, we're ready to provide those same services to you. Call us when you are looking for the right proportion of capabilities, facilities, talent and commitment to excellence. Our Facilities Analytical Laboratories at the SRS offers a wide-range of analytical capabilities; extensive and highly-specialized facilities; in-depth talent; and an unsurpassed record for providing our customers with the highest quality of service. We've served our nation for more than 50 years. Now, we're ready to provide those same services to you. Call us when you are looking for the right proportion of capabilities, facilities, talent and commitment to excellence.
Benefits of path summaries in an XML query optimizer supporting multiple access methods
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
Natural Gas EIA-176 Query System Readme - U.S. Energy ...
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 ...
Efficient Range and Join Query Processing in Massively Distributed Peer-to-Peer Networks.
??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
Towards a characterization of order-invariant queries over tame structures
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
Data sampling control, compression and query in sensor networks
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
Federated Querying Architecture with Clinical & Translational Health IT Application
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
Towards the taxonomy-oriented categorization of yellow pages queries
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
Mining Query Logs: Turning Search Usage Data into Knowledge
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
Query and Predicate Emptiness in Description Logics Franz Baader
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
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
Maximizing Throughput for Queries over Streaming Sensor Data
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
Database design and querying within the fuzzy semantic model
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
CQ-Buddy: Harnessing Peers For Distributed Continuous Query Processing
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
Secure quantum private information retrieval using phase-encoded queries
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)
Mining web query logs to analyze political issues
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
DATA CONCERN AWARE QUERYING FOR THE INTEGRATION OF DATA SERVICES Muhammad Intizar Ali, Reinhard,firstname.lastname@example.com 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
Integrating implicit answers with object-oriented queries
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
Layered Models Top-Down Querying of Normal Logic Programs
For practical applications, the use of top-down query-driven proof-procedures is essential for an efficient use and computation of answers using Logic Programs as knowledge bases. Additionally, abductive reasoning on demand is intrinsically a top-down ... Keywords: Relevance, Semantics, Smodels, XSB-XASP
Lu�s Moniz Pereira; Alexandre Miguel Pinto
Query-Independent learning to rank for RDF entity search
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?
Renewable Analytics | Open Energy Information
Login | Sign Up Search Page Edit with form History Facebook icon Twitter icon Renewable Analytics Jump to: navigation, search Name Renewable Analytics Place San Francisco,...
Semantics and implementation of continuous sliding window queries over data streams
In recent years the processing of continuous queries over potentially infinite data streams has attracted a lot of research attention. We observed that the majority of work addresses individual stream operations and system-related issues rather than ... Keywords: Semantics, continuous queries, data streams, query optimization
J�rgen Kr�mer; Bernhard Seeger
Energy and quality aware query processing in wireless sensor database systems
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
Analysis of multiple query reformulations on the web: The interactive information retrieval context
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
A Query-based Pre-retrieval Model Selection Approach to Information Retrieval
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 email@example.com Abstract In this paper, we propose a query-based pre-retrieval approach to the model selection problem
Jose, Joemon M.
Applying Heuristics to Improve A Genetic Query Optimisation Process in Information Retrieval
Applying Heuristics to Improve A Genetic Query Optimisation Process in Information Retrieval firstname.lastname@example.com 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
Efficient discrete-time simulations of continuous-time quantum query algorithms
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
Ontology-driven relational query formulation using the semantic and assertional capabilities of OWL-DL
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
A safe-exit approach for efficient network-based moving range queries
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
An Energy Efficient Path Finding Query Protocol in Wireless Sensor Networks
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
Automatic Reformulation of Children's Search Queries Maarten van Kalsbeek, Joost de Wit, Dolf Trieschnigg,
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
On efficiently processing nearest neighbor queries in a loosely coupled set of data sources
We propose a family of algorithms for processing nearest neighbor (NN) queries in an integration middleware that provides federated access to numerous loosely coupled, autonomous data sources connected through the internet. Previous approaches for parallel ... Keywords: data integration, distributed query processing, federated database system, kNN, nearest neighbors, parallel query processing
Thomas Schwarz; Markus Iofcea; Matthias Grossmann; Nicola H�nle; Daniela Nicklas; Bernhard Mitschang
Blind chance: on potential trust friends query in mobile social networks
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
Dependency-aware reordering for parallelizing query optimization in multi-core CPUs
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
"I know what you did last summer": query logs and user privacy
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
Efficient processing of multiple continuous skyline queries over a data stream
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
Efficient query recommendations in the long tail via center-piece subgraphs
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
Analytical Division List
Name AffiliationCity, State, CountryAnalytical Division2013 Members391 Members as of October 1, 2013Abdurahman, SadegWashington State UniversityPullman, WA, USAAbuzaytoun, ReemDalhousie UniversityHalifax, NS, CanadaAdcock, JacquiDeakin Universityaurn Ponds
Online query answering with differential privacy: a utility-driven approach using Bayesian inference
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
FastQuery: A Parallel Indexing System for Scientific Data
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,
The Framework for Approximate Queries on Simulation Data
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
Extreme Chromatography: Faster, Hotter, SmallerChapter 5 High-efficiency Liquid Chromatography Separations Achieved by Monolithic Silica Columns
Extreme Chromatography: Faster, Hotter, Smaller Chapter 5 High-efficiency Liquid Chromatography Separations Achieved by Monolithic Silica Columns Methods and Analyses eChapters Methods - Analyses Books AOCS Press Downloada
Extreme Chromatography: Faster, Hotter, SmallerChapter 8 Multiple Parallel Mass Spectrometry Techniques for Lipid and Vitamin D Analysis
Extreme Chromatography: Faster, Hotter, Smaller Chapter 8 Multiple Parallel Mass Spectrometry Techniques for Lipid and Vitamin D Analysis Methods and Analyses eChapters Methods - Analyses Books AOCS Press Downloadable pdf...
Extreme Chromatography: Faster, Hotter, SmallerChapter 10 Comprehensive 2D GC Methodologies for the Analysis of Lipids
Extreme Chromatography: Faster, Hotter, Smaller Chapter 10 Comprehensive 2D GC Methodologies for the Analysis of Lipids Methods and Analyses eChapters Methods - Analyses Books Downloadable pdf of Chapter 10 Comprehens
Extreme Chromatography: Faster, Hotter, SmallerChapter 2 Hydrophilic Interaction Chromatography�An Excellent Method for Separation of Polar Samples
Extreme Chromatography: Faster, Hotter, Smaller Chapter 2 Hydrophilic Interaction Chromatography�An Excellent Method for Separation of Polar Samples Methods and Analyses eChapters Methods - Analyses Books AOCS Press Downlo
Extreme Chromatography: Faster, Hotter, SmallerChapter 1 The Theory and Practice of UHPLC and UHPLC-MS
Extreme Chromatography: Faster, Hotter, Smaller Chapter 1 The Theory and Practice of UHPLC and UHPLC-MS Methods and Analyses eChapters Methods - Analyses Books AOCS Press Downloadable pdf of Chapter 1 The Theory a
Requirements for Predictive Analytics
It is important to have a clear understanding of how traditional Business Intelligence (BI) and analytics are different and how they fit together in optimizing organizational decision making. With tradition BI, activities are focused primarily on providing context to enhance a known set of information through aggregation, data cleansing and delivery mechanisms. As these organizations mature their BI ecosystems, they achieve a clearer picture of the key performance indicators signaling the relative health of their operations. Organizations that embark on activities surrounding predictive analytics and data mining go beyond simply presenting the data in a manner that will allow decisions makers to have a complete context around the information. These organizations generate models based on known information and then apply other organizational data against these models to reveal unknown information.
Troy Hiltbrand
Analytical Division Newsletter April 2013
Read the March newsletter from the Analytical Division. Analytical Division Newsletter April 2013 Membership Information achievement application award Awards distinguished division Divisions fats job Join lipid lipids Member member get a member Me
VISIONARY: a visual query language based on the user viewpoint approach
Query languages for RDBMSs lack in intuitive understanding; this precludes inexperienced users from taking advantage of them. The adoption of a visual interface can simplify the query formulation process by enabling users to interact with a friendly environment. In this work we propose a visual query language based on a hybrid iconic-diagrammatic paradigm, used for both data and query representation. The external data model is called vision and comprises the visual primitives of concept- represented by the combination of text and icon, and association- represented by a name and a multiplicity for each possible orientation. The external query model is based on the definition of a user viewpoint, which is a perspective for accessing data defined dynamically by selecting a concept of primary interest for formulating each query. 1
U-038: BIND 9 Resolver crashes after logging an error in query.c |
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
V-204: A specially crafted query can cause BIND to terminate abnormally |
V-204: A specially crafted query can cause BIND to terminate V-204: A specially crafted query can cause BIND to terminate abnormally V-204: A specially crafted query can cause BIND to terminate abnormally July 27, 2013 - 4:35am Addthis PROBLEM: A specially crafted query that includes malformed rdata can cause named to terminate with an assertion failure while rejecting the malformed query. PLATFORM: BIND 9.7 ABSTRACT: A specially crafted query sent to a BIND nameserver can cause it to crash (terminate abnormally). REFERENCE LINKS: ISC Knowledge Base CVE-2013-4854 IMPACT ASSESSMENT: High DISCUSSION: BIND is an implementation of the Domain Name System (DNS) protocols. Authoritative and recursive servers are equally vulnerable. Intentional exploitation of this condition can cause a denial of service in all nameservers running affected versions of BIND 9. Access Control Lists do
Services Services Our Capabilities Analytical Laboratories at the SRS performs analyses on a wide range of materials, including soil, water, gases, foodstuffs, decommissioning debris, waste, urine, fecal matter and process control samples. The laboratories maintain certifications and qualifications through a variety of governing bodies, which allows multiple applications of our services. Each year, we process over 200,000 samples and over half a million determinations, with an error-free rate better than 99.99%. Our Services We offer a full complement of nuclear counting and chemical processing methods, including microwave/hot block digestion of solids; alpha pulse height analyzer (PHA), gamma PHA and liquid scintillation counter, diode array spectrophotometer, ICP emission spectrometer, ICP mass spectrometer, thermal ionization mass spectrometer, chemical titrators, and IR analyzer. In addition, we offer unique environmental and industrial hygiene analytical services, including rapid analysis of radiological contaminants in water, soil, and human matrices; Radiological American Industrial Hygiene Association-accredited beryllium, lead, other metals, hexavalent chromium, and asbestos analyses.
QCS : a system for querying, clustering, and summarizing documents.
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.
QCS: a system for querying, clustering and summarizing documents.
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)
Analytical Modeling | Open Energy Information
Analytical Modeling Analytical Modeling Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Exploration Technique: Analytical Modeling Details Activities (1) Areas (1) Regions (0) NEPA(0) Exploration Technique Information Exploration Group: Data and Modeling Techniques Exploration Sub Group: Modeling Techniques Parent Exploration Technique: Modeling Techniques Information Provided by Technique Lithology: Stratigraphic/Structural: Hydrological: Thermal: Dictionary.png Analytical Modeling: A mathematical modeling technique used for simulating, explaining, and making predictions about the mechanisms involved in complex physical processes. Other definitions:Wikipedia Reegle Introduction Analytical models are mathematical models that have a closed form solution. Or in other words the solution to the equations used to describe changes in
EIA-176 Query System 2006 - U.S. Energy Information Administration ...
The query system application is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later.
Query Expansion Research and Application in Search Engine Based on Concepts Lattice.
??Formal concept analysis is increasingly applied to query expansion and data mining problems. In this paper I analyze and compare the current concept lattice construction� (more)
Cui, Jun
Adaptive Range Counting and Other Frequency-Based Range Query Problems.
??We consider variations of range searching in which, given a query range, our goal is to compute some function based on frequencies of points that� (more)
Wilkinson, Bryan T.
Event-Driven Dynamic Query Model for Sleep Study Outcomes Research.
??This research work presents a software solution, called PSG Query System, for sleep study clinicians and researchers as a part of an integrated effort for� (more)
Jain, Sulabh
External occulters, otherwise known as starshades, have been proposed as a solution to one of the highest priority yet technically vexing problems facing astrophysics-the direct imaging and characterization of terrestrial planets around other stars. New apodization functions, developed over the past few years, now enable starshades of just a few tens of meters diameter to occult central stars so efficiently that the orbiting exoplanets can be revealed and other high-contrast imaging challenges addressed. In this paper, an analytic approach to the analysis of these apodization functions is presented. It is used to develop a tolerance analysis suitable for use in designing practical starshades. The results provide a mathematical basis for understanding starshades and a quantitative approach to setting tolerances.
Cash, Webster [Center for Astrophysics and Space Astronomy, University of Colorado, Boulder, CO 80309 (United States)
Nuclear Material Dissolution from Destructive Analysis Measurements Nuclear Material Dissolution from Destructive Analysis Measurements Overview The Savannah River Site F/H Laboratories perform nuclear material dissolution of Pu/U oxides and metals plus Np oxide to support site productions/remediation projects. Nuclear material dissolutions are performed in glovebox containment via microwaves, hot blocks and hot plates. Resulting solutions are aliquotted for a variety of elemental and compound analyses. Features Varying sample size (100 mg - 30 g) High temperature digestions up to 200°C computer-controlled temperature and pressure dissolutions Excellent analyte recovery in destructive analysis Commercially-available electronic equipment with trained operators capable of handling high alpha activity levels (facility source term limit of 310 Alpha Curies)
Appendix C, Analytical Data | Department of Energy
C, Analytical Data Appendix C, Analytical Data Docket No. EO-05-01: Appendix C, Analytical Data from Final Report: Particulate Emissions Testing, Unit 1, Potomac River Generating...
MetaBrowser: A combined browsing, query, and analysis tool
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.
A faster algorithm for smoothed particle hydrodynamics with radiative transfer in the flux-limited diffusion approximation
We describe a new, faster implicit algorithm for solving the radiation hydrodynamics equations in the flux-limited diffusion approximation for smoothed particle hydrodynamics. This improves on the method elucidated in Whitehouse & Bate by using a Gauss-Seidel iterative method rather than iterating over the exchange of energy between pairs of particles. The new algorithm is typically many thousands of times faster than the old one, which will enable more complex problems to be solved. The new algorithm is tested using the same tests performed by Turner & Stone for ZEUS-2D, and repeated by Whitehouse & Bate.
Stuart C. Whitehouse; Matthew R. Bate; Joe J. Monaghan
CoCache: query processing based on collaborative caching in P2P systems
In this paper, we propose CoCache, a P2P query processing architecture that enables sophisticated optimization techniques. CoCache is different from existing P2P query processing systems in three ways. First, a coordinator overlay network (CON) maintaining ...
Weining Qian; Linhao Xu; Shuigeng Zhou; Aoying Zhou
Towards musical query-by-semantic-description using the CAL500 data set
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
Reordering an index to speed query processing without loss of effectiveness
Following Long and Suel, we empirically investigate the importance of document order in search engines which rank documents using a combination of dynamic (query-dependent) and static (query-independent) scores, and use document-at-a-time (DAAT) processing. ... Keywords: efficiency and effectiveness, enterprise search, information retrieval, inverted files
David Hawking; Timothy Jones
A knowledge infrastructure for intelligent query answering in location-based services
Intelligent query answering in Location-based Services refers to their capability to provide mobile users with personalized and contextualized answers. Personalization is expected to lead to answers that better match user's interests, as inferable from ... Keywords: Context-awareness, Contextualization, Location-based services, Ontology, Personalization, Query answering, User profile
Shijun Yu; Stefano Spaccapietra
Group-based Query Learning for rapid diagnosis in time-critical situations
In query learning, the goal is to identify an unknown object while minimizing the number of "yes or no" questions (queries) posed about that object. We consider three extensions of this fundamental problem that are motivated by practical considerations in real-world, time-critical identification tasks such as emergency response. First, we consider the problem where the objects are partitioned into groups, and the goal is to identify only the group to which the object belongs. Second, we address the situation where the queries are partitioned into groups, and an algorithm may suggest a group of queries to a human user, who then selects the actual query. Third, we consider the problem of query learning in the presence of persistent query noise, and relate it to group identification. To address these problems we show that a standard algorithm for query learning, known as the splitting algorithm or generalized binary search, may be viewed as a generalization of Shannon-Fano coding. We then extend this result to t...
Bellala, Gowtham; Scott, Clayton
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Pivot-based algorithms are effective tools for proximity searching in metric spaces. They allow trading space overhead for number of distance evaluations performed at query time. With additional search structures (that pose extra space overhead) they ... Keywords: fixed queries tree, metric spaces, range search, similarity search
Edgar Ch�vez; Jos� L. Marroqu�n; Gonzalo Navarro
Efficient exact edit similarity query processing with the asymmetric signature scheme
Given a query string Q, an edit similarity search finds all strings in a database whose edit distance with Q is no more than a given threshold t. Most existing method answering edit similarity queries rely on a signature scheme to generate candidates ... Keywords: Q-gram, approximate pattern matching, edit distance, similarity join, similarity search
Jianbin Qin; Wei Wang; Yifei Lu; Chuan Xiao; Xuemin Lin
A Customized Web Search Engine Using a Tiny WebSQL Query Language
and indexed to be stored in the search engine's database. When a user enters a #12; 7 search query After the user enters the keywords as the search query, the search engine will perform the search with the stemming, which is the grammatical variation of search terms such as "eat" and "eating". 3. It cannot
An approach to solve division-like queries in fuzzy object databases
The division operator is well known in the context of fuzzy relational databases. Fuzzy approaches to this operator can be found in the literature to solve flexible queries: these approaches try to compute to which extent each element of a candidate ... Keywords: Division, Flexible queries, Fuzzy object databases, Inclusion
Nicol�s Mar�n; Carlos Molina; Olga Pons; M. Amparo Vila
Evaluation of top-k OLAP queries using aggregate r�trees
A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example of such a query is �find the 10 combinations of product-type ...
Nikos Mamoulis; Spiridon Bakiras; Panos Kalnis
Weakly-supervised discovery of named entities using web search queries
A seed-based framework for textual information extraction allows for weakly supervised extraction of named entities from anonymized Web search queries. The extraction is guided by a small set of seed named entities, without any need for handcrafted extraction ... Keywords: knowledge acquisition, named entities, query logs, unstructured text, weakly supervised information extraction
FICSR: feedback-based inconsistency resolution and query processing on misaligned data sources
A critical reality in data integration is that knowledge from different sources may often be conflicting with each other. Conflict resolutioncan be costly and, if done without proper context, can be ineffective. In this paper, we propose a novel query-driven ... Keywords: conflicts, query processing, reasoning with misaligned data, relevance feedback, taxonomy
Yan Qi; K. Sel�uk Candan; Maria Luisa Sapino
Seeding simulated queries with user-study data forpersonal search evaluation
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
Rapid Development of Web-Based Query Interfaces for XML Datasets with QURSED
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
Inferring the demographics of search users: social data meets search queries
Knowing users' views and demographic traits offers a great potential for personalizing web search results or related services such as query suggestion and query completion. Such signals however are often only available for a small fraction of search ... Keywords: personalized search, social networks, user demographics
Bin Bi, Milad Shokouhi, Michal Kosinski, Thore Graepel
ICTASDiscoveryAnalyticsCenter Sustainable
IDAC ICTASDiscoveryAnalyticsCenter Nanoscale Science Nano-Bio Interface Sustainable Energy on the basis of race, gender, disability, age, veteran status, national origin, religion, sexual orientation
Beex, A. A. "Louis"
NERSC Job Logs and Analytics
& Allocations Policies Data Analytics & Visualization Science Gateways User Surveys NERSC Users Group User Announcements Help Operations for: Passwords & Off-Hours Status...
A search for the Mpemba effect: When hot water freezes faster then cold water James D. Brownridge
..." and "...Preheating the melt produces no certain effect upon it ..."6 In other words, if a specimen of water voltage produced the when latent heat of freezing is released. (A) Glass tube and water, (B) 500k, (CA search for the Mpemba effect: When hot water freezes faster then cold water James D. Brownridge
Suzuki, Masatsugu
A user centred approach to determining the impact of faster broadband on small and medium sized enterprises
This paper explores, through interviews with a small number of users, the potential impact of faster broadband speeds on UK based small and medium sized enterprises. The paper describes the actions taken to ameliorate the risk of drawing conclusions ... Keywords: SME, broadband, framework, human centred design, user experience
Doug Williams, Andy Gower, Joshan Meenowa, Jon Wakeling
Query-Driven Network Flow Data Analysis and Visualization
This document is the final report for a WFO agreement between LBNL and the National Visualization and Analytics Center at PNNL. The document lists project milestones, their completion date, research results and findings. In brief, the project focuses on testing the hypothesis that the duty cycle in scientific discovery can be reduced by combining visual analytics interfaces, novel visualization techniques and scientific data management technology.
Bethel, E. Wes
Analytical laboratory quality audits
Analytical Laboratory Quality Audits are designed to improve laboratory performance. The success of the audit, as for many activities, is based on adequate preparation, precise performance, well documented and insightful reporting, and productive follow-up. Adequate preparation starts with definition of the purpose, scope, and authority for the audit and the primary standards against which the laboratory quality program will be tested. The scope and technical processes involved lead to determining the needed audit team resources. Contact is made with the auditee and a formal audit plan is developed, approved and sent to the auditee laboratory management. Review of the auditee's quality manual, key procedures and historical information during preparation leads to better checklist development and more efficient and effective use of the limited time for data gathering during the audit itself. The audit begins with the opening meeting that sets the stage for the interactions between the audit team and the laboratory staff. Arrangements are worked out for the necessary interviews and examination of processes and records. The information developed during the audit is recorded on the checklists. Laboratory management is kept informed of issues during the audit so there are no surprises at the closing meeting. The audit report documents whether the management control systems are effective. In addition to findings of nonconformance, positive reinforcement of exemplary practices provides balance and fairness. Audit closure begins with receipt and evaluation of proposed corrective actions from the nonconformances identified in the audit report. After corrective actions are accepted, their implementation is verified. Upon closure of the corrective actions, the audit is officially closed.
Kelley, William D.
Improved steamflood analytical model
The Jeff Jones steamflood model incorporates oil displacement by steam as described by Myhill and Stegemeier, and a three-component capture factor based on empirical correlations. The main drawback of the model however is the unsatisfactory prediction of the oil production peak: usually significantly lower than the actual. Our study focuses on improving this aspect of the Jeff Jones model. In our study, we simulated the production performance of a 5-spot steamflood pattern unit and compared the results against those based on the Jeff Jones model. Three reservoir types were simulated using 3-D Cartesian black oil models: Hamaca (9�?°API), San Ardo (12�?°API) and that based on the SPE fourth comparative solution project (14�?°API). In the first two field cases, a 45x23x8 model was used that represented 1/8 of a 10-acre 5-spot pattern unit, using typical rock and reservoir fluid properties. In the SPE project case, three models were used: 23x12x12 (2.5 ac), 31x16x12 (5 ac) and 45x23x8 (10 ac), that represented 1/8 of a 5-spot pattern unit. To obtain a satisfactory match between simulation and Jeff Jones analytical model results of the start and height of the production peak, the following refinements to the Jeff Jones model were necessary. First, the dimensionless steam zone size AcD was modified to account for decrease in oil viscosity during steamflood and its dependence on the steam injection rate. Second, the dimensionless volume of displaced oil produced VoD was modified from its square-root format to an exponential form. The modified model gave very satisfactory results for production performance up to 20 years of simulated steamflood, compared to the original Jeff Jones model. Engineers will find the modified model an improved and useful tool for prediction of steamflood production performance.
Chandra, Suandy
Explanatory Business Analytics in OLAP
In this paper the authors describe a method to integrate explanatory business analytics in OLAP information systems. This method supports the discovery of exceptional values in OLAP data and the explanation of such values by giving their underlying causes. ... Keywords: Business Analytics, Exception Reporting, Explanation, OLAP, Variance Analysis
Emiel Caron, Hennie Daniels
Data Analytics and Visualization at NERSC
Mathematica Python tools - Numpy, Scipy, iPython, matplotlib (This may be a restful query, a dynamic list of Visit pages.) Case Studies (Dani to decide what needs to be brought...
A top-down approach for compressing data cubes under the simultaneous evaluation of multiple hierarchical range queries
A novel top-down compression technique for data cubes is introduced and experimentally assessed in this paper. This technique considers the previously unrecognized case in which multiple Hierarchical Range Queries (HRQ), a very useful class ... Keywords: Advanced OLAP, Compressing data cubes under simultaneous multiple OLAP queries, Multi-objective compression of data cubes, Multiple-query data cube compression techniques
Alfredo Cuzzocrea
ANALYTICAL DATA SHEET hlul ANALYTICAL DEPT. - HEALTH ANI SAFETY...
Office of Legacy Management (LM)
hlul ANALYTICAL DEPT. - HEALTH ANI SAFETY DlVlSlON Industrial Hygiene or Medical Dept. 1956 I. H. 1093 Sample Nos. 9 -Date Collected- 812 by-LLP Route to I"? Lo,--tionrOGERS...
SNL software manual for the ACS Data Analytics Project.
In the ACS Data Analytics Project (also known as 'YumYum'), a supercomputer is modeled as a graph of components and dependencies, jobs and faults are simulated, and component fault rates are estimated using the graph structure and job pass/fail outcomes. This report documents the successful completion of all SNL deliverables and tasks, describes the software written by SNL for the project, and presents the data it generates. Readers should understand what the software tools are, how they fit together, and how to use them to reproduce the presented data and additional experiments as desired. The SNL YumYum tools provide the novel simulation and inference capabilities desired by ACS. SNL also developed and implemented a new algorithm, which provides faster estimates, at finer component granularity, on arbitrary directed acyclic graphs.
Stearley, Jon R.; McLendon, William Clarence, III; Rodrigues, Arun F.; Williams, Aaron S.; Hooper, Russell Warren; Robinson, David Gerald; Stickland, Michael G.
TreeQ-VISTA: An Interactive Tree Visualization Tool withFunctional Annotation Query Capabilities
Summary: We describe a general multiplatform exploratorytool called TreeQ-Vista, designed for presenting functional annotationsin a phylogenetic context. Traits, such as phenotypic and genomicproperties, are interactively queried from a relational database with auser-friendly interface which provides a set of tools for users with orwithout SQL knowledge. The query results are projected onto aphylogenetic tree and can be displayed in multiple color groups. A richset of browsing, grouping and query tools are provided to facilitatetrait exploration, comparison and analysis.Availability: The program,detailed tutorial and examples are available online athttp://genome-test.lbl.gov/vista/TreeQVista.
Gu, Shengyin; Anderson, Iain; Kunin, Victor; Cipriano, Michael; Minovitsky, Simon; Weber, Gunther; Amenta, Nina; Hamann, Bernd; Dubchak,Inna
Computing $\\pi(x)$ Analytically
We describe a rigorous implementation of the Lagarias and Odlyzko Analytic Method to evaluate the prime counting function and its use to compute unconditionally the number of primes less than $10^{24}$.
Platt, David J
Video Analytics for Business Intelligence
Closed Circuit TeleVision (CCTV) cameras have been increasingly deployed pervasively in public spaces including retail centres and shopping malls. Intelligent video analytics aims to automatically analyze content of massive amount of public space video ...
Caifeng Shan; Fatih Porikli; Tao Xiang; Shaogang Gong
Dynamic View Management System for Query Prediction to View Materialization
On-Line Analytical Processing OLAP systems based on data warehouses are the main systems for managerial decision making and must have a quick response time. Several algorithms have been presented to select the proper set of data and elicit suitable structured ... Keywords: Data Warehousing, Dynamic View Materialization, OLAP, Probabilistic Reasoning Approaches, View Prediction, View Selection
Negin Daneshpour; Ahmad Abdollahzadeh Barfourosh
From regular expressions to nested words: unifying languages and query execution for relational and XML sequences
There is growing interest in query language extensions for pattern matching over event streams and stored database sequences, due to the many important applications that such extensions make possible. The push for such extensions has led DBMS vendors ...
Barzan Mozafari; Kai Zeng; Carlo Zaniolo
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these uncertain databases, an important query is the Probabilistic k-Nearest-Neighbor ...
Reynold Cheng; Lei Chen; Jinchuan Chen; Xike Xie
A corpus analysis approach for automatic query expansion and its extension to multiple databases
Searching online text collections can be both rewarding and frustrating. While valuable information can be found, typically many irrelevant documents are also retrieved, while many relevant ones are missed. Terminology mismatches between the user's ... Keywords: query expansion
Susan Gauch; Jianying Wang; Satya Mahesh Rachakonda
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be expressed as queries selecting objects that satisfy complex local conditions ...
Construction of Query Concepts in a Document space based on Data Mining Techniques
Chang,Y. Kim,M. Ounis,I. In Proceedings of the 6th International Conference On Flexible Query Answering Systems (FQAS 2004), Lecture Notes in Artificial Intelligence, June 24-26 2004, Lyon, France. Sun Microsystems Inc.
Chang, Y.; Kim, M.; Ounis, I.
Adaptive stream filters for entity-based queries with non-value tolerance
We study the problem of applying adaptive filters for approximate query processing in a distributed stream environment. We propose filter bound assignment protocols with the objective of reducing communication cost. Most previous works focus on value-based ...
Reynold Cheng; Ben Kao; Sunil Prabhakar; Alan Kwan; Yicheng Tu
Integrated k-NN query processing based on geospatial data services
Geospatial data service (GDS) is a type of web service that provides access to collections of geospatial data. User can search remote spatial data through the interface provided by service. This paper focuses on integrated k-NN query processing ...
Guifen Tang; Luo Chen; Yunxiang Liu; Shulei Liu; Ning Jing
Analytical Division Seed Oil Translation Table
seed oil translation table nomencalture Analytical Division Seed Oil Translation Table Analytical Chemistry Analytical Chemistry aocs articles atomic)FluorometryDifferential scanning calorimetry chemistry Chromatography (liquid detergents esters fats fo
Query estimation and order-optimized iteration in very large federations
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
Analytical Dashboards | Department of Energy
Reporting » Analytical Dashboards Reporting » Analytical Dashboards Analytical Dashboards Public Final Occurrence Reports: Searchable information on DOE's Final Occurrence Reports since 2009, available to the public and updated daily. Computerized Accident Incident Reporting System (CAIRS) - Injury and Illness Dashboard: The Injury and Illness Dashboard is a tool that allows users to easily explore DOE occupational safety and health injury and illness information. Its features include: Graphical and tabular depictions of injury and illness information Calendar year and fiscal year incidence rates for DOE and DOE contractor total recordable cases (TRC) of injuries and illnesses and cases involving days away from work or on job transfer or restriction (DART) due to injury or illness Incidence rates of injuries and illnesses by DOE program
Ecologic Analytics | Open Energy Information
Ecologic Analytics Ecologic Analytics Jump to: navigation, search Name Ecologic Analytics Place Bloomington, Minnesota Zip 55425 Product Minnesota-based meter data management company. Coordinates 42.883574°, -90.926122° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":42.883574,"lon":-90.926122,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}
Appendix C Analytical Chemistry Data
Analytical Chemistry Data This page intentionally left blank Contents Section Analytical Data for Deleted Contaminants of Concern ............................................................. C1.O Mol~tezuma Creek Hardness Dat Surface Water Copper Data Summa ................ CI-9 Surface Water Radium-228 Dat Surface Water Radon-222 Data Summary ....................... ....................................... . . . . . . . . . . . C l - I 2 Alluvial Ground Water Aln~noniuu~ as Nitrogen Data Summary ....................... . . . ................................ Cl-15 Alluvial Ground Water Cobalt Data Summary ........... Alluvial Ground Water Copper Data Sumrl Alluvial Ground Water Lead Data Su~nmary ................................. C1-19 Alluvial Ground Water Lead-210 Data Sutl~rnary
Pyro-E Pyro-E University of California-Berkeley 190 likes Pyro-E, LLC is developing a solid-state device for waste heat harvesting at the distributed energy scale. The device is designed based on the pyroelectric effect and can be used to improve the fuel-use efficiency of 300 million vehicles and generators in the United States. Learn More SiNode Systems Northwestern University 31 likes SiNode Systems is a battery materials venture developing silicon-graphene anodes for the next generation of lithium-ion batteries. SiNode anodes offer higher battery capacity and faster charging rates, all while being produced via a low cost solution chemistry-based manufacturing process. Learn More Picasolar University of Arkansas 16 likes Picasolar wholly owns the hydrogen selective emitter (HSE) technology. HSE
Picasolar Picasolar University of Arkansas 16 likes Picasolar wholly owns the hydrogen selective emitter (HSE) technology. HSE can increase the efficiency of solar cells by up to 15 percent and remove up to 33 percent of the silver grid lines in a conventional silicon solar cell. Learn More SiNode Systems Northwestern University 31 likes SiNode Systems is a battery materials venture developing silicon-graphene anodes for the next generation of lithium-ion batteries. SiNode anodes offer higher battery capacity and faster charging rates, all while being produced via a low cost solution chemistry-based manufacturing process. Learn More Pyro-E University of California-Berkeley 190 likes Pyro-E, LLC is developing a solid-state device for waste heat harvesting at the distributed energy scale. The device is designed based on the
The Sea-Breeze Front Analytical Model
Analytical solutions to the nonlinear equations of motion are used to describe the sea breeze front.
Yizhak Feliks
PARABOLIC EXHAUSTIONS AND ANALYTIC COVERINGS Finnur L´arusson January 31, 1993 Abstract. Let be a parabolic exhaustion on a Stein manifold X such that is strictly plurisubharmonic at its zeros. The metric to be parabolic because its logarithm is plurisubharmonic and satisfies the so-called Monge-Amp`ere equation
Lárusson, Finnur
Analytic properties of transition amplitudes
are vectors in Lorent z s pace . 10. Dirac y-mat r ' ces. It i s sually supposed that i ts precise f orm has no effe ct on the analytic pro~ rties of the integr , so t ha t i t suff i ces to t ake V = 1, al though under certain condit ions t his...
Landshoff, Peter Vincent
An Application of Multivariate Statistical Analysis for Query-Driven Visualization
Abstract?Driven by the ability to generate ever-larger, increasingly complex data, there is an urgent need in the scientific community for scalable analysis methods that can rapidly identify salient trends in scientific data. Query-Driven Visualization (QDV) strategies are among the small subset of techniques that can address both large and highly complex datasets. This paper extends the utility of QDV strategies with a statistics-based framework that integrates non-parametric distribution estimation techniques with a new segmentation strategy to visually identify statistically significant trends and features within the solution space of a query. In this framework, query distribution estimates help users to interactively explore their query's solution and visually identify the regions where the combined behavior of constrained variables is most important, statistically, to their inquiry. Our new segmentation strategy extends the distribution estimation analysis by visually conveying the individual importance of each variable to these regions of high statistical significance. We demonstrate the analysis benefits these two strategies provide and show how they may be used to facilitate the refinement of constraints over variables expressed in a user's query. We apply our method to datasets from two different scientific domains to demonstrate its broad applicability.
Gosink, Luke J.; Garth, Christoph; Anderson, John C.; Bethel, E. Wes; Joy, Kenneth I.
Visionary: a viewpoint-based visual language for querying relational databases
The adoption of a visual interface can simplify the query formulation process in DBMSs by enabling naive users to interact with a friendly environment. In this work we propose a visual query language based on a diagrammatic paradigm, used for both data and query representation. The external data model is called vision and is made up of the visual primitives of concept and association. The external query model is based on the definition of a viewpoint, which is a perspective for accessing data defined dynamically by selecting a concept of primary interest. Internally, the data model is relational and the query language is SQL. An intermediate graph-based model ensures consistent mapping between the visual and the relational worlds. Our language has been implemented within a tool which can be mounted on top of any relational DBMS supporting ODBC. The system has been tested with naive users; the results of the experiment are reported and compared with those obtained with other visual languages. Keywords and phrases: VPL-II.B.1: Diagrammatic languages, VPL-V.B: Database languages 1
Extreme Chromatography: Faster, Hotter, SmallerChapter 6 Silver-ion High-performance Liquid Chromatography�Mass Spectrometry in the Analysis of Lipids
Extreme Chromatography: Faster, Hotter, Smaller Chapter 6 Silver-ion High-performance Liquid Chromatography�Mass Spectrometry in the Analysis of Lipids Methods and Analyses eChapters Methods - Analyses Books Downloadable pdf...
Energy Analytics | Open Energy Information
Energy Analytics Energy Analytics Place Brewster, New York Product New York-based energy management and curtailment company. Coordinates 48.099675°, -119.78091° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":48.099675,"lon":-119.78091,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}
Adaptive time-to-live strategies for query result caching in web search engines
Abstract. An important research problem that has recently started to receive attention is the freshness issue in search engine result caches. In the current techniques in literature, the cached search result pages are associated with a fixed time-to-live (TTL) value in order to bound the staleness of search results presented to the users, potentially as part of a more complex cache refresh or invalidation mechanism. In this paper, we propose techniques where the TTL values are set in an adaptive manner, on a per-query basis. Our results show that the proposed techniques reduce the fraction of stale results served by the cache and also decrease the fraction of redundant query evaluations on the search engine backend compared to a strategy using a fixed TTL value for all queries.
Sadiye Alici; Ismail Sengor Altingovde; Rifat Ozcan; B. Barla Cambazoglu; �zg�r Ulusoy
Query-Driven Visualization of Time-Varying Adaptive Mesh Refinement Data
The visualization and analysis of AMR-based simulations is integral to the process of obtaining new insight in scientific research. We present a new method for performing query-driven visualization and analysis on AMR data, with specific emphasis on time-varying AMR data. Our work introduces a new method that directly addresses the dynamic spatial and temporal properties of AMR grids which challenge many existing visualization techniques. Further, we present the first implementation of query-driven visualization on the GPU that uses a GPU-based indexing structure to both answer queries and efficiently utilize GPU memory. We apply our method to two different science domains to demonstrate its broad applicability.
Gosink, Luke J.; Anderson, John C.; Bethel, E. Wes; Joy, Kenneth I.
Bridging the Virtual Observatory and the GRID with the query element
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
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation
This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target keyword in an ordered list of the i-th block. Apart from much studied polynomial and adversary methods for quantum query complexity lower bounds, our argument shows that the multiple-block ordered search needs a large number of nonadaptive oracle queries on a black-box model of quantum computation that is also supplemented with advice. Our argument is also applied to the notions of computational complexity theory: quantum truth-table reducibility and quantum truth-table autoreducibility.
Harumichi Nishimura; Tomoyuki Yamakami
A Framework for Moving Sensor Data Query and Retrieval of Dynamic Atmospheric Events
Abstract. One challenge in Earth science research is the accurate and efficient ad-hoc query and retrieval of Earth science satellite sensor data based on user-defined criteria to study and analyze atmospheric events such as tropical cyclones. The problem can be formulated as a spatiotemporal join query to identify the spatio-temporal location where moving sensor objects and dynamic atmospheric event objects intersect, either precisely or within a user-defined proximity. In this paper, we describe an efficient query and retrieval framework to handle the problem of identifying the spatio-temporal intersecting positions for satellite sensor data retrieval. We demonstrate the effectiveness of our proposed framework using sensor measurements from QuikSCAT (wind field measurement) and TRMM (precipitation vertical profile measurements) satellites, and the trajectories of the tropical cyclones occurring in the North Atlantic Ocean in 2009. Key words: data retrieval, satellite data, atmospheric events, spatiotemporal
Shen-shyang Ho; Wenqing Tang; W. Timothy Liu; Markus Schneider
U-270:Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query
0:Trend Micro Control Manager Input Validation Flaw in Ad Hoc 0:Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query Module Lets Remote Users Inject SQL Commands U-270:Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query Module Lets Remote Users Inject SQL Commands September 28, 2012 - 6:00am Addthis PROBLEM: Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query Module Lets Remote Users Inject SQL Commands PLATFORM: Control Manager - 3.0, 3.5, 5.0, 5.5, 6.0 ABSTRACT: Trend Micro has been notified of a potential product vulnerability in Control Manager. reference LINKS: Trend Micro Technical Support ID 1061043 SecurityTracker Alert ID: 1027584 Secunia Advisory SA50760 CVE-2012-2998 IMPACT ASSESSMENT: Medium Discussion: A vulnerability has been reported in Trend Micro Control Manager, which can
Rule-based query answering method for a knowledge base of economic crimes
We present a description of the PhD thesis which aims to propose a rule-based query answering method for relational data. In this approach we use an additional knowledge which is represented as a set of rules and describes the source data at concept (ontological) level. Queries are posed in the terms of abstract level. We present two methods. The first one uses hybrid reasoning and the second one exploits only forward chaining. These two methods are demonstrated by the prototypical implementation of the system coupled with the Jess engine. Tests are performed on the knowledge base of the selected economic crimes: fraudulent disbursement and money laundering.
Bak, Jaroslaw
First, Fast and Faster
... unable to find a commercially-available laser system that provided them with as much optical power as they ... Stimulated generation of superluminal ...
Faster Phase Estimation
We develop several algorithms for performing quantum phase estimation based on basic measurements and classical post-processing. We present a pedagogical review of quantum phase estimation and simulate the algorithm to numerically determine its scaling in circuit depth and width. We show that the use of purely random measurements requires a number of measurements that is optimal up to constant factors, albeit at the cost of exponential classical post-processing; the method can also be used to improve classical signal processing. We then develop a quantum algorithm for phase estimation that yields an asymptotic improvement in runtime, coming within a factor of log* of the minimum number of measurements required while still requiring only minimal classical post-processing. The corresponding quantum circuit requires asymptotically lower depth and width (number of qubits) than quantum phase estimation.
Krysta M. Svore; Matthew B. Hastings; Michael Freedman
Better, Faster, More Secure
Since I started a stint as chair of the IETF (Internet Engineering Task Force) in March 2005, I have frequently been asked, �What�s coming next?� but I have usually declined to answer. Nobody is in charge of the Internet, which is ...
Brian Carpenter
Using ECA rules to implement mobile query agents for fast-evolving pure P2P database systems
A challenging issue in fast-evolving pure P2P networks is the design of an appropriate mechanism for processing queries. Since both the data content of the peers as well as their acquaintances, change rapidly the typical P2P querying techniques become ... Keywords: ECA model, P2P systems, mobile agents, mobile databases
Verena Kantere; Aris Tsois
ETTA-IM: A deep web query interface matching approach based on evidence theory and task assignment
Integrating Deep Web data sources require highly accurate matches between the attributes of the query interfaces. While interface matching has received more attentions recently, current approaches are still not sufficiently perfect: (a) they all suppose ... Keywords: Deep Web, Query interface matching, Schema matching, Web data integration
Yongquan Dong; Qingzhong Li; Yanhui Ding; Zhaohui Peng
Disambiguated query suggestions and personalized content-similarity and novelty ranking of clustered results to optimize web searches
In this paper, we face the so called ''ranked list problem'' of Web searches, that occurs when users submit short requests to search engines. Generally, as a consequence of terms' ambiguity and polysemy, users engage long cycles of query reformulation ... Keywords: Novelty ranking, Personalized Web results ranking, Query disambiguation, Results clustering, Web meta-searching
Gloria Bordogna; Alessandro Campi; Giuseppe Psaila; Stefania Ronchi
Real life, real users, and real needs: a study and analysis of user queries on the web
searches are based on the exact terms that a user enters in the query, however, capitalization terms in addition to terms entered. Search results are provided in ranked relevance order. A number, and use of relevance feedback; (ii) queries Ð the number of search terms, and the use of logic and modi
Medical image databases content-based queries partitioning on a grid1 Johan Montagnata, Vincent Bretonb, Isabelle Magnina
Medical image databases content-based queries partitioning on a grid1 Johan Montagnata, Vincent study the impact of executing a medical image database query application on the grid. For lowering Introduction Medical imaging is data intensive due to the size of medical images. Digital medical images
Google Analytics | OpenEI Community
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...
Analytical Division Newsletter September 201/span>3
Read the September newsletter from the Analytical Division. Analytical Division Newsletter September 201/span>3 Membership Information achievement application award Awards distinguished division Divisions fats job Join lipid lipids Member member get a
Analytical Requirements for Petroleum Contaminated Soils
Analytical Requirements for Petroleum Contaminated Soils According to 20 NMAC 9.1.704 704. REQUIRED), or other applicable statutes. Page 1 of 1Analytical Requirements for Petroleum Contaminated Soils 4
Definition: Analytical Modeling | Open Energy Information
Analytical Modeling Jump to: navigation, search Dictionary.png Analytical Modeling 1. A simple version: A model is a simplified representation of some aspect of the real world. 2....
AOCS Analytical Guidelines Am 1a-09
Near Infrared Spectroscopy Instrument Management and Prediction Model Development. Am 1a-09. AOCS Analytical Guidelines Am 1a-09 Methods Methods and Analyses Analytical Chemistry Methods Downloads Methods Downloads AOCS ...
Data, information and analytics as services
While organizations are trying to become more agile to better respond to market changes in the midst of rapidly globalizing competition by adopting service orientation-commoditization of business processes, architectures, software, infrastructures and ... Keywords: Agile analytics, Analytics-as-a-service, Business analytics, Cloud computing, Data-as-a-service, Information-as-a-service, Service-orientation
Dursun Delen, Haluk Demirkan
Using google analytics to explore ETDs use
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
Optimization of Accurate Top-k Query in Sensor Networks with Cached Data
-pan,li-ml,firstname.lastname@example.com Wei Shu Department of Electrical and Computer Engineering The University of New Mexico Albuquerque, NM to the rate at which it consumes energy. Additionally, the radio communication is orders of magnitude more sensor readings to optimize the query processing. By using the aggregated historical data in intermediate
Remote sensing image segmentation by active queries Devis Tuia a,n
Remote sensing image segmentation by active queries Devis Tuia a,n , Jordi Mun~oz-Mari´ b , Gustavo Multiscale image segmentation Remote sensing Hyperspectral imagery Multispectral imagery a b s t r a c- istics in a compact way. For remote sensing image segmentation, the selected samples are the most
Camps-Valls, Gustavo
Query Answering over DL ABoxes: How to Pick the Relevant Symbols
is decidable in ALC and ALCI, but relevance regarding instance queries is unde- cidable in ALCF and relevance.g., for ALCF. To see this, take T = { ( 1 r) A} and = {r}. Then A is IQ- and CQ-relevant with UNA due of IQ- (and thus also CQ-) relevance, and a NExpTimeNP upper bound; for ALCF, we prove undecidability
Lutz, Carsten
Not so creepy crawler: easy crawler generation with standard xml queries
Web crawlers are increasingly used for focused tasks such as the extraction of data from Wikipedia or the analysis of social networks like last.fm. In these cases, pages are far more uniformly structured than in the general Web and thus crawlers can ... Keywords: data extraction, web crawler, web query, xml
Franziska von dem Bussche; Klara Weiand; Benedikt Linse; Tim Furche; Fran�ois Bry
Using lexico-semantic information for query expansion in passage retrieval for question answering
In this paper we investigate the use of several types of lexico-semantic information for query expansion in the passage retrieval component of our QA system. We have used four corpus-based methods to acquire semantically related words, and we have used ...
Lonneke van der Plas; J�rg Tiedemann
Clash of the typings: finding controversies and children's topics within queries
The TadPolemic system identifies whether web search queries (1) are controversial in nature and/or (2) pertain to children's topics. We are incorporating it into a children's web search engine to assist children's search during difficult topics, as well ... Keywords: children's search, controversy detection
Karl Gyllstrom; Marie-Francine Moens
Adaptive Optimization of Join Trees for Multi-join Queries over Sensor Streams
Hyeong-Ah Choi Department of Computer Science The George Washington University Washington, DC, USA Email window based multi-join queries over continuous data streams and prove its NP-Hardness. We present stream, sliding windows, adaptive optimization, dynamic program- ming I. INTRODUCTION Due to advancements
Querying Large Geo Image Databases: A Case Study1 PETER BAUMANN
of the Bavarian Land Survey Authority. The state of Bavaria covers 20% of the area of Germany; its aerial firstname.lastname@example.com Abstract: Online services based on extremely large volumes of aerial and satellite imagery are be- coming query support for the functionality sketched. Providing maps and aerial imagery of Bavaria is the task
Baumann, Peter
A Hybrid Query Language for an Extended Entity-Relationship Model
We present the hybrid query language HQL/EER for an Extended Entity-Relationship model. As its main characteristic, this language allows a user to use both graphical and textual elements in the formulation of one and the same query. We demonstrate the lookand -feel of this query language by means of examples, and show how syntax and semantics of this language are formally defined using programmed graph rewriting systems. Although we present the language in the context of the EER model, the concept of hybrid languages is applicable in the context of other database models as well. We illustrate this claim by discussing a prototype implementation of a Hybrid Query Tool based on an object-oriented approach, namely the Object Modeling Technique (OMT). 1 Introduction The database research efforts of the past decade have provided us with a wide range of both database models and systems, allowing the user to perform complex manipulations on data structures of high modeling power. Th...
Marc Andries; Gregor Engels
Use of Multiword Terms and Query Expansion for Interactive Information Retrieval
Use of Multiword Terms and Query Expansion for Interactive Information Retrieval Fidelia Ibekwe in the INEX 2008 Ad- Hoc Retrieval track. We investigated the effect of multiword terms on retrieval-Hoc tasks: Focused retrieval, Relevant-in-Context and Best-in-Context. 1 Introduction The INEX Ad-Hoc track
Query Processing for Probabilistic State Diagrams Describing Multiple Robot Navigation in an Indoor Environment
This paper describes the syntax and semantics of multi-level state diagrams to support probabilistic behavior of cooperating robots. The techniques are presented to analyze these diagrams by querying combined robots behaviors. It is shown how to use state abstraction and transition abstraction to create, verify and process large probabilistic state diagrams.
Czejdo, Bogdan [ORNL; Bhattacharya, Sambit [North Carolina Fayetteville State University; Ferragut, Erik M [ORNL
An incremental approach to closest pair queries in spatial networks using best-first search
This paper addresses the problem of k Closest Pairs (kCP) query in spatial network databases. A Best-First search approach namely BFCP (Best-First Closest Pair) is proposed. Given two data sets of objects in a spatial network, BFCP first finds the 1st ... Keywords: buffer management, closest pair, location-based services, spatial networks
Chunan Chen; Weiwei Sun; Baihua Zheng; Dingding Mao; Weimo Liu
Parallelization of XPath queries using multi-core processors: challenges and experiences
In this study, we present experiences of parallelizing XPath queries using the Xalan XPath engine on shared-address space multi-core systems. For our evaluation, we consider a scenario where an XPath processor uses multiple threads to concurrently navigate ...
Rajesh Bordawekar; Lipyeow Lim; Oded Shmueli
Efficient and robust query processing in dynamic environments using random walk techniques
Many existing systems for sensor networks rely on state information stored in the nodes for proper operation (e.g., pointers to parent in a spanning tree, routing information, etc). In dynamic environments, such systems must adopt failure recovery mechanisms, ... Keywords: query processing, random walk, sensor networks
Chen Avin; Carlos Brito
Ficsr: Feedback-based InConSistency Resolution and query processing on misaligned data sources
A critical reality in data integration is that knowledge from different sources may often be conflicting with each other. Conflict resolution can be costly and, if done without proper context, can be ineffective. In this paper, we propose a novel query-driven and feedback-based approach (FICSR 1) to conflict resolution when integrating data sources. In particular, instead of relying on traditional model based definition of consistency, we introduce a ranked interpretation. This not only enables FICSR to deal with the complexity of the conflict resolution process, but also helps achieve a more direct match between the users � (subjective) interpretation of the data and the system�s (objective) treatment of the available alternatives. Consequently, the ranked interpretation leads to new opportunities for bi-directional (data informs ? ? user) feedback cycle for conflict resolution: given a query, (a) a preliminary ranking of candidate results on data can inform the user regarding constraints critical to the query, while (b) user feedback regarding the ranks can be exploited to inform the system about user�s relevant domain knowledge. To enable this feedback process, we develop data structures and algorithms for efficient off-line conflict/agreement analysis of the integrated data as well as for on-line query processing, candidate result enumeration, and validity analysis. The results are brought together and evaluated in the FICSR system.
Yan Qi; K. Sel�uk Candan
The time-based data partitioning method for XML query optimization
With today's technology it is essential that databases operate efficiently and effectively. Temporal databases are a case in point with reference to data and volume of material. This paper proposes an XML temporal database model, and importantly, an ... Keywords: XML, XMLTable, XPath, XQuery, partitioning, query performance, temporal databases
Majed Abdullah Algarni
Towards OLAP query reformulation in peer-to-peer data warehousing
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
Using query-relevant documents pairs for cross-lingual information retrieval
The world wide web is a natural setting for cross-lingual information retrieval. The European Union is a typical example of a multilingual scenario, where multiple users have to deal with information published in at least 20 languages. Given queries ...
David Pinto; Alfons Juan; Paolo Rosso
CSCE4350 SQL Query Assignment Date Issued: 9/20/2012
. List all customers 3. Find loan number, branch name, and the loan amount multiplied by 10 of each loan, loan number and loan amount of all customers having a loan at the Downtown branch. 7. Find the names with the query number, e.g Part A.1. Make sure your file runs before submitting it because the TA will check
Huang, Yan
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve known substructures in the data, the Protein-Protein Interactions (PPIs) networks. ... Keywords: Graph query, pattern matching, dynamic programming, protein-protein interactions networks.
Guillaume Blin; Florian Sikora; Stephane Vialette
A path-traceable query routing mechanism for search in unstructured peer-to-peer networks
Unstructured Peer-to-Peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. Searching for content in unstructured P2P networks is a challenging task because the distribution of objects ... Keywords: Dynamic network, Network topologies, Peer-to-peer (P2P), Query routing
Ming Xu; Shuigeng Zhou; Jihong Guan; Xiaohua Hu
Divide-and-query and subterm dependency tracking in the mercury declarative debugger
We have implemented a declarative debugger for Mercury that is capable of finding bugs in large, long-running programs. This debugger implements several search strategies. We discuss the implementation of two of these strategies and the conditions under ... Keywords: algorithmic debugging, declarative debugging, divide-and-query, program slicing
Ian MacLarty; Zoltan Somogyi; Mark Brown
Visualizing the results of interactive queries for geographic data on mobile devices
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
Schema-as-you-go: on probabilistic tagging and querying of wide tables
The emergence of Web 2.0 has resulted in a huge amount of heterogeneous data that are contributed by a large number of users, engendering new challenges for data management and query processing. Given that the data are unified from various sources and ... Keywords: dynamic instantiation, probabilistic tagging, wide table
Meiyu Lu; Divyakant Agrawal; Bing Tian Dai; Anthony K.H. Tung
Real life information retrieval: a study of user queries on the Web
related terms in addition to terms entered. Search results are provided in a ranked relevance order data on: (i) queries - the number of search terms, and the use of logic and modifiers, (ii) sessions) terms - their rank/frequency distribution and the most highly used search terms. Common mistakes
Jansen, James
Real Life Information Retrieval: A Study Of User Queries On The Web Major Bemard J. Jansen
related terms in addition to terms entered. Search results are provided in a ranked relevance order data on: (i) queries - the number of search terms, and the use of logic and modifiers, (ii) terms - their rank/frequency distribution and the most highly used search terms. Common mistakes
A framework for distributed mediation of temporal-abstraction queries to clinical databases
Objective:: The specification and creation of a distributed system that integrates medical knowledge bases with time-oriented clinical databases; the goal is to answer complex temporal queries regarding both raw data and its abstractions, such as are ... Keywords: Clinical systems, Knowledge-based systems, Mediators, Medical informatics, Temporal abstraction, Temporal reasoning
David Boaz; Yuval Shahar
Optimization of continuous query processing for RFID sensor tag data stream
In RFID system, RFID tags emit data continuously and sensed by RFID access point. RFID data are appears in form of stream data items to RFID host. By this RFID data collecting, RFID system provides identification information of objects which tags attached ... Keywords: RFID sensor tag, RFID system, continuous query, data stream management system
Yongxu Piao; Wooseok Ryu; Haipeng Zhang; Bonghee Hong
Some modifications of bucket-based algorithms for query rewriting using views
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
OF OHIO HEALTH AND SAFETY DIVISION - ANALYTICAL DEPT. ANALYTICAL DATA SHEET NO. DISTRIBUTION OF COPIES 1 Analytical Laboratory (RECORD COPP) 2 Industrial Hygiene 8 Radiotion...
OCIO Technology Summit: Data Analytics | Department of Energy
OCIO Technology Summit: Data Analytics OCIO Technology Summit: Data Analytics May 13, 2013 - 1:51pm Addthis OCIO Technology Summit: Data Analytics The Energy Department's Office of...
HEALTH AND SAFETY DIVISION - ANALYTICAL DEPT. ANALYTICAL DATA SHEET NLO NO. DISTRIBUTION OF COPIES 1 Analytical Loboratory (RECORD COPY) 2 Industrial Hygiene & Radiation Dept. 3...
Widget:AnalyticsSummary | Open Energy Information
AnalyticsSummary AnalyticsSummary Jump to: navigation, search Google Analytics widget that returns an HTML summary of site-wide analytics. Use any arbitrary number of days; for instance, 30-31 days will say "a month", 7 days will say "a week", 1 day will say "a day", 365 days will say "a year", and all other day rates will say "n days". How to call it: {{#Widget:AnalyticsSummary|days=30}} Example Output Loading... Statistics summary for the last 1 7 30 365 days Retrieved from "http://en.openei.org/w/index.php?title=Widget:AnalyticsSummary&oldid=535712" Category: Widgets What links here Related changes Special pages Printable version Permanent link Browse properties 429 Throttled (bot load) Error 429 Throttled (bot load)
Coupling of Two Motor Proteins: A New Motor Can Move Faster Evgeny B. Stukalin, Hubert Phillips III, and Anatoly B. Kolomeisky
Coupling of Two Motor Proteins: A New Motor Can Move Faster Evgeny B. Stukalin, Hubert Phillips III February 2005; published 13 June 2005) We study the effect of a coupling between two motor domains in highly processive motor protein complexes. A simple stochastic discrete model, in which the two parts
Extreme Chromatography: Faster, Hotter, SmallerChapter 7 Recent Advances in Comprehensive Two-Dimensional Liquid Chromatography for the Analysis of Natural Products
Extreme Chromatography: Faster, Hotter, Smaller Chapter 7 Recent Advances in Comprehensive Two-Dimensional Liquid Chromatography for the Analysis of Natural Products Methods and Analyses eChapters Methods - Analyses Books F7E3E452FCB43F6D
Nanomechanical Sensor Detects and Identifies Chemical Analytes
ORNL 2010-G00612/jcn UT-B ID 200802066 Nanomechanical Sensor Detects and Identifies Chemical Analytes Technology Summary ORNL researchers developed a ...
AOCS Analytical Guidelines S 3-64
Methods for the Testing of Epoxidized Oils AOCS Analytical Guidelines S 3-64 Methods Downloads Methods Downloads AOCS DEFINITION Not applicable� SCOPE
Contained radiological analytical chemistry module
DOE Patents (OSTI)
A system which provides analytical determination of a plurality of water chemistry parameters with respect to water samples subject to radiological contamination. The system includes a water sample analyzer disposed within a containment and comprising a sampling section for providing predetermined volumes of samples for analysis; a flow control section for controlling the flow through the system; and a gas analysis section for analyzing samples provided by the sampling system. The sampling section includes a controllable multiple port valve for, in one position, metering out sample of a predetermined volume and for, in a second position, delivering the material sample for analysis. The flow control section includes a regulator valve for reducing the pressure in a portion of the system to provide a low pressure region, and measurement devices located in the low pressure region for measuring sample parameters such as pH and conductivity, at low pressure. The gas analysis section which is of independent utility provides for isolating a small water sample and extracting the dissolved gases therefrom into a small expansion volume wherein the gas pressure and thermoconductivity of the extracted gas are measured.
Barney, David M. (Scotia, NY)
Non-Uniform Data Complexity of Query Answering in Description Logics
In ontology-based data access (OBDA), ontologies are used as an interface for querying instance data. Since in typical applications the size of the data is much larger than the size of the ontology and query, data complexity is the most important complexity measure. In this paper, we propose a new method for investigating data complexity in OBDA: instead of classifying whole logics according to their complexity, we aim at classifying each individual ontology within a given master language. Our results include a P/coNP-dichotomy theorem for ontologies of depth one in the description logic ALCFI, the equivalence of a P/coNP-dichotomy theorem for ALC/ALCI-ontologies of unrestricted depth to the famous dichotomy conjecture for CSPs by Feder and Vardi, and a non-P/coNP-dichotomy theorem for ALCF-ontologies.
Carsten Lutz; Frank Wolter
Comprehensive Metadata Query Interface for Heterogeneous Data Archives Based on Open Source PostgreSQL ORDBMS
We use PostgreSQL DBMS for storing XML metadata, described by the IVOA Characterisation Data Model. Initial XML type support in the PostgreSQL has recently been implemented. We make heavy use of this feature in order to provide comprehensive search over Characterisation metadata tree. We built a prototype of the Characterisation metadata query service, implementing two access methods: (1) HTTP-GET/POST based interface implements almost direct translation of the query parameter name into XPath of the data model element in the XML serialisation; (2) Web-Service based interface to receive XQuery which is also directly translated into XPath. This service will be used in the ASPID-SR archive, containing science-ready data obtained with the Russian 6-m telescope.
Ivan Zolotukhin; Nikolay Samokhvalov; Francois Bonnarel; Igor Chilingarian
An Information-Theoretic Privacy Criterion for Query Forgery in Information Retrieval
In previous work, we presented a novel information-theoretic privacy criterion for query forgery in the domain of information retrieval. Our criterion measured privacy risk as a divergence between the user's and the population's query distribution, and contemplated the entropy of the user's distribution as a particular case. In this work, we make a twofold contribution. First, we thoroughly interpret and justify the privacy metric proposed in our previous work, elaborating on the intimate connection between the celebrated method of entropy maximization and the use of entropies and divergences as measures of privacy. Secondly, we attempt to bridge the gap between the privacy and the information-theoretic communities by substantially adapting some technicalities of our original work to reach a wider audience, not intimately familiar with information theory and the method of types.
Rebollo-Monedero, David; Forn�, Jordi
Balance Calibration and Use in an Analytical Environment ...
... the sources of weighing errors in analytical environments, methodologies for ... to use of balances in an analytical environment where compliance ...
The Evolving Leadership Path of Visual Analytics
This is a requested book chapter for an internationally authored book on visual analytics and related fields, coordianted by a UK university and to be published by Springer in 2012. This chapter is an overview of the leadship strategies that PNNL's Jim Thomas and other stakeholders used to establish visual analytics as a field, and how those strategies may evolve in the future.
Kluse, Michael; Peurrung, Anthony J.; Gracio, Deborah K.
Technosocial predictive analytics for illicit nuclear trafficking
Illicit nuclear trafficking networks are a national security threat. These networks can directly lead to nuclear proliferation, as state or nonstate actors attempt to identify and acquire nuclear weapons-related expertise, technologies, components, and ... Keywords: analytical gaming, decision making, illicit trafficking, knowledge management, modeling, nuclear proliferation, predictive analytics
Antonio Sanfilippo; Scott Butner; Andrew Cowell; Angela Dalton; Jereme Haack; Sean Kreyling; Rick Riensche; Amanda White; Paul Whitney
Business Intelligence and Analytics: Research Directions
Business intelligence and analytics (BIA) is about the development of technologies, systems, practices, and applications to analyze critical business data so as to gain new insights about business and markets. The new insights can be used for improving ... Keywords: Business intelligence, business analytics
Ee-Peng Lim; Hsinchun Chen; Guoqing Chen
Budget allocation and the analytic hierarchy process
This report demonstrates that the priorities calculated by the Analytic Hierarchy Process can be used as measures of benefit for budget allocation. A procedure is described that optimally allocates a budget among competing DOE waste minimization projects. The projects are compared using an analytic hierarchy already developed by Sandia National Laboratories. 2 refs., 3 tabs.
Hulme, B.L. (Hulme Mathematics (USA))
Nanochannel and its application in analytical chemistry
The nanochannels method for the separation and detection of analytes plays an important role in the analytical chemistry and is exhibiting the great potential advantages and promising future. In this review we bring together and discuss a number of nanochannels ... Keywords: applications, nanochannels, preparation, separation
Zenglian Yue; Guoqing Zhao; Bin Peng; Shasheng Huang
Strong Analytic Controllability for Hydrogen Control Systems
The realization and representation of so(4,2) associated with the hydrogen atom Hamiltonian are derived. By choosing operators from the realization of so(4,2) as interacting Hamiltonians, a hydrogen atom control system is constructed, and it is proved that this control system is strongly analytically controllable based on a time-dependent strong analytic controllability theorem.
Chunhua Lan; Tzyh-Jong Tarn; Quo-Shin Chi; John W. Clark
eoretical Terms without Analytic Truths Michael Strevens
eoretical Terms without Analytic Truths Michael Strevens To appear in Philosophical Studies A When new theoretical terms are introduced into scienti c discourse, pre- vailing accounts imply, analytic a new account of the intro- duction of theoretical terms that avoids both de nition and reference- xing
Strevens, Michael
Visual Analytics at the Pacific Northwest
customers. The success of PNNL's information visualization software, such as IN-SPIRETM and StarlightTM, and publications in top visualization journals and conference proceedings are the results of PNNL researchers with a focus on analytical reasoning facilitated by interactive visual interfaces. PNNL's visual analytics team
Scale and complexity in visual analytics
The fundamental problem that we face is that a variety of large-scale problems in security, public safety, energy, ecology, health care and basic science all require that we process and understand increasingly vast amounts and variety of data. There ... Keywords: analytics, scalability, visual analytics, visualization
George Robertson; David Ebert; Stephen Eick; Daniel Keim; Ken Joy
Licenses Available in Analytical Instrumentation | ORNL
Analytical Instrumentation Analytical Instrumentation SHARE Analytical Instrumentation 199700361 Neutron Detection Using an Embedded Sol-Gel Neutron Absorber 199700370 Bioluminescent Bioreporter Integrated Circuits 199900683 Microscale Ion Trap Mass Spectrometer 200101009 Automated Sampling for Microarray Readout Using Electrospray Mass Spectrometry 200201069 Planar Flow-By Electrode Capacitive Electrospray Ion Source 200201145 Fluorescent Nanoparticles for Radiation Detection 200301290 Pulse Thermal Processing of Functional Materials Using a Directed Plasma Arc 200401367 Composite Solid-State Scintillators for Neutron Detection 200501505 Resistive-Glass Drift Tube for Use as a Controlled Kinetic Energy Ion Source 200601675 Functionalized Gold Nanoparticles for Rapid,
Lee Cyclogenesis. Part I: Analytic Studies
The growth of synoptic scale cyclones imbedded in a baroclinically unstable zonal flow over a long straight mountain range is investigated. Two different analytical models of the phenomenon are used.
J. L. Hayes; R. T. Williams; M. A. Rennick
Analytical Solutions for Cloud-Drop Concentration
This note compares and evaluates the analytical solutions of Squires and Twomey for cloud droplet concentration. Either solution is likely to be fairly accurate (�30%) when the slope parameter (?) of the cloud condensation nuclei distribution is ...
David B. Johnson
Analytic Representations of Standard Atmosphere Temperature Profiles
Analytic functions which approximate six commonly used standard temperature profiles (the AFGL set, and the 1976 U.S. Standard) are described. These provide a uniform way of rounding off the sharp corners of the original models, and have been ...
Stephen B. Fels
Analytical Land�Atmosphere Radiometer Model
Conversion of radiometric land surface temperature (?r) to an equivalent isothermal (aerodynamic) surface temperature (?i) is important in balancing the land surface energy budget with satellite-based ?r measurements. An analytical land�...
Ayman Suleiman; Richard Crago
AOCS Analytical Guidelines Ja 12-89
Analysis of Lecithin Co-Products AOCS Analytical Guidelines Ja 12-89 Methods Downloads Methods Downloads AOCS DEFINITION These guidelines identify standard methods that are recommended for th
Analytic Power LLC | Open Energy Information
Analytic Power LLC Analytic Power LLC Jump to: navigation, search Name Analytic Power LLC Place Woburn, Massachusetts Zip 01801 Sector Hydrogen Product Fuel cell developer Website http://www.analytic-power.com/ Coordinates 42.4884618°, -71.1329685° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":42.4884618,"lon":-71.1329685,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}
Visualization and Analytics Software at NERSC
Analytics Analytics Visualization and Analytics AVS/Express AVS/Express includes functionality for data visualization and analysis, image processing and data display. It uses a graphical application development environment. Read More » VisIt - 3D Scientific Visualization VisIt is a point-and-click 3D scientific visualization application that supports most common visualization techniques (e.g., isocontouring and volume rendering) on structured and unstructured grids. Due to its distributed and parallel architecture, VisIt is able to handle very large datasets interactively. In addition, VisIt is extensible, allowing users to add data loaders or additional analysis tools to VisIt. The NERSC Analytics Group has developed extensions to VisIt to support NERSC user applications,
Software and Analytical Tools | Department of Energy
Information Resources » Software and Analytical Tools Information Resources » Software and Analytical Tools Software and Analytical Tools October 8, 2013 - 2:12pm Addthis Software and analytical tools are available to help Federal agencies implement energy- and water-efficiency projects. Building Energy Software Tools Directory: This U.S. Department of Energy's Building Technology Office website lists more than 400 software tools for evaluating energy efficiency in facilities. Building Life Cycle Cost (BLCC) Programs: The following National Institute of Standards and Technology programs help compute and analyze capital investments in buildings: BLCC5 Program: Analyze capital investments in buildings. Energy Escalation Rate Calculator: Compute an average annual escalation rate. Distributed Generation Energy Technology Capital Costs: This National
Building Adoption of Visual Analytics Software
Adoption of technology is always difficult. Issues such as having the infrastructure necessary to support the technology, training for users, integrating the technology into current processes and tools, and having the time, managerial support, and necessary funds need to be addressed. In addition to these issues, the adoption of visual analytics tools presents specific challenges that need to be addressed. This paper discusses technology adoption challenges and approaches for visual analytics technologies.
Chinchor, Nancy; Cook, Kristin A.; Scholtz, Jean
FGD Chemistry and Analytical Methods Handbook
The purpose of this handbook is to provide a comprehensive guide to sampling, analytical, and physical test methods essential to the operation, maintenance, and understanding of flue gas desulfurization (FGD) system chemistry. EPRI sponsored the preparation of the first version of this multi-volume report in the mid-1980s in response to the needs of electric utility personnel responsible for establishing and operating FGD analytical laboratories. Prompted by the results of research into various nonstanda...
Bruhat-Tits buildings and analytic geometry
This paper provides an overview of the theory of Bruhat-Tits buildings. Besides, we explain how Bruhat-Tits buildings can be realized inside Berkovich spaces. In this way, Berkovich analytic geometry canbe used to compactify buildings. We discuss in detail the example of the special linear group. Moreover, we give an intrinsic description of Bruhat-Tits buildings in the framework of non-Archimedean analytic geometry.
Remy, Bertrand; Werner, Annette
Query Tool
... It is based upon Tcl/Tk 8.0 with a tree viewing extension, TkTree 4.2, and builds upon the SP SGML parser/validator software. ...
The U.S. Department of Energy's Integrated Surveillance Program (ISP) is responsible for the storage and surveillance of plutonium-bearing material. During storage, plutonium-bearing material has the potential to generate hydrogen gas from the radiolysis of adsorbed water. The generation of hydrogen gas is a safety concern, especially when a container is breached within a glove box during destructive evaluation. To address this issue, the DOE established a standard (DOE, 2004) that sets the criteria for the stabilization and packaging of material for up to 50 years. The DOE has now packaged most of its excess plutonium for long-term storage in compliance with this standard. As part of this process, it is desirable to know within reasonable certainty the total maximum pressure of hydrogen and other gases within the 3013 container if safety issues and compliance with the DOE standards are to be attained. The principal goal of this investigation is to document the method and query used to estimate total (i.e. hydrogen and other gases) gas pressure within a 3013 container based on the material properties and estimated moisture content contained in the ISP database. Initial attempts to estimate hydrogen gas pressure in 3013 containers was based on G-values (hydrogen gas generation per energy input) derived from small scale samples. These maximum G-values were used to calculate worst case pressures based on container material weight, assay, wattage, moisture content, container age, and container volume. This paper documents a revised hydrogen pressure calculation that incorporates new surveillance results and includes a component for gases other than hydrogen. The calculation is produced by executing a query of the ISP database. An example of manual mathematical computations from the pressure equation is compared and evaluated with results from the query. Based on the destructive evaluation of 17 containers, the estimated mean absolute pressure was significantly higher (P.10) between the mean pressures from DR and the calculation. The mean predicted absolute pressure was consistently higher than GEST by an average difference of 57 kPa (8 psi). The mean difference between the estimated pressure and digital radiography was 11 kPa (2 psi). Based on the initial results of destructive evaluation, the pressure query was found to provide a reasonably conservative estimate of the total pressure in 3013 containers whose material contained minimal moisture content.
Friday, G; L. G. Peppers, L; D. K. Veirs, D
The U.S. Department of Energy's Integrated Surveillance Program (ISP) is responsible for the storage and surveillance of plutonium-bearing material. During storage, plutonium-bearing material has the potential to generate hydrogen gas from the radiolysis of adsorbed water. The generation of hydrogen gas is a safety concern, especially when a container is breached within a glove box during destructive evaluation. To address this issue, the DOE established a standard (DOE, 2004) that sets the criteria for the stabilization and packaging of material for up to 50 years. The DOE has now packaged most of its excess plutonium for long-term storage in compliance with this standard. As part of this process, it is desirable to know within reasonable certainty the total maximum pressure of hydrogen and other gases within the 3013 container if safety issues and compliance with the DOE standards are to be attained. The principal goal of this investigation is to document the method and query used to estimate total (i.e. hydrogen and other gases) gas pressure within a 3013 container based on the material properties and estimated moisture content contained in the ISP database. Initial attempts to estimate hydrogen gas pressure in 3013 containers was based on G-values (hydrogen gas generation per energy input) derived from small scale samples. These maximum G-values were used to calculate worst case pressures based on container material weight, assay, wattage, moisture content, container age, and container volume. This paper documents a revised hydrogen pressure calculation that incorporates new surveillance results and includes a component for gases other than hydrogen. The calculation is produced by executing a query of the ISP database. An example of manual mathematical computations from the pressure equation is compared and evaluated with results from the query. Based on the destructive evaluation of 17 containers, the estimated mean absolute pressure was significantly higher (P<.01) than the mean GEST pressure. There was no significant difference (P>.10) between the mean pressures from DR and the calculation. The mean predicted absolute pressure was consistently higher than GEST by an average difference of 57 kPa (8 psi). The mean difference between the estimated pressure and digital radiography was 11 kPa (2 psi). Based on the initial results of destructive evaluation, the pressure query was found to provide a reasonably conservative estimate of the total pressure in 3013 containers whose material contained minimal moisture content.
User's manual for QUERY: a computer program for retrieval of environmental data
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.
Developing Guidelines for Assessing Visual Analytics Environments
Visual analytic systems can be evaluated from a user perspective with quantitative metrics (i.e., time to complete the analysis or the accuracy of the solution found). However, qualitative measures are also useful in a user assessment. These include such measures as the utility of the interactive visualizations in the analysis process and the user's assessment of the efficiency of the analytic process. Quantitative measures can be found if data sets with embedded ground truth are used for analysis. Qualitative measures are more elusive. In this paper we report on an experiment with professional analysts who ranked five of submissions to the VAST 2009 Challenge and provided the rationale for their rankings. Their comments were used in conjunction with a meta-analysis of the 2009 VAST Challenge reviews to produce a set of guidelines for visual analytic systems. As visual analytic software is expected to eventually help in all aspects of analysis, we expect to see future systems provide more help with generating the final report. Hence, researchers also need to have an understanding of what makes a good analytic product. Therefore we asked the analysts to rank the situational assessments of four grand challenge entries and to provide comments on those assessments. We used these comments to produce guidelines for researchers to use in evaluating their analytic reports.
Scholtz, Jean
How can I query data on OpenEI and generate a map? | OpenEI Community
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:
Validation examples of the Analytic Hierarchy Process and Analytic Network Process
One way to validate a scientific theory is to show that the results predicted by the theory give correct answers; that is, that they match known results. In the Analytic Hierarchy Process (AHP) this usually means finding examples with measures in an ... Keywords: Compatibility index for the AHP, Validating the Analytic Hierarchy Process, Validating the Analytic Network Process, Validation examples for the AHP, Validation examples for the ANP
Rozann Whitaker
Solving Similarity Joins and Range Queries in Metric Spaces with the List of Twin Clusters
The metric space model abstracts many proximity or similarity problems, where the most frequently considered primitives are range and k-nearest neighbor search, leaving out the similarity join, an extremely important primitive. In fact, despite the great attention that this primitive has received in traditional and even multidimensional databases, little has been done for general metric databases. We solve two variants of the similarity join problem: (1) range joins: Given two sets of objects and a distance threshold r, find all the object pairs (one from each set) at distance at most r; and (2) k-closest pair joins: Find the k closest object pairs (one from each set). For this sake, we devise a new metric index, coined List of Twin Clusters (LTC), which indexes both sets jointly, instead of the natural approach of indexing one or both sets independently. Finally, we show how to use the LTC in order to solve classical range queries. Our results show significant speedups over the basic quadratic-time naive alternative for both join variants, and that the LTC is competitive with the original list of clusters when solving range queries. Furthermore, we show that our technique has a great potential for improvements.
Rodrigo Paredes; Nora Reyes
Raising the IQ in full-text searching via intelligent querying
Current Information Retrieval (IR) technologies allow for efficient access to relevant information, provided that user selected query terms coincide with the specific linguistical choices made by the authors whose works constitute the text-base. Therefore, the challenge is to enhance the limited searching capability of state-of-the-practice IR. This can be done either with augmented clients that overcome current server searching deficiencies, or with added capabilities that can augment searching algorithms on the servers. The technology being investigated is that of deductive databases, with a set of new techniques called cooperative answering. This technology utilizes semantic networks to allow for navigation between possible query search term alternatives. The augmented search terms are passed to an IR engine and the results can be compared. The project utilizes the OSTI Environment, Safety and Health Thesaurus to populate the domain specific semantic network and the text base of ES&H related documents from the Facility Profile Information Management System as the domain specific search space.
Kero, R.; Russell, L.; Swietlik, C. [Argonne National Lab., IL (United States); Morgan, C. [USDOE/Environment, Safety and Health (EH-5) (United States); Clayton, C.; Dunlap, K. [USDOE Office of Scientific and Technical Information, Oak Ridge, TN (United States)
Analytical Estimation of CO2 Storage Capacity in Depleted Oil and Gas Reservoirs Based on Thermodynamic State Functions
Numerical simulation has been used, as common practice, to estimate the CO2 storage capacity of depleted reservoirs. However, this method is time consuming, expensive and requires detailed input data. This investigation proposes an analytical method to estimate the ultimate CO2 storage in depleted oil and gas reservoirs by implementing a volume constrained thermodynamic equation of state (EOS) using the reservoir?s average pressure and fluid composition. This method was implemented in an algorithm which allows fast and accurate estimations of final storage, which can be used to select target storage reservoirs, and design the injection scheme and surface facilities. Impurities such as nitrogen and carbon monoxide, usually contained in power plant flue gases, are considered in the injection stream and can be handled correctly in the proposed algorithm by using their thermodynamic properties into the EOS. Results from analytical method presented excellent agreement with those from reservoir simulation. Ultimate CO2 storage capacity was predicted with an average difference of 1.3%, molar basis, between analytical and numerical methods; average oil, gas, and water saturations were also matched. Additionally, the analytical algorithm performed several orders of magnitude faster than numerical simulation, with an average of 5 seconds per run.
Valbuena Olivares, Ernesto
An Assessment of Analytical Capabilities, Services and Tools...
An Assessment of Analytical Capabilities, Services and Tools for Demand Response Title An Assessment of Analytical Capabilities, Services and Tools for Demand Response Publication...
Waste Treatment and Immobilization Plant (WTP) Analytical Laboratory...
Plasma Atomic Emission Spectrometry (LA-ICP-MSLA-ICP-AES) subsystems of the Analytical Hot Cell Laboratory System (AHL), which provide the analytical equipment systems for the...
Analysis and Selection of Analytical Tools to Assess National...
and Selection of Analytical Tools to Assess National-Interest Transmission Bottlenecks Final Report Analysis and Selection of Analytical Tools to Assess National-Interest...
EA-0970: Environmental Safety and Health Analytical Laboratory...
70: Environmental Safety and Health Analytical Laboratory Project No. 94-AA-01 Pantex Plant, Amarillo, Texas EA-0970: Environmental Safety and Health Analytical Laboratory Project...
Report on Inspection of Analytical Laboratories Oversight at...
Analytical Laboratories Oversight at the Strategic Petroleum Reserve, INS-9502 Report on Inspection of Analytical Laboratories Oversight at the Strategic Petroleum Reserve,...
Evans Analytical Group EAG | Open Energy Information
Analytical Group EAG Analytical Group EAG Jump to: navigation, search Name Evans Analytical Group (EAG) Place Sunnyvale, California Zip 94086 Sector Solar Product California-based firm involved in materials characterization. The company provides testing and performance measurements for solar PV energy systems. Coordinates 32.780338°, -96.547405° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":32.780338,"lon":-96.547405,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}
Analytical Chemistry Core Capability Assessment - Preliminary Report
The concept of 'core capability' can be nebulous one. Even at a fairly specific level, where core capability equals maintaining essential services, it is highly dependent upon the perspective of the requestor. Samples are submitted to analytical services because the requesters do not have the capability to conduct adequate analyses themselves. Some requests are for general chemical information in support of R and D, process control, or process improvement. Many analyses, however, are part of a product certification package and must comply with higher-level customer quality assurance requirements. So which services are essential to that customer - just those for product certification? Does the customer also (indirectly) need services that support process control and improvement? And what is the timeframe? Capability is often expressed in terms of the currently utilized procedures, and most programmatic customers can only plan a few years out, at best. But should core capability consider the long term where new technologies, aging facilities, and personnel replacements must be considered? These questions, and a multitude of others, explain why attempts to gain long-term consensus on the definition of core capability have consistently failed. This preliminary report will not try to define core capability for any specific program or set of programs. Instead, it will try to address the underlying concerns that drive the desire to determine core capability. Essentially, programmatic customers want to be able to call upon analytical chemistry services to provide all the assays they need, and they don't want to pay for analytical chemistry services they don't currently use (or use infrequently). This report will focus on explaining how the current analytical capabilities and methods evolved to serve a variety of needs with a focus on why some analytes have multiple analytical techniques, and what determines the infrastructure for these analyses. This information will be useful in defining a roadmap for what future capability needs to look like.
Barr, Mary E. [Los Alamos National Laboratory; Farish, Thomas J. [Los Alamos National Laboratory
ANALYTICAL CHEMISTRY AND MEASUREMENT SCIENCE (What Has DOE Done For Analytical Chemistry?) CONF-8904181--1
, . - - ANALYTICAL CHEMISTRY AND MEASUREMENT SCIENCE (What Has DOE Done For Analytical Chemistry?) CONF-8904181--1 DE89 009559 W. D. Shults Analytical Chemistry Division Oak Ridge National Laboratory* Oak Ridge, Tennessee 37831-6129 ABSTRACT Over the past forty years, analytical scientists within the DOE complex have had a tremendous impact on the field of analytical chemistry. This paper suggests six "high impact" research/development areas that either originated within or wcce brought to maturity within the DOE laboratories. "High impact" means they lead to new subdisciplines or to new ways of doing business. DISCLAIMER This report was prepared as an account of work sponsored by an agency of the United States Government. Neither the United States Government nor any agency thereof, nor any of their
Data Parallel Bin-Based Indexing for Answering Queries on Multi-Core Architectures
The multi-core trend in CPUs and general purpose graphics processing units (GPUs) offers new opportunities for the database community. The increase of cores at exponential rates is likely to affect virtually every server and client in the coming decade, and presents database management systems with a huge, compelling disruption that will radically change how processing is done. This paper presents a new parallel indexing data structure for answering queries that takes full advantage of the increasing thread-level parallelism emerging in multi-core architectures. In our approach, our Data Parallel Bin-based Index Strategy (DP-BIS) first bins the base data, and then partitions and stores the values in each bin as a separate, bin-based data cluster. In answering a query, the procedures for examining the bin numbers and the bin-based data clusters offer the maximum possible level of concurrency; each record is evaluated by a single thread and all threads are processed simultaneously in parallel. We implement and demonstrate the effectiveness of DP-BIS on two multi-core architectures: a multi-core CPU and a GPU. The concurrency afforded by DP-BIS allows us to fully utilize the thread-level parallelism provided by each architecture--for example, our GPU-based DP-BIS implementation simultaneously evaluates over 12,000 records with an equivalent number of concurrently executing threads. In comparing DP-BIS's performance across these architectures, we show that the GPU-based DP-BIS implementation requires significantly less computation time to answer a query than the CPU-based implementation. We also demonstrate in our analysis that DP-BIS provides better overall performance than the commonly utilized CPU and GPU-based projection index. Finally, due to data encoding, we show that DP-BIS accesses significantly smaller amounts of data than index strategies that operate solely on a column's base data; this smaller data footprint is critical for parallel processors that possess limited memory resources (e.g., GPUs).
Gosink, Luke; Wu, Kesheng; Bethel, E. Wes; Owens, John D.; Joy, Kenneth I.
100-B/C Target Analyte List Development for Soil
This report documents the process used to identify source area target analytes in support of the 100-B/C remedial investigation/feasibility study addendum to DOE/RL-2008-46. This report also establishes the analyte exclusion criteria applicable for 100-B/C use and the analytical methods needed to analyze the target analytes.
R.W. Ovink
Large scale data analytics on clouds
We summarize important overall issues affecting use of clouds to support Data Science. We describe the mapping of different applications to HPCC and Cloud systems and the architecture that support data analytics that is interoperable between these architectures. Keywords: clouds, data science, exascale, hpcc, iterative mapreduce, mapreduce, mpi, programming paradigms
Geoffrey C. Fox
Exploring the analytical processes of intelligence analysts
We present an observational case study in which we investigate and analyze the analytical processes of intelligence analysts. Participating analysts in the study carry out two scenarios where they organize and triage information, conduct intelligence ... Keywords: artifact analysis, collaboration, homeland security, intelligence analysis, national security, participant observation, participatory design, work practices, work-oriented design
George Chin, Jr.; Olga A. Kuchar; Katherine E. Wolf
Analytical Theory of Graphene Nanoribbon Transistors
Graphene has emerged as one of the most promising materials to address scaling challenges in the post silicon era. A simple model for graphene nanoribbon field-effect transistors (GNRFETs) is developed for treating the effects of edge bond relaxation, ... Keywords: Graphene nanoribbons, analytical model, edge bond relaxation, third nearest neighbor interaction, edge scattering
Pei Zhao; Mihir Choudhury; Kartik Mohanram; Jing Guo
Enhancing Law Enforcement Using Data & Visual Analytics
Authority of New York and New Jersey (PA NY/NJ), Pacific Northwest National Labs (PNNL), Intuidex will integrate visual analytics methods developed at PNNL to mine valuable links between entities in order Authority of New York and New Jersey (PA NY/NJ) · Pacific Northwest National Laboratory (PNNL) · Intuidex
Biodiesel Analytical Methods: August 2002--January 2004
Biodiesel is an alternative fuel for diesel engines that is receiving great attention worldwide. The material contained in this book is intended to provide the reader with information about biodiesel engines and fuels, analytical methods used to measure fuel properties, and specifications for biodiesel quality control.
Van Gerpen, J.; Shanks, B.; Pruszko, R.; Clements, D.; Knothe, G.
Analytic theory of ICRF minority heating
We present a one-dimensional analytic theory of the ICRF gyroresonant absorption and mode-conversion, for the problem of minority fundamental resonance. Using the wave phase-space method, and the theory of linear mode conversion therein, we obtain explicit expressions for the coefficients of transmission (T), reflection (R), conversion (C), absorption (A). 7 refs., 2 figs.
Ye, H.; Kaufman, A.N.
Some analytical models of radiating collapsing spheres
We present some analytical solutions to the Einstein equations, describing radiating collapsing spheres in the diffusion approximation. Solutions allow for modeling physical reasonable situations. The temperature is calculated for each solution, using a hyperbolic transport equation, which permits to exhibit the influence of relaxational effects on the dynamics of the system.
Herrera, L.; Di Prisco, A [Escuela de Fisica, Facultad de Ciencias, Universidad Central de Venezuela, Caracas (Venezuela); Ospino, J. [Area de Fisica Teorica. Facultad de Ciencias, Universidad de Salamanca Salamanca (Spain)
Analytical theory of intensity fluctuations in SASE
Recent advances in SASE experiments stimulate interest in quantitative comparison of measurements with theory. Extending the previous analysis of the SASE intensity in guided modes, the authors provide an analytical description of the intensity fluctuations by calculating intensity correlation functions in the frequency domain. Comparison of the results with experiment yields new insight into the SASE process.
Yu, L.H.; Krinsky, S. [Brookhaven National Lab., Upton, NY (United States). National Synchrotron Light Source
Refinery analytical techniques optimize unit performance
Refinery process engineers need to consider benefits of laboratory analytical techniques when evaluating unit performance. Refinery heavy-oil laboratory analytical techniques use both old and new technologies. Knowing how to use available laboratory analytical techniques within their limitations are critical to obtain correct refinery optimization decisions. Better refinery stream distillation and contaminant data ultimately improves the accuracy of various refinery decision-making tools. These laboratory analytical techniques are covered: high-temperature simulated distillation (HTSD); true boiling point (TBP) distillation--ASTM D2892; vacuum distillation--ASTM D5236; continuous-flash vaporizers; wiped-film evaporators; inductively coupled plasma atomic-emission spectroscopy (ICP-AES); Conradson--ASTM D189/Microcarbon residue--ASTM D4530; and asphaltene IP-143, ASTM D3279, ASTM D4124. Analysis of atmospheric crude, vacuum crude and delayed coker units highlight these laboratory techniques to identify potential yield and product quality benefits. Physical distillation or wiped-film evaporation in conjunction with HTSD, ICP-AES, microcarbon residue and asphaltened data will better characterize a feedstock as well as determine the source of contaminants. Economics are refinery specific, therefore, these examples focus on applying laboratory techniques as opposed to discussing specifics of unit improvement. These are discussed qualitatively.
Golden, S.W. [Process Consulting Services Inc., Grapevine, TX (United States); Craft, S. [Chempro, Inc., LaPorte, TX (United States); Villalanti, D.C. [Triton Analytics Corp., Houston, TX (United States)
Analytical modeling of SRAM dynamic stability
In this paper, for the first time, a theory for evaluating dynamic noise margins of SRAM cells is developed analytically. The results allow predicting the transient error susceptibility of an SRAM cell using a closed-form expression. The key innovation ...
Bin Zhang; Ari Arapostathis; Sani Nassif; Michael Orshansky
NERSC Analytics Program Status and Update
spanning all aspects of analytics, high performance computing, and many science domains. · SGI Altix 32, application, and deployment of a diverse array of technologies spanning the domains of high performance computing, data management, data analysis and visualization, and workflow management. #12;DOE CGF April 29
Geddes, Cameron Guy Robinson
Web queries with style: Rendering xcerpt programs with css-ng
Abstract. Styling and formatting of XML documents for various target media is often specified with the Cascading Style Sheet (CSS) language. An appealing feature of CSS is that it specifies formatting instructions using rather simple guarded rules. A limitation of CSS is that it focuses on static formatting rules. As a consequence scripting languages such as ECMA Script are used in practice for dynamic adaptation of formatting. CSS NG is a novel extension of CSS 3, the newest version of CSS, introducing just a few rules for a dynamic rendering and for markup visualization. This limited extension of CSS 3 turns out to make possible a rather advanced visualization of programs. This article (1) introduces into the extensions of CSS NG with respect to CSS 3, (2) describes a proof-of-concept prototype implementation of CSS NG, and (3) demonstrates CSS NG on Xcerpt query programs. 1
Fran�ois Bry; Christoph Wieser
Value-of-Information based Middleware for Autonomic Querying of Distributed Sensor Databases
With particular focus on distributed situational awareness in defense and security applications, we propose a value-of-information based middleware framework as a paradigm shift from crawl-index based centralized search. The proposed approach seeks to improve efficiency in search and retrieval by transforming sensors into programmable information points and enabling ubiquitous data and software flows through the infrastructure of the distributed network. We explain the different components of such a middleware framework to organize, tag and notify emerging spatial, temporal and causal patterns from the sensor measurements. We conclude the paper with a brief discussion on the top-down programming model that can realize the framework as a reconfigurable sensor query system.
Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL
The view-selection problem has an exponential-time lower bound for conjunctive queries and views
The view-selection problem is to design and materialize a set of views over a database schema, such that the choice of views minimizes the cost of evaluating the selected workload of queries, and the combined size of the materialized views does not exceed ...
Rada Chirkova
Parallel database processing on a 100 Node PC cluster: cases for decision support query processing and data mining
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
A Study on Microblog and Search Engine User Behaviors: How Twitter Trending Topics Help Predict Google Hot Queries
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
A comparison of the usability of performing ad hoc querying on dimensionally modeled data versus operationally modeled data
To study the usability of dimensionally modeled data (DMD), we conducted an experiment involving 113 participants to analyze their performance in ad hoc querying tasks. The results show that DMD's usability is high according to both objective and subjective ... Keywords: Business intelligence, Data models, Dimensionally modeled data, Learnability, Usability
Du�An Vujo�Evi?; Ivana Kova?Evi?; Milija Suknovi?; Nenad Lali?
Medical Image Content-Based Queries using the Grid J. Montagnat1, H. Duque12, J.M. Pierson2, V. Breton3, L. Brunie2, and I. E. Magnin1
Medical Image Content-Based Queries using the Grid J. Montagnat1, H. Duque12, J.M. Pierson2, V: email@example.com phone: +33 492 94 27 20 fax: +33 492 94 28 98 Running title: Medical Image Content-Based Queries Keywords: Medical imaging, grid computing, medical database, content-based query 1
A Visualization Architecture for Collaborative Analytical and Data Provenance Activities
When exploring noisy or visually complex data, such as seismic data from the oil and gas industry, it is often the case that algorithms cannot completely identify features of interest. Human intuition must complete the process. Given the nature of intuition, ... Keywords: geospatial visualization, data acquisition and management, provenance, data exploration, query-driven visualization
Aqeel Al-Naser, Masroor Rasheed, Duncan Irving, John Brooke
' ' PLEAEERUSH ANALYTICAL DA-~-A SHEET ' ANALYTICAL DEPT. - HEALTH AhD SAFETY DlVlSlON 1956 Industrial Hygiene or Medical Dept. 1. H.#~~Sample Nos. 3 --Date Collected~~by-CESS-.Route to CBS LocationTITANIUM Type of Sample airnalyzed for F Alpham Remarks NIAGARA pALI+S* N.Y. U Beta Bldg. 103 - furnace room - -NO, Ra Oil PH Be Th Sample No. Hour Sample Description I I I--- R ) T 1 Q I I I 7392 1100 GA Induction furnace area duri-nn ----l----- mDeriod;.02; 151 .3 while furnace was charged with UOT_- and carbon, and under heat. 7393 / GA Continuation of 7392 I I 7394 GA Continuation of 7393 -I- ----J -___-_-- - ___(_-- I- -~----~ -- ~- __ __ ___ -----.A ri --- - ----_' ---p. ----- __- -. -~-- -~ - 1 - .- -__ -___ -_--__ -___-- I -__-- -- --' II--T---
Technosocial Predictive Analytics for Illicit Nuclear Trafficking
Illicit nuclear trafficking networks are a national security threat. These networks can directly lead to nuclear proliferation, as state or non-state actors attempt to identify and acquire nuclear weapons-related expertise, technologies, components, and materials. The ability to characterize and anticipate the key nodes, transit routes, and exchange mechanisms associated with these networks is essential to influence, disrupt, interdict or destroy the function of the networks and their processes. The complexities inherent to the characterization and anticipation of illicit nuclear trafficking networks requires that a variety of modeling and knowledge technologies be jointly harnessed to construct an effective analytical and decision making workflow in which specific case studies can be built in reasonable time and with realistic effort. In this paper, we explore a solution to this challenge that integrates evidentiary and dynamic modeling with knowledge management and analytical gaming, and demonstrate its application to a geopolitical region at risk.
Sanfilippo, Antonio P.; Butner, R. Scott; Cowell, Andrew J.; Dalton, Angela C.; Haack, Jereme N.; Kreyling, Sean J.; Riensche, Roderick M.; White, Amanda M.; Whitney, Paul D.
Electrospray ion source with reduced analyte electrochemistry
An electrospray ion (ESI) source and method capable of ionizing an analyte molecule without oxidizing or reducing the analyte of interest. The ESI source can include an emitter having a liquid conduit, a working electrode having a liquid contacting surface, a spray tip, a secondary working electrode, and a charge storage coating covering partially or fully the liquid contacting surface of the working electrode. The liquid conduit, the working electrode and the secondary working electrode can be in liquid communication. The electrospray ion source can also include a counter electrode proximate to, but separated from, said spray tip. The electrospray ion source can also include a power system for applying a voltage difference between the working electrodes and a counter-electrode. The power system can deliver pulsed voltage changes to the working electrodes during operation of said electrospray ion source to minimize the surface potential of the charge storage coating.
Kertesz, Vilmos (Knoxville, TN); Van Berkel, Gary (Clinton, TN)