全文获取类型
收费全文 | 34842篇 |
免费 | 1269篇 |
国内免费 | 265篇 |
专业分类
化学 | 24666篇 |
晶体学 | 280篇 |
力学 | 684篇 |
综合类 | 1篇 |
数学 | 5960篇 |
物理学 | 4785篇 |
出版年
2023年 | 167篇 |
2022年 | 324篇 |
2021年 | 431篇 |
2020年 | 611篇 |
2019年 | 599篇 |
2018年 | 417篇 |
2017年 | 389篇 |
2016年 | 943篇 |
2015年 | 832篇 |
2014年 | 1005篇 |
2013年 | 1707篇 |
2012年 | 2180篇 |
2011年 | 2463篇 |
2010年 | 1329篇 |
2009年 | 1181篇 |
2008年 | 2274篇 |
2007年 | 2093篇 |
2006年 | 2117篇 |
2005年 | 1968篇 |
2004年 | 1687篇 |
2003年 | 1380篇 |
2002年 | 1335篇 |
2001年 | 486篇 |
2000年 | 469篇 |
1999年 | 408篇 |
1998年 | 397篇 |
1997年 | 418篇 |
1996年 | 449篇 |
1995年 | 314篇 |
1994年 | 368篇 |
1993年 | 335篇 |
1992年 | 303篇 |
1991年 | 278篇 |
1990年 | 244篇 |
1989年 | 210篇 |
1988年 | 210篇 |
1987年 | 221篇 |
1986年 | 180篇 |
1985年 | 377篇 |
1984年 | 331篇 |
1983年 | 280篇 |
1982年 | 342篇 |
1981年 | 277篇 |
1980年 | 288篇 |
1979年 | 240篇 |
1978年 | 227篇 |
1977年 | 217篇 |
1976年 | 208篇 |
1975年 | 186篇 |
1974年 | 160篇 |
排序方式: 共有10000条查询结果,搜索用时 218 毫秒
101.
102.
The change of the superstructure of different polyethylenes during uniaxial deformation is investigated. The method used is small-angle scattering with synchrotron radiation. For branched polyethylene (Lupolen 1840D) the whole deformation range is analyzed. Beginning with superstructure of the lamellar cluster type, the superstructure partly disappears on a time scale of a few minutes and the fibrillar structure is built up. The degree of destruction and rebuilding depends on the drawing temperature. For very high molecular weight polyethylene (GUR) a reversible change of the superstructure at higher deformation ratios and at different temperatures is observed. The superstructure of (ethylene—hexene) copolymers (TIPELIN) at high draw ratios depends on the drawing temperature and is almost independent of the side group content. Interfibrillar microcracks parallel to the draw direction are produced in samples with a low side group content for draw ratios λ ≥ 1.5. 相似文献
103.
The many facets of linear programming 总被引:1,自引:0,他引:1
Michael J. Todd 《Mathematical Programming》2002,91(3):417-436
We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex,
ellipsoid, interior-point, and other methods.
Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001 相似文献
104.
105.
106.
Michael S. Roddy 《Order》1994,11(1):1-9
Theretracts (idempotent, isotone self-maps) of an ordered set are naturally ordered as functions. In this note we characterize the possible ways that one retract can cover another one. This gives some insight into the structure of the ordered set of retracts and leads to a natural generalization of the core of an ordered set.Supported by NSERC Operating Grant 41702. 相似文献
107.
LetK be a compact Hausdorff space, and letT be an irreducible Markov operator onC(K). We show that ifgεC(K) satisfies sup
N
‖Σ
j
=0N
T
j
g‖<∞, then (and only then) there existsfεC(K) with (I − T)f=g. Generalizing the result to irreducible Markov operator representations of certain semi-groups, we obtain that bounded cocycles
are (continuous) coboundaries. For minimal semi-group actions inC(K), no restriction on the semi-group is needed. 相似文献
108.
109.
110.
In previous work the authors consider the dynamic assignment problem, which involves solving sequences of assignment problems over time in the presence of uncertain information about the future. The algorithm proposed by the authors provides generally high-quality but non-optimal solutions. In this work, though, the authors prove that if the optimal solution to a dynamic assignment problem in one of two problem classes is unique, then the optimal solution is a fixed point under the algorithm. 相似文献