Sökning: "distance graph"

Visar resultat 1 - 5 av 43 uppsatser innehållade orden distance graph.

  1. 1. Station-level demand prediction in bike-sharing systems through machine learning and deep learning methods

    Master-uppsats, Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskap

    Författare :Nikolaos Staikos; [2024]
    Nyckelord :Physical Geography; Ecosystem Analysis; Bike-sharing demand; Machine learning; Deep learning; Spatial regression; Graph Convolutional Neural Network; Multiple Linear Regression; Multilayer Perceptron Regressor; Support Vector Machine; Random Forest Regressor; Urban environment; Micro-mobility; Station planning; Geomatics; Earth and Environmental Sciences;

    Sammanfattning : Public Bike-Sharing systems have been employed in many cities around the globe. Shared bikes are an efficient and convenient means of transportation in advanced societies. Nonetheless, station planning and local bike-sharing network effectiveness can be challenging. LÄS MER

  3. 2. Designing a Novel RPL Objective Function & Testing RPL Objective Functions Performance

    Kandidat-uppsats, Linnéuniversitetet/Institutionen för datavetenskap och medieteknik (DM)

    Författare :Khalil Mardini; Emad Abdulsamad; [2023]
    Nyckelord :Routing protocol for low-power and lossy networks RPL ; Wireless Sensor Networks WSN ; The Internet of Things IoT ; Objective Function OF ; Low-Power and Lossy Networks LLNs ; Expected Transmission Count ETX ; Min- imum Rank with Hysteresis Objective Function MRHOF ; Packet Delivery Ratio PDR ; Directed Acyclic Graph DODAG ;

    Sammanfattning : The use of Internet of Things systems has increased to meet the need for smart systems in various fields, such as smart homes, intelligent industries, medical systems, agriculture, and the military. IoT networks are expanding daily to include hundreds and thousands of IoT devices, which transmit information through other linked devices to reach the network sink or gateway. LÄS MER

  4. 3. Analys av medianproblemetinom grafteori

    Kandidat-uppsats, Örebro universitet/Institutionen för naturvetenskap och teknik

    Författare :Linnéa Östlund; [2023]
    Nyckelord :;

    Sammanfattning : Medianproblemet innebär att, givet ett avståndsmått, hitta en permutationmed minsta totalavstånd till en mängd permutationer. Tidigare har fleraolika avståndsmått studerats och visat sig variera kraftigt i användbarhet. LÄS MER

  5. 4. Preserving the Mental Map when Visualizing Dynamic Graphs : An Approach for Intermediate Representations in the C2 Java Compiler

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

    Författare :Emmy Yin; [2023]
    Nyckelord :Dynamic Graphs; Graph Layout Algorithms; Visualization; Hierarchical Graph Layouts; Dynamiska grafer; grafritningsalgoritmer; visualisering; hierarkiska grafritningar;

    Sammanfattning : Graphs are powerful data structures that are widely used to represent complex forms of information. One area in which graphs are successfully being used is within compiler engineering, where a program under compilation can be represented as a graph that changes as the program is being compiled. LÄS MER

  7. 5. 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