Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- 3D Display (1)
- Algebras over a monad (1)
- Biometrics (1)
- Bitopologies (1)
- Coalgebra (1)
-
- Coalgebras (1)
- Customizable Environment (1)
- Distributive lattices (1)
- Document Authentication (1)
- Duality theory (1)
- Families (1)
- Head Tracking (1)
- Heyting algebras (1)
- History-dependent Automata (1)
- ID Cards (1)
- Named Sets (1)
- Partition Refinement (1)
- Presheaves (1)
- Security and ID Documents (1)
- Symmetry Reduction (1)
- Texture Coding (1)
- Virtual Reality (1)
- Wiimote (1)
- Publication
- Publication Type
Articles 1 - 7 of 7
Full-Text Articles in Other Computer Engineering
Wii-Mote Head Tracking: A Three Dimensional Virtual Reality Display, David Fairman
Wii-Mote Head Tracking: A Three Dimensional Virtual Reality Display, David Fairman
Computer Engineering
The goal of this project is to create a customizable three dimensional virtual reality display on a system available to any non-technical user. This System will use the infrared camera component of a standard Nintendo Wii-mote to track a user's head motions in all six major directions. The virtual reality will be a customizable image projected onto a screen or simply shown on a computer or TV monitor. In order to appear 3-dimensional, the image will continually change according to the position of the user's head. As the user moves their head to the left and right, portions of the …
Authentication Of Biometric Features Using Texture Coding For Id Cards, Jonathan Blackledge, Eugene Coyle
Authentication Of Biometric Features Using Texture Coding For Id Cards, Jonathan Blackledge, Eugene Coyle
Conference papers
The use of image based information exchange has grown rapidly over the years in terms of both e-to-e image storage and transmission and in terms of maintaining paper documents in electronic form. Further, with the dramatic improvements in the quality of COTS (Commercial-Off-The-Shelf) printing and scanning devices, the ability to counterfeit electronic and printed documents has become a widespread problem. Consequently, there has been an increasing demand to develop digital watermarking techniques which can be applied to both electronic and printed images (and documents) that can be authenticated, prevent unauthorized copying of their content and, in the case of printed …
Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz
Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz
Engineering Faculty Articles and Research
We introduce pairwise Stone spaces as a natural bitopological generalization of Stone spaces—the duals of Boolean algebras—and show that they are exactly the bitopological duals of bounded distributive lattices. The category PStone of pairwise Stone spaces is isomorphic to the category Spec of spectral spaces and to the category Pries of Priestley spaces. In fact, the isomorphism of Spec and Pries is most naturally seen through PStone by first establishing that Pries is isomorphic to PStone, and then showing that PStone is isomorphic to Spec. We provide the bitopological and spectral descriptions of many algebraic concepts important for the study …
On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz
On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz
Engineering Faculty Articles and Research
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a Set-monad M for functors arising as liftings. As an application we introduce the notion of commuting pair of endofunctors with respect to the monad M and show that under reasonable assumptions, the final coalgebra of one of the endofunctors involved can be obtained as the free algebra generated by the initial algebra of the other endofunctor.
On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan
On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan
Engineering Faculty Articles and Research
We investigate universal algebra over the category Nom of nominal sets. Using the fact that Nom is a full re ective subcategory of a monadic category, we obtain an HSP-like theorem for algebras over nominal sets. We isolate a `uniform' fragment of our equational logic, which corresponds to the nominal logics present in the literature. We give semantically invariant translations of theories for nominal algebra and NEL into `uniform' theories and systematically prove HSP theorems for models of these theories.
Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari
Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari
Engineering Faculty Articles and Research
Calculi that feature resource-allocating constructs (e.g. the pi-calculus or the fusion calculus) require special kinds of models. The best-known ones are presheaves and nominal sets. But named sets have the advantage of being finite in a wide range of cases where the other two are infinite. The three models are equivalent. Finiteness of named sets is strictly related to the notion of finite support in nominal sets and the corresponding presheaves. We show that named sets are generalisd by the categorical model of families, that is, free coproduct completions, indexed by symmetries, and explain how locality of interfaces gives good …
Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil
Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil
Engineering Faculty Articles and Research
We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to introduce new notions of finitary based monads and uniform monads. In a second part we spell out these notions in the language of universal algebra, show how to recover the logics of Gabbay-Mathijssen and Clouston-Pitts, and apply classical results from universal algebra.