When graph transformation is used for programming purposes, large graphs should be structured in order to be comprehensible. In this paper, we present an approach for the rule-based transformation of hierarchically structured hypergraphs. In these graphs, distinguished hyperedges contain graphs that can be hierarchical again. Our framework extends the well-known double-pushout approach from fla...

A totally ordered tree is a tree equipped with an additional total order on its nodes. It provides a formal model for data that comes with both a hierarchical and a sequential structure; one example for such data are natural language sentences, where a sequential structure is given by word order, and a hierarchical structure is given by grammatical relations between words. In this paper, we stu...

We propose a novel dependency-based reordering model for hierarchical SMT that predicts the translation order of two types of pairs of constituents of the source tree: head-dependent and dependent-dependent. Our model uses the dependency structure of the source sentence to capture the mediumand long-distance reorderings between these pairs of constituents. We describe our reordering model in de...

A hierarchical approach to the decomposition of graphs is introduced which is related to the notion of tree decomposition. On this basis a hierarchical automaton model for graphs is deened. We show that this automaton model is (relative to an appropriate class of graphs) equivalent to monadic second-order logic in expressive power, properly strengthening previous results on monadic second-order...

Hierarchical models of intelligence are highly informative and widely accepted. Application of these models to twin data, however, is sparse. This paper addresses the question of how a genetic hierarchical model fits the Wechsler Adult Intelligence Scale (WAIS) subtests and the Raven Standard Progressive test score, collected in 194 18-year-old Dutch twin pairs. We investigated whether first-or...

Hierarchical proof presentations are ubiquitous within logic and computer science, but have made little impact on mathematics in general. The reasons for this are not currently known, and need to be understood if mathematical knowledge management systems are to gain acceptance in the mathematical community. We report on some initial experiments with three users of a set of web-based hierarchica...

On the way to an efficient implementation of finite element algorithms related to the pand h-p-versions on sparse grids, we present a general concept for the construction of hierarchical bases of higher order suitable for sparse grid methods. For the solution of partial differential equations, this approach allows us to profit both from the efficiency of sparse grid discretizations and from the...

OBJECTIVES This study examined components in Rowe and Kahn's successful aging model to investigate their hierarchical order and led to a modification of the previous hierarchical order. METHODS To examine the hierarchical order of components, we constructed a structural equation model and verified those paths that have discrepancies in studies and/or potential inclusion or omission errors in ...

FASTER OPTIMAL AND SUBOPTIMAL HIERARCHICAL SEARCH by Michael Leighton University of New Hampshire, May, 2012 In problem domains for which an informed admissible heuristic function is not available, one attractive approach is hierarchical search. Hierarchical search uses search in an abstracted version of the problem to dynamically generate heuristic values. This thesis makes three contributions...

The visualization of hierarchical and nested spatial regions remains a challenge to cartographers. Despite progress in computer algorithms for visualizing general hierarchical data, mapping spatial hierarchical regions, especially with static, noninteractive means, still requires considerable manual efforts. This paper proposes a two-step algorithm that can automatically recommend perception-ba...