全文获取类型
收费全文 | 228720篇 |
免费 | 4133篇 |
国内免费 | 1453篇 |
专业分类
化学 | 131440篇 |
晶体学 | 3604篇 |
力学 | 8990篇 |
综合类 | 55篇 |
数学 | 21896篇 |
物理学 | 68321篇 |
出版年
2019年 | 1821篇 |
2018年 | 1810篇 |
2016年 | 3309篇 |
2015年 | 2646篇 |
2014年 | 3569篇 |
2013年 | 9807篇 |
2012年 | 7793篇 |
2011年 | 9403篇 |
2010年 | 6116篇 |
2009年 | 5905篇 |
2008年 | 8171篇 |
2007年 | 8188篇 |
2006年 | 7781篇 |
2005年 | 7118篇 |
2004年 | 6483篇 |
2003年 | 5643篇 |
2002年 | 5461篇 |
2001年 | 6476篇 |
2000年 | 5056篇 |
1999年 | 3949篇 |
1998年 | 3078篇 |
1997年 | 3130篇 |
1996年 | 3163篇 |
1995年 | 2840篇 |
1994年 | 2764篇 |
1993年 | 2637篇 |
1992年 | 3118篇 |
1991年 | 2921篇 |
1990年 | 2827篇 |
1989年 | 2825篇 |
1988年 | 2756篇 |
1987年 | 2734篇 |
1986年 | 2541篇 |
1985年 | 3490篇 |
1984年 | 3435篇 |
1983年 | 2860篇 |
1982年 | 3051篇 |
1981年 | 2956篇 |
1980年 | 2851篇 |
1979年 | 2970篇 |
1978年 | 3228篇 |
1977年 | 3045篇 |
1976年 | 2993篇 |
1975年 | 2852篇 |
1974年 | 2795篇 |
1973年 | 2838篇 |
1972年 | 1802篇 |
1968年 | 1945篇 |
1967年 | 2145篇 |
1966年 | 1932篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
111.
Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast. 相似文献
112.
M. A. H. Dempster 《Journal of Mathematical Sciences》2006,133(4):1422-1444
This paper gives a comprehensive treatment of EVPI-based sequential importance sampling algorithms for dynamic (multistage)
stochastic programming problems. Both theory and computational algorithms are discussed. Under general assumptions it is shown
that both an expected value of perfect information (EVPI) process and the corresponding marginal EVPI process (the supremum
norm of the conditional expectation of its generalized derivative) are nonanticipative nonnegative supermartingales. These
processes are used as importance criteria in the class of sampling algorithms treated in the paper. When their values are
negligible at a node of the current sample problem scenario tree, scenarios descending from the node are replaced by a single
scenario at the next iteration. On the other hand, high values lead to increasing the number of scenarios descending from
the node. Both the small sample and asymptotic properties of the sample problem estimates arising from the algorithms are
established, and the former are evaluated numerically in the context of a financial planning problem. Finally, current and
future research is described. Bibliography: 49 titles.
__________
Published in Zapiski Nauchnykh Seminarov POMI, Vol. 312, 2004, pp. 94–129. 相似文献
113.
V. De Sabbata C. Sivaram H.-H. v. Borzeszkowski H.-J. Treder 《Annalen der Physik》1991,503(7):497-502
It is shown that in gravitational theories with torsion one is led to commutation rules corresponding to Landau-Peierls type uncertainty relations. 相似文献
114.
115.
A method using third order moments for estimating the regression coefficients as well as the latent state scores of the reduced-rank regression model when the latent variable(s) are non-normally distributed is presented in this paper. It is shown that the factor analysis type indeterminacy of the regression coefficient matrices is eliminated. A real life example of the proposed method is presented. Differences of this solution with the reduced-rank regression eigen solution are discussed. 相似文献
116.
Exact closed-form solutions are exhibited for the Hopf equation for stationary incompressible 3D Navier-Stokes flow, for the cases of homogeneous forced flow (including a solution with depleted nonlinearity) and inhomogeneous flow with arbitrary boundary conditions. This provides an exact method for computing two- and higher-point moments, given the mean flow. 相似文献
117.
I. L. Davies K. E. Markides M. L. Lee M. W. Raynor K. D. Bartle 《Journal of separation science》1989,12(4):193-207
Although coupled liquid chromatographygas chromatography (LC-GC) was first demonstrated ten years ago, only in the last few years has there been a sudden surge of interest in the technique. Approximately 70% of the total number of LC-GC applications have been published in the last two years (1987–88) alone. This review categorizes LC-GC publications into four main application areas: fossil fuels, foods, environmental samples, biologiical/pharmaceutical samples, and miscellaneous samples. Multidimensional separations carried out using other coupled-column chromatographic techniques (such as supercritical fluid chromatography (SFC) with GC, and on-line trace enrichment-GC) have also been included in this review. 相似文献
118.
P. David J. Hartfiel H. Janszen R. von Mutius J. Arvieux L. Farvacque B. Berthier B. Bonin J. C. Lugol 《Zeitschrift für Physik A Hadrons and Nuclei》1987,326(4):367-372
The excitation function of the fission probability P E E x) for238U has been measured in the reaction238U(α, α′ f) at 480 MeV bombarding energy. The reaction mechanism of this reaction is discussed for excitation energies belowB nf , the threshold for second chance fission, and aboveB nf up toE x =37 MeV. In comparing with results from fission induced by photons and by particle transfer reactions the (α, α′f) reaction gives too low values for the fission probabilityP f at excitation energies well aboveB nE . The role of the quasi-elastic knock-out process in this reaction is discussed. 相似文献
119.
Incomplete LU factorization preconditioning techniques often have difficulty on indefinite sparse matrices. We present hybrid reordering strategies to deal with such matrices, which include new diagonal reorderings that are in conjunction with a symmetric nondecreasing degree algorithm. We first use the diagonal reorderings to efficiently search for entries of single element rows and columns and/or the maximum absolute value to be placed on the diagonal for computing a nonsymmetric permutation. To augment the effectiveness of the diagonal reorderings, a nondecreasing degree algorithm is applied to reduce the amount of fill-in during the ILU factorization. With the reordered matrices, we achieve a noticeable improvement in enhancing the stability of incomplete LU factorizations. Consequently, we reduce the convergence cost of the preconditioned Krylov subspace methods on solving the reordered indefinite matrices. 相似文献
120.
H. Mazaheri 《分析论及其应用》2006,22(2):141-145
The concepts of quasi-Chebyshev and weakly-Chebyshev and σ-Chebyshev were defined [3 - 7], andas a counterpart to best approximation in normed linear spaces, best coapprozimation was introduced by Franchetti and Furi^[1]. In this research, we shall define τ-Chebyshev subspaces and τ-cochebyshev subspaces of a Banach space, in which the property τ is compact or weakly-compact, respectively. A set of necessary and sufficient theorems under which a subspace is τ-Chebyshev is defined. 相似文献