Sökning: "upper bound"

Visar resultat 1 - 5 av 94 uppsatser innehållade orden upper bound.

  1. 1. Relaxed Priority Queue & Evaluation of Locks

    Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Andreas Rudén; Ludvig Andersson; [2023-10-23]
    Nyckelord :Concurrency; Data Structures; Algorithms; Priority Queue; Semantic Relaxation; Lock-free; Scalability; Performance;

    Sammanfattning : We present a new, lock-free and concurrent priority queue, utilizing some ideas from [1] by Rukundo et al., that relaxes the traditional sequential semantics of the delete_min operation to achieve better scalability and performance. LÄS MER

  3. 2. Uncertainty Estimation in Radiation Dose Prediction U-Net

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

    Författare :Frida Skarf; [2023]
    Nyckelord :Radiation dose prediction models; U-net; quantile regression; Monte Carlo Dropout; epistemic uncertainty estimation; aleatoric uncertainty estimation; Stråldospredicerande modeller; U-net; kvantilregression; Monte Carlo Dropout; epistemisk osäkerhetsskattning; aletorisk osäkerhetsskattning;

    Sammanfattning : The ability to quantify uncertainties associated with neural network predictions is crucial when they are relied upon in decision-making processes, especially in safety-critical applications like radiation therapy. In this paper, a single-model estimator of both epistemic and aleatoric uncertainties in a regression 3D U-net used for radiation dose prediction is presented. LÄS MER

  4. 3. The Riemann Hypothesis and the Distribution of Primes

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :David Appelgren; Leo Tikkanen; [2023]
    Nyckelord :Riemann; Riemann Hypothesis; Zeta Function; Prime Number Theorem;

    Sammanfattning : The aim of this thesis is to examine the connection between the Riemannhypothesis and the distribution of prime numbers. We first derive theanalytic continuation of the zeta function and prove some of its propertiesusing a functional equation. LÄS MER

  5. 4. Channel Estimation and Power Control Algorithms in the Presence of Channel Aging

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

    Författare :Yan Bixing; [2023]
    Nyckelord :Fading channel; auto-regressive model; power allocation; uncrewed aerial vehicle networks; Fading kanal; auto-regressiv modell; krafttilldelning; obemannade flygfordonsnätverk;

    Sammanfattning : Power allocation algorithms that determine how much power should be allocated to pilot and data symbols play an important role in addressing the trade-off between accurate channel estimation and high high spectral efficiency for data symbols in the presence of time-varying fading channels. Dealing with this trade-off is highly non-trivial when the channel changes or ages rapidly in time. LÄS MER

  7. 5. Constraining the Higgs width in Higgs production associated with a top quark pair

    Kandidat-uppsats, Lunds universitet/Fysiska institutionen; Lunds universitet/Teoretisk partikelfysik - Geonomgår omorganisation

    Författare :Benjamin Dahlén; [2023]
    Nyckelord :Higgs; width; cross section; on-shell; off-shell; invariant mass; Standard model; upper bound; Physics and Astronomy;

    Sammanfattning : In this thesis we study the width of the Higgs boson in the process pp → t ̄t 4l at LO using MadGraph5_aMC@NLO to generate the events. The contributions including the Higgs signal, continuum background and interference were considered in order to calculate the expected number of events in a broad range of four-lepton invariant masses. LÄS MER