Sökning: "stochastic variations"

Visar resultat 1 - 5 av 18 uppsatser innehållade orden stochastic variations.

  1. 1. Improved Statistical Methods for Elliptic Stochastic Homogenization Problems : Application of Multi Level- and Multi Index Monte Carlo on Elliptic Stochastic Homogenization Problems

    Kandidat-uppsats, Uppsala universitet/Tillämpad beräkningsvetenskap

    Författare :Khalil Daloul; [2023]
    Nyckelord :Homogenization; Multilevel Monte Carlo; Multi-Index Monte Carlo; Monte Carlo; Multiscale methods;

    Sammanfattning : In numerical multiscale methods, one relies on a coupling between macroscopic model and a microscopic model. The macroscopic model does not include the microscopic properties that the microscopic model offers and that are vital for the desired solution. LÄS MER

  3. 2. Feasibility Study of Implementation of Machine Learning Models on Card Transactions

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Samhar Alzghaier; Mervan Can Kaya; [2022]
    Nyckelord :Processing; Merchant; Acquirer; Customer; Demand Pricing; Dynamic Pricing; Profitability; Machine Learning; Algorithms; Naive-Bayes; AdaBoost; K-Nearest Neighbour; Stochastic Gradient Descent; Decision Trees; Random Forests;

    Sammanfattning : Several studies have been conducted within machine learning, and various variations have been applied to a wide spectrum of other fields. However, a thorough feasibility study within the payment processing industry using machine learning classifier algorithms is yet to be explored. LÄS MER

  4. 3. A Study of Stochastic Resonance in a Climate model

    Kandidat-uppsats, KTH/Fysik

    Författare :Agnes Olsson; Ebba Jernmark Burrows; [2022]
    Nyckelord :Stochastic Resonance; climate cycle;

    Sammanfattning : Historically, the earth’s fluctuation between interglacial and glacial climates has been observedto have a period of 105 years [1]. However, simulations of the global average temperature didn’tmanage to reproduce this cycle period until 1982, when Benzi et al. LÄS MER

  5. 4. Query difficulty classification using search session length

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Samuel Hertzberg; [2020]
    Nyckelord :;

    Sammanfattning : For data to be successfully utilised, it must be indexed and readily available, and for data to be useful, it must be searchable. To make search solutions better, it is often in the search providers interest to have some insight and understanding regarding their users’ behaviour. One such insight can be produced by query difficulty prediction. LÄS MER

  7. 5. Sequence Prediction for Identifying User Equipment Patterns in Mobile Networks

    Master-uppsats, KTH/Matematisk statistik

    Författare :Theoharis Charitidis; [2020]
    Nyckelord :Markov chain; mobile networks; user equipment; machine learning; statistics; sequence prediction; stochastic process; Maskininlärning; mobila nätverk; statistik; markovkedjor; all k order markov; stokastisk process; sekvensprediktering;

    Sammanfattning : With an increasing demand for bandwidth and lower latency in mobile communication networks it becomes gradually more important to improve current mobile network management solutions using available network data. To improve the network management it can for instance be of interest to infer future available bandwidth to the end user of the network. LÄS MER