Traffic safety at road–rail level crossings using a driving simulator and traffic simulation

Several intelligent transportation systems (ITS) were used with an advanced driving simulator to assess its influence on driving behavior. Three types of ITS interventions were tested: video in vehicle, audio in vehicle, and on-road flashing marker. The results from the driving simulator were inputs for a developed model that used traffic microsimulation (VISSIM 5.4) to assess the safety interventions. Using a driving simulator, 58 participants were required to drive through active and passive crossings with and without an ITS device and in the presence or absence of an approaching train. The effect of changes in driver speed and compliance rate was greater at passive crossings than at active crossings. The slight difference in speed of drivers approaching ITS devices indicated that ITS helped drivers encounter crossings in a safer way. Since the traffic simulation was not able to replicate a dynamic speed change or a probability of stopping that varied depending on ITS safety devices, some modifications were made to the traffic simulation. The results showed that exposure to ITS devices at active crossings did not influence drivers’ behavior significantly according to the traffic performance indicator, such as delay time, number of stops, speed, and stopped delay. However, the results of traffic simulation for passive crossings, where low traffic volumes and low train headway normally occur, showed that ITS devices improved overall traffic performance.

Evaluate traffic noise level based on traffic microsimulation combined with a refined classic noise prediction method

In this paper, a refined classic noise prediction method based on the VISSIM and FHWA noise prediction model is formulated to analyze the sound level contributed by traffic on the Nanjing Lukou airport connecting freeway before and after widening. The aim of this research is to (i) assess the traffic noise impact on the Nanjing University of Aeronautics and Astronautics (NUAA) campus before and after freeway widening, (ii) compare the prediction results with field data to test the accuracy of this method, (iii) analyze the relationship between traffic characteristics and sound level. The results indicate that the mean difference between model predictions and field measurements is acceptable. The traffic composition impact study indicates that buses (including mid-sized trucks) and heavy goods vehicles contribute a significant proportion of total noise power despite their low traffic volume. In addition, speed analysis offers an explanation for the minor differences in noise level across time periods. Future work will aim at reducing model error, by focusing on noise barrier analysis using the FEM/BEM method and modifying the vehicle noise emission equation by conducting field experimentation.

Modeling Finite Buffer Effects on TCP Traffic over an IEEE 802.11 Infrastructure WLAN

The network scenario is that of an infrastructure IEEE 802.11 WLAN with a single AP with which several stations (STAs) are associated. The AP has a finite size buffer for storing packets. In this scenario, we consider TCP controlled upload and download file transfers between the STAs and a server on the wireline LAN (e.g., 100 Mbps Ethernet) to which the AP is connected. In such a situation, it is known (see, for example, (3), [9]) that because of packet loss due to finite buffers at the Ap, upload file transfers obtain larger throughputs than download transfers. We provide an analytical model for estimating the upload and download throughputs as a function of the buffer size at the AP. We provide models for the undelayed and delayed ACK cases for a TCP that performs loss recovery only by timeout, and also for TCP Reno.

Economic evaluation of precision controlled traffic farming in the Australian sugar industry: a case study of an early adopter

Controlled traffic has been identified as the most practical method of reducing compaction-related soil structural degradation in the Australian sugarcane industry. GPS auto-steer systems are required to maximize this potential. Unfortunately there is a perception that little economic gain will result from investing in this technology. Regardless, a number of growers have made the investment and are reaping substantial economic and lifestyle rewards. In this paper we assess the cost effectiveness of installing GPS guidance and using it to implement Precision Controlled Traffic Farming (PCTF) based on the experience of an early adopter. The Farm Economic Analysis Tool (FEAT) model was used with data provided by the grower to demonstrate the benefits of implementing PCTF. The results clearly show that a farming system based on PCTF and the minimum tillage improved farm gross margin by 11.8% and reduced fuel usage by 58%, compared to producers' traditional practice. PCTF and minimum tillage provide sugar producers with a tool to manage the price cost squeeze at a time of low sugar prices. These data provide producers with the evidence that investment in PCTF is economically prudent.

Land use regression model (LUR) for ultrafine particles in Brisbane

Traffic-related air pollution has been associated with a wide range of adverse health effects. One component of traffic emissions that has been receiving increasing attention is ultrafine particles(UFP, < 100 nm), which are of concern to human health due to their small diameters. Vehicles are the dominant source of UFP in urban environments. Small-scale variation in ultrafine particle number concentration (PNC) can be attributed to local changes in land use and road abundance. UFPs are also formed as a result of particle formation events. Modelling the spatial patterns in PNC is integral to understanding human UFP exposure and also provides insight into particle formation mechanisms that contribute to air pollution in urban environments. Land-use regression (LUR) is a technique that can use to improve the prediction of air pollution.

Cellular Automata Models of Traffic Behavior in Presence of Speed Breaking Structures

In this article, we study traffic flow in the presence of speed breaking structures. The speed breakers are typically used to reduce the local speed of vehicles near certain institutions such as schools and hospitals. Through a cellular automata model we study the impact of such structures on global traffic characteristics. The simulation results indicate that the presence of speed breakers could reduce the global flow under moderate global densities. However, under low and high global density traffic regime the presence of speed breakers does not have an impact on the global flow. Further the speed limit enforced by the speed breaker creates a phase distinction. For a given global density and slowdown probability, as the speed limit enforced by the speed breaker increases, the traffic moves from the reduced flow phase to maximum flow phase. This underlines the importance of proper design of these structures to avoid undesired flow restrictions.

Modeling finite buffer effects on TCP traffic over an IEEE 802.11 infrastructure WLAN

The network scenario is that of an infrastructure IEEE 802.11 WLAN with a single AP with which several stations (STAs) are associated. The AP has a finite size buffer for storing packets. In this scenario, we consider TCP-controlled upload and download file transfers between the STAs and a server on the wireline LAN (e.g., 100 Mbps Ethernet) to which the AP is connected. In such a situation, it is well known that because of packet losses due to finite buffers at the AP, upload file transfers obtain larger throughputs than download transfers. We provide an analytical model for estimating the upload and download throughputs as a function of the buffer size at the AP. We provide models for the undelayed and delayed ACK cases for a TCP that performs loss recovery only by timeout, and also for TCP Reno. The models are validated incomparison with NS2 simulations.

A Petri net model for evaluating packet buffering strategies in a network processor

Previous studies have shown that buffering packets in DRAM is a performance bottleneck. In order to understand the impediments in accessing the DRAM, we developed a detailed Petri net model of IP forwarding application on IXP2400 that models the different levels of the memory hierarchy. The cell based interface used to receive and transmit packets in a network processor leads to some small size DRAM accesses. Such narrow accesses to the DRAM expose the bank access latency, reducing the bandwidth that can be realized. With real traces up to 30% of the accesses are smaller than the cell size, resulting in 7.7% reduction in DRAM bandwidth. To overcome this problem, we propose buffering these small chunks of data in the on chip scratchpad memory. This scheme also exploits greater degree of parallelism between different levels of the memory hierarchy. Using real traces from the internet, we show that the transmit rate can be improved by an average of 21% over the base scheme without the use of additional hardware. Further, the impact of different traffic patterns on the network processor resources is studied. Under real traffic conditions, we show that the data bus which connects the off-chip packet buffer to the micro-engines, is the obstacle in achieving higher throughput.

Imaging in vivo Neuronal Transport in Genetic Model Organisms Using Microfluidic Devices

Microfluidic devices have been developed for imaging behavior and various cellular processes in Caenorhabditis elegans, but not subcellular processes requiring high spatial resolution. In neurons, essential processes such as axonal, dendritic, intraflagellar and other long-distance transport can be studied by acquiring fast time-lapse images of green fluorescent protein (GFP)-tagged moving cargo. We have achieved two important goals in such in vivo studies namely, imaging several transport processes in unanesthetized intact animals and imaging very early developmental stages. We describe a microfluidic device for immobilizing C. elegans and Drosophila larvae that allows imaging without anesthetics or dissection. We observed that for certain neuronal cargoes in C. elegans, anesthetics have significant and sometimes unexpected effects on the flux. Further, imaging the transport of certain cargo in early developmental stages was possible only in the microfluidic device. Using our device we observed an increase in anterograde synaptic vesicle transport during development corresponding with synaptic growth. We also imaged Q neuroblast divisions and mitochondrial transport during early developmental stages of C. elegans and Drosophila, respectively. Our simple microfluidic device offers a useful means to image high-resolution subcellular processes in C. elegans and Drosophila and can be readily adapted to other transparent or translucent organisms.

Distributed Source Coding for Sensor Data Model and Estimation of Cluster Head Errors Using Bayesian and K-Near Neighborhood Classifiers in Deployment of Dense Wireless Sensor Networks

The lifetime calculation of large dense sensor networks with fixed energy resources and the remaining residual energy have shown that for a constant energy resource in a sensor network the fault rate at the cluster head is network size invariant when using the network layer with no MAC losses.Even after increasing the battery capacities in the nodes the total lifetime does not increase after a max limit of 8 times. As this is a serious limitation lots of research has been done at the MAC layer which allows to adapt to the specific connectivity, traffic and channel polling needs for sensor networks. There have been lots of MAC protocols which allow to control the channel polling of new radios which are available to sensor nodes to communicate. This further reduces the communication overhead by idling and sleep scheduling thus extending the lifetime of the monitoring application. We address the two issues which effects the distributed characteristics and performance of connected MAC nodes. (1) To determine the theoretical minimum rate based on joint coding for a correlated data source at the singlehop, (2a) to estimate cluster head errors using Bayesian rule for routing using persistence clustering when node densities are the same and stored using prior probability at the network layer, (2b) to estimate the upper bound of routing errors when using passive clustering were the node densities at the multi-hop MACS are unknown and not stored at the multi-hop nodes a priori. In this paper we evaluate many MAC based sensor network protocols and study the effects on sensor network lifetime. A renewable energy MAC routing protocol is designed when the probabilities of active nodes are not known a priori. From theoretical derivations we show that for a Bayesian rule with known class densities of omega1, omega2 with expected error P* is bounded by max error rate of P=2P* for single-hop. We study the effects of energy losses using cross-layer simulation of - large sensor network MACS setup, the error rate which effect finding sufficient node densities to have reliable multi-hop communications due to unknown node densities. The simulation results show that even though the lifetime is comparable the expected Bayesian posterior probability error bound is close or higher than Pges2P*.

Resource Pricing for Fair and Efficient Link Sharing with a Finite Data Model

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. We obtain simple necessary and sufficient conditions on prices such that efficient and fair link sharing is possible. We illustrate the ideas using a simple example

An instantaneous control model for flow control in an ATM network

This paper is concerned with the optimal flow control of an ATM switching element in a broadband-integrated services digital network. We model the switching element as a stochastic fluid flow system with a finite buffer, a constant output rate server, and a Gaussian process to characterize the input, which is a heterogeneous set of traffic sources. The fluid level should be maintained between two levels namely b1 and b2 with b1

Multi-agent Reinforcement Learning for Traffic Signal Control

Optimal control of traffic lights at junctions or traffic signal control (TSC) is essential for reducing the average delay experienced by the road users amidst the rapid increase in the usage of vehicles. In this paper, we formulate the TSC problem as a discounted cost Markov decision process (MDP) and apply multi-agent reinforcement learning (MARL) algorithms to obtain dynamic TSC policies. We model each traffic signal junction as an independent agent. An agent decides the signal duration of its phases in a round-robin (RR) manner using multi-agent Q-learning with either is an element of-greedy or UCB 3] based exploration strategies. It updates its Q-factors based on the cost feedback signal received from its neighbouring agents. This feedback signal can be easily constructed and is shown to be effective in minimizing the average delay of the vehicles in the network. We show through simulations over VISSIM that our algorithms perform significantly better than both the standard fixed signal timing (FST) algorithm and the saturation balancing (SAT) algorithm 15] over two real road networks.

Probabilistic graphical models for semi-supervised traffic classification

Traffic classification using machine learning continues to be an active research area. The majority of work in this area uses off-the-shelf machine learning tools and treats them as black-box classifiers. This approach turns all the modelling complexity into a feature selection problem. In this paper, we build a problem-specific solution to the traffic classification problem by designing a custom probabilistic graphical model. Graphical models are a modular framework to design classifiers which incorporate domain-specific knowledge. More specifically, our solution introduces semi-supervised learning which means we learn from both labelled and unlabelled traffic flows. We show that our solution performs competitively compared to previous approaches while using less data and simpler features. Copyright © 2010 ACM.

Model development & application for inland navigational canals

Several agencies in the United Kingdom have interest in the water quality of old navigational canals that have fallen into disuse after the decline of commercial canal transportation. The interested agencies desired a model to predict the water quantity and quality of inland navigational canals in order to evaluate management options to address the issues in the natural streams to which they discharge. Inland navigational canals have unique drivers of their hydrology and water quality compared to either natural streams, irrigation canals, or larger navigational canals connected to seas or oceans. Water in an inland canal is typically sourced from a reservoir and artificially pumped to a summit reach; its movement downhill is controlled by the activity of boats and overflow weirs. Stagnant impoundments between locks, which might normally be expected to result in a decrease in the concentration of sediment-associated pollutants, actually have surprisingly high levels of sediment due to boat traffic. Algal growth in the stagnant reach can be high. This paper describes a canal model developed to simulate hydrology and water quality in inland navigational canals. This model was successfully applied to the Kennet and Avon Canal to predict hydrology, sediment generation and transport, and algal growth and transport. The model is responsive to external influences such as sunlight, temperature, nutrient concentrations, boat traffic, and runoff from the contributing catchment area.