Monitoring the occupancy of on-street parking spaces on a city-wide scale is still an open issue. Past research demonstrated the viability of parking crowd-sensing by means of the standard on-board sensors of probe vehicles, foreseeing the use of high-mileage vehicles, like taxis. Nevertheless, the achievable spatio-temporal sensing coverage has never been deeply investigated. In this paper, we investigate the suitability of taxi fleets of different sizes to crowd-sense on-street parking availability. We considered 579 road segments in San Francisco (USA), covered both by sensors of the SFpark project and by the GPS traces of 536 taxis. For each of these segments, we computed the taxi transit frequencies, representing the achievable coverage by vehicles equipped with sensors detecting empty parking spots. By combining these frequencies with parking occupancy data coming from SFpark, we estimated the potential quality of crowd-sensed on-street parking information for different fleet sizes. Moreover, we investigated the impact of different misdetection amounts, and Kalman filters to handle them. The results show that a total of 300 taxis can crowd-sense on-street parking availability with an error of up to $± 1$ stall in 86% of the cases. Moreover, the quality of the sensors is as important as the fleet size (300 taxis with 10,% probability of misreadings provide availability information comparable to 486 taxis with 16,% probability), while the use of Kalman filters did not lead to statistically significant improvements. In conclusion, the traffic management authorities should consider parking crowd-sensing via probe vehicles as a promising alternative to the expensive deployment of the static parking sensors.

Developers have a lot of freedom in writing comments as well as in choosing identifiers and method names. These are intentional in nature and provide a different relevance of information to understand what a software system implements, and in particular the role of each source file. In this paper we investigate the effectiveness of exploiting lexical information for software system clustering. In particular we explore the contribution of the combined use of six different dictionaries, corresponding to the six parts of the source code where programmers introduce lexical information, namely: class, attribute, method and parameter names, comments, and source code statements. Their relevance has been weighted by means of a probabilistic model, whose parameters have been estimated by the Expectation-Maximization algorithm. To group source files accordingly we used a hierarchical clustering algorithm. The investigation has been conducted on a dataset of 13 open source Java software systems.

Recent studies have reported that Support Vector Regression (SVR) has the potential as a technique for software development effort estimation. However, its prediction accuracy is heavily influenced by the setting of parameters that needs to be done when employing it. No general guidelines are available to select these parameters, whose choice also depends on the characteristics of the dataset being used. This motivated the work described in (Corazza et al. 2010), extended herein. In order to automatically select suitable SVR parameters we proposed an approach based on the use of the meta-heuristics Tabu Search (TS). We designed TS to search for the parameters of both the support vector algorithm and of the employed kernel function, namely RBF. We empirically assessed the effectiveness of the approach using different types of datasets (single and cross-company datasets, Web and not Web projects) from the PROMISE repository and from the Tukutuku database. A total of 21 datasets were employed to perform a 10-fold or a leave-one-out cross-validation, depending on the size of the dataset. Several benchmarks were taken into account to assess both the effectiveness of TS to set SVR parameters and the prediction accuracy of the proposed approach with respect to widely used effort estimation techniques. The use of TS allowed us to automatically obtain suitable parameters’ choices required to run SVR. Moreover, the combination of TS and SVR significantly outperformed all the other techniques. The proposed approach represents a suitable technique for software development effort estimation.