Sökning: "log normal distribution"
Visar resultat 1 - 5 av 26 avhandlingar innehållade orden log normal distribution.
1. Evaluation of regression methods for log-normal data - linear models for environmental exposure and biomarker outcomes
Sammanfattning : The identification and quantification of associations between variables is often of interest in occupational and environmental research, and regression analysis is commonly used to assess these associations. While exposures and biological data often have a positive skewness and can be approximated with the log-normal distribution, much of the inference in regression analysis is based on the normal distribution. LÄS MER
2. Mimic: A Microscopic Simulation Model for Rural Road Traffic
Sammanfattning : The purpose of this dissertation is to outline the theoretical basis of a road traffic simulation model, named Mimic, that constitutes the key elements of a system for estimating road user effects and environmental impacts. The simulation model suggested is a microscopic road traffic simulation model and it is structured to be used for networks of rural roads. LÄS MER
3. Linear statistics of random matrices and log-gases
Sammanfattning : This thesis is concerned with point processes arising in Random Matrix Theory. It is a compilation thesis: it consists of an introduction and three research papers.In Paper A and Paper B, we study random matrices from the classical compact groups, namely orthogonal, unitary, and symplectic matrices distributed according to Haar measure. LÄS MER
4. NMR Self-Diffusion Studies and Stability Studies of Emulsions
Sammanfattning : The aim of this study is to characterize emulsion systems by self-diffusion PGSE NMR methods. The specifics of the emulsions studied are all taken from the literature and they are of the W/O or O/W type stabilized with different emulsifiers. LÄS MER
5. Random tournaments and random circuits
Sammanfattning : This thesis is devoted to two different topics in the area of probabilistic combinatorics: asymptotic behaviour of subgraph counts in a random tournament and random circuit decompositions of complete graphs.Let Tn be a random tournament on n vertices, chosen uniformly from all 2(n2) such tournaments, and let D be an arbitrary directed graph. LÄS MER