We outline the main elements of what we call polyscopic structuring of information and argue that information needs to be structured accordingly. The principles of polyscopy may both serve as guidelines for creating Topic Maps, and provide orientation for further development of Topic Maps standards and software.

vi CHAPTER 1. OVERVIEW 1

Topic Maps are means for representing sophisticated, conceptual indexes of any information collection for the purpose of semantic information integration. To properly fulfil this purpose, the generation of Topic Maps has to base on a solid theory. This paper proposes the Observation Principle as the theoretical fundament of a future scientific discipline Topic Maps Engineering. SemanticTalk gen...

In dieser Untersuchung werden die drei Lokalen Suchmaschinen Google Maps, Bing Maps und TOnline Maps in einem kombinierten Eye-Trackingund Usability-Test verglichen. Es zeigen sich sowohl Probleme bei der Benutzung einzelner Suchmaschinen als auch übergreifende Ergebnisse, die für die Gestaltung von kartenbasierten Suchmaschinen relevant sind. Wir geben Empfehlungen für die Gestaltung solcher S...

In this paper we investigate the Lipschitz equivalence of dust-like self-similar sets in Rd. One of the fundamental results by Falconer and Marsh [On the Lipschitz equivalence of Cantor sets, Mathematika, 39 (1992), 223– 233] establishes conditions for Lipschitz equivalence based on the algebraic properties of the contraction ratios of the self-similar sets. In this paper we extend the study by...

The mammalian tongue is believed to fall into a class of organs known as muscular hydrostats, organs for which muscle contraction both generates and provides the skeletal support for motion. We propose that the myoarchitecture of the tongue, consisting of intricate arrays of muscular fibers, forms the structural basis for hydrostatic deformation. Owing to the fact that maximal diffusion of the ...

Banach’s fixed point theorem for contraction maps has been widely used to analyze the convergence of iterative methods in non-convex problems. It is a common experience, however, that iterative maps fail to be globally contracting under the natural metric in their domain, making the applicability of Banach’s theorem limited. We explore how generally we can apply Banach’s fixed point theorem to ...

Let (X, d,m) be a proper, non-branching, metric measure space. We show existence and uniqueness of optimal transport maps for cost written as non-decreasing and strictly convex functions of the distance, provided (X, d,m) satisfies a new weak property concerning the behavior of m under the shrinking of sets to points, see Assumption 1. This in particular covers spaces satisfying the measure con...

We develop a categorical compositional distributional semantics for Lambek Calculus with Relevant Modality, which has limited version of the contraction and permutation rules. The part is monoidal biclosed category coalgebra modality as defined on Differential Categories. instantiate this to finite dimensional vector spaces linear maps via quantisation functors work three concrete interpretatio...

In this paper we study iterative procedures for stationary equilibria in games with large number of players. Most of learning algorithms for games with continuous action spaces are limited to strict contraction best reply maps in which the Banach-Picard iteration converges with geometrical convergence rate. When the best reply map is not a contraction, Ishikawa-based learning is proposed. The a...