The accurate prediction of ambulance demand provides great value to emergency service providers and people living within a city. It supports the rational and dynamic allocation of ambulances and hospital staffing, and ensures patients have timely access to such resources. However, this task has been challenging due to complex multi-nature dependencies and nonlinear dynamics within ambulance demand, such as spatial characteristics involving the region of the city at which the demand is estimated, short and long-term historical demands, as well as the demographics of a region. Machine learning techniques are thus useful to quantify these characteristics of ambulance demand. However, there is generally a lack of studies that use machine learning tools for a comprehensive modeling of the important demand dependencies to predict ambulance demands. In this paper, an original and novel approach that leverages machine learning tools and extraction of features based on the multi-nature insights of ambulance demands is proposed. We experimentally evaluate the performance of next-day demand prediction across several state-of-the-art machine learning techniques and ambulance demand prediction methods, using real-world ambulatory and demographical datasets obtained from Singapore. We also provide an analysis of this ambulatory dataset and demonstrate the accuracy in modeling dependencies of different natures using various machine learning techniques.
16 March 2018 in Transportmetrica B: Transport Dynamics
Accessibility and its equality are key factors for land-use and transport planning in city developments. In this paper, we propose a graph-based Public Transit Connectivity (PTC) index to measure the accessibility of individual buildings focusing on transportation factors. A large-scale graph is created to connect all buildings in the city through multi-modal public transit services. The PTC index of each building is calculated based on the door-to-door travel distance/time from the building to all others using a parallel graph closeness centrality algorithm. In addition, the PTC index is verified from an economic perspective, as it is highly correlative to house resale price and thus enable accurate price prediction using machine learning models. Consequently, the PTC index and its equality are used to evaluate the influence of existing and future Mass Rapid Transit (MRT) services in Singapore as a case study. As experimental results show, MRT services significantly enhance PTC indices of individual buildings. However, they could not improve PTC equality in city scale due to their conflicting effects, i.e. (1) shrinking the difference between central and peripheral regions and (2) enlarging the difference among buildings with different distances to the nearest MRT stations.
In a distributed virtual environment (DVE), participants located in different places may observe inconsistent views of the simulated virtual world due to message delay and loss in the network. This paper investigates how to compensate for the impact of message delay and loss on consistency in the DVE. We focus on dead reckoning (DR)-based update mechanisms and measure inconsistency by the time–space inconsistency (TSI) metric. We theoretically analyze the TSI of an entity and derive the condition under which the impact of message delay and loss on consistency can be fully compensated for by reducing the DR threshold. Based on the analysis, a compensatory update scheduling algorithm is proposed. Experiments using real traces of a racing car game are conducted to evaluate the compensatory algorithm. The results confirm that if the condition derived in our theoretical analysis is fulfilled, the compensatory algorithm can decrease the TSI of a racing car to the level of the case without message delay and loss when there is sufficient network bandwidth available. Under severe bandwidth constraints, the compensatory algorithm still leads to comparable TSIs of the racing car among the participants regardless of their network conditions so as to enable fair competition.
Formal analyses of blockchain protocols have received much attention recently. Consistency results of Nakamoto's blockchain protocol are often expressed in a quantity $c$, which denotes the expected number of network delays before some block is mined. With $\mu$ (resp., $\nu$) denoting the fraction of computational power controlled by benign miners (resp., the adversary), where $\mu + \nu = 1$, we prove for the first time that to ensure the consistency property of Nakamoto's blockchain protocol in an asynchronous network, it suffices to have $c$ to be just slightly greater than $\frac{2\mu}{\ln (\mu/\nu)}$. Such a result is both neater and stronger than existing ones. In the proof, we formulate novel Markov chains which characterize the numbers of mined blocks in different rounds.