首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5783篇
  免费   570篇
  国内免费   526篇
化学   419篇
晶体学   5篇
力学   399篇
综合类   105篇
数学   4242篇
物理学   1709篇
  2023年   45篇
  2022年   61篇
  2021年   69篇
  2020年   109篇
  2019年   117篇
  2018年   105篇
  2017年   127篇
  2016年   159篇
  2015年   124篇
  2014年   213篇
  2013年   475篇
  2012年   276篇
  2011年   329篇
  2010年   279篇
  2009年   380篇
  2008年   409篇
  2007年   389篇
  2006年   402篇
  2005年   307篇
  2004年   274篇
  2003年   261篇
  2002年   250篇
  2001年   224篇
  2000年   199篇
  1999年   205篇
  1998年   168篇
  1997年   123篇
  1996年   132篇
  1995年   72篇
  1994年   76篇
  1993年   63篇
  1992年   44篇
  1991年   39篇
  1990年   42篇
  1989年   24篇
  1988年   41篇
  1987年   25篇
  1986年   21篇
  1985年   33篇
  1984年   34篇
  1983年   16篇
  1982年   27篇
  1981年   17篇
  1980年   17篇
  1979年   21篇
  1978年   10篇
  1977年   14篇
  1976年   8篇
  1974年   7篇
  1970年   3篇
排序方式: 共有6879条查询结果,搜索用时 406 毫秒
131.
ALTERNATIONTHEORYINAPPROXIMATIONBYPOLYNOMIALSHAVINGBOUNDEDCOEFFICIENTSXUSHUSHENG(许树声)(JiangnanUniversity,Wuxi214063,China)Abs...  相似文献   
132.
A time-parallel simulation obtains parallelism by partitioning the time domain of the simulation. An approximate time-parallel simulation algorithm named GG1K is developed for acyclic networks of loss FCFSG/G/1/K queues. The GG1K algorithm requires two phases. In the first phase, a similar system (i.e. aG/G/1/ queue) is simulated using the GLM algorithm. Then the resultant trajectory is transformed into an approximateG/G/1/K trajectory in the second phase. The closeness of the approximation is investigated theoretically and experimentally. Our results show that the approximation is highly accurate except whenK is very small (e.g. 5) in certain models. The algorithm exploits unbounded parallelism and can achieve near-linear speedup when the number of arrivals simulated is sufficiently large.  相似文献   
133.
An energy-transport model is rigorously derived from the Boltzmann transport equation of semiconductors under the hypothesis that the energy gain or loss of the electrons by the phonon collisions is weak. Retaining at leading order electron-electron collisions and elastic collisions (i.e., impurity scattering and the elastic part of phonon collisions), a rigorous diffusion limit of the Boltzmann equation can be carried over, which leads to a set of diffusion equations for the electron density and temperature. The derivation is given in both the degenerate and nondegenerate cases.  相似文献   
134.
We study the convergence of rational interpolants with prescribed poles on the unit circle to the Herglotz-Riesz transform of a complex measure supported on [–, ]. As a consequence, quadrature formulas arise which integrate exactly certain rational functions. Estimates of the rate of convergence of these quadrature formulas are also included.This research was performed as part of the European project ROLLS under contract CHRX-CT93-0416.  相似文献   
135.
In this paper a piece of a conic section is approximated by a cubic or piecewise cubic polynomial. The main tool is to define the two inner control points of the cubic as an affine combination, defined by [0, 1], of two control points of the conic. If is taken to depend on the weightw of the latter, a function (w) results which is used to distinguish between different algorithms and to analyze their properties. One of the approximations is a piecewise cubic havingG 4 continuity at the break points.  相似文献   
136.
This paper presents the exact asymptotics of the steady state behavior of a broad class of single-node queueing systems. First we show that the asymptotic probability functions derived using large deviations theory are consistent (in a certain sense) with the result using dominant pole approximations. Then we present an exact asymptotic formula for the cumulative probability function of the queue occupancy and relate it to the cell loss ratio, an important performance measure for service systems such as ATM networks. The analysis relies on a new generalization of the Taylor coefficients of a complex function which we call characteristic coefficients. Finally we apply our framework to obtain new results for the M/D/1 system and for a more intricate multiclass M/D/n system.  相似文献   
137.
Rigorous asymptotic approximations of the WKB (or Liouville-Green) type are obtained for a basis of solutions to in the framework of -algebras. Both cases and are included, thus generalizing the classical theory for scalar equations developed by F.W.J. Olver to matrix as well as to infinite-dimensional equations.

  相似文献   

138.
We show that the -functional

where , is equivalent to the rate of convergence of a certain linear polynomial operator. This operator stems from a Riesz-type summability process of expansion by Legendre polynomials. We use the operator above to obtain a linear polynomial approximation operator with a rate comparable to that of the best polynomial approximation.

  相似文献   

139.
It is shown that, given a lower semicontinuous convex integrandf satisfying a suitable integrability condition, there exists a sequence of Lipschitz simple integrands which Mosco converges tof and such that the sequence of conjugate integrands Mosco converges tof *. Moreover, this sequence can be chosen so that the sequence of associated integral functionals, respectively defined onL 1(X) andL (X *), Mosco converges as well.We wish to thank Professor Erik J. Balder for interesting remarks on the first version of this work.  相似文献   
140.
A good preconditioner is extremely important in order for the conjugate gradients method to converge quickly. In the case of Toeplitz matrices, a number of recent studies were made to relate approximation of functions to good preconditioners. In this paper, we present a new result relating the quality of the Toeplitz preconditionerC for the Toeplitz matrixT to the Chebyshev norm (f– g)/f, wheref and g are the generating functions forT andC, respectively. In particular, the construction of band-Toeplitz preconditioners becomes a linear minimax approximation problem. The case whenf has zeros (but is nonnegative) is especially interesting and the corresponding approximation problem becomes constrained. We show how the Remez algorithm can be modified to handle the constraints. Numerical experiments confirming the theoretical results are presented.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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