In 2012, Ponraj et al. defined a concept of k-product cordial labeling as follows: Let f be a map from V(G)to { 0,1,⋯,k−1 }where k is an integer, 1≤k≤| V(G) |. For each edge uvassign the label f(u)f(v)(modk). f is c...In 2012, Ponraj et al. defined a concept of k-product cordial labeling as follows: Let f be a map from V(G)to { 0,1,⋯,k−1 }where k is an integer, 1≤k≤| V(G) |. For each edge uvassign the label f(u)f(v)(modk). f is called a k-product cordial labeling if | vf(i)−vf(j) |≤1, and | ef(i)−ef(j) |≤1, i,j∈{ 0,1,⋯,k−1 }, where vf(x)and ef(x)denote the number of vertices and edges respectively labeled with x (x=0,1,⋯,k−1). Motivated by this concept, we further studied and established that several families of graphs admit k-product cordial labeling. In this paper, we show that the path graphs Pnadmit k-product cordial labeling.展开更多
According to the characteristic and the requirement of multipath planning, a new multipath planning method is proposed based on network. This method includes two steps： the construction of network and multipath searc...According to the characteristic and the requirement of multipath planning, a new multipath planning method is proposed based on network. This method includes two steps： the construction of network and multipath searching. The construction of network proceeds in three phases： the skeleton extraction of the configuration space, the judgment of the cross points in the skeleton and how to link the cross points to form a network. Multipath searching makes use of the network and iterative penalty method （IPM） to plan multi-paths, and adjusts the planar paths to satisfy the requirement of maneuverability of unmanned aerial vehicle （UAV）. In addition, a new height planning method is proposed to deal with the height planning of 3D route. The proposed algorithm can find multiple paths automatically according to distribution of terrain and threat areas with high efficiency. The height planning can make 3D route following the terrain. The simulation experiment illustrates the feasibility of the proposed method.展开更多
Background:Individual tree extraction from terrestrial laser scanning(TLS)data is a prerequisite for tree-scale estimations of forest biophysical properties.This task currently is undertaken through laborious and time...Background:Individual tree extraction from terrestrial laser scanning(TLS)data is a prerequisite for tree-scale estimations of forest biophysical properties.This task currently is undertaken through laborious and time-consuming manual assistance and quality control.This study presents a new fully automatic approach to extract single trees from large-area TLS data.This data-driven method operates exclusively on a point cloud graph by path finding,which makes our method computationally efficient and universally applicable to data from various forest types.Results:We demonstrated the proposed method on two openly available datasets.First,we achieved state-of-the-art performance on locating single trees on a benchmark dataset by significantly improving the mean accuracy by over 10% especially for difficult forest plots.Second,we successfully extracted 270 trees from one hectare temperate forest.Quantitative validation resulted in a mean Intersection over Union(mIoU)of 0.82 for single crown segmentation,which further led to a relative root mean square error(RMSE%)of 21.2% and 23.5% for crown area and tree volume estimations,respectively.Conclusions:Our method allows automated access to individual tree level information from TLS point clouds.The proposed method is free from restricted assumptions of forest types.It is also computationally efficient with an average processing time of several seconds for one million points.It is expected and hoped that our method would contribute to TLS-enabled wide-area forest qualifications,ranging from stand volume and carbon stocks modelling to derivation of tree functional traits as part of the global ecosystem understanding.展开更多
In this paper, a new method has been introduced to find the most vulnerable lines in the system dynamically in an interconnected power system to help with the security and load flow analysis in these networks. Using t...In this paper, a new method has been introduced to find the most vulnerable lines in the system dynamically in an interconnected power system to help with the security and load flow analysis in these networks. Using the localization of power networks, the power grid can be divided into several divisions of sub-networks in which, the connection of the elements is stronger than the elements outside of that division. By using our proposed method, the probable important lines in the network can be identified to do the placement of the protection apparatus and planning for the extra extensions in the system. In this paper, we have studied the pathfinding strategies in most vulnerable line detection in a partitioned network. The method has been tested on IEEE39-bus system which is partitioned using hierarchical spectral clustering to show the feasibility of the proposed method.展开更多
We say that a parameter p of directed graphs has the interval property if for every graph G?and orientations of G, p can take every value between its minimum and maximum values. Let λbe the length of the lo...We say that a parameter p of directed graphs has the interval property if for every graph G?and orientations of G, p can take every value between its minimum and maximum values. Let λbe the length of the longest directed path. A question asked by C. Lin in [1] is equivalent to the question of whether λhas the interval property. In this note, we answer this question in the affirmative. We also show that the diameter of directed graphs does not have the interval property.展开更多
A graph labeling is the assigning of labels to the vertices, edges, or both (usually non-negative integers), often satisfying some prescribed requirements. This terminology has become standard. A graph G's edges c...A graph labeling is the assigning of labels to the vertices, edges, or both (usually non-negative integers), often satisfying some prescribed requirements. This terminology has become standard. A graph G's edges can be colored by assigning a different color to each of its edges. The edge coloring is appropriate if adjacent edges are given different colors. In this work, we introduce a new labeling called NK-labeling. Let c:E(G)→ℕbe a proper edge coloring of G which induces a proper vertex coloring c′:V(G)→ℤndefined by c′(v)≡∑e∈Evc(e)modnSuch that Evis the set of edges incident with vin G. The minimum positive integer for which the graph G has NK-labeling called NK-chromatic index and denoted by χ′NK(G). We study the NK-labeling of several well-known classes of graphs. It is shown that the NK-chromatic of the path Pnfor n≥4is three and for odd n, the NK-chromatic of the complete graph Knis n. Other results dealing with the NK-labeling are also presented.展开更多
[目的/意义]引文网络的主路径分析可以对特定领域的重要文献进行识别,并能实现主流研究线索提取。文章旨在利用主路径分析方法,对知识图谱的研究路径进行分析,梳理其研究发展的脉络。[方法/过程]文章首先从Web of Science平台获取知识...[目的/意义]引文网络的主路径分析可以对特定领域的重要文献进行识别,并能实现主流研究线索提取。文章旨在利用主路径分析方法,对知识图谱的研究路径进行分析,梳理其研究发展的脉络。[方法/过程]文章首先从Web of Science平台获取知识图谱领域的研究论文,然后利用HistCite软件生成文献的直接引证网络,再将数据导入到Pajek中,生成该数据集的多条主路径,并结合主路径上论文的内容进行定性分析。[结果/结论]通过主路径分析,可以快速识别出知识图谱领域的一些主路径,如知识图谱的构建、知识图谱在推荐和问答等应用场景中的研究、知识图谱在制造业等特定应用领域的应用研究,折射出知识图谱技术的发展脉络和研究方向。综述性研究在知识图谱领域的发展中扮演了重要角色,为领域内的深入研究提供了基础和方向。展开更多
异质图是由不同类型节点及边构成的图,可建模现实世界中各种类型对象及其关系。异质图嵌入旨在捕捉图中丰富的属性、结构和语义等信息,学习节点嵌入向量,用于节点分类、链接预测等任务,进而实现用户识别、商品推荐等应用。在异质图嵌入...异质图是由不同类型节点及边构成的图,可建模现实世界中各种类型对象及其关系。异质图嵌入旨在捕捉图中丰富的属性、结构和语义等信息,学习节点嵌入向量,用于节点分类、链接预测等任务,进而实现用户识别、商品推荐等应用。在异质图嵌入方法中,元路径通常被用来获取节点间的高阶结构和语义信息,然而现有方法忽略了元路径实例中不同类型节点或异质图中不同类型邻居节点的差异,导致信息丢失,进而影响节点嵌入质量。针对上述问题,提出基于数据增强的异质图注意力网络(Heterogeneous graph Attention Network based on Data Augmentation,HANDA),以更好地学习节点嵌入向量。首先,提出基于元路径邻居的边增强。该方法基于元路径获取节点的元路径邻居,用节点及其元路径邻居形成的语义边增强异质图。这些增强边不仅蕴含了节点间的高阶结构和语义,还缓解了异质图的稀疏性。其次,提出融入节点类型注意力的节点嵌入。该方法采用多头注意力从多个角度学习不同直接边邻居及增强边邻居的重要性并在注意力中融入节点的类型信息,进而通过消息传递、直接边邻居及增强边邻居同时获取节点的属性、高阶结构和语义信息,提升了节点嵌入质量。在真实数据集上的实验验证了HANDA模型在节点分类、链接预测任务上的效果优于基准模型。展开更多
文摘In 2012, Ponraj et al. defined a concept of k-product cordial labeling as follows: Let f be a map from V(G)to { 0,1,⋯,k−1 }where k is an integer, 1≤k≤| V(G) |. For each edge uvassign the label f(u)f(v)(modk). f is called a k-product cordial labeling if | vf(i)−vf(j) |≤1, and | ef(i)−ef(j) |≤1, i,j∈{ 0,1,⋯,k−1 }, where vf(x)and ef(x)denote the number of vertices and edges respectively labeled with x (x=0,1,⋯,k−1). Motivated by this concept, we further studied and established that several families of graphs admit k-product cordial labeling. In this paper, we show that the path graphs Pnadmit k-product cordial labeling.
基金supported by the National High Technology Research and Development Program of China(2007AA12Z166)
文摘According to the characteristic and the requirement of multipath planning, a new multipath planning method is proposed based on network. This method includes two steps： the construction of network and multipath searching. The construction of network proceeds in three phases： the skeleton extraction of the configuration space, the judgment of the cross points in the skeleton and how to link the cross points to form a network. Multipath searching makes use of the network and iterative penalty method （IPM） to plan multi-paths, and adjusts the planar paths to satisfy the requirement of maneuverability of unmanned aerial vehicle （UAV）. In addition, a new height planning method is proposed to deal with the height planning of 3D route. The proposed algorithm can find multiple paths automatically according to distribution of terrain and threat areas with high efficiency. The height planning can make 3D route following the terrain. The simulation experiment illustrates the feasibility of the proposed method.
基金partially funded by the Scientific Research Foundation of Xidian Universitypart of 3DForMod project(ANR-17-EGAS-0002-01)funded in the frame of the JPI FACCE ERA-GAS call funded under European Union’s Horizon 2020 research and innovation program(grant agreement No.696356).
文摘Background:Individual tree extraction from terrestrial laser scanning(TLS)data is a prerequisite for tree-scale estimations of forest biophysical properties.This task currently is undertaken through laborious and time-consuming manual assistance and quality control.This study presents a new fully automatic approach to extract single trees from large-area TLS data.This data-driven method operates exclusively on a point cloud graph by path finding,which makes our method computationally efficient and universally applicable to data from various forest types.Results:We demonstrated the proposed method on two openly available datasets.First,we achieved state-of-the-art performance on locating single trees on a benchmark dataset by significantly improving the mean accuracy by over 10% especially for difficult forest plots.Second,we successfully extracted 270 trees from one hectare temperate forest.Quantitative validation resulted in a mean Intersection over Union(mIoU)of 0.82 for single crown segmentation,which further led to a relative root mean square error(RMSE%)of 21.2% and 23.5% for crown area and tree volume estimations,respectively.Conclusions:Our method allows automated access to individual tree level information from TLS point clouds.The proposed method is free from restricted assumptions of forest types.It is also computationally efficient with an average processing time of several seconds for one million points.It is expected and hoped that our method would contribute to TLS-enabled wide-area forest qualifications,ranging from stand volume and carbon stocks modelling to derivation of tree functional traits as part of the global ecosystem understanding.
文摘In this paper, a new method has been introduced to find the most vulnerable lines in the system dynamically in an interconnected power system to help with the security and load flow analysis in these networks. Using the localization of power networks, the power grid can be divided into several divisions of sub-networks in which, the connection of the elements is stronger than the elements outside of that division. By using our proposed method, the probable important lines in the network can be identified to do the placement of the protection apparatus and planning for the extra extensions in the system. In this paper, we have studied the pathfinding strategies in most vulnerable line detection in a partitioned network. The method has been tested on IEEE39-bus system which is partitioned using hierarchical spectral clustering to show the feasibility of the proposed method.
文摘We say that a parameter p of directed graphs has the interval property if for every graph G?and orientations of G, p can take every value between its minimum and maximum values. Let λbe the length of the longest directed path. A question asked by C. Lin in [1] is equivalent to the question of whether λhas the interval property. In this note, we answer this question in the affirmative. We also show that the diameter of directed graphs does not have the interval property.
文摘A graph labeling is the assigning of labels to the vertices, edges, or both (usually non-negative integers), often satisfying some prescribed requirements. This terminology has become standard. A graph G's edges can be colored by assigning a different color to each of its edges. The edge coloring is appropriate if adjacent edges are given different colors. In this work, we introduce a new labeling called NK-labeling. Let c:E(G)→ℕbe a proper edge coloring of G which induces a proper vertex coloring c′:V(G)→ℤndefined by c′(v)≡∑e∈Evc(e)modnSuch that Evis the set of edges incident with vin G. The minimum positive integer for which the graph G has NK-labeling called NK-chromatic index and denoted by χ′NK(G). We study the NK-labeling of several well-known classes of graphs. It is shown that the NK-chromatic of the path Pnfor n≥4is three and for odd n, the NK-chromatic of the complete graph Knis n. Other results dealing with the NK-labeling are also presented.
文摘[目的/意义]引文网络的主路径分析可以对特定领域的重要文献进行识别,并能实现主流研究线索提取。文章旨在利用主路径分析方法,对知识图谱的研究路径进行分析,梳理其研究发展的脉络。[方法/过程]文章首先从Web of Science平台获取知识图谱领域的研究论文,然后利用HistCite软件生成文献的直接引证网络,再将数据导入到Pajek中,生成该数据集的多条主路径,并结合主路径上论文的内容进行定性分析。[结果/结论]通过主路径分析,可以快速识别出知识图谱领域的一些主路径,如知识图谱的构建、知识图谱在推荐和问答等应用场景中的研究、知识图谱在制造业等特定应用领域的应用研究,折射出知识图谱技术的发展脉络和研究方向。综述性研究在知识图谱领域的发展中扮演了重要角色,为领域内的深入研究提供了基础和方向。
文摘异质图是由不同类型节点及边构成的图,可建模现实世界中各种类型对象及其关系。异质图嵌入旨在捕捉图中丰富的属性、结构和语义等信息,学习节点嵌入向量,用于节点分类、链接预测等任务,进而实现用户识别、商品推荐等应用。在异质图嵌入方法中,元路径通常被用来获取节点间的高阶结构和语义信息,然而现有方法忽略了元路径实例中不同类型节点或异质图中不同类型邻居节点的差异,导致信息丢失,进而影响节点嵌入质量。针对上述问题,提出基于数据增强的异质图注意力网络(Heterogeneous graph Attention Network based on Data Augmentation,HANDA),以更好地学习节点嵌入向量。首先,提出基于元路径邻居的边增强。该方法基于元路径获取节点的元路径邻居,用节点及其元路径邻居形成的语义边增强异质图。这些增强边不仅蕴含了节点间的高阶结构和语义,还缓解了异质图的稀疏性。其次,提出融入节点类型注意力的节点嵌入。该方法采用多头注意力从多个角度学习不同直接边邻居及增强边邻居的重要性并在注意力中融入节点的类型信息,进而通过消息传递、直接边邻居及增强边邻居同时获取节点的属性、高阶结构和语义信息,提升了节点嵌入质量。在真实数据集上的实验验证了HANDA模型在节点分类、链接预测任务上的效果优于基准模型。
