机构

• 地理科学与资源研究所 [2]
• 长春光学精密机械与物... [1]
• 西安光学精密机械研究... [1]

采集方式

• OAI收割 [4]

内容类型

• SCI/SSCI论文 [2]
• 会议论文 [1]
• 期刊论文 [1]

发表日期

• 2015 [2]
• 2014 [1]
• 2007 [1]

学科主题

筛选

浏览/检索结果: 共4条，第1-4条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序提交时间升序提交时间降序作者升序作者降序发表日期升序发表日期降序 Effects of mixture of branch order-based roots and nitrogen addition on root decay in a subtropical pine plantation SCI/SSCI论文  OAI收割 2015 作者:  Kou L.;  Chen, W. W.;  Gao, W. L.;  Yang, H.;  Wang, H. M. 收藏  |  浏览/下载：26/0  |  提交时间：2015/12/09 Decomposition  Root branching order  Mixing effect  Acid-unhydrolyzable  residue  Nitrogen addition  litter decomposition  leaf-litter  chinese temperate  forest litter  diversity  soil  ecosystem  architecture  heterogeneity  availability   Seasonal variation in chemistry, but not morphology, in roots of Quercus robur growing in different soil types SCI/SSCI论文  OAI收割 2015 作者:  Zadworny M.;  Mccormack, M. L.;  Rawlik, K.;  Jagodzinski, A. M. 收藏  |  浏览/下载：36/0  |  提交时间：2015/12/09 nitrogen reserve  oak forest  root order diversity  seasonal variation  storage  pinus-sylvestris l.  branch order  fine roots  fraxinus-mandshurica  nutrient resorption  frost hardiness  life-span  nitrogen  tree  biomass   Secrecy Outage and Diversity Analysis of Cognitive Radio Systems 期刊论文  OAI收割 ieee journal on selected areas in communications, 2014, 卷号: 32, 期号: 11, 页码: 2222-2236 作者:  Zou, Yulong;  Li, Xuelong;  Liang, Ying-Chang 收藏  |  浏览/下载：32/0  |  提交时间：2015/03/20 Cognitive radio  multi-user scheduling  secrecy outage probability  secrecy diversity  diversity order   An improved discrete particle swarm optimization algorithm for TSP (EI CONFERENCE) 会议论文  OAI收割 2007 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2007, November 2, 2007 - November 5, 2007, Silicon Valley, CA, United states 作者:  Wang Y.;  Wang Y.;  Wang Y.;  Wang Y.;  Wang Y. 收藏  |  浏览/下载：26/0  |  提交时间：2013/03/25 An Improved discrete particle swarm optimization (DPSO)-based algorithm for the traveling salesman problem (TSP) is proposed. In order to overcome the problem of premature convergence  a novel depressor is proposed and a diversity measure to control the swarm is also introduced which can be used to switch between the attractor and depressor. The proposed algorithm has been applied to a set of benchmark problems and compared with the existing algorithms for solving TSP using swarm intelligence. The results show that it can prevent premature convergence to a high degree  but still keeps a rapid convergence like the basic DPSO. 2007 IEEE.