全文获取类型
收费全文 | 5854篇 |
免费 | 569篇 |
国内免费 | 547篇 |
专业分类
化学 | 418篇 |
晶体学 | 5篇 |
力学 | 399篇 |
综合类 | 108篇 |
数学 | 4337篇 |
物理学 | 1703篇 |
出版年
2023年 | 45篇 |
2022年 | 57篇 |
2021年 | 71篇 |
2020年 | 109篇 |
2019年 | 118篇 |
2018年 | 104篇 |
2017年 | 130篇 |
2016年 | 163篇 |
2015年 | 124篇 |
2014年 | 217篇 |
2013年 | 477篇 |
2012年 | 282篇 |
2011年 | 335篇 |
2010年 | 282篇 |
2009年 | 380篇 |
2008年 | 411篇 |
2007年 | 391篇 |
2006年 | 408篇 |
2005年 | 313篇 |
2004年 | 275篇 |
2003年 | 269篇 |
2002年 | 266篇 |
2001年 | 225篇 |
2000年 | 207篇 |
1999年 | 204篇 |
1998年 | 174篇 |
1997年 | 127篇 |
1996年 | 134篇 |
1995年 | 72篇 |
1994年 | 79篇 |
1993年 | 63篇 |
1992年 | 44篇 |
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篇 |
排序方式: 共有6970条查询结果,搜索用时 484 毫秒
31.
提出了广义变系数模型函数系数的一种新的估计方法.我们用B样条函数逼近函数系数,不具体选择节点的个数,而是节点个数取均匀的无信息先验,样条函数系数取正态先验,用Bayesian模型平均的方法估计各个函数系数.这种估计方法一个主要特点是允许各个函数系数所需节点个数的后验分布不同,因此允许不同函数系数使用不同的光滑参数.另外,本文还给出了Bayesian B样条估计的计算方法,并通过模拟例子,说明广义变系数模型的函数系数可以由Bayesian B样条估计方法得到很好的估计. 相似文献
32.
Silvia Vogel 《Annals of Operations Research》2006,142(1):269-282
The paper considers upper semicontinuous behavior in distribution of sequences of random closed sets. Semiconvergence in distribution
will be described via convergence in distribution of random variables with values in a suitable topological space. Convergence
statements for suitable functions of random sets are proved and the results are employed to derive stability statements for
random optimization problems where the objective function and the constraint set are approximated simultaneously.
The author is grateful to two anonymous referees for helpful suggestions. 相似文献
33.
J. J. EGOZCUE J. L. DIAZ-BARRERO V. PAWLOWSKY-GLAHN 《数学学报(英文版)》2006,22(4):1175-1182
The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison's ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space. 相似文献
34.
Marco Pretti 《Journal of statistical physics》2003,111(3-4):993-1015
In this article we deal with the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods are equivalent also in the analysis of infinite (self-similar) cactus trees, usually investigated to the purpose of approximating ordinary lattice systems. Such issue is hardly ever considered in the literature. We show (on significant test models) that the phase diagram and the thermodynamic quantities computed by the variational method, when they deviates from the exact bulk properties of the cactus system, generally provide a better approximation to the behavior of a corresponding ordinary system. Generalizing a property proved by Kikuchi, we also show that the numerical algorithm usually employed to perform the free energy minimization in the variational approach is always convergent. 相似文献
35.
We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful measure for optimization problems where the random assignment algorithm is known to give essentially the best possible polynomial time approximation. In this paper, we focus on this measure for the optimization problems Max‐Lin‐2 in which we need to maximize the number of satisfied linear equations in a system of linear equations modulo 2, and Max‐k‐Lin‐2, a special case of the above problem in which each equation has at most k variables. The main techniques we use, in our approximation algorithms and inapproximability results for this measure, are from Fourier analysis and derandomization. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
36.
37.
Spectral and Pseudospectral Approximations Using Hermite Functions: Application to the Dirac Equation 总被引:1,自引:0,他引:1
We consider in this paper spectral and pseudospectral approximations using Hermite functions for PDEs on the whole line. We first develop some basic approximation results associated with the projections and interpolations in the spaces spanned by Hermite functions. These results play important roles in the analysis of the related spectral and pseudospectral methods. We then consider, as an example of applications, spectral and pseudospectral approximations of the Dirac equation using Hermite functions. In particular, these schemes preserve the essential conservation property of the Dirac equation. We also present some numerical results which illustrate the effectiveness of these methods. 相似文献
38.
D. Barrios Rolanía G. Lpez Lagomasino E. B. Saff 《Journal of Approximation Theory》2003,124(2):263-281
Using a convergence theorem for Fourier–Padé approximants constructed from orthogonal polynomials on the unit circle, we prove an analogue of Hadamard's theorem for determining the radius of m-meromorphy of a function analytic on the unit disk and apply this to the location of poles of the reciprocal of Szeg
functions. 相似文献
39.
M.K. Gupta Vijay Gupta Manoj Kumar 《Journal of Mathematical Analysis and Applications》2007,330(2):799-816
In the present paper we introduce a new family of linear positive operators and study some direct and inverse results in simultaneous approximation. 相似文献
40.
Somyot Plubtieng Rattanaporn Punpaeng 《Journal of Mathematical Analysis and Applications》2007,336(1):455-469
In this paper, we introduce two iterative schemes by the general iterative method for finding a common element of the set of an equilibrium problem and the set of fixed points of a nonexpansive mapping in a Hilbert space. Then, we prove two strong convergence theorems for nonexpansive mappings to solve a unique solution of the variational inequality which is the optimality condition for the minimization problem. These results extended and improved the corresponding results of Marino and Xu [G. Marino, H.K. Xu, A general iterative method for nonexpansive mapping in Hilbert spaces, J. Math. Anal. Appl. 318 (2006) 43-52], S. Takahashi and W. Takahashi [S. Takahashi, W. Takahashi, Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 331 (1) (2007) 506-515], and many others. 相似文献