首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   47334篇
  免费   5574篇
  国内免费   2024篇
化学   4957篇
晶体学   55篇
力学   2818篇
综合类   643篇
数学   11575篇
物理学   8768篇
无线电   26116篇
  2024年   78篇
  2023年   424篇
  2022年   755篇
  2021年   1126篇
  2020年   1228篇
  2019年   801篇
  2018年   831篇
  2017年   1416篇
  2016年   1826篇
  2015年   1849篇
  2014年   3393篇
  2013年   3107篇
  2012年   3407篇
  2011年   3366篇
  2010年   2567篇
  2009年   2741篇
  2008年   3128篇
  2007年   3267篇
  2006年   2877篇
  2005年   2495篇
  2004年   2325篇
  2003年   2113篇
  2002年   1704篇
  2001年   1318篇
  2000年   1085篇
  1999年   950篇
  1998年   781篇
  1997年   672篇
  1996年   582篇
  1995年   576篇
  1994年   394篇
  1993年   344篇
  1992年   251篇
  1991年   247篇
  1990年   155篇
  1989年   98篇
  1988年   138篇
  1987年   79篇
  1986年   69篇
  1985年   75篇
  1984年   51篇
  1983年   36篇
  1982年   37篇
  1981年   42篇
  1980年   28篇
  1979年   31篇
  1978年   16篇
  1977年   12篇
  1976年   8篇
  1974年   7篇
排序方式: 共有10000条查询结果,搜索用时 184 毫秒
41.
基于SONET/SDH的存储网络容灾技术分析   总被引:1,自引:0,他引:1  
文章分析了存储网络(SAN)容灾技术,认为在某些企业中,数据是至关重要的资产之一,是业务系统运行的血脉.保护企业的重要数据是企业成功的关键因素。文章讨论了设计容灾技术解决方案应考虑的各种因素,并给出了基于SONET/SDH的存储网络技术的体系架构设计方案。  相似文献   
42.
3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments. Meanwhile, the optimal number of rake combiners is also analyzed in this paper. This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018.  相似文献   
43.
With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising target application. We classify mobile information service domains based on feature characteristics of the information sources and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic data management problem that must be addressed for effective location based services in mobile environments. We then devise a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns. Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest that different strategies are effective for different types of data in response to different patterns of movement and information access. Shiow-yang Wu is an associate professor of the Department of Computer Science and Information Engineering at National Dong Hwa University, Hualien, Taiwan, R.O.C. He received the BS and MS degrees in computer engineering from National Chiao Tung University, Hsinchu, Taiwan, ROC, and the PhD degree in computer science from the University of Texas at Austin in 1984, 1986, and 1995, respectively. His research interests include data/knowledge bases, mobile computing, distributed processing, intelligence information systems, and electronic commerce. Kun-Ta Wu was born in Taipei, Taiwan, R.O.C., in 1976. He received the B.S. degree in computer science from Soochow University, Taipei, Taiwan, R.O.C., in 1999 and the M.S. degree in computer science and information engineering from National Dong Hwa University, Hualien, Taiwan, R.O.C., in 2001. Currently, he is an Assistant Researcher in the Domestic Division at Science and Technology Information Center, National Science Council, R.O.C., as a member of Information Gathering and Analysis Group of National Information and Communication Security Taskforce. His research interests include mobile computing, wireless network and information security.  相似文献   
44.
陈艳 《电子工艺技术》2003,24(4):174-176
随着运动控制技术的飞速发展,交流伺服系统应用的日益广泛。介绍了液晶生产中的关键设备玻璃裂片机,并详细分析松下MINAS A系列交流伺服系统在玻璃裂片机中的应用。  相似文献   
45.
基于mobile agent的分布式网络自管理模型   总被引:2,自引:1,他引:1  
郭楠  赵宏 《通信学报》2003,24(3):130-138
为了解决大规模、异构网络环境下基于“管理员密集”的传统网络管理模式带来的低效率和高出错率问题,提出了一种网络自管理模型,从网络管理的自动初始化和动态自管理两个方面实现对网络自动、自主、自适应的管理;提出了管理定位服务这一关键技术,在多个管理站协同工作的分布式网络环境中为设备自动定位出合适的管理站及初始的管理任务;采用可伸缩的分布式体系结构,适应了大规模网络的规模可变性等特点;基于mobile agent的管理框架进一步提高了管理的自适应性和灵活性。  相似文献   
46.
周萍 《电子工程师》2006,32(1):61-64
从扬声器系统的等效类比线路出发,得出了阻抗特性Z(jω)的表达形式及其曲线。采用全面最小二乘法识别扬声器系统的时域函数的全套系数,从而测出扬声器系统的低频特性参数。以计算机仿真技术为基础,通过MATLAB和EWB软件进行系统模拟分析仿真,得到扬声器系统的阶跃响应、阻抗曲线等特性。  相似文献   
47.
针对国外变频器价格昂贵、调试周期和维修周期长等特点,我公司自主研发了可替代进口机的高性能钻机国产专用变频器。该变频器能够从零开始调速。当钻井卡钻时,能及时断开电动机,在低速提升时,能最大限度地发挥电动机的动力特性,提供220%的转矩输出。变频器具有易安装、调试、维护,性能稳定。应用中据实测数据显示,采用变频改造后,打1口井可节省柴油15t。  相似文献   
48.
论文比较详细地阐述了涉密网主机系统所面临的安全隐患,提出了涉密网主机安全防护所要解决的几个技术问题,并就可能实现的技术方法进行了探讨和比较。  相似文献   
49.
Efficient multicast search under delay and bandwidth constraints   总被引:1,自引:0,他引:1  
The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California. From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February 1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University, Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York. Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks, mobility, search strategies, and multiple access protocols.  相似文献   
50.
文章分析了人工免疫系统的原理,简单建立了一种基于否定选择算法的网络入侵检测系统,引入了一种用于异常事件识别的r-字符块匹配规则,并对规则存在的漏洞进行了分析。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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