首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   170645篇
  免费   12255篇
  国内免费   6114篇
电工技术   8737篇
技术理论   9篇
综合类   8741篇
化学工业   28464篇
金属工艺   10099篇
机械仪表   10343篇
建筑科学   9844篇
矿业工程   3939篇
能源动力   3825篇
轻工业   9647篇
水利工程   3143篇
石油天然气   9527篇
武器工业   1052篇
无线电   18200篇
一般工业技术   27686篇
冶金工业   11156篇
原子能技术   4877篇
自动化技术   19725篇
  2024年   716篇
  2023年   2356篇
  2022年   4658篇
  2021年   6323篇
  2020年   4789篇
  2019年   4171篇
  2018年   5261篇
  2017年   5736篇
  2016年   5306篇
  2015年   5816篇
  2014年   7498篇
  2013年   9153篇
  2012年   9882篇
  2011年   10589篇
  2010年   8948篇
  2009年   8759篇
  2008年   8630篇
  2007年   8060篇
  2006年   7467篇
  2005年   6383篇
  2004年   4902篇
  2003年   4852篇
  2002年   4873篇
  2001年   4427篇
  2000年   3818篇
  1999年   3388篇
  1998年   2668篇
  1997年   2250篇
  1996年   2011篇
  1995年   1761篇
  1994年   1480篇
  1993年   1255篇
  1992年   1231篇
  1991年   1085篇
  1990年   1104篇
  1989年   1022篇
  1988年   907篇
  1987年   849篇
  1986年   767篇
  1985年   724篇
  1984年   703篇
  1981年   668篇
  1979年   736篇
  1978年   777篇
  1977年   739篇
  1976年   756篇
  1975年   713篇
  1974年   719篇
  1973年   723篇
  1972年   705篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
A novel robust learning algorithm for optimizing fuzzy neural networks is proposed to address two important issues: how to reduce the outlier effects and how to optimize fuzzy neural networks, in the function approximation. This algorithm is able to reduce the outlier effects by cooperating with a conventional robust approach, and then to optimize fuzzy neural networks by determining the optimal learning rates which can minimize the next-step mean error at each iteration of our algorithm.  相似文献   
992.
Some significant progress related to multidimensional data analysis has been achieved in the past few years, including the design of fast algorithms for computing datacubes, selecting some precomputed group-bys to materialize, and designing efficient storage structures for multidimensional data. However, little work has been carried out on multidimensional query optimization issues. Particularly the response time (or evaluation cost) for answering several related dimensional queries simultaneously is crucial to the OLAP applications. Recently, Zhao et al. first exploited this problem by presenting three heuristic algorithms. In this paper we first consider in detail two cases of the problem in which all the queries are either hash-based star joins or index-based star joins only. In the case of the hash-based star join, we devise a polynomial approximation algorithm which delivers a plan whose evaluation cost is $ O(n^{\epsilon }$) times the optimal, where n is the number of queries and is a fixed constant with . We also present an exponential algorithm which delivers a plan with the optimal evaluation cost. In the case of the index-based star join, we present a heuristic algorithm which delivers a plan whose evaluation cost is n times the optimal, and an exponential algorithm which delivers a plan with the optimal evaluation cost. We then consider a general case in which both hash-based star-join and index-based star-join queries are included. For this case, we give a possible improvement on the work of Zhao et al., based on an analysis of their solutions. We also develop another heuristic and an exact algorithm for the problem. We finally conduct a performance study by implementing our algorithms. The experimental results demonstrate that the solutions delivered for the restricted cases are always within two times of the optimal, which confirms our theoretical upper bounds. Actually these experiments produce much better results than our theoretical estimates. To the best of our knowledge, this is the only development of polynomial algorithms for the first two cases which are able to deliver plans with deterministic performance guarantees in terms of the qualities of the plans generated. The previous approaches including that of [ZDNS98] may generate a feasible plan for the problem in these two cases, but they do not provide any performance guarantee, i.e., the plans generated by their algorithms can be arbitrarily far from the optimal one. Received: July 21, 1998 / Accepted: August 26, 1999  相似文献   
993.
邮递员问题是目前一个尚未完全解决的图论问题,而遗传算法则是一个比较好的全局搜索算法,本文提出了一种换方法,以此为基础,用遗传算法实现了对有向图邮递员问题的求解,较传统方法更加容易实现,在求解大规模复杂网络时,其效率更高。  相似文献   
994.
995.
996.
997.
998.
The dependence of the characteristics of vibrofluidization on the coefficients of hydraulic resistance of the bed and the grid and on a steady pressure drop (or gas flow) imposed from outside is analyzed.Translated from Inzhenerno-Fizicheskii Zhurnal, Vol. 34, No. 4, pp. 604–613, April, 1978.  相似文献   
999.
1000.
Experimental PVT data are given for sodium, rubidium, and cesium in the liquid phase. Procedures and measurement errors are discussed.Notation P pressure - V volume - T temperature - density - R solubility - D coefficient of diffusion - t time - L diffusion length - thermal expansion - Cp isobaric specific heat Translated from Inzhenerno-Fizicheskii Zhurnal, Vol. 35, No. 5, pp. 901–907, November, 1978.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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