Comparison between common traffic lights and three types of traffic lights with visual cycle a safety and capacity analysis

The objective of this paper is compare the common traffic lights (CTL) to three different types of traffic lights with countdown displays (SCD) and assess their effects on road safety and capacity. This comparison is required because the results found in the literature are divergent among countries and cities, and one of the SCD analyzed in our study is different from the SCD used worldwide. An observational before-after study was conducted to evaluate the safety and capacity in a period of one year before and one year after the implementation of the SCD in three Brazilian cities. The results indicate that the SCD models 1 and 3 had around 35%±14% reduction in the total number of accidents; the model 2, does not have significant reduction. In order to perform the capacity analysis a framework for data collection and an adaptation for estimation of initial lost time in each phase were developed. Considering the capacity analysis there was a reduction around 11% in the lost time in SCD model 1, 7% in SCD model 2 and 3% in SCD model 3. However the implications of this on capacity are trifle due to a small increase in the average headways for all SCD models compare to CTL.

Splenic congestion associated with acepromazine administration in dogs

The effects splenic dilatation induced by acepromazine in a prospective, randomized study. Thirtythree adult mongrel dogs were divided into two groups designated as AG (acepromazine 0.05 mg/kg, i.v., n = 23) and CG (0.9% sodium chloride administered at a similar volume, n = 10). In both groups underwent sonographic examinations before (T0) and fifteen minutes (T15) after drug injection. The thickness spleen and splenic vein width were measured. Higher thickness was found in the AG group at T15 (2.47 cm) when compared to that at T0 (2.06 cm, p = 0.016), while the T0 (2.33 cm) and T15 (2.39 cm) measures did not differ within the CG group. Moreover, the splenic vein width was higher (p = 0.013) at T15 than at T0 in the AG group. Based on results of this study, we concluded that acepromazine, in doses of 0.05 mg/kg, promotes splenomegaly in dogs after fifteen minutes of the injection.

Dynamic Traffic Grooming Algorithms for Reconfigurable SONET Over WDM Networks

The emergence of wavelength-division multiplexing (WDM) technology provides the capability for increasing the bandwidth of synchronous optical network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add–drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom the traffic, and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently. Moreover, the traffic pattern of the optical network changes from time to time. How to develop dynamic reconfiguration algorithms for traffic grooming is an important issue. In this paper, two cases (best fit and full fit) for handling reconfigurable SONET over WDM networks are proposed. For each approach, an integer linear programming model and heuristic algorithms (TS-1 and TS-2, based on the tabu search method) are given. The results demonstrate that the TS-1 algorithm can yield better solutions but has a greater running time than the greedy algorithm for the best fit case. For the full fit case, the tabu search heuristic yields competitive results compared with an earlier simulated annealing based method and it is more stable for the dynamic case.

Survivable Traffic Grooming With Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risklink- group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA), and tabu-search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model, respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu-search (TS) method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Centralized vs. Distributed Connection Management Schemes under Different Traffic Patterns in Wavelength-Convertible Optical Networks

Centralized and Distributed methods are two connection management schemes in wavelength convertible optical networks. In the earlier work, the centralized scheme is said to have lower network blocking probability than the distributed one. Hence, much of the previous work in connection management has focused on the comparison of different algorithms in only distributed scheme or in only centralized scheme. However, we believe that the network blocking probability of these two connection management schemes depends, to a great extent, on the network traffic patterns and reservation times. Our simulation results reveal that the performance improvement (in terms of blocking probability) of centralized method over distributed method is inversely proportional to the ratio of average connection interarrival time to reservation time. After that ratio increases beyond a threshold, those two connection management schemes yield almost the same blocking probability under the same network load. In this paper, we review the working procedure of distributed and centralized schemes, discuss the tradeoff between them, compare these two methods under different network traffic patterns via simulation and give our conclusion based on the simulation data.

Providing Reliable Data Transport for Dynamic Event Sensing in Wireless Sensor Networks

In this paper, we propose a Loss Tolerant Reliable (LTR) data transport mechanism for dynamic Event Sensing (LTRES) in WSNs. In LTRES, a reliable event sensing requirement at the transport layer is dynamically determined by the sink. A distributed source rate adaptation mechanism is designed, incorporating a loss rate based lightweight congestion control mechanism, to regulate the data traffic injected into the network so that the reliability requirement can be satisfied. An equation based fair rate control algorithm is used to improve the fairness among the LTRES flows sharing the congestion path. The performance evaluations show that LTRES can provide LTR data transport service for multiple events with short convergence time, low lost rate and high overall bandwidth utilization.

Survivable Traffic Grooming with Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength division multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated protection and shared protection schemes are considered. Given the network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. We first resort to the integer linear programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA) and tabu search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu search method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Rerouting Schemes for Dynamic Traffic Grooming in Optical WDM Mesh Networks

Traffic grooming in optical WDM mesh networks is a two-layer routing problem to effectively pack low-rate connections onto high-rate lightpaths, which, in turn, are established on wavelength links. In this work, we employ the rerouting approach to improve the network throughput under the dynamic traffic model. We propose two rerouting schemes, rerouting at lightpath level (RRAL) and rerouting at connection level (RRAC). A qualitative comparison is made between RRAL and RRAC. We also propose the critical-wavelength-avoiding one-lightpath-limited (CWA-1L) and critical-lightpath-avoiding one-connection-limited (CLA-1C) rerouting heuristics, which are based on the two rerouting schemes respectively. Simulation results show that rerouting reduces the connection blocking probability significantly.

Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks

The emergence of Wavelength Division Multiplexing (WDM) technology provides the capability for increasing the bandwidth of Synchronous Optical Network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add-drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom in the traffic and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently.

Performance Analysis of Sparse Traffic Grooming in WDM Mesh Networks

Sparse traffic grooming is a practical problem to be addressed in heterogeneous multi-vendor optical WDM networks where only some of the optical cross-connects (OXCs) have grooming capabilities. Such a network is called as a sparse grooming network. The sparse grooming problem under dynamic traffic in optical WDM mesh networks is a relatively unexplored problem. In this work, we propose the maximize-lightpath-sharing multi-hop (MLS-MH) grooming algorithm to support dynamic traffic grooming in sparse grooming networks. We also present an analytical model to evaluate the blocking performance of the MLS-MH algorithm. Simulation results show that MLSMH outperforms an existing grooming algorithm, the shortest path single-hop (SPSH) algorithm. The numerical results from analysis show that it matches closely with the simulation. The effect of the number of grooming nodes in the network on the blocking performance is also analyzed.

The association between low alcohol use and traffic risk behaviors among Brazilian college students

Although there are a large number of studies focused on binge drinking and traffic risk behaviors (TRB), little is known regarding low levels of alcohol consumption and its association to TRB. The aim of this cross-sectional study is to examine the association of low to moderate alcohol intake pattern and TRB in college students in Brazil. 7037 students from a National representative sample were selected under rigorous inclusion criteria. All study participants voluntarily fulfilled a structured, anonymous, and self-questionnaire regarding alcohol and drug use, social-demographic data, and TRB. Alcohol was assessed according to the average number of alcoholic units consumed on standard occasions over the past 12 months. The associations between alcohol intake and TRB were summarized with odds ratio and their confidence interval obtained from logistic regression. Compared with abstainers students who consumed only one alcohol unit had the risk of being a passenger in a car driven by a drunk driver increased by almost four times, students who reported using five or more units were increased by almost five times the risk of being involved in a car crash. Compared with students who consumed one alcohol unit, the risk of driving under the influence of alcohol increased four times in students using three alcohol units. Age group, use of illicit drugs, employment status, gender, and marital status significantly influenced occurrence of TRB among college students. Our study highlights the potential detrimental effects of low and moderate pattern of alcohol consumption and its relation to riding with an intoxicated driver and other TRB. These data suggest that targeted interventions should be implemented in order to prevent negative consequences due to alcohol use in this population. (C) 2012 Elsevier Inc. All rights reserved,

RISK FOR INJURIES AMONG MOTORCYCLISTS INVOLVED IN TRAFFIC INCIDENTS

The objective of this study was to identify, among motorcyclists involved in traffic incidents, the factors associated with risk of injuries. In 2004, in the city of Maringa-PR, it was determined that there were a total of 2,362 motorcyclists involved in traffic incidents, according to records from the local Military Police. Multivariate analysis was applied to identify the factors associated with the presence of injury. A significantly higher probability of injury was observed among motorcyclists involved in collisions (odds Ratio = 11.19) and falls (odds Ratio = 3.81); the estimated odds ratio for females was close to four, and those involved in incidents including up to two vehicles were 2.63 times more likely to have injuries. Women involved in motorcycle falls and collisions with up to two vehicles stood out as a high-risk group for injuries.

A novel map-matching procedure for low-sampling GPS data with applications to traffic flow analysis

An extensive sample (2%) of private vehicles in Italy are equipped with a GPS device that periodically measures their position and dynamical state for insurance purposes. Having access to this type of data allows to develop theoretical and practical applications of great interest: the real-time reconstruction of traffic state in a certain region, the development of accurate models of vehicle dynamics, the study of the cognitive dynamics of drivers. In order for these applications to be possible, we first need to develop the ability to reconstruct the paths taken by vehicles on the road network from the raw GPS data. In fact, these data are affected by positioning errors and they are often very distanced from each other (~2 Km). For these reasons, the task of path identification is not straightforward. This thesis describes the approach we followed to reliably identify vehicle paths from this kind of low-sampling data. The problem of matching data with roads is solved with a bayesian approach of maximum likelihood. While the identification of the path taken between two consecutive GPS measures is performed with a specifically developed optimal routing algorithm, based on A* algorithm. The procedure was applied on an off-line urban data sample and proved to be robust and accurate. Future developments will extend the procedure to real-time execution and nation-wide coverage.