Now showing items 2721-2740 of 2998

    • Syntactic Complexities of Six Classes of Star-Free Languages 

      Brzozowski, Janusz; Li, Baiyu; Liu, David (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 

      Brzozowski, Janusz; Li, Baiyu (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 

      Brzozowski, Janusz; Li, Baiyu; Ye, Yuli (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 

      Brzozowski, Janusz; Li, Baiyu (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 

      Brzozowski, Janusz; Szykuła, Marek; Ye, Yuli (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 

      Brzozowski, Janusz; Szykuła, Marek (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 

      AlMeraj, Zainab (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 ...
    • Synthetic quorum sensing in model microcapsule colonies 

      Shum, Henry; Balazs, Anna C. (Proceedings of the National Academy of Sciences, 2017-07-24)
      Biological quorum sensing refers to the ability of cells to gauge their population density and collectively initiate a new behavior once a critical density is reached. Designing synthetic materials systems that exhibit ...
    • Systematically Detecting Access Control Flaws in the Android Framework 

      El-Rewini, Zeinab (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 

      Ammar, Khaled (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 

      Anzum, Nafisa (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 

      Williams, Alex (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 

      Heard, Andrew (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 

      Wang, Xinxin (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 

      Tang, Qi (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 ...
    • Tail Dependence and Heavy Tailedness in Extreme Risks 

      Ji, Liuyan (University of Waterloo, 2020-12-18)
      Much empirical work has shown that asset returns, exchange rates, operational risks, large insurance claims exhibit heavy tailedness. Dependence also widely exists among these risks. An example of the impact of dependence ...
    • Task-Centric User Interfaces 

      Lafreniere, Benjamin J. (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. ...
    • A Taylor polynomial expansion line search for large-scale optimization 

      Hynes, Michael` (University of Waterloo, 2016-08-29)
      In trying to cope with the Big Data deluge, the landscape of distributed computing has changed. Large commodity hardware clusters, typically operating in some form of MapReduce framework, are becoming prevalent for ...
    • TCP Connection Management Mechanisms for Improving Internet Server Performance 

      Shukla, Amol (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 ...
    • Techniques and heuristics for improving the visual design of software agreements 

      Kay, Matthew (University of Waterloo, 2010-09-10)
      End users must regularly agree to lengthy software agreements prior to installing software or using software services. However, despite the fact that these agreements contain terms of direct concern to users—e.g., data ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages