全文获取类型
收费全文 | 98947篇 |
免费 | 7179篇 |
国内免费 | 15726篇 |
专业分类
化学 | 76555篇 |
晶体学 | 2474篇 |
力学 | 1579篇 |
综合类 | 872篇 |
数学 | 17802篇 |
物理学 | 22570篇 |
出版年
2024年 | 150篇 |
2023年 | 1218篇 |
2022年 | 2086篇 |
2021年 | 2470篇 |
2020年 | 2745篇 |
2019年 | 2677篇 |
2018年 | 2265篇 |
2017年 | 2991篇 |
2016年 | 3019篇 |
2015年 | 2573篇 |
2014年 | 3675篇 |
2013年 | 8072篇 |
2012年 | 6185篇 |
2011年 | 5825篇 |
2010年 | 4915篇 |
2009年 | 6363篇 |
2008年 | 6371篇 |
2007年 | 6601篇 |
2006年 | 5967篇 |
2005年 | 5216篇 |
2004年 | 4922篇 |
2003年 | 4049篇 |
2002年 | 4488篇 |
2001年 | 3187篇 |
2000年 | 3608篇 |
1999年 | 3142篇 |
1998年 | 2775篇 |
1997年 | 1843篇 |
1996年 | 1654篇 |
1995年 | 1590篇 |
1994年 | 1404篇 |
1993年 | 1131篇 |
1992年 | 1083篇 |
1991年 | 762篇 |
1990年 | 636篇 |
1989年 | 590篇 |
1988年 | 444篇 |
1987年 | 354篇 |
1986年 | 314篇 |
1985年 | 348篇 |
1984年 | 310篇 |
1983年 | 158篇 |
1982年 | 260篇 |
1981年 | 257篇 |
1980年 | 239篇 |
1979年 | 216篇 |
1978年 | 207篇 |
1977年 | 160篇 |
1976年 | 121篇 |
1973年 | 65篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
In this paper, we describe an algorithm to stably sort an array ofn elements using only a linear number of data movements and constant extra space, albeit in quadratic time. It was not known previously whether such an algorithm existed. When the input contains only a constant number of distinct values, we present a sequence ofin situ stable sorting algorithms makingO(n lg(k+1)
n+kn) comparisons (lg(K) means lg iteratedk times and lg* the number of times the logarithm must be taken to give a result 0) andO(kn) data movements for any fixed valuek, culminating in one that makesO(n lg*n) comparisons and data movements. Stable versions of quicksort follow from these algorithms.Research supported by Natural Sciences and Engineering Research Council of Canada grant No.A-8237 and the Information Technology Research Centre of Ontario.Supported in part by a Research Initiation Grant from the Virginia Engineering Foundation. 相似文献
992.
Yosihiko Ogata 《Annals of the Institute of Statistical Mathematics》1990,42(3):403-433
This paper describes a method for an objective selection of the optimal prior distribution, or for adjusting its hyper-parameter, among the competing priors for a variety of Bayesian models. In order to implement this method, the integration of very high dimensional functions is required to get the normalizing constants of the posterior and even of the prior distribution. The logarithm of the high dimensional integral is reduced to the one-dimensional integration of a cerain function with respect to the scalar parameter over the range of the unit interval. Having decided the prior, the Bayes estimate or the posterior mean is used mainly here in addition to the posterior mode. All of these are based on the simulation of Gibbs distributions such as Metropolis' Monte Carlo algorithm. The improvement of the integration's accuracy is substantial in comparison with the conventional crude Monte Carlo integration. In the present method, we have essentially no practical restrictions in modeling the prior and the likelihood. Illustrative artificial data of the lattice system are given to show the practicability of the present procedure. 相似文献
993.
A notion of anin-tree is introduced. It is then used to characterize and count plane embeddings of outerplanar graphs. In-trees have also been applied in the study of independent vertex covers of faces in outerplanar graphs.This research was partially supported by the grant RP.I.09, from the Institute of Informatics, University of Warsaw. Hospitality of the Institute of Datalogy, University of Copenhagen where this research has been completed is gratefully acknowledged. 相似文献
994.
Summary Comparison theorems for weak splittings of bounded operators are presented. These theorems extend the classical comparison theorem for regular splittings of matrices by Varga, the less known result by Wonicki, and the recent results for regular and weak regular splittings of matrices by Neumann and Plemmons, Elsner, and Lanzkron, Rose and Szyld. The hypotheses of the theorems presented here are weaker and the theorems hold for general Banach spaces and rather general cones. Hypotheses are given which provide strict inequalities for the comparisons. It is also shown that the comparison theorem by Alefeld and Volkmann applies exclusively to monotone sequences of iterates and is not equivalent to the comparison of the spectral radius of the iteration operators.This work was supported by the National Science Foundation grants DMS-8807338 and INT-8918502 相似文献
995.
Summary We prove that the error inn-point Gaussian quadrature, with respect to the standard weight functionw1, is of best possible orderO(n
–2) for every bounded convex function. This result solves an open problem proposed by H. Braß and published in the problem section of the proceedings of the 2. Conference on Numerical Integration held in 1981 at the Mathematisches Forschungsinstitut Oberwolfach (Hämmerlin 1982; Problem 2). Furthermore, we investigate this problem for positive quadrature rules and for general product quadrature. In particular, for the special class of Jacobian weight functionsw
, (x)=(1–x)(1+x), we show that the above result for Gaussian quadrature is not valid precisely ifw
, is unbounded.Dedicated to Prof. H. Braß on the occasion of his 55th birthday 相似文献
996.
Summary Utilizing kernel structure properties a unified construction of Hankel matrix inversion algorithms is presented. Three types of algorithms are obtained: 1)O(n
2) complexity Levinson type, 2)O (n) parallel complexity Schur-type, and 3)O(n log2
n) complexity asymptotically fast ones. All algorithms work without additional assumption (like strong nonsingularity). 相似文献
997.
Summary The good Boussinesq equationu
tt
=–u
xxxx
+u
xx
+(u
2)
xx
has recently been found to possess an interesting soliton-interaction mechanism. In this paper we study the nonlinear stability and the convergence of some simple finite-difference schemes for the numerical solution of problems involving the good Boussinesq equation. Numerical experimentas are also reported. 相似文献
998.
G. Choudury 《Numerische Mathematik》1990,57(1):179-203
Summary In this paper we study the convergence properties of a fully discrete Galerkin approximation with a backwark Euler time discretization scheme. An approach based on semigroup theory is used to deal with the nonsmooth Dirichlet boundary data which cannot be handled by standard techniques. This approach gives rise to optimal rates of convergence inL
p[O,T;L
2()] norms for boundary conditions inL
p[O,T;L
2()], 1p. 相似文献
999.
K. H. Schild 《Numerische Mathematik》1990,58(1):369-386
Summary For the numerical integration of boundary value problems for first order ordinary differential systems, collocation on Gaussian points is known to provide a powerful method. In this paper we introduce a defect correction method for the iterative solution of such high order collocation equations. The method uses the trapezoidal scheme as the basic discretization and an adapted form of the collocation equations for defect evaluation. The error analysis is based on estimates of the contractive power of the defect correction iteration. It is shown that the iteration producesO(h
2), convergence rates for smooth starting vectors. A new result is that the iteration damps all kind of errors, so that it can also handle non-smooth starting vectors successfully. 相似文献
1000.
John Todd 《Numerische Mathematik》1990,57(1):737-746
Theorem.Let the sequences {e
i
(n)
},i=1, 2, 3,n=0, 1, 2, ...be defined by
where the e
(0)
s satisfy
and where all square roots are taken positive. Then
where the convergence is quadratic and monotone and where
The discussions of convergence are entirely elementary. However, although the determination of the limits can be made in an elementary way, an acquaintance with elliptic objects is desirable for real understanding. 相似文献