首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   528681篇
  免费   4158篇
  国内免费   1281篇
化学   269103篇
晶体学   7646篇
力学   25990篇
综合类   17篇
数学   67780篇
物理学   163584篇
  2021年   5036篇
  2020年   5477篇
  2019年   6222篇
  2018年   8414篇
  2017年   8560篇
  2016年   11625篇
  2015年   6179篇
  2014年   10437篇
  2013年   23489篇
  2012年   18335篇
  2011年   21791篇
  2010年   16420篇
  2009年   16281篇
  2008年   20658篇
  2007年   20511篇
  2006年   18615篇
  2005年   16623篇
  2004年   15474篇
  2003年   13958篇
  2002年   13850篇
  2001年   14729篇
  2000年   11344篇
  1999年   8752篇
  1998年   7603篇
  1997年   7470篇
  1996年   6928篇
  1995年   6259篇
  1994年   6264篇
  1993年   6020篇
  1992年   6375篇
  1991年   6867篇
  1990年   6580篇
  1989年   6486篇
  1988年   6324篇
  1987年   6132篇
  1986年   5872篇
  1985年   7409篇
  1984年   7769篇
  1983年   6535篇
  1982年   6817篇
  1981年   6327篇
  1980年   6004篇
  1979年   6505篇
  1978年   6742篇
  1977年   6630篇
  1976年   6586篇
  1975年   6302篇
  1974年   6132篇
  1973年   6424篇
  1972年   4706篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
201.
Rhodium catalysts have been prepared on palygorskite and montmorillonite (clay) supports by reduction with hydrogen (1 atmosphere) at room temperature of a cationic organometallic rhodium compound anchored to the support. The activity of these catalysts for the hydrogenation of liquid-phase 1-hexene remains constant with increase of prehydrogenation time and with re-use for several runs. No rhodium leaching is observed.  相似文献   
202.
The auction algorithm for the transportation problem   总被引:1,自引:0,他引:1  
The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems.  相似文献   
203.
204.
205.
Crystalline materials that are transparent in the vacuum UV spectral region and currently used have been reviewed. Transmission of crystals of solid solutions with the fluorite structure Ca1?x R xF2+x (R = Sc, Y, La, Yb, Lu) in the UV and vacuum UV spectral regions has been investigated. It is shown that application of different methods of purification of fluorides from some impurities can significantly improve the optical quality of fluoride multicomponent crystals in the short-wavelength spectral region.  相似文献   
206.
Summary Three weak variants of compactness which lie strictly between compactness and quasicompactness, are introduced. Their basic properties are studied. The interplay with mapping and their direct and inverse preservation under mappings are investigated. In the process three decompositions of compactness are observed.  相似文献   
207.
208.
Basic principles of the generalized lattice model of multicomponent condensed systems are formulated. Short-range parts of interatomic interactions are taken into account by means of the geometric constraints method. Long-range parts of the interactions are taken into account in mean field approximation. The expression for Helmholtz free energy is obtained. A system of integral equations for the equilibrium distributions of components is derived. The asymptotic properties of its solutions are investigated. Moment expansion of interatomic interactions and localization of integral terms in free energy is obtained. A Ginzburg–Landau-like functional of free energy is derived.  相似文献   
209.
In this paper we obtain a number of Maharam-type slice integral representations, with respect to scalar measures, for positive projections in Dedekind complete vector lattices and f-algebras. AMS Classification: 47B65, 46A40, 06F25  相似文献   
210.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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