This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears...This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears as commonplace in many realistic scenarios.Regarding this,we consider graphs composed of rings,with some possible connected paths between them.Without prior knowledge of the exact node permutations on rings,the existence of each edge can be unraveled through edge testing at a unit cost in one step.The problem examined is that of determining whether the given nodes are connected by a path or separated by a cut,with the minimum expected costs involved.Dividing the problem into different cases based on different topologies of the ring-based networks,we propose the corresponding policies that aim to quickly seek the paths between nodes.A common feature shared by all those policies is that we stick to going in the same direction during edge searching,with edge testing in each step only involving the test between the source and the node that has been tested most.The simple searching rule,interestingly,can be interpreted as a delightful property stemming from the neat structure of ring-based networks,which makes the searching process not rely on any sophisticated behaviors.We prove the optimality of the proposed policies by calculating the expected cost incurred and making a comparison with the other class of strategies.The effectiveness of the proposed policies is also verified through extensive simulations,from which we even disclose three extra intriguing findings:i)in a onering network,the cost will grow drastically with the number of designated nodes when the number is small and will grow slightly when that number is large;ii)in ring-based network,Depth First is optimal in detecting the connectivity between designated nodes;iii)the problem of multi-ring networks shares large similarity with that of two-ring networks,and a larger number of ties between rings will not influence the expected cost.展开更多
知识图谱作为当前最有效的知识组织和服务方式,已经成为人工智能的基石,在语义搜索、机器翻译、信息推荐等方面得到了广泛的应用。大数据时代下,地球科学(以下简称地学)分散、多源、异构数据的整合集成、挖掘分析及其知识的智能发现等...知识图谱作为当前最有效的知识组织和服务方式,已经成为人工智能的基石,在语义搜索、机器翻译、信息推荐等方面得到了广泛的应用。大数据时代下,地球科学(以下简称地学)分散、多源、异构数据的整合集成、挖掘分析及其知识的智能发现等迫切需要知识图谱的支撑。为了促进地学知识图谱的建设与应用,自2019年启动以来,“深时数字地球国际大科学计划”(Deep-time Digital Earth,简称DDE)就将知识图谱作为其重要的研究建设内容,经过3年多的建设,DDE已经建设形成了大量的地学知识图谱,亟需一站式共享这些知识图谱。文章首先介绍了DDE知识图谱内容体系,分析了DDE知识图谱内容组成及其特征;在此基础上,开展了地学知识图谱一站式共享服务系统的设计,包括系统功能体系和架构的设计;最后介绍了系统实现的技术路线及其关键技术。实践证明系统可有效实现DDE知识图谱的一站式共享服务,可为类似的知识共享服务系统提供参考。展开更多
基金supported by NSF China(No.61960206002,62020106005,42050105,62061146002)Shanghai Pilot Program for Basic Research-Shanghai Jiao Tong University。
文摘This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears as commonplace in many realistic scenarios.Regarding this,we consider graphs composed of rings,with some possible connected paths between them.Without prior knowledge of the exact node permutations on rings,the existence of each edge can be unraveled through edge testing at a unit cost in one step.The problem examined is that of determining whether the given nodes are connected by a path or separated by a cut,with the minimum expected costs involved.Dividing the problem into different cases based on different topologies of the ring-based networks,we propose the corresponding policies that aim to quickly seek the paths between nodes.A common feature shared by all those policies is that we stick to going in the same direction during edge searching,with edge testing in each step only involving the test between the source and the node that has been tested most.The simple searching rule,interestingly,can be interpreted as a delightful property stemming from the neat structure of ring-based networks,which makes the searching process not rely on any sophisticated behaviors.We prove the optimality of the proposed policies by calculating the expected cost incurred and making a comparison with the other class of strategies.The effectiveness of the proposed policies is also verified through extensive simulations,from which we even disclose three extra intriguing findings:i)in a onering network,the cost will grow drastically with the number of designated nodes when the number is small and will grow slightly when that number is large;ii)in ring-based network,Depth First is optimal in detecting the connectivity between designated nodes;iii)the problem of multi-ring networks shares large similarity with that of two-ring networks,and a larger number of ties between rings will not influence the expected cost.
文摘知识图谱作为当前最有效的知识组织和服务方式,已经成为人工智能的基石,在语义搜索、机器翻译、信息推荐等方面得到了广泛的应用。大数据时代下,地球科学(以下简称地学)分散、多源、异构数据的整合集成、挖掘分析及其知识的智能发现等迫切需要知识图谱的支撑。为了促进地学知识图谱的建设与应用,自2019年启动以来,“深时数字地球国际大科学计划”(Deep-time Digital Earth,简称DDE)就将知识图谱作为其重要的研究建设内容,经过3年多的建设,DDE已经建设形成了大量的地学知识图谱,亟需一站式共享这些知识图谱。文章首先介绍了DDE知识图谱内容体系,分析了DDE知识图谱内容组成及其特征;在此基础上,开展了地学知识图谱一站式共享服务系统的设计,包括系统功能体系和架构的设计;最后介绍了系统实现的技术路线及其关键技术。实践证明系统可有效实现DDE知识图谱的一站式共享服务,可为类似的知识共享服务系统提供参考。
