Browsing Mathematics (Faculty of) by Title
Now showing items 613-632 of 3020
-
Decidability and Algorithmic Analysis of Dependent Object Types (DOT)
(University of Waterloo, 2019-08-28)Dependent Object Types, or DOT, is a family of calculi developed to study the Scala programming language. These calculi have path dependent types as a feature, and potentially intersection types, union types and recursive ... -
Decidability and k-Regular Sequences
(Elsevier, 2020-05)In this paper we consider a number of natural decision problems involving k-regular sequences. Specifically, they arise from considering • lower and upper bounds on growth rate; in particular boundedness, • images, • ... -
Deciding Properties of Automatic Sequences
(University of Waterloo, 2013-09-24)In this thesis, we show that several natural questions about automatic sequences can be expressed as logical predicates and then decided mechanically. We extend known results in this area to broader classes of sequences ... -
Deciding Second-order Logics using Database Evaluation Techniques
(University of Waterloo, 2008-09-25)We outline a novel technique that maps the satisfiability problems of second-order logics, in particular WSnS (weak monadic second-order logic with n successors), S1S (monadic second-order logic with one successor), and ... -
Decision Algorithms for Ostrowski-Automatic Sequences
(University of Waterloo, 2020-05-13)We extend the notion of automatic sequences to a broader class, the Ostrowski-automatic sequences. We develop a procedure for computationally deciding certain combinatorial and enumeration questions about such sequences ... -
Decomposition of Finite-Dimensional Matrix Algebras over \mathbb{F}_{q}(y)
(University of Waterloo, 2010-08-20)Computing the structure of a finite-dimensional algebra is a classical mathematical problem in symbolic computation with many applications such as polynomial factorization, computational group theory and differential ... -
Decomposition-based methods for Connectivity Augmentation Problems
(University of Waterloo, 2021-09-03)In this thesis, we study approximation algorithms for Connectivity Augmentation and related problems. In the Connectivity Augmentation problem, one is given a base graph G=(V,E) that is k-edge-connected, and an additional ... -
Decoupling of Information Propagation from Energy Propagation
(University of Waterloo, 2016-08-31)Information and energy are concepts central to our understanding of nature. Their relevance, in physics, ranges from fundamental physics, e.g., in black hole physics, all the way to future quantum computing technology. ... -
Deep Context Resolution
(University of Waterloo, 2018-05-17)Conversations depend on information from the context. To go beyond one-round conversation, a chatbot must resolve contextual information such as: 1) co-reference resolution, 2) ellipsis resolution, and 3) conjunctive ... -
Deep Learning for Peptide Feature Detection from Liquid Chromatography - Mass Spectrometry Data
(University of Waterloo, 2022-04-26)Proteins are the main workhorses of biological functions and activities, such as catalyzing metabolic reactions, DNA replication, providing structure to cells and organisms, etc. Comparative analysis of protein samples ... -
Deep Learning Methods for Novel Peptide Discovery and Function Prediction
(University of Waterloo, 2024-04-26)This thesis explores deep learning methods for protein identification and property prediction, encompassing two primary areas: mass spectrometry-based protein sequence identification and protein property prediction. We ... -
Deep Unsupervised Learning for Biodiversity Analyses: Representation learning and clustering of bacterial, mitochondrial, and barcode DNA sequences
(University of Waterloo, 2024-05-22)Amid the recent surge in next-generation sequencing technologies, alignment-free algorithms stand out as a promising alternative to traditional alignment-based methods in phylogenetic analyses. Specifically, the use of ... -
DeepThInk: Designing and Probing Human-AI Co-creation in Digital Art Therapy
(University of Waterloo, 2023-03-27)Art therapy has been an essential form of psychotherapy to facilitate psychological well-being, which has been promoted and transformed by recent technological advances into digital art therapy. However, the potential of ... -
Defined Benefit Pension Plans: Cost of Living Adjustments and Membership Heterogeneity
(University of Waterloo, 2021-01-06)In this paper we explore different structures for cost of living adjustments (COLA), based on Hardy et al. (2020)’s five significant criteria: affordability, sustainability, efficiency, adequacy, and fairness. Full COLA ... -
Defining gameful experience as a psychological state caused by gameplay: Replacing the term ‘Gamefulness’ with three distinct constructs
(Elsevier, 2019-07)Background and Aim Gamefulness is commonly cited as the primary goal of gamification, a family of approaches employed in education, business, healthcare, government, and elsewhere. However, gamefulness is defined ... -
Deformation theory of nearly G₂-structures and nearly G₂ instantons
(University of Waterloo, 2021-08-30)We study two different deformation theory problems on manifolds with a nearly G₂-structure. The first involves studying the deformation theory of nearly G₂ manifolds. These are seven dimensional manifolds admitting real ... -
Deformation-Driven Element Packing
(University of Waterloo, 2020-12-11)A packing is an arrangement of geometric elements within a container region in the plane. Elements are united to communicate the overall container shape, but each is large enough to be appreciated individually. Creating a ... -
Degree Spectra of Unary relations on ω and ζ
(University of Waterloo, 2009-08-13)Let X be a unary relation on the domain of (ω,<). The degree spectrum of X on (ω,<) is the set of Turing degrees of the image of X in all computable presentations of (ω,<). Many results are known about the types of degree ... -
Degrees of Categoricity and the Isomorphism Problem
(University of Waterloo, 2019-06-12)In this thesis, we study notions of complexity related to computable structures. We first study degrees of categoricity for computable tree structures. We show that, for any computable ordinal $\alpha$, there exists a ... -
A deletion–contraction relation for the chromatic symmetric function
(Elsevier, 2020-10)We extend the definition of the chromatic symmetric function XG to include graphs G with a vertex-weight function w : V (G) --> N. We show how this provides the chromatic symmetric function with a natural deletion-contraction ...