首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1823篇
  免费   51篇
  国内免费   21篇
化学   1093篇
晶体学   5篇
力学   44篇
数学   293篇
物理学   460篇
  2024年   2篇
  2023年   13篇
  2022年   29篇
  2021年   29篇
  2020年   43篇
  2019年   52篇
  2018年   44篇
  2017年   32篇
  2016年   60篇
  2015年   54篇
  2014年   52篇
  2013年   125篇
  2012年   102篇
  2011年   117篇
  2010年   80篇
  2009年   65篇
  2008年   135篇
  2007年   124篇
  2006年   127篇
  2005年   119篇
  2004年   98篇
  2003年   70篇
  2002年   77篇
  2001年   42篇
  2000年   24篇
  1999年   23篇
  1998年   26篇
  1997年   31篇
  1996年   27篇
  1995年   18篇
  1994年   11篇
  1993年   11篇
  1992年   7篇
  1991年   3篇
  1990年   1篇
  1989年   2篇
  1986年   3篇
  1985年   5篇
  1983年   2篇
  1982年   7篇
  1981年   2篇
  1975年   1篇
排序方式: 共有1895条查询结果,搜索用时 31 毫秒
121.
122.
We show that if is a rearrangement invariant space on that is an interpolation space between and and for which we have only a one-sided estimate of the Boyd index 1/p, 1 < p < \infty$">, then is an interpolation space between and . This gives a positive answer for a question posed by Semenov. We also present the one-sided interpolation theorem about operators of strong type and weak type .

  相似文献   

123.
In this paper we consider a problem of distance selection in the arrangement of hyperplanes induced by n given points. Given a set of n points in d-dimensional space and a number k, , determine the hyperplane that is spanned by d points and at distance ranked by k from the origin. For the planar case we present an O(nlog2n) runtime algorithm using parametric search partly different from the usual approach [N. Megiddo, J. ACM 30 (1983) 852]. We establish a connection between this problem in 3-d and the well-known 3SUM problem using an auxiliary problem of counting the number of vertices in the arrangement of n planes that lie between two sheets of a hyperboloid. We show that the 3-d problem is almost 3SUM-hard and solve it by an O(n2log2n) runtime algorithm. We generalize these results to the d-dimensional (d4) space and consider also a problem of enumerating distances.  相似文献   
124.
Churilov S  Joshi YN  Reader J 《Optics letters》2003,28(16):1478-1480
The spectrum of xenon excited in a low-inductance vacuum spark was photographed at high resolution in the region of 9.5-15.5 nm. The observed transitions were identified as belonging to ions from Xe8+ to Xe13+. In the region of importance for extreme-ultraviolet lithography around 13.4 nm, the strongest lines were identified as 4d8-4d7 5p transitions in Xe10+. The identifications were made by use of energy parameters extrapolated along the isoelectronic sequence.  相似文献   
125.
126.
127.
The reaction of a trinuclear polyhydride complex Ru3H5(C5H5)3 with cyclopentadiene, C5H6, has been studied computationally. A mechanism for the experimentally observed selective C-C bond activation is proposed. All three Ru centers participate in various steps of the mechanism. The catalytic involvement of two cluster hydrides in the transformation of the C5Hn fragment is emphasized.  相似文献   
128.
We investigate Fuglede's spectral set conjecture in the special case when the set in question is a union of finitely many unit intervals in dimension 1. In this case, the conjecture can be reformulated as a statement about multiplicative properties of roots of associated with the set polynomials with (0,1) coefficients. Let be an N-term polynomial. We say that {θ1,θ2,…,θN−1} is an N-spectrum for A(x) if the θj are all distinct and
  相似文献   
129.
It is well known, that pseudodifferential equations of negative order considered in Sobolev spaces with small smoothness indices are ill–posed. On the other hand, it is known that efficient discretization schemes with properly chosen discretization parameters allow to obtain a regularization effect for such equations. The main accomplishment of the present paper is the principle for the adaptive choice of the discretization parameters directly from noisy discrete data. We argue that the combination of this principle with wavelet–based matrix compression techniques leads to algorithms which are order–optimal in the sense of complexity.  相似文献   
130.
Consider a new concept of stability of the so-called rated motion of a system of an ordinary differential equations. A rated motion need not be a solution of this system at all. In terms of Lyapunovs direct method, formulate and prove certain statements about rated stability, asymptotically rated stability, and rated unstability of zero motion of a system of an ordinary differential equations.AMS Subject Classification (1991): 34D05 34D35 93D30 93D20  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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