Geometrical and functional criteria as a methodological approach to implement a new cycle path in an existing Urban Road Network: A Case study in Rome

Most road accidents occur in urban areas and notably at urban intersections, where cyclists and motorcyclists are the most vulnerable. In the last few years, cycling mobility has been growing; therefore, bike infrastructures should be designed to encourage this type of mobility and reduce motorized and/or private transport. The paper presents a study to implement a new cycle path in the existing cycle and road network in Rome, Italy. The geometric design of the new path complies with Italian standards regarding the technical characteristics of bicycle paths, while the Highway Capacity Manual has been considered for the traffic analysis. In particular, a before-after approach has been adopted to examine and compare the traffic flow at more complex and congested intersections where the cycle path will pass. Trams, buses, cars, bikes and pedestrians were the traffic components considered in each analysis. The software package PTV VISSIM 8 allowed the simulations of traffic flows at traffic-light intersections; an original linear process has been proposed to model dynamic intelligent traffic controls, which are not admitted by the software used. The traffic analysis allowed the identification of the best option for each of the five examined intersections. Particularly, the maximum queue length value and the total number of passed vehicles have been considered in order to optimize the transport planning process. The results of this study highlight the importance of providing engineered solutions when a cycle path is implemented in a complex road network, in order to avoid negative impacts on the citizens and maximize the expected advantages

Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web

In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we consider peer-to-peer inference systems in which the local theory of each peer is a set of propositional clauses defined upon a local vocabulary. An important characteristic of peer-to-peer inference systems is that the global theory (the union of all peer theories) is not known (as opposed to partition-based reasoning systems). The main contribution of this paper is to provide the first consequence finding algorithm in a peer-to-peer setting: DeCA. It is anytime and computes consequences gradually from the solicited peer to peers that are more and more distant. We exhibit a sufficient condition on the acquaintance graph of the peer-to-peer inference system for guaranteeing the completeness of this algorithm. Another important contribution is to apply this general distributed reasoning setting to the setting of the Semantic Web through the Somewhere semantic peer-to-peer data management system. The last contribution of this paper is to provide an experimental analysis of the scalability of the peer-to-peer infrastructure that we propose, on large networks of 1000 peers