Tree form is a low-level, architecture-independent intermediate representation (IR) used by the Flex java-to-hardware compiler. Using a tree-based IR allows for the automatic construction of high-quality code generators for a substantial set of computer architectures, from only the precise specification of these architectures. This paper provides a thorough description of Tree form: its constru...

An AVL tree [1] is the original type of balanced binary search tree. An insertion in an n-node AVL tree takes at most two rotations, but a deletion in an n-node AVL tree can take Θ(log n). A natural question is whether deletions can take many rotations not only in the worst case but in the amortized case as well. A sequence of n successive deletions in an n-node tree takes O(n) rotations [3], b...

Developing a Tree Adjoining Grammar which contains the information necessary for building the basic compositional semantics of sentences is a highly complex engineering task. To ensure consistency, ease of writing, of maintainance and of debugging, it is therefore important that this information be described at the appropriate level of abstraction. In the first part of this paper (sections 2 an...

Construction projects are characterized as very complex projects, where uncertainties part of it. Risk is an uncertain event or condition that, if it occurs, has a positive negative impact on one more project objectives, such time, cost, scope quality. management includes the process concerned with conducting risk identification, analysis, responses and planning control The study aims at carryi...

This survey describes the contribution of N. Aronszajn to set theory: the construction of an Aronszajn tree. We would like to explain to the non-specialist in set theory what is an Aronszajn tree, how it is constructed, and why it occupies such a central place in set theory. In fact, we describe two constructions: the classical one, and a newer construction of a canonical Aronszajn tree due to ...

The classification-tree method developed by Grochtmann and Grimm facilitates the identification of test cases from functional specifications via the construction of classification trees. Their method has been enhanced by Chen and Poon through the classification-tree construction and restructuring methodologies. We find, however, that the restructuring algorithm by Chen and Poon is applicable on...

We propose an hybrid CPU-GPU ray-tracing implementation based on an optimal Kd-Tree as acceleration structure. The construction and traversal of this KD-tree takes benefit from both the CPU and the GPU to achieve high-performance ray-tracing on mainstream hardware. Our approach, flexible enough to use only a single computing unit (CPU or GPU), is able to efficiently distribute workload between ...

The circular orders associated with planar drawings of an X-tree (or phylogenetic tree) have been studied by several authors, especially for the encoding of an X-tree by 2n-3 lengths of paths between leaves (n being the cardinality of X). It is shown here that circular orders are the same as those obtained from the table of a tree metric by a construction due to Yushmanov (1984). More, this con...

Jac A.M. Vennix received his Ph.D. from Nijmegen University and is currently full professor of research methodology at the Faculty of Management Sciences of Nijmegen University. He has conducted a large number of projects in a variety of organizations in the areas of system dynamics group model-building and (interactive) scenario construction. He has published a number of articles and books on ...

The suffix array data structure that we present is due to Grossi and Vitter [1]. It uses a recursive construction that inflates the alphabet size, much like the the suffix array construction that we saw in Lecture 18. Building on this, we will construct a low-space suffix tree by augmenting this suffix array with an additional tree structure. This construction is due to Munro, Raman and Rao [2]...