全文获取类型
收费全文 | 52646篇 |
免费 | 1661篇 |
国内免费 | 29篇 |
专业分类
化学 | 32089篇 |
晶体学 | 366篇 |
力学 | 855篇 |
综合类 | 1篇 |
数学 | 9939篇 |
物理学 | 11086篇 |
出版年
2023年 | 350篇 |
2022年 | 325篇 |
2021年 | 528篇 |
2020年 | 757篇 |
2019年 | 708篇 |
2018年 | 1054篇 |
2017年 | 964篇 |
2016年 | 1799篇 |
2015年 | 1547篇 |
2014年 | 1524篇 |
2013年 | 3344篇 |
2012年 | 3128篇 |
2011年 | 2999篇 |
2010年 | 2036篇 |
2009年 | 1723篇 |
2008年 | 2653篇 |
2007年 | 2390篇 |
2006年 | 2167篇 |
2005年 | 2168篇 |
2004年 | 1883篇 |
2003年 | 1552篇 |
2002年 | 1360篇 |
2001年 | 1044篇 |
2000年 | 1044篇 |
1999年 | 749篇 |
1998年 | 594篇 |
1997年 | 505篇 |
1996年 | 674篇 |
1995年 | 493篇 |
1994年 | 564篇 |
1993年 | 534篇 |
1992年 | 540篇 |
1991年 | 463篇 |
1990年 | 497篇 |
1989年 | 415篇 |
1988年 | 417篇 |
1987年 | 386篇 |
1986年 | 364篇 |
1985年 | 518篇 |
1984年 | 501篇 |
1983年 | 389篇 |
1982年 | 387篇 |
1981年 | 400篇 |
1980年 | 345篇 |
1979年 | 324篇 |
1978年 | 331篇 |
1977年 | 331篇 |
1976年 | 334篇 |
1975年 | 302篇 |
1974年 | 304篇 |
排序方式: 共有10000条查询结果,搜索用时 379 毫秒
961.
Seymour (1981) proved that the cut criterion is necessary and sufficient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, Middendorf and Pfeiffer (1993) proved the problem to be NP-complete. For this case, Korach and Penn (1992) proved that the cut criterion is sufficient for the existence of a near-complete packing of paths. Here we generalize this result by showing how a natural strengthening of the cut criterion yields better packings of paths.Analogously to Seymour's approach, we actually prove a theorem on packing cuts in an arbitrary graph and then the planar edge-disjoint paths case is obtained by planar dualization. The main result is derived from a theorem of Seb (1990) on the structure of ±1 weightings of a bipartite graph with no negative circuits.Research partially supported by the Hungarian National Foundation for Scientific Research Grants OTKA 2118 and 4271. 相似文献
962.
Federico Sánchez-Bringas Ana Irene Ramírez-Galarza 《Annals of Global Analysis and Geometry》1995,13(2):129-140
LetM be a compact orientable surface,I:M R4 an immersion of classC
r
and
a normal unitary smooth vector field. We prove that in the space of pairs (I,
) the family of pairs all whose umbilical points are Darbouxian is generic. 相似文献
963.
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. 相似文献
964.
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. 相似文献
965.
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. 相似文献
966.
967.
968.
Josef Tkadlec 《International Journal of Theoretical Physics》1995,34(8):1767-1774
We give various definitions of subadditivity of states on quantum logics and present several results stating when a quantum logic with sufficiently enough properly subadditive states has to be (almost) a Boolean algebra. 相似文献
969.
I. Muzyčenková V. Kellnerová M. Koneracká P. Kopčanský M. Antalík J. Ďurišin 《Czechoslovak Journal of Physics》1995,45(9):727-734
The encapsulation of fine magnetite particles of 10 nm size and marker ANS within asolectin vesicles has been made by sonication of the mixture in water. For the proof of encapsulation of magnetite in vesicles the electron microscope and spectrofluoriphotometer technique were used. The theory for the calculation of the magnetic force acting on the system consisted of non-capsulated magnetic particles dispersed in water and magnetic vesicles was developed.This work was supported by the Slovak Academy of Sciences within the framework of Project GAV No. 1361. 相似文献
970.
In this paper large-scale properties of developed magnetohydrodynamic turbulence have been investigated by using double expansion method in the frame of quantum field renormalization group. It has been shown that universal kinetic scaling regime exists, but the double expansion in general leads to qualitatively different results than those provided by the usual -expansion treatment.This work was supported by Slovak Grant Agency for Science. 相似文献