首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   706740篇
  免费   5793篇
  国内免费   1529篇
化学   338578篇
晶体学   9980篇
力学   39328篇
综合类   19篇
数学   109069篇
物理学   217088篇
  2021年   6186篇
  2020年   6718篇
  2019年   7692篇
  2018年   13838篇
  2017年   14108篇
  2016年   16354篇
  2015年   7972篇
  2014年   13355篇
  2013年   29169篇
  2012年   24783篇
  2011年   32521篇
  2010年   23574篇
  2009年   23674篇
  2008年   30195篇
  2007年   31753篇
  2006年   23402篇
  2005年   22757篇
  2004年   20429篇
  2003年   19142篇
  2002年   18311篇
  2001年   18310篇
  2000年   14426篇
  1999年   11023篇
  1998年   9782篇
  1997年   9542篇
  1996年   9036篇
  1995年   8020篇
  1994年   8093篇
  1993年   7873篇
  1992年   8168篇
  1991年   8721篇
  1990年   8432篇
  1989年   8339篇
  1988年   8055篇
  1987年   7893篇
  1986年   7477篇
  1985年   9391篇
  1984年   9926篇
  1983年   8371篇
  1982年   8729篇
  1981年   8165篇
  1980年   7705篇
  1979年   8478篇
  1978年   8680篇
  1977年   8655篇
  1976年   8682篇
  1975年   8283篇
  1974年   8089篇
  1973年   8360篇
  1972年   6384篇
排序方式: 共有10000条查询结果,搜索用时 23 毫秒
971.
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.  相似文献   
972.
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.  相似文献   
973.
We consider singular Verma modules overA 1 (1) , i.e., Verma modules for which the central charge is equal to minus the dual Coxeter number. We calculate the characters of certain factor modules of these Verma modules. In one class of cases we are able to prove that these factor modules are actually the irreducible highest modules for those highest weights. We introduce new Weyl groups which are infinitely generated abelian groups and are proper subgroups or isomorphic between themselves. Using these Weyl groups we can rewrite the character formulae obtained in the paper in the form of the classical Weyl character formula for the finite-dimensional irreducible representations of semisimple Lie algebras (respectively Weyl-Kac character formula for the integrable highest weight modules over affine Kac-Moody algebras) so that the new Weyl groups play the role of the usual Weyl group (respectively affine Weyl group).  相似文献   
974.
975.
976.
The emission of Ne and Mg nuclei was detected in the spontaneous decay of234U with probabilities of, respectively, (3.9 ±1.0) × 10?13 and (2.3 ±0.7) × 10?13 relative toα-decay. The upper limits of this kind of decay for235U and236U have been established. Systematics of half-lives for cluster emission are found to be similar to the Geiger-Nuttall dependence forα-decay. Some evidence for the presence of hindrance to cluster emission from the odd-mass nuclei233U and235U is obtained.  相似文献   
977.
978.
979.
Twenty new cw FIR laser lines in CD3OH, optically pumped by a CO2 laser, are reported. The frequencies of 39 of the stronger laser lines were measured relative to stabilized CO2 lasers with a fractional uncertainty, as determined by the reproducibility of the FIR frequency itself, of 2 parts in 107.Contribution of the U.S. Government, not subject to copyright.  相似文献   
980.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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