Understanding habitat requirements and identifying landscape linkages are essential for the survival of isolated populations of endangered species.Currently,some of the giant panda populations are isolated,which...Understanding habitat requirements and identifying landscape linkages are essential for the survival of isolated populations of endangered species.Currently,some of the giant panda populations are isolated,which threatens their long-term survival,particularly in the Xiaoxiangling mountains.In the present study,we quantified niche requirements and then identified potential linkages of giant panda subpopulations in the most isolated region,using ecological niche factor analysis and a least-cost path model.Giant pandas preferred habitat with conifer forest and gentle slopes(>20 to≤30°).Based on spatial distribution of suitable habitat,linkages were identified for the Yele subpopulation to 4 other subpopulations(Liziping,Matou,Xinmin and Wanba).Their lengths ranged from 15 to 54 km.The accumulated cost ranged from 693 to 3166 and conifer forest covered over 31%.However,a variety of features(e.g.major roads,human settlements and large unforested areas)might act as barriers along the linkages for giant panda dispersal.Our analysis quantified giant panda subpopulation connectivity to ensure long-term survival.展开更多
通过节能路由算法减少网络能耗是网络中需要解决的一个关键性的科学问题。如今已有的节能方案都是在已知流量矩阵的前提下研究网络节能,由于实时流量难以获取,使得这些方案都难以在实际中部署。因此,文中提出一种基于代数连通度的域内...通过节能路由算法减少网络能耗是网络中需要解决的一个关键性的科学问题。如今已有的节能方案都是在已知流量矩阵的前提下研究网络节能,由于实时流量难以获取,使得这些方案都难以在实际中部署。因此,文中提出一种基于代数连通度的域内节能方案(Intra-domain Energy Efficient Routing Scheme Based on Algebraic Connectivity,EERSBAC)。EERSBAC不需要网络中的实时流量矩阵,仅依靠网络中的拓扑结构就可以实现节能。首先,提出链路关键度模型,利用链路关键度模型计算出网络中所有链路的重要程度;然后,提出代数连通度模型,利用代数连通度模型可以定量的衡量网络的连通性能。实验结果表明,EERSBAC不仅能够降低网络能耗,而且具有较小的路径拉伸度。展开更多
Given two Banach spaces E, F, let B（E, F） be the set of all bounded linear operators from E into F, ∑r the set of all operators of finite rank r in B（E, F）, and ∑r^# the number of path connected components of ∑...Given two Banach spaces E, F, let B（E, F） be the set of all bounded linear operators from E into F, ∑r the set of all operators of finite rank r in B（E, F）, and ∑r^# the number of path connected components of ∑r. It is known that ∑r is a smooth Banach submanifold in B（E,F） with given expression of its tangent space at each A ∈ ∑r. In this paper, the equality ∑r^# = 1 is proved. Consequently, the following theorem is obtained： for any nonnegative integer r,∑r is a smooth and path connected Banach submanifold in B（E, F） with the tangent space TA∑r = {B E B（E,F） ： BN（A） belong to R（A）} at each A ∈ ∑r if dim F = ∞. Note that the routine method can hardly be applied here. So in addition to the nice topological and geometric property of ∑r the method presented in this paper is also interesting. As an application of this result, it is proved that if E = R^n and F = R^m, then ∑r is a smooth and path connected submanifold of B（R^n,R^m） and its dimension is dim ∑r = （m ＋ n）r- r^2 for each r, 0≤r 〈 min{n,m}.展开更多
In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both one-and two-...In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both one-and two-way infinite Hamiltonian paths.展开更多
Let T(G)be the tree graph of a simple graph G.It is proved that ifT and T′are two vertices of T(G)such that d_T(G)(T)(?)d_T(G}(T′),then there ared_T(G)(T) internally disjoint paths in T(G) joining T and T′.
针对基于武器平台的体系对抗综合仿真系统中通信连通性功能的实际需求,给出了通信连通性模块的组成、功能及仿真流程,对其中的关键模型进行了分析研究,重点阐述了路径损耗计算和视野(FOV,Field Of View)判断模型。结合实例进行了仿真实...针对基于武器平台的体系对抗综合仿真系统中通信连通性功能的实际需求,给出了通信连通性模块的组成、功能及仿真流程,对其中的关键模型进行了分析研究,重点阐述了路径损耗计算和视野(FOV,Field Of View)判断模型。结合实例进行了仿真实验,仿真结果充分验证了模型和方法的有效性。通信连通性模块的研究开发为体系对抗仿真系统的实现奠定了基础,也可为电子信息系统及装备分析研究、研制与试验评估以及建模仿真等提供参考。展开更多
基金supported by the National Nature Science Foundation(30830020)Key Program of Knowledge Innovation Program of Chinese Academy of Sciences(KSCX2-EW-Z-4)the China Postdoctoral Science Foundation(200904501111).
文摘Understanding habitat requirements and identifying landscape linkages are essential for the survival of isolated populations of endangered species.Currently,some of the giant panda populations are isolated,which threatens their long-term survival,particularly in the Xiaoxiangling mountains.In the present study,we quantified niche requirements and then identified potential linkages of giant panda subpopulations in the most isolated region,using ecological niche factor analysis and a least-cost path model.Giant pandas preferred habitat with conifer forest and gentle slopes(>20 to≤30°).Based on spatial distribution of suitable habitat,linkages were identified for the Yele subpopulation to 4 other subpopulations(Liziping,Matou,Xinmin and Wanba).Their lengths ranged from 15 to 54 km.The accumulated cost ranged from 693 to 3166 and conifer forest covered over 31%.However,a variety of features(e.g.major roads,human settlements and large unforested areas)might act as barriers along the linkages for giant panda dispersal.Our analysis quantified giant panda subpopulation connectivity to ensure long-term survival.
文摘通过节能路由算法减少网络能耗是网络中需要解决的一个关键性的科学问题。如今已有的节能方案都是在已知流量矩阵的前提下研究网络节能,由于实时流量难以获取,使得这些方案都难以在实际中部署。因此,文中提出一种基于代数连通度的域内节能方案(Intra-domain Energy Efficient Routing Scheme Based on Algebraic Connectivity,EERSBAC)。EERSBAC不需要网络中的实时流量矩阵,仅依靠网络中的拓扑结构就可以实现节能。首先,提出链路关键度模型,利用链路关键度模型计算出网络中所有链路的重要程度;然后,提出代数连通度模型,利用代数连通度模型可以定量的衡量网络的连通性能。实验结果表明,EERSBAC不仅能够降低网络能耗,而且具有较小的路径拉伸度。
基金Supported by the National Science Foundation of China (Grant No.10671049 and 10771101).
文摘Given two Banach spaces E, F, let B（E, F） be the set of all bounded linear operators from E into F, ∑r the set of all operators of finite rank r in B（E, F）, and ∑r^# the number of path connected components of ∑r. It is known that ∑r is a smooth Banach submanifold in B（E,F） with given expression of its tangent space at each A ∈ ∑r. In this paper, the equality ∑r^# = 1 is proved. Consequently, the following theorem is obtained： for any nonnegative integer r,∑r is a smooth and path connected Banach submanifold in B（E, F） with the tangent space TA∑r = {B E B（E,F） ： BN（A） belong to R（A）} at each A ∈ ∑r if dim F = ∞. Note that the routine method can hardly be applied here. So in addition to the nice topological and geometric property of ∑r the method presented in this paper is also interesting. As an application of this result, it is proved that if E = R^n and F = R^m, then ∑r is a smooth and path connected submanifold of B（R^n,R^m） and its dimension is dim ∑r = （m ＋ n）r- r^2 for each r, 0≤r 〈 min{n,m}.
基金Supported by Natural Science Foundation of China (Project 10171085).
文摘In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both one-and two-way infinite Hamiltonian paths.
文摘Let T(G)be the tree graph of a simple graph G.It is proved that ifT and T′are two vertices of T(G)such that d_T(G)(T)(?)d_T(G}(T′),then there ared_T(G)(T) internally disjoint paths in T(G) joining T and T′.
文摘针对基于武器平台的体系对抗综合仿真系统中通信连通性功能的实际需求,给出了通信连通性模块的组成、功能及仿真流程,对其中的关键模型进行了分析研究,重点阐述了路径损耗计算和视野(FOV,Field Of View)判断模型。结合实例进行了仿真实验,仿真结果充分验证了模型和方法的有效性。通信连通性模块的研究开发为体系对抗仿真系统的实现奠定了基础,也可为电子信息系统及装备分析研究、研制与试验评估以及建模仿真等提供参考。
