全文获取类型
收费全文 | 3185篇 |
免费 | 102篇 |
国内免费 | 212篇 |
专业分类
化学 | 221篇 |
晶体学 | 1篇 |
力学 | 138篇 |
综合类 | 14篇 |
数学 | 2262篇 |
物理学 | 863篇 |
出版年
2024年 | 7篇 |
2023年 | 21篇 |
2022年 | 57篇 |
2021年 | 40篇 |
2020年 | 84篇 |
2019年 | 89篇 |
2018年 | 102篇 |
2017年 | 86篇 |
2016年 | 51篇 |
2015年 | 43篇 |
2014年 | 140篇 |
2013年 | 456篇 |
2012年 | 94篇 |
2011年 | 179篇 |
2010年 | 132篇 |
2009年 | 208篇 |
2008年 | 238篇 |
2007年 | 214篇 |
2006年 | 141篇 |
2005年 | 112篇 |
2004年 | 100篇 |
2003年 | 112篇 |
2002年 | 81篇 |
2001年 | 60篇 |
2000年 | 68篇 |
1999年 | 53篇 |
1998年 | 73篇 |
1997年 | 58篇 |
1996年 | 51篇 |
1995年 | 39篇 |
1994年 | 29篇 |
1993年 | 28篇 |
1992年 | 30篇 |
1991年 | 22篇 |
1990年 | 17篇 |
1989年 | 27篇 |
1988年 | 21篇 |
1987年 | 15篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1984年 | 20篇 |
1983年 | 9篇 |
1982年 | 12篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 9篇 |
1976年 | 8篇 |
1974年 | 3篇 |
排序方式: 共有3499条查询结果,搜索用时 406 毫秒
31.
The core of an ideal is the intersection of all its reductions. We describe the core of a zero-dimensional monomial ideal I as the largest monomial ideal contained in a general reduction of I. This provides a new interpretation of the core in the monomial case as well as an efficient algorithm for computing it. We relate the core to adjoints and first coefficient ideals, and in dimension two and three we give explicit formulas. 相似文献
32.
Let R be a local ring and let (x
1, …, x
r) be part of a system of parameters of a finitely generated R-module M, where r < dimR
M. We will show that if (y
1, …, y
r) is part of a reducing system of parameters of M with (y
1, …, y
r) M = (x
1, …, x
r) M then (x
1, …, x
r) is already reducing. Moreover, there is such a part of a reducing system of parameters of M iff for all primes P ε Supp M ∩ V
R(x
1, …, x
r) with dimR
R/P = dimR
M − r the localization M
P of M at P is an r-dimensional Cohen-Macaulay module over R
P.
Furthermore, we will show that M is a Cohen-Macaulay module iff y
d is a non zero divisor on M/(y
1, …, y
d−1) M, where (y
1, …, y
d) is a reducing system of parameters of M (d:= dimR
M). 相似文献
33.
Henrik Flyvbjerg 《Physica A》2004,340(4):552-558
The nature of self-organized criticality (SOC) is pin-pointed with a simple mechanical model: a pinball machine. Its phase space is fully parameterized by two integer variables, one describing the state of an on-going game, the other describing the state of the machine. This is the simplest possible SOC system, having only two degrees of freedom and no spatial correlations, yet is not solvable by analytical means. 相似文献
34.
Serguei Foss Takis Konstantopoulos Stan Zachary 《Journal of Theoretical Probability》2007,20(3):581-612
We consider a modulated process S which, conditional on a background process X, has independent increments. Assuming that S drifts to −∞ and that its increments (jumps) are heavy-tailed (in a sense made precise in the paper), we exhibit natural
conditions under which the asymptotics of the tail distribution of the overall maximum of S can be computed. We present results in discrete and in continuous time. In particular, in the absence of modulation, the
process S in continuous time reduces to a Lévy process with heavy-tailed Lévy measure. A central point of the paper is that we make
full use of the so-called “principle of a single big jump” in order to obtain both upper and lower bounds. Thus, the proofs
are entirely probabilistic. The paper is motivated by queueing and Lévy stochastic networks. 相似文献
35.
本文第一部分主要把扭曲的方法运用到模上,从而得到扭曲模.作为特例,我们构造了H M的Smaush模和量子模.当K是有限维Hopf代数,证明K* M是一个右D(K)-Hopf模,因此得到了一个基本同构定理.第二部分主要把斜余配对双代数进行推广,得到了斜余配对Hopf模,并且给出判断斜余配对Hopf模的一个充要条件. 相似文献
36.
Feng Dejun 《分析论及其应用》2003,19(4)
1 IntroductionForany 0 <λ <1 ,letνλ denotethedistributionof ∞n=0 εnλn wherethecoefficientsεnareeither0or1 ,chosenindependentlywithprobability12 foreach .Itistheinfiniteconvo lutionproductofthedistributions 12 (δ0 +δλn) ,givingrisetotheterm“infiniteBernoulliconvolution”orsimply“Bernoulliconvolution” .TheBernoulliconvolutioncanbeexpressedasaself similarmeasureνλsatisfyingtheequationνλ =12 νλ φ- 10 + 12 νλ φ- 11,( 1 .1 )whereφ0 (x) =λxand φ1(x) =λx + 1 .Thisme… 相似文献
37.
VECTOR-VALUED RANDOM POWER SERIES ON THE UNIT BALL OF C^n 总被引:1,自引:0,他引:1
In this article, the authors study the vector-valued random power series on the unit ball of Cn and get vector-valued Salem-Zygmund theorem for them by using martingale technique. Further, the relationships between vector-valued random power series and several function spaces are also studied. 相似文献
38.
We present some asymptotic results for the family of pausing time densities having the asymptotic (t) property(t) [t ln1+(t/T)]–1. In particular, we show that for this class of pausing time densities the mean-squared displacement r
2(t) is asymptotically proportional to ln(t/T), and the asymptotic distribution of the displacement has a negative exponential form. 相似文献
39.
A simple and quite general approach is proposed to derive criteria for transience and ergodicity of a certain class of irreducibleN-dimensional Markov chains in
+
N
assuming a boundedness condition on the second moment of the jumps. The method consists in constructing convenient smooth supermartingales outside some compact set. The Lyapounov functions introduced belong to the set of quadratic forms in
+
N
and do not always have a definite sign. Existence and construction of these forms is shown to be basically equivalent to finding vectors satisfying a system of linear inequalities.Part I is restricted toN=2, in which case a complete characterization is obtained for the type of random walks analyzed by Malyshev and Mensikov, thus relaxing their condition of boundedness of the jumps. The motivation for this work is partly from a large class of queueing systems that give rise to random walks in
+
N
相似文献
40.
Jeff D. Kahn Nathan Linial Noam Nisan Michael E. Saks 《Journal of Theoretical Probability》1989,2(1):121-128
This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound ofO(n
2) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of (n logn) for the expected cover time for trees. We present examples showing all our bounds to be tight.Mike Saks was supported by NSF-DMS87-03541 and by AFOSR-0271. Jeff Kahn was supported by MCS-83-01867 and by AFOSR-0271. 相似文献