We use the traveling front approach to derive exact asymptotic results for the statistics of the number of particles in a class of directed diffusion-limited aggregation models on a Cayley tree. We point out that some aspects of these models are closely connected to two different problems in computer science, namely, the digital search tree problem in data structures and the Lempel-Ziv algorith...

A new technique presents to improve the performance of dynamic voltage restorer (DVR) for voltage sag mitigation. This control scheme is based on cuckoo search algorithm with tree fuzzy rule based classifier (CSA-TFRC). CSA is used for optimizing the output of TFRC so the classification output of the network is enhanced. While, the combination of cuckoo search algorithm, fuzzy and decision tree...

Sphere-Decoding (SD) methods are branch-and-bound-like techniques used for optimal detection of digital communications signals over in wireless MIMO (Multiple input Multiple Output) channels. These methods look for the optimal solution in a tree of partial solutions; the size of the tree depends on the parameters of the problem (dimension of the channel matrix, cardinality of the alphabet), and...

The focus of this paper is to design an efficient indexing structure for spatial-temporal-textual data in a digital library environment. Along with traditional document collections, modern digital libraries contain forum discussions, bolg-posts, user provided URLs, and many other digital artifacts. All of these artifacts have time stamps, most of these artifacts have textual description, and so...

there is an increasing demand for reliable large-scale soil datato meet the requirements of models for planning of land-usesystems, characterization of soil pollution, and prediction ofland degradation. cation exchangecapacity (cec) is among the most important soil propertiesthat are required in soil databases. this paper applied a novel method for whole-soil profile predictions of cec (to 1 m)...

the present research endeavors to discover similarities and differences among digital libraries in iran and to clarify the extent of their consistency in terms of main library requisites. using a qualitative -quantitative method, i.e. a survey research method using content analysis, it identifies iranian digital libraries (idls) and explores their characteristics. reviewing the literature, we i...

We consider random tries constructed from sequences of i .i.d . random variables with a common density f on [0,1] (i.e., paths down the tree are carved out by the bits in the binary expansions of the random variables) . The depth of insertion of a node and the height of a node are studied with respect to their limit laws and their weak and strong convergence properties . In addition, laws of th...

The trie structure is probably the most well-known amongst digital structures. It is a tree representation of sets of digital (e.g. binary) sequences that has been introduced by de la Briandais and Fredkin [9] t and bears analogies to binary search trees [ 11, 15, 17, 20, 1, 191 Operations like insert, delete, query, union, intersection ... can be performed efficiently on this representation of...