Sökning: "crossing edges"

Visar resultat 1 - 5 av 7 uppsatser innehållade orden crossing edges.

  1. 1. Interactive Visual Analysis of Hypergraphs

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

    Författare :ningrui Chen; [2021]
    Nyckelord :hypergraph; hyperedge; cardinality of hyperedges; edge bundling; edge crossing; network visualization; information visualization; interaction;

    Sammanfattning : Access to and understanding data plays an essential role in the increasingly digital world. Representation and analysis of relations between various data entities, i.e., graph and network structures in the data, is an important problem for various industries. LÄS MER

  3. 2. Investigation Of The Influence Of Geometrical Parameters On Heat Transfer In Matrix Cooling : A Computational Fluid Dynamics Approach

    Master-uppsats, Linköpings universitet/Mekanisk värmeteori och strömningslära

    Författare :Fabian Maletzke; [2021]
    Nyckelord :turbine; blade cooling; matrix cooling; latticework cooling; CFD; heat transfer; RANS;

    Sammanfattning : Modern gas turbine blades and vanes are operated at temperatures above their material’s melting point. Active external and internal cooling are therefore necessary to reach acceptable lifetimes. One possible internal cooling method is called matrix cooling, where a matrix of intersecting cooling air channels is integrated into a blade or vane. LÄS MER

  4. 3. Water assisted CO intercalation underneath Ir(111) supported graphene studied with scanning tunneling microscopy

    Master-uppsats, Lunds universitet/Synkrotronljusfysik; Lunds universitet/Fysiska institutionen

    Författare :Kaivalya Mevada; [2018]
    Nyckelord :Graphene; Intercalation; STM; CVD; TPG; Physics and Astronomy;

    Sammanfattning : Graphene have attracted attention recently due to its unique properties and opportunities for development of high performance carbon based devices. The intercalation, absorption and reactions processes of small molecules above and below the graphene islands hold the key for new perspectives in catalysis, molecular sensors and other technologies. LÄS MER

  5. 4. Improved inapproximability of Max-Cut through Min-Cut

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

    Författare :Mårten Wiman; [2018]
    Nyckelord :Inapproximability; Max-Cut; 2-Lin 2 ; NP; Unique games;

    Sammanfattning : A cut is a partition of a graph's nodes into two sets, and we say that an edge crosses the cut if it connects two nodes belonging to different sets. A maximum cut is a cut that maximises the number of crossing edges. LÄS MER

  7. 5. Dynamic Programming Algorithms for Semantic Dependency Parsing

    Master-uppsats, Linköpings universitet/Interaktiva och kognitiva system

    Författare :Nils Axelsson; [2017]
    Nyckelord :semantic dependency parsing; machine learning; parsing; logic; deduction system; crossing edges; SemEval; coverage; crossing arcs; graph; graph class; non-crossing; QAC; quartic; acyclic; semantisk dependensparsning; maskininlärning; parsning; logik; deduktionssystem; korsande bågar; SemEval; täckning; korsande kanter; graf; grafklass; ickekorsande; QAC; kvartiskt; acykliskt;

    Sammanfattning : Dependency parsing can be a useful tool to allow computers to parse text. In 2015, Kuhlmann and Jonsson proposed a logical deduction system that parsed to non-crossing dependency graphs with an asymptotic time complexity of O(n3), where “n” is the length of the sentence to parse. LÄS MER