Traffic Data: Exploratory Data Analysis with Apache Accumulo

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.

Optimizing emergency transportation through multicommodity quickest paths

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.

Analysing the Tor Web with High Performance Graph Algorithms

The exploration and analysis of Web graphs has flourished in the recent past, producing a large number of relevant and interesting research results. However, the unique characteristics of the Tor network demand for specific algorithms to explore and analyze it. Tor is an anonymity network that allows offering and accessing various Internet resources while guaranteeing a high degree of provider and user anonymity. So far the attention of the research community has focused on assessing the security of the Tor infrastructure.

On Carriers Collaboration in Hub Location Problems

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.

Design, Implementation and Test of a Flexible Tor-oriented Web Mining Toolkit

Searching and retrieving information from the Web is a primary activity needed to monitor the development and usage of Web resources. Possible benefits include improving user experience (e.g. by optimizing query results) and enforcing data/user security (e.g. by identifying harmful websites). Motivated by the lack of ready-to-use solutions, in this paper we present a flexible and accessible toolkit for structure and content mining, able to crawl, download, extract and index resources from the Web.

A Branch and Price Algorithm to solve the Quickest Multicommodity k-Splittable Flow Problem

In the literature on Network Optimization, k-splittable flows were introduced to enhance modeling accuracy in cases where an upper bound on the number of supporting paths for each commodity needs to be imposed, thus extending the suitability of network flow tools for an increased number of practical applications. Such modeling feature has recently been extended to dynamic flows with the introduction of the novel strongly NP-hard Quickest Multicommodity k-splittable Flow Problem (QMCkFP).

A HYBRID MODEL OF COLLECTIVE MOTION OF DISCRETE PARTICLES UNDER ALIGNMENT AND CONTINUUM CHEMOTAXIS

In this paper we propose and study a hybrid discrete-continuous mathematical model of collective motion under alignment and chemotaxis effect. Starting from paper [23], in which the Cucker-Smale model [22] was coupled with other cell mechanisms, to describe the cell migration and self-organization in the zebrafish lateral line primordium, we introduce a simplified model in which the coupling between an alignment and chemotaxis mechanism acts on a system of interacting particles.