High performance miniaturised and cost effective passive components are needed to enable commercially viable novel system level architectures for third generation wireless communication systems. In recent years there has been increasing interest in utilising passive multi-layer IC technologies to integrate Digital and RF functionality in a 3D manner. Examples of such enabling technologies that ...

For finitely generated groups Γ and ultrahomogeneous countable relational structures M we study the space Rep(Γ,M) of all representations of Γ by automorphisms on M equipped with the topology it inherits seen as a closed subset of Aut(M)Γ. When Γ is the free group Fn on n generators this space is just Aut(M)n, but is in general significantly more complicated. We prove that when Γ is finitely ge...

Recently there has been an increasing interest in supporting bulk operations on multidimensional index structures. Bulk loading refers to the process of creating an initial index structure for a presumably very large data set. In this paper, we present a generic algorithm for bulk loading which is applicable to a broad class of index structures. Our approach differs completely from previous one...

In this note we give some natural examples of theories T in countable logics L such that the class GT of infinite-generic structures for T is not axiomatizable by a single sentence of LW1> w. The point of the examples is to provide a contrast to a certain phenomenon recently observed in model-theory, concerning the assignment to L-theories T of classes GT of L-structures. In many interesting ca...

It is a well known fact that every embedded symplectic surface Σ in a symplectic four-manifold (X4, ω) can be made J-holomorphic for some almost-complex structure J compatible with ω. In this paper we investigate when such a structure J can be chosen generically in the sense of Taubes. The main result is stated in Theorem 1.2. As an application of this result we give examples of smooth and non-...

We prove that each ∀1 free amalgamation class K over a finite relational language L admits a countable generic structure M isometrically embedding all countable structures in K relative to a fixed metric. We expand L by infinitely many binary predicates expressing distance, and prove that the resulting expansion of K has a model companion axiomatized by the first-order theory of M . The model c...

We have for several years been working on an approach to knowledge system building that argues for the existence of a close connection between the tasks which the knowledge system is intended to solve, the methods chosen for them and the vocabulary in which knowledge is to be modeled and represented. We trace the historical origins of the idea that we have called Generic Tasks, and outline thei...

Traditional Computer-Aided Teaching and Learning (CAT/CAL) environments in multimedia-based teleeducation do not empower knowledge consumers (trainees, students etc.) to practice content transfer and knowledge acquisition in a self-managed and context-sensitive way. Since such kind of transfer process has to involve both, teachers and learners, it requires the support of different perspectives ...

Let L be a finite relational language and α = (αR : R ∈ L) a tuple with 0 < αR ≤ 1 for each R ∈ L. Consider a dimension function δα(A) = |A| − ∑

Existing graph drawing systems imply the use of speciic algorithms for each kind of data structures. This paper provide a description of the Adocs program. The program is based on a generic description of the structures, and thus allows to draw structures of an innnite number of classes. It can be used in order to produce graphical output for Gaaa, an uniform random generator of combinatorial s...