首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7653篇
  免费   138篇
  国内免费   22篇
化学   4904篇
晶体学   45篇
力学   133篇
数学   1375篇
物理学   1356篇
  2020年   77篇
  2019年   62篇
  2016年   132篇
  2015年   99篇
  2014年   98篇
  2013年   233篇
  2012年   207篇
  2011年   278篇
  2010年   174篇
  2009年   195篇
  2008年   233篇
  2007年   253篇
  2006年   241篇
  2005年   231篇
  2004年   188篇
  2003年   176篇
  2002年   176篇
  2001年   109篇
  2000年   137篇
  1999年   125篇
  1998年   97篇
  1997年   89篇
  1996年   119篇
  1995年   134篇
  1994年   118篇
  1993年   133篇
  1992年   170篇
  1991年   156篇
  1990年   125篇
  1989年   115篇
  1988年   97篇
  1987年   111篇
  1986年   108篇
  1985年   148篇
  1984年   140篇
  1983年   142篇
  1982年   135篇
  1981年   155篇
  1980年   111篇
  1979年   132篇
  1978年   118篇
  1977年   141篇
  1976年   105篇
  1975年   111篇
  1974年   133篇
  1973年   114篇
  1972年   77篇
  1971年   70篇
  1970年   51篇
  1966年   54篇
排序方式: 共有7813条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
β-Nitrostyrene derivatives of adenosine 5′-glutarates are potent and selective bisubstrate-type inhibitors of the epidermal growth factor receptor protein tyrosine kinase (EGF-R PTK). In an attempt to improve the inhibitory activity, this type of compounds was modified with alkyl spacers of varying length between the nitrostyrene and the glutaryl units. The spacers consisted of 1, 3, 4, and 5 atoms to give compounds of the benzyl, oxyethyl, oxypropyl, and oxybutyl series, respectively (Schemes 1 and 2). Adenosine 5′-esters were prepared in the benzyl and oxypropyl series only. Compared to the compounds in the parent series without spacer (IC50 = 0.7–12 μM ), most of the modified compounds inhibited the EGF-R PTK only marginally or were inactive (IC50 ≥ 100 μM ). The only exceptions were the free acids 19 and 20 with IC50 values of ca. 5 μM . It is noteworthy that esterification of these two hydrogen glutarates with either MeOH or adenosine yielded inactive compounds, which is in contrast to the corresponding substances without spacers.  相似文献   
5.
The synthesis of benzazepine analogues of the opium alkaloid noscapine ( 1 ) is described. The benzazepines 2 and 3 were prepared starting from nornarceine ethyl ester ( 4 ; readily available from 1 ) in several steps. X-Ray analysis of compound 2 revealed that it is not a diastereosisomer mixture but a racemate of the threo-form and thus has the same configuration as 1 .  相似文献   
6.
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.

  相似文献   

7.
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  相似文献   
8.
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.  相似文献   
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号