This paper proposes a map matching algorithm using Bayesian belief network for GPS traces to generate the spatial-temporal information of individuals. The algorithm incorporates the road network topology, distance from trace nodes to road segments, the angle between two lines, direction difference, accuracy of measured GPS log point, and position of roads. The GPS data collected in the Eindhove...

In multi-agent routing, agents must find the shortest-time path from source to destination while avoiding deadlocks and collisions with other agents. This paper describes an approach that reserves segments of road for particular time intervals, such that no two agents will occupy the same space at the same time. This paper takes away concerns about the complexity and robustness of the reservati...

OBJECTIVE To predict the burden caused by fatal road traffic injuries from 2015 to 2030. METHODS We searched the websites of United Nations Population Division,United States Department of Agriculture, World Health Organization, China Energy Research Foundation and other agencies to obtain the predictive values of gross domestic product (GDP) per capita, urbanization, motorization and educatio...

Recently, there has been a growing demand and interest in developing methods for analyzing smartphone logs to extract traffic safety information. Because the log is high time resolution and closely related to user activities but fragmentary and myopic, it is difficult for currently available collision probability based quantitative risk assessment methods to create traffic safety maps automatic...

Fine grained 1Hz Carbon Monoxide pollution data were collected on a busy road in Hyderabad, India. In this paper we report the findings from analysing the experimental data, in which it was found that the data were log-normally distributed and nonlinear. The dominant frequencies at peak hours were caused by the pattern of traffic flow.

The Road Coloring Conjecture is an old and classical conjecture posed in Adler and Weiss (1970); Adler et al. (1977). Let G be a strongly connected digraph with uniform out-degree 2. The Road Coloring Conjecture states that, under a natural (necessary) condition that G is “aperiodic”, the edges of G can be colored red and blue such that “universal driving directions” can be given for each verte...

Maintaining the quality of roadways is a major challenge for governments around the world. In particular, poor road surfaces pose a significant safety threat to motorists, especially when motorbikes make up a significant portion of roadway traffic. According to the statistics of the Ministry of Justice in Taiwan, there were 220 claims for state compensation caused by road quality problems betwe...

Deadwood is one of the main structural features forest ecosystems and plays an important role in nutrient cycle, maintaining production environmental heterogeneity, acts as indicator for assessing biodiversity ecosystems. This research was conducted with aim evaluating quantitative qualitative characteristics deadwood according to influence accessibility indicators a comparison between natural ...

We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separators for planar graphs, discovered by Lipton and Tarjan [2], in order to divide the graph into smaller subgraphs. For a planar graph with n nodes, the algorithmic variant considered uses O(n(log n)/ ) preprocessing ti...