全文获取类型
收费全文 | 6179篇 |
免费 | 431篇 |
国内免费 | 490篇 |
专业分类
化学 | 115篇 |
力学 | 268篇 |
综合类 | 155篇 |
数学 | 6370篇 |
物理学 | 192篇 |
出版年
2024年 | 5篇 |
2023年 | 56篇 |
2022年 | 57篇 |
2021年 | 94篇 |
2020年 | 135篇 |
2019年 | 154篇 |
2018年 | 149篇 |
2017年 | 172篇 |
2016年 | 175篇 |
2015年 | 112篇 |
2014年 | 244篇 |
2013年 | 482篇 |
2012年 | 281篇 |
2011年 | 320篇 |
2010年 | 264篇 |
2009年 | 381篇 |
2008年 | 346篇 |
2007年 | 384篇 |
2006年 | 327篇 |
2005年 | 289篇 |
2004年 | 248篇 |
2003年 | 235篇 |
2002年 | 258篇 |
2001年 | 251篇 |
2000年 | 245篇 |
1999年 | 207篇 |
1998年 | 191篇 |
1997年 | 182篇 |
1996年 | 135篇 |
1995年 | 108篇 |
1994年 | 88篇 |
1993年 | 69篇 |
1992年 | 49篇 |
1991年 | 48篇 |
1990年 | 51篇 |
1989年 | 26篇 |
1988年 | 20篇 |
1987年 | 24篇 |
1986年 | 23篇 |
1985年 | 29篇 |
1984年 | 27篇 |
1983年 | 15篇 |
1982年 | 30篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 18篇 |
1978年 | 20篇 |
1977年 | 14篇 |
1976年 | 11篇 |
1974年 | 3篇 |
排序方式: 共有7100条查询结果,搜索用时 15 毫秒
991.
Justin Salez 《Random Structures and Algorithms》2013,43(3):377-397
Using the theory of negative association for measures and the notion of unimodularity for random weak limits of sparse graphs, we establish the validity of the cavity method for counting spanning subgraphs subject to local constraints in asymptotically tree‐like graphs. Specifically, the normalized logarithm of the associated partition function (free energy) is shown to converge along any sequence of graphs whose random weak limit is a tree, and the limit is directly expressed in terms of the unique solution to a limiting cavity equation. On a Galton–Watson tree, the latter simplifies into a recursive distributional equation which can be solved explicitly. As an illustration, we provide a new asymptotic formula for the maximum size of a b‐matching in the Erd?s–Rényi random graph with fixed average degree and diverging size, for any $b\in\mathbb{N}Using the theory of negative association for measures and the notion of unimodularity for random weak limits of sparse graphs, we establish the validity of the cavity method for counting spanning subgraphs subject to local constraints in asymptotically tree‐like graphs. Specifically, the normalized logarithm of the associated partition function (free energy) is shown to converge along any sequence of graphs whose random weak limit is a tree, and the limit is directly expressed in terms of the unique solution to a limiting cavity equation. On a Galton–Watson tree, the latter simplifies into a recursive distributional equation which can be solved explicitly. As an illustration, we provide a new asymptotic formula for the maximum size of a b‐matching in the Erd?s–Rényi random graph with fixed average degree and diverging size, for any $b\in\mathbb{N}$. To the best of our knowledge, this is the first time that correlation inequalities and unimodularity are combined together to yield a general proof of uniqueness of Gibbs measures on infinite trees. We believe that a similar argument is applicable to other Gibbs measures than those over spanning subgraphs considered here. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013 相似文献
992.
《Journal of computational and graphical statistics》2013,22(4):751-769
This article presents a new particle filter algorithm which uses random quasi-Monte-Carlo to propagate particles. The filter can be used generally, but here it is shown that for one-dimensional state-space models, if the number of particles is N, then the rate of convergence of this algorithm is N?1. This compares favorably with the N?1/2 convergence rate of standard particle filters. The computational complexity of the new filter is quadratic in the number of particles, as opposed to the linear computational complexity of standard methods. I demonstrate the new filter on two important financial time series models, an ARCH model and a stochastic volatility model. Simulation studies show that for fixed CPU time, the new filter can be orders of magnitude more accurate than existing particle filters. The new filter is particularly efficient at estimating smooth functions of the states, where empirical rates of convergence are N?3/2; and for performing smoothing, where both the new and existing filters have the same computational complexity. 相似文献
993.
A.I. Aggour 《Journal of the Egyptian Mathematical Society》2013,21(3):330-333
In this paper, we study the fuzzy almost continuous convergence of fuzzy nets on the set FAC(X, Y) of all fuzzy almost continuous functions of a fuzzy topological space X into another Y. Also, we introduce the notions of fuzzy splitting and fuzzy jointly continuous topologies on the set FAC(X, Y) and study some of its basic properties. 相似文献
994.
Let I 2N be an ideal and let XI = span{χI : I ∈ I}, and let pI be the quotient norm of l∞/XI. In this paper, we show first that for each proper ideal I 2N, the ideal convergence deduced by I is equivalent to pI-kernel convergence. In addition, let K = {x*oχ(·) : x*∈ p(e)}, where p(x) = lim supn→∞1/n(∑k=1n|x(k)|, and let Iμ = {A N : μ(A) = 0} for all μ = x*oχ(·) ∈ K. Then Iμ is a proper ideal. We also show that the ideal convergence deduced by the proper ideal Iμ, the p-kernel convergence and the statistical convergence are also equivalent. 相似文献
995.
We derive conditions under which random sequences of polarizations (two-point symmetrizations) on Sd, Rd, or Hd converge almost surely to the symmetric decreasing rearrangement. The parameters for the polarizations are independent random variables whose distributions need not be uniform. The proof of convergence hinges on an estimate for the expected distance from the limit that yields a bound on the rate of convergence. In the special case of i.i.d. sequences, almost sure convergence holds even for polarizations chosen at random from suitable small sets. As corollaries, we find bounds on the rate of convergence of Steiner symmetrizations that require no convexity assumptions, and show that full rotational symmetry can be achieved by randomly alternating Steiner symmetrizations in a finite number of directions that satisfy an explicit non-degeneracy condition. We also present some negative results on the rate of convergence and give examples where convergence fails. 相似文献
996.
Let V be a star shaped region. In 2006, Colzani, Meaney and Prestini proved that if function f satisfies some condition, then the multiplier transform with the characteristic function of tV as the multiplier tends to f almost everywhere, when t goes to∞. In this paper we use a Theorem established by K.K.Chen to show that if we change their multiplier, then the condition on f can be weakened. 相似文献
997.
998.
研究了一类随机适应序列的强极限定理,推广了最近发表的几个结果,并进一步推广了Borel—Cantelli引理. 相似文献
999.
This paper deals with the convergence and stability properties of block boundary value methods (BBVMs) for the neutral pantograph equation. Due to its unbounded time lags and limited computer memory, a change in the independent variable is used to transform a pantograph equation into a non-autonomous differential equation with a constant delay but variable coefficients. It is shown under the classical Lipschitz condition that a BBVM is convergent of order p if the underlying boundary value method is consistent with order p. Furthermore, it is proved under a certain condition that BBVMs can preserve the asymptotic stability of exact solutions for the neutral pantograph equation. Meanwhile, some numerical experiments are given to confirm the main conclusions. 相似文献
1000.