全文获取类型
收费全文 | 20204篇 |
免费 | 1918篇 |
国内免费 | 849篇 |
专业分类
化学 | 14681篇 |
晶体学 | 144篇 |
力学 | 661篇 |
综合类 | 47篇 |
数学 | 2495篇 |
物理学 | 4943篇 |
出版年
2024年 | 37篇 |
2023年 | 264篇 |
2022年 | 354篇 |
2021年 | 410篇 |
2020年 | 498篇 |
2019年 | 513篇 |
2018年 | 397篇 |
2017年 | 382篇 |
2016年 | 784篇 |
2015年 | 818篇 |
2014年 | 923篇 |
2013年 | 1489篇 |
2012年 | 1730篇 |
2011年 | 1629篇 |
2010年 | 1047篇 |
2009年 | 886篇 |
2008年 | 1365篇 |
2007年 | 1238篇 |
2006年 | 1242篇 |
2005年 | 1082篇 |
2004年 | 905篇 |
2003年 | 738篇 |
2002年 | 659篇 |
2001年 | 370篇 |
2000年 | 309篇 |
1999年 | 245篇 |
1998年 | 208篇 |
1997年 | 223篇 |
1996年 | 249篇 |
1995年 | 175篇 |
1994年 | 168篇 |
1993年 | 166篇 |
1992年 | 117篇 |
1991年 | 99篇 |
1990年 | 102篇 |
1989年 | 76篇 |
1988年 | 65篇 |
1987年 | 55篇 |
1986年 | 85篇 |
1985年 | 103篇 |
1984年 | 77篇 |
1983年 | 48篇 |
1982年 | 61篇 |
1981年 | 63篇 |
1980年 | 64篇 |
1979年 | 49篇 |
1978年 | 53篇 |
1977年 | 39篇 |
1976年 | 51篇 |
1975年 | 29篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
72.
André Draux 《Numerical Algorithms》1996,11(1):143-158
From some results concerning the formal orthogonal polynomials, already proved in [5], we develop new properties of generalized adjacent polynomials which correspond to a change in the weight function. A new structure of the singular blocks is given. These results have a direct application to Lanczos methods, theG and -algorithms. 相似文献
73.
74.
75.
76.
77.
Ingo Althöfer Gautam Das David Dobkin Deborah Joseph José Soares 《Discrete and Computational Geometry》1993,9(1):81-100
Given a graphG, a subgraphG' is at-spanner ofG if, for everyu,v V, the distance fromu tov inG' is at mostt times longer than the distance inG. In this paper we give a simple algorithm for constructing sparse spanners for arbitrary weighted graphs. We then apply this algorithm to obtain specific results for planar graphs and Euclidean graphs. We discuss the optimality of our results and present several nearly matching lower bounds.The work of G. Das and D. Joseph was supported by NSF PYI Grant DCR-8402375. The work of D. Dobkin was supported by NSF Grant CCR-8700917. The work of J. Soares was supported by CNPq proc 203039/87.4 (Brazil) and NSF Grant CCR-9014562. This research was accomplished while G. Das was a student at the University of Wisconsin-Madison. A preliminary version was presented at the Second Scandinavian Workshop on Algorithm Theory, Bergen, Norway, 1990, under the title Generating Sparse Spanners for Weighted Graphs, and proceedings appear in the series Lecture Notes in Computer Science, Springer-Verlag. The preliminary version also appears as Princeton University Technical Report CS-TR-261-90, and as University of Wisconsin-Madison Computer Sciences Technical Report 882. 相似文献
78.
José M. Figueroa-O'Farrill Javier Mas Eduardo Ramos 《Communications in Mathematical Physics》1993,158(1):17-43
The KP hierarchy is hamiltonian relative to a one-parameter family of Poisson structures obtained from a generalized Adler map in the space of formal pseudodifferential symbols with noninteger powers. The resulting W-algebra is a one-parameter deformation of WKP admitting a central extension for generic values of the parameter, reducing naturally to W
n
for special values of the parameter, and contracting to the centrally extended W1+, W and further truncations. In the classical limit, all algebras in the one-parameter family are equivalent and isomorphic tow
KP. The reduction induced by setting the spin-one field to zero yields a one-parameter deformation of
which contracts to a new nonlinear algebra of the W-type.Address after October 1993: Queen Mary and Westfield College, UK 相似文献
79.
80.