首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   26621篇
  免费   814篇
  国内免费   152篇
化学   17054篇
晶体学   132篇
力学   685篇
综合类   2篇
数学   5173篇
物理学   4541篇
  2023年   136篇
  2022年   263篇
  2021年   454篇
  2020年   436篇
  2019年   404篇
  2018年   800篇
  2017年   556篇
  2016年   707篇
  2015年   653篇
  2014年   689篇
  2013年   1456篇
  2012年   1520篇
  2011年   1636篇
  2010年   1067篇
  2009年   964篇
  2008年   1509篇
  2007年   1467篇
  2006年   1372篇
  2005年   1272篇
  2004年   1075篇
  2003年   969篇
  2002年   845篇
  2001年   476篇
  2000年   516篇
  1999年   348篇
  1998年   306篇
  1997年   279篇
  1996年   349篇
  1995年   231篇
  1994年   247篇
  1993年   244篇
  1992年   225篇
  1991年   174篇
  1990年   220篇
  1989年   181篇
  1988年   162篇
  1987年   148篇
  1986年   146篇
  1985年   198篇
  1984年   245篇
  1983年   160篇
  1982年   201篇
  1981年   201篇
  1980年   196篇
  1979年   155篇
  1978年   190篇
  1977年   167篇
  1976年   174篇
  1975年   134篇
  1973年   122篇
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
151.
We prove a duality theorem for some logarithmic D-modules associated with a class of divisors. We also give some results for the locally quasi-homogeneous case. To cite this article: F.J. Castro-Jiménez, J.M. Ucha-Enr??quez, C. R. Acad. Sci. Paris, Ser. I 338 (2004).  相似文献   
152.
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable “interlace polynomial” for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and fuse reduction characterizing the Tutte polynomial.It emerges that the interlace graph polynomial may be viewed as a special case of the Martin polynomial of an isotropic system, which underlies its connections with the circuit partition polynomial and the Kauffman brackets of a link diagram. The graph polynomial, in addition to being perhaps more broadly accessible than the Martin polynomial for isotropic systems, also has a two-variable generalization that is unknown for the Martin polynomial. We consider extremal properties of the interlace polynomial, its values for various special graphs, and evaluations which relate to basic graph properties such as the component and independence numbers.  相似文献   
153.
154.
A family of terminal alkyne dicobalthexacarbonyl complexes bearing groups with a range of electron-withdrawing abilities has been synthesized. After submitting these complexes to the intermolecular Pauson-Khand reaction with norbornadiene, electron-deficient substrates afforded up to 26% of the unexpected endo-cyclopentenone.  相似文献   
155.
We study condensation of trapped bosons in the limit when the number of particles tends to infinity. For the noninteracting gas we prove that there is no phase transition in any dimension, but in any dimension, at any temperature the system is 100% condensated into the one-particle ground state. In the case of an interacting gas we show that for a family of suitably scaled pair interactions, the Gross–Pitaevskii scaling included, a less-than-100% condensation into a single-particle eigenstate, which may depend on the interaction strength, persists at all temperatures.  相似文献   
156.
We present here an improved version of the method introduced by the first author to derive pointwise gradient estimates for the solutions of one-dimensional parabolic problems. After considering a general qualinear equation in divergence form we apply the method to the case of a nonlinear diffusion-convection equation. The conclusions are stated first for classical solutions and then for generalized and mild solutions. In the case of unbounded initial datum we obtain several regularizing effects for t > 0. Some unilateral pointwise gradient estimates are also obtained. The case of the Dirichlet problem is also considered. Finally, we collect, in the last section, several comments showing the connections among these estimates and the study of the free boundaries associated to the solutions of the diffusion-convection equation.  相似文献   
157.
For the Queens_n 2 graph coloring problems no chromatic numbers are available for n > 9 except where n is not a multiple of 2 or 3. In this paper we propose an exact algorithm that takes advantage of the particular structure of these graphs. The algorithm works on the independent sets of the graph rather than on the vertices to be colored. It combines branch and bound, for independent set assignment, with a clique based filtering procedure. A first experimentation of this approach provided the coloring number values ranging for n = 10 to n = 14.  相似文献   
158.
159.
In this paper we provide an error bound estimate and an implicit multifunction theorem in terms of smooth subdifferentials and abstract subdifferentials. Then, we derive a subdifferential calculus and Fritz–John type necessary optimality conditions for constrained minimization problems.  相似文献   
160.
We study the asymptotic behaviour of the solution of elliptic problems with periodic data when the size of the domain on which the problem is set becomes unbounded. To cite this article: M. Chipot, Y. Xie, C. R. Acad. Sci. Paris, Ser. I 339 (2004).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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