Two conflicting high-level goals govern the enforcement of security policies, abridged in the phrase ``high security at a low cost''. While these drivers seem irreconcilable, formal modelling languages and automated verification techniques can facilitate the task of finding the right balance. We propose a modelling language and a framework in which security checks can be relaxed or strengthened to save resources or increase protection, on the basis of trust relationships among communicating parties.

The amount of traffic data collected by automatic number plate reading systems constantly incrseases. It is therefore important, for law enforcement agencies, to find convenient techniques and tools to analyze such data. In this paper we propose a scalable and fully automated procedure leveraging the Apache Accumulo technology that allows an effective importing and processing of traffic data. We discuss preliminary results obtained by using our application for the analysis of a dataset containing real traffic data provided by the Italian National Police.

The anonymous marketplaces ecosystem represents a new channel for black market/goods and services, offering a huge variety of illegal items.

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.

In transportation networks with limited capacities and travel times on the arcs, a class of problems attracting a growing scientific interest is represented by the optimal routing and scheduling of given amounts of flow to be transshipped from the origin points to the specific destinations in minimum time. Such problems are of particular concern to emergency transportation where evacuation plans seek to minimize the time evacuees need to clear the affected area and reach the safe zones.

This paper considers a hub location problem where several carriers operate on a shared network to satisfy a given demand represented by a set of commodities. Possible cooperative strategies are studied where carriers can share resources or swap their respective commodities to produce tangible cost savings while fully satisfying the existing demand. Three different collaborative policies are introduced and discussed, and mixed integer programming formulations are provided for each of them.

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.

In this paper we describe how to swap two 2 × 2 blocks in a real Schur form and a generalized real Schur form. We pay special attention to the numerical stability of the method. We also illustrate the stability of our approach by a series of numerical tests.