Sökning: "random"

Visar resultat 16 - 20 av 1716 avhandlingar innehållade ordet random.

  1. 16. Inertial collisions in random flows

    Författare :Kristian Gustafsson; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Collisions; nonlinear dynamical systems; particles and aerosols; random processes; suspensions; turbulent diffusion; turbulent flows;

    Sammanfattning : In nature, suspensions of small particles in fluids are common. An important example are rain droplets suspended in turbulent clouds. Such clouds can start to rain very quickly and the reason for this is still not fully explained, but it is believed that the turbulent motion in the cloud plays an important role. LÄS MER

  3. 17. Symmetry in Randomness : Additive Functionals and Symmetries of Random Trees and Tree-Like Graphs

    Författare :Christoffer Olsson; Stephan Wagner; Ralph Neininger; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Random trees; Random graphs; Additive functionals; Automorphisms; Mathematics; Matematik;

    Sammanfattning : Properties of symmetries in random trees and tree-like graphs are explored. The primary structures studied are Galton-Watson trees, unlabeled unordered trees as well as labeled subcritical graphs. LÄS MER

  4. 18. On Probability in Geotechnics. Random Calculation Models Exemplified on Slope Stability Analysis and Ground-Superstructure Interaction

    Författare :Claes Alén; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; random; creep; slope stability; calculation; interaction; design; limit state; probability; statistics; geotechnics;

    Sammanfattning : The thesis deals with uncertainty in calculation modelling. Emphasis is put on the design state. Design is a chain of decisions under uncertainty. A probabilistic approach is used to describe the uncertainty and calculations as a way to reveal the uncertainty. LÄS MER

  5. 19. Beating a Random Assignment : Approximating Constraint Satisfaction Problems

    Författare :Gustav Hast; Johan Håstad; Uri Zwick; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Computer science; Datalogi;

    Sammanfattning : An instance of a Boolean constraint satisfaction problem, CSP, consists of a set of constraints acting over a set of Boolean variables. The objective is to find an assignment to the variables that satisfies all the constraints. LÄS MER

  7. 20. Random railways modelled as random 3-regular graphs

    Författare :Hans Garmo; Uppsala universitet; []
    Nyckelord :;

    Sammanfattning : .... LÄS MER