首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   151553篇
  免费   6403篇
  国内免费   3176篇
电工技术   4201篇
技术理论   10篇
综合类   6253篇
化学工业   23333篇
金属工艺   8447篇
机械仪表   7245篇
建筑科学   8086篇
矿业工程   2552篇
能源动力   3124篇
轻工业   7730篇
水利工程   2360篇
石油天然气   4694篇
武器工业   534篇
无线电   17252篇
一般工业技术   24841篇
冶金工业   6158篇
原子能技术   1031篇
自动化技术   33281篇
  2024年   250篇
  2023年   1121篇
  2022年   1851篇
  2021年   2507篇
  2020年   1999篇
  2019年   1760篇
  2018年   16030篇
  2017年   15265篇
  2016年   11721篇
  2015年   3219篇
  2014年   3467篇
  2013年   4073篇
  2012年   7343篇
  2011年   13744篇
  2010年   12045篇
  2009年   9155篇
  2008年   10329篇
  2007年   11316篇
  2006年   3947篇
  2005年   4519篇
  2004年   3391篇
  2003年   3140篇
  2002年   2454篇
  2001年   1845篇
  2000年   1926篇
  1999年   2080篇
  1998年   1859篇
  1997年   1511篇
  1996年   1461篇
  1995年   1089篇
  1994年   1045篇
  1993年   722篇
  1992年   560篇
  1991年   462篇
  1990年   329篇
  1989年   262篇
  1988年   247篇
  1987年   149篇
  1986年   105篇
  1985年   80篇
  1984年   38篇
  1982年   40篇
  1968年   43篇
  1966年   42篇
  1965年   44篇
  1959年   37篇
  1958年   37篇
  1957年   36篇
  1955年   63篇
  1954年   68篇
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
991.
应用新的特异性θ诊断血清和传统商品血清与434株伤寒沙门氏菌地方株作玻片凝集平行试验,两者诊断符合率为100%。θ血清与0.1%酚琼脂斜面上的所有伤寒沙门氏菌呈迅速清晰的阳性凝集反应。鉴于θ血清与大多数D群沙门氏菌不凝集,因此,大大提高诊断的正确性。  相似文献   
992.
文章主要研究了无线网络技术的特点及其在现实生活中的实际应用。论文首先对无线网络进行了概述,针对不同的无线技术分析了它们的特点。在阐述如何组建无线网络的同时,对面临的网络安全问题也提出了解决方案。  相似文献   
993.
根据公司对文档报表管理的实际需求,通过对某房地产评估公司的日常报告文档管理的各方面的需求分析,将系统的需求抽象化、模块化、系统化,利用.NET开发平台MVC架构实现了报告信息管理、数据维护管理、公司收据和报告文档管理等功能,实现了管理文档的规范化和信息化,提高公司管理文档信息的工作质量、管理水平,为用户提供更为方便快捷的服务。  相似文献   
994.
随着信息技术的发展,企业内网安全得到了越来越多企业的重视,如何建立一个合格的内网安全系统,如何进行网络安全策略设置,如何实施内网安全系统,如何保证企业内部核心数据安全,成为企业迫切需要解决的问题。本文从内网安全的概念,内网安全系统的实施原则、建设的架构、具体的实现功能和内网安全系统发展展望等方面进行了探讨,为企业内网安全系统的建设提供了参考指导和帮助。  相似文献   
995.
随着全国公路机电规模的不断发展。对于公路信息的营运工作也越来越复杂,如何通过利用现代化的管理手段和技术来充分发挥出高速公路的运营效益,成为现在高速公路运营管理的当务之急。  相似文献   
996.
文中主要通过企业移动信息信息安全方案的设计以及具体的安全保密方案入手,对其进行了分析,希望能够找到有利于企业移动信息安全保密的最佳化方案。  相似文献   
997.
P2P video streaming networks are found as a scalable solution and an alternative for traditional client–server based video streaming over the Internet. One of the significant issues affecting the success of any P2P streaming network is cooperation between peers. Practical observations have proved the prevalence of free riders in P2P networks that degrade their performance. To solve this problem, using incentive mechanisms, which encourage peers to contribute more in the network, is necessary. In this paper, we designed and proposed a distributed and scalable incentive mechanism for mesh based P2P video streaming networks. In the proposed approach the contribution of the peers is measured and maintained in a distributed fashion. Furthermore, we proposed an incentive sending side scheduler in which peers are served based on their contribution in the network. Our simulation evaluations show the efficiency of the proposed approach in improving the overall perceived video quality by the non-free rider nodes and consequently in the whole network.  相似文献   
998.
Peer-to-Peer (P2P) traffic has increased rapidly over the past few years, with file sharing providing the main drive behind such traffic. In this work we perform a measurement study of the content shared over the popular BitTorrent P2P file sharing network. We mathematically model the file size distributions of shared files after categorizing them into Audio, Video, Archive and CD image classes. For each of these categories we look into the most popular shared file formats and investigate their file size statistics. This provides an important milestone to building a realistic simulation framework for P2P systems, and for future analytical modeling of P2P networks.  相似文献   
999.
Resource scheduling in large-scale distributed systems, such as grids and clouds, is difficult due to the size, dynamism, and volatility of resources. These resources are eclectic and autonomous, and may exhibit different usage policies, levels of participation, capabilities, local load, and reliability. Moreover, applications are likely to exhibit various patterns and levels, and distributed resources may organize into various different overlay topologies for information and query dissemination. Researchers have proposed a wide variety of approaches and policies for mapping offered load onto resources and for solving the various component parts of the scheduling problem. However, production clouds and grids may be underutilized, and may not exhibit the load to effectively characterize all of the scheduling system inputs. The composition of large-scale systems is also changing, potentially to include more individual and peer-to-peer resources. These factors will influence the effectiveness of proposed scheduling solutions. Therefore, a simulation environment is necessary to study different approaches under different scenarios, especially those that are expected, but that are not currently characteristic of existing systems. This article describes a general-purpose peer-to-peer simulation environment that allows a wide variety of parameters, protocols, strategies and policies to be varied and studied. To provide a proof of concept, utilization of the simulation environment is presented in a large-scale distributed system problem that includes a core model and related mechanisms. In particular, this article presents a definition and possible peer-to-peer solutions for the large-scale scheduling problem. Moreover, this article describes a general simulation model, some policies that can be varied, an implementation, and some sample results.  相似文献   
1000.
A super-peer semantic network defines the semantic groups that client peers and their super peers use to connect with each other according to the semantic similarity of shared documents in peers. This will result in a query that can be evaluated locally thus reducing query process time and the amount of communication required to obtain related data. In this study, new algorithms are proposed to arrange shared documents in peers into hierarchical cluster tree structures, and links will be set up to connect semantically related super peers. During query evaluation, only related peers will be searched thus the complexity of computing is significantly reduced. Consideration is also given to automatically deciding the threshold for clustering and the construction and other essential operations for hierarchical cluster trees. The experiment results illustrate the features of the approach developed in this study.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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