Now showing items 2701-2720 of 2985

    • A Symmetric Interaction Model for Bimanual Input 

      Latulipe, Celine (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 ...
    • Symmetrically-Normed Ideals and Characterizations of Absolutely Norming Operators 

      Pandey, Satish Kumar (University of Waterloo, 2018-08-23)
      The primary objective of this thesis is two fold: first, it is devoted to the study of absolutely norming operators (with respect to various arbitrary symmetric norms on $\mathcal{B}(\mathcal{H})$) with an eye towards the ...
    • Symmetries 

      Foldes, Stephane (University of Waterloo, 2016-10-03)
      Automorphisms of graphs, hypergraphs and disgraphs are investigated. The invariance of the chromatic polynomial in the rotor effect is disproved. New invariance results are obtained. It is shown that given any integer k ...
    • Symmetry Reduction and Compositional Verification on Timed Automata 

      Nguyen, Hoang Linh (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 ...
    • Synchronization in Heterogeneous Networks of Hippocampal Interneurons 

      Bazzazi, Hojjat (University of Waterloo, 2005)
      The hippocampus is one of the most intensely studied brain structures and the oscillatory activity of the hippocampal neurons is believed to be involved in learning and memory consolidation. Therefore, studying rhythm ...
    • Synchronization of Complex-Valued Dynamical Networks 

      Shen, Yuan (University of Waterloo, 2021-09-27)
      Dynamical networks (DNs) have been broadly applied to describe natural and human systems consisting of a large number of interactive individuals. Common examples include Internet, food webs, social networks, neural networks, ...
    • Synchronization of coupled reaction-diffusion neural networks: Delay-dependent pinning impulsive control 

      Xie, Xiang; Liu, Xinzhi; Xu, Honglei; Luo, Xiaobing; Liu, Genfan (Elsevier, 2019-12)
      This paper studies the synchronization problem of coupled reaction-diffusion neural networks with time-varying delays. A novel pinning impulsive controller is proposed, where distributed delays and discrete delays are taken ...
    • Syntactic Complexities of Nine Subclasses of Regular Languages 

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

      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. ...

      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