Cross-concordances: terminology mapping and its effectiveness for information retrieval

The German Federal Ministry for Education and Research funded a major terminology mapping initiative, which found its conclusion in 2007. The task of this terminology mapping initiative was to organize, create and manage 'cross-concordances' between controlled vocabularies (thesauri, classification systems, subject heading lists) centred around the social sciences but quickly extending to other subject areas. 64 crosswalks with more than 500,000 relations were established. In the final phase of the project, a major evaluation effort to test and measure the effectiveness of the vocabulary mappings in an information system environment was conducted. The paper reports on the cross-concordance work and evaluation results.Comment: 19 pages, 4 figures, 11 tables, IFLA conference 200

Building a terminology network for search: the KoMoHe project

The paper reports about results on the GESIS-IZ project "Competence Center Modeling and Treatment of Semantic Heterogeneity" (KoMoHe). KoMoHe supervised a terminology mapping effort, in which 'cross-concordances' between major controlled vocabularies were organized, created and managed. In this paper we describe the establishment and implementation of cross-concordances for search in a digital library (DL).Comment: 5 pages, 2 figure, Dublin Core Conference 200

A least-squares implicit RBF-FD closest point method and applications to PDEs on moving surfaces

The closest point method (Ruuth and Merriman, J. Comput. Phys. 227(3):1943-1961, [2008]) is an embedding method developed to solve a variety of partial differential equations (PDEs) on smooth surfaces, using a closest point representation of the surface and standard Cartesian grid methods in the embedding space. Recently, a closest point method with explicit time-stepping was proposed that uses finite differences derived from radial basis functions (RBF-FD). Here, we propose a least-squares implicit formulation of the closest point method to impose the constant-along-normal extension of the solution on the surface into the embedding space. Our proposed method is particularly flexible with respect to the choice of the computational grid in the embedding space. In particular, we may compute over a computational tube that contains problematic nodes. This fact enables us to combine the proposed method with the grid based particle method (Leung and Zhao, J. Comput. Phys. 228(8):2993-3024, [2009]) to obtain a numerical method for approximating PDEs on moving surfaces. We present a number of examples to illustrate the numerical convergence properties of our proposed method. Experiments for advection-diffusion equations and Cahn-Hilliard equations that are strongly coupled to the velocity of the surface are also presented