In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space used to store the routing table on each node and the stretch factor of the multicast scheme – the maximum ratio over all sets of nodes between the cost of the multicast route induced by the scheme and the cost of a stein...

This paper proposes the use of a new binary decision tree, which we call a soft decision tree, to improve generalization performance compared to the conventional ‘hard’ decision tree method that is used to cluster context-dependent model parameters in statistical parametric speech synthesis. We apply the method to improve the modeling of fundamental frequency, which is an important factor in sy...

Fuzzy Decision Tree (FDT) classifiers combine decision trees with approximate reasoning offered by fuzzy representation to deal with language and measurement uncertainties. When a FDT induction algorithm utilizes stopping criteria for early stopping of the tree's growth, threshold values of stopping criteria will control the number of nodes. Finding a proper threshold value for a stopping crite...

considering convergent product as an important manufacturing technology for digital products, we integrate functions and sub-functions using a comprehensive fuzzy mathematical optimization process. to form the convergent product, a web-based fuzzy network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is to be a link betwe...

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...

We present algorithms for a new self-adjusting binary search tree, which we call a shuffle tree. The tree is easy to implement and does not require parent pointers or balancing information to be stored in tree nodes. A maximum of one rotation is probabilistically applied during each traversal, which keeps the cost of balancing activity low. We present tests to compare the performance of shuffle...