全文获取类型
收费全文 | 49856篇 |
免费 | 5940篇 |
国内免费 | 4532篇 |
专业分类
化学 | 14289篇 |
晶体学 | 999篇 |
力学 | 10164篇 |
综合类 | 626篇 |
数学 | 19160篇 |
物理学 | 15090篇 |
出版年
2024年 | 105篇 |
2023年 | 585篇 |
2022年 | 990篇 |
2021年 | 1218篇 |
2020年 | 1552篇 |
2019年 | 1362篇 |
2018年 | 1376篇 |
2017年 | 1800篇 |
2016年 | 1962篇 |
2015年 | 1563篇 |
2014年 | 2611篇 |
2013年 | 4063篇 |
2012年 | 3041篇 |
2011年 | 3362篇 |
2010年 | 2800篇 |
2009年 | 3289篇 |
2008年 | 3233篇 |
2007年 | 3074篇 |
2006年 | 2751篇 |
2005年 | 2585篇 |
2004年 | 2190篇 |
2003年 | 1897篇 |
2002年 | 1695篇 |
2001年 | 1388篇 |
2000年 | 1322篇 |
1999年 | 1224篇 |
1998年 | 1118篇 |
1997年 | 953篇 |
1996年 | 811篇 |
1995年 | 660篇 |
1994年 | 603篇 |
1993年 | 497篇 |
1992年 | 499篇 |
1991年 | 371篇 |
1990年 | 291篇 |
1989年 | 231篇 |
1988年 | 196篇 |
1987年 | 149篇 |
1986年 | 101篇 |
1985年 | 157篇 |
1984年 | 146篇 |
1983年 | 70篇 |
1982年 | 96篇 |
1981年 | 72篇 |
1980年 | 41篇 |
1979年 | 57篇 |
1978年 | 42篇 |
1977年 | 45篇 |
1976年 | 22篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
931.
Least squares estimations have been used extensively in many applications, e.g. system identification and signal prediction. When the stochastic process is stationary, the least squares estimators can be found by solving a Toeplitz or near-Toeplitz matrix system depending on the knowledge of the data statistics. In this paper, we employ the preconditioned conjugate gradient method with circulant preconditioners to solve such systems. Our proposed circulant preconditioners are derived from the spectral property of the given stationary process. In the case where the spectral density functions() of the process is known, we prove that ifs() is a positive continuous function, then the spectrum of the preconditioned system will be clustered around 1 and the method converges superlinearly. However, if the statistics of the process is unknown, then we prove that with probability 1, the spectrum of the preconditioned system is still clustered around 1 provided that large data samples are taken. For finite impulse response (FIR) system identification problems, our numerical results show that annth order least squares estimator can usually be obtained inO(n logn) operations whenO(n) data samples are used. Finally, we remark that our algorithm can be modified to suit the applications of recursive least squares computations with the proper use of sliding window method arising in signal processing applications.Research supported in part by HKRGC grant no. 221600070, ONR contract no. N00014-90-J-1695 and DOE grant no. DE-FG03-87ER25037. 相似文献
932.
Misclassification minimization 总被引:1,自引:0,他引:1
O. L. Mangasarian 《Journal of Global Optimization》1994,5(4):309-323
The problem of minimizing the number of misclassified points by a plane, attempting to separate two point sets with intersecting convex hulls inn-dimensional real space, is formulated as a linear program with equilibrium constraints (LPEC). This general LPEC can be converted to an exact penalty problem with a quadratic objective and linear constraints. A Frank-Wolfe-type algorithm is proposed for the penalty problem that terminates at a stationary point or a global solution. Novel aspects of the approach include: (i) A linear complementarity formulation of the step function that counts misclassifications, (ii) Exact penalty formulation without boundedness, nondegeneracy or constraint qualification assumptions, (iii) An exact solution extraction from the sequence of minimizers of the penalty function for a finite value of the penalty parameter for the general LPEC and an explicitly exact solution for the LPEC with uncoupled constraints, and (iv) A parametric quadratic programming formulation of the LPEC associated with the misclassification minimization problem.This material is based on research supported by Air Force Office of Scientific Research Grant F49620-94-1-0036 and National Science Foundation Grants CCR-9101801 and CDA-9024618. 相似文献
933.
934.
S. Czajkowski M. Bernas P. Armbruster H. Geissel C. Kozhuharov G. Münzenberg D. Vieira Ph. Dessagne Ch. Miehe E. Hanelt G. Audi J. K. P. Lee 《Zeitschrift für Physik A Hadrons and Nuclei》1994,348(4):267-272
Neutron-rich Co and Fe isotopes produced by86Kr projectile fragmentation at 500 MeV/u were separated and identified using the fragment separator (FrS) in a bunched energy mode.66Co and65Fe ions were selectively implanted in a double PIN-diode array where the-decay signals were measured. The half-lives were deduced from time correlations between implantation and-decay signals. The remeasurement of the66Co half-life confirms the isotope identification. The value of the65Fe half-life was found to be 0.45±0.15 s. 相似文献
935.
H. Navarro T. Timusk W. R. Datars D. C. Houghton 《Applied Physics A: Materials Science & Processing》1994,59(4):373-379
We have applied the technique of Photo Thermal Ionization Spectroscopy (PTIS) to the study of an erbium-doped p-Ge epitaxial layer, grown by MBE on an undoped n-type germanium substrate. The Er-doped Ge layer shows continuum photoconductivity response in the far-infrared region extending from 70 cm–1 to 900 cm–1. This type of epitaxial Er-doped Ge layers is a potentially attractive system for photoconductivity detectors of far-infrared radiation. Below 900 cm–1 three acceptor-like charged states can be distinguished with ionization energies of 9, 26.6 and 50 meV. Additionally, a study of the photoconductive response of the same sample for radiation from 1000 cm–1 to 10000 cm–1, i.e., for radiation energies well inside the forbidden gap to energies above it, shows a wealth of levels, some of which have previously been associated with erbium.On leave from: Instituto de Física, Universidad Autónoma de Puebla, Puebla, México 相似文献
936.
937.
Let be complex numbers, and consider the power sums , . Put , where the minimum is over all possible complex numbers satisfying the above. Turán conjectured that , for some positive absolute constant. Atkinson proved this conjecture by showing . It is now known that , for . Determining whether or approaches some other limiting value as is still an open problem. Our calculations show that an upper bound for decreases for , suggesting that decreases to a limiting value less than as .
938.
For the multidimensional heat equation in a parallelepiped, optimal error estimates inL
2(Q) are derived. The error is of the order of +¦h¦2 for any right-hand sidef L
2(Q) and any initial function
; for appropriate classes of less regularf andu
0, the error is of the order of ((+¦h¦2
), 1/2<1.Translated fromMatematicheskie Zametki, Vol. 60, No. 2, pp. 185–197, August, 1996. 相似文献
939.
Xiao-Qing Jin 《BIT Numerical Mathematics》1996,36(1):101-109
We study methods for solving the constrained and weighted least squares problem min
x
by the preconditioned conjugate gradient (PCG) method. HereW = diag (1, ,
m
) with 1
m
0, andA
T
= [T
1
T
, ,T
k
T
] with Toeplitz blocksT
l
R
n × n
,l = 1, ,k. It is well-known that this problem can be solved by solving anaugmented linear 2 × 2 block linear systemM +Ax =b, A
T
= 0, whereM =W
–1. We will use the PCG method with circulant-like preconditioner for solving the system. We show that the spectrum of the preconditioned matrix is clustered around one. When the PCG method is applied to solve the system, we can expect a fast convergence rate.Research supported by HKRGC grants no. CUHK 178/93E and CUHK 316/94E. 相似文献
940.
Nahid Emad 《Numerical Algorithms》1996,11(1):159-179
We make use of the Padé approximants and the Krylov sequencex, Ax,,...,A
m–1
x in the projection methods to compute a few Ritz values of a large hermitian matrixA of ordern. This process consists in approaching the poles ofR
x()=((I–A)–1
x,x), the mean value of the resolvant ofA, by those of [m–1/m]Rx(), where [m–1/m]Rx() is the Padé approximant of orderm of the functionR
x(). This is equivalent to approaching some eigenvalues ofA by the roots of the polynomial of degreem of the denominator of [m–1/m]Rx(). This projection method, called the Padé-Rayleigh-Ritz (PRR) method, provides a simple way to determine the minimum polynomial ofx in the Krylov subspace methods for the symmetrical case. The numerical stability of the PRR method can be ensured if the projection subspacem is sufficiently small. The mainly expensive portion of this method is its projection phase, which is composed of the matrix-vector multiplications and, consequently, is well suited for parallel computing. This is also true when the matrices are sparse, as recently demonstrated, especially on massively parallel machines. This paper points out a relationship between the PRR and Lanczos methods and presents a theoretical comparison between them with regard to stability and parallelism. We then try to justify the use of this method under some assumptions. 相似文献