The method to deal with the tag collision in RFID system can be directly called “Multiple Access”. According to the ideas of these different anti-collision algorithms, they can be divided into two categories. One is the binary tree algorithm based on deterministic; the other is the statistical-based ALOHA algorithm. Overall, however, there is still room for improvement on anti-collision algorit...

2 Binary search trees 2 2.1 Definition of a binary search tree . . . . . . . . . . . . . . . . . . 2 2.2 Profile. Discrete martingale . . . . . . . . . . . . . . . . . . . . . 3 2.3 Embedding in continuous time. Yule tree . . . . . . . . . . . . . . 4 2.4 Martingale connection Yule tree binary search tree . . . . . . . . 5 2.5 Asymptotics . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

In this paper we propose a new class of tree machines, called generalized compressed tree machines. Generalized compressed tree machines are obtained from complete binary tree machines by performing certain`con-traction' operations. A generalized compressed tree machine of height h has approximately 25% less number of processors than a complete binary tree of height h. We show that these machin...

Abstract. A hyperplane search tree is a binary tree used to store a set S of n d-dimensional data points. In a random hyperplane search tree for S, the root represents a hyperplane defined by d data points drawn uniformly at random from S. The remaining data points are split by the hyperplane, and the definition is used recursively on each subset. We assume that the data are points in general p...

In the next two lectures we study the question of dynamic optimality, or whether there exists a binary search tree algorithm that performs ”as well” as all other algorithms on any input string. In this lecture we will define a binary search tree as a formal model of computation, show some analytic bounds that a dynamically optimal binary search tree needs to satisfy, and show two search trees t...

In this paper we show that an arbitrary tree-like Markov chain can be embedded in a binary tree-like Markov chain with a special structure. When combined with [7], this implies that any tree structured QBD Markov chain can be reduced to a binary tree-like process. Furthermore, a simple relationship between the V , Rs and Gs matrices of the original and the binary tree-like Markov chain is estab...

A tree-based network $N$ on $X$ is called universal if every phylogenetic tree a base for $N$. Recently, binary networks have attracted great attention in the literature and their existence has been analyzed various studies. In this note, we extend analysis to non-binary show that there exist both rooted an unrooted with $n$ leaves all positive integers $n$.

A non-decreasing sequence of positive integer weights P = {p1, . . . , p2, pn} is called k-ordered if an intermediate sequence of weights produced by Huffman algorithm for initial sequence P on i-th step satisfies the following conditions: p (i) 2 = p (i) 3 , i = 0, k; p (i) 2 < p (i) 3 , i = k + 1, n − 3. Let T be a binary tree of size n and M = M(T ) be a set of such sequences of positive int...

In the next two lectures we study the question of dynamic optimality, or whether there exists a binary search tree algorithm that performs ”as well” as all other algorithms on any input string. In this lecture we will define a binary search tree as a formal model of computation, show some analytic bounds that a dynamically optimal binary search tree needs to satisfy, and show two search trees t...