The performance of parallel computer systems is increasingly limited by constraints imposed by interconnects and this limitation will inevitably become more serious as capability of each processing node increases. Optics has already proved its worth in telecommunications and more recently in interconnecting computers and computer peripherals. In this paper, we propose an optical hybrid tree net...

The paper establishes Horton self-similarity for a tree representation of Kingman’s coalescent process. The proof is based on a Smoluchowski-type system of ordinary differential equations that describes evolution of the number of branches of a given HortonStrahler order in a tree that represents Kingman’s N -coalescent, in a hydrodynamic limit. We also demonstrate a close connection between the...

The parsimony score of a character on a tree equals the number of state changes required to fit that character onto the tree. We show that for unordered, reversible characters this score equals the number of tree rearrangements required to fit the tree onto the character. We discuss implications of this connection for the debate over the use of consensus trees or total evidence and show how it ...

We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-state virtual connection composition rules with some new Hex game-state reduction results based on move domination. The algorithm is powerful enough...

Recently a new connection between proof theory and formal language theory was introduced. It was shown that the operation of cut elimination for proofs with prenex Π1-cuts in classical first-order logic corresponds to computing the language of a particular type of tree grammars. The present paper extends this connection to arbitrary (i.e. non-prenex) cuts without quantifier alternations. The ke...

We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-state virtual connection composition rules with some new Hex game-state reduction results based on move domination. The algorithm is powerful enough...

In international packages Wireless Sensor Networks (WSNs) plays a critical pose nowadays. The value of WSNs basically depends on the statistics collection scheme. Several data collection schemes such as multipath, chain, tree, and cluster and hybrid topologies are presented in literature for congregation records in WSNs. but, the prevailing facts collection schemes fail to offer an assured reli...

Many semantic parsing models use tree transformations to map between natural language and meaning representation. However, while tree transformations are central to several state-of-the-art approaches, little use has been made of the rich literature on tree automata. This paper makes the connection concrete with a tree transducer based semantic parsing model and suggests that other models can b...

Efficient reconfiguration of optical multicast trees in wavelength division multiplexing (WDM) networks is required. Multimedia applications which consume a huge bandwidth, require multicasting. So, multicast concept is extended to optical networks to improve performance. Today, networks are facing many phenomena such as changes in the traffic model, failures, additions or deletions of some net...