Browsing Mathematics (Faculty of) by Title
Now showing items 2235-2254 of 2993
-
Quantum Walks on Oriented Graphs
(University of Waterloo, 2019-01-11)This thesis extends results about periodicity and perfect state transfer to oriented graphs. We prove that if a vertex a is periodic, then elements of the eigenvalue support lie in Z √∆ for some squarefree negative ... -
Quantum Walks on Strongly Regular Graphs
(University of Waterloo, 2010-08-30)This thesis studies the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of a matrix based on the amplitudes of walks in the ... -
Quasi-Hopf Symmetry in Loop Quantum Gravity with Cosmological constant and Spinfoams with timelike surfaces
(University of Waterloo, 2018-09-20)In this thesis we study two separate problems concerning improvements to the Loop quantum gravity and spinfoam approach to quantum gravity. In the first part we address the question about the origin of quantum group ... -
Quasi-Static Approximation for Numerical Computation of Plasmon Eigenfrequencies in Nanoparticles
(University of Waterloo, 2014-08-28)General physical properties of electrostatic (plasmon) resonances in nanoparticles are presented. Direct calculation of the resonance values of the permittivity of nanoparticles, and subsequently their resonance frequencies, ... -
Quaternion Algebras and Quadratic Forms
(University of Waterloo, 2008-05-12)The main goal of this Masters' thesis is to explore isomorphism types of quaternion algebras using the theory of quadratic forms, number theory and algebra. I would also present ways to characterize quaternion algebras, ... -
Query Answering over Functional Dependency Repairs
(University of Waterloo, 2013-09-23)Inconsistency often arises in real-world databases and, as a result, critical queries over dirty data may lead users to make ill-informed decisions. Functional dependencies (FDs) can be used to specify intended semantics ... -
Query Evaluation in the Presence of Fine-grained Access Control
(University of Waterloo, 2008-05-20)Access controls are mechanisms to enhance security by protecting data from unauthorized accesses. In contrast to traditional access controls that grant access rights at the granularity of the whole tables or views, ... -
Query Interactions in Database Systems
(University of Waterloo, 2013-01-08)The typical workload in a database system consists of a mix of multiple queries of different types, running concurrently and interacting with each other. The same query may have different performance in different mixes. ... -
Query Optimization for On-Demand Information Extraction Tasks over Text Databases
(University of Waterloo, 2012-03-27)Many modern applications involve analyzing large amounts of data that comes from unstructured text documents. In its original format, data contains information that, if extracted, can give more insight and help in the ... -
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 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 ... -
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 ... -
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 ... -
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", ...