Diss. Stockholm : Handelshögskolan, 2006.

Bayesian analysis is definitely different from the classic statistical methods. Although, both of them use subjective ideas, it is used in the selection of models in the classic statistical methods, rather than as an explicit part in Bayesian models, which allows the combination of subjective ideas with the data collected, update the prior information and improve inferences. Drastic growth of Bayesian applications indicates it becomes more and more popular, because the advent of computational methods (e.g., MCMC) renders sophisticated analysis. In Bayesian framework, the flexibility and generality allows it to cope with very complex problems. One big obstacle in earlier Bayesian analysis is how to sample from the usually complex posterior distribution. With modern techniques and fast-developed computation capacity, we now have tools to solve this problem. We discuss Acceptance-Rejection sampling, importance sampling and then the MCMC methods. Metropolis-Hasting algorithm, as a very versatile, efficient and powerful simulation technique to construct a Markov Chain, borrows the idea from the well-known acceptance-rejection sampling to generate candidates that are either accepted or rejected, but then retains the current values when rejection takes place (1). A special case of Metropolis-Hasting algorithm is Gibbs Sampler. When dealing with high dimensional problems, Gibbs Sampler doesn’t require a decent proposal distribution. It generates the Markov Chain through univariate conditional probability distribution, which greatly simplifies problems. We illustrate the use of those approaches with examples (with R codes) to provide a thorough review. Those basic methods have variants to deal with different situations. And they are building blocks for more advanced problems. This report is not a tutorial for statistics or the software R. The author assumes that readers are familiar with basic statistical concepts and common R statements. If needed, a detailed instruction of R programming can be found in the Comprehensive R Archive Network (CRAN): http://cran.R-project.org / text

No description available.

No description available.

No description available.

This thesis is concerned with the utilisation of spatial information in processing of high-frequency sidescan SONAR imagery, and particularly in how such information can be used in developing techniques to assist in mapping functions. Survey applications aim to generate maps of the seabed, but are time consuming and expensive; automatic processing is required to improve efficiency. Current techniques have had some success, but utilise little of the available spatial information. Previously, inclusion of such knowledge was prohibitively expensive; recent improvements in numerical simulations techniques has reduced the costs involved. This thesis attempts to exploit these improvements into a method for including spatial information in SONAR processing and in general to image and signal analysis. Bayesian techniques for inclusion of prior knowledge and structuring complex problems are developed and applied to problems of texture segmentation, object detection and parameter extraction. It is shown through experiments on groundtruth and real datasets that the inclusion of spatial context can be very effective in improving poor techniques or, conversely in allowing simpler techniques to be used with the same objective outcome (with obvious computational advantages). The thesis also considers some of the implementation problems with the techniques used, and develops simple modifications to improve common algorithms.

The Intelligent Transportation System (ITS) is a cooperative system that relies on reliable and robust communication schemes among vehicles and between vehicles and their surroundings. The main objective of the ITS is to ensure the safety of vehicle drivers and pedestrians. It provides an efficient and reliable transportation system that enhances traffic management, reduces congestion time, enables smooth traffic re-routing, and avoids economic losses. An essential part of the ITS is the Vehicular Ad hoc Network (VANET). VANET enables the setup of Vehicle-to-Vehicle (V2V) as well as Vehicle-to-Infrastructure (V2I) communication platforms: the two key components in the ITS. The de-facto standard used in wireless V2V and V2I communication applications is the Dedicated Short Range Communication (DSRC). The protocol that defines the specifications for the Medium Access Control (MAC) layer and the physical layer in the DSRC is the IEEE 802.11p protocol. The IEEE 802.11p protocol and its Enhanced Distributed Channel Access (EDCA) mechanism are the main focus of this thesis. Our main objective is to develop new IEEE 802.11p-based protocol for V2V and V2I communication systems, to improve the performance of safety-related applications. These applications are of paramount importance in ITS, because their goal is to decrease the rate of vehicle collisions, and hence reduce the enormous costs associated with them. In fact, large percentage of vehicle collisions can be easily avoided with the exchange of relevant information between vehicles and the Road Side Units (RSUs) installed on the sides of the roads. In this thesis, we propose various enhancements to the IEEE 802.11p protocol to improve its performance by lowering the average end-to-end delay and increasing the average network throughput. We introduce multiple adaptive algorithms to promote the QoS support across all the Access Categories (AC) in IEEE 802.11p. We propose two adaptive backoff algorithms and two algorithms that adaptively change the values of the Arbitrary Inter-Frame Space (AIFS). Then we extend our model to be applied in a large-scale vehicular network. In this context, a multi-layer cluster-based architecture is adopted, and two new distributed time synchronization mechanisms are developed.

In this thesis, I introduce a promising framework for representing an air traffic flow (stream) and flow-management action operating under weather uncertainty. I propose to use a meshed queuing and Markov-chain model---specifically, a queuing model whose service-rates are modulated by an underlying Markov chain describing weather-impact evolution---to capture traffic management in an uncertain environment. Two techniques for characterizing flow-management performance using the model are developed, namely 1) a master-Markov-chain representation technique that yields accurate results but at relatively high computational cost, and 2) a jump-linear system-based approximation that has promising scalability. The model formulation and two analysis techniques are illustrated with numerous examples. Based on this initial study, I believe that the interfaced weather-impact and traffic-flow model analyzed here holds promise to inform strategic flow contingency management in NextGen.

No description available.

No description available.