首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   64246篇
  免费   5255篇
  国内免费   2822篇
电工技术   3630篇
技术理论   7篇
综合类   4230篇
化学工业   10998篇
金属工艺   3572篇
机械仪表   3935篇
建筑科学   5461篇
矿业工程   1855篇
能源动力   1877篇
轻工业   4053篇
水利工程   1159篇
石油天然气   4508篇
武器工业   450篇
无线电   7068篇
一般工业技术   8010篇
冶金工业   3106篇
原子能技术   719篇
自动化技术   7685篇
  2024年   226篇
  2023年   1039篇
  2022年   1725篇
  2021年   2446篇
  2020年   1890篇
  2019年   1642篇
  2018年   1864篇
  2017年   2097篇
  2016年   1905篇
  2015年   2369篇
  2014年   3218篇
  2013年   3671篇
  2012年   4085篇
  2011年   4426篇
  2010年   3882篇
  2009年   3684篇
  2008年   3609篇
  2007年   3510篇
  2006年   3564篇
  2005年   3083篇
  2004年   2089篇
  2003年   1876篇
  2002年   1645篇
  2001年   1599篇
  2000年   1653篇
  1999年   1770篇
  1998年   1382篇
  1997年   1169篇
  1996年   1050篇
  1995年   936篇
  1994年   769篇
  1993年   556篇
  1992年   433篇
  1991年   336篇
  1990年   312篇
  1989年   226篇
  1988年   174篇
  1987年   107篇
  1986年   104篇
  1985年   60篇
  1984年   41篇
  1983年   26篇
  1982年   33篇
  1981年   22篇
  1980年   13篇
  1979年   3篇
  1978年   1篇
  1976年   1篇
  1975年   1篇
  1959年   1篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
首先从混合式P2P网络拓扑结构出发,结合DHT思想,提出了基于DHT的层次化P2P网络模型.其次根据在文档集巨大的情况下,用户提交的查询不可能"面面俱到",实际用来回答查询的文档仅仅是文档集中很小的一部分这一思想,在层次化P2P模型的超级节点中建立了分布式缓存,运用分布式索引与缓存技术,提出一种新的方法来解决多项查询问题.即由多项查询中的某个关键字key,根据hash函数定位到负责该key的超级节点,查询该节点上的分布式索引得到缓存具体存储位置,最终将结果返回给用户,如若缓存中没有所要查询的内容,则广播该查询,同时根据系统中的历史广播查询信息来计算某个待选缓存项的利益值,利益最大的待选项加入缓存.一般针对多项查询的泛洪算法往往会造成巨大的网络信息量,提出的方法牺牲了超级节点上一小部分的存储力,缓解了多项查询造成的网络拥挤现象.同时,基于DHT的层次化P2P模型也具有很好的稳定性,不会因为大量节点的动态加入或者退出而无法进行多项查询.  相似文献   
992.
993.
This article addresses the high-precision coordinated control problem of spacecraft autonomous rendezvous and docking, which couple the relative position and attitude in the final approach phase. The coupled dynamics equations of the tracking-target spacecrafts is derived by using dual quaternions. Then, a cascade Active Disturbance Rejection Controller is proposed, by which the extended state observer and nonlinear error feedback law is designed, the virtual value on which the actual control volume tracking is calculated to ensure the finite time convergence of the relative position and attitude tracking errors in spite of parametric uncertainties and external disturbances. Finally, numerical simulations are performed to demonstrate that the proposed approaches, which can avoid the coupling effect and restrain the interference, can track the target spacecraft in a relatively short period of time, and the control precision can satisfy the requirements of docking.  相似文献   
994.
995.
996.
997.
Solving large-scale sparse linear systems over GF(2) plays a key role in fluid mechanics, simulation and design of materials, petroleum seismic data processing, numerical weather prediction, computational electromagnetics, and numerical simulation of unclear explosions. Therefore, developing algorithms for this issue is a significant research topic. In this paper, we proposed a hyper-scale custom supercomputer architecture that matches specific data features to process the key procedure of block Wiedemann algorithm and its parallel algorithm on the custom machine. To increase the computation, communication, and storage performance, four optimization strategies are proposed. This paper builds a performance model to evaluate the execution performance and power consumption for our custom machine. The model shows that the optimization strategies result in a considerable speedup, even three times faster than the fastest supercomputer, TH2, while consuming less power.  相似文献   
998.
Through glass via (TGV) technology is considered to be a cost effective enabler for the integration of micro electromechanical systems and radio frequency devices. Inductively coupled plasma and Bosch etching process comprise one of the most pervasive methods for through silicon via (TSV) formation. Unfortunately an equivalent process for glass etching remains elusive. In this paper, the influence of plasma etching for fused silica glass were investigated to find the best tradeoff between etch rate and profile of TGVs. The process parameters including bias power, gas flow rate, ratio of etching gases and reaction chamber pressure using Ar/C4F8 inductively coupled plasmas were studied. The etching results show that all these three parameters have a significant impact on the etch rate. Furthermore, the adjustment including total flow rate and ratio of Ar/C4F8 and chamber pressure can be used to control the via profile. Constant fused silica glass etch rate greater than 1 μm/min was obtained when chiller temperature was 40 °C with etching time of 60 min. The profile angle of TGVs with nearly 90° was also achieved.  相似文献   
999.
Simulation of the tongue has important applications in biomechanics, medical science, linguistics, and graphics. The accuracy of the geometry, intrinsic structure and dynamic simulation of tongue are crucial for these applications. In this paper, we build a 3D anatomically and biomechanically accurate tongue model. For ensuring anatomical accuracy, the tongue mesh model is constructed based on accurate medical data and an interactive muscle marking method for specifying the muscle geometry and fiber arrangement. For ensuring biomechanical accuracy, a nonlinear, quasi-incompressible, isotropic, hyperelastic constitutive model is applied for describing the tongue tissues. Particularly, tongue muscles are additionally endowed with an anisotropic constitutive model, which reflects the active and passive mechanical behavior of muscle fibers. The dynamic simulation results of tongue movements subjected to certain muscle activations are presented and validated with experimental data, indicating the suitability for visual speech synthesis.  相似文献   
1000.
We investigate the quantum image matching algorithm proposed by Jiang et al. (Quantum Inf Process 15(9):3543–3572, 2016). Although the complexity of this algorithm is much better than the classical exhaustive algorithm, there may be an error in it: After matching the area between two images, only the pixel at the upper left corner of the matched area played part in following steps. That is to say, the paper only matched one pixel, instead of an area. If more than one pixels in the big image are the same as the one at the upper left corner of the small image, the algorithm will randomly measure one of them, which causes the error. In this paper, an improved version is presented which takes full advantage of the whole matched area to locate a small image in a big image. The theoretical analysis indicates that the network complexity is higher than the previous algorithm, but it is still far lower than the classical algorithm. Hence, this algorithm is still efficient.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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