Pedestrian Priority Zones in the Context of Urban Mobility and Valorization of Public Space

The second half of the XX century was marked by a great increase in the number of people living in cities. Urban agglomerations became poles of attraction for migration flows and these phenomena, coupled with growing car-ownership rates, resulted in the fact that modern transport systems are characterized by large number of users and traffic modes. The necessity to organize these complex systems and to provide space for different traffic modes changed the way cities look. Urban areas had to cope with traffic flows, and as a result nowadays typical street pattern consists of a road for motorized vehicles, a cycle lane (in some cases), pavement for pedestrians, parking and a range of crucial signage to facilitate navigation and make mobility more secure. However, this type of street organization may not be desirable in certain areas, more specifically, in the city centers. Downtown areas have always been places where economic, leisure, social and other types of facilities are concentrated, not surprisingly, they often attract large number of people and this frequently results in traffic jams, air and noise pollution, thus creating unpleasant environment. Besides, excessive traffic signage in central locations can harm the image and perception of a place, this relates in particular to historical centers with architectural heritage.

Safety classification using GIS in decision-making process to define priority road interventions

Given the current economic situation of the Portuguese municipalities, it is necessary to identify the priority investments in order to achieve a more efficient financial management. The classification of the road network of the municipality according to the occurrence of traffic accidents is fundamental to set priorities for road interventions. This paper presents a model for road network classification based on traffic accidents integrated in a geographic information system. Its practical application was developed through a case study in the municipality of Barcelos. An equation was defined to obtain a road safety index through the combination of the following indicators: severity, property damage only and accident costs. In addition to the road network classification, the application of the model allows to analyze the spatial coverage of accidents in order to determine the centrality and dispersion of the locations with the highest incidence of road accidents. This analysis can be further refined according to the nature of the accidents namely in collision, runoff and pedestrian crashes.

A cooperative appproach to queue allocation of indivisible objects

We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue. We assume that the agents collaborate in order to achieve an efficient outcome for society. We allow for side-payments and provide a method for obtaining stable outcomes.

Efficient priority rules

We study the assignment of indivisible objects with quotas (houses, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and renegotiation-proofness. Such a rule respects an acyclical priority structure and the allocations can be determined using the deferred acceptance algorithm.

Don't put patients at risk: make hand hygiene your priority

This poster is part of an extension of the cleanyourhands campaign, aimed at preventing the spread of healthcare associated infections (HCAIs) in community healthcare settings including primary care and dental services, residential and nursing homes (including independent sector homes), hospices and independent clinics/hospitals. It is designed to heighten awareness among staff in clinical/treatment areas of their power to help protect patients from avoidable infections by cleaning their hands. Due to licensing restrictions, this poster is not available for download. Limited numbers are available from local HSC Trusts (Belfast HSCT and South Eastern HSCT on 028 9056 5862; Southern HSCT on 028 3741 2887; Northern HSCT on 028 2563 5575; Western HSCT on 028 7186 5127).

The Healthier Communities Shared Priority Project: Learning from the pathfinder authorities

This report presents the findings of an evaluation of how the 12 pathfinder local authorities in the LGA/DH sponsored Shared Priority Project began engaging with new requirements to promote healthier communities and narrow health inequalities. The purpose of the report is to capture the learning from the pathfinder authorities' experience of this initial planning phase and share it more widely now that all local authorities have to focus on the shared priorities.

Prevention of Venous Thromboembolism: A Key Patient Safety Priority

Prevention of venous thromboembolism (VTE) is an important part of our strategy to improve patient safety.The Northern Ireland HSC Safety Forum established and facilitated a regional collaborative which developed a single VTE Risk Assessment Tool for N.Ireland.

Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance

We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.

Introducing systematic dispatcher-assisted cardiopulmonary resuscitation (telephone-CPR) in a non-Advanced Medical Priority Dispatch System (AMPDS): implementation process and costs.

OBJECTIVE: In order to improve the quality of our Emergency Medical Services (EMS), to raise bystander cardiopulmonary resuscitation rates and thereby meet what is becoming a universal standard in terms of quality of emergency services, we decided to implement systematic dispatcher-assisted or telephone-CPR (T-CPR) in our medical dispatch center, a non-Advanced Medical Priority Dispatch System. The aim of this article is to describe the implementation process, costs and results following the introduction of this new "quality" procedure. METHODS: This was a prospective study. Over an 8-week period, our EMS dispatchers were given new procedures to provide T-CPR. We then collected data on all non-traumatic cardiac arrests within our state (Vaud, Switzerland) for the following 12months. For each event, the dispatchers had to record in writing the reason they either ruled out cardiac arrest (CA) or did not propose T-CPR in the event they did suspect CA. All emergency call recordings were reviewed by the medical director of the EMS. The analysis of the recordings and the dispatchers' written explanations were then compared. RESULTS: During the 12-month study period, a total of 497 patients (both adults and children) were identified as having a non-traumatic cardiac arrest. Out of this total, 203 cases were excluded and 294 cases were eligible for T-CPR. Out of these eligible cases, dispatchers proposed T-CPR on 202 occasions (or 69% of eligible cases). They also erroneously proposed T-CPR on 17 occasions when a CA was wrongly identified (false positive). This represents 7.8% of all T-CPR. No costs were incurred to implement our study protocol and procedures. CONCLUSIONS: This study demonstrates it is possible, using a brief campaign of sensitization but without any specific training, to implement systematic dispatcher-assisted cardiopulmonary resuscitation in a non-Advanced Medical Priority Dispatch System such as our EMS that had no prior experience with systematic T-CPR. The results in terms of T-CPR delivery rate and false positive are similar to those found in previous studies. We found our results satisfying the given short time frame of this study. Our results demonstrate that it is possible to improve the quality of emergency services at moderate or even no additional costs and this should be of interest to all EMS that do not presently benefit from using T-CPR procedures. EMS that currently do not offer T-CPR should consider implementing this technique as soon as possible, and we expect our experience may provide answers to those planning to incorporate T-CPR in their daily practice.

Locating emergency services with different priorities: The priority queuing covering location problem

Previous covering models for emergency service consider all the calls to be of the sameimportance and impose the same waiting time constraints independently of the service's priority.This type of constraint is clearly inappropriate in many contexts. For example, in urban medicalemergency services, calls that involve danger to human life deserve higher priority over calls formore routine incidents. A realistic model in such a context should allow prioritizing the calls forservice.In this paper a covering model which considers different priority levels is formulated andsolved. The model heritages its formulation from previous research on Maximum CoverageModels and incorporates results from Queuing Theory, in particular Priority Queuing. Theadditional complexity incorporated in the model justifies the use of a heuristic procedure.

Probabilistic maximal covering location-allocation models with constrained waiting time or queue length for congested systems

When dealing with the design of service networks, such as healthand EMS services, banking or distributed ticket selling services, thelocation of service centers has a strong influence on the congestion ateach of them, and consequently, on the quality of service. In this paper,several models are presented to consider service congestion. The firstmodel addresses the issue of the location of the least number of single--servercenters such that all the population is served within a standard distance,and nobody stands in line for a time longer than a given time--limit, or withmore than a predetermined number of other clients. We then formulateseveral maximal coverage models, with one or more servers per service center.A new heuristic is developed to solve the models and tested in a 30--nodesnetwork.