Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "graph representation" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-10 z 10
    Tytuł:
    Clique graph representations of ptolemaic graphs
    Autorzy:
    McKee, Terry
    Powiązania:
    https://bibliotekanauki.pl/articles/744102.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Ptolemaic graph
    clique graph
    chordal graph
    clique tree
    graph representation
    Opis:
    A graph is ptolemaic if and only if it is both chordal and distance-hereditary. Thus, a ptolemaic graph G has two kinds of intersection graph representations: one from being chordal, and the other from being distance-hereditary. The first of these, called a clique tree representation, is easily generated from the clique graph of G (the intersection graph of the maximal complete subgraphs of G). The second intersection graph representation can also be generated from the clique graph, as a very special case of the main result: The maximal Pₙ-free connected induced subgraphs of the p-clique graph of a ptolemaic graph G correspond in a natural way to the maximal $P_{n+1}$-free induced subgraphs of G in which every two nonadjacent vertices are connected by at least p internally disjoint paths.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2010, 30, 4; 651-661
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Solving Markov decision processes by d-graph algorithms
    Autorzy:
    Kátai, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/205688.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    Markov decision processes
    dynamic programming
    graph representation
    graph algorithms
    optimization problems
    Opis:
    Markov decision processes (MDPs) provide a mathematical model for sequential decisionmaking (sMDP/dMDP: stochastic/ deterministic MDP). We introduce the concept of generalized dMDP (g-dMDP) where each action may result in more than one next (parallel or clone) state. The common tools to represent dMDPs are digraphs, but these are inadequate for sMDPs and g-dMDPs. We introduce d-graphs as general tools to represent all the above mentioned processes (stationary versions). We also present a combined d-graph algorithm that implements dynamic programming strategies to find optimal policies for the finite/infinite horizon versions of these Markov processes. (The preliminary version of this paper was presented at the Conference MACRo 2011.)
    Źródło:
    Control and Cybernetics; 2012, 41, 3; 577-593
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Knowledge graphs effectiveness in Neural Machine Translation improvement
    Autorzy:
    Ahmadnia, Benyamin
    Dorr, Bonnie J.
    Kordjamshidi, Parisa
    Powiązania:
    https://bibliotekanauki.pl/articles/1839251.pdf
    Data publikacji:
    2020
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    natural language processing
    neural machine translation
    knowledge graph representation
    Opis:
    Maintaining semantic relations between words during the translation process yields more accurate target-language output from Neural Machine Translation (NMT). Although difficult to achieve from training data alone, it is possible to leverage Knowledge Graphs (KGs) to retain source-language semantic relations in the corresponding target-language translation. The core idea is to use KG entity relations as embedding constraints to improve the mapping from source to target. This paper describes two embedding constraints, both of which employ Entity Linking (EL)—assigning a unique identity to entities—to associate words in training sentences with those in the KG: (1) a monolingual embedding constraint that supports an enhanced semantic representation of the source words through access to relations between entities in a KG; and (2) a bilingual embedding constraint that forces entity relations in the source-language to be carried over to the corresponding entities in the target-language translation. The method is evaluated for English-Spanish translation exploiting Freebase as a source of knowledge. Our experimental results demonstrate that exploiting KG information not only decreases the number of unknown words in the translation but also improves translation quality
    Źródło:
    Computer Science; 2020, 21 (3); 299-318
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the 12-Representability of Induced Subgraphs of a Grid Graph
    Autorzy:
    Chen, Joanna N.
    Kitaev, Sergey
    Powiązania:
    https://bibliotekanauki.pl/articles/32361728.pdf
    Data publikacji:
    2022-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    graph representation
    12-representable graph
    grid graph
    forbidden subgraph
    square grid graph
    line grid graph
    Opis:
    The notion of a 12-representable graph was introduced by Jones, Kitaev, Pyatkin and Remmel in [Representing graphs via pattern avoiding words, Electron. J. Combin. 22 (2015) #P2.53]. This notion generalizes the notions of the much studied permutation graphs and co-interval graphs. It is known that any 12-representable graph is a comparability graph, and also that a tree is 12-representable if and only if it is a double caterpillar. Moreover, Jones et al. initiated the study of 12- representability of induced subgraphs of a grid graph, and asked whether it is possible to characterize such graphs. This question of Jones et al. is meant to be about induced subgraphs of a grid graph that consist of squares, which we call square grid graphs. However, an induced subgraph in a grid graph does not have to contain entire squares, and we call such graphs line grid graphs. In this paper we answer the question of Jones et al. by providing a complete characterization of 12-representable square grid graphs in terms of forbidden induced subgraphs. Moreover, we conjecture such a characterization for the line grid graphs and give a number of results towards solving this challenging conjecture. Our results are a major step in the direction of characterization of all 12-representable graphs since beyond our characterization, we also discuss relations between graph labelings and 12-representability, one of the key open questions in the area.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2022, 42, 2; 383-403
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Characterizations of the Family of All Generalized Line Graphs—Finite and Infinite—and Classification of the Family of All Graphs Whose Least Eigenvalues ≥ −2
    Autorzy:
    Vijayakumar, Gurusamy Rengasamy
    Powiązania:
    https://bibliotekanauki.pl/articles/29551714.pdf
    Data publikacji:
    2013-09-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    generalized line graph
    enhanced line graph
    representation of a graph
    extended line graph
    least eigenvalue of a graph
    Opis:
    The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (1976) 305-327], the class of all finite graphs whose least eigenvalues ≥ −2 has been classified: (1) If a (finite) graph is connected and its least eigenvalue is at least −2, then either it is a generalized line graph or it is represented by the root system E8. In [A. Torgašev, A note on infinite generalized line graphs, in: Proceedings of the Fourth Yugoslav Seminar on Graph Theory, Novi Sad, 1983 (Univ. Novi Sad, 1984) 291- 297], it has been found that (2) any countably infinite connected graph with least eigenvalue ≥ −2 is a generalized line graph. In this article, the family of all generalized line graphs-countable and uncountable-is described algebraically and characterized structurally and an extension of (1) which subsumes (2) is derived.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2013, 33, 4; 637-648
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The leafage of a chordal graph
    Autorzy:
    Lin, In-Jen
    McKee, Terry
    West, Douglas
    Powiązania:
    https://bibliotekanauki.pl/articles/972051.pdf
    Data publikacji:
    1998
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    chordal graph
    subtree intersection representation
    leafage
    Opis:
    The leafage l(G) of a chordal graph G is the minimum number of leaves of a tree in which G has an intersection representation by subtrees. We obtain upper and lower bounds on l(G) and compute it on special classes. The maximum of l(G) on n-vertex graphs is n - lg n - 1/2 lg lg n + O(1). The proper leafage l*(G) is the minimum number of leaves when no subtree may contain another; we obtain upper and lower bounds on l*(G). Leafage equals proper leafage on claw-free chordal graphs. We use asteroidal sets and structural properties of chordal graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1998, 18, 1; 23-48
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Exploring convolutional auto-encoders for representation learning on networks
    Autorzy:
    Nerurkar, Pranav Ajeet
    Chandane, Madhav
    Bhirud, Sunil
    Powiązania:
    https://bibliotekanauki.pl/articles/305489.pdf
    Data publikacji:
    2019
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    network representation learning
    deep learning
    graph convolutional neural networks
    Opis:
    A multitude of important real-world or synthetic systems possess network structures. Extending learning techniques such as neural networks to process such non-Euclidean data is therefore an important direction for machine learning re- search. However, this domain has received comparatively low levels of attention until very recently. There is no straight-forward application of machine learning to network data, as machine learning tools are designed for i:i:d data, simple Euclidean data, or grids. To address this challenge, the technical focus of this dissertation is on the use of graph neural networks for network representation learning (NRL); i.e., learning the vector representations of nodes in networks. Learning the vector embeddings of graph-structured data is similar to embedding complex data into low-dimensional geometries. After the embedding process is completed, the drawbacks associated with graph-structured data are overcome. The current inquiry proposes two deep-learning auto-encoder-based approaches for generating node embeddings. The drawbacks in such existing auto-encoder approaches as shallow architectures and excessive parameters are tackled in the proposed architectures by using fully convolutional layers. Extensive experiments are performed on publicly available benchmark network datasets to highlight the validity of this approach.
    Źródło:
    Computer Science; 2019, 20 (3); 273-288
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Representation of complex object and process structures in graph data base on the example of agricultural tractor
    Autorzy:
    Pietrzyk, Robert
    Marciniak, Andrzej
    Powiązania:
    https://bibliotekanauki.pl/articles/263238.pdf
    Data publikacji:
    2019
    Wydawca:
    Sieć Badawcza Łukasiewicz. Przemysłowy Instytut Motoryzacji
    Tematy:
    graph database
    data engineering
    knowledge representation
    tractor’s BOM (Bill of Material)
    technical revisions system
    Opis:
    The paper presents an application of Graph Data Base technology in knowledge engineering task concerned with knowledge representation of complex structures. The first example is graph representation of a composition of tractor gearbox. It is an example of application of static partonomy relation. The adequate codding of that relation in Graph Data Base is easily expressed in Cypher language. There were presented some applications of Graph Data Base useful in the management of the technical object existence in different “life” phases, as design, production, maintenance and recycling. The second example concerns the Graph representation of activity structure. Such structures were built based on an agricultural tractor’s technical revision system. Created Data Base allows for processing the queries referred to the questions of what activities in what period should be performed to maintain the agricultural tractor ready to work in good technical condition. The Graph Data Base technology is the first step to create semantic systems for data storing and processing in order to extract knowledge and information useful in precise physical process management.
    Źródło:
    Archiwum Motoryzacji; 2019, 83, 1; 5-22
    1234-754X
    2084-476X
    Pojawia się w:
    Archiwum Motoryzacji
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Zastosowanie wybranych reprezentacji graficznych do analizy aplikacji wielowątkowych
    Autorzy:
    Giebas, D.
    Wojszczyk, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/118333.pdf
    Data publikacji:
    2018
    Wydawca:
    Politechnika Koszalińska. Wydawnictwo Uczelniane
    Tematy:
    reprezentacja graficzna
    Sieci Petriego
    Control Flow Graph
    Systemy Współbieżnych Procesów
    aplikacja wielowątkowa
    graphical representation
    Petri Network
    Concurrent Processing Systems
    multithreaded applications
    Opis:
    Artykuł zawiera zestawienie reprezentacji graficznych, do których możliwa jest transformacja kodu źródłowego aplikacji wielowątkowych. Zestawienie powszechnie wykorzystywanych reprezentacji, jakimi są Control Flow Graph i Sieci Petriego, pozwoliło na analizę tych reprezentacji, pod kątem przydatności do znajdywania popularnych i niepożądanych zjawisk w aplikacjach wielowątkowych. Jako alternatywa dla Control Flow Graph i Sieci Petriego przedstawiono reprezentację Systemów Współbieżnych Procesów. Wszystkie trzy reprezentacje zostały wykorzystane do reprezentacji przykładowej aplikacji napisanej w języku C, zawierającej zjawisko race condition. W podsumowaniu dokonana została ocena, która zależała od tego czy dana reprezentacja pozwoli odnaleźć wspomniane zjawisko.
    The article contains a list of graphical representations to which it is possible to transform the source code of multithreaded applications. Comparison of commonly used representations, such as Control Flow Graph and Petri Network, allowed to analyze these representations in terms of their usefulness in finding popular and undesirable phenomena in multithreaded applications. As an alternative to Control Flow Graph and Petri Network, the representation of Concurrent Processing Systems is presented. All three representations were used to represent a sample Clanguage application containing race condition. In conclusion, an assessment was made, which depended on whether the representation would allow to find the phenomenon.
    Źródło:
    Zeszyty Naukowe Wydziału Elektroniki i Informatyki Politechniki Koszalińskiej; 2018, 13; 5-25
    1897-7421
    Pojawia się w:
    Zeszyty Naukowe Wydziału Elektroniki i Informatyki Politechniki Koszalińskiej
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Graphical representations of multithreaded applications
    Autorzy:
    Giebas, Damian
    Wojszczyk, Rafał
    Powiązania:
    https://bibliotekanauki.pl/articles/118235.pdf
    Data publikacji:
    2018
    Wydawca:
    Polskie Towarzystwo Promocji Wiedzy
    Tematy:
    graphical representation
    Petri nets
    Control Flow Graph
    Concurrent Process Systems
    multithreaded applications
    reprezentacja graficzna
    sieci Petriego
    wykres przepływu sterowania
    współbieżne systemy procesów
    aplikacja wielowątkowa
    Opis:
    This article contains a brief description of existing graphical methods for presenting multithreaded applications, i.e. Control Flow Graph and Petri nets. These methods will be discussed, and then a way to represent multithreaded applications using the concurrent process system model will be presented. All these methods will be used to present the idea of a multithreaded application that includes the race condition phenomenon. In the summary, all three methods will be compared and subjected to the evaluation, which will depend on whether the given representation will allow to find the mentioned phenomenon.
    Źródło:
    Applied Computer Science; 2018, 14, 2; 20-37
    1895-3735
    Pojawia się w:
    Applied Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-10 z 10

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies