首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   461420篇
  免费   5220篇
  国内免费   1434篇
化学   231627篇
晶体学   6817篇
力学   21148篇
综合类   12篇
数学   66263篇
物理学   142207篇
  2020年   2727篇
  2019年   2873篇
  2018年   11678篇
  2017年   12433篇
  2016年   9610篇
  2015年   4947篇
  2014年   5894篇
  2013年   16726篇
  2012年   16247篇
  2011年   26623篇
  2010年   16564篇
  2009年   16190篇
  2008年   23382篇
  2007年   26681篇
  2006年   12930篇
  2005年   18669篇
  2004年   13956篇
  2003年   12621篇
  2002年   10530篇
  2001年   10496篇
  2000年   8140篇
  1999年   6264篇
  1998年   5295篇
  1997年   5311篇
  1996年   5205篇
  1995年   4932篇
  1994年   4627篇
  1993年   4656篇
  1992年   5118篇
  1991年   4973篇
  1990年   4681篇
  1989年   4675篇
  1988年   4689篇
  1987年   4634篇
  1986年   4387篇
  1985年   6064篇
  1984年   6278篇
  1983年   5222篇
  1982年   5779篇
  1981年   5515篇
  1980年   5465篇
  1979年   5484篇
  1978年   5821篇
  1977年   5521篇
  1976年   5675篇
  1975年   5235篇
  1974年   5226篇
  1973年   5677篇
  1972年   3475篇
  1971年   2702篇
排序方式: 共有10000条查询结果,搜索用时 203 毫秒
991.
Cheriyan and Hagerup developed a randomized algorithm to compute the maximum flow in a graph with n nodes and m edges in O(mn + n2 log2n) expected time. The randomization is used to efficiently play a certain combinatorial game that arises during the computation. We give a version of their algorithm where a general version of their game arises. Then we give a strategy for the game that yields a deterministic algorithm for computing the maximum flow in a directed graph with n nodes and m edges that runs in time O(mn(logm/n log nn)). Our algorithm gives an O(mn) deterministic algorithm for all m/n = Ω(nε) for any positive constant ε, and is currently the fastest deterministic algorithm for computing maximum flow as long as m/n = ω(log n).  相似文献   
992.
We consider the problem of preemptively scheduling a set of imprecise computation tasks on m ≥ 1 identical processors, with each task Ti having two weights, wi and wi. Two performance metrics are considered: (1) the maximum w′-weighted error; (2) the total w-weighted error subject to the constraint that the maximum w′-weighted error is minimized. For the problem of minimizing the maximum w′-weighted error, we give an algorithm which runs in O(n3 log2n) time for multiprocessors and O(n2) time for a single processor. For the problem of minimizing the total w-weighted error subject to the constraint that the maximum w′-weighted error is minimized, we give an algorithm which also has the same time complexity.  相似文献   
993.
994.
This author wants to express his thanks to the School of Information Engineering at Teesside Polytechnic, Middlesbrough, England, for its support and hospitality during a visiting appointment of 3 months in 1989, when this paper was written.  相似文献   
995.
Silver nitrate-acetonitrile and π iodine-benzene complexes in thermotropic liquid crystals have been studied by 1H, 2H, and 13C NMR spectroscopy and by optical microscopy. Evidence for at least two silver complexes in each liquid crystal is presented.  相似文献   
996.
Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 56, No. 1, pp. 90–95, January, 1992.  相似文献   
997.
We examine the influence of relativistic and QED effects on the existence of the 1,3P o H- resonances between n = 2 and 3 hydrogen thresholds, the relativistic and QED corrections and the coupling effects between the high singlet and triplet states are considered as first-order perturbations. We firstly obtain accurate non-relativistic resonant energies and widths of fifteen 1P o resonances, and fifteen 3P o resonances. The fifteen 1P o resonances are classified to be 3 (2, 0) - n ( 4 ? n ? 12) and 3 (1, 1) + n ( 3 ? n ? 8). The fifteen 3P o resonances are classified to be 3 (2, 0) + n ( 3 ? n ? 12) and 3 (1, 1) - n ( 4 ? n ? 8). We found there exist six Feshbach resonances for 3 (2, 0) - n (1P o ) series, four Feshbach resonances for 3 (1, 1) + n (1P o ) series, seven Feshbach resonances for 3 (2, 0) + n (3P o ) series, and three Feshbach resonances for 3 (1, 1) - n (1P o ) series. Received 22 February 2002 Published online 24 September 2002  相似文献   
998.
We present a detailed derivation of the fluctuation transport theory, previously developed by Gerlach and Mycielski. The basic idea is the transformation of carrier-densities and fields into the rest frame of each type of carriers and application of the Fluctuation-Dissipation-theorem for monopolar, unscreened carrier densities. In the present paper, the theory is applied to a model system containing free electrons, rigid ions and polarizable neutral donors. We compare our results with experimental data for the polar II–VI-semiconductor Eu1-xSrxS.  相似文献   
999.
1000.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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