全文获取类型
收费全文 | 43947篇 |
免费 | 1810篇 |
国内免费 | 240篇 |
专业分类
化学 | 31030篇 |
晶体学 | 330篇 |
力学 | 906篇 |
数学 | 6132篇 |
物理学 | 7599篇 |
出版年
2023年 | 279篇 |
2022年 | 368篇 |
2021年 | 613篇 |
2020年 | 838篇 |
2019年 | 849篇 |
2018年 | 542篇 |
2017年 | 501篇 |
2016年 | 1308篇 |
2015年 | 1144篇 |
2014年 | 1342篇 |
2013年 | 2210篇 |
2012年 | 2663篇 |
2011年 | 2975篇 |
2010年 | 1737篇 |
2009年 | 1496篇 |
2008年 | 2495篇 |
2007年 | 2380篇 |
2006年 | 2296篇 |
2005年 | 2138篇 |
2004年 | 1868篇 |
2003年 | 1474篇 |
2002年 | 1472篇 |
2001年 | 739篇 |
2000年 | 651篇 |
1999年 | 628篇 |
1998年 | 593篇 |
1997年 | 563篇 |
1996年 | 613篇 |
1995年 | 534篇 |
1994年 | 533篇 |
1993年 | 506篇 |
1992年 | 450篇 |
1991年 | 359篇 |
1990年 | 391篇 |
1989年 | 356篇 |
1988年 | 339篇 |
1987年 | 296篇 |
1986年 | 274篇 |
1985年 | 435篇 |
1984年 | 416篇 |
1983年 | 309篇 |
1982年 | 351篇 |
1981年 | 341篇 |
1980年 | 314篇 |
1979年 | 303篇 |
1978年 | 350篇 |
1977年 | 295篇 |
1976年 | 237篇 |
1975年 | 248篇 |
1974年 | 247篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
22.
Daniel L. Feldheim Del R. Lawson Charles R. Martin 《Journal of Polymer Science.Polymer Physics》1993,31(8):953-957
We report a strong dependence of the thermal stability of Nafion® perfluorosulfonate ionomer on the nature of the counterion associated with the fixed sulfonate site. These results were obtained using thermal gravimetric analysis on a series of alkali metal and alkyl ammonium cation-exchanged Nafion films. We have found that the temperature of decomposition of Nafion is inversely dependent on the size of the exchanged cation; i.e., Nafion films show improved thermal stability as the size of the counter cation decreases. We attribute this inverse relationship of thermal stability with counterion size to an initial decomposition reaction which is strongly influenced by the strength of the sulfonate-coun-terion interaction. © 1993 John Wiley & Sons, Inc. 相似文献
23.
Helmut Schmidhammer Eva Scherb-Bukowiecki Thomas A. Mayer Peter Schnholzer 《Helvetica chimica acta》1994,77(6):1590-1594
The synthesis of benzazepine analogues of the opium alkaloid noscapine ( 1 ) is described. The benzazepines 2 and 3 were prepared starting from nornarceine ethyl ester ( 4 ; readily available from 1 ) in several steps. X-Ray analysis of compound 2 revealed that it is not a diastereosisomer mixture but a racemate of the threo-form and thus has the same configuration as 1 . 相似文献
24.
25.
We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
26.
Hugh Thomas 《Order》2006,23(2-3):249-269
In this paper, we study lattices that posess both the properties of being extremal (in the sense of Markowsky) and of being left modular (in the sense of Blass and Sagan). We call such lattices trim and show that they posess some additional appealing properties, analogous to those of a distributive lattice. For example, trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sphere; the latter holds exactly if the maximum element of the lattice is a join of atoms. Any distributive lattice is trim, but trim lattices need not be graded. The main example of ungraded trim lattices are the Tamari lattices and generalizations of them. We show that the Cambrian lattices in types A and B defined by Reading are trim; we conjecture that all Cambrian lattices are trim. 相似文献
27.
We consider a randomized version of the greedy algorithm for finding a large matching in a graph. We assume that the next edge is always randomly chosen from those remaining. We analyze the performance of this algorithm when the input graph is fixed. We show that there are graphs for which this Randomized Greedy Algorithm (RGA) usually only obtains a matching close in size to that guaranteed by worst-case analysis (i.e., half the size of the maximum). For some classes of sparse graphs (e.g., planar graphs and forests) we show that the RGA performs significantly better than the worst-case. Our main theorem concerns forests. We prove that the ratio to maximum here is at least 0.7690…, and that this bound is tight. 相似文献
28.
29.
The synthesis of rigid spirocyclic bislactams derived from pyroglutamic acid has been established. 相似文献
30.
Diffraction in electron stimulated desorption has revealed a propensity for Cl+ desorption from rest atom vs. adatom areas and unfaulted vs. faulted zones of Cl-terminated Si(1 1 1)-(7 × 7) surfaces. We associate the 15 eV ± 1 eV threshold with ionization of Si-Cl σ-bonding surface states and formation of screened two-hole states with Si 3s character. Similar specificity is observed from A and B reconstructions. This can be due to reduced screening in unfaulted regions and increased hole localization in Si back-bonds within faulted regions. 相似文献