Knowledge Graph Embedding for Hyper-Relational Data

Knowledge graph representation has been a long standing goal of artificial intelligence. In this paper,we consider a method for knowledge graph embedding of hyper-relational data, which are commonly found in knowledge graphs. Previous models such as Trans(E, H, R) and CTrans R are either insufficient for embedding hyper-relational data or focus on projecting an entity into multiple embeddings, which might not be effective for generalization nor accurately reflect real knowledge. To overcome these issues, we propose the novel model Trans HR, which transforms the hyper-relations in a pair of entities into an individual vector, serving as a translation between them. We experimentally evaluate our model on two typical tasks—link prediction and triple classification.The results demonstrate that Trans HR significantly outperforms Trans(E, H, R) and CTrans R, especially for hyperrelational data.     

Some classes of disconnected antimagic graphs and their joins

A labeling of a graph G is a bijection from E(G) to the set {1,2,…,|E (G)| }.A labeling is antimagic if for any distinct vertices x and y,the sum of the labels on edges incident to x is different from the sum of the labels on edges incident to y.We say that a graph is antimagic if it has an antimagic labeling.Hartsfield and Ringel conjectured in 1990 that every graph other than 2 K is antimagic.In this paper,we show that the antimagic conjecture is false for the case of disconnected graphs.Furthermore,we find some classes of disconnected graphs that are antimagic and some classes of graphs whose complement are disconnected are antimagic.     

Extremal problem with respect to merrifield-simmons index and hosoya index of a class of polygonal chains

The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Ho- soya index of a graph is defined as the total number of the match- ings of the graph. In this paper, the definition of a class of po- lygonal chains is given, ordering of the polygonal chains with respect to Merrifield-Simmons index and Hosoya index are ob- tained, and their extremal graphs with respect to these two topo- logical indices are determined.     

Coarsely Invariant Hilbert Spaces over Infinite Connected Graphs

We study in this paper a Hilbert space HV associated with the coarse geometry of an infinite connected graph X(V,E) with vertex set V and edge set E. We show that X( V, E) is uniformly expanding if and only if l2( V) can be continuously included in HV as a closed subspace, and that the inner product structure of HV is topologically invariant under uniform coarsening of the graph. We also discuss the functorial properties of these Hilbert spaces.     

The （△ ＋ 2,2）-incidence coloring of outerplanar graphs

An incidence coloring of graph G is a coloring of its incidences in which neighborly incidences are assigned different colors. In this paper, the incidence coloring of outerplanar graphs is discussed using the techniques of exchanging colors and the double inductions from the aspect of configuration property. Results show that there exists a （△ ＋ 2,2）-incidence coloring in every outerplanar graph, where A is the maximum degree of outerplanar graph.     

Saturation Number for Linear Forest 2P_3∪tP_2

For a fixed graph F,a graph G is F-saturated if it has no F as a subgraph,but does contain F after the addition of any new edge.The saturation number,sat(n,F),is the minimum number of edges of a graph in the set of all F-saturated graphs with order n.In this paper,we determine the saturation number sat(n,2 P_3∪tP_2)and characterize the extremal graphs for n≥6 t+8.     

Causal Inference in Graph-Text Constellations:Designing Verbally Annotated Graphs

Multimodal documents combining language and graphs are wide-spread in print media as well as in electronic media.One of the most important tasks to be solved in comprehending graph-text combinations is construction of causal chains among the meaning entities provided by modalities.In this study we focus on the role of annotation position and shape of graph lines in simple line graphs on causal attributions concerning the event presented by the annotation and the processes (i.e.increases and decreases) and states (no-changes) in the domain value of the graphs presented by the process-lines and state-lines.Based on the experimental investigation of readers’ inferences under different conditions,guidelines for the design of multimodal documents including text and statistical information graphics are suggested.One suggestion is that the position and the number of verbal annotations should be selected appropriately,another is that the graph line smoothing should be done cautiously.     

A-Spectra and Q-Spectra of Two Classes of Corona Graphs

It is well known that graph spectra store a lot of structural information about a graph,and it is more difficult to compute the spectra of corona graphs. In this paper two classes of new corona graphs,the corona-vertex of the subdivision graph G1◇G2and corona-edge of the subdivision graph G1☆G2were defined. Then,by using the coronal of a graph and some knowledge of linear algebra,the adjacency spectra and the signless Laplacian spectra of the two new graphs were explicitly computed in terms of the corresponding spectra of G1 and G2. As the application,some Aintegral graphs were constructed.     

Extracting multiple layers from data having graph structures

Much data such as geometric image data and drawings have graph structures. Such data are called graph structured data. In order to manage efficiently such graph structured data, we need to analyze and abstract graph structures of such data. The purpose of this paper is to find knowledge representations which indicate plural abstractions of graph structured data. Firstly, we introduce a term graph as a graph pattern having structural variables,and a substitution over term graphs which is graph rewriting system. Next,for a graph G,we define a multiple layer (g,（θ1, …,θk)) of G as a pair of a term graph g and a list of 4 substitutionsθ1, …,θk such that G can be obtained from g by applying substitutions θ1, …,θk to g. In the same way,for a set S of graphs, we also define a multiple layer for Sas a pair (D,@) of a set 5 of term graphs and a list 6 of substitutions. Secondly,for a graph G and a set S of graphs,we present effective algorithms for extracting minimal multiple layers of G and S which give us stratifying abstractions of G and S,respectively. Finally,we report experimental results obtained by applying our algorithms to both artificial data and drawings of power plants which are real world data.     

Semantic Relation Annotation for Biomedical Text Mining Based on Recursive Directed Graph

In this paper we propose a novel model "recursive directed graph" based on feature structure, and apply it to represent the semantic relations of postpositive attributive structures in biomedical texts. The usages of postpositive attributive are complex and variable, especially three categories: present participle phrase, past participle phrase, and preposition phrase as postpositive attributive, which always bring the difficulties of automatic parsing. We summarize these categories and annotate the semantic information. Compared with dependency structure, feature structure, being recursive directed graph, enhances semantic information extraction in biomedical field. The annotation results show that recursive directed graph is more suitable to extract complex semantic relations for biomedical text mining.     

基于环的左理想半群生成的凯莱图（英文）

We investigate the interaction between a ring R and the Cayley graph Cay(L(R)) of the semigroup of left ideals of R,as well as subdigraphs of this graph. Graph theoretic properties of these graphs are investigated,such as transitive closure,girth,radius,diameter,and spanning subgraphs.Conditions on certain of these graphs are given which imply that R is regular,left duo,or that the idempotents of R are central. We characterize simple rings in terms of Cay(L(R)). We characterize strongly regular rings in terms of a subdigraph of Cay(L(R)).     

2p2阶4度Cayley图

Cayley图Cay(G,S)称之为正规的,如果G的右正则表示R(G)是Cay(G,S)全自同构群的正规子群。决定了2p2(p为奇素数)阶群上4度连通1-正则Cayley图的正规性。     

拟二面体群的一个无限类1-正则4度Cayley图

群G的一个Cayley图X=Cay(G,S)称为正规的,如果右乘变换群R(G)在Aut(X)中正规.得到了拟二面体群G＝〈x,y|x2m=y2=1,xy=xm 1〉(其中m=2s,s为大于4的偶数)的一个无限类4度正规1-正则Cayley图 Cay(G,S),其中S={x,x-1,xs 1y,xs-1y},并且对2r阶拟二面体群的正规1-正则4度Cayley图进行了分类,其中r＞3.证明了2r阶拟二面体群的任意4度正规1-正则Cayley图同构于Cay(G,{x,x-1,xs 1y,xs-1y}),其中s=2r-2.     

Von Neumann正则环上的零因子图

讨论了一般Von Neumann正则环上的零因子图结构,重点刻画了其连通性和顶点性质.若R是有单位元的正则环,则其零因子图Γ(R)连通当且仅当R是直有限的;若R是无单位元的正则环,则其零因子图Γ(R)连通当且仅当R无真的单边恒等元;若R是满足|R|≥ 5的正则环,则其零因子图Γ(R)的源点和收点可以刻画为Sour(R)={a∈R|a是右可逆的但左不可逆},Sink(R)={a∈R|a是左可逆的但右不可逆}.     

关于拟duo-环的正则性

主要用P-V-环刻画了拟duo-环的正则性,证明了如果R是左拟duo-环,则以下等价:(1)R是强正则环;(2)R是半交换左P-V-环;(3)R是2-素的左P-V-环.     

SF'-环的正则性

目的 环R的每一个单奇异的左(右)R-模是平坦的,则称R是左(右)SF'-环,文章研究SF'-环的正则性.方法 在幂等元是左半中心的和LANE-环的条件下讨论SF'-环.结果 得到了SF'-环是强正则环的两个充要条件:(1)R是左SF'-环,如果R/Z(RR)是约化的,则R是强正则环;(2)R是强正则环当且仅当R是满足幂等元左半中心的左SF'-环,且R是LANE-环.结论 这些结果对于解决SF-环是否是正则环有一定意义.     

正则图Cartesian积的线图的秩

设G是一个顶点为n,度为r的正则图,那么它的边为m=1/2nr.G线图是顶点为m,度为（2r-2）,边为1/2nr（r-1）的正则图,本文研究两个正则图或强正则图的Cartesian积图的线图的秩,得到了许多结果,推广了G．J．Davis,G．S．Domke等人的结论．     

SF′-环的正则性

目的环R的每一个单奇异的左（右）R-模是平坦的,则称R是左（右）SF′-环,文章研究SF′。环的正则性。方法在幂等元是左半中心的和LANE-环的条件下讨论SF′-环。结果得到了SF′-环是强正则环的两个充要条件：（1）R是左SF′-环,如果R／Z（RR）是约化的,则R是强正则环;（2）R是强正则环当且仅当R是满足幂等元左半中心的左SF′-环,且R是LANE-环。结论这些结果对于解决SF-环是否是正则环有一定意义。     

关于素中心的正则环

如果Ｒ是具有素中心的环,则Ｒ是ＳＦ－环,当且仅当Ｒ是正则环,也肖且仅当Ｒ是强正则环。这成立的充要条件是对每个平坦左Ｒ－模Ｍ及φ∈ＥｎｄＲＭ,Ｓｏｃ（Ｍ／Ｉｍφ）是平坦。我们同时证明了若正则环Ｒ具有素中心,则所有单左（右）Ｒ－模是内射的。     

单位正则环和SF-环

环 R 称为左SF-环,如果每个单左 R- 模是平坦的.众所周知,单位正则环是SF-环,但SF-环是否为单位正则却未有结果.本文主要研究左SF-环成为单位正则环的条件及在一定条件下SF-环与单位正则环的等价性.