全文获取类型
收费全文 | 12963篇 |
免费 | 2200篇 |
国内免费 | 1613篇 |
专业分类
电工技术 | 659篇 |
综合类 | 1621篇 |
化学工业 | 1340篇 |
金属工艺 | 332篇 |
机械仪表 | 983篇 |
建筑科学 | 1551篇 |
矿业工程 | 318篇 |
能源动力 | 606篇 |
轻工业 | 420篇 |
水利工程 | 499篇 |
石油天然气 | 620篇 |
武器工业 | 209篇 |
无线电 | 1028篇 |
一般工业技术 | 1299篇 |
冶金工业 | 654篇 |
原子能技术 | 209篇 |
自动化技术 | 4428篇 |
出版年
2024年 | 63篇 |
2023年 | 180篇 |
2022年 | 399篇 |
2021年 | 496篇 |
2020年 | 558篇 |
2019年 | 499篇 |
2018年 | 500篇 |
2017年 | 564篇 |
2016年 | 673篇 |
2015年 | 682篇 |
2014年 | 987篇 |
2013年 | 1030篇 |
2012年 | 1171篇 |
2011年 | 1205篇 |
2010年 | 972篇 |
2009年 | 931篇 |
2008年 | 814篇 |
2007年 | 922篇 |
2006年 | 721篇 |
2005年 | 651篇 |
2004年 | 478篇 |
2003年 | 394篇 |
2002年 | 314篇 |
2001年 | 278篇 |
2000年 | 256篇 |
1999年 | 151篇 |
1998年 | 115篇 |
1997年 | 116篇 |
1996年 | 89篇 |
1995年 | 68篇 |
1994年 | 57篇 |
1993年 | 49篇 |
1992年 | 37篇 |
1991年 | 33篇 |
1990年 | 33篇 |
1989年 | 19篇 |
1988年 | 19篇 |
1987年 | 14篇 |
1984年 | 11篇 |
1979年 | 11篇 |
1965年 | 12篇 |
1964年 | 16篇 |
1963年 | 16篇 |
1960年 | 9篇 |
1959年 | 14篇 |
1958年 | 8篇 |
1957年 | 14篇 |
1956年 | 9篇 |
1955年 | 14篇 |
1954年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
971.
In this work we introduce two practical and interesting models of ad-hoc mobile networks: (a) hierarchical ad-hoc networks, comprised of dense subnetworks of mobile users interconnected by a very fast yet limited backbone infrastructure, (b) highly changing ad-hoc networks, where the deployment area changes in a highly dynamic way and is unknown to the protocol. In such networks, we study the problem of basic communication, i.e., sending messages from a sender node to a receiver node. For highly changing networks, we investigate an efficient communication protocol exploiting the coordinated motion of a small part of an ad-hoc mobile network (the runners support) to achieve fast communication. This protocol instead of using a fixed sized support for the whole duration of the protocol, employs a support of some initial (small) size which adapts (given some time which can be made fast enough) to the actual levels of traffic and the (unknown and possibly rapidly changing) network area, by changing its size in order to converge to an optimal size, thus satisfying certain Quality of Service criteria. Using random walks theory, we show that such an adaptive approach is, for this class of ad-hoc mobile networks, significantly more efficient than a simple non-adaptive implementation of the basic runners support idea, introduced in [9,10]. For hierarchical ad-hoc networks, we establish communication by using a runners support in each lower level of the hierarchy (i.e., in each dense subnetwork), while the fast backbone provides interconnections at the upper level (i.e., between the various subnetworks). We analyze the time efficiency of this hierarchical approach. This analysis indicates that the hierarchical implementation of the support approach significantly outperforms a simple implementation of it in hierarchical ad-hoc networks. Finally, we discuss a possible combination of the two approaches above (the hierarchical and the adaptive ones) that can be useful in ad-hoc networks that are both hierarchical and highly changing. Indeed, in such cases the hierarchical nature of these networks further supports the possibility of adaptation. 相似文献
972.
一种Web用户行为聚类算法 总被引:13,自引:0,他引:13
提出了一种新的路径相似度系数计算方法,并使之与雅可比相似系数结合,用于计算用户访问行为的相似度,在此基础之上又提出了一种分析web用户行为的聚类算法(FCC)。通过挖掘Web日志,找出具有相似行为的web用户,由于FCC聚类算法过滤了小于指定阚值的相似度系数,大大缩小了数据规模,很好地解决了其他聚类算法(如层次聚类)在高堆空间聚类时的“堆数灾难”问题,最后的实验结果很好。 相似文献
973.
This paper attempts an exhaustive review of the literature on the psychotherapeutic relationship. The nature of the ideal psychotherapeutic relationship is defined and approximations of this ideal are shown to correlate positively with various measures of patient progress in the therapeutic enterprise. Other correlates of good therapeutic relationships are then explored: patient variables, therapist variables, therapist-patient similarity, and technique variables. In all these areas, significant correlations are found, though not as often as one might expect. The research on therapist variables is especially disappointing, while patient variables seem to be quite good predictors of the quality of the ensuring patient-therapist relationship. Methodological issues are considered throughout the paper. (72 ref.) (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
974.
Intercorrelations between 19 response set scales, based upon the scores of 110 students, were factor analyzed and the factors rotated orthogonally. Edwards' SD scale and 6 experimental social desirability scales had their highest loadings on the 1st factor. 3 scales containing neutral items in which the probability of a True response to the items varied between scales were found to have their highest loadings on 3 different factors. Scales designed to measure the tendency to give deviant True responses to items with socially undesirable scale values, to items with socially desirable scale values, and to items with neural scale values were found to have their highest loadings on 3 different factors. The tendency to give deviant True responses to items with socially undesirable scale values was found to be related to the tendency to give deviant False responses to items with socially desirable scale values. The tendency to mark items as doubtful and the tendency to answer items marked doubtful as True were identified as 2 factors unrelated to social desirability tendencies. (31 ref.) (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
975.
现有的l^1鲁棒辨识方法依赖于观测数据窗的起始时刻因而不能用来辨识时变系统,针对该问题基于最小二乘法提出了一种l^1鲁棒辨识算法.该算法与观测窗的起始时刻无关,可用于时变系统的辨识.证明了当试验输入为持续激励信号时所提出的算法为本质最优算法,进一步证明了周期持续激励序列为最优试验信号,并给出了辨识误差紧界的计算公式.最后利用提出的算法研究了慢时变系统的l^1鲁棒辨识问题. 相似文献
976.
977.
978.
Thermophysical and thermochemical property data on organic compounds provide vital background information for scientific and engineering communities in both academic and industrial environments. The Thermodynamics Research Center (TRC) has collected an enormous amount of property data over the past 55 years. New advances in computer technology enable relatively large databases to have friendly communications based upon a PC Windows platform. Here we discuss the structure, upgrade procedures, and mechanisms for distribution over local PC networks and the Internet, with emphasis on three databases: TRC COMPOUNDS (Wincmp), SOURCE (WinSource), the archive of raw experimental data, and TRC TABLE (WinTable), the TRC collection of recommended data. 相似文献
979.
Wangzhong Lu J. Janssen E. Milios N. Japkowicz Yongzheng Zhang 《Knowledge and Information Systems》2007,11(1):105-129
Published scientific articles are linked together into a graph, the citation graph, through their citations. This paper explores the notion of similarity based on connectivity alone, and proposes several algorithms to quantify it. Our metrics take advantage of the local neighborhoods of the nodes in the citation graph. Two variants of link-based similarity estimation between two nodes are described, one based on the separate local neighborhoods of the nodes, and another based on the joint local neighborhood expanded from both nodes at the same time. The algorithms are implemented and evaluated on a subgraph of the citation graph of computer science in a retrieval context. The results are compared with text-based similarity, and demonstrate the complementarity of link-based and text-based retrieval.
Wangzhong Lu holds a Bachelor's degree from Hefei University of Technology (1993), and a Master's degree from Dalhousie University (2001), both in computer science. From 1993 to 1999 he worked as a developer with China National Computer Software and Technical Service Corp. in Beijing. From 2001 to 2005 he held industrial positions as a senior software architect in Atlantic Canada. He is currently with DST Systems, Charlotte, NC, as a senior data architect.
Jeannette Janssen's research area is applied graph theory. She has worked on the problem of frequency assignment in cellular and digital broadcasting networks. Her current interest is in graph theory applied to the World Wide Web and other networked information spaces. Dr. Janssen did her Master's studies at Eindhoven University of Technology in the Netherlands, and her doctorate at Lehigh University, USA. She is currently an associate professor at Dalhousie University, Canada.
Evangelos Milios received a diploma in electrical engineering from the National Technical University of Athens, and Master's and Ph.D. degrees in electrical engineering and computer science from the Massachusetts Institute of Technology. He held faculty positions at the University of Toronto and York University. He is currently a professor of computer science at Dalhousie University, Canada, where he was Director of the Graduate Program. He has served on the committees of the ACM Dissertation Award, and the AAAI/SIGART Doctoral Consortium. He has worked on the interpretation of visual and range signals for landmark-based positioning, navigation and map construction in single- and multi-agent robotics. His current research activity is centered on Networked Information Spaces, Web information retrieval, and aquatic robotics. He is a senior member of the IEEE.
Nathalie Japkowicz is an associate professor at the School of Information Technology and Engineering of the University of Ottawa. She obtained her Ph.D. from Rutgers University, her M.Sc. from the University of Toronto, and her B.Sc. from McGill University. Prior to joining the University of Ottawa, she taught at Ohio State University and Dalhousie University. Her area of specialization is Machine Learning and her most recent research interests focused on the class imbalance problem. She made over 50 contributions in the form of journal articles, conference articles, workshop articles, magazine articles, technical reports or edited volumes.
Yongzheng Zhang obtained a B.E. in computer applications from Southeast University, China, in 1997 and a M.S. in computer science from Dalhousie University in 2002. From 1997 to 1999 he was an instructor and undergraduate advisor at Southeast University. He also worked as a software engineer in Ricom Information and Telecommunications Co. Ltd., China. He is currently a Ph.D. candidate at Dalhousie University. His research interests are in the areas of Information Retrieval, Machine Learning, Natural Language Processing, and Web Mining, particularly centered on Web Document Summarization. A paper based on his Master's thesis received the best paper award at the 2003 Canadian Artificial Intelligence conference. 相似文献
980.