Results 11  20
of
28
Wearable Computing and Augmented Reality
 URL
, 1996
"... : Wearable computing will change the current paradigms of humancomputer interaction. With headsup displays, unobtrusive input devices, personal wireless local area networks, and a host of other context sensing and communication tools, wearable computing can provide the user with a portable augment ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
: Wearable computing will change the current paradigms of humancomputer interaction. With headsup displays, unobtrusive input devices, personal wireless local area networks, and a host of other context sensing and communication tools, wearable computing can provide the user with a portable augmented reality where many aspects of everyday life can be electronically assisted. This paper focuses on several such situations, such as an academic or business conference, classroom notetaking, office communication, maintenance, or a visit to a museum. 1 Introduction The recent push for smaller and faster notebook computers is indicative of a major trend in computing. Users want computers that are as portable and convenient as possible to help them with daily activities. In order to accommodate this trend, keyboardless Personal Digital Assistants (PDA's) were introduced. Current attempts at a PDA revolve around pen computing. While handwriting recognition will improve, these systems will a...
Entropic geometry from logic
 In: MFPS XIX. 2003. arXiv:quantph/0212065
"... 1. A finitary probability space (=all probability measures on a fixed finite support) can be faithfully represented by a partial order equipped with a measure of content (e.g. Shannon entropy). 2. This partial order can be obtained via a purely ordertheoretic systematic procedure starting from an a ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
1. A finitary probability space (=all probability measures on a fixed finite support) can be faithfully represented by a partial order equipped with a measure of content (e.g. Shannon entropy). 2. This partial order can be obtained via a purely ordertheoretic systematic procedure starting from an algebra of properties. This procedure applies to any poset envisioned as an algebra of properties. 1
Entropy as a fixed point
"... We study complexity and information and introduce the idea that while complexity is relative to a given class of processes, information is process independent: Information is complexity relative to the class of all conceivable processes. In essence, the idea is that information is an extension of ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We study complexity and information and introduce the idea that while complexity is relative to a given class of processes, information is process independent: Information is complexity relative to the class of all conceivable processes. In essence, the idea is that information is an extension of the concept algorithmic complexity from a class of desirable and concrete processes, such as those represented by binary decision trees, to a class more general that can only in pragmatic terms be regarded as existing in the conception. It is then precisely the fact that information is defined relative to such a large class of processes that it becomes an eective tool for analyzing phenomena in a wide range of disciplines. We test
Ideal Models of Spaces
 Theoretical Computer Science
, 2000
"... Ideal domains have an elementary order theoretic structure: Every element is either compact or maximal. Despite this, we establish that (1) They can model any space currently known to possess a countably based model, and (2) The metric spaces with ideal models are exactly the completely metrizab ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Ideal domains have an elementary order theoretic structure: Every element is either compact or maximal. Despite this, we establish that (1) They can model any space currently known to possess a countably based model, and (2) The metric spaces with ideal models are exactly the completely metrizable spaces.
Compactness of the space of causal curves
 J. Class. Quantum Gravity
, 2006
"... We prove that the space of causal curves between compact subsets of a separable globally hyperbolic poset is itself compact in the Vietoris topology. Although this result implies the usual result in general relativity, its proof does not require the use of geometry or differentiable structure. 1 ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We prove that the space of causal curves between compact subsets of a separable globally hyperbolic poset is itself compact in the Vietoris topology. Although this result implies the usual result in general relativity, its proof does not require the use of geometry or differentiable structure. 1
A Renee Equation for Algorithmic Complexity
 Lecture Notes in Computer Science
, 2001
"... We introduce a notion of complexity for the renee equation and use it to develop a method for analyzing search algorithms which enables a uniform treatment of techniques that manipulate discrete data, like linear and binary search of lists, as well as those which manipulate continuous data, like me ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We introduce a notion of complexity for the renee equation and use it to develop a method for analyzing search algorithms which enables a uniform treatment of techniques that manipulate discrete data, like linear and binary search of lists, as well as those which manipulate continuous data, like methods for zero nding in numerical analysis. 1
Powerdomains and Zero Finding
, 2002
"... Traditionally, powerdomains have been used to provide models for various forms of nondeterminism in semantics. We establish a similar analogy between zero nding methods in numerical analysis and powerdomains: Different powerdomain constructions correspond to dierent types of behavior exhibited by n ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Traditionally, powerdomains have been used to provide models for various forms of nondeterminism in semantics. We establish a similar analogy between zero nding methods in numerical analysis and powerdomains: Different powerdomain constructions correspond to dierent types of behavior exhibited by numerical methods for zero finding. By combining this observation with the basic quantitative paradigm provided by measurement, a simple and uniform method for analyzing zero finding algorithms is obtained.
A technique for verifying measurements
 24th Conference on Mathematical Foundations of Programming Semantics, Electronic Notes in Theoretical Computer Science
, 2008
"... We give a technique that can be used to prove that a given function is a measurement. We demonstrate its applicability by using it to resolve three notoriously difficult cases: capacity in information theory, entropy in quantum mechanics and global time in general relativity. We then show that this ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We give a technique that can be used to prove that a given function is a measurement. We demonstrate its applicability by using it to resolve three notoriously difficult cases: capacity in information theory, entropy in quantum mechanics and global time in general relativity. We then show that this technique provides a new and surprising characterization of measurement. Thus, in principle, it can always be used. Keywords: domain theory, measurement, information theory, quantum mechanics, general relativity
Unique Fixed Points in Domain Theory
, 2001
"... We unveil new results based on measurement that guarantee the existence of unique fixed points which need not be maximal. In addition, we establish that least fixed points are always attractors in the topology, and then explore the consequences of these findings in analysis. In particular, an exten ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We unveil new results based on measurement that guarantee the existence of unique fixed points which need not be maximal. In addition, we establish that least fixed points are always attractors in the topology, and then explore the consequences of these findings in analysis. In particular, an extension of the Banach fixed point theorem on compact metric spaces [3] is obtained. 1
The Informatic Derivative at a Compact Element
 In Proceedings of FoSSaCS 02
, 2002
"... We extend the informatic derivative to compact elements in domains. This allows one to quantitatively analyze processes which manipulate both continuous and discrete data in a uniform manner. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We extend the informatic derivative to compact elements in domains. This allows one to quantitatively analyze processes which manipulate both continuous and discrete data in a uniform manner.