首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6653篇
  免费   294篇
  国内免费   56篇
化学   4777篇
晶体学   36篇
力学   157篇
数学   1179篇
物理学   854篇
  2024年   4篇
  2023年   38篇
  2022年   77篇
  2021年   201篇
  2020年   146篇
  2019年   171篇
  2018年   116篇
  2017年   111篇
  2016年   279篇
  2015年   205篇
  2014年   254篇
  2013年   355篇
  2012年   510篇
  2011年   567篇
  2010年   337篇
  2009年   292篇
  2008年   462篇
  2007年   426篇
  2006年   392篇
  2005年   390篇
  2004年   319篇
  2003年   221篇
  2002年   205篇
  2001年   91篇
  2000年   61篇
  1999年   68篇
  1998年   47篇
  1997年   59篇
  1996年   78篇
  1995年   58篇
  1994年   43篇
  1993年   43篇
  1992年   28篇
  1991年   49篇
  1990年   25篇
  1989年   25篇
  1988年   22篇
  1987年   18篇
  1986年   25篇
  1985年   35篇
  1984年   34篇
  1983年   18篇
  1982年   31篇
  1981年   13篇
  1980年   7篇
  1979年   4篇
  1978年   9篇
  1977年   9篇
  1976年   7篇
  1974年   5篇
排序方式: 共有7003条查询结果,搜索用时 578 毫秒
31.
32.
33.
A new concept of orthogonality in real normed linear spaces is introduced. Typical properties of orthogonality (homogeneity, symmetry, additivity, ...) and relations between this orthogonality and other known orthogonalities (Birkhoff, Boussouis, Unitary-Boussouis and Diminnie) are studied. In particular, some characterizations of inner product spaces are obtained.  相似文献   
34.
35.
Logic programming languages, such asProlog, allow a declarative specification of Constraint Satisfaction Problems (CSPs), freeing the user from specifying more or less complex control directives. However, the price to pay for such flexibility is a loss of efficiency, which makes Logic Programming inadequate to solve CSPs of even moderate size and complexity. To extend the range of applicability of logic programming, several improvements have been proposed. The use of heuristics is one such improvement. Although this usually forces the user to specify some form of control (thus abandoning the pure declarative nature of a logic program), these specifications can be made declarative by making use of some appropriate meta-predicates. Another extension to logic programming that improves its efficiency, is the active use of constraints, as done in the various formulations of constraint logic programming languages. In particular, the use of finite domains is quite adequate to implement look-ahead schemes to efficiently solve several types of CSPs. In this paper, we discuss the complementary nature of heuristics and look-ahead schemes and present a constraint logic programming framework that integrates both these techniques. Results obtained with a time-tabling problem executed on a prototype that implements such a framework are presented, and show that significant efficiency improvements can be achieved when compared with the separate use of the two techniques.  相似文献   
36.
37.
I obtain exact solutions for the quantum-mechanical harmonic oscillator with a perturbation potential which belongs to a class of polynomial functions of 1/r. I show that some of the eigenfunctions enable the calculation of expectation values in closed form and are therefore suitable trial functions for the application of the variational method to related nonsolvable problems.  相似文献   
38.
This paper describes a robust and fast fitting procedure applicable for relaxing processes that cannot be understood as a discrete sum of single processes but require an activation energy distribution. The method is based on a set of closed-form expressions that allow the computation of the relaxation parameters directly from the isochronal curves obtained experimentally. The usefulness of this method is checked by analyzing the isochronal curves given by a theoretical energy distribution and the magnetic disaccommodation spectra observed in yttrium iron garnet (YIG) samples. PACS 02.60.Ed; 75.60.Lr; 75.50.Gg  相似文献   
39.
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).  相似文献   
40.
In this paper we develop a Morsification Theory for holomorphic functions defining a singularity of finite codimension with respect to an ideal, which recovers most previously known morsification results for non-isolated singularities and generalise them to a much wider context. We also show that deforming functions of finite codimension with respect to an ideal within the same ideal respects the Milnor fibration. Furthermore we present some applications of the theory: we introduce new numerical invariants for non-isolated singularities, which explain various aspects of the deformation of functions within an ideal; we define generalisations of the bifurcation variety in the versal unfolding of isolated singularities; applications of the theory to the topological study of the Milnor fibration of non-isolated singularities are presented. Using intersection theory in a generalised jet-space we show how to interpret the newly defined invariants as certain intersection multiplicities; finally, we characterise which invariants can be interpreted as intersection multiplicities in the above mentioned generalised jet space.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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