Planning requires the careful and error-prone process of defining a domain model. This is usually performed by planning experts who should know about both the domain in hand, and the planning techniques (including sometimes the inners of these techniques or the tools that implement them). In order planning to be widely used this process should be performed by non-planning experts. On the other ...

We review evidence that visual transient channels responding to temporal change of luminance provide inputs to motion mechanisms, and also play a part in judgments of static brightness. These channels can be adapted to give after effects of apparent dimming or brightening. Nonlinearity in these channels causes a sawtooth grating to look dark (or light) while it is moving to the left (or right)....

Many powerful parallelizing compiler techniques rely on the structures of data and code. Unfortunately, in many real applications, arrays do not have syntactic structures. In this paper, we show that logical data structures can be automatically recovered from the flat, one-dimensional arrays and accesses. We present a framework and algorithms for recovering the logical multi-dimensional data st...

Humans can r e c o v e r t h e shape o f a s u r f a c e f r o m i t s image b o u n d a r y . The a u t h o r s have p r e s e n t e d a new a p p r o a c h t o shape f r o m b o u n d a r y [ 4 ] . I t i n c l u d e s t h r e e p o i n t s : t h e l i n e o f c u r v a t u r e (LOC) r e g u l a r i t y , a n a l g o r i t h m f o r c o n s t r u c t i n g LOC net f r o m b o u n d a r y , and...

Wireless sensor-actor networks are a recent development of wireless networks where both ordinary sensor nodes and more sophisticated and powerful nodes, called actors, are present. In this paper we formalize a recently introduced algorithm that recovers failed actor communication links via the existing sensor infrastructure. We prove via refinement that the recovery is terminating in a finite n...

We present an analysis of the problem of recovering motion, particularly rotation, from two image frames. We derive an exact bound on the magnitude of the error in recovering the rotation. With the single weak requirement that the average translational image displacements are smaller than the eld of view, we demonstrate rigorously that the error in recovering the rotation is small. A lower boun...