A non-decreasing sequence of positive integer weights P ={p1, p2,..., pn} (n = N*(m-1) + 1, N is number of non-leaves of m-ary tree) is called absolutely ordered if the intermediate sequences of weights produced by m-ary Huffman algorithm for initial sequence P on i-th step satisfy the following conditions 2 , , ) ( 1 ) ( − = < + N 0 i p p i m i m . Let T be an m-ary tree of size n and M=M(T) b...

As we know breast cancer is the second death reason in Iran. One step of treatment process is radiotherapy, which needs careful consideration of contouring and therapeutic techniques Lung, thyroid, spinal cord, trachea and humerus are sensitive organs in breast cancer radiation therapy.  The most clinical studies recommended two ways for delivering 95 percent of dose to supraclavicular and ...

We consider the following basic question: a source node wishes to stream an ordered sequence of packets to a collection of receivers, which are in K clusters. A node may send a packet to another node in its own cluster in one time step and to a node in a different cluster in Tc time steps (Tc > 1). Each cluster has two special nodes. We assume that the source and the special nodes in each clust...

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

Let T be a node-weighted tree with n nodes, and let π(u, v) denote the path between two nodes u and v in T . We address two problems: (i) Path Maximum Query: Preprocess T so that, for a query pair of nodes u and v, the maximum weight on π(u, v) can be found quickly. (ii) Path Maximum Sum Query: Preprocess T so that, for a query pair of nodes u and v, the maximum weight sum subpath of π(u, v) ca...