全文获取类型
收费全文 | 94537篇 |
免费 | 2550篇 |
国内免费 | 145篇 |
专业分类
化学 | 55862篇 |
晶体学 | 467篇 |
力学 | 1779篇 |
综合类 | 3篇 |
数学 | 17026篇 |
物理学 | 22095篇 |
出版年
2022年 | 697篇 |
2021年 | 1030篇 |
2020年 | 1316篇 |
2019年 | 1137篇 |
2018年 | 1848篇 |
2017年 | 1569篇 |
2016年 | 2897篇 |
2015年 | 2405篇 |
2014年 | 2536篇 |
2013年 | 5450篇 |
2012年 | 4907篇 |
2011年 | 5172篇 |
2010年 | 3172篇 |
2009年 | 2735篇 |
2008年 | 4703篇 |
2007年 | 4503篇 |
2006年 | 4046篇 |
2005年 | 3842篇 |
2004年 | 3212篇 |
2003年 | 2727篇 |
2002年 | 2448篇 |
2001年 | 1923篇 |
2000年 | 1864篇 |
1999年 | 1326篇 |
1998年 | 1081篇 |
1997年 | 1025篇 |
1996年 | 1235篇 |
1995年 | 991篇 |
1994年 | 1104篇 |
1993年 | 1098篇 |
1992年 | 1019篇 |
1991年 | 831篇 |
1990年 | 896篇 |
1989年 | 762篇 |
1988年 | 749篇 |
1987年 | 689篇 |
1986年 | 663篇 |
1985年 | 980篇 |
1984年 | 940篇 |
1983年 | 793篇 |
1982年 | 837篇 |
1981年 | 843篇 |
1980年 | 731篇 |
1979年 | 679篇 |
1978年 | 730篇 |
1977年 | 687篇 |
1976年 | 672篇 |
1975年 | 599篇 |
1974年 | 587篇 |
1973年 | 602篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
981.
Jürg Rätz 《Results in Mathematics》1995,27(3-4):395-401
M.C. Zdun [17] asked whether a subset S of R2 such that R × S is homeomorphic to R2 must be homeomorphic to R, all these sets being endowed with the usual topologies. We show that the answer is affirmative. 相似文献
982.
The local optimality conditions to polynomial optimization problems are a set of polynomial equations (plus some inequality conditions). With the recent techniques of Gröbner bases one can find all solutions to such systems, and hence also find global optima. We give a short survey of these methods. We also apply them to a set of problems termed with exact solutions unknown in the problem sets of Hock and Schittkowski. To these problems we give exact solutions. 相似文献
983.
In a recent paper we have solved several well-known combinatorial problems treating them as special cases of our generalization of Shannon's notion of graph capacity. We present a new simple formalism to deal with all such problems in a unified manner, considering graphs or families of graphs as special formulæ the variables of which are pairs of vertices of their common vertex sets. In all of these problems, the maximum size of a set ofn-length sequences from a fixed alphabet is to be determined under various restrictions on the element pairs present in the same coordinate of any two sequences from the set. For sufficiently homogeneous formulæ capacity becomes computable.New applications include generalizations of our result on the maximum number of pairwise qualitatively independentk-partitions of ann-set from independence to various forms of qualitative dependence.Work partially supported by the Italian Ministry of the University and Scientific Research, Project: Algoritmi, Modelli di Calcolo e Strutture Informative. 相似文献
984.
András Telcs 《Journal of Theoretical Probability》1995,8(1):77-96
This paper continues the study of exponentsd(x), d
(x), d
R
(x) andd
(x) for graphG; and the nearest neighbor random walk {X
n
}
nN
onG, if the starting pointX
0=x is fixed. These exponents are responsible for the geometric, resistance, diffusion and spectral properties of the graph. The main concern of this paper is the relation of these exponents to the spectral density of the transition matrix. A series of new exponentse, e
,e
R
,e
are introduced by allowingx to vary along the vertices. The results suggest that the geometric and resistance properties of the graph are responsible for the diffusion speed on the graph. 相似文献
985.
Tamás F. Móri 《Journal of Theoretical Probability》1995,8(1):139-164
Considering an infinite string of i.i.d. random letters drawn from a finite alphabet we define the cover timeW
n
as the number of random letters needed until each pattern of lenghtn appears at least once as a substring. Sharp weak and a.s. limit results onW
n
are known in the symmetric case, i.e., when the random letters are uniformly distributed over the alphabet. In this paper we determine the limit distribution ofW
n
in the nonsymmetric case asn. Generalizations in terms of point processes are also proved.Dedicated to Endre Csáki on his 60th birthday. 相似文献
986.
987.
988.
989.
990.