A series of related electrophysiology phenomena can be caused by the occurrence of interpolated ventricular premature contraction.In our recent three-dimensional Lorenz R-R scatter plot research,we found that atrioven...A series of related electrophysiology phenomena can be caused by the occurrence of interpolated ventricular premature contraction.In our recent three-dimensional Lorenz R-R scatter plot research,we found that atrioventricular node double path caused by interpolated ventricular premature contraction imprints a specifi c pattern on three-dimensional Lorenz plots generated from 24-hour Holter recordings.We found two independent subclusters separated from the interpolated premature beat precluster,the interpolated premature beat cluster,and the interpolated premature beat postcluster,respectively.Combined with use of the trajectory tracking function and the leap phenomenon,our results reveal the presence of the atrioventricular node double conduction path.展开更多
For mobile anchor node static path planning cannot accord the actual distribution of node for dynamic adjustment. We take advantage of the high localization accuracy and low computational complexity of ad-hoc localiza...For mobile anchor node static path planning cannot accord the actual distribution of node for dynamic adjustment. We take advantage of the high localization accuracy and low computational complexity of ad-hoc localization system( AHLos)algorithm. This article introduces mobile anchor nodes instead of the traditional fixed anchor nodes to improve the algorithm. The result shows that, through introduce the mobile anchor node, the information of initial anchor nodes can be configured more flexible.Meanwhile,with the use of the approximate location and the transition path,the distance and energy consumption of the mobile anchor node is greatly reduced.展开更多
In order to reveal the complex network feature and its evolution principle of aviation network of China,probability distribution and its evolution trace of average length of node path of aviation network of China were...In order to reveal the complex network feature and its evolution principle of aviation network of China,probability distribution and its evolution trace of average length of node path of aviation network of China were researched according to statistics data in years 1988,1994,2001,2008 and 2015 of civil aviation of China.Floyd algorithm to calculate the path length between any two nodes of network was applied and average length of node path of aviation network was obtained according to this algorithm.It was discovered that average length of node path to other nodes had normal distribution function in each year.At meantime,the location parameter and scale parameter of normal distribution function had linear evolution trace.Airline rate was an index to describe the density of airline.It was found that average length of node path of aviation network of China evolved synchronously with airline rate and they had linear relationship.展开更多
In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the node degree and the average path length of China aviation network in 1988,1994,2001...In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the node degree and the average path length of China aviation network in 1988,1994,2001,2008 and 2015 was studied.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the airline as the edge of the network.On the basis of the statistical data,the node average path length of China aviation network in 1988,1994,2001,2008 and 2015 was calculated.Through regression analysis,it was found that the node degree had a logarithmic relationship with the average length of node path,and the two parameters of the logarithmic relationship had linear evolutionary trace.Key word:China aviation network,complex network,node degree,average length of node path,logarithmic relationship,evolutionary trace.展开更多
To improve the performance of Ad hoc on-demand multipath distance vector (AOMDV) protocol, we proposed NS-AOMDV which is short for “AOMDV based on node state”. In NS-AOMDV, we introduce node state to improve AOMDV’...To improve the performance of Ad hoc on-demand multipath distance vector (AOMDV) protocol, we proposed NS-AOMDV which is short for “AOMDV based on node state”. In NS-AOMDV, we introduce node state to improve AOMDV’s performance in selecting main path. In route discovery process, the routing update rule calculates the node weight of each path and sorts the path weight by descending value in route list, and we choose the path which has the largest path weight for data transmission. NS-AOMDV also uses the technology of route request (RREQ) packet delay forwarding and energy threshold to ease network congestion, limit the RREQ broadcast storm, and avoid low energy nodes to participate in the establishment of the path. The results of simulation show that NS-AOMDV can effectively improve the networks’packets delivery rate, throughput and normalized routing overhead in the situation of dynamic network topology and heavy load.展开更多
This article describes a biologically inspired node generator for the path planning of serially connected hyper-redundant manipulators using probabilistic roadmap planners. The generator searches the configuration spa...This article describes a biologically inspired node generator for the path planning of serially connected hyper-redundant manipulators using probabilistic roadmap planners. The generator searches the configuration space surrounding existing nodes in the roadmap and uses a combination of random and deterministic search methods that emulate the behaviour of octopus limbs. The strategy consists of randomly mutating the states of the links near the end-effector, and mutating the states of the links near the base of the robot toward the states of the goal configuration. When combined with the small tree probabilistic roadmap planner, the method was successfully used to solve the narrow passage motion planning problem of a 17 degree-of-freedom manipulator.展开更多
[目的/意义]通过最大瓦解结构准确识别科学研究前沿中的关键节点并追踪其演化路径,为把握领域发展规律、优化科研资源配置提供支持,突破现有研究聚焦孤立节点的局部特征,以及难以捕捉知识网络中具有协同作用且对全局连通性有级联破坏力...[目的/意义]通过最大瓦解结构准确识别科学研究前沿中的关键节点并追踪其演化路径,为把握领域发展规律、优化科研资源配置提供支持,突破现有研究聚焦孤立节点的局部特征,以及难以捕捉知识网络中具有协同作用且对全局连通性有级联破坏力的关键节点集合的问题。[方法/过程]以量子通信领域为例,基于2015—2024年Web of Science的6538篇文献构建关键词共现网络,融合多中心性指标并利用熵权法评估节点重要性,采用贪心算法识别MDS,分析其功能协同特征与演化轨迹。[结果/结论]研究表明,MDS仅占网络规模的18%~22%,移除该集合后网络最大连通组件规模下降超过70%,效果显著优于传统方法。关键节点在功能上呈现“主题—方法—工具—目标”的互补协同结构,其演化路径清晰展示了量子通信从理论奠基、技术攻坚到应用落地的三阶段发展轨迹,验证了MDS框架的有效性和实用性。展开更多
Mobile anchors are widely used for localization in WSNs.However,special properties over 3D terrains limit the implementation of them.In this paper,a novel 3D localization algorithm is proposed,called 3 DT-PP,which uti...Mobile anchors are widely used for localization in WSNs.However,special properties over 3D terrains limit the implementation of them.In this paper,a novel 3D localization algorithm is proposed,called 3 DT-PP,which utilizes path planning of mobile anchors over complex 3 D terrains,and simulations based upon the model of mountain surface network are conducted.The simulation results show that the algorithm decreases the position error by about 91%,8.7%and lowers calculation overhead by about 75%,1.3%,than the typical state-of-the-art localization algorithm(i.e.,'MDS-MAP','Landscape-3D').Thus,our algorithm is more potential in practical WSNs which are the characteristic of limited energy and 3D deployment.展开更多
Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node（HN） is proposed. An HN contacts with multiple communities while the comm...Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node（HN） is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure.However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model（DBRSM） is proposed by combining the virtue of densitybased algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further ＂growth＂ of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.展开更多
基于本地化差分隐私多关系表示上的Star-JOIN查询已得到研究者广泛关注.现有基于OLH机制与层次树结构的Star-JOIN查询算法存在根节点泄露隐私风险、τ-截断机制没有给出如何选择合适τ值等问题.针对现有算法存在的不足,提出一种有效且...基于本地化差分隐私多关系表示上的Star-JOIN查询已得到研究者广泛关注.现有基于OLH机制与层次树结构的Star-JOIN查询算法存在根节点泄露隐私风险、τ-截断机制没有给出如何选择合适τ值等问题.针对现有算法存在的不足,提出一种有效且满足本地化差分隐私的Star-JOIN查询算法LPRR-JOIN(longitudinal path random response for join).该算法充分利用层次树的纵向路径结构与GRR机制,设计一种纵向本地扰动算法LPRR,该算法以所有属性纵向路径上的节点组合作为扰动值域.每个用户把自身元组映射到相应节点组合中,再利用GRR机制对映射后的元组进行本地扰动.为了避免事实表上存在的频率攻击,LPRR-JOIN算法允许每个用户利用阈值τ本地截断自身元组个数,大于τ条元组删减、小于τ条元组补充.为了寻找合适的τ值,LPRR-JOIN算法利用τ-截断带来的偏差与扰动方差构造总体误差函数,通过优化误差目标函数获得τ值;其次结合用户分组策略获得τ值的总体分布,再利用中位数获得合适的τ值.LPRR-JOIN算法与现有算法在3种多关系数据集上进行比较,实验结果表明其响应查询算法优于同类算法.展开更多
针对RRT*(rapidly-exploring random tree star)算法在复杂障碍物场景下存在收敛效率低、搜索方向随机性强,导致生成路径效果不佳的问题,提出一种基于动态梯度采样和人工势场的双向快速探索随机树算法(SN-BIRRT*)。采用分步式动态梯度...针对RRT*(rapidly-exploring random tree star)算法在复杂障碍物场景下存在收敛效率低、搜索方向随机性强,导致生成路径效果不佳的问题,提出一种基于动态梯度采样和人工势场的双向快速探索随机树算法(SN-BIRRT*)。采用分步式动态梯度采样策略优化采样过程,更有效地探索配置空间。在拓展方面引入一种改进的人工势场法,提高算法的收敛速度。对生成的新节点采用改进的重连父节点策略进行优化,减少路径总成本。为了提高路径的平滑度,采用路径剪枝、线性插值和B样条平滑的融合路径平滑策略进行后处理。通过仿真实验,将SN-BIRRT*算法与其他几种基于采样的路径规划算法在不同障碍物环境和狭窄环境下进行了比较,结果表明该算法在不同环境下均有良好的性能,在机器人路径规划中可以有效解决机器人在复杂室内环境中的高效路径规划问题。展开更多
文摘A series of related electrophysiology phenomena can be caused by the occurrence of interpolated ventricular premature contraction.In our recent three-dimensional Lorenz R-R scatter plot research,we found that atrioventricular node double path caused by interpolated ventricular premature contraction imprints a specifi c pattern on three-dimensional Lorenz plots generated from 24-hour Holter recordings.We found two independent subclusters separated from the interpolated premature beat precluster,the interpolated premature beat cluster,and the interpolated premature beat postcluster,respectively.Combined with use of the trajectory tracking function and the leap phenomenon,our results reveal the presence of the atrioventricular node double conduction path.
基金National Natural Science Foundations of China(Nos.U1162202,61203157)the Fundamental Research Funds for the Central Universities and Shanghai Leading Academic Discipline Project,China(No.B504)
文摘For mobile anchor node static path planning cannot accord the actual distribution of node for dynamic adjustment. We take advantage of the high localization accuracy and low computational complexity of ad-hoc localization system( AHLos)algorithm. This article introduces mobile anchor nodes instead of the traditional fixed anchor nodes to improve the algorithm. The result shows that, through introduce the mobile anchor node, the information of initial anchor nodes can be configured more flexible.Meanwhile,with the use of the approximate location and the transition path,the distance and energy consumption of the mobile anchor node is greatly reduced.
文摘In order to reveal the complex network feature and its evolution principle of aviation network of China,probability distribution and its evolution trace of average length of node path of aviation network of China were researched according to statistics data in years 1988,1994,2001,2008 and 2015 of civil aviation of China.Floyd algorithm to calculate the path length between any two nodes of network was applied and average length of node path of aviation network was obtained according to this algorithm.It was discovered that average length of node path to other nodes had normal distribution function in each year.At meantime,the location parameter and scale parameter of normal distribution function had linear evolution trace.Airline rate was an index to describe the density of airline.It was found that average length of node path of aviation network of China evolved synchronously with airline rate and they had linear relationship.
文摘In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the node degree and the average path length of China aviation network in 1988,1994,2001,2008 and 2015 was studied.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the airline as the edge of the network.On the basis of the statistical data,the node average path length of China aviation network in 1988,1994,2001,2008 and 2015 was calculated.Through regression analysis,it was found that the node degree had a logarithmic relationship with the average length of node path,and the two parameters of the logarithmic relationship had linear evolutionary trace.Key word:China aviation network,complex network,node degree,average length of node path,logarithmic relationship,evolutionary trace.
文摘To improve the performance of Ad hoc on-demand multipath distance vector (AOMDV) protocol, we proposed NS-AOMDV which is short for “AOMDV based on node state”. In NS-AOMDV, we introduce node state to improve AOMDV’s performance in selecting main path. In route discovery process, the routing update rule calculates the node weight of each path and sorts the path weight by descending value in route list, and we choose the path which has the largest path weight for data transmission. NS-AOMDV also uses the technology of route request (RREQ) packet delay forwarding and energy threshold to ease network congestion, limit the RREQ broadcast storm, and avoid low energy nodes to participate in the establishment of the path. The results of simulation show that NS-AOMDV can effectively improve the networks’packets delivery rate, throughput and normalized routing overhead in the situation of dynamic network topology and heavy load.
文摘This article describes a biologically inspired node generator for the path planning of serially connected hyper-redundant manipulators using probabilistic roadmap planners. The generator searches the configuration space surrounding existing nodes in the roadmap and uses a combination of random and deterministic search methods that emulate the behaviour of octopus limbs. The strategy consists of randomly mutating the states of the links near the end-effector, and mutating the states of the links near the base of the robot toward the states of the goal configuration. When combined with the small tree probabilistic roadmap planner, the method was successfully used to solve the narrow passage motion planning problem of a 17 degree-of-freedom manipulator.
文摘[目的/意义]通过最大瓦解结构准确识别科学研究前沿中的关键节点并追踪其演化路径,为把握领域发展规律、优化科研资源配置提供支持,突破现有研究聚焦孤立节点的局部特征,以及难以捕捉知识网络中具有协同作用且对全局连通性有级联破坏力的关键节点集合的问题。[方法/过程]以量子通信领域为例,基于2015—2024年Web of Science的6538篇文献构建关键词共现网络,融合多中心性指标并利用熵权法评估节点重要性,采用贪心算法识别MDS,分析其功能协同特征与演化轨迹。[结果/结论]研究表明,MDS仅占网络规模的18%~22%,移除该集合后网络最大连通组件规模下降超过70%,效果显著优于传统方法。关键节点在功能上呈现“主题—方法—工具—目标”的互补协同结构,其演化路径清晰展示了量子通信从理论奠基、技术攻坚到应用落地的三阶段发展轨迹,验证了MDS框架的有效性和实用性。
基金Supported by the Important National Science and Technology Specific Project of China(No.20112X03002-002-03)the National NatureScience Foundation of China(No.61133016,61163066)
文摘Mobile anchors are widely used for localization in WSNs.However,special properties over 3D terrains limit the implementation of them.In this paper,a novel 3D localization algorithm is proposed,called 3 DT-PP,which utilizes path planning of mobile anchors over complex 3 D terrains,and simulations based upon the model of mountain surface network are conducted.The simulation results show that the algorithm decreases the position error by about 91%,8.7%and lowers calculation overhead by about 75%,1.3%,than the typical state-of-the-art localization algorithm(i.e.,'MDS-MAP','Landscape-3D').Thus,our algorithm is more potential in practical WSNs which are the characteristic of limited energy and 3D deployment.
基金supported by the National Natural Science Foundation of China(71271018)
文摘Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node（HN） is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure.However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model（DBRSM） is proposed by combining the virtue of densitybased algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further ＂growth＂ of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.
文摘基于本地化差分隐私多关系表示上的Star-JOIN查询已得到研究者广泛关注.现有基于OLH机制与层次树结构的Star-JOIN查询算法存在根节点泄露隐私风险、τ-截断机制没有给出如何选择合适τ值等问题.针对现有算法存在的不足,提出一种有效且满足本地化差分隐私的Star-JOIN查询算法LPRR-JOIN(longitudinal path random response for join).该算法充分利用层次树的纵向路径结构与GRR机制,设计一种纵向本地扰动算法LPRR,该算法以所有属性纵向路径上的节点组合作为扰动值域.每个用户把自身元组映射到相应节点组合中,再利用GRR机制对映射后的元组进行本地扰动.为了避免事实表上存在的频率攻击,LPRR-JOIN算法允许每个用户利用阈值τ本地截断自身元组个数,大于τ条元组删减、小于τ条元组补充.为了寻找合适的τ值,LPRR-JOIN算法利用τ-截断带来的偏差与扰动方差构造总体误差函数,通过优化误差目标函数获得τ值;其次结合用户分组策略获得τ值的总体分布,再利用中位数获得合适的τ值.LPRR-JOIN算法与现有算法在3种多关系数据集上进行比较,实验结果表明其响应查询算法优于同类算法.
文摘针对RRT*(rapidly-exploring random tree star)算法在复杂障碍物场景下存在收敛效率低、搜索方向随机性强,导致生成路径效果不佳的问题,提出一种基于动态梯度采样和人工势场的双向快速探索随机树算法(SN-BIRRT*)。采用分步式动态梯度采样策略优化采样过程,更有效地探索配置空间。在拓展方面引入一种改进的人工势场法,提高算法的收敛速度。对生成的新节点采用改进的重连父节点策略进行优化,减少路径总成本。为了提高路径的平滑度,采用路径剪枝、线性插值和B样条平滑的融合路径平滑策略进行后处理。通过仿真实验,将SN-BIRRT*算法与其他几种基于采样的路径规划算法在不同障碍物环境和狭窄环境下进行了比较,结果表明该算法在不同环境下均有良好的性能,在机器人路径规划中可以有效解决机器人在复杂室内环境中的高效路径规划问题。
