12515579
Supporting serendipitous integration in mobile computing environments
Abstract In the richly networked world of the near future, mobile computing users will be confronted with an ever-expanding array of devices and services accessible in their environments. In such a world, we cannot expect to have available to us specific applications that allow us to accomplish every conceivable combination of devices that we may wish. Instead, we believe that many of our interactions with the network will be characterized by the use of “general purpose” tools that allow us to discover, use, and integrate multiple devices around us. This paper lays out the case for why we believe that so-called “serendipitous integration” is a necessary fact that we will face in mobile computing, and explores a number of design experiments into supporting end user configuration and control of networked environments through general purpose tools. We present an iterative design approach to creating such tools and their user interfaces, discuss our observations about the challenges of designing for such a world, and then explore a number of tools that take differing design approaches to overcoming these challenges. We conclude with a set of reflections on the user experience issues that we believe are inherent in dealing with ad hoc mobile computing in richly networked environments.
29526990
The orbital browser: composing ubicomp services using only rotation and selection
Most ubiquitous computing environments are designed as collections of highly distributed and heterogeneous services. In this paper we describe a user interface, the Orbital Browser, which reduces the complexity of ubicomp service composition to two simple end-user operations: rotation and selection. We discuss the design requirements imposed by service composition and how we addressed them with our system.
1624330
Recipes for digital living [ubiquitous computing in consumer electronics]
As networked devices become increasingly ubiquitous, the potential benefits to users increase exponentially. However, this potential can't be fully realized if it is entirely up to developers and manufacturers to expose the combined functionality buried in the expanding network. Recipes for digital living - created and modified by users themselves - offer an easy-to-understand, logically consistent way to capture and share the various ensembles possible in the expanding world of networked components.
1987929
Using speakeasy for ad hoc peer-to-peer collaboration
Peer-to-peer systems appear promising in terms of their ability to support ad hoc, spontaneous collaboration. However, current peer-to-peer systems suffer from several deficiencies that diminish their ability to support this domain, such as inflexibility in terms of discovery protocols, network usage, and data transports. We have developed the Speakeasy framework, which addresses these issues, and supports these types of applications. We show how Speakeasy addresses the shortcomings of current peer-to-peer systems, and describe a demonstration application, called Casca, that supports ad hoc peer-to-peer collaboration by taking advantages of the mechanisms provided by Speakeasy.
17905377
FLANNEL: adding computation to electronic mail during transmission
In this paper, we describe FLANNEL, an architecture for adding computational capabilities to email. FLANNEL allows email to be modified by an application while in transit between sender and receiver. This modification is done without modification to the endpoints---mail clients---at either end. This paper also describes interaction techniques that we have developed to allow senders of email to quickly and easily select computations to be performed by FLANNEL. Through, our experience, we explain the properties that applications must have in order to be successful in the context of FLANNEL.
15703762
Armi: a High Level Communication Library for Stapl
ARMI is a communication library that provides a framework for expressing fine-grain parallelism and mapping it to a particular machine using shared-memory and message passing library calls. The library is an advanced implementation of the RMI protocol and handles low-level details such as scheduling incoming communication and aggregating outgoing communication to coarsen parallelism. These details can be tuned for different platforms to allow user codes to achieve the highest performance possible without manual modification. ARMI is used by STAPL, our generic parallel library, to provide a portable, user transparent communication layer. We present the basic design as well as the mechanisms used in the current Pthreads/OpenMP, MPI implementations and/or a combination thereof. Performance comparisons between ARMI and explicit use of Pthreads or MPI are given on a variety of machines, including an HP-V2200, Origin 3800, IBM Regatta and IBM RS/6000 SP cluster.
6685885
Comprehensive statistical method for protein fold recognition
We present a protein fold recognition method that uses a comprehensive statistical interpretation of structural Hidden Markov Models (HMMs). The structure/fold recognition is done by summing the probabilities of all sequence-to-structure alignments Conventionally, Boltzmann statistics dictate that the optimal alignment can give an estimate of the lowest free energy of the sequence conformation imposed by the structural model. The alignment is optimized for a scoring function that is interpreted as a free energy of an amino acid in a structural environment. Near-optimal alignments are ignored, regardless of how likely they might be compared to the optimal alignment. Here we investigate an alternative view. A structure model can be seen as a statistical representation of an ensemble of similar structures. The optimal alignment is always the most probable, but sub-optimal alignments may have comparable probabilities. These sub-optimal alignments can be interpreted as optimal alignments to the “other” structures from the ensemble or optimal alignments under minor fluctuations in the scoring function. Summing probabilities for all alignments gives an estimate of sequence-model compatibility. We have built a set of structural HMMs for 188 protein structures, and have compared two methods for identifying the structure compatible with a sequence: by the optimal alignment probability and by the total probability. Fold recognition by total probability was 40% more accurate than fold recognition by the optimal alignment probability.
1211760
Heuristic Search Value Iteration for POMDPs
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret with respect to the optimal policy. HSVI gets its power by combining two well-known techniques: attention-focusing search heuristics and piecewise linear convex representations of the value function. HSVI's soundness and convergence have been proven. On some bench-mark problems from the literature, HSVI displays speedups of greater than 100 with respect to other state-of-the-art POMDP value iteration algorithms. We also apply HSVI to a new rover exploration problem 10 times larger than most POMDP problems in the literature.
10464813
Building Semantic Tools for Concept-based Learning Spaces: Knowledge Bases of Strongly-Structured Models for Scientific Concepts in Advanced Digital Libraries
Applying conventional principles of knowledge organization, representation, and other semantic tools, we have constructed a model for scientific concepts and employed knowledge bases and visualization tools to represent knowledge concerning scientific concepts. Strongly-structured models, such as the integration of a taxonomy (or thesaurus) with metadata (or attribute-value pairs) and domain-specific markup languages, as well as specialized models for learning scientific concepts, focus on such attributes as objective representations, operational semantics, use, and interrelationships of concepts. All of these play important roles in constructing representations of knowledge in most domains of science. Instructional activities for undergraduate teaching and learning are greatly facilitated with the use of such integrated semantic tools.
35525617
Eye movements and pupil dilation during event perception
Human observers segment ongoing activities into events that are reliable across observers [Newtson and Engquist 1976]. Segments can be small ("fine") or large ("coarse") with clusters of fine-grained segments relating hierarchically to coarse segments. Segmentation behaviour occurs even without instruction indicated by neural activity in the Medial Temporal complex (MT+)and Frontal Eye Field (FEF). Similar activation is observed during active segmentation [Zacks et al. 2001]. These two brain regions are known to be active during the processing of visual motion (MT+) and guiding saccadic eye movements (FEF). This, along with behavioural evidence [Zacks 2004], indicates that visual motion may play an important role in identifying events.