Abstract
Twenty-four experts from 13 different countries were asked to evaluate photographs taken of 60 women following conservative breast cancer treatment. The esthetic result of each case was classified as poor, fair, good or excellent. Agreement was evaluated using the kappa (k) and weighted kappa (wk) statistics, for all observers, mate and female participants, those younger and older than 50 years, those seeing more than 250 cases a year, and those with previous publications in this area. Consensus was obtained by way of a modified Delphi approach, when more than 50% of participants provided the same classification. In a second round, consensual cases were disclosed and a revised opinion was asked in non-consensual ones. Agreement between all participants was fair (k = 0.24, wk = 0.37) and remained within the same range (k = 0.20-0.31, wk = 0.31-0.45) in the subgroups analyzed. First round consensus was obtained in 46 out of 60 cases (77%) and in the second round in 59 out of 60 cases (98%). Evaluation of the esthetic results of conservative treatment for breast cancer is only fairly reproducible when performed by experts working in different geographical areas. Consensus is obtainable if a relatively low threshold of agreement is considered acceptable.

Abstract
In this paper, we recover a graph interpretation of the mutual partition distance, proposed recently by Cardoso and Corte-Real. We deduce some properties of this measure, and establish a correspondence with the partition distance introduced by Almudevar and Field and Gusfield, and independently by Guigues. We also present some different formulations for the computation of the mutual partition distance. Finally, a comparison is made with similar measures.

Abstract
Enterprises need to automate manual and routine aspects of IT infrastructure management. In this paper a new concept that integrates different autonomous and management level applications through Instant Messaging protocol (XMPP) is introduced. This is achieved by means of a common management information model implemented in LDAP. A content language implemented in XML is also described, allowing autonomous application integration to carry out management tasks dynamically.

Abstract
There is a growing trend towards convergence of telecommunication and data networks in order to support a richer set of services and applications. At the same time, increasing diversity and density of network access technologies has made the goal of providing connectivity anytime and anywhere a real possibility. Another important development is the emergence of small, low-complexity user owned networks, such as Personal Area Networks and Body Area Networks. Dynamic interworking, also known as network composition, between networks of different types and sizes is essential in the push towards convergence, as well as to realize truly seamless connectivity between heterogeneous access networks. Dynamic interworking requires signalling between different elements of the control planes of the different networks in order to coordinate the control functions and resources of the networks concerned. In this paper, we present the Generic Ambient Network Signalling protocol suite to address the diverse signalling requirements for dynamic interworking of networks.

Abstract
The convergence of mobile domain and data networks has been under focus in the standardization forums. However, dynamic interworking of wired infrastructure, wireless access systems and small scale Personal Area Networks has been challenging due to their heterogeneous nature. One of the most important problems to be solved is name resolution between different terminals and networks. This paper presents a new mechanism for name resolution, which relies on existing naming mechanisms. In particular the focus is on the scalability of the solution from signaling load and latency point of view.

Abstract
Consider the problem of scheduling sporadic message transmission requests with deadlines. For wired channels, this has been achieved successfully using the CAN bus. For wireless channels, researchers have recently proposed a similar solution; a collision-free medium access control (AMC) protocol that implements static-priority scheduling. Unfortunately no implementation has been reported, yet. We implement and evaluate it to find that the implementation indeed is collision-free and prioritized. This allows us to develop schedulability analysis for, the implementation. We measure the response times of messages in our implementation and find that our new response-time analysis indeed offers an upper bound on the response times. This enables a new class of wireless real-time systems with timeliness guarantees for sporadic messages and it opens-up a new research area: schedulability analysis for wireless networks.