Adopting the perspective of graph theory, Martin et al. (2010) described two kinds of phylogenetic trees, which they termed node-based and stem-or branch-based, that differ with respect to the biological interpretations of their component nodes and branches. After establishing equivalency between the two different kinds of trees in terms of encoded information regarding taxa and their phylogene...

This paper describes a technique to evolve 3D models of plants based on deterministic automata. It uses cellular encoding to obtain these automata from trees evolved in standard genetic programming software. The fitness is a combination of high-level characteristics of the model, including overall shape, number of branches and geometric characteristics. We introduce a grid-based constraint eval...

A special carry-free circuit for the evaluation of conditions of the type A + B = K is proposed by cortadella and Llaberia, and its usefulness for reducing the negative effects of conditional branches in pipelied architectures is noted. It is shown that the same advantages are offered by another equally simple circuit based on carry-save redundant numbers and (3, 2)-counters. This alternative c...

Contemporary research on computational processing of linguistic metaphors is divided into two main branches: metaphor recognition and metaphor interpretation. We take a different line of research and present an automated method for generating conceptual metaphors from linguistic data. Given the generated conceptual metaphors, we find corresponding linguistic metaphors in corpora. In this paper,...

This paper describes an algorithm for improvement of the speed of a time-asynchronous fast match, which is a part of a stack-search based recognition system. This fast match uses a phonetic tree to represent the entire vocabulary of the recognizer. Evaluation of the tree (in a depthrst manner), can be done much more e ciently using the fact that under certain conditions, the results of branch e...