Browsing Mathematics (Faculty of) by Title
Now showing items 574-593 of 2993
-
Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication
(University of Waterloo, 2009-06-26)This thesis includes my research on efficient cryptographic protocols, sensor network key management, and radio frequency identification (RFID) authentication protocols. Key exchange, identification, and public key ... -
Cryptography and Privacy in Vehicular Communication Networks
(University of Waterloo, 2023-08-28)Wireless communication technologies can support dynamic networks between vehicles, pedestrians and roadside infrastructure called Vehicular Ad hoc Networks (VANETs). Wireless communication over VANETs allows for several ... -
Crystallizing Application Configurations
(University of Waterloo, 2006)Software applications have both static and dynamic dependencies. Static dependencies are those derived from the source code. Dynamic runtime dependencies are established at runtime and may be based on information ... -
Customizing kernels in Support Vector Machines
(University of Waterloo, 2007-05-22)Support Vector Machines have been used to do classification and regression analysis. One important part of SVMs are the kernels. Although there are several widely used kernel functions, a carefully designed kernel will ... -
Cyberheroes: The Design and Evaluation of an Interactive Ebook to Educate Children about Online Privacy
(Elsevier, 2017-07)We designed an educational interactive ebook called Cyberheroes and evaluated it to assess its effectiveness at increasing children’s online privacy knowledge and behaviour, and supporting child-parent privacy-related ... -
The Cycle Spaces of an Infinite Graph
(University of Waterloo, 2006)The edge space of a finite graph <em>G</em> = (<em>V</em>, <em>E</em>) over a field F is simply an assignment of field elements to the edges of the graph. The edge space can equally be thought of us an |<em>E</em>|-dimensional ... -
Cycles and coloring in graphs and digraphs
(University of Waterloo, 2022-08-22)We show results in areas related to extremal problems in directed graphs. The first concerns a rainbow generalization of the Caccetta-H\"{a}ggkvist conjecture, made by Aharoni. The Caccetta-H\"{a}ggkvist conjecture states ... -
Cyclic Sieving Phenomenon of Promotion on Rectangular Tableaux
(University of Waterloo, 2012-09-28)Cyclic sieving phenomenon (CSP) is a generalization by Reiner, Stanton, White of Stembridge's q=-1 phenomenon. When CSP is exhibited, orbits of a cyclic action on combinatorial objects show a nice structure and their sizes ... -
Cyclically 5-Connected Graphs
(University of Waterloo, 2016-08-29)Tutte's Four-Flow Conjecture states that every bridgeless, Petersen-free graph admits a nowhere-zero 4-flow. This hard conjecture has been open for over half a century with no significant progress in the first forty years. ... -
The Cycling Property for the Clutter of Odd st-Walks
(University of Waterloo, 2014-01-23)A binary clutter is cycling if its packing and covering linear program have integral optimal solutions for all Eulerian edge capacities. We prove that the clutter of odd st- walks of a signed graph is cycling if and only ... -
The C∀ Scheduler
(University of Waterloo, 2022-12-02)User-Level threading (M:N) is gaining popularity over kernel-level threading (1:1) in many programming languages. The user threading approach is often a better mechanism to express complex concurrent applications by ... -
C∀ Type System Implementation
(University of Waterloo, 2019-04-30)The C programming language has been an important software development tool for decades. C∀ is a new programming language designed with strong backwards-compatibility to take advantage of widely distributed C programming ... -
Dash+: Extending Alloy with Hierarchical States and Replicated Processes for Modelling Transition Systems
(IEEE, 2021-09)Modelling systems abstractly shows great promise to uncover bugs early in system development. The formal language Alloy provides the means of writing constraints abstractly, but lacks explicit constructs for describing ... -
Dash+: Extending Alloy with Replicated Processes for Modelling Transition Systems
(University of Waterloo, 2022-09-27)Modelling systems abstractly shows great promise to uncover bugs early in system development. The formal language Alloy provides the means of writing constraints abstractly but lacks explicit constructs for describing ... -
DASH: A New Language for Declarative Behavioural Requirements with Control State Hierarchy
(IEEE, 2017-09-04)We present DASH, a new language for describing formal behavioural models of requirements. DASH combines the ability to write abstract, declarative transitions (as in Z or Alloy) with a labelled control state hierarchy (as ... -
Dash: Declarative Behavioural Modelling in Alloy
(University of Waterloo, 2019-01-25)An abstract model is a representation of the fundamental characteristics and properties of a system, and its purpose is to provide feedback to stakeholders about the correctness of the system during the early stages of ... -
DASH: Declarative Modelling with Control State Hierarchy (Preliminary Version)
(University of Waterloo, 2018)We present a new language, called DASH, for describing formal behavioural models. DASH combines common modelling constructs to describe abstractly both data and control in an integrated manner. DASH uses the Alloy language ... -
Data Augmentation For Text Classification Tasks
(University of Waterloo, 2020-08-12)Thanks to increases in computing power and the growing availability of large datasets, neural networks have achieved state of the art results in many natural language process- ing (NLP) and computer vision (CV) tasks. ... -
Data Depth Inference for Difficult Data
(University of Waterloo, 2022-07-18)We explore various ways in which a robust, nonparametric statistical tool, the data depth function can be used to conduct inference on data which could be described as difficult. This can include data which are difficult ... -
Data Flow Analysis in the Presence of Correlated Calls
(University of Waterloo, 2014-08-19)This thesis presents a technique to improve the precision of data-flow analyses on object-oriented programs in the presence of correlated calls. We say that two method calls are correlated if they are polymorphic (have ...