In a morphological ontology the expert's knowledge is represented in terms, which describe morphological structures and how these structures relate to each other. With the assistance of ontologies this expert knowledge is made processable by machines, through a formal and standardized representation of terms and their relations to each other. The red flour beetle Tribolium castaneum, a represen...

Let X be a hyperkähler manifold. Trianalytic subvarieties of X are subvarieties which are complex analytic with respect to all complex structures induced by the hyperkähler structure. Given a K3 surface M , the Hilbert scheme classifying zero-dimensional subschemes of M admits a hy-perkähler structure. We show that for M generic, there are no trianalytic subvarieties of the Hilbert scheme. This...

Adaptive Mesh Refinement (AMR) grids are particularily efficient to mitigate the tension between numerical accuracy and computational cost. The Visualization Toolkit (VTK) offers data structures and algorithms to treat 2D and 3D AMR meshes, either “patch-based” or as binary trees. This paper summarizes our extension of the former capability to the case of generic subdivision and arbitrary recti...

We present a generic topology library that is based on topological space and combinatorial properties. A notation is introduced whereby data structures can be described by their topological cell dimensions and internal combinatorial properties. A common interface for different types of data structures is presented. Various issues of iteration of these data structures can be explained from the t...

Java programs often use pointer structures for normal computations. A verification system for Java should have good proof support for reasoning about those structures. However, the literature for pointer verification almost always uses specifications and definitions that are tailored to the problem under consideration. We propose a generic specification for Java pointer structures that allows t...

We present an Isabelle/HOL library with a generic type class implementation of separation algebra, develop basic separation logic concepts on top of it, and implement generic automated tactic support that can be used directly for any instantiation of the library. We show that the library is usable by multiple example instantiations that include common as well as more exotic base structures such...

We realise the algebra $\mathcal W$, Z_0$ and algebras Z_0\otimes A$, where $A$ is a unital separable UHF algebra, as Fraïssé limits of suitable classes structures. In doing so, we show that such are generic

Local event structures and local traces are generalizations of the classical prime event structures and Mazurkiewicz’ traces in which independence is no longer a global binary property. We consider the problem of lifting the categorical connection between prime event structures and Mazurkiewicz’ traces to this more general setting. Using a generic approach it is shown how certain subcategories ...

‎‎In the category of Mordell curves (E_D:y^2=x^3+D) with nontrivial torsion groups we find curves of the generic rank two as quadratic twists of (E_1), ‎and of the generic rank at least two and at least three as cubic twists of (E_1). ‎Previous work‎, ‎in the category of Mordell curves with trivial torsion groups‎, ‎has found infinitely many elliptic curves with ...

Topological data structures are useful in many areas, including the various mesh data structures used in finite element applications. Based on the graph-theoretic foundation for these data structures, we begin with a generic modifiable graph data structure and apply successive optimizations leading to a family of mesh data structures. The results are compact array-based mesh structures that can...