Unit Graphs
Reasoning with Dependency Structures and Lexicographic Definitions using Unit Graphs
... conceptual graphs appear to be suitable for this task, and this led to the introduction of the new Unit Graphs (UG) ...of unit types which is strongly driven by the actantial structure of ...
11
The Unit Graphs Framework: Foundational Concepts and Semantic Consequence
... graph-based Unit Graphs KR ...by unit types, and are described in a unit types hierar- ...of unit identifiers these two structures form a UGs support on which UGs may be ...
8
Rationale, Concepts, and Current Outcome of the Unit Graphs Framework
... The Unit Graphs (UGs) framework is a graph-based knowledge representation (KR) formalism that is designed to al- low for the representation, manipula- tion, query, and reasoning over linguis- tic knowledge ...
8
Application of the Unit Graphs Framework to Lexicographic Definitions in the RELIEF project
... The Unit Graphs (UGs) framework is a graph-based knowledge representation (KR) formalism that is designed to allow for the representation, manipulation, query, and reasoning over lin- guistic knowledge of ...
11
The Unit Graphs Framework: A new graph-based Knowledge Representation Formalism for ECD Knowledge Representation
... Conceptual Graphs Formalism are suitable for this task, and we justify the introduction of the new Unit Graphs ...of unit types driven by their ac- tantial ...semantic unit types may ...
11
The Unit Graphs Mathematical Framework
... Conceptual Graphs Formalism are suitable for this task, and we justify the introduction of the new Unit Graphs (UGs) ...the Unit Types hierarchy and the Unit ...
71
Decomposing Berge graphs
... Theorem 1.2 (Chudnovsky, Robertson, Seymour and Thomas, 2002, [4]) Let G be a Berge graph. Then either G is basic or G has an homogeneous pair, of G has an even skew partition or one of G, G has a proper 2-join. The two ...
51
EOLES project...teaching unit experiences
... The project joins the expertise of the European partners in such areas as e-Learning 2.0 tools and simulation tools, and virtual and remote labs, with the priorities define[r] ...
6
Contraction and deletion blockers for perfect graphs and H-free graphs
... G = (R∪B, E) and an integer k, and asks whether there exists a red-blue dominating set of size at most k, that is, a subset D ⊆ B of at most k vertices such that every vertex in R has at least one neighbour in D. This ...
34
On wheel-free graphs
... In a wheel-free graph, any vertex v with three neighbors x, y, z is such that deleting v results in a graph where no cycle goes through x, y, z. In Section 5, we recall a theorem due to Watkins and Mesner [17], that ...
30
A Bicycle Electric Assist Unit
... Strain-gauge based torque sensors in the motor casing: Because the motor casing only experi- ences the motor's torque at the outer edges of the casing, it is possi[r] ...
68
French intensive care unit organisation
... [19] Jabaudon M, Belhadj-Tahar N, Rimmele´ T, Joannes-Boyau O, Bulyez S, Lefrant JY, et al. Thoracic epidural analgesia and mortality in acute pancreatitis: a multicenter propensity analysis. Crit Care Med ...
4
Components as Location Graphs
... location graphs are entirely dynamic, in the sense that they can evolve as side effects of process transitions taking place in nodes of the graphs, ...
21
BlastGraph: intensive approximate pattern matching in string graphs and de-Bruijn graphs
... guillaumeholley@gmail.com, pierre.peterlongo@inria.fr Abstract. Many de novo assembly tools have been created these last few years to assemble short reads generated by high throughput sequencing platforms. The core of ...
14
Stochastic Minority on Graphs
... 2 Institut des Syst` emes Complexes Rhˆ one-Alpes (IXXI) 3 CNRS, LIAFA, Universit´ e Paris 7, France Abstract. Cellular automata have been mainly studied on very regular graphs car- rying the cells (like lines or ...
21
Simple dynamics on graphs
... A digraph is symmetric if for every arc (u, v), (v, u) is also an arc. We see (undirected) graphs as loop-less symmetric digraphs. Thus the complete graph on n vertices, denoted K n , is the loop-less digraph ...
22
Spy-Game on graphs
... Given a graph G and two integers d, s ∈ N, s > 0, let the guard-number, denoted by gns,d (G), be the minimum number of guards required to control a spy with speed s at distance d, aga[r] ...
14
Sparse broadcast graphs
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
35
Deep learning on attributed graphs
... sets, graphs can model the context of spatial data ...neighborhood graphs constructed from point clouds express only geometric information, polygonal meshes additionally capture topological constraints ...
128
Perfectness of clustered graphs
... selective-perfect graphs as being a class that we call i-threshold graphs since it is a super-class of threshold graphs defined with complex numbers in R ∪ {−i, +i} instead of real ones ...threshold ...
14