Binary tree classification has been useful for classifying the whole population based on the levels of outcome variable that is associated with chosen predictors. Often we start a classification with a large number of candidate predictors, and each predictor takes a number of different cutoff values. Because of these types of multiplicity, binary tree classification method is subject to severe ...

This report presents power consumption results of 24-bit hybrid TCS (Tree Carry Select) adders using HEAT tool. Fast binary adder architectures which can be implemented using multiplexers have been proposed in 1]. This binary adders are carried out using fast redundant-to-binary (RB) converter. Two types of RB converters based on tree-type and carry-select were designed. In this report, the low...

We propose a hybrid hierarchical classifier that solves multiclass problems in high dimensional space using a set of binary classifiers arranged as a tree in the space of classes. It incorporates good aspects of both the binary hierarchical classifier (BHC) and the margin tree algorithm, and is effective over a large range of (sample size, input dimensionality) values. Two aspects of the propos...

We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by Gurevich and Shelah using set theoretical arguments. Our proof is much simpler and only uses basic tools from automata theory. We show how the result can be used to prove the inherent ambiguity of languages of infinite...

This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the binary tree ratio. It is shown that the greedy algorithm solves the problem to optimality when the binary tree ratio is at most 2. We also show that the problem is unary NP-har...

This paper presents a method to recognize the various defect patterns of a cold mill strip using a binary decision tree constructed by genetic algorithm(GA). In this paper, GA was used to select a subset of the suitable features at each node in the binary decision tree. The feature subset with maximum fitness is chosen and the patterns are divided into two classes using a linear decision functi...

To anti-collision problem of multiple tags of RFID in ETC (Electronic Toll Collection) system, a novel BBS (Backtracking Binary-tree Search ) anti-collision algorithm is proposed in working in UHF (5.8G) based on the DBS (Dynamic Binary-tree Search) and RSBS (Random Split Binary-tree Search) to solve the only one bit collision in inquiry. The BBS algorithm can reduce twice inquiry process. The ...

This paper presents modeling of a binary tree that represents a natural number and gives an inductive proof for its properties using theorem provers. We define a function for converting data from a natural number into a binary tree and give an inductive proof for its well-definedness. We formalize this method, develop a computational model based on it, and apply it to an electronic cash protoco...

An algorithm is presented that allows the calculation of the probability of a set of sequences related by a binary tree that has evolved according to the Thorne-Kishino-Felsenstein model (1991) for a fixed set of parameters. There are two ideas underlying this algorithm. Firstly, a markov chain is defined that generates ancestral sequences and their alignment at two neighboring nodes in a tree....

We consider compression of multi-component map images by context modeling and arithmetic coding. We apply optimized multi-level context tree for modeling the individual binary layers. The context pixels can be located within a search area in the current layer, or in a reference layer that has already been compressed. The binary layers are compressed using an optimized processing sequence that m...