全文获取类型
收费全文 | 39713篇 |
免费 | 1338篇 |
国内免费 | 1372篇 |
专业分类
化学 | 10072篇 |
晶体学 | 212篇 |
力学 | 574篇 |
综合类 | 70篇 |
数学 | 26990篇 |
物理学 | 4505篇 |
出版年
2023年 | 386篇 |
2022年 | 257篇 |
2021年 | 320篇 |
2020年 | 509篇 |
2019年 | 950篇 |
2018年 | 931篇 |
2017年 | 617篇 |
2016年 | 653篇 |
2015年 | 716篇 |
2014年 | 1162篇 |
2013年 | 2393篇 |
2012年 | 1361篇 |
2011年 | 2553篇 |
2010年 | 2011篇 |
2009年 | 2707篇 |
2008年 | 3032篇 |
2007年 | 2906篇 |
2006年 | 2187篇 |
2005年 | 1590篇 |
2004年 | 1436篇 |
2003年 | 1268篇 |
2002年 | 1382篇 |
2001年 | 825篇 |
2000年 | 798篇 |
1999年 | 912篇 |
1998年 | 788篇 |
1997年 | 617篇 |
1996年 | 765篇 |
1995年 | 736篇 |
1994年 | 698篇 |
1993年 | 568篇 |
1992年 | 491篇 |
1991年 | 355篇 |
1990年 | 320篇 |
1989年 | 344篇 |
1988年 | 243篇 |
1987年 | 268篇 |
1986年 | 232篇 |
1985年 | 324篇 |
1984年 | 261篇 |
1983年 | 169篇 |
1982年 | 256篇 |
1981年 | 239篇 |
1980年 | 177篇 |
1979年 | 137篇 |
1978年 | 160篇 |
1977年 | 140篇 |
1976年 | 110篇 |
1975年 | 32篇 |
1974年 | 32篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
121.
122.
The purpose of this paper is to give the Reid ``Roundabout Theorem' for quadratic functionals with general boundary conditions.
In particular, we describe the so-called coupled point and regularity condition introduced in [16] in terms of Riccati equation
solutions.
Accepted 27 February 1996 相似文献
123.
124.
125.
126.
Summary. We present a simple proof, based on modified logarithmic Sobolev inequalities, of Talagrand’s concentration inequality for
the exponential distribution. We actually observe that every measure satisfying a Poincaré inequality shares the same concentration
phenomenon. We also discuss exponential integrability under Poincaré inequalities and its consequence to sharp diameter upper
bounds on spectral gaps.
Received: 10 June 1996 / In revised form: 9 August 1996 相似文献
127.
S. A. Denisov 《Integral Equations and Operator Theory》2002,42(2):166-173
We consider the Krein systems. For the set of Stummel class coefficients, we establish the criterion in terms of these coefficients for the system to satisfy the Szegö-type estimate on the spectral measure. 相似文献
128.
Oleg Borodin 《Combinatorica》1993,13(1):121-125
The weight of an edge in a graph is the sum of the degrees of its end-vertices. It is proved that in each 3-polytope there exists either an edge of weight at most 13 for which both incident faces are triangles, or an edge of weight at most 10 which is incident with a triangle, or else an edge of weight at most 8. All the bounds 13, 10, and 8 are sharp and attained independently of each other. 相似文献
129.
A self-avoiding polygon (SAP) on a graph is an elementary cycle. Counting SAPs on the hypercubic lattice ℤ
d
withd≥2, is a well-known unsolved problem, which is studied both for its combinatorial and probabilistic interest and its connections
with statistical mechanics. Of course, polygons on ℤ
d
are defined up to a translation, and the relevant statistic is their perimeter.
A SAP on ℤ
d
is said to beconvex if its perimeter is “minimal”, that is, is exactly twice the sum of the side lengths of the smallest hyper-rectangle containing
it. In 1984, Delest and Viennot enumerated convex SAPs on the square lattice [6], but no result was available in a higher
dimension.
We present an elementar approach to enumerate convex SAPs in any dimension. We first obtain a new proof of Delest and Viennot's
result, which explains combinatorially the form of the generating function. We then compute the generating function for convex
SAPs on the cubic lattice. In a dimension larger than 3, the details of the calculations become very cumbersome. However,
our method suggests that the generating function for convex SAPs on ℤ
d
is always a quotient ofdifferentiably finite power series. 相似文献
130.