In the near future, users will have access to a vast number of digital libraries. For a given information need and limited resources, there is the problem of selecting those libraries which produce an overall optimum answer. This resource discovery problem is additionally complicated by the diversity of the sources, e.g. with respect to media, document formats, indexing methods, database schemas and protocols. Once a set of digital libraries has been selected, the collection fusion problem deals with the problem of merging the answers of these libraries in order to get a high retrieval quality. This paper describes the specific problems and gives an overview on the solutions that have been developed so far.

The automatic categorisation of web documents is becoming crucial for organising the huge amount of information available in the Internet. We are facing a new challenge due to the fact that web documents have a rich structure and are highly heterogeneous. Two ways to respond to this challenge are (1) to use a representation of the content of web documents that captures these two characteristics and (2) to use more effective classifiers. Our categorisation approach is based on a probabilistic description-oriented representation of web documents, and a probabilistic interpretation of the k-nearest neighbour classifier. With the former, we provide an enhanced document representation that incorporates the structural and heterogeneous nature of web documents. With the latter, we provide a theoretical sound justification for the various parameters of k-nearest neighbour classifier. Experimental results show that (1) using an enhanced representation of web documents is crucial for an effective categorisation of web documents, and (2) a theoretical interpretation of the k-nearest neighbour classifier gives us improvement over the standard k-nearest neighbour classifier.

Die Zahl digitaler Bibliotheken im WWW wächst. Literaturrecherchen lassen sich immer öfter ohne den Gang in die reale Bibliothek durchführen. Wir beschreiben den Entwurf eines Agentensystems, welches dem Benutzer / der Benutzerin Funktionalität zur Literaturrecherche auf einer höheren Ebene anbietet, als sie von einzelnen digitalen Bibliotheken erbracht werden kann. Dazu wird die von digitalen Bibliotheken angebotene Funktionalität ausgenutzt und kombiniert; die Basiseigenschaften von Agenten, Adaptivität, Kommunikationsfähigkeit und Autonomie, ermöglichen das auf flexible Weise

Despite the fact that many Digital Libraries (DLs) are available on the Internet, users cannot effectively use them because of inadequate functionality, deficient visualisation and insufficient integration of different DLs. In the framework of this project we develop a user-oriented access system for DLs which overcomes these drawbacks. Based on experiences from the librarian area, higher functions to assist proved search strategies will be implemented. Different DLs will be tightly integrated, so that system-wide search and navigation is possible. The system will be adaptive towards different user wishes, regarding preferences concerning content and system involvement.

This thesis will give an overview about the connection of physics and economy in special view of human behavior in traffic scenarios. Main topic is the human decision making process in a two-route-choice scenario. In three main Experiments, human players had to decide between two routes which connect two cities. The first experiment is defined by a pure Nash-equilibrium and 18 participants, the second experiment is similar, but alternating construction sites on both routes were added. Experiment 1 and 2 are played over 200 periods. The third experiment is a minority game with mixed equilibria and 9 participants. Experiment 3 was played over 100 periods. Furthermore the first experiment was extended to a larger group of players up to 90 persons. For every experiment two treatments with 6 observations were played. The treatments differ in the given information to the participants before they choose between the two routes. In the first treatment the information about the own travel time was given, additionally in the second treatment the information about travel times on both routes were given. The second part of the thesis describes the statistical data and illustrates the results. Two main results are that the equilibrium was not stable in the experiments, the fluctuations persists to the end of every observation. Further on two player types were found and explained in this chapter. In the third part of this thesis an extended payoff-sum model is described and explained. Simulations using this reinforcement learning model were run and show the reproducibility of the empirical data. In the conclusions the main results are shown and discussed.

Today, peer-to-peer services can comprise a large and growing number of services, e.g. search services or services dealing with heterogeneous schemas in the context of Digital Libraries. For a given task, the system has to determine suitable services and their processing order (execution plan). As peers can join or leave the network spontaneously, static execution plans are not sufficient. This paper proposes a logic-based approach for dynamically computing execution plans: Services are described in the DAML-S language. These descriptions are mapped onto Datalog. Finally, logical rules are applied on the service description facts for determining matching services and finding an optimum execution plan.

Proceedings of the Second INEX Workshop, Dagstuhl, Germany, December 15-17, 2003. International Conference and Research Center for Computer Science

<H4>In:</H4>Intelligent Search on XML Data : Applications, Languages, Models, Implementations, and Benchmarks / Henk Blanken ... [et al.] (eds.)- Berlin : Springer, 2003. - ISBN 3-540-40768-5, S. 59-75

<H4>In:</H4>SIGIR 2003 : proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, July 28 to August 1, 2003, Toronto, Canada / edited by Jamie Callan ... - New York, 2003

None