The technique of layered manufacturing in rapid prototyping is to fabricate product prototype by scanning the cross-sectional contours of the product using a laser beam layer by layer. The outlines of geometrical objects on each layer are different, and each layer may contain several geometrical objects. In order to simplify the problem, each geometrical object on the same plane is approximatin...

Query execution over the Web of Linked Data has attracted much attention recently. A particularly interesting approach is link traversal based query execution which proposes to integrate the traversal of data links into the creation of query results. Hence –in contrast to traditional query execution paradigms– this does not assume a fixed set of relevant data sources beforehand; instead, the tr...

Small animals and robots must often rapidly traverse large bump-like obstacles when moving through complex 3D terrains, during which, in addition to leg-ground contact, their body inevitably comes into physical contact with the obstacles. However, we know little about the performance limits of large bump traversal and how body-terrain interaction affects traversal. To address these, we challeng...

Since IPv4 Private Networks are behind NAT (Network Address Translation) devices. So, to bypass the Binding Update and Binding Acknowledgment by NAT, we need to encapsulate it in UDP (User datagram Protocol) Packets. Hence, the Dual Stack Mobile IPv6 should support NAT Traversal and Detection. So for proper securing and fully functionality of NAT traversal, it should be IP Security Protected. P...

For a long time, traditional client-server communication was the predominant communication paradigm of the Internet. Network Address Translation devices (NAT) emerged to help with the limited availability of IP addresses and were designed with the hypothesis of asymmetric connection establishment in mind. But with the growing success of peer-to-peer applications, this assumption is no longer tr...

An orthogonal BSP (binary space partitioning) tree is a commonly used spatial subdivision data structure for ray tracing acceleration. While the construction of a BSP tree takes a relatively short time, the e ciency of a traversal algorithm signi cantly in uences the overall rendering time. We propose a new fast traversal algorithm based on statistical evaluation of all possible cases occurring...

Online, one-pass mining Web click streams poses some interesting computational issues, such as unbounded length of streaming data, possibly very fast arrival rate, and just one scan over previously arrived Web click-sequences. In this paper, we propose a new, single-pass algorithm, called DSM-TKP (Data Stream Mining for Top-K Path traversal patterns), for mining a set of top-k path traversal pa...

Mining frequent traversal patterns is to discover the consecutive reference paths traversed by a sufficient number of users from Web logs in a Web environment where users can travel from one object to another through the corresponding hyperlinks. Previous approaches for mining frequent traversal patterns only consider the forward references, such that the information about backward references w...