Title : Massively Scalable Web Service Discovery

Presenter George Anadiotis
Abstract The increasing popularity of Web-Services has exemplified the need for scalable and robust discovery mechanisms. Although decentralized solutions for discovering Web-Services promise to fulfill these requirements, most solutions make quite limiting assumptions concerning the number of nodes, the topology of the network and a-priori information on the data(e.g. categorizations or popularity distributions). In addition, most solutions are tested via simulations using artificial datasets. In this paper we present a lightweight, scalable and robust WSDL discovery mechanism based on real-time calculation of term popularity. Results based on a large-scale emulation on the DAS-3 distributed supercomputer, using real data from Seekda.com show that we can achieve web-scale service discovery based on simple keyword search.

Title : Aiding Human Reliance Decision Making Using Computational Models of Trust

Presenter Peter-Paul van Maanen
Abstract This paper involves a human-agent system in which there is an operator charged with a pattern recognition task, using an automated decision aid. The objective is to make this human-agent system operate as effectively as possible. Effectiveness is gained by an increase of appropriate reliance on the operator and the aid. We studied whether it is possible to contribute to this objective by, apart from the operator, letting the aid as well calibrate trust in order to make reliance decisions. In addition, the aid's calibration of trust in reliance decision making capabilities of both the operator and itself is also expected to contribute, through reliance decision making on a metalevel, which we call metareliance decision making. In this paper we present a formalization of these two approaches: a reliance (RDMM) and metareliance decision making model (MetaRDMM), respectively. A combination of laboratory and simulation experiments shows significant improvements compared to reliance decision making solely done by operators.