Sökning: "Diskret geometri"

Visar resultat 1 - 5 av 13 uppsatser innehållade orden Diskret geometri.

  1. 1. Estimating Diffusion Tensor Distributions With Neural Networks

    Master-uppsats, Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Rimaz Nismi; [2024]
    Nyckelord :Diffusion; Magnetic Resonance Imaging; MRI; Neural Networks; Optimal transport; Earth mover s distance; Sinkhorn distance;

    Sammanfattning : Magnetic Resonance Imaging (MRI) is an essential healthcare technology, with diffusion MRI being a specialized technique. Diffusion MRI exploits the inherent diffusion of water molecules within the human body to produce a high-resolution tissue image. An MRI image contains information about a 3D volume in space, composed of 3D units called voxels. LÄS MER

  3. 2. Oändliga serier av cirkelkonfigurationer

    Kandidat-uppsats, Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Ellinor Karlsson; [2023]
    Nyckelord :;

    Sammanfattning : Denna uppsats fokuserar på konfigurationer bestående av linjer och punkter, samt cirklar och punkter, som har tillämpningar inom områden som till exempel datarättningsmetoder. Vi presenterar klassiska exempel på dessa konfigurationer, såsom Miguels konfiguration och projektiva plan. LÄS MER

  4. 3. Efficient FE Modeling of Large Casted Parts

    Master-uppsats, KTH/Maskinkonstruktion

    Författare :Lalitha Swetha Amirapu; Haswanth Yalamanchili; [2023]
    Nyckelord :FE modeling; Large casted parts; Meshing techniques; Mid-surface modeling; FE-modellering; Stora gjutna delar; Meshing-tekniker; Mid-Surface modellering;

    Sammanfattning : The design and analysis of large casted parts present significant challenges due to their complex geometry. Finite Element (FE) modeling is a vital tool for understanding the performance of casted components. However, the computational requirements associated with these parts often lead to excessive processing times and resource utilization. LÄS MER

  5. 4. Distance Consistent Labellings and the Local List Number

    Kandidat-uppsats, Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Anders Henricsson; [2023]
    Nyckelord :distance-consistence; graph labelling; graph distance; avstånds-konsistens; grafmärkning; grafavstånd;

    Sammanfattning : We study the local list number of graphs introduced by Lennerstad and Eriksson. A labelling of a graph on n vertices is a bijection from vertex set to the set {1,…, n}. Given such a labelling c a vertex u is distance consistent if for all vertices v and w |c(u)-c(v)|=|c(u)-c(w)|+1 implies d(u,w)≤ d(u,v). LÄS MER

  7. 5. Generating Functions : Powerful Tools for Recurrence Relations. Hermite Polynomials Generating Function

    Kandidat-uppsats, Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Christoffer Rydén; [2023]
    Nyckelord :Ordinary power series generating function; Exponential generating function; Moment generating function; Hermite polynomials;

    Sammanfattning : In this report we will plunge down in the fascinating world of the generating functions. Generating functions showcase the "power of power series", giving more depth to the word "power" in power series. We start off small to get a good understanding of the generating function and what it does. LÄS MER