Constructibility (Set theory). Trees (Graph theory).
This thesis investigates possible initial segments of the degrees of constructibility. Specifically, we completely characterize the structure of degrees in generic extensions of the constructible universe L via forcing with Souslin trees. Then we...
This thesis contains material relating to two separate subjects. The first section determines when the C*-algebra affiliated to a directed graph has continuous trace. We use groupoid methods and the focus is on producing conditions on a graph that...
Internet -- Security measures. Public key infrastructure (Computer security). Digital signatures. Peer-to-peer architecture (Computer networks) -- Security measures.
The Internet has become a virtual place where people not only operate in isolation but also interact with other Internet users. Collaborative systems are becoming more popular. Applications now being introduced could provide better remote education...
The focus of this thesis is the study of nuclearity and exactness for groupoid crossed product C*-algebras. In particular, we present generalizations of two well-known facts from group dynamical systems and crossed products to the groupoid setting....
We present aligned hierarchies, a novel solution to the dimension reduction problem, representing high-dimensional and noisy sequential data as a low-dimensional object that encodes relevant information. In this thesis, we motivate our presentation...
Wireless communication systems. Computer network protocols.
We evaluate mobility predictors in wireless networks. Handoff prediction in wireless networks has long been considered as a mechanism to improve the quality of service provided to mobile wireless users. Most prior studies, however, were based on...
From deciding what to eat first or what stock to invest in, the order in which we prefer to experience events and the amount of risk we are willing to undertake are factors that influence our choices. However, the mechanisms underlying order and...
For many scientific applications, the data set cannot entirely fit in main memory. The data must reside out-of-core, i.e., on parallel disks. For many basic data-movement operations such as permuting, if the programmer does not design efficient...
Partially ordered sets. ; Convex polytopes. ; Representations of groups.
This thesis deals with geometric representations of ordered sets. In a geometric representation, each element of the ordered set is assigned a geometric object, with two elements incomparable in the ordered set if and only if the corresponding...
Computer input-output equipment. ; Computational grids (Computer systems). ; High performance computing. ; Electronic data processing -- Distributed processing.
High-performance computing increasingly occurs on computational grids composed of heterogeneous and geographically distributed systems of computers, networks, and storage devices that collectively act as a single virtual computer. A key challenge...
Public key infrastructure (Computer security). ; Computer networks -- Security measures. ; Operating systems (Computers). ; Microcomputers.
In 1976, Whitfield Diffie and Martin Hellman demonstrated how public key cryptography could enable secure information exchange between parties that do not share secrets. In order for public key cryptography to work in modern distributed...
Polynomials. Finite fields (Algebra). Algebraic functions. Number theory.
The ring of univariate polynomials over a finite field shares many foundational arithmetic properties with the ring of rational integers. This similarity makes it possible for many problems in elementary number theory to be translated 'through the...
In this thesis we look at several problems that lie in the intersection between combinatorial and multiplicative number theory. A common theme of many of these problems are estimates for and properties of the smooth numbers, those integers not...
In this thesis, we study the dynamics of magnetic flows on compact nilmanifolds. Magnetic flows are generalizations of geodesic flows. They model the motion of a particle of unit mass and unit charge in a smooth manifold M in the presence of a...
'Orthogonal modular forms are algebraic modular forms arising from lattices in quadratic spaces. In this thesis, we define orthogonal modular forms, establish their basic properties, and then apply them to a case of ternary quadratic spaces to...
Partially ordered sets and permutations are combinatorial structures having vast applications in theoretical computer science. In this thesis, we study various computational and algorithmic problems related to these structures. The first chapter of...
We start by introducing avoidance coupling of Markov chains, with an overview of existing results. We then introduce and motivate a new notion, uniform coupling. We show that the only Markovian avoidance coupling on a cycle is of this type, and...
Electronic data processing -- Distributed processing. ; Computer network architectures. ; Programming languages (Electronic computers) -- Semantics. ; Database management.
I tackle the problem of naming and sharing resources across administrative boundaries. Conventional systems manifest the hierarchy of typical administrative structure in the structure of their own mechanism. While natural for communication that...
An interval order is an ordered set whose elements are in correspondence with a collection of intervals in a linearly ordered set, with disjoint intervals ordered by their relative position. The order complex of an ordered set is the simplicial...