全文获取类型
收费全文 | 629篇 |
免费 | 20篇 |
专业分类
化学 | 485篇 |
晶体学 | 7篇 |
力学 | 6篇 |
数学 | 53篇 |
物理学 | 98篇 |
出版年
2023年 | 10篇 |
2022年 | 12篇 |
2021年 | 10篇 |
2020年 | 16篇 |
2019年 | 16篇 |
2018年 | 12篇 |
2017年 | 7篇 |
2016年 | 14篇 |
2015年 | 15篇 |
2014年 | 18篇 |
2013年 | 33篇 |
2012年 | 33篇 |
2011年 | 43篇 |
2010年 | 10篇 |
2009年 | 16篇 |
2008年 | 43篇 |
2007年 | 40篇 |
2006年 | 25篇 |
2005年 | 31篇 |
2004年 | 25篇 |
2003年 | 19篇 |
2002年 | 18篇 |
2001年 | 9篇 |
2000年 | 12篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 7篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 10篇 |
1989年 | 7篇 |
1988年 | 11篇 |
1987年 | 6篇 |
1986年 | 6篇 |
1985年 | 5篇 |
1984年 | 9篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1977年 | 4篇 |
1973年 | 4篇 |
1969年 | 4篇 |
1954年 | 3篇 |
1937年 | 2篇 |
1931年 | 2篇 |
1927年 | 2篇 |
排序方式: 共有649条查询结果,搜索用时 9 毫秒
71.
PdII Complexes of [44]‐ and [46]Decaphyrins: The Largest Hückel Aromatic and Antiaromatic,and Möbius Aromatic Macrocycles 下载免费PDF全文
Tomoki Yoneda Young Mo Sung Dr. Jong Min Lim Prof. Dr. Dongho Kim Prof. Dr. Atsuhiro Osuka 《Angewandte Chemie (International ed. in English)》2014,53(48):13169-13173
Reductive metalation of [44]decaphyrin with [Pd2(dba)3] provided a Hückel aromatic [46]decaphyrin PdII complex, which was readily oxidized upon treatment with DDQ to produce a Hückel antiaromatic [44]decaphyrin PdII complex. In CH2Cl2 solution the latter complex underwent slow tautomerization to a Möbius aromatic [44]decaphyrin PdII complex which exists as a mixture of conformers in dynamic equilibrium. To the best of our knowledge, these three PdII complexes represent the largest Hückel aromatic, Hückel antiaromatic, and Möbius aromatic complexes to date. 相似文献
72.
Kiyonaga T Fujii M Akita T Kobayashi H Tada H 《Physical chemistry chemical physics : PCCP》2008,10(43):6553-6561
TiO(2) particle-supported Au nanoparticles (NPs) with varying sizes and good contact (Au/TiO(2)) were prepared under a constant loading amount by the deposition-precipitation method. The Fermi energy of Au NPs loaded on TiO(2) at the photostationary state (E(F)') was determined in water by the use of S/S(2-) having specific interaction with Au as a redox probe. The E(F)' value goes up as the mean size of Au NPs (d) increases at 3.0 相似文献
73.
74.
75.
A balanced vertex-coloring of a graph G is a function c from V(G) to {−1,0,1} such that ∑{c(v):v∈V(G)}=0. A subset U of V(G) is called a balanced set if U induces a connected subgraph and ∑{c(v):v∈U}=0. A decomposition V(G)=V1∪?∪Vr is called a balanced decomposition if Vi is a balanced set for 1≤i≤r.In this paper, the balanced decomposition number f(G) of G is introduced; f(G) is the smallest integer s such that for any balanced vertex-coloring c of G, there exists a balanced decomposition V(G)=V1∪?∪Vr with |Vi|≤s for 1≤i≤r. Balanced decomposition numbers of some basic families of graphs such as complete graphs, trees, complete bipartite graphs, cycles, 2-connected graphs are studied. 相似文献
76.
77.
78.
This study investigated the variations in human plasma fluoride concentrations ([F]) and sought to determine the causes. Five subjects (27-33 years old) received a low-F diet during the 5 days of the study. Plasma samples and urine were collected every 3 h from 8 a.m. to 8 p.m. F, PTH, Ca and P were analyzed with the electrode, by chemiluminescence, AAS and colorimetry, respectively. A trend for the plasma [F] was found. The peak [F], 0.55 ± 0.11 μmol L−1, occurred at 11 a.m. and the lowest [F], 0.50 ± 0.06 μmol L−1 occurred between 5 and 8 p.m. Plasma [F] were positively correlated with urinary F excretion rates and with serum PTH levels, but not with the Ca or P levels. Serum PTH levels were positively correlated with urinary F excretion rates and negatively correlated with plasma Ca. The results suggest that the renal system seems to control the daily fluctuations in plasma [F]. 相似文献
79.
80.
Tomoki Yamashita 《Discrete Mathematics》2008,308(24):6584-6587
Let G be a graph. For S⊂V(G), let Δk(S) denote the maximum value of the degree sums of the subsets of S of order k. In this paper, we prove the following two results. (1) Let G be a 2-connected graph. If Δ2(S)≥d for every independent set S of order κ(G)+1, then G has a cycle of length at least min{d,|V(G)|}. (2) Let G be a 2-connected graph and X a subset of V(G). If Δ2(S)≥|V(G)| for every independent set S of order κ(X)+1 in G[X], then G has a cycle that includes every vertex of X. This suggests that the degree sum of nonadjacent two vertices is important for guaranteeing the existence of these cycles. 相似文献