Many distributed systems and applications use decentralized control algorithms lying on a predefined virtual ring. Such a structure is usually statically defined, and is thus inherent to the system definition. Ring construction distributed algorithms are proposed. First, distributed depth-first traversal algorithms are shown to be an algorithmic basis for the construction of such a structure. T...

This paper gives an online algorithm for generating Jakobsson’s fractal hash chains [14]. Our new algorithm compliments Jakobsson’s fractal hash chain algorithm for preimage traversal since his algorithm assumes the entire hash chain is precomputed and a particular list of ⌈logn⌉ hash elements or pebbles are saved. Our online algorithm for hash chain traversal incrementally generates a hash cha...

ATP-dependent chromatin remodeling enzymes (CRE) are bio-molecular motors in eukaryotic cells. These are driven by a chemical fuel, namely, adenosine triphosphate (ATP). CREs actively participate in many cellular processes that require accessibility of specific segments of DNA which are packaged as chromatin. The basic unit of chromatin is a nucleosome where 146 bp ∼ 50 nm of a double stranded ...

Image space occlusion culling is an useful approach to reduce the rendering load of large polygonal models. Like most large model techniques, it trades overhead costs with the rendering costs of the possibly occluded geometry. Meanwhile, modern graphics hardware supports occlusion culling. Unfortunately these hardware extensions consume fillrate and latency costs. In this paper, we propose a ne...

Many real-world problems appearing in diverse application domains involve large multivariate interrelated data. For this reason, graphbased data models have gained popularity in recent years. Graph traversal is a powerful computational paradigm addressing the challenges of graph data management; yet, its complexity and specificity might hinder its use for interactive data exploration by non-exp...

This paper presents a technique for dependence analysis on programs with pointers or dynamic recursive data structures. It differs from previously proposed approaches in analyzing structure access conflicts between traversal patterns before gathering alias and connection information. Conflict analysis is conducted under the assumption that each unique path leads to a distinct storage location, ...

Industrial robust controlling systems built using automated guided vehicles (AGVs) requires planning which depends on cost parameters like time and energy of the mobile robots functioning in the system. This work addresses the problem of on-line traversal time identification and estimation for proper mobility of mobile robots on systems’ traffic networks. Several filtering and estimation method...

Current operations of planetary rovers, especially the planning and execution of traverse operations, rely on human analysis and estimation of non-geometric hazards based on images captured by the rover. Despite the use of advanced path planning algorithms capable of avoiding obstacles, this limits daily traverse distances. This paper presents a system concept for planetary rovers capable of sa...

Website can be easily design but to efficient user navigation is not a easy task since user behavior is keep changing and developer view is quite different from what user wants, so to improve navigation one way is reorganization of website structure. For reorganization here proposed strategy is farthest first traversal clustering algorithm perform clustering on two numeric parameters and for fi...

We propose a novel adaptive pipeline for continuous collision detection in cloth simulation. The pipeline consists of four components: bounding volume hierarchy (BVH) update, BVH traversal, a skipping frame session, and elementary test processing. The skipping frame session is activated adaptively for skipping both BVH update and BVH traversal during the process of collision detection. The prop...