Browsing Mathematics (Faculty of) by Title
Now showing items 2688-2707 of 3013
-
A Study on Longevity Risk Hedging in the Presence of Population Basis Risk
(University of Waterloo, 2015-09-29)Longevity risk refers to uncertainty surrounding the trend in human life expectancy. Standardized hedging instruments that are linked to broad-based mortality indexes can be used to offload longevity risk from pension plans ... -
A Study on the Effects of Exception Usage in Open-Source C++ Systems
(University of Waterloo, 2019-05-24)Exception handling (EH) is a feature common to many modern programming languages, including C++, Java, and Python, that allows error handling in client code to be performed in a way that is both systematic and largely ... -
Studying and Leveraging API Usage Patterns
(University of Waterloo, 2022-09-29)Software projects make use of libraries extensively. Libraries have intended API surfaces—sets of exposed library interfaces that library developers expect clients to use. However, in practice, clients only use small ... -
Studying Relevance Judging Behavior of Secondary Assessors
(University of Waterloo, 2016-08-03)Secondary assessors, individuals who do not originate search topics and are employed solely to judge the relevancy of documents, have been found to differ in their relevance judgments. Their relevance judgments are used ... -
Studying the Impact of Risk Assessment Analytics on Risk Awareness and Code Review Performance
(University of Waterloo, 2023-05-18)While code review is a critical component of modern software quality assurance, defects can still slip through the review process undetected. Previous research suggests that the main reason for this is a lack of reviewer ... -
Style Recognition in Music with Context Free Grammars and Kolmogorov Complexity
(University of Waterloo, 2020-03-11)The Kolmogorov Complexity of an object is incomputable. But built in its structure is a way to specify description methods of an object that is computable in some sense. Such a description method then can be exploited ... -
StyleCounsel: Seeing the (Random) Forest for the Trees in Adversarial Code Stylometry
(University of Waterloo, 2018-01-12)Authorship attribution has piqued the interest of scholars for centuries, but had historically remained a matter of subjective opinion, based upon examination of handwriting and the physical document. Midway through the ... -
Subdividing the cd-index
(University of Waterloo, 2016-04-28)This thesis aims to give the reader an introduction and overview of the cd-index of a poset, as well as establish some new results. We give a combinatorial proof of Ehrenborg and Karu's cd-index subdivision decomposition ... -
Subjective Mapping
(University of Waterloo, 2007-11-20)There are a variety of domains where it is desirable to learn a representation of an environment defined by a stream of sensori-motor experience. This dissertation introduces and formalizes subjective mapping, a novel ... -
SUBMODULAR FUNCTIONS, GRAPHS AND INTEGER POLYHEDRA
(University of Waterloo, 2016-09-12)This thesis is a study of the faces of certain combinatorially defined polyhedra. In particular, we examine the vertices and facets of these polyhedra. Chapter 2 contains the essential mathematical background in polyhedral ... -
Suboptimality of Asian Executive Options
(University of Waterloo, 2011-08-25)This thesis applies the concept of cost e ciency to the design of executive compensation. In a classical Black-Scholes framework, we are able to express the cost e cient counterpart of the Asian Executive Option explicitly, ... -
Subseries Join and Compression of Time Series Data Based on Non-uniform Segmentation
(University of Waterloo, 2008-09-24)A time series is composed of a sequence of data items that are measured at uniform intervals. Many application areas generate or manipulate time series, including finance, medicine, digital audio, and motion capture. ... -
Subtle and Personal Workspace Requirements for Visual Search Tasks on Public Displays
(ACM Press, 2017-05-06)We explore how users approach and define personal space on large, public displays. Our results show that users of public displays use one of two strategies for visual search tasks: minimizers create a small window and work ... -
Subword complexity and power avoidance
(Elsevier, 2019-11-05)We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that –the Thue–Morse word has the minimum possible subword complexity over ... -
Succinct and Compact Data Structures for Intersection Graphs
(University of Waterloo, 2023-08-14)This thesis designs space efficient data structures for several classes of intersection graphs, including interval graphs, path graphs and chordal graphs. Our goal is to support navigational operations such as adjacent and ... -
Succinct Data Structures for Chordal Graphs
(University of Waterloo, 2019-04-10)We study the problem of approximate shortest path queries in chordal graphs and give a n log n + o(n log n) bit data structure to answer the approximate distance query to within an additive constant of 1 in O(1) time. We ... -
Succinct Indexes
(University of Waterloo, 2008-02-14)This thesis defines and designs succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures that ideally occupy asymptotically less space than the information-theoretic lower ... -
Succinct Representation of Trees and Graphs
(University of Waterloo, 2009-10-29)In this thesis, we study succinct representations of trees and graphs. A succinct representation of a combinatorial object is a space efficient representation that supports a reasonable set of operations and queries on the ... -
Suitability of Java for Solving Large Sparse Positive Definite Systems of Equations Using Direct Methods
(University of Waterloo, 2004)The purpose of the thesis is to determine whether Java, a programming language that evolved out of a research project by Sun Microsystems in 1990, is suitable for solving large sparse linear systems using direct methods. ... -
Sum-of-norms clustering: theoretical guarantee and post-processing
(University of Waterloo, 2020-09-11)Sum-of-norms clustering is a method for assigning n points in d-dimensional real space to K clusters, using convex optimization. Recently, Panahi et al. proved that sum-of-norms clustering is guaranteed to recover a mixture ...