首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11904篇
  免费   788篇
  国内免费   1150篇
化学   810篇
晶体学   17篇
力学   842篇
综合类   123篇
数学   5290篇
物理学   1442篇
综合类   5318篇
  2024年   17篇
  2023年   114篇
  2022年   189篇
  2021年   202篇
  2020年   261篇
  2019年   245篇
  2018年   229篇
  2017年   280篇
  2016年   265篇
  2015年   275篇
  2014年   421篇
  2013年   709篇
  2012年   586篇
  2011年   663篇
  2010年   568篇
  2009年   781篇
  2008年   745篇
  2007年   861篇
  2006年   762篇
  2005年   705篇
  2004年   577篇
  2003年   555篇
  2002年   487篇
  2001年   395篇
  2000年   412篇
  1999年   400篇
  1998年   390篇
  1997年   318篇
  1996年   229篇
  1995年   177篇
  1994年   153篇
  1993年   138篇
  1992年   134篇
  1991年   131篇
  1990年   93篇
  1989年   89篇
  1988年   74篇
  1987年   56篇
  1986年   33篇
  1985年   17篇
  1984年   22篇
  1983年   6篇
  1982年   13篇
  1981年   12篇
  1980年   10篇
  1979年   11篇
  1978年   13篇
  1977年   4篇
  1974年   3篇
  1972年   3篇
排序方式: 共有10000条查询结果,搜索用时 265 毫秒
81.
从量子力学、真空、大数假说、磁单极子诸方面,阐述了坎拉克的治学思想和研究方法的特点及其对当代物理学所做出的重大贡献.  相似文献   
82.
Masanori Asakura 《K-Theory》2002,27(3):273-280
We construct 0-cycles on a self-product of a curve whose cycle classes are linearly independent in the extension group of arithmetic Hodge structure. This is an extended version of Theorem 4.5 of Asakura's contribution to CMR Lecture Notes Ser. 24 ((2000), pp. 133–154).  相似文献   
83.
A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem.  相似文献   
84.
J. Vrba   《Fuzzy Sets and Systems》1992,50(3):267-278
Algorithms for systematical search of inverse in arithmetic operations with fuzzy numbers are discussed. The fuzzy number derived is considered either in a discrete representation of its support or described by the parameters of the corresponding membership function formula. Both algorithms are easy to be programmed for desk calculators.  相似文献   
85.
86.
In the factor analysis model with large cross-section and time-series dimensions,we pro- pose a new method to estimate the number of factors.Specially if the idiosyncratic terms satisfy a linear time series model,the estimators of the parameters can be obtained in the time series model. The theoretical properties of the estimators are also explored.A simulation study and an empirical analysis are conducted.  相似文献   
87.
We propose a method for constructing systems of polynomial equations that define submanifolds of degenerate binary forms of an arbitrary degeneracy degree. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 153, No. 2, pp. 147–157, November, 2007.  相似文献   
88.
本文通过“1 4-1 5”智力玩具和最优戴断切割问题两个实例 ,讨论了逆序数在解决实际问题中的应用  相似文献   
89.
In this paper we study higher Chow groups of smooth, projective surfaces over a field k of characteristic zero, using some new Hodge theoretic methods which we develop for this purpose. In particular we investigate the subgroup of CH r+1 (X,r) with r = 1,2 consisting of cycles that are supported over a normal crossing divisor Z on X. In this case, the Hodge theory of the complement forms an interesting variation of mixed Hodge structures in any geometric deformation of the situation. Our main result is a structure theorem in the case where X is a very general hypersurface of degree d in projective 3-space for d sufficiently large and Z is a union of very general hypersurface sections of X. In this case we show that the subgroup of CH r+1 (X,r) we consider is generated by obvious cycles only arising from rational functions on X with poles along Z. This can be seen as a generalization of the Noether–Lefschetz theorem for r = 0. In the case r = 1 there is a similar generalization by Müller-Stach, but our result is more precise than it, since it is geometric and not only cohomological. The case r = 2 is entirely new and original in this paper. For small d, we construct some explicit examples for r = 1 and 2 where the corresponding higher Chow groups are indecomposable, i.e. not the image of certain products of lower order groups. In an appendix Alberto Collino constructs even more indecomposable examples in CH 3 (X,2) which move in a one-dimensional family on the surface X.Contribution to appendix.  相似文献   
90.
对于多属性群决策问题的处理,有时需要采用先决策、后综合的处理方法,而含有语言评价信息的多属性群决策问题,定性目标一般用语言评价信息描述,由决策人给出定性目标和权系数的语言变量评价,用梯形模糊数表示,对定量目标进行无量纲化处理;将决策人对于单一目标的评价指标聚合成多个目标的评价模糊数,采用Bass-Kw akernaak模糊数排序方法对方案进行排序;群体的评价通过Borda函数来集结方案集的群体排序.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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