首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4334篇
  免费   111篇
  国内免费   18篇
化学   2691篇
晶体学   25篇
力学   76篇
数学   565篇
物理学   1106篇
  2021年   45篇
  2020年   64篇
  2019年   42篇
  2018年   24篇
  2017年   49篇
  2016年   93篇
  2015年   77篇
  2014年   100篇
  2013年   150篇
  2012年   183篇
  2011年   217篇
  2010年   112篇
  2009年   119篇
  2008年   168篇
  2007年   181篇
  2006年   176篇
  2005年   165篇
  2004年   143篇
  2003年   116篇
  2002年   119篇
  2001年   72篇
  2000年   82篇
  1999年   76篇
  1998年   52篇
  1997年   50篇
  1996年   60篇
  1995年   74篇
  1994年   79篇
  1993年   81篇
  1992年   85篇
  1991年   65篇
  1990年   59篇
  1989年   54篇
  1988年   47篇
  1987年   57篇
  1986年   48篇
  1985年   70篇
  1984年   58篇
  1983年   63篇
  1982年   59篇
  1981年   49篇
  1980年   56篇
  1979年   54篇
  1978年   46篇
  1977年   49篇
  1976年   39篇
  1975年   34篇
  1974年   49篇
  1973年   53篇
  1966年   25篇
排序方式: 共有4463条查询结果,搜索用时 31 毫秒
1.
2.
3.
Journal of Solid State Electrochemistry - Local cathodic polarizations of yttria-stabilized zirconia were carried out with a PtIr probe as the working electrode in a controlled atmosphere high...  相似文献   
4.
We apply a majorizing measure theorem of Talagrand to obtain uniform bounds for sums of random variables satisfying increment conditions of the type considered in Gál-Koksma Theorems. We give some applications.

  相似文献   

5.
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  相似文献   
6.
We study the relation between the cohomology of general linear and symmetric groups and their respective quantizations, using Schur algebras and standard homological techniques to build appropriate spectral sequences. As our methods fit inside a much more general context within the theory of finite-dimensional algebras, we develop our results first in that general setting, and then specialize to the above situations. From this we obtain new proofs of several known results in modular representation theory of symmetric groups. Moreover, we reduce certain questions about computing extensions for symmetric groups and Hecke algebras to questions about extensions for general linear groups and their quantizations.  相似文献   
7.
Under a very moderate assumption on the Fourier coefficients of a periodic function, we show the convergence almost everywhere of the sequence of averages of its associated Riemann sums. The structure of the set of averages is analyzed by proving a spectral regularization type inequality, which allows to control the corresponding Littlewood-Paley square function.  相似文献   
8.
Given a ring $R$, let $S\subseteq R$ be a pure multiplicative band that is closed under the cubic join operation $x\nabla y = x+y+yx-xyx-yxy.$ We show that $\left( S,\cdot,\nabla\right) $ forms a pure skew lattice if and only if $S$ satisfies the polynomial identity $\left(xy-yx\right)^{2}z = z\left(xy-yx\right)^{2}$. We also examine properties of pure skew lattices in rings.  相似文献   
9.
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.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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