全文获取类型
收费全文 | 5852篇 |
免费 | 139篇 |
国内免费 | 34篇 |
专业分类
化学 | 4066篇 |
晶体学 | 88篇 |
力学 | 134篇 |
数学 | 985篇 |
物理学 | 752篇 |
出版年
2022年 | 36篇 |
2021年 | 42篇 |
2020年 | 41篇 |
2019年 | 62篇 |
2018年 | 58篇 |
2017年 | 47篇 |
2016年 | 113篇 |
2015年 | 113篇 |
2014年 | 113篇 |
2013年 | 314篇 |
2012年 | 262篇 |
2011年 | 320篇 |
2010年 | 148篇 |
2009年 | 145篇 |
2008年 | 287篇 |
2007年 | 313篇 |
2006年 | 264篇 |
2005年 | 301篇 |
2004年 | 250篇 |
2003年 | 281篇 |
2002年 | 235篇 |
2001年 | 109篇 |
2000年 | 88篇 |
1999年 | 84篇 |
1998年 | 63篇 |
1997年 | 86篇 |
1996年 | 94篇 |
1995年 | 93篇 |
1994年 | 84篇 |
1993年 | 64篇 |
1992年 | 54篇 |
1991年 | 61篇 |
1990年 | 49篇 |
1989年 | 63篇 |
1988年 | 73篇 |
1987年 | 56篇 |
1986年 | 53篇 |
1985年 | 78篇 |
1984年 | 99篇 |
1983年 | 67篇 |
1982年 | 94篇 |
1981年 | 95篇 |
1980年 | 91篇 |
1979年 | 74篇 |
1978年 | 79篇 |
1977年 | 72篇 |
1976年 | 67篇 |
1975年 | 59篇 |
1974年 | 49篇 |
1973年 | 37篇 |
排序方式: 共有6025条查询结果,搜索用时 15 毫秒
21.
22.
Alan L. Andrew 《BIT Numerical Mathematics》2003,43(3):485-503
The asymptotic correction technique of Paine, de Hoog and Anderssen can dramatically improve the accuracy of finite difference or finite element eigenvalues at negligible extra cost if closed form expressions are available for the errors in a simpler related problem. This paper gives closed form expressions for the errors in the eigenvalues of certain Sturm–Liouville problems obtained by various methods, thereby increasing the range of problems for which asymptotic correction can achieve maximum efficiency. It also investigates implementation of the method for more general problems. 相似文献
23.
The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s1,…,sk,t1,…,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
24.
Thin films of polystyrene (PS), poly(methyl methacrylate) (PMMA) and polystyrene-polyacrylonitrile copolymer (PS-AN), containing various embedded transition-metal complexes, have been studied by FTIR microscopy. The spatial distributions of the transition-metal carbonyl complexes throughout the thin organic polymer films have been determined by a two-dimensional IR mapping procedure. The spectral variations observed in the distribution of the metal carbonyls throughout the different polymer films are discussed. The IR data show that the technique used to prepare the organometallic-embedded thin films (viz. freeze-drying of solutions followed by hot mechanical pressing of the residues) does in general lead to homogeneous films which may eventually find industrial application, e.g. as membrane sensors for small molecules. 相似文献
25.
26.
27.
28.
29.
30.