Browsing University of Waterloo by Title
Now showing items 14218-14237 of 18721
-
Query Optimization in Dynamic Environments
(University of Waterloo, 2012-05-08)Most modern applications deal with very large amounts of data. Having to deal with such huge amounts of data is in itself a challenge. This challenge is complicated even more by the fact that, in many cases, this data is ... -
Query processing techniques for arrays
(University of Waterloo, 2001) -
Query Similarity for Community Question Answering System Based on Recurrent Encoder Decoder
(University of Waterloo, 2017-01-18)The measurement of sentence similarity is a fundamental task in natural language processing. Traditionally, it is measured either from word-level or sentence-level (such as paraphrasing), which requires many lexical and ... -
A Query-Based Approach for the Analysis of Aspect-Oriented Systems
(University of Waterloo, 2007-01-29)In recent years, many aspect-oriented languages and methods have been proposed in the literature to support separation of concerns that can be spread throughout a software system and its components and to facilitate ... -
Querying Large Collections of Semistructured Data
(University of Waterloo, 2013-10-01)An increasing amount of data is published as semistructured documents formatted with presentational markup. Examples include data objects such as mathematical expressions encoded with MathML or web pages encoded with XHTML. ... -
The quest for "diagnostically lossless" medical image compression using objective image quality measures
(University of Waterloo, 2015-02-18)Given the explosive growth of digital image data being generated, medical communities worldwide have recognized the need for increasingly efficient methods of storage, display and transmission of medical images. For this ... -
Question Paraphrase Generation for Question Answering System
(University of Waterloo, 2015-08-31)The queries to a practical Question Answering (QA) system range from keywords, phrases, badly written questions, and occasionally grammatically perfect questions. Among different kinds of question analysis approaches, the ... -
Questioning the Unquestioned: Scale Development to Assess Ecotourist Ethics
(University of Waterloo, 2009-04-30)While most ecotourist definitions and typologies have relied on concepts ingrained in traveler behaviours or destinations, none has benefited from a consideration of personal ethics. The study of ecotourism has virtually ... -
Queueing Analysis of a Priority-based Claim Processing System
(University of Waterloo, 2009-10-02)We propose a situation in which a single employee is responsible for processing incoming claims to an insurance company that can be classified as being one of two possible types. More specifically, we consider a priority-based ... -
A Queueing Model to Study Ambulance Offload Delays
(University of Waterloo, 2008-09-24)The ambulance offload delay problem is a well-known result of overcrowding and congestion in emergency departments. Offload delay refers to the situation where area hospitals are unable to accept patients from regional ... -
Queueing Network Models of Ambulance Offload Delays
(University of Waterloo, 2012-09-27)Although healthcare operations management has been an active and popular research direction over the past few years, there is a lack of formal quantitative models to analyze the ambulance o oad delay problem. O oad delays ... -
Quick and Automatic Selection of POMDP Implementations on Mobile Platform Based on Battery Consumption Estimation
(University of Waterloo, 2014-04-01)Partially Observable Markov Decision Process (POMDP) is widely used to model sequential decision making process under uncertainty and incomplete knowledge of the environment. It requires strong computation capability and ... -
A Quick-and-Dirty Approach to Robustness in Linear Optimization
(University of Waterloo, 2013-01-07)We introduce methods for dealing with linear programming (LP) problems with uncertain data, using the notion of weighted analytic centers. Our methods are based on high interaction with the decision maker (DM) and try ... -
QuickAssist Extensive Reading for Learners of German Using CALL Technologies
(University of Waterloo, 2010-12-20)The focus of this dissertation is the development and testing of a CALL tool which assists learners of German with the extensive reading of German texts of their choice. The application provides functionality that enables ... -
Quiet In The Rear: The Wehrmacht and the Weltanschauungskrieg in the Occupation of the Soviet Union
(University of Waterloo, 2018-04-26)Historians widely acknowledge that the Second World War witnessed a substantial degree of ideology in the conflict itself. This paper will establish the degree to which the ideology of National Socialism shaped the Wehrmacht’s ... -
Quotient Complexities of Atoms in Regular Ideal Languages
(Institute of Informatics: University of Szeged, 2015)A (left) quotient of a language L by a word w is the language w(-1) L = {x vertical bar wx is an element of L}. The quotient complexity of a regular language L is the number of quotients of L; it is equal to the state ... -
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Language
(Institute of Informatics: University of Szeged, 2014)A language $L$ is prefix-free if whenever words $u$ and $v$ are in $L$ and $u$ is a prefix of $v$, then $u=v$. Suffix-, factor-, and subword-free languages are defined similarly, where by ``subword" we mean ``subsequence", ... -
Quotient Complexity Of Closed Languages
(Springer, 2014-02-01)A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix-, factor-, and subword-closed languages in an analogous way, where by factor we mean contiguous subsequence, ... -
Quotient Complexity of Ideal Languages
(Elsevier, 2013-01-28)A language L over an alphabet Σ is a right (left) ideal if it satisfies L=LΣ∗ (L=Σ∗L). It is a two-sided ideal if L=Σ∗LΣ∗, and an all-sided ideal if L=Σ∗L, the shuffle of Σ∗ with L. Ideal languages are not only of interest ... -
Quotient Complexity Of Star-Free Languages
(World Scientific Publishing, 2012-09-01)The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the ...