This paper addresses the informational asymmetry for con structing an ultrametric evolutionary tree from upper and lower bounds on pairwise distances between n given species We show that the tallest ultrametric tree exists and can be constructed in O n time while the existence of the shortest ultrametric tree depends on whether the lower bounds are ultrametric The tallest tree construction algo...

We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than Sarkar’s construction which is the previously best known complete binary tree based construction. But only disadvantage is that here we need more key length expansion than that of Shoup’s sequential algorithm. But it is...

We consider wireless multicast tree construction for energy efficiency. We introduce a novel algorithm, Incremental Shortest Path Tree (ISPT), to generate source-basedmulticast trees and analyse its performance. Additionally, the potential of further improvements in the tree construction is addressed comparing the performance of the algorithm with the results from a simulated annealing optimisa...

The problem of finding a minimum spaYlning tree connecting n points in a k-dimensional space is discussed under three comon distance metrics -Euclidean, rectilinear, and L . co By employing a subroutine that -=. solves the post office problem, we show that, for fixed k 2 3 , such a minimum spanning tree can be found in time O(n2’&Ck)(log n)l-a(k)) 9 where a(k) = 2 -(k+l) 1.8 . The bound can be ...

We present a black-box active learning algorithm for inferring extended finite state machines (EFSM)s by dynamic black-box analysis. EFSMs can be used to model both data flow and control behavior of software and hardware components. Different dialects of EFSMs are widely used in tools for modelbased software development, verification, and testing. Our algorithm infers a class of EFSMs called re...

Given a set P of n planar points, two axes and a realvalued score function f() on subsets of P , the Optimal Planar Box problem consists in finding a box (i.e. an axis-aligned rectangle) H maximizing f(H ∩ P ). We consider the case where f() is monotone decomposable, i.e. there exists a composition function g() monotone in its two arguments such that f(A) = g(f(A1), f(A2)) for every subset A ⊆ ...

the paper deals with the analysis of the external factor (solar activity, volcanic eruptions) influence on tree growth at the kola peninsula, northwestern russia. pinus sylvestris l. (scots pine) tree-ring chronologies collected nearby the northern timberline (68.63n, 33.25e) include the oldest (1445-2005 ad) living pine tree found up to date in the kola peninsula. a total of 18 living trees p...

We present a technique to prevent the construction of intermediate data structures in functional programs, which is based on results from the theory of tree transducers. We rst decompose function deen-itions, which correspond to macro tree transducers, into smaller pieces. Under certain restrictions these pieces can be composed to an attributed tree transducer using a composition result for att...

This paper describes an integrated methodology for the construction of test cases from functional specifications using the classification-tree method. It is an integration of our extensions to the classificationhierarchy table, the classification tree construction algorithm, and the classification tree restructuring technique. Based on the methodology, a prototype system ADDICT, which stands fo...