首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   706101篇
  免费   5791篇
  国内免费   1527篇
化学   338103篇
晶体学   9901篇
力学   39317篇
综合类   19篇
数学   109041篇
物理学   217038篇
  2021年   6175篇
  2020年   6718篇
  2019年   7688篇
  2018年   13836篇
  2017年   14108篇
  2016年   16347篇
  2015年   7970篇
  2014年   13351篇
  2013年   29151篇
  2012年   24776篇
  2011年   32514篇
  2010年   23570篇
  2009年   23665篇
  2008年   30189篇
  2007年   31749篇
  2006年   23397篇
  2005年   22750篇
  2004年   20425篇
  2003年   19139篇
  2002年   18302篇
  2001年   18302篇
  2000年   14425篇
  1999年   11020篇
  1998年   9775篇
  1997年   9540篇
  1996年   9032篇
  1995年   8018篇
  1994年   8093篇
  1993年   7872篇
  1992年   8166篇
  1991年   8718篇
  1990年   8431篇
  1989年   8337篇
  1988年   8053篇
  1987年   7891篇
  1986年   7477篇
  1985年   9389篇
  1984年   9924篇
  1983年   8371篇
  1982年   8728篇
  1981年   8164篇
  1980年   7704篇
  1979年   8478篇
  1978年   8679篇
  1977年   8652篇
  1976年   8679篇
  1975年   8278篇
  1974年   8087篇
  1973年   8303篇
  1972年   6336篇
排序方式: 共有10000条查询结果,搜索用时 421 毫秒
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号