Browsing Computer Science by Title
Now showing items 1366-1385 of 1551
-
Symbolic Model Checking of Product-Line Requirements Using SAT-Based Methods
(IEEE, 2015-05)Product line (PL) engineering promotes the de- velopment of families of related products, where individual products are differentiated by which optional features they include. Modelling and analyzing requirements models ... -
A Symmetric Interaction Model for Bimanual Input
(University of Waterloo, 2006)People use both their hands together cooperatively in many everyday activities. The modern computer interface fails to take advantage of this basic human ability, with the exception of the keyboard. However, the keyboard ... -
Symmetry Reduction and Compositional Verification on Timed Automata
(University of Waterloo, 2017-08-24)This thesis is about techniques for the analysis of concurrent and real-time systems. As the first contribution, we describe a technique that incorporates automatic symmetry detection and symmetry reduction in the ... -
Syntactic Complexities of Nine Subclasses of Regular Languages
(University of Waterloo, 2012-07-31)The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in ... -
Syntactic Complexities of Six Classes of Star-Free Languages
(Otto-von-Guericke-Universit¨at Magdeburg, 2012)The syntactic complexity of a regular language is the cardinality of its syntactic semi-group. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, ... -
Syntactic Complexities of Some Classes of Star-Free Languages
(Springer, 2012)The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, ... -
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
(Elsevier, 2012-08-31)The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in ... -
Syntactic Complexity Of R- And J-Trivial Regular Languages
(World Scientific Publishing, 2014-11-01)The syntactic complexity of a subclass of the class of regular languages is the maximal cardinality of syntactic semigroups of languages in that class, taken as a function of the state complexity n of these languages. We ... -
Syntactic Complexity of Regular Ideals
(Springer, 2017-08-04)The state complexity of a regular language is the number of states in a minimal deterministic finite automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic ... -
Syntactic Complexity of Suffix-Free Languages
(Elsevier, 2017-09-05)We solve an open problem concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a suffix-free language with n left quotients (that is, with state complexity n) is at most (n−1)n−2+n−2 ... -
Synthesis and evaluation of geometric textures
(University of Waterloo, 2013-09-06)Two-dimensional geometric textures are the geometric analogues of raster (pixel-based) textures and consist of planar distributions of discrete shapes with an inherent structure. These textures have many potential ... -
Systematically Detecting Access Control Flaws in the Android Framework
(University of Waterloo, 2022-08-25)Android's permission model is used to regulate access to the Application Program Interfaces (APIs) within the Android system services, which provide access to sensitive system resources, such as the camera and microphone. ... -
Systems and Algorithms for Dynamic Graph Processing
(University of Waterloo, 2023-03-10)Data generated from human and systems interactions could be naturally represented as graph data. Several emerging applications rely on graph data, such as the semantic web, social networks, bioinformatics, finance, and ... -
Systems for Graph Extraction from Tabular Data
(University of Waterloo, 2020-09-28)Connections amongst real-world entities provide significant insights for numerous real-life applications in social networks, semantic web, road maps, finance, among others. Graphs are perhaps the most natural way to model ... -
Systems for Managing Work-Related Transitions
(University of Waterloo, 2020-01-17)Peoples' work lives have become ever-populated with transitions across tasks, devices, and environments. Despite their ubiquitous nature, managing transitions across these three domains has remained a significant challenge. ... -
T-SIMn: Towards a Framework for the Trace-Based Simulation of 802.11n Networks
(University of Waterloo, 2016-02-17)With billions of WiFi devices now in use, and growing, combined with the rising popularity of high-bandwidth applications, such as streaming video, demands on WiFi networks continue to rise. To increase performance for ... -
Tabular Abstraction, Editing, and Formatting
(University of Waterloo, 2016-09-29)This dissertation investigates the composition of high-quality tables with the use of electronic tools. A generic model is designed to support the different stages of tabular composition, including the editing of logical ... -
Tagger: Enhance Database Search Tools with De Novo Sequencing Tags
(University of Waterloo, 2017-01-06)Tandem mass spectrometry (MS/MS) is widely used in proteomics nowadays to identify peptides and proteins from a sequence database. In a classic procedure of MS/MS protein identification, proteins are digested into short ... -
Task-Centric User Interfaces
(University of Waterloo, 2014-05-22)Software applications for design and creation typically contain hundreds or thousands of commands, which collectively give users enormous expressive power. Unfortunately, rich feature sets also take a toll on usability. ... -
TCP Connection Management Mechanisms for Improving Internet Server Performance
(University of Waterloo, 2005)This thesis investigates TCP connection management mechanisms in order to understand the behaviour and improve the performance of Internet servers during overload conditions such as flash crowds. We study several ...