全文获取类型
收费全文 | 2648篇 |
免费 | 161篇 |
国内免费 | 244篇 |
专业分类
化学 | 46篇 |
晶体学 | 1篇 |
力学 | 218篇 |
综合类 | 48篇 |
数学 | 2368篇 |
物理学 | 372篇 |
出版年
2024年 | 7篇 |
2023年 | 23篇 |
2022年 | 30篇 |
2021年 | 42篇 |
2020年 | 53篇 |
2019年 | 55篇 |
2018年 | 50篇 |
2017年 | 60篇 |
2016年 | 72篇 |
2015年 | 69篇 |
2014年 | 128篇 |
2013年 | 154篇 |
2012年 | 76篇 |
2011年 | 123篇 |
2010年 | 127篇 |
2009年 | 165篇 |
2008年 | 199篇 |
2007年 | 203篇 |
2006年 | 164篇 |
2005年 | 160篇 |
2004年 | 128篇 |
2003年 | 136篇 |
2002年 | 124篇 |
2001年 | 91篇 |
2000年 | 98篇 |
1999年 | 78篇 |
1998年 | 97篇 |
1997年 | 75篇 |
1996年 | 44篇 |
1995年 | 36篇 |
1994年 | 32篇 |
1993年 | 21篇 |
1992年 | 23篇 |
1991年 | 18篇 |
1990年 | 14篇 |
1989年 | 13篇 |
1988年 | 4篇 |
1987年 | 10篇 |
1986年 | 3篇 |
1985年 | 13篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1971年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有3053条查询结果,搜索用时 15 毫秒
81.
We study the approximation of the inverse wavelet transform using Riemannian sums.We show that when the Fourier transforms of wavelet functions satisfy some moderate decay condition,the Riemannian sums converge to the function to be reconstructed as the sampling density tends to infinity.We also study the convergence of the operators introduced by the Riemannian sums.Our result improves some known ones. 相似文献
82.
L-双拓扑空间中的配超紧性 总被引:1,自引:0,他引:1
借助相关远域族给出L-双拓扑空间中配超紧性的定义,研究它们的等价刻画和基本性质,证明配超紧性是弱拓扑不变性. 相似文献
83.
Jonathan Spreer 《Discrete Mathematics》2011,(14):1295
We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. Focus is given to the case of dimension 3, where slicings are (discrete) normal surfaces. For the cases of 2-neighborly 3-manifolds as well as quadrangulated slicings, lower bounds on the number of quadrilaterals of slicings depending on its genus g are presented. These are shown to be sharp for infinitely many values of g. Furthermore, we classify slicings of combinatorial 3-manifolds which are weakly neighborly polyhedral maps. 相似文献
84.
Bijaya Laxmi Panigrahi Gnaneshwar Nelakanti 《Journal of Computational and Applied Mathematics》2011,235(8):2380-2391
In this paper, we consider the Galerkin and collocation methods for the eigenvalue problem of a compact integral operator with a smooth kernel using the Legendre polynomials of degree ≤n. We prove that the error bounds for eigenvalues are of the order O(n−2r) and the gap between the spectral subspaces are of the orders O(n−r) in L2-norm and O(n1/2−r) in the infinity norm, where r denotes the smoothness of the kernel. By iterating the eigenvectors we show that the iterated eigenvectors converge with the orders of convergence O(n−2r) in both L2-norm and infinity norm. We illustrate our results with numerical examples. 相似文献
85.
We obtain the expressions for sectional curvature, holomorphic sectional curvature and holomorphic bisectional curvature of a GCR-lightlike submanifold of an indefinite nearly K ¨ahler manifold and obtain characterization theorems for holo-morphic sectional and holomorphic bisectional curvature. We also establish a condi-tion for a GCR-lightlike submanifold of an indefinite complex space form to be a null holomorphically flat. 相似文献
86.
We deal with complete hypersurfaces immersed in a semi-Riemannian warped product of the type eI×f M~n,where M~n is a connected n-dimensional oriented Riemannian manifold.When the fiber M~n is complete with sectional curvature-k≤K_M for some positive constant k,under appropriate restrictions on the norm of the gradient of the height function h,we proceed with our technique in order to guarantee that complete hypersurface immersed in a semi-Riemannian warped product is a slice.Our approach is based on the well known generalized maximum principle and another suitable maximum principle at the infinity due to Yau. 相似文献
87.
88.
给出强Z-连续domain和Z-代数domain的一个刻画及一个范畴性质--余反射性质. 相似文献
89.
90.
Vivekananda Roy 《Statistics & probability letters》2012,82(1):103-108
The sandwich algorithm (SA) is an alternative to the data augmentation (DA) algorithm that uses an extra simulation step at each iteration. In this paper, we show that the sandwich algorithm always converges at least as fast as the DA algorithm, in the Markov operator norm sense. We also establish conditions under which the spectrum of SA dominates that of DA. An example illustrates the results. 相似文献