Sökning: "Förutsägelser"
Visar resultat 1 - 5 av 72 avhandlingar innehållade ordet Förutsägelser.
1. Modeling pavement performance based on data from the Swedish LTPP database : predicting cracking and rutting
Sammanfattning : The roads in our society are in a state of constant degradation. The reasons for this are many, and therefore constructed to have a certain lifetime before being reconstructed. To minimize the cost of maintaining the important transport road network high quality prediction models are needed. LÄS MER
2. Field Measurements and Predictions of River Flow, Sediment Transport and Morphological Changes
Sammanfattning : In an alluvial lowland river, sediment is transported in the form of suspended and bed loads. The fluvial process is the macroscopic view and long-term consequence of sediment movement. LÄS MER
3. Phenomenology of Diffractive Higgs Production and Large Extra Dimensions
Sammanfattning : This thesis is based on phenomenological predictions for high energy particle collisions from two different theoretical models. The first two papers deal with uncertainties in exclusive reactions of type proton + proton -> proton + proton + Higgs. LÄS MER
4. Simulations of the Dynamics of Fibre Suspension Flows
Sammanfattning : A new model for simulating non-Brownian flexible fibres suspended in a Newtonian fluid has been developed. Special attention has been given to include realistic flow conditions found in the industrial papermaking process in the key features of the model; it is the intention of the author to employ the model in simulations of the forming section of the paper machine in future studies. LÄS MER
5. On state space structure and average case complexity in random K-SAT problems
Sammanfattning : This thesis gives an introduction to a currently active area in the cross-section between theoretical computer science and theoretical physics. In the last ten years it has been suggested that critical behaviour, usually seen in models from condensed matter physics, may be responsible for the intractability of NP complete computation problems. LÄS MER