全文获取类型
收费全文 | 228篇 |
免费 | 7篇 |
专业分类
化学 | 178篇 |
晶体学 | 1篇 |
力学 | 1篇 |
数学 | 38篇 |
物理学 | 17篇 |
出版年
2023年 | 1篇 |
2020年 | 5篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2017年 | 1篇 |
2016年 | 1篇 |
2015年 | 3篇 |
2014年 | 6篇 |
2013年 | 10篇 |
2012年 | 9篇 |
2011年 | 21篇 |
2010年 | 14篇 |
2009年 | 6篇 |
2008年 | 26篇 |
2007年 | 14篇 |
2006年 | 8篇 |
2005年 | 10篇 |
2004年 | 11篇 |
2003年 | 14篇 |
2002年 | 9篇 |
2001年 | 2篇 |
2000年 | 5篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 6篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1989年 | 1篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1982年 | 3篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有235条查询结果,搜索用时 31 毫秒
211.
Odile Meyer 《Tetrahedron letters》2004,45(42):7921-7923
As enzymatic syntheses are expensive for a large-scale preparation of DHAP, a precursor leading to DHAP was synthesized in three steps starting from (±) glycidol; the stable benzylated stock material afforded by hydrogenolysis DHAP in high purity, which may be used directly without purification in enzymatic aldol synthesis. 相似文献
212.
213.
Clot E Mégret C Kraft BM Eisenstein O Jones WD 《Journal of the American Chemical Society》2004,126(17):5647-5653
Cp*(2)ZrH(2) (1) (Cp* = pentamethylcyclopentadienyl) reacts with perfluoropropene (2) to give Cp*(2)ZrHF (3) and hydrodefluorinated products under very mild conditions. Initial C-F bond activation occurs selectively at the vinylic terminal position of the olefin to exchange fluorine for hydrogen. Subsequent hydrodefluorination leads to the formation of the n-propylhydride complex Cp*(2)ZrH(CH(2)CH(2)CH(3)), which can be cleaved with dihydrogen to give propane and 1. A theoretical study of the reaction of Cp*(2)ZrH(2) (Cp* = cyclopentadienyl) and CF(2)[double bond]CF(CF(3)) has been undertaken. Several mechanisms have been examined in detail using DFT(B3PW91) calculations and are discussed for this H/F exchange: (a) internal olefin insertion/beta-fluoride elimination, (b) external olefin insertion/beta-fluoride elimination, and (c) F/H metathesis from either an inside or outside approach. Of these, the first case is found to be energetically preferred. Selective defluorination at the terminal carbon has been shown to be favored over defluorination at the substituted and allylic carbons. 相似文献
214.
Philippe Costes Jochen Weckesser Odile Dechy‐Cabaret Martine Urrutigoïty Philippe Kalck 《应用有机金属化学》2008,22(4):211-214
The Rh‐catalyzed cycloisomerization of new terpenoid derivatives featuring an O‐tethered enyne unexpectedly leads to polycyclic derivatives containing an inner cyclopropane ring or a diene moiety, depending on the structure of the enyne, as observed in the PtCl2‐catalyzed processes. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
215.
Odile Favaron 《Discrete Mathematics》2008,308(16):3491-3507
A set S of vertices in a graph G is a total dominating set, denoted by TDS, of G if every vertex of G is adjacent to some vertex in S (other than itself). The minimum cardinality of a TDS of G is the total domination number of G, denoted by γt(G). If G does not contain K1,3 as an induced subgraph, then G is said to be claw-free. It is shown in [D. Archdeacon, J. Ellis-Monaghan, D. Fischer, D. Froncek, P.C.B. Lam, S. Seager, B. Wei, R. Yuster, Some remarks on domination, J. Graph Theory 46 (2004) 207-210.] that if G is a graph of order n with minimum degree at least three, then γt(G)?n/2. Two infinite families of connected cubic graphs with total domination number one-half their orders are constructed in [O. Favaron, M.A. Henning, C.M. Mynhardt, J. Puech, Total domination in graphs with minimum degree three, J. Graph Theory 34(1) (2000) 9-19.] which shows that this bound of n/2 is sharp. However, every graph in these two families, except for K4 and a cubic graph of order eight, contains a claw. It is therefore a natural question to ask whether this upper bound of n/2 can be improved if we restrict G to be a connected cubic claw-free graph of order at least 10. In this paper, we answer this question in the affirmative. We prove that if G is a connected claw-free cubic graph of order n?10, then γt(G)?5n/11. 相似文献
216.
217.
218.
A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The minimum cardinality of a paired-dominating set of G is the paired-domination number of G, denoted by pr(G). If G does not contain a graph F as an induced subgraph, then G is said to be F-free. In particular if F=K1,3 or K4–e, then we say that G is claw-free or diamond-free, respectively. Let G be a connected cubic graph of order n. We show that (i) if G is (K1,3,K4–e,C4)-free, then pr(G)3n/8; (ii) if G is claw-free and diamond-free, then pr(G)2n/5; (iii) if G is claw-free, then pr(G)n/2. In all three cases, the extremal graphs are characterized.Research supported in part by the South African National Research Foundation and the University of KwaZulu-Natal. This paper was written while the second author was visiting the Laboratoire de Recherche en Informatique (LRI) at the Université de Paris-Sud in July 2002. The second author thanks the LRI for their warm hospitality 相似文献
219.
220.
Clot E Besora M Maseras F Mégret C Eisenstein O Oelckers B Perutz RN 《Chemical communications (Cambridge, England)》2003,(4):490-491
DFT methods are used to quantify the relationship between M-C and H-C bond energies; for MLn = Re(eta5-C5H5)(CO)2H and fluorinated aryl ligands, theoretical and experimental investigations of ortho-fluorine substitution indicate a much larger increase in the M-C than in the H-C bond energy, so stabilising C-H activation products. 相似文献