首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5859篇
  免费   122篇
  国内免费   18篇
化学   3396篇
晶体学   35篇
力学   110篇
数学   988篇
物理学   1470篇
  2020年   77篇
  2019年   50篇
  2017年   56篇
  2016年   96篇
  2015年   88篇
  2014年   99篇
  2013年   184篇
  2012年   166篇
  2011年   193篇
  2010年   114篇
  2009年   127篇
  2008年   159篇
  2007年   177篇
  2006年   158篇
  2005年   152篇
  2004年   123篇
  2003年   120篇
  2002年   109篇
  2001年   87篇
  2000年   106篇
  1999年   96篇
  1998年   69篇
  1997年   66篇
  1996年   82篇
  1995年   84篇
  1994年   87篇
  1993年   94篇
  1992年   104篇
  1991年   101篇
  1990年   87篇
  1989年   76篇
  1988年   70篇
  1987年   74篇
  1986年   65篇
  1985年   98篇
  1984年   87篇
  1983年   85篇
  1982年   97篇
  1981年   92篇
  1980年   96篇
  1979年   99篇
  1978年   86篇
  1977年   77篇
  1976年   65篇
  1975年   64篇
  1974年   67篇
  1973年   76篇
  1972年   41篇
  1966年   42篇
  1926年   38篇
排序方式: 共有5999条查询结果,搜索用时 0 毫秒
1.
2.
3.
4.
We study correlations in the exclusive reaction at rest with complete reconstruction of the kinematics for each event. The inclusive distribution is fairly flat at small invariant mass of the pion pair while a small enhancement in the double differential distribution is observed for small invariant masses of both pion pairs. Dynamical models with resonances in the final state are shown to be consistent with the data while the stochastic HBT mechanism is not supported by the present findings. Received: 26 February 2002 / Revised version: 22 July 2002 / Published online: 30 August 2002  相似文献   
5.
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (UbV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.  相似文献   
6.
In recent years there has emerged significant interest in low pressure radio frequency (rf) glow discharges which are used widely particulary in IC fabrication. Various parameters of the rf glow discharge have been found to be useful for its electrical characterization; however, there is no uniformity and agreement. Extensive experimental investigations on various discharge systems have shown, that the self-bias on the rf driven electrode, the complex conductivity and the breakdown characteristic are preferable parameters of rf discharges. Advantageously the self-bias and the complex conductivity should be presented in dependence on the pressure and the applied rf voltage. The discharge current cannot be measured quite accurately due to currents via leaky capacitors and the deviations from a sinusoidal form of the current due to nonlinearities.  相似文献   
7.
Hans Weber 《Order》2007,24(4):249-276
We study lattice theoretical properties of lattices of uniformities such as modularity, distributive laws and the existence of (relative) complements. For this the concepts of permutable uniformities (see Definition 3.1) and independent uniformities (see Definition 4.1) are important. Moreover, we show that e.g. the lattice of all lattice uniformities on a lattice L is a closed sublattice of the lattice of all uniformities on L.  相似文献   
8.
    
Ohne Zusammenfassung  相似文献   
9.
We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality properties. We then focus on the family of polynomials which exhibits a finite orthogonality. This family, to be referred to as the Romanovski polynomials, is required in exact solutions of several physics problems ranging from quantum mechanics and quark physics to random matrix theory. It appears timely to draw attention to it by the present study. Our survey also includes several new observations on the orthogonality properties of the Romanovski polynomials and new developments from their Rodrigues formula.  相似文献   
10.
We show how the metric entropy method can be substituted for the dyadic chaining, to prove in a unified setting several classical results. Among them are Stechkin's theorem, Gál--Koksma theorems and quantitative Borel--Cantelli lemmas. We give simpler proofs and improve some of these results. Two classes of examples are given: firstly stationary Gaussian sequences with applications to upper and lower classes and the law of the iterated logarithm for subsequences, and secondly in Diophantine approximation relatively to Gál and Schmidt's theorems.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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