Cleary and Taback devised a method called the nested traversal method to construct minimal length representatives for positive and negative elements in Thomspson’s group. We show how to use the nested traversal method to construct minimal length representatives for a larger class of elements of this

We present a technique that allows the implementation of a stack on programmable graphics hardware, using textures and fragment shaders. This development enables a whole new class of GPU algorithms, including recursive functions on complex data structures. Kd-tree traversal for ray tracing is demonstrated as an application. The traversal core was integrated into a purely GPU based photorealisti...

Bounding volume hierarchies have become a very popular way to speed up ray tracing. In this paper we present a novel traversal and approximation scheme for bounding volume hierarchies, which is comparable in speed, has a very compact traversal algorithm and uses only 25% of the memory, compared to a standard bounding volume hierarchy.

Through block cipher method, this paper demonstrates using preorder and post traversal sequence of a binary tree with 64 nodes to implement symmetric encryption/decryption. The different traversal sequences may determine a binary tree, so the method is vulnerable to be attacked. The paper’s further deduction involves improvement using multiple binary trees, so that more secure and efficient sym...

Management of graph-shaped data gained a momentum to both industry and research. Traversal queries through a graph-shaped dataset are easy to express, and can be efficiently executed using graph databases. High-performance traversals through graphshaped data is claimed to be enabled by native graph storage (i.e., encoding data using graph data structures), and native graph processing (i.e., ope...

This paper proposes an approach for computing a sequence of finger repositioning that allows a 4fingered hand to switch from one grasping configuration to another while maintaining a force-closure grasp of a polygon during the entire process. Assuming frictional point contacts, the proposed approach is based on exploring a structure called switching graph. The connectivity of this structure cap...

With the growing size and complexity of the Internet several types of middleboxes have been introduced to the network in order to solve a number of urgent problems. Network Address Translation devices fight against the Internet address depletion problem, caches and proxies help to efficiently distribute content and firewalls protect networks from potential attackers. Unfortunately, middleboxes ...