Parties of reputation systems rate each other and use ratings to compute reputation scores that drive their interactions. When deciding which reputation model to deploy in a network environment, it is important to find the most suitable model and to determine its right initial configuration. This calls for an engineering approach for describing, implementing and evaluating reputation systems while taking into account specific aspects of both the reputation systems and the networked environment where they will run.

Reputation systems are nowadays widely used to support decision making in networked systems. Parties in such systems rate each other and use shared ratings to compute reputation scores that drive their interactions. The existence of reputation systems with remarkable differences calls for formal approaches to their analysis. We present a verification methodology for reputation systems that is based on the use of the coordination language Klaim and related analysis tools.

The popularity of the cloud computing paradigm is opening new opportunities for collaborative computing. In this paper we tackle a fundamental problem in open-ended cloud-based distributed computing platforms, i.e., the quest for potential collaborators. We assume that cloud participants are willing to share their computational resources for shared distributed computing problems, but they are not willing to disclose the details of their resources. Lacking such information, we advocate to rely on reputation scores obtained by evaluating the interactions among participants.

Social Web Services (SWSs) constitute a novel paradigm of service-oriented computing, where Web services, just like humans, sign up in social networks that guarantee, e.g., better service discovery for users and faster replacement in case of service failures. In past work, composition of SWSs was mainly supported by specialised social networks of competitor services and cooperating ones. In this work, we continue this line of research, by proposing a novel SWSs composition procedure driven by the SWSs reputation.

The purpose of this article is to present a methodology to identify the sources of activity in brain networks from functional magnetic resonance imaging (fMRI) data using the multiset canonical correlation analysis algorithm. The aim is to lay the foundations for a screening marker to be used as indicator of mental diseases. Group analysis blind source separation methods have proved reliable to extract the latent sources underlying the brain activities but currently there is no recognized biomarker for mental disorders.

In document image analysis the task of segmenting images of ancient printed documents in distinct elements is known to be a very complex problem. In general, these documents are of low quality and can present skew and degradations because of old printing or ink stains. To face these problems we will show and discuss the validity of the Mumford and Shah variational method, based on the ? convergence theory, along with its numerical handling.