A model of a rigid-plastic rate-independent polycrystalline aggregate wherein subaggregates are represented as the nodes of a binary tree is proposed. The lowest nodes of the binary tree represent grains. Higher binary tree nodes represent increasingly larger sub-aggregates of grains, culminating with the root of the tree, which represents the entire polycrystalline aggregate. Planar interfaces...

Binary search tree and framed ALOHA algorithms are commonly adopted to solve the anti-collision problem in RFID systems. In this letter, the read efficiency of these two anti-collision algorithms is compared through computer simulations. Simulation results indicate the framed ALOHA algorithm requires less total read time than the binary search tree algorithm. The initial frame length strongly a...

Suux arrays and suux binary search trees are two data structures that have been proposed as alternatives to the classical suux tree to facilitate eecient on-line string searching. Here, we explore the relationship between these two structures. In particular, we present an alternative view of a suux array, with its auxiliary information, as a perfectly balanced suux binary search tree, and descr...

Motivation: Millions of genes in the modern species belong to only thousands of gene families. Genes duplicate and are lost during evolution. A gene family includes instances of the same gene in different species and duplicate genes in the same species. Two genes in different species are ortholog if their common ancestor lies in the most recent common ancestor of the species. Because of complex...

In a binary tree T of N leaves, the left (right) level l i (r i) of leaf i is the number of left (right) edges in path from the root to that leaf. The level n i of leaf i is n i = l i +r i. Kraft-McMillan's characteristic inequality gives a necessary and suucient condition for a multiset of integers fn 1 ; n 2 ; :::; n N g to be the length ensemble of a binary tree T. Similarly, Yeung's charact...

One of the criteria for inferring a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is Minimize Deep Coalescence (MDC). Exact algorithms for inferring the species tree from rooted, binary trees under MDC were recently introduced. Nevertheless, in phylogenetic analyses of biological data sets, estimated gene tree...