全文获取类型
收费全文 | 1612篇 |
免费 | 68篇 |
国内免费 | 143篇 |
专业分类
化学 | 245篇 |
晶体学 | 2篇 |
力学 | 11篇 |
综合类 | 23篇 |
数学 | 1287篇 |
物理学 | 255篇 |
出版年
2024年 | 1篇 |
2023年 | 12篇 |
2022年 | 31篇 |
2021年 | 20篇 |
2020年 | 47篇 |
2019年 | 37篇 |
2018年 | 36篇 |
2017年 | 33篇 |
2016年 | 42篇 |
2015年 | 20篇 |
2014年 | 66篇 |
2013年 | 155篇 |
2012年 | 52篇 |
2011年 | 87篇 |
2010年 | 71篇 |
2009年 | 129篇 |
2008年 | 120篇 |
2007年 | 125篇 |
2006年 | 94篇 |
2005年 | 77篇 |
2004年 | 66篇 |
2003年 | 59篇 |
2002年 | 68篇 |
2001年 | 53篇 |
2000年 | 50篇 |
1999年 | 53篇 |
1998年 | 43篇 |
1997年 | 26篇 |
1996年 | 21篇 |
1995年 | 15篇 |
1994年 | 14篇 |
1993年 | 15篇 |
1992年 | 18篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 5篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1985年 | 3篇 |
1984年 | 8篇 |
1983年 | 5篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1977年 | 3篇 |
1970年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有1823条查询结果,搜索用时 218 毫秒
1.
2.
3.
4.
A graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connected graph of order n such that each minimal edge cut SE(G) with |S|3 satisfies the property that each component of G−S has order at least (n−2)/5. We prove that either G is supereulerian or G belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore, our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree δ4: If G is a 2-edge-connected graph of order n with δ(G)4 such that for every edge xyE(G) , we have max{d(x),d(y)}(n−2)/5−1, then either G is supereulerian or G belongs to one of two classes of exceptional graphs. We show that the condition δ(G)4 cannot be relaxed. 相似文献
5.
6.
姜德元 《浙江大学学报(理学版)》2003,30(5):499-502
研究了NA序列重对数律收敛速度的一般形式,把Davis和Gut的结果推广到了NA的情形,并使梁汉营等人关于对数律一个结果成为特例;作为推论,得到了关于NA序列重对数律收敛速度的充分条件. 相似文献
7.
Mihran Papikian 《Transactions of the American Mathematical Society》2007,359(7):3483-3503
Under a certain assumption, similar to Manin's conjecture, we prove an upper bound on the degree of modular parametrizations of elliptic curves by Drinfeld modular curves, which is the function field analogue of the conjectured bound over the rational numbers.
8.
The lattice profile analyzes the intrinsic structure of pseudorandom number sequences with applications in Monte Carlo methods and cryptology. In this paper, using the discrete Fourier transform for periodic sequences and the relation between the lattice profile and the linear complexity, we give general formulas for the expected value, variance, and counting function of the lattice profile of periodic sequences with fixed period. Moreover, we determine in a more explicit form the expected value, variance, and counting function of the lattice profile of periodic sequences for special values of the period. 相似文献
9.
Two Convergence Problems for Monotone Sequences 总被引:1,自引:0,他引:1
Eight measures of rate of convergence of monotone sequences of real numbers have been proposed and discussed in a paper by Beyer, Ebanks, and Qualls (Acta Appl. Math. 20 (1990), 267–284). These rates arose in discussions of dynamical systems. In the comparisons of these rates, two problems remained. A complete answer is given to one of the problems and a partial answer is given to the other problem. 相似文献
10.
Extensible lattice sequences have been proposed and studied in [F.J. Hickernell, H.S. Hong, Computing multivariate normal probabilities using rank-1 lattice sequences, in: G.H. Golub, S.H. Lui, F.T. Luk, R.J. Plemmons (Eds.), Proceedings of the Workshop on Scientific Computing (Hong Kong), Singapore, Springer, Berlin, 1997, pp. 209–215; F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138; F.J. Hickernell, H.Niederreiter, The existence of good extensible rank-1 lattices, J. Complexity 19 (2003) 286–300]. For the special case of extensible Korobov sequences, parameters can be found in [F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C.Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138]. The searches made to obtain these parameters were based on quality measures that look at several projections of the lattice. Because it is often the case in practice that low-dimensional projections are very important, it is of interest to find parameters for these sequences based on measures that look more closely at these projections. In this paper, we prove the existence of “good” extensible Korobov rules with respect to a quality measure that considers two-dimensional projections. We also report results of experiments made on different problems where the newly obtained parameters compare favorably with those given in [F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138]. 相似文献