全文获取类型
收费全文 | 32641篇 |
免费 | 1086篇 |
国内免费 | 249篇 |
专业分类
化学 | 22672篇 |
晶体学 | 223篇 |
力学 | 768篇 |
数学 | 5420篇 |
物理学 | 4893篇 |
出版年
2022年 | 283篇 |
2021年 | 421篇 |
2020年 | 514篇 |
2019年 | 484篇 |
2018年 | 376篇 |
2017年 | 372篇 |
2016年 | 835篇 |
2015年 | 737篇 |
2014年 | 807篇 |
2013年 | 1725篇 |
2012年 | 1866篇 |
2011年 | 2352篇 |
2010年 | 1141篇 |
2009年 | 1004篇 |
2008年 | 2009篇 |
2007年 | 2020篇 |
2006年 | 1996篇 |
2005年 | 1862篇 |
2004年 | 1587篇 |
2003年 | 1382篇 |
2002年 | 1282篇 |
2001年 | 402篇 |
2000年 | 388篇 |
1999年 | 358篇 |
1998年 | 335篇 |
1997年 | 357篇 |
1996年 | 486篇 |
1995年 | 343篇 |
1994年 | 298篇 |
1993年 | 270篇 |
1992年 | 267篇 |
1991年 | 237篇 |
1990年 | 202篇 |
1989年 | 203篇 |
1988年 | 232篇 |
1987年 | 198篇 |
1986年 | 180篇 |
1985年 | 347篇 |
1984年 | 339篇 |
1983年 | 242篇 |
1982年 | 313篇 |
1981年 | 323篇 |
1980年 | 298篇 |
1979年 | 281篇 |
1978年 | 257篇 |
1977年 | 227篇 |
1976年 | 206篇 |
1975年 | 208篇 |
1974年 | 210篇 |
1973年 | 209篇 |
排序方式: 共有10000条查询结果,搜索用时 21 毫秒
51.
By optimizing pump power ratio between 1st order backward pump and 2nd order forward pump on discrete Raman amplifier, we demonstrated over 2dB noise figure improvement without excessive non-linearity degradation. 相似文献
52.
David E. Anderson 《Proceedings of the American Mathematical Society》2004,132(9):2517-2527
With an explicit example, we confirm a conjecture by Neumann and Wahl that there exist cusps with no Galois cover by a complete intersection. Some computational techniques are reviewed, and a method for deciding whether a given cusp has a complete intersection Galois cover is developed.
53.
William Evans David Kirkpatrick 《Journal of Algorithms in Cognition, Informatics and Logic》2004,50(2):168-193
We consider the problem of restructuring an ordered binary tree T, preserving the in-order sequence of its nodes, so as to reduce its height to some target value h. Such a restructuring necessarily involves the downward displacement of some of the nodes of T. Our results, focusing both on the maximum displacement over all nodes and on the maximum displacement over leaves only, provide (i) an explicit tradeoff between the worst-case displacement and the height restriction (including a family of trees that exhibit the worst-case displacements) and (ii) efficient algorithms to achieve height-restricted restructuring while minimizing the maximum node displacement. 相似文献
54.
David M. Evans 《组合设计杂志》2004,12(6):459-465
For all ‘reasonable’ finite t, k, and s, we construct a t‐(?0, k, 1) design and a group of automorphisms which is transitive on blocks and has s orbits on points. In particular, there is a 2‐(?0, 4, 1) design with a block‐transitive group of automorphisms having two point orbits. This answers a question of P. J. Cameron and C. E. Praeger. The construction is presented in a purely combinatorial way, but is a by‐product of a new way of looking at a model‐theoretic construction of E. Hrushovski. © 2004 Wiley Periodicals, Inc. 相似文献
55.
We exhibit timelike geodesic paths for a metric, introduced by Bonnor [11] and considered also by Steadman [13], and show that coordinate time runs backward along a portion of these geodesics. 相似文献
56.
One of the open questions in the geometry of line arrangements is to what extent does the incidence lattice of an arrangement determine its fundamental group. Line arrangements of up to 6 lines were recently classified by K.M. Fan (Michigan Math. J. 44(2) (1997) 283), and it turns out that the incidence lattice of such arrangements determines the projective fundamental group. We use actions on the set of wiring diagrams, introduced in (Garber et al. (J. Knot Theory Ramf.), to classify real arrangements of up to 8 lines. In particular, we show that the incidence lattice of such arrangements determines both the affine and the projective fundamental groups. 相似文献
57.
Suppose that attached to each site z ∈ ? is a coin with bias θ(z), and only finitely many of these coins have nonzero bias. Allow a simple random walker to generate observations by tossing, at each move, the coin attached to its current position. Then we can determine the biases {θ(z)}z∈?, using only the outcomes of these coin tosses and no information about the path of the random walker, up to a shift and reflection of ?. This generalizes a result of Harris and Keane. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
58.
Alvaro P. Raposo Hans J. Weber David E. Alvarez-Castillo Mariana Kirchbach 《Central European Journal of Physics》2007,5(3):253-284
We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are
the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality properties.
We then focus on the family of polynomials which exhibits a finite orthogonality. This family, to be referred to as the Romanovski
polynomials, is required in exact solutions of several physics problems ranging from quantum mechanics and quark physics to
random matrix theory. It appears timely to draw attention to it by the present study. Our survey also includes several new
observations on the orthogonality properties of the Romanovski polynomials and new developments from their Rodrigues formula. 相似文献
59.