首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11482篇
  免费   828篇
  国内免费   1548篇
化学   3435篇
晶体学   47篇
力学   369篇
综合类   190篇
数学   8181篇
物理学   1636篇
  2024年   14篇
  2023年   130篇
  2022年   159篇
  2021年   257篇
  2020年   275篇
  2019年   327篇
  2018年   313篇
  2017年   355篇
  2016年   265篇
  2015年   251篇
  2014年   408篇
  2013年   1138篇
  2012年   388篇
  2011年   521篇
  2010年   459篇
  2009年   639篇
  2008年   715篇
  2007年   888篇
  2006年   705篇
  2005年   680篇
  2004年   560篇
  2003年   612篇
  2002年   549篇
  2001年   443篇
  2000年   439篇
  1999年   407篇
  1998年   371篇
  1997年   345篇
  1996年   245篇
  1995年   133篇
  1994年   155篇
  1993年   95篇
  1992年   85篇
  1991年   67篇
  1990年   51篇
  1989年   51篇
  1988年   51篇
  1987年   46篇
  1986年   28篇
  1985年   51篇
  1984年   37篇
  1983年   21篇
  1982年   26篇
  1981年   24篇
  1980年   17篇
  1979年   11篇
  1978年   14篇
  1977年   14篇
  1976年   6篇
  1974年   5篇
排序方式: 共有10000条查询结果,搜索用时 359 毫秒
261.
We make a high-precision Monte Carlo study of two- and three-dimensional self-avoiding walks (SAWs) of length up to 80,000 steps, using the pivot algorithm and the Karp-Luby algorithm. We study the critical exponentsv and 2 4 as well as several universal amplitude ratios; in particular, we make an extremely sensitive test of the hyperscaling relationdv = 2 4. In two dimensions, we confirm the predicted exponentv=3/4 and the hyperscaling relation; we estimate the universal ratios <R g 2 >/<R e 2 >=0.14026±0.00007, <R m 2 >/<R e 2 >=0.43961±0.00034, and *=0.66296±0.00043 (68% confidence limits). In three dimensions, we estimatev=0.5877±0.0006 with a correctionto-scaling exponent 1=0.56±0.03 (subjective 68% confidence limits). This value forv agrees excellently with the field-theoretic renormalization-group prediction, but there is some discrepancy for 1. Earlier Monte Carlo estimates ofv, which were 0.592, are now seen to be biased by corrections to scaling. We estimate the universal ratios <R g 2 >/<R e 2 >=0.1599±0.0002 and *=0.2471±0.0003; since *>0, hyperscaling holds. The approach to * is from above, contrary to the prediction of the two-parameter renormalization-group theory. We critically reexamine this theory, and explain where the error lies. In an appendix, we prove rigorously (modulo some standard scaling assumptions) the hyperscaling relationdv = 2 4 for two-dimensional SAWs.  相似文献   
262.
A law of the iterated logarithm for processes with independent increments   总被引:1,自引:0,他引:1  
ALAWOFTHEITERATEDLOGARITHMFORPROCESSESWITHINDEPENDENTINCREMENTSWANGJIAGANG(汪嘉冈)(EastChinaUniversityofScience&Technology,Shang...  相似文献   
263.
We formulate a series of conjectures (and a few theorems) on the quotient of the polynomial ring in two sets of variables by the ideal generated by all S n invariant polynomials without constant term. The theory of the corresponding ring in a single set of variables X = {x 1, ..., x n} is classical. Introducing the second set of variables leads to a ring about which little is yet understood, but for which there is strong evidence of deep connections with many fundamental results of enumerative combinatorics, as well as with algebraic geometry and Lie theory.  相似文献   
264.
For the multidimensional heat equation in a parallelepiped, optimal error estimates inL 2(Q) are derived. The error is of the order of +¦h¦2 for any right-hand sidef L 2(Q) and any initial function ; for appropriate classes of less regularf andu 0, the error is of the order of ((+¦h¦2 ), 1/2<1.Translated fromMatematicheskie Zametki, Vol. 60, No. 2, pp. 185–197, August, 1996.  相似文献   
265.
The vector -algorithm is obtained from the scalar -algorithm by taking the pseudo-inverse of a vector instead of the inverse of a scalar. Thus the vector -algorithm is known only through its rules contrarily to the scalar -algorithm and some other extrapolation algorithms.The aim of this paper is to provide an algebraic approach to the vector -algorithm.  相似文献   
266.
The main theme of this article is that counting orbits of an infinite permutation group on finite subsets or tuples is very closely related to combinatorial enumeration; this point of view ties together various disparate stories. Among these are reconstruction problems, the relation between connected and arbitrary graphs, the enumeration of N-free posets, and some of the combinatorics of Stirling numbers.Dedicated to Hanfried Lenz on the occasion of his 80th birthday.  相似文献   
267.
Let (W, S) be a Coxeter group associated to a Coxeter graph which has no multiple bonds. Let H be the corresponding Hecke Algebra. We define a certain quotient \-H of H and show that it has a basis parametrized by a certain subset W cof the Coxeter group W. Specifically, W cconsists of those elements of W all of whose reduced expressions avoid substrings of the form sts where s and t are noncommuting generators in S. We determine which Coxeter groups have finite W cand compute the cardinality of W cwhen W is a Weyl group. Finally, we give a combinatorial application (which is related to the number of reduced expressions for w W cof an exponential formula of Lusztig which utilizes a specialization of a subalgebra of \-H.  相似文献   
268.
Using a group-theoretic construction due to Bestvina and Brady, we build -manifolds which admit partitions into closed, connected -manifolds but which do not have finite homotopy type.

  相似文献   

269.
We first prove that a Riemannian manifold with globally constant additive Weyl invariants is locally homogeneous. Then we use this result to show that a manifold whose Laplacian commutes with all invariant differential operators is a locally homogeneous space.

  相似文献   

270.
Answering a question of Eklof-Mekler (Almost free modules, set-theoretic methods, North-Holland, Amsterdam, 1990), we prove: (1) If there exists a non-reflecting stationary set of consisting of ordinals of cofinality for each , then there exist abelian groups such that and for each . (2) There exist abelian groups such that for each and for each . The groups are the groups of -valued continuous functions on a topological space and their dual groups.

  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

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