The relation is a semantic expression relevant to two named entities in a sentence.Since a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes de...The relation is a semantic expression relevant to two named entities in a sentence.Since a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes dependency information specific to the two named entities.In related work,graph convolutional neural networks are widely adopted to learn semantic dependencies,where a dependency tree initializes the adjacency matrix.However,this approach has two main issues.First,parsing a sentence heavily relies on external toolkits,which can be errorprone.Second,the dependency tree only encodes the syntactical structure of a sentence,which may not align with the relational semantic expression.In this paper,we propose an automatic graph learningmethod to autonomously learn a sentence’s structural information.Instead of using a fixed adjacency matrix initialized by a dependency tree,we introduce an Adaptive Adjacency Matrix to encode the semantic dependency between tokens.The elements of thismatrix are dynamically learned during the training process and optimized by task-relevant learning objectives,enabling the construction of task-relevant semantic dependencies within a sentence.Our model demonstrates superior performance on the TACRED and SemEval 2010 datasets,surpassing previous works by 1.3%and 0.8%,respectively.These experimental results show that our model excels in the relation extraction task,outperforming prior models.展开更多
A compliant metamorphic mechanism attributes to a new type of metamorphic mechanisms evolved from rigid metamorphic mechanisms. The structural characteristics and representations of a compliant metamorphic mechanism a...A compliant metamorphic mechanism attributes to a new type of metamorphic mechanisms evolved from rigid metamorphic mechanisms. The structural characteristics and representations of a compliant metamorphic mechanism are different from its rigid counterparts, so does the structural synthesis method. In order to carry out its structural synthesis, a constraint graph representation for topological structure of compliant metamorphic mechanisms is introduced, which can not only represent the structure of a compliant metamorphic mechanism, but also describe the characteristics of its links and kinematic pairs. An adjacency matrix representation of the link relationships in a compliant metamorphic mechanism is presented according to the constraint graph. Then, a method for structural synthesis of compliant metamorphic mechanisms is proposed based on the adjacency matrix operations. The operation rules and the operation procedures of adjacency matrices are described through synthesis of the initial configurations composed of s+1 links from an s-link mechanism (the final configuration). The method is demonstrated by synthesizing all the possible four-link compliant metamorphic mechanisms that can transform into a three-link mechanism through combining two of its links. Sixty-five adjacency matrices are obtained in the synthesis, each of which corresponds to a compliant metamorphic mechanism having four links. Therefore, the effectiveness of the method is validated by a specific compliant metamorphic mechanism corresponding to one of the sixty-five adjacency matrices. The structural synthesis method is put into practice as a fully compliant metamorphic hand is presented based on the synthesis results. The synthesis method has the advantages of simple operation rules, clear geometric meanings, ease of programming with matrix operation, and provides an effective method for structural synthesis of compliant metamorphic mechanisms and can be used in the design of new compliant metamorphic mechanisms.展开更多
The adjacency matrix operations,which connect with configuration transformation correspondingly,can be used for analysis of configuration transformation of metamorphic mechanisms and the corresponding algorithm can ea...The adjacency matrix operations,which connect with configuration transformation correspondingly,can be used for analysis of configuration transformation of metamorphic mechanisms and the corresponding algorithm can easily be simulated by computer.But the adjacency matrix based on monochrome topological graph is not suitable for the topological representation of mechanisms with multiple joints.The method of adjacency matrix operations has its own limitations for analysis of configuration transformation of metamorphic mechanisms because it can only be used in the topological representation of mechanisms with single joints.In order to overcome the drawback of the adjacency matrix,a kind of new matrix named as extended adjacency matrix is proposed to express topological structures of all mechanisms.The extended adjacency matrix is not only suitable for the topological representation of mechanisms with single joints,but also can be used in that of mechanisms with multiple joints.On this basis,a method of matrix operations based on the extended adjacency matrix is proposed to analyze the configuration transformation of metamorphic mechanisms.The method is not only suitable for configuration analysis of metamorphic mechanisms with single joints as well as metamorphic mechanisms with multiple joints.The method is evaluated by calculating two examples representing metamorphic mechanisms with single joint and multiple joints respectively.It can be concluded that the method is effective and correct for analysis of configuration transformation of all metamorphic mechanisms.The proposed method is simple and easy to be achieved by computer programming.It provides a basis for structural synthesis of all metamorphic mechanisms.展开更多
This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, ...This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, an effective way for building and drawing weighted directed graphs is presented, forming a foundation for visual implementation of the algorithm in the graph theory.展开更多
In order to discover the probability distribution feature of edge in aviation network adjacent matrix of China and on the basis of this feature to establish an algorithm of searching non-overlap community structure in...In order to discover the probability distribution feature of edge in aviation network adjacent matrix of China and on the basis of this feature to establish an algorithm of searching non-overlap community structure in network to reveal the inner principle of complex network with the feature of small world in aspect of adjacent matrix and community structure,aviation network adjacent matrix of China was transformed according to the node rank and the matrix was arranged on the basis of ascending node rank with the center point as original point.Adjacent probability from the original point to extension around in approximate area was calculated.Through fitting probability distribution curve,power function of probability distribution of edge in adjacent matrix arranged by ascending node rank was found.According to the feature of adjacent probability distribution,deleting step by step with node rank ascending algorithm was set up to search non-overlap community structure in network and the flow chart of algorithm was given.A non-overlap community structure with 10 different scale communities in aviation network of China was found by the computer program written on the basis of this algorithm.展开更多
“一星多用、多星组网、多网协同”思想的发展与应用为卫星互联网的关键节点识别带来了更多的挑战,也提出了更高的要求。针对卫星时序网络节点评估结果不准确的问题,考虑了不同时间片拓扑之间的耦合强度,提出了一种基于改进超邻接矩阵(s...“一星多用、多星组网、多网协同”思想的发展与应用为卫星互联网的关键节点识别带来了更多的挑战,也提出了更高的要求。针对卫星时序网络节点评估结果不准确的问题,考虑了不同时间片拓扑之间的耦合强度,提出了一种基于改进超邻接矩阵(supra-adjacency matrix,SAM)的卫星互联网时序网络模型。随后,综合卫星节点在网络中固有的拓扑特性和通信特性,选取特征向量中心性、介数中心性、节点紧密度、传输时延、传输速率和传输容量指标建立了节点重要度综合评估指标体系,在此基础上,基于熵权-逼近理想解排序法(technique for order preference by similarity to an ideal solution,TOPSIS)和时间权重矩阵设计了卫星互联网节点重要度评估方法。通过ARPANET和铱星星座进行仿真验证,实验结果证明了所提出的模型和方法能够准确地从局部和全局角度获得卫星节点重要度排序,并识别出潜在重要节点,对卫星互联网关键节点识别及抗毁性研究有一定的参考意义。展开更多
基金supported by the Technology Projects of Guizhou Province under Grant[2024]003National Natural Science Foundation of China(GrantNos.62166007,62066008,62066007)Guizhou Provincial Science and Technology Projects under Grant No.ZK[2023]300.
文摘The relation is a semantic expression relevant to two named entities in a sentence.Since a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes dependency information specific to the two named entities.In related work,graph convolutional neural networks are widely adopted to learn semantic dependencies,where a dependency tree initializes the adjacency matrix.However,this approach has two main issues.First,parsing a sentence heavily relies on external toolkits,which can be errorprone.Second,the dependency tree only encodes the syntactical structure of a sentence,which may not align with the relational semantic expression.In this paper,we propose an automatic graph learningmethod to autonomously learn a sentence’s structural information.Instead of using a fixed adjacency matrix initialized by a dependency tree,we introduce an Adaptive Adjacency Matrix to encode the semantic dependency between tokens.The elements of thismatrix are dynamically learned during the training process and optimized by task-relevant learning objectives,enabling the construction of task-relevant semantic dependencies within a sentence.Our model demonstrates superior performance on the TACRED and SemEval 2010 datasets,surpassing previous works by 1.3%and 0.8%,respectively.These experimental results show that our model excels in the relation extraction task,outperforming prior models.
基金supported by National Natural Science Foundation of China (Grant No. 51075039, Grant No. 50805110,Grant No. 50705010)Beijing Municipal Natural Science Foundation of China (Grant No. 3082014)the Fundamental Research Funds for the Central Universities of China (Grant No. 2009CZ08, Grant No. JY10000904010)
文摘A compliant metamorphic mechanism attributes to a new type of metamorphic mechanisms evolved from rigid metamorphic mechanisms. The structural characteristics and representations of a compliant metamorphic mechanism are different from its rigid counterparts, so does the structural synthesis method. In order to carry out its structural synthesis, a constraint graph representation for topological structure of compliant metamorphic mechanisms is introduced, which can not only represent the structure of a compliant metamorphic mechanism, but also describe the characteristics of its links and kinematic pairs. An adjacency matrix representation of the link relationships in a compliant metamorphic mechanism is presented according to the constraint graph. Then, a method for structural synthesis of compliant metamorphic mechanisms is proposed based on the adjacency matrix operations. The operation rules and the operation procedures of adjacency matrices are described through synthesis of the initial configurations composed of s+1 links from an s-link mechanism (the final configuration). The method is demonstrated by synthesizing all the possible four-link compliant metamorphic mechanisms that can transform into a three-link mechanism through combining two of its links. Sixty-five adjacency matrices are obtained in the synthesis, each of which corresponds to a compliant metamorphic mechanism having four links. Therefore, the effectiveness of the method is validated by a specific compliant metamorphic mechanism corresponding to one of the sixty-five adjacency matrices. The structural synthesis method is put into practice as a fully compliant metamorphic hand is presented based on the synthesis results. The synthesis method has the advantages of simple operation rules, clear geometric meanings, ease of programming with matrix operation, and provides an effective method for structural synthesis of compliant metamorphic mechanisms and can be used in the design of new compliant metamorphic mechanisms.
基金supported by National Natural Science Foundation of China (Grant No. 51075039, Grant No. 50705010)Beijing Municipal Natural Science Foundation of China (Grant No. 3082014, Grant No.3053017)Fundamental Research Funds for the Central Universities of China (Grant No. 2009CZ08)
文摘The adjacency matrix operations,which connect with configuration transformation correspondingly,can be used for analysis of configuration transformation of metamorphic mechanisms and the corresponding algorithm can easily be simulated by computer.But the adjacency matrix based on monochrome topological graph is not suitable for the topological representation of mechanisms with multiple joints.The method of adjacency matrix operations has its own limitations for analysis of configuration transformation of metamorphic mechanisms because it can only be used in the topological representation of mechanisms with single joints.In order to overcome the drawback of the adjacency matrix,a kind of new matrix named as extended adjacency matrix is proposed to express topological structures of all mechanisms.The extended adjacency matrix is not only suitable for the topological representation of mechanisms with single joints,but also can be used in that of mechanisms with multiple joints.On this basis,a method of matrix operations based on the extended adjacency matrix is proposed to analyze the configuration transformation of metamorphic mechanisms.The method is not only suitable for configuration analysis of metamorphic mechanisms with single joints as well as metamorphic mechanisms with multiple joints.The method is evaluated by calculating two examples representing metamorphic mechanisms with single joint and multiple joints respectively.It can be concluded that the method is effective and correct for analysis of configuration transformation of all metamorphic mechanisms.The proposed method is simple and easy to be achieved by computer programming.It provides a basis for structural synthesis of all metamorphic mechanisms.
基金Project supported by Science Foundation of Shanghai MunicipalConmission of Education (Grant No .03A203)
文摘This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, an effective way for building and drawing weighted directed graphs is presented, forming a foundation for visual implementation of the algorithm in the graph theory.
基金National Natural Science Foundation of China(71971017).
文摘In order to discover the probability distribution feature of edge in aviation network adjacent matrix of China and on the basis of this feature to establish an algorithm of searching non-overlap community structure in network to reveal the inner principle of complex network with the feature of small world in aspect of adjacent matrix and community structure,aviation network adjacent matrix of China was transformed according to the node rank and the matrix was arranged on the basis of ascending node rank with the center point as original point.Adjacent probability from the original point to extension around in approximate area was calculated.Through fitting probability distribution curve,power function of probability distribution of edge in adjacent matrix arranged by ascending node rank was found.According to the feature of adjacent probability distribution,deleting step by step with node rank ascending algorithm was set up to search non-overlap community structure in network and the flow chart of algorithm was given.A non-overlap community structure with 10 different scale communities in aviation network of China was found by the computer program written on the basis of this algorithm.
文摘“一星多用、多星组网、多网协同”思想的发展与应用为卫星互联网的关键节点识别带来了更多的挑战,也提出了更高的要求。针对卫星时序网络节点评估结果不准确的问题,考虑了不同时间片拓扑之间的耦合强度,提出了一种基于改进超邻接矩阵(supra-adjacency matrix,SAM)的卫星互联网时序网络模型。随后,综合卫星节点在网络中固有的拓扑特性和通信特性,选取特征向量中心性、介数中心性、节点紧密度、传输时延、传输速率和传输容量指标建立了节点重要度综合评估指标体系,在此基础上,基于熵权-逼近理想解排序法(technique for order preference by similarity to an ideal solution,TOPSIS)和时间权重矩阵设计了卫星互联网节点重要度评估方法。通过ARPANET和铱星星座进行仿真验证,实验结果证明了所提出的模型和方法能够准确地从局部和全局角度获得卫星节点重要度排序,并识别出潜在重要节点,对卫星互联网关键节点识别及抗毁性研究有一定的参考意义。