首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   310篇
  免费   34篇
  国内免费   43篇
  387篇
  2024年   2篇
  2023年   12篇
  2022年   18篇
  2021年   13篇
  2020年   17篇
  2019年   11篇
  2018年   11篇
  2017年   13篇
  2016年   18篇
  2015年   16篇
  2014年   27篇
  2013年   19篇
  2012年   15篇
  2011年   12篇
  2010年   14篇
  2009年   23篇
  2008年   18篇
  2007年   15篇
  2006年   23篇
  2005年   13篇
  2004年   13篇
  2003年   7篇
  2002年   3篇
  2001年   9篇
  2000年   6篇
  1999年   2篇
  1998年   3篇
  1997年   2篇
  1996年   5篇
  1995年   3篇
  1994年   2篇
  1993年   2篇
  1992年   3篇
  1991年   2篇
  1990年   1篇
  1989年   5篇
  1986年   1篇
  1984年   1篇
  1983年   3篇
  1982年   1篇
  1979年   1篇
  1978年   1篇
  1950年   1篇
排序方式: 共有387条查询结果,搜索用时 15 毫秒
51.
R. M. Fewster    S. T. Buckland 《Biometrics》2001,57(2):495-501
We present a method for assessing similarity between species maps of presence and absence or abundance that emphasizes global features while ignoring minor local dissimilarities. The method arranges sites into small groups, or cliques, and allows controlled changes to be made within cliques to reduce the influence of local discrepancies. Resulting measures of similarity are visually more satisfactory than traditional indices. We show that the similarity indices are useful for model selection by comparing observed spatial patterns with those predicted by different fitted models. Examples are provided for spatial distributions of oribatid mites (Acari, Oribatei), woodlarks (Lullula arborea), and red deer (Cervus elaphus).  相似文献   
52.
53.
Hyuntae Na  Guang Song 《Proteins》2015,83(4):757-770
Ligand migration and binding are central to the biological functions of many proteins such as myoglobin (Mb) and it is widely thought that protein breathing motions open up ligand channels dynamically. However, how a protein exerts its control over the opening and closing of these channels through its intrinsic dynamics is not fully understood. Specifically, a quantitative delineation of the breathing motions that are needed to open ligand channels is lacking. In this work, we present and apply a novel normal mode‐based method to quantitatively delineate what and how breathing motions open ligand migration channels in Mb and its mutants. The motivation behind this work springs from the observation that normal mode motions are closely linked to the breathing motions that are thought to open ligand migration channels. In addition, the method provides a direct and detailed depiction of the motions of each and every residue that lines a channel and can identify key residues that play a dominating role in regulating the channel. The all‐atom model and the full force‐field employed in the method provide a realistic energetics on the work cost required to open a channel, and as a result, the method can be used to efficiently study the effects of mutations on ligand migration channels and on ligand entry rates. Our results on Mb and its mutants are in excellent agreement with MD simulation results and experimentally determined ligand entry rates. Proteins 2015; 83:757–770. © 2015 Wiley Periodicals, Inc.  相似文献   
54.
Genes involved in plant defences against herbivores and pathogens are often highly polymorphic. This is a putative sign that balancing selection may have operated reciprocally on the hosts and their herbivores. Spatial and temporal variations (for example, in soil nutrients and the plants'' ontogenetic development) may also modulate resistance traits, and thus selection pressures, but have been largely overlooked in theories of plant defences. Important elements of defences in Populus tremula (hereafter aspen) are phenolic compounds, including condensed tannins (CTs). Concentrations of CTs vary considerably with both variations in external factors and time, but they are also believed to provide genotype‐dependent resistance, mainly against chewing herbivores and pathogens. However, evidence of their contributions to resistance is sparse. Detailed studies of co‐evolved plant–herbivore associations could provide valuable insights into these contributions. Therefore, we examined correlations between CT levels in aspen leaves and both the feeding behavior and reproduction of the specialist aspen leaf aphid (Chaitophorus tremulae) in varied conditions. We found that xylem sap intake and probing difficulties were higher on genotypes with high‐CT concentrations. However, aphids engaged in more nonprobing activities on low‐CT genotypes, indicating that CTs were not the only defence traits involved. Thus, high‐CT genotypes were not necessarily more resistant than low‐CT genotypes, but aphid reproduction was generally negatively correlated with local CT accumulation. Genotype‐specific resistance ranking also depended on the experimental conditions. These results support the hypothesis that growth conditions may affect selection pressures mediated by aphids in accordance with balancing selection theory.  相似文献   
55.
Qing Dai  Jie Wu 《Cluster computing》2005,8(2-3):127-133
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission range of an ad hoc wireless network, where each node uses the same transmission power, while maintaining network connectivity. Three different algorithms, Prims Minimum Spanning Tree (MST), its extension with Fibonacci heap implementation, and an area-based binary search are developed to solve the problem. Their performance is compared by simulation study together with Kruskals MST, a known solution proposed by Ramanathan and Rosales-Hain for topology control by transmission power adjustment, and an edge-based binary search used by the same study in order to find the per-node-minimality after Kruskals algorithm is applied. Our results show that Prims MST outperforms both Kruskals MST and the two binary searches. The performance between Prims MST implemented with binary heap and Fibonacci heap is fairly close, with the Fibonacci implementation slightly outperforming the other.Qing Dai received her M.S. degree in Computer Science from Florida Atlantic University on August 2003, and M.S. degree in Microbiology from Upstate University on July 2000. She is currently a software engineer at Motorola, Plantation, FL.Jie Wu is a Professor at Department of Computer Science and Engineering, Florida Atlantic University. He has published over 200 papers in various journals and conference proceedings. His research interests are in the areas of wireless networks and mobile computing, routing protocols, fault-tolerant computing, and interconnection networks. He served on many conference organization committees. Dr. Wu is on the editorial board of IEEE Transactions on Parallel and Distributed Systems and was a co-guest-editor of IEEE Computer and Journal of Parallel and Distributed Computing. He is the author of the text Distributed System Design published by the CRC press. He was also the recipient of the 1996–97 and 2001–2002 Researcher of the Year Award at Florida Atlantic University. Dr. Wu has served as an IEEE Computer Society Distinguished Visitor. He is a Member of ACM and a Senior Member of IEEE.  相似文献   
56.
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper presents a survey on the software tools for the graph-based scheduling on cluster systems with the focus on task scheduling. The tasks of a parallel or distributed application can be properly scheduled onto multi-processors in order to optimize the performance of the program (e.g., execution time or resource utilization). In general, scheduling algorithms are designed based on the notion of task graph that represents the relationship of parallel tasks. The scheduling algorithms map the nodes of a graph to the processors in order to minimize overall execution time. Although many scheduling algorithms have been proposed in the literature, surprisingly not many practical tools can be found in practical use. After discussing the fundamental scheduling techniques, we propose a framework and taxonomy for the scheduling tools on clusters. Using this framework, the features of existing scheduling tools are analyzed and compared. We also discuss the important issues in improving the usability of the scheduling tools. This work is supported by the Hong Kong Polytechnic University under grant H-ZJ80 and by NASA Ames Research Center by a cooperative grant agreement with the University of Texas at Arlington. Jiannong Cao received the BSc degree in computer science from Nanjing University, Nanjing, China in 1982, and the MSc and the Ph.D degrees in computer science from Washington State University, Pullman, WA, USA, in 1986 and 1990 respectively. He is currently an associate professor in Department of Computing at the Hong Kong Polytechnic University, Hong Kong. He is also the director of the Internet and Mobile Computing Lab in the department. He was on the faculty of computer science at James Cook University and University of Adelaide in Australia, and City University of Hong Kong. His research interests include parallel and distributed computing, networking, mobile computing, fault tolerance, and distributed software architecture and tools. He has published over 120 technical papers in the above areas. He has served as a member of editorial boards of several international journals, a reviewer for international journals/conference proceedings, and also as an organizing/programme committee member for many international conferences. Dr. Cao is a member of the IEEE Computer Society, the IEEE Communication Society, IEEE, and ACM. He is also a member of the IEEE Technical Committee on Distributed Processing, IEEE Technical Committee on Parallel Processing, IEEE Technical Committee on Fault Tolerant Computing, and Computer Architecture Professional Committee of the China Computer Federation. Alvin Chan is currently an assistant professor at the Hong Kong Polytechnic University. He graduated from the University of New South Wales with a Ph.D. degree in 1995 and was subsequently employed as a Research Scientist by the CSIRO, Australia. From 1997 to 1998, he was employed by the Centre for Wireless Communications, National University of Singapore as a Program Manager. Dr. Chan is one of the founding members and director of a university spin-off company, Information Access Technology Limited. He is an active consultant and has been providing consultancy services to both local and overseas companies. His research interests include mobile computing, context-aware computing and smart card applications. Yudong Sun received the B.S. and M.S. degrees from Shanghai Jiao Tong University, China. He received Ph.D. degree from the University of Hong Kong in 2002, all in computer science. From 1988 to 1996, he was among the teaching staff in Department of Computer Science and Engineering at Shanghai Jiao Tong University. From 2002 to 2003, he held a research position at the Hong Kong Polytechnic University. At present, he is a Research Associate in School of Computing Science at University of Newcastle upon Tyne, UK. His research interests include parallel and distributed computing, Web services, Grid computing, and bioinformatics. Sajal K. Das is currently a Professor of Computer Science and Engineering and the Founding Director of the Center for Research in Wireless Mobility and Networking (CReWMaN) at the University of Texas at Arlington. His current research interests include resource and mobility management in wireless networks, mobile and pervasive computing, sensor networks, mobile internet, parallel processing, and grid computing. He has published over 250 research papers, and holds four US patents in wireless mobile networks. He received the Best Paper Awards in ACM MobiCom’99, ICOIN-16, ACM, MSWiM’00 and ACM/IEEE PADS’97. Dr. Das serves on the Editorial Boards of IEEE Transactions on Mobile Computing, ACM/Kluwer Wireless Networks, Parallel Processing Letters, Journal of Parallel Algorithms and Applications. He served as General Chair of IEEE PerCom’04, IWDC’04, MASCOTS’02 ACM WoWMoM’00-02; General Vice Chair of IEEE PerCom’03, ACM MobiCom’00 and IEEE HiPC’00-01; Program Chair of IWDC’02, WoWMoM’98-99; TPC Vice Chair of ICPADS’02; and as TPC member of numerous IEEE and ACM conferences. Minyi Guo received his Ph.D. degree in information science from University of Tsukuba, Japan in 1998. From 1998 to 2000, Dr. Guo had been a research scientist of NEC Soft, Ltd. Japan. He is currently a professor at the Department of Computer Software, The University of Aizu, Japan. From 2001 to 2003, he was a visiting professor of Georgia State University, USA, Hong Kong Polytechnic University, Hong Kong. Dr. Guo has served as general chair, program committee or organizing committee chair for many international conferences, and delivered more than 20 invited talks in USA, Australia, China, and Japan. He is the editor-in-chief of the Journal of Embedded Systems. He is also in editorial board of International Journal of High Performance Computing and Networking, Journal of Embedded Computing, Journal of Parallel and Distributed Scientific and Engineering Computing, and International Journal of Computer and Applications. Dr. Guo’s research interests include parallel and distributed processing, parallelizing compilers, data parallel languages, data mining, molecular computing and software engineering. He is a member of the ACM, IEEE, IEEE Computer Society, and IEICE. He is listed in Marquis Who’s Who in Science and Engineering.  相似文献   
57.
58.
Isolation by resistance   总被引:4,自引:0,他引:4  
Despite growing interest in the effects of landscape heterogeneity on genetic structuring, few tools are available to incorporate data on landscape composition into population genetic studies. Analyses of isolation by distance have typically either assumed spatial homogeneity for convenience or applied theoretically unjustified distance metrics to compensate for heterogeneity. Here I propose the isolation-by-resistance (IBR) model as an alternative for predicting equilibrium genetic structuring in complex landscapes. The model predicts a positive relationship between genetic differentiation and the resistance distance, a distance metric that exploits precise relationships between random walk times and effective resistances in electronic networks. As a predictor of genetic differentiation, the resistance distance is both more theoretically justified and more robust to spatial heterogeneity than Euclidean or least cost path-based distance measures. Moreover, the metric can be applied with a wide range of data inputs, including coarse-scale range maps, simple maps of habitat and nonhabitat within a species' range, or complex spatial datasets with habitats and barriers of differing qualities. The IBR model thus provides a flexible and efficient tool to account for habitat heterogeneity in studies of isolation by distance, improve understanding of how landscape characteristics affect genetic structuring, and predict genetic and evolutionary consequences of landscape change.  相似文献   
59.
Observations of primate groups have shown that social learning can lead to the development of temporal stable traditions or even proto-culture. The social structure of primate groups is highly diverse and it has been proposed that differences in the group structure shall influence the patterns of social information transmission. While empirical studies have mainly focused on the psychological mechanisms of social learning in individuals, the phenomenon of information propagation within the group has received relatively little attention. This might be due to the fact that formal theories that allow actual testing have not been formulated, or were kept too simple, ignoring the social dynamics of multi-agent societies. We want to propose a network approach to social information transmission that (1) preserves the complexity of the social structure of primate groups and (2) allows direct application to empirical data. Results from simulation experiments with artificial group structures confirm that association patterns of group-members influence the expected speed of information transmission during the propagation process. Introducing a forgetting rate shows that under certain conditions the proportion of informed individuals will reach a stable rate in some systems while it will drop to zero in others. This suggests that the likelihood to observe temporal stable traditions shall differ between social systems with different structure.  相似文献   
60.
【背景】铜绿假单胞菌(Pseudomonas aeruginosa)是临床引发感染的主要病原菌之一,对多种抗菌药物均有耐药性,临床治疗难度大,对该病原菌耐药性的研究一直备受关注。【目的】基于CiteSpace可视化功能,探究铜绿假单胞菌耐药性研究现状、热点与发展趋势。【方法】利用文献计量分析法,以2014–2021年中国知网(CNKI)、万方数据库(Wanfang)、Web of Science (WoS)共8 996篇铜绿假单胞菌耐药性的中英文文献为分析样本,运用Citespace软件对文献发文量、作者合作网络、国家和机构合作网络、文献共被引及期刊分析、关键词聚类、突现等方面进行分析,以探究该研究主题的研究热点及趋势。【结果】英文文献发文量增长速度高于中文文献;我国文献发文量仅次于美国、印度,在该领域科研成果贡献度较高,国际学术影响力较大;中英文文献中均对院内感染疾病和耐碳青霉烯类铜绿假单胞菌持高关注度。然而,中文文献较关注铜绿假单胞菌耐药性的临床防治问题,英文文献则较关注铜绿假单胞菌耐药性的基础研究。【结论】国内外铜绿假单胞菌耐药性研究对院内感染疾病及新型耐药菌的产生与防治关注度最高,暗示以上研究主题是该领域的研究热点与趋势。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号