Sökning: "Conjugate Gradient"

Visar resultat 1 - 5 av 20 uppsatser innehållade orden Conjugate Gradient.

  1. 1. Multiple-Emitter Super-resolution Imaging using the Alternating Descent Conditional Gradient Method

    Kandidat-uppsats, Lunds universitet/Beräkningsbiologi och biologisk fysik - Genomgår omorganisation; Lunds universitet/Institutionen för astronomi och teoretisk fysik - Genomgår omorganisation

    Författare :Dolev Illouz; [2023]
    Nyckelord :super-resolution; alternating descent conditional gradient method; ADCG; multiple-emitter localization; nanoscale imaging; single molecule tracking; Physics and Astronomy;

    Sammanfattning : This thesis examines the state-of-the-art 2D super-resolution technique alternating descent conditional gradient (ADCG) method's ability to accurately localize fluorophores in diffraction-limited single molecule images (SMI) and analyze the impact of pre-processing and post-processing modules on ADCG's fluorophore localization. A synthetic dataset obtained from the 2013 Grand Challenge localization microscopy and a temporally linked dataset obtained from an unpublished set of Optical DNA mapping experiments performed by Jonathan Jeffet at the NanoBioPhotonix Lab at Tel-Aviv University were initially segmented to extract their noise parameters. LÄS MER

  2. 2. Leveraging Posits for the Conjugate Gradient Linear Solver on an Application-Level RISC-V Core

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

    Författare :David Mallasén Quintana; [2022]
    Nyckelord :Computer Arithmetic; Conjugate Gradient; Posit; IEEE-754; Floating Point; High-Performance Computing; RISC-V; Datoraritmetik; Konjugerad Gradient; Posit; IEEE-754; Flytande Punkt; Högpresterande Beräkningar; RISC-V;

    Sammanfattning : Emerging floating-point arithmetics provide a way to optimize the execution of computationally-intensive algorithms. This is the case with scientific computational kernels such as the Conjugate Gradient (CG) linear solver. Exploring new arithmetics is of paramount importance to maximize the accuracy and timing performance of these algorithms. LÄS MER

  3. 3. Kombinationsmolekyler för genterapi : Konjugat mellan peptider och oligonukleotider

    Kandidat-uppsats, Uppsala universitet/Institutionen för biologisk grundutbildning

    Författare :Amanda Gustafsson; Vincent Goijenfalk; Frida Kasselstrand; Vendela Werner; Astrid Ulveström; Astrid Ekman; [2021]
    Nyckelord :;

    Sammanfattning : The report examines how the market, as well as purification conditions, forpeptide-oligonucleotide conjugates look like today. These conjugates are intended to be usedin drugs to treat otherwise incurable diseases but so far these types of molecules are still intest-phases and no finished conjugate is on the market yet. LÄS MER

  4. 4. A Comparison of Selected Optimization Methods for Neural Networks

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

    Författare :Ludvig Karlsson; Oskar Bonde; [2020]
    Nyckelord :;

    Sammanfattning : Which numerical methods are ideal for training a neural network? In this report four different optimization methods are analysed and compared to each other. First, the most basic method Stochastic Gradient Descent that steps in the negative gradients direction. LÄS MER

  5. 5. Computation of Stationary States for Rotating Bose-Einstein Condensates using Spectral Methods

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

    Författare :Adam Erlandsson; Paul Hedvall; [2020]
    Nyckelord :;

    Sammanfattning : The Bose-Einstein condensate is a phase of matter that arises when cooling gases of bosons to extremely low temperatures. When studying these condensates one may use the Gross-Pitaevskii equation, which is a non-linear variant of the Schrödinger equation. LÄS MER