首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   65551篇
  免费   1963篇
  国内免费   309篇
化学   43022篇
晶体学   461篇
力学   1344篇
综合类   4篇
数学   11246篇
物理学   11746篇
  2023年   414篇
  2022年   798篇
  2021年   1039篇
  2020年   1085篇
  2019年   1179篇
  2018年   1082篇
  2017年   997篇
  2016年   2150篇
  2015年   1803篇
  2014年   1983篇
  2013年   3786篇
  2012年   3903篇
  2011年   4262篇
  2010年   2666篇
  2009年   2472篇
  2008年   3735篇
  2007年   3637篇
  2006年   3400篇
  2005年   3092篇
  2004年   2695篇
  2003年   2187篇
  2002年   1977篇
  2001年   1260篇
  2000年   1119篇
  1999年   933篇
  1998年   760篇
  1997年   752篇
  1996年   893篇
  1995年   702篇
  1994年   708篇
  1993年   645篇
  1992年   619篇
  1991年   544篇
  1990年   535篇
  1989年   477篇
  1988年   425篇
  1987年   405篇
  1986年   383篇
  1985年   522篇
  1984年   546篇
  1983年   381篇
  1982年   434篇
  1981年   421篇
  1980年   403篇
  1979年   333篇
  1978年   344篇
  1977年   305篇
  1976年   256篇
  1975年   257篇
  1973年   223篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
2.
3.
4.
In this paper we study constant mean curvature compact surfaces with two Jordan curves in parallel planes as boundary and we investigate the point at which the surface inherits the symmetries of its boundary.  相似文献   
5.
We report a strong dependence of the thermal stability of Nafion® perfluorosulfonate ionomer on the nature of the counterion associated with the fixed sulfonate site. These results were obtained using thermal gravimetric analysis on a series of alkali metal and alkyl ammonium cation-exchanged Nafion films. We have found that the temperature of decomposition of Nafion is inversely dependent on the size of the exchanged cation; i.e., Nafion films show improved thermal stability as the size of the counter cation decreases. We attribute this inverse relationship of thermal stability with counterion size to an initial decomposition reaction which is strongly influenced by the strength of the sulfonate-coun-terion interaction. © 1993 John Wiley & Sons, Inc.  相似文献   
6.
7.
We prove a general compactness result for the solution set of the compressible Navier–Stokes equations with respect to the variation of the underlying spatial domain. Among various corollaries, we then prove a general existence theorem for the system in question with no restrictions on smoothness of the spatial domain. Copyright © 2002 John Wiley & Sons, Ltd.  相似文献   
8.
Surface relief formation at holographic recording on amorphous selenium films was demonstrated and investigated. The presence of this optical phase modulation component is essential for ensuring significant, stable and erasable optical recording in a-Se films at 290–320 K temperatures, where conventional photodarkening was known as insignificant and unstable. Photocrystallization can only be observed in super-exposed a-Se films at the given experimental conditions of hologram recording. Erasing behavior of surface relief gratings under heat treatment was also investigated in order to reveal further details of the mechanism. Photoinduced structural transformations within the amorphous phase, connected to local ordering under the condition of light-induced fluidity, are proposed as an explanation for the relief formation and erasing. The observed reversible optical recording process may be useful for the various optoelectronic applications of photoconductive a-Se layers. Received: 12 June 2000 / Accepted: 6 June 2001 / Published online: 30 August 2001  相似文献   
9.
We give sufficient conditions for Sobolev and Lipschitz functions in terms of their lower scaled-oscillation. The sharpness of these conditions is shown by examples. Our examples also show that a Stepanov-type differentiability theorem does not hold under the boundedness assumption of the lower scaled-oscillation.

  相似文献   

10.
We consider a randomized version of the greedy algorithm for finding a large matching in a graph. We assume that the next edge is always randomly chosen from those remaining. We analyze the performance of this algorithm when the input graph is fixed. We show that there are graphs for which this Randomized Greedy Algorithm (RGA) usually only obtains a matching close in size to that guaranteed by worst-case analysis (i.e., half the size of the maximum). For some classes of sparse graphs (e.g., planar graphs and forests) we show that the RGA performs significantly better than the worst-case. Our main theorem concerns forests. We prove that the ratio to maximum here is at least 0.7690…, and that this bound is tight.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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