Is it possible to reduce the expected response time of every request at a web server, simply
by changing the order in which we schedule the requests? That is the question we ask in …

The basic idea behind ubiquitous computing is that computing moves out of the workstation
and personal computers to become pervasive in ours day to day lives. Marc Weiser …

This paper explores computer security in pervasive computing with focus on user
authentication. We present the concept of Proximity-Based User Authentication, as a …

It is common to evaluate scheduling policies based on their mean response times. Another
important, but sometimes opposing, performance metric is a scheduling policy's fairness. For …

Embedded systems often include a traditional processor capable of executing sequential
code, but both control and data-dominated tasks are often more naturally expressed using …

The paper outlines the design and implementation of the Real Time Application Interface
(RTAI) for Linux, as used for high performance local/distributed control systems implemented …

Dynamic arbitration based on a high priority transaction type. A first memory access request
is received at a first request queue. If the first memory access request is of a first type, the …

Location is a primary cue in many context-aware computing systems, and is often
represented as a global coordinate, room number, or a set of Euclidean distances to various …

We consider the problem of designing a preemptive protocol that is both fair and efficient
when one is only concerned with the sojourn time of the job and not intermediate results …

Gene insertion and deletion are basic phenomena found in DNA processing or RNA editing
in molecular biology. The genetic mechanism and development based on these …