This paper presents a technique for incorporating terrain traversability data into a global path planning method for field mobile robots operating on rough natural terrain. The focus of this approach is on assessing the traversability characteristics of the global terrain using a multi-valued map representation of traversal dificulty, and using this information to compute a traversal cost funct...

Lacking support for generic traversal, functional programming languages su er from a scalability problem when applied to largescale program transformation problems. As a solution, we introduce functional strategies: typeful generic functions that not only can be applied to terms of any type, but which also allow generic traversal into subterms. We show how strategies are modelled inside a funct...

With the rapidgrowing number of WWWusers, hidden information becomes ever increasingly valuable. As a consequence of this phenomenon, mining Web data and analysing on-line users‘ behaviour and their on-line traversal partem have emerged as a new area of research. Primarily based on the Web servers‘ log files, the main objective of traversal pattem mining is to discover the frequent patterns in ...

We study the use of the Faraday effect as a quantum clock for measuring traversal times of evanescent photons through magneto-refractive structures. The Faraday effect acts both as a phase-shifter and as a filter for circular po-larizations. Only measurements based on the Faraday phase-shift properties are relevant to the traversal time measurements. The Faraday polarization filtering may cause...

An otherwise normal 28-month-old boy had a 2-month history of intermittent vomiting and a 1-week history of headaches. Neurologic examination was normal except for a right extensor plantar response. Axial CT scan (Fig . 1A) showed a large primarily intraventricular mass occupying the posterior left cerebral hemisphere. Directly caudad to this, a similar tumor was present in the left cerebellar ...

We propose a new algorithm for computing authentication paths in the Merkle signature scheme. Compared to the best algorithm for this task, our algorithm reduces the worst case running time considerably.

This document describes several Network Address Translator (NAT) traversal techniques that were considered to be used for establishing the RTP media flows controlled by the Real-Time Streaming Protocol (RTSP). Each technique includes a description of how it would be used, the security implications of using it, and any other deployment considerations it has. There are also discussions on how NAT...

We present the surface area traversal order (SATO) metric to accelerate shadow ray traversal. Our formulation uses the surface area of each child node to compute the TO. In this metric, we give a traversal priority to the child node with the larger surface area to quickly find occluders. Our algorithm reduces the pre-processing overhead significantly, and is much faster than other metrics. Over...

In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that both a π(1), . . . , aπ(n) and bπ(1), . . . , bπ(n) are self-avoiding polygonal arcs? We show thatPaired Pointset Traversal is NP-complete. This has consequences for the complexity of computing the Fréchet distance of ...

Middleboxes, such as firewalls, NATs, proxies, and application accelerators are known for their undesirable implications on traffic (mainly due to packet headers or paylod modifications) and for hindering connection establishment when certain protocols are in use (e.g., UDP, SCTP). Since many of these implications occur in middleboxes within ISPs or cellular networks, we present a software-defi...