Temat: graph representation

Skocz do pozycji: 1.

Tytuł:: Graph-based generating systems in urban space design
Autorzy:: Strug, Barbara
Ślusarczyk, Grażyna
Wydawca:: European Group for Intelligent Computing in Engineering
Opis:: In this paper a mechanism supporting the design process of urban spaces is presented. The proposed system of graph grammars allows to separate generated structures describing arrangements of city components from their shape geometry and overall appearance. A great number of unique city designs with similar layout structures can be easily obtained and then filled with previously modelled 3D components. The system of cooperating distributed grammars operates on one common attributed graph, while the communication between grammars is realized through a set of communication labels. The proposed approach is illustrated by the case study of generating a city quarter using the specified graph grammar system.
Dostawca treści:: Repozytorium Uniwersytetu Jagiellońskiego

Inne

na półce

Skocz do pozycji: 2.

Tytuł:: Clique graph representations of ptolemaic graphs
Autorzy:: McKee, Terry
Tematy:: Ptolemaic graph
clique graph
chordal graph
clique tree
graph representation; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/744102.pdf Link otwiera się w nowym oknie
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.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: Automatic design quality evaluation using graph similarity measures
Autorzy:: Strug, Barbara
Dostawca treści:: Repozytorium Uniwersytetu Jagiellońskiego

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: Using frequent subgraph mining in flat layout quality classification
Autorzy:: Strug, Barbara
Dostawca treści:: Repozytorium Uniwersytetu Jagiellońskiego

Inne

na półce

Skocz do pozycji: 5.

Tytuł:: Solving Markov decision processes by d-graph algorithms
Autorzy:: Kátai, Z.
Tematy:: Markov decision processes
dynamic programming
graph representation
graph algorithms
optimization problems; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Powiązania:: https://bibliotekanauki.pl/articles/205688.pdf Link otwiera się w nowym oknie
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.)
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 6.

Tytuł:: Knowledge graphs effectiveness in Neural Machine Translation improvement
Autorzy:: Ahmadnia, Benyamin
Dorr, Bonnie J.
Kordjamshidi, Parisa
Tematy:: natural language processing
neural machine translation
knowledge graph representation; Pokaż więcej
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Powiązania:: https://bibliotekanauki.pl/articles/1839251.pdf Link otwiera się w nowym oknie
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
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 7.

Tytuł:: On the 12-Representability of Induced Subgraphs of a Grid Graph
Autorzy:: Chen, Joanna N.
Kitaev, Sergey
Tematy:: graph representation
12-representable graph
grid graph
forbidden subgraph
square grid graph
line grid graph; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/32361728.pdf Link otwiera się w nowym oknie
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.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 8.

Tytuł:: Design characteristics and aesthetics in evolutionary design of architectural forms directed by fuzzy evaluation
Autorzy:: Grabska, Ewa
Ślusarczyk, Grażyna
Mars, Agnieszka
Strug, Barbara
Dostawca treści:: Repozytorium Uniwersytetu Jagiellońskiego

Artykuł

na półce

Skocz do pozycji: 9.

Tytuł:: A characterization of uniquely representable graphs
Autorzy:: Szabó, Péter G. N.
Tematy:: finite metric space
metric betweenness
block graph
distance-hereditary graph
graph representation; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/59897762.pdf Link otwiera się w nowym oknie
Opis:: The betweenness structure of a finite metric space $M = (X, d)$ is a pair $ \mathcal{B}(M)=(X,\beta_M) $ where $\beta_M$ is the so-called betweenness relation of $M$ that consists of point triplets $(x,y,z)$ such that $d(x, z)=d(x,y)+d(y, z)$. The underlying graph of a betweenness structure $ \mathcal{B} = (X,\beta) $ is the simple graph $ G(\mathcal{B}) = (X, E) $ where the edges are pairs of distinct points with no third point between them. A connected graph $G$ is uniquely representable if there exists a unique metric betweenness structure with underlying graph $G$. It was implied by previous works that trees are uniquely representable. In this paper, we give a characterization of uniquely representable graphs by showing that they are exactly the block graphs. Further, we prove that two related classes of graphs coincide with the class of block graphs and the class of distance-hereditary graphs, respectively. We show that our results hold not only for metric but also for almost-metric betweenness structures.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 10.

Tytuł:: A survey of different graph structures used in modeling design, engineering and computer science problems
Autorzy:: Ślusarczyk, Grażyna
Paszyńska, Anna
Strug, Barbara
Palacz, Wojciech
Wydawca:: Springer International Publishing
Opis:: The paper presents several types of graphs used to model engineering, design, and computer science problems. In the described approach, graphs are used as the representation of the knowledge related to the considered problem, while so-called graph transformations are used to model the process of solving the problem. In the paper, different types of graphs and corresponding graph transformations, as well as their application to model design, engineering, and computer science problems, are presented. The labelled, attributed, directed and undirected variants of standard graphs, composition graphs, hierarchical composition graphs, hypergraphs, hierarchical hypergraphs, layout, and hierarchical layout graphs, as well as multi-hierarchical graphs are considered. The paper presents several applications of the described graph-based approach in architectural and engineering design, computational grids, Finite Element Method computations as well as in computer games.
Dostawca treści:: Repozytorium Uniwersytetu Jagiellońskiego

Artykuł

na półce

Informacja

Wyszukujesz frazę "graph representation" wg kryterium: Temat