全文获取类型
收费全文 | 13620篇 |
免费 | 395篇 |
国内免费 | 343篇 |
专业分类
化学 | 1719篇 |
晶体学 | 44篇 |
力学 | 176篇 |
综合类 | 22篇 |
数学 | 11304篇 |
物理学 | 1093篇 |
出版年
2023年 | 25篇 |
2022年 | 40篇 |
2021年 | 35篇 |
2020年 | 66篇 |
2019年 | 332篇 |
2018年 | 386篇 |
2017年 | 208篇 |
2016年 | 149篇 |
2015年 | 175篇 |
2014年 | 399篇 |
2013年 | 842篇 |
2012年 | 427篇 |
2011年 | 802篇 |
2010年 | 738篇 |
2009年 | 1047篇 |
2008年 | 1013篇 |
2007年 | 1032篇 |
2006年 | 773篇 |
2005年 | 520篇 |
2004年 | 460篇 |
2003年 | 364篇 |
2002年 | 293篇 |
2001年 | 265篇 |
2000年 | 262篇 |
1999年 | 302篇 |
1998年 | 293篇 |
1997年 | 200篇 |
1996年 | 288篇 |
1995年 | 304篇 |
1994年 | 311篇 |
1993年 | 220篇 |
1992年 | 195篇 |
1991年 | 146篇 |
1990年 | 158篇 |
1989年 | 153篇 |
1988年 | 100篇 |
1987年 | 98篇 |
1986年 | 108篇 |
1985年 | 143篇 |
1984年 | 113篇 |
1983年 | 59篇 |
1982年 | 97篇 |
1981年 | 69篇 |
1980年 | 80篇 |
1979年 | 62篇 |
1978年 | 60篇 |
1977年 | 40篇 |
1976年 | 35篇 |
1975年 | 24篇 |
1974年 | 19篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
111.
Let X be a 1-connected CW-complex of finite type and ε?(X) be the group of homotopy classes of self-equivalences of X which induce the identity on homotopy groups. In this paper, we prove that every finitely generated 2-solvable rational nilpotent group is realizable as ε?(X) where X is the rationalization of a 1-connected CW-complex of finite type. 相似文献
112.
We prove both geometric ergodicity and regular variation of the stationary distribution for a class of nonlinear stochastic recursions that includes nonlinear AR-ARCH models of order 1. The Lyapounov exponent for the model, the index of regular variation and the spectral measure for the regular variation all are characterized by a simple two-state Markov chain. 相似文献
113.
In this paper one specifies the ergodic behavior of the 2D-stochastic Navier–Stokes equation by giving a Large Deviation Principle for the occupation measure for large time. It describes the exact rate of exponential convergence. The considered random force is non-degenerate and compatible with the strong Feller property. 相似文献
114.
We continue the studies on the so–called genuine Bernstein–Durrmeyer operators U
n
by establishing a recurrence formula for the moments and by investigating the semigroup T(t) approximated by U
n
. Moreover, for sufficiently smooth functions the degree of this convergence is estimated. We also determine the eigenstructure
of U
n
, compute the moments of T(t) and establish asymptotic formulas.
Received: January 26, 2007. 相似文献
115.
116.
D.P. Baturov 《Topology and its Applications》2007,154(2):374-383
Let M be a separable metric space consisting of more than one point. We construct perfectly normal dense subspaces Z⊂Mc2 and (under additional set-theoretic assumption) Y⊂Mc which are not collectionwise Hausdorff. 相似文献
117.
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2. 相似文献
118.
Hubert de Fraysseix 《Discrete Applied Mathematics》2007,155(9):1079-1095
Using a general resolution of barycentric systems we give a generalization of Tutte's theorem on convex drawing of planar graphs. We deduce a characterization of the edge coverings into pairwise non-crossing paths which are stretchable: such a system is stretchable if and only if each subsystem of at least two paths has at least three free vertices (vertices of the outer face of the induced subgraph which are internal to none of the paths of the subsystem). We also deduce that a contact system of pseudo-segments is stretchable if and only if it is extendible. 相似文献
119.
文章合成了N,N'-二正丁基苝四羧酸二酰亚胺,并纯化、调晶,进行了IR、元素分析、X射线等测定.分析该化合物在DMF中的紫外光谱(最大吸收波长524.80 nm)、荧光光谱(最大发射波长539.0 nm)、Stokes位移(数值15 nm)等光谱性质.在400~700 nm范围内,α晶型薄膜紫外-可见吸收出现很强的吸收峰,且由β型变为α型,最大吸收波长有明显的红移(545 nm变为580 nm).X射线粉末衍射也反映出α晶型的2θ在26.0°处衍射峰CPS为2 508,β型在25.2°为1 891.α,β晶型作为电荷产生材料制得的功能分离型有机光导体,在光源滤波波长λ=532 nm曝光下,测得含α,β感光体达到饱和电位的时间分别为46,93.98 s,光衰电位(5.3千伏电压负充电电晕,1~2 s后的表面电位)分别为727和525 V,半衰曝光量分别为4.32,4.34μJ·cm-2,残余电位分别为30和45 V等光导性能数值. 相似文献
120.
C. Praagman 《Aequationes Mathematicae》1987,33(1):251-259
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order in the group of automorphisms of a formal power series ring, and in algebraic subgroups too 相似文献