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...

Nucleosome traversal by RNA polymerase II (pol II) and recovery of chromatin structure after transcription are essential for proper gene expression. In this paper we show that nucleosomes assembled with Sin mutant histones present a much weaker barrier to traversal by pol II and are less likely to survive transcription. Increases in traversal from incorporation of Sin mutant histones and histon...

This paper proposes a new method for Network Address Translator (NAT) Traversal in UDP. Several techniques have been proposed for traversing NAT or firewall boxes in UDP. These techniques can establish UDP communication between hosts behind NATs. However, existing NAT traversal methods, including Universal Plug and Play (UPnP), Simple traversal of UDP over NATs (STUN) and Teredo, cannot travers...

Background: The fatal effect of ionizing radiation on cells depends on Linear Energy Transfer (LET) level. The distribution of ionizing radiation is sparse and homogeneous for low LET radiations such as X or γ, but it is dense and concentrated for high LET radiation such as heavy-ions radiation. Material and Methods: Chinese hamster ovary cells (CHO-K1) were exposed to 4 Gy Fe-ion 2000 keV/...

In order to accelerate execution of various matching and navigation operations on collections of XML documents, new indexing structure, based on tree signatures, is proposed. We show that XML tree structures can be efficiently represented as ordered sequences of preorder and postorder ranks, on which extended string matching techniques can easily solve the tree matching problem. We also show ho...