全文获取类型
收费全文 | 5903篇 |
免费 | 573篇 |
国内免费 | 539篇 |
专业分类
化学 | 422篇 |
晶体学 | 5篇 |
力学 | 402篇 |
综合类 | 105篇 |
数学 | 4339篇 |
物理学 | 1742篇 |
出版年
2023年 | 48篇 |
2022年 | 73篇 |
2021年 | 71篇 |
2020年 | 111篇 |
2019年 | 118篇 |
2018年 | 107篇 |
2017年 | 128篇 |
2016年 | 159篇 |
2015年 | 131篇 |
2014年 | 219篇 |
2013年 | 488篇 |
2012年 | 285篇 |
2011年 | 332篇 |
2010年 | 294篇 |
2009年 | 385篇 |
2008年 | 413篇 |
2007年 | 400篇 |
2006年 | 410篇 |
2005年 | 313篇 |
2004年 | 277篇 |
2003年 | 267篇 |
2002年 | 253篇 |
2001年 | 226篇 |
2000年 | 203篇 |
1999年 | 204篇 |
1998年 | 172篇 |
1997年 | 123篇 |
1996年 | 133篇 |
1995年 | 73篇 |
1994年 | 77篇 |
1993年 | 65篇 |
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篇 |
排序方式: 共有7015条查询结果,搜索用时 15 毫秒
41.
J. Keilson 《Annals of Operations Research》1987,9(1):439-447
A redundant system of independent repairable components with general failure time and repair time distributions is considered. It is shown that the system failure time has an expectation dependent only on the mean failure times and mean repair times of the components and not on their distributions. An intuitive argument is provided, based on the time of onset of the quasi-stationary distribution on the set of working states, to show that for highly reliable systems, the system failure time is exponentially distributed to good approximation. The argument also justifies a simple figure of merit for the quality of the exponential approximation. A key ingredient in the analysis is the system relaxation time, an informal review of which is provided. 相似文献
42.
Arne Barinka Stephan Dahlke Wolfgang Dahmen 《Advances in Computational Mathematics》2006,24(1-4):5-34
Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work
balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations
as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the
approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could
be shown under the assumption that the entries in properly compressed standard representations are known or computable in
average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption
is justified in the context of elliptic boundary value problems.
Dedicated to Charles A. Micchelli on the occasion of his 60th birthday
Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55.
This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported
in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The
second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract
HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1. 相似文献
43.
We have generalized the coherent potential approximation (CPA) of Tripathi and Behera to the case of ann-component alloy. It is seen that then-component CPA density of states reproduces the binary, ternary quartenary alloys etc when the appropriate limits are adopted. 相似文献
44.
对称正交反对称矩阵反问题解存在的条件 总被引:25,自引:1,他引:24
戴华 《高等学校计算数学学报》2002,24(2):169-178
矩阵反问题和矩阵特征值反问题在科学和工程技术中具有广泛的应用,有关它们的研究已取得了许多进展[1,2].[3]和[4]分别研究了反对称矩阵反问题和双反对称矩阵特征值反问题等.本文研究一类更广泛的对称正交反对称矩阵反问题.用Rn×m(Cn×m)表示n×m实(复)矩阵的全体,ASRn×n表示n阶反对称矩阵的全体,ABSRn×n表示n阶双反对称矩阵的全体,ORn×n表示n阶正交矩阵的全体.A+表示矩阵A的Moore-Penrose广义逆.In表示n阶单位矩阵.ei表示n阶单位矩阵的第i列,Sn=[en,en-1, 相似文献
45.
Roland Opfer 《Advances in Computational Mathematics》2006,25(4):357-380
This paper reconstructs multivariate functions from scattered data by a new multiscale technique. The reconstruction uses
standard methods of interpolation by positive definite reproducing kernels in Hilbert spaces. But it adopts techniques from
wavelet theory and shift-invariant spaces to construct a new class of kernels as multiscale superpositions of shifts and scales
of a single compactly supported function φ. This means that the advantages of scaled regular grids are used to construct the
kernels, while the advantages of unrestricted scattered data interpolation are maintained after the kernels are constructed.
Using such a multiscale kernel, the reconstruction method interpolates at given scattered data. No manipulations of the data
(e.g., thinning or separation into subsets of certain scales) are needed. Then, the multiscale structure of the kernel allows
to represent the interpolant on regular grids on all scales involved, with cheap evaluation due to the compact support of
the function φ, and with a recursive evaluation technique if φ is chosen to be refinable. There also is a wavelet-like data
reduction effect, if a suitable thresholding strategy is applied to the coefficients of the interpolant when represented over
a scaled grid. Various numerical examples are presented, illustrating the multiresolution and data compression effects. 相似文献
46.
Carsten Franz 《Proceedings of the American Mathematical Society》2006,134(8):2437-2446
A method to approximate the eigenvalues of linear operators depending on an unknown distribution is introduced and applied to weighted sums of squared normally distributed random variables. This area of application includes the approximation of the asymptotic null distribution of certain degenerated U- and V-statistics.
47.
Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with
respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization
of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case
of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods
and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank
approximants. Properties of Gander methods are investigated in details.
AMS subject classification (2000) 65F30, 15A18 相似文献
48.
给定一组工件的加工时间与工期,要求确定这些工件在一台机器上的加.工排列,使相应的总延误达到最小,这就是总延误问题.该问题在近年已被证明是NP困难的.由Wilkermn和Irwin(1971),林勋(1983)等所研究的顺时安排法能得到相邻交换意义下的局部解.在本文中,我们进一步证明该算法能得到前移邻域意义下的局部解,并确定了该算法的性能比. 相似文献
49.
50.
在本文中,我们提出了双凹规划问题和更一般的广义凹规划问题。我们给出了双凹规划问题的整体最优性条件,并构造了一个有限终止外逼近算法。 相似文献