全文获取类型
收费全文 | 6018篇 |
免费 | 613篇 |
国内免费 | 535篇 |
专业分类
化学 | 428篇 |
晶体学 | 6篇 |
力学 | 439篇 |
综合类 | 107篇 |
数学 | 4440篇 |
物理学 | 1746篇 |
出版年
2023年 | 48篇 |
2022年 | 67篇 |
2021年 | 77篇 |
2020年 | 130篇 |
2019年 | 133篇 |
2018年 | 118篇 |
2017年 | 145篇 |
2016年 | 180篇 |
2015年 | 138篇 |
2014年 | 237篇 |
2013年 | 496篇 |
2012年 | 287篇 |
2011年 | 345篇 |
2010年 | 288篇 |
2009年 | 391篇 |
2008年 | 416篇 |
2007年 | 393篇 |
2006年 | 407篇 |
2005年 | 314篇 |
2004年 | 285篇 |
2003年 | 272篇 |
2002年 | 257篇 |
2001年 | 226篇 |
2000年 | 203篇 |
1999年 | 209篇 |
1998年 | 170篇 |
1997年 | 125篇 |
1996年 | 131篇 |
1995年 | 75篇 |
1994年 | 78篇 |
1993年 | 65篇 |
1992年 | 45篇 |
1991年 | 39篇 |
1990年 | 42篇 |
1989年 | 24篇 |
1988年 | 41篇 |
1987年 | 25篇 |
1986年 | 21篇 |
1985年 | 34篇 |
1984年 | 35篇 |
1983年 | 16篇 |
1982年 | 27篇 |
1981年 | 17篇 |
1980年 | 17篇 |
1979年 | 21篇 |
1978年 | 10篇 |
1977年 | 14篇 |
1976年 | 8篇 |
1974年 | 7篇 |
1970年 | 3篇 |
排序方式: 共有7166条查询结果,搜索用时 312 毫秒
71.
Martin Skutella 《Mathematical Programming》2002,91(3):493-514
In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex
to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed
along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed
a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various
areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing.
Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results
of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques
do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation
results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally,
we provide results on the hardness of approximation for several variants of the problem.
Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001 相似文献
72.
Polyharmonic splines are used to interpolate data in a stationary multilevel iterative refinement scheme. By using such functions the necessary tools are provided to obtain simple pointwise error bounds on the approximation. Linear convergence between levels is shown for regular data on a scaled multiinteger grid, and a multilevel domain decomposition method. 相似文献
73.
74.
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. 相似文献
75.
对称正交反对称矩阵反问题解存在的条件 总被引: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, 相似文献
76.
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. 相似文献
77.
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.
78.
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 相似文献
79.
We generalize a variational principle for the mean spherical approximation for a system of charged hard spheres in 3D to arbitrary
dimensions. We first construct a free energy variational trial function from the Debye-Hückel excess charging internal energy
at a finite concentration and an entropy obtained at the zero-concentration limit by thermodynamic integration. In three dimensions
the minimization of this expression with respect to the screening parameter leads to the mean spherical approximation, usually
obtained by solution of the Ornstein-Zernike equation. This procedure, which interpolates naturally between the zero concentration/coupling
limit and the high-concentration/ coupling limit, is extended to arbitrary dimensions. We conjecture that this result is also
equivalent to the MSA as originally defined, although a technical proof of this point is left for the future. The Onsager
limitT ΔS
MSA
/ΔE
MSA
→ 0 for infinite concentration/coupling is satisfied for all d ≠ 2, while ford=2 this limit is 1.
On leave from Department of Physics, University of Puerto Rico, Mayagüez Campus, Mayagüez, Puerto Rico, 00681. 相似文献
80.
给定一组工件的加工时间与工期,要求确定这些工件在一台机器上的加.工排列,使相应的总延误达到最小,这就是总延误问题.该问题在近年已被证明是NP困难的.由Wilkermn和Irwin(1971),林勋(1983)等所研究的顺时安排法能得到相邻交换意义下的局部解.在本文中,我们进一步证明该算法能得到前移邻域意义下的局部解,并确定了该算法的性能比. 相似文献