首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   403648篇
  免费   4684篇
  国内免费   1364篇
电工技术   7565篇
综合类   316篇
化学工业   59809篇
金属工艺   16424篇
机械仪表   13488篇
建筑科学   8348篇
矿业工程   2154篇
能源动力   11522篇
轻工业   28450篇
水利工程   4266篇
石油天然气   7913篇
武器工业   17篇
无线电   49232篇
一般工业技术   82963篇
冶金工业   74954篇
原子能技术   9181篇
自动化技术   33094篇
  2022年   2549篇
  2021年   3883篇
  2020年   2940篇
  2019年   3801篇
  2018年   6479篇
  2017年   6474篇
  2016年   6917篇
  2015年   4316篇
  2014年   7131篇
  2013年   20021篇
  2012年   11405篇
  2011年   15259篇
  2010年   12137篇
  2009年   13707篇
  2008年   14046篇
  2007年   13810篇
  2006年   12414篇
  2005年   11111篇
  2004年   10504篇
  2003年   10416篇
  2002年   9825篇
  2001年   9732篇
  2000年   9133篇
  1999年   9520篇
  1998年   24324篇
  1997年   16707篇
  1996年   12797篇
  1995年   9516篇
  1994年   8362篇
  1993年   8379篇
  1992年   6054篇
  1991年   5694篇
  1990年   5679篇
  1989年   5317篇
  1988年   5043篇
  1987年   4419篇
  1986年   4299篇
  1985年   4812篇
  1984年   4421篇
  1983年   3994篇
  1982年   3654篇
  1981年   3730篇
  1980年   3429篇
  1979年   3326篇
  1978年   3334篇
  1977年   3750篇
  1976年   4847篇
  1975年   2850篇
  1974年   2663篇
  1973年   2730篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
A discrete time domain model for the LCC-type parallel resonant power converter has been derived. This model has been used to predict the large signal behavior of the power converter. The peak component stresses and the dynamic response of the key state variables, as obtained from the large signal analysis, using PRO-MATLAB software are plotted. SPICE results are included to verify the analytical results. Experimental results are also presented to verify the theory  相似文献   
992.
993.
Guitart  J. Ruiz-Moreno  S. 《Electronics letters》1993,29(17):1589-1591
A new method for calculating the probability density function of the photon number propagating through a travelling wave optical amplifier with no restriction on its working regime (linear and nonlinear) is reported. The authors show that the widely used Gaussian approximation of the probability density function does not match the real statistics if the incident optical power is small.<>  相似文献   
994.
Scientific-Technical Center “Atomtekhénergo.” Leningrad Nuclear Power Plant. N. V. Sultanov Institute of Nuclear Reactors, Russian Scientific Center “Kurchatovskii institut.” Translated from Atomnaya énergiya, Vol. 76, No. 6, pp. 470–473, June, 1994.  相似文献   
995.
996.
Fistulas secondary to Crohn's disease occur in about 33% of patients. A colobronchial fistula complicating Crohn's disease is very rare, having been reported only twice previously. We present an unusual fistula secondary to Crohn's colitis that originated from the splenic flexure and crossed the diaphragm to involve the bronchial tree.  相似文献   
997.
998.
We have examined the effects of a 5-HT1A receptor agonist (8-hydroxy-2-(di-n-propylamino)tetralin, 8-OH-DPAT) on food preference in ageing rats that had been given a 'palatable' meal 15 min before administration of the drug. Ageing rats consumed a greater amount of the 'palatable' pre-meal than the young rats. In young rats lipids were the predominant source of calories, but in old animals lipid and protein consumption was similar. Administration of 8-OH-DPAT resulted in an increase in total caloric intake in both groups. Concomitant with this there was a significant increase in protein intake in both groups, which was most important in ageing rats, where proteins became the predominant source of calories.  相似文献   
999.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n 2 log n) toO(n log2 n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.  相似文献   
1000.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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