Identifying associations between microRNAs(miRNAs)and diseases is very important to understand the occurrence and development of human diseases.However,these existing methods suffer from the following limitation:first...Identifying associations between microRNAs(miRNAs)and diseases is very important to understand the occurrence and development of human diseases.However,these existing methods suffer from the following limitation:first,some disease-related miRNAs are obtained from the miRNA functional similarity networks consisting of heterogeneous data sources,i.e.,disease similarity,protein interaction network,gene expression.Second,little approaches infer disease-related miRNAs depending on the network topological features without the functional similarity of miRNAs.In this paper,we develop a novel model of Integrating Network Topology Similarity and MicroRNA Function Similarity(INTS-MFS).The integrated miRNA similarities are calculated based on miRNA functional similarity and network topological characteristics.INTS-MFS obtained AUC of 0.872 based on five-fold cross-validation and was applied to three common human diseases in case studies.As a results,30 out of top 30 predicted Prostatic Neoplasm-related miRNAs were included in the two databases of dbDEMC and PhenomiR2.0.29 out of top 30 predicted Lung Neoplasm-related miRNAs and Breast Neoplasm-related miRNAs were included in dbDEMC,PhenomiR2.0 and experimental reports.Moreover,INTS-MFS found unknown association with hsa-mir-371a in breast cancer and lung cancer,which have not been reported.It provides biologists new clues for diagnosing breast and lung cancer.展开更多
The purpose of this paper is to extend the concept topological entropy to nonautonomous linear systems. Next, we shall give estimation of the topological entropy for the class of bounded linear equations on Rn. Finall...The purpose of this paper is to extend the concept topological entropy to nonautonomous linear systems. Next, we shall give estimation of the topological entropy for the class of bounded linear equations on Rn. Finally, we are about to investigate the invariant properties of one through the transformations such as topological conjugacy, topological equivalence and kinematically similar and then show that topological entropy of one is equal to sum of positive Lyapunov characteristic exponents.展开更多
Based on the kinematic viewpoint, the concept of proportional movement is abstracted to explain the strange behaviors of fractal snowflakes. A transformation group for proportional movement is defined. Under the propo...Based on the kinematic viewpoint, the concept of proportional movement is abstracted to explain the strange behaviors of fractal snowflakes. A transformation group for proportional movement is defined. Under the proportional movement transformation groups, necessary and sufficient conditions for self-similarity of multilevel structures are presented. The characteristic topology of snowflake-like fractal patterns, identical to the topology of ternary-segment fractal line, is proved. Moreover, the topological evolution of N-segment line is explored. The concepts of limit growth and infinite growth are clarified,and the corresponding growth conditions are derived. The topological invariant properties of N-segment line are exposed. In addition, the proposition that the topological evolution of the N-segment line is mainly controlled by the topological invariant N is verified.展开更多
量子漫步算法能模拟游走粒子在图上的量子相干演化,粒子的运动状态由量子态的相干叠加而成.与经典随机游走算法相比,量子漫步算法具有寻找目标节点时间少和源节点扩散至其他节点时间少的优点.提出一种基于离散时间量子漫步的链路预测(li...量子漫步算法能模拟游走粒子在图上的量子相干演化,粒子的运动状态由量子态的相干叠加而成.与经典随机游走算法相比,量子漫步算法具有寻找目标节点时间少和源节点扩散至其他节点时间少的优点.提出一种基于离散时间量子漫步的链路预测(link predictionbased on discrete time quantum walk,简称LP-DTQW)算法.研究结果表明:相对于其他7种算法,LP-DTQW算法有更高的预测精度;LP-DTQW算法的时间复杂度远低于经典RWR(random walk with restart)链路预测算法的时间复杂度.因此,LP-DTQW算法具有更强的预测性能.展开更多
链路预测是通过已知的网络拓扑和节点属性挖掘未来时刻节点潜在关系的重要手段,是预测缺失链路和识别虚假链路的有效方法,在研究社会网络结构演化中具有现实意义.传统的链路预测方法基于节点信息或路径信息相似性进行预测,然而,前者考...链路预测是通过已知的网络拓扑和节点属性挖掘未来时刻节点潜在关系的重要手段,是预测缺失链路和识别虚假链路的有效方法,在研究社会网络结构演化中具有现实意义.传统的链路预测方法基于节点信息或路径信息相似性进行预测,然而,前者考虑指标单一导致预测精度受限,后者由于计算复杂度过高不适合在规模较大网络中应用.通过对网络拓扑结构的分析,本文提出一种基于节点交互度(interacting degree of nodes,IDN)的社会网络链路预测方法.该方法首先根据网络中节点间的路径特征,引入了节点效率的概念,从而提高对于没有公共邻居节点之间链路预测的准确性;为了进一步挖掘节点间共同邻居的相关属性,借助分析节点间共同邻居的拓扑结构,该方法还创新性地整合了路径特征和局部信息,提出了社会网络节点交互度的定义,准确刻画出节点间的相似度,从而增强网络链路的预测能力;最后,本文借助6个真实网络数据集对IDN方法进行验证,实验结果表明,相比于目前的主流算法,本文提出的方法在AUC和Precision两个评价指标上均表现出更优的预测性能,预测结果平均分别提升22%和54%.因此节点交互度的提出在链路预测方面具有很高的可行性和有效性.展开更多
In this paper,an algorithm for solving the multi-target correlation and co-location problem of aerial-ground heterogeneous system is investigated.Aiming at the multi-target correlation problem,the fusion algorithm of ...In this paper,an algorithm for solving the multi-target correlation and co-location problem of aerial-ground heterogeneous system is investigated.Aiming at the multi-target correlation problem,the fusion algorithm of visual axis correlation method and improved topological similarity correlation method are adopted in view of large parallax and inconsistent scale between the aerial and ground perspectives.First,the visual axis was preprocessed by the threshold method,so that the sparse targets were initially associated.Then,the improved topological similarity method was used to further associate dense targets with the relative position characteristics between targets.The shortcoming of dense target similarity with small di®erence was optimized by the improved topological similarity method.For the problem of colocation,combined with the multi-target correlation algorithm in this paper,the triangulation positioning model was used to complete the co-location of multiple targets.In the experimental part,simulation experiments and°ight experiments were designed to verify the e®ectiveness of the algorithm.Experimental results show that the proposed algorithm can e®ectively achieve multi-target correlation positioning,and that the positioning accuracy is obviously better than other positioning methods.展开更多
Isomorphism detection is fundamental to the synthesis and innovative design of kinematic chains(KCs).The detection can be performed accurately by using the similarity of KCs.However,there are very few works on isomorp...Isomorphism detection is fundamental to the synthesis and innovative design of kinematic chains(KCs).The detection can be performed accurately by using the similarity of KCs.However,there are very few works on isomorphism detection based on the properties of similar vertices.In this paper,an ameliorated multi-order adjacent vertex assignment sequence(AMAVS)method is proposed to seek out similar vertices and identify the isomorphism of the planar KCs.First,the specific definition of AMAVS is described.Through the calculation of the AMAVS,the adjacent vertex value sequence reflecting the uniqueness of the topology features is established.Based on the value sequence,all possible similar vertices,corresponding relations,and isomorphism discrimination can be realized.By checking the topological graph of KCs with a different number of links,the effectiveness and efficiency of the proposed method are verified.Finally,the method is employed to implement the similar vertices and isomorphism detection of all the 9-link 2-D0F(degree of freedom)planar KCs.展开更多
基金This work was supported in part by the National Natural Science Foundation of China under Grants 61873089,62032007the Key Project of the Education Department of Hunan Province under Grant 20A087the Innovation Platform Open Fund Project of Hunan Provincial Education Department under Grant 20K025.
文摘Identifying associations between microRNAs(miRNAs)and diseases is very important to understand the occurrence and development of human diseases.However,these existing methods suffer from the following limitation:first,some disease-related miRNAs are obtained from the miRNA functional similarity networks consisting of heterogeneous data sources,i.e.,disease similarity,protein interaction network,gene expression.Second,little approaches infer disease-related miRNAs depending on the network topological features without the functional similarity of miRNAs.In this paper,we develop a novel model of Integrating Network Topology Similarity and MicroRNA Function Similarity(INTS-MFS).The integrated miRNA similarities are calculated based on miRNA functional similarity and network topological characteristics.INTS-MFS obtained AUC of 0.872 based on five-fold cross-validation and was applied to three common human diseases in case studies.As a results,30 out of top 30 predicted Prostatic Neoplasm-related miRNAs were included in the two databases of dbDEMC and PhenomiR2.0.29 out of top 30 predicted Lung Neoplasm-related miRNAs and Breast Neoplasm-related miRNAs were included in dbDEMC,PhenomiR2.0 and experimental reports.Moreover,INTS-MFS found unknown association with hsa-mir-371a in breast cancer and lung cancer,which have not been reported.It provides biologists new clues for diagnosing breast and lung cancer.
文摘The purpose of this paper is to extend the concept topological entropy to nonautonomous linear systems. Next, we shall give estimation of the topological entropy for the class of bounded linear equations on Rn. Finally, we are about to investigate the invariant properties of one through the transformations such as topological conjugacy, topological equivalence and kinematically similar and then show that topological entropy of one is equal to sum of positive Lyapunov characteristic exponents.
基金Project supported by the National Natural Science Foundation of China(Nos.10872114,11072125,and 11272175)the National Natural Science Foundation of Jiangsu Province(No.SBK201140044)the Fundation of Tutor for Doctor Degree of Higher Education of China(No.20130002110044)
文摘Based on the kinematic viewpoint, the concept of proportional movement is abstracted to explain the strange behaviors of fractal snowflakes. A transformation group for proportional movement is defined. Under the proportional movement transformation groups, necessary and sufficient conditions for self-similarity of multilevel structures are presented. The characteristic topology of snowflake-like fractal patterns, identical to the topology of ternary-segment fractal line, is proved. Moreover, the topological evolution of N-segment line is explored. The concepts of limit growth and infinite growth are clarified,and the corresponding growth conditions are derived. The topological invariant properties of N-segment line are exposed. In addition, the proposition that the topological evolution of the N-segment line is mainly controlled by the topological invariant N is verified.
文摘量子漫步算法能模拟游走粒子在图上的量子相干演化,粒子的运动状态由量子态的相干叠加而成.与经典随机游走算法相比,量子漫步算法具有寻找目标节点时间少和源节点扩散至其他节点时间少的优点.提出一种基于离散时间量子漫步的链路预测(link predictionbased on discrete time quantum walk,简称LP-DTQW)算法.研究结果表明:相对于其他7种算法,LP-DTQW算法有更高的预测精度;LP-DTQW算法的时间复杂度远低于经典RWR(random walk with restart)链路预测算法的时间复杂度.因此,LP-DTQW算法具有更强的预测性能.
文摘链路预测是通过已知的网络拓扑和节点属性挖掘未来时刻节点潜在关系的重要手段,是预测缺失链路和识别虚假链路的有效方法,在研究社会网络结构演化中具有现实意义.传统的链路预测方法基于节点信息或路径信息相似性进行预测,然而,前者考虑指标单一导致预测精度受限,后者由于计算复杂度过高不适合在规模较大网络中应用.通过对网络拓扑结构的分析,本文提出一种基于节点交互度(interacting degree of nodes,IDN)的社会网络链路预测方法.该方法首先根据网络中节点间的路径特征,引入了节点效率的概念,从而提高对于没有公共邻居节点之间链路预测的准确性;为了进一步挖掘节点间共同邻居的相关属性,借助分析节点间共同邻居的拓扑结构,该方法还创新性地整合了路径特征和局部信息,提出了社会网络节点交互度的定义,准确刻画出节点间的相似度,从而增强网络链路的预测能力;最后,本文借助6个真实网络数据集对IDN方法进行验证,实验结果表明,相比于目前的主流算法,本文提出的方法在AUC和Precision两个评价指标上均表现出更优的预测性能,预测结果平均分别提升22%和54%.因此节点交互度的提出在链路预测方面具有很高的可行性和有效性.
基金supported in part by the National Natural Science Foundation of China under Grant Nos.61876187 and 61806217.
文摘In this paper,an algorithm for solving the multi-target correlation and co-location problem of aerial-ground heterogeneous system is investigated.Aiming at the multi-target correlation problem,the fusion algorithm of visual axis correlation method and improved topological similarity correlation method are adopted in view of large parallax and inconsistent scale between the aerial and ground perspectives.First,the visual axis was preprocessed by the threshold method,so that the sparse targets were initially associated.Then,the improved topological similarity method was used to further associate dense targets with the relative position characteristics between targets.The shortcoming of dense target similarity with small di®erence was optimized by the improved topological similarity method.For the problem of colocation,combined with the multi-target correlation algorithm in this paper,the triangulation positioning model was used to complete the co-location of multiple targets.In the experimental part,simulation experiments and°ight experiments were designed to verify the e®ectiveness of the algorithm.Experimental results show that the proposed algorithm can e®ectively achieve multi-target correlation positioning,and that the positioning accuracy is obviously better than other positioning methods.
基金Supported by National Natural Science Foundation of China(Grant Nos.51675488,51975534)Zhejiang Provincial Natural Science Foundation of China(Grant No.LY19E050021)。
文摘Isomorphism detection is fundamental to the synthesis and innovative design of kinematic chains(KCs).The detection can be performed accurately by using the similarity of KCs.However,there are very few works on isomorphism detection based on the properties of similar vertices.In this paper,an ameliorated multi-order adjacent vertex assignment sequence(AMAVS)method is proposed to seek out similar vertices and identify the isomorphism of the planar KCs.First,the specific definition of AMAVS is described.Through the calculation of the AMAVS,the adjacent vertex value sequence reflecting the uniqueness of the topology features is established.Based on the value sequence,all possible similar vertices,corresponding relations,and isomorphism discrimination can be realized.By checking the topological graph of KCs with a different number of links,the effectiveness and efficiency of the proposed method are verified.Finally,the method is employed to implement the similar vertices and isomorphism detection of all the 9-link 2-D0F(degree of freedom)planar KCs.