Reinhold Kröger studierte Informatik an der Universität Bonn, wo er auch mit einer Arbeit über verteilte Betriebssysteme promovierte. Anschließend war er ca. 10 Jahre in der GMD als Wiss. Mitarbeiter und Projektleiter tätig. Seit 1993 ist er Professor für Betriebssysteme und Verteilte Systeme an der Fachhochschule Wiesbaden – University of Applied Sciences. Dort leitet er das Labor für Verteilt...

In this paper, we propose a new minimum total communication distance (TCD) algorithm and an optimal TCD algorithm for broadcast in a 2-dimension mesh. The former generates a minimum TCD from a given source node, and the latter guarantees a minimum TCD among all the possible source nodes. These algorithms can be generalized to a d-dimensional mesh or torus. TCD can potentially be used as a measu...

This paper describes the collaborative participation of Trinity College Dublin and Dublin City University in the Log Analysis for Digital Societies (LADS) task of LogCLEF 2009 track. An analysis of multilingual search logs was carried out with the objectives of investigating how users from different linguistic or cultural backgrounds behave in search, and how the discovery of patterns in user a...

(Nov/03 draft, forthcoming in " Pacific Philosophical Quarterly " , comments to [email protected]) abstract In this paper I argue that questions about the semantics of rigid designation are commonly and illicitly run together with distinct issues, such as questions about the metaphysics of essence and questions about the theoretical legitimacy of the possible-worlds framework. I discuss in depth t...

Descriptions of four proposals submitted to eRENA by three artists. These proposals form a basis for activities in eRENA years 2 and 3, especially in the “open” Work Package 7. In the proposals links with and aesthetic expressions of the themes in work packages 4, 5 and 6 have also been considered and promoted. The proposals strongly connect to the production themes of work package 4, the crowd...

The study of Hamiltonian graphs began with Dirac’s classic result in 1952. This was followed by that of Ore in 1960. In 1984 Fan generalized both these results with the following result: If G is a 2-connected graph of order n and max{d(u), d(v)}≥n/2 for each pair of vertices u and v with distance d(u, v)=2, then G is Hamiltonian. In 1991 Faudree–Gould–Jacobson–Lesnick proved that if G is a 2-co...