The paper presents a framework, in which the main concepts of schema and data integration can be specified both semantically and syntactically in an abstract data-model independent way. We first define what are schema matching and integration semantically, in terms of sets of instances and mappings between them. We also define a schema matching and integration syntactically, and introduce a pro...

The concordance group of algebraically slice knots is the subgroup of the classical knot concordance group formed by algebraically slice knots. Results of Casson and Gordon and of Jiang showed that this group contains in infinitely generated free (abelian) subgroup. Here it is shown that the concordance group of algebraically slice knots also contain elements of finite order; in fact it contain...

We generalize the strong Hanani-Tutte theorem to clustered graphs with two disjoint clusters, and show that an extension of our result to flat clustered graphs with three disjoint clusters is not possible. We also give a new and short proof for a result by Di Battista and Frati about efficient c-planarity testing of an embedded flat clustered graph with small faces based on the matroid intersec...

Using coalgebraic methods, we extend Conway’s theory of games to possibly non-terminating, i.e. non-wellfounded games (hypergames). We take the view that a play which goes on forever is a draw, and hence rather than focussing on winning strategies, we focus on non-losing strategies. Hypergames are a fruitful metaphor for non-terminating processes, Conway’s sum being similar to shuffling. We dev...