首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   27917篇
  免费   871篇
  国内免费   174篇
化学   19671篇
晶体学   271篇
力学   624篇
综合类   2篇
数学   4252篇
物理学   4142篇
  2022年   204篇
  2021年   278篇
  2020年   443篇
  2019年   395篇
  2018年   270篇
  2017年   273篇
  2016年   584篇
  2015年   505篇
  2014年   641篇
  2013年   1313篇
  2012年   1415篇
  2011年   1806篇
  2010年   894篇
  2009年   741篇
  2008年   1495篇
  2007年   1533篇
  2006年   1503篇
  2005年   1477篇
  2004年   1295篇
  2003年   1024篇
  2002年   1027篇
  2001年   337篇
  2000年   335篇
  1999年   293篇
  1998年   301篇
  1997年   356篇
  1996年   421篇
  1995年   309篇
  1994年   278篇
  1993年   336篇
  1992年   270篇
  1991年   264篇
  1990年   235篇
  1989年   198篇
  1988年   211篇
  1987年   219篇
  1986年   187篇
  1985年   314篇
  1984年   377篇
  1983年   269篇
  1982年   332篇
  1981年   344篇
  1980年   270篇
  1979年   261篇
  1978年   319篇
  1977年   251篇
  1976年   235篇
  1975年   216篇
  1974年   232篇
  1973年   196篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
Editorial: Metal-Enhanced Fluorescence   总被引:1,自引:0,他引:1  
  相似文献   
62.
63.
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let AV. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.  相似文献   
64.
The weakly pinned single crystals of the hexagonal 2H-NbSe2 compound have emerged as prototypes for determining and characterizing the phase boundaries of the possible order-disorder transformations in the vortex matter. We present here a status report based on the ac and dc magnetization measurements of the peak effect phenomenon in three crystals of 2H-NbSe2, in which the critical current densities vary over two orders of magnitude. We sketch the generic vortex phase diagram of a weakly pinned superconductor, which also utilizes theoretical proposals. We also establish the connection between the metastability effects and pinning.  相似文献   
65.
66.
Theorems 2 and 3 establish the minimum algebraic conditions necessary for a field to be algebraically closed, and they can therefore be said to “optimize” the Fundamental Theorem of Algebra. But each specific“degree implication” is a first-order consequence of the axioms for fields, and could have been discovered two centuries ago; the existence of these finitary relationships appears to have been unsuspected by practically everyone, with one important exception.  相似文献   
67.
68.
69.
With a certain natural topology, the fundamental group of a locally path connected metric space X becomes discrete if and only if X is semilocally simply connected. We include some related material and offer a counterexample to a similar result.  相似文献   
70.
In this paper we prove four new (infinite) lists of quadratic inequalities, and four cubic inequalities, for the flag f-vectors of 4-polytopes. These extend and supplement the only four currently known non-linear inequalities, which were proved by Bayer in 1987. The new lists of inequalities for flag f-vectors yield new lists of inequalities for f-vectors of 4-polytopes. Using the latter, we managed to improve an estimate discovered by Hoppner and Ziegler concerning upper bounds of f1 in terms of f0 and f3.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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