Browsing Mathematics (Faculty of) by Title
Now showing items 286305 of 2985

Bohmian Trajectories of the TwoElectron Helium Atom
(University of Waterloo, 20080117)We introduce the de BroglieBohm causal interpreation of quantum mechanics and compare it to the standard interpretation of quantum mechanics, the Copenhagen interpretation. We examine the possibility of experimentally ... 
BonehBoyen Signatures and the Strong DiffieHellman Problem
(University of Waterloo, 20090122)The BonehBoyen signature scheme is a short signature scheme which is provably secure in the standard model under the qStrong DiffieHellman (SDH) assumption. The primary objective of this thesis is to examine the ... 
BotChase: GraphBased Bot Detection Using Machine Learning
(University of Waterloo, 20190521)Bot detection using machine learning (ML), with network flowlevel features, has been extensively studied in the literature. However, existing flowbased approaches typically incur a high computational overhead and do not ... 
BoundaryBound Reactions: Pattern Formation with and without Hydrodynamics
(University of Waterloo, 20220823)Pattern formation through chemical morphogenesis has received a significant amount of attention since Alan Turing's original analysis in a Chemical Basis for Morphogenesis. In that article, Turing showed the surprising ... 
Bounded Control of the KuramotoSivashinsky equation
(University of Waterloo, 20131025)Feedback control is used in almost every aspect of modern life and is essential in almost all engineering systems. Since no mathematical model is perfect and disturbances occur frequently, feedback is required. The design ... 
Bounded Rationality Alters The Dynamics Of Paediatric Immunization Acceptance
(Nature Publishing Group, 20150602)Interactions between disease dynamics and vaccinating behavior have been explored in many coupled behaviordisease models. Cognitive effects such as risk perception, framing, and subjective probabilities of adverse events ... 
Bounds on Aggregate Assets
(University of Waterloo, 20140123)Aggregating financial assets together to form a portfolio, commonly referred to as "asset pooling", is a standard practice in the banking and insurance industries. Determining a suitable probability distribution for this ... 
Bounds on Maximum Matchings in 1Planar Graphs
(University of Waterloo, 20190129)In this thesis, we study lower bounds on maximum matchings in 1planar graphs. We expand upon the tools used for proofs of matching bounds in other classes of graphs as well as some original ideas in order to find these ... 
Branched Covering Constructions and the Symplectic Geography Problem
(University of Waterloo, 20080815)We apply branched covering techniques to construct minimal simplyconnected symplectic 4manifolds with small χ_h values. We also use these constructions to provide an alternate proof that for each s ≥ 0, there exists a ... 
Brands of cumulants in noncommutative probability, and relations between them
(University of Waterloo, 20220706)The study of noncommutative probability revolves around the different notions of independeces, such as free, Boolean and monotone. To each type of independence one can associate a notion of cumulants that linearize the ... 
Brick Generation and Conformal Subgraphs
(University of Waterloo, 20160415)A nontrivial connected graph is matching covered if each of its edges lies in a perfect matching. Two types of decompositions of matching covered graphs, namely ear decompositions and tight cut decompositions, have played ... 
BridgeSPA: A Single Packet Authorization System for Tor Bridges
(University of Waterloo, 20120110)Tor is a network designed for lowlatency anonymous communications. Tor clients form circuits through relays that are listed in a public directory, and then relay their encrypted traffic through these circuits. This ... 
Bridging Technical Spaces: Model Translation from TA to XMI and Back Again
(University of Waterloo, 2006)There are many different techniques and notations for extracting architecturally interesting information from the source code of existing software systems. This process is known as reverse engineering. One current ... 
Brownian Dynamics Simulation of Dusty Plasma: Comparison with Generalized Hydrodynamics
(University of Waterloo, 20100414)Brownian dynamics (BD) simulation method has been widely used for studying problems in dispersed systems, such as polymer solutions, colloidal suspensions and more recently, complex (dusty) plasmas. The main problem addressed ... 
BSMLmbeddr: Integrating Semantically Congurable StateMachine Models in a C Programming Environment
(ACM, 201611)In modeldriven engineering, developers express their solutions in domainspecific modelling languages (DSLs) that support domainspecific abstractions. BigStep Modelling Languages (BSML) is a family of extended statemachine ... 
BudgetConstrained Optimal Insurance with an Upper Limit on the Insurer's Exposure
(University of Waterloo, 20210113)This thesis studies the problem of budgetconstrained optimal insurance indemnification when the insurer imposes an upper limit on disbursement. In balancing the tradeoff between the cost of paying the insurance premium ... 
Budgetconstrained optimal insurance without the nonnegativity constraint on indemnities
(Elsevier, 201901)In a problem of Paretoefficient insurance contracting (bilateral risk sharing) with expectedutility preferences, Gollier (1987) relaxes the nonnegativity constraint on indemnities and argues that the existence of a ... 
Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs
(University of Waterloo, 20171030)Tor is the most popular tool for providing online anonymity. It is used by journalists, activists, and privacyconscious individuals to provide lowlatency private access to the Internet. However, Tor’s specific design and ... 
Building a Framework for Highperformance Inmemory MessageOriented Middleware
(University of Waterloo, 20191128)MessageOriented Middleware (MOM) is a popular class of software used in many distributed applications, ranging from business systems and social networks to gaming and streaming media services. As workloads continue to ... 
Building a larger class of graphs for efficient reconfiguration of vertex colouring
(University of Waterloo, 20200513)A $k$colouring of a graph $G$ is an assignment of at most $k$ colours to the vertices of $G$ so that adjacent vertices are assigned different colours. The reconfiguration graph of the $k$colourings, $\mathcal{R}_k(G)$, ...