全文获取类型
收费全文 | 3751篇 |
免费 | 143篇 |
国内免费 | 31篇 |
专业分类
化学 | 2444篇 |
晶体学 | 17篇 |
力学 | 93篇 |
数学 | 503篇 |
物理学 | 868篇 |
出版年
2023年 | 23篇 |
2022年 | 45篇 |
2021年 | 57篇 |
2020年 | 58篇 |
2019年 | 53篇 |
2018年 | 45篇 |
2017年 | 49篇 |
2016年 | 100篇 |
2015年 | 87篇 |
2014年 | 113篇 |
2013年 | 189篇 |
2012年 | 263篇 |
2011年 | 292篇 |
2010年 | 122篇 |
2009年 | 107篇 |
2008年 | 212篇 |
2007年 | 240篇 |
2006年 | 219篇 |
2005年 | 209篇 |
2004年 | 152篇 |
2003年 | 106篇 |
2002年 | 109篇 |
2001年 | 50篇 |
2000年 | 49篇 |
1999年 | 32篇 |
1998年 | 28篇 |
1997年 | 24篇 |
1996年 | 39篇 |
1995年 | 42篇 |
1994年 | 46篇 |
1993年 | 41篇 |
1992年 | 33篇 |
1991年 | 30篇 |
1990年 | 20篇 |
1989年 | 26篇 |
1987年 | 19篇 |
1986年 | 28篇 |
1985年 | 46篇 |
1984年 | 51篇 |
1983年 | 22篇 |
1982年 | 37篇 |
1981年 | 47篇 |
1980年 | 29篇 |
1979年 | 30篇 |
1978年 | 33篇 |
1977年 | 30篇 |
1976年 | 39篇 |
1975年 | 34篇 |
1974年 | 21篇 |
1973年 | 27篇 |
排序方式: 共有3925条查询结果,搜索用时 15 毫秒
991.
Green [HIPTN3N]V(THF) ([HIPTN3N]3- = [(HIPTNCH2CH2)3N]3-, where HIPT = 3,5-(2,4,6-i-Pr3C6H2)2C6H3) can be prepared in a 70-80% yield via the addition of H3[HIPTN3N] to VCl3(THF)3 in THF, followed by the addition of LiN(SiMe3)2. From [HIPTN3N]V(THF), the following have been prepared: {[HIPTN3N]VN2}K, [HIPTN3N]V(NH3), [HIPTN3N]V=NH, [HIPTN3N]V=NSiMe3, [HIPTN3N]V=O, [HIPTN3N]V=S, and [HIPTN3N]V(CO). No ammonia is formed from dinitrogen using {[HIPTN3N]VN2}K, [HIPTN3N]V=NH, or [HIPTN3N]V(NH3) as the initial species under conditions that were successful in the analogous [HIPTN3N]Mo system. X-ray structural studies are reported for [HIPTN3N]V(THF) and [HIPTN3N]V(NH3). 相似文献
992.
DeYonker NJ Grimes T Yockel S Dinescu A Mintz B Cundari TR Wilson AK 《The Journal of chemical physics》2006,125(10):104111
The correlation-consistent composite approach (ccCA), an ab initio composite technique for computing atomic and molecular energies, recently has been shown to successfully reproduce experimental data for a number of systems. The ccCA is applied to the G3/99 test set, which includes 223 enthalpies of formation, 88 adiabatic ionization potentials, 58 adiabatic electron affinities, and 8 adiabatic proton affinities. Improvements on the original ccCA formalism include replacing the small basis set quadratic configuration interaction computation with a coupled cluster computation, employing a correction for scalar relativistic effects, utilizing the tight-d forms of the second-row correlation-consistent basis sets, and revisiting the basis set chosen for geometry optimization. With two types of complete basis set extrapolation of MP2 energies, ccCA results in an almost zero mean deviation for the G3/99 set (with a best value of -0.10 kcal mol(-1)), and a 0.96 kcal mol(-1) mean absolute deviation, which is equivalent to the accuracy of the G3X model chemistry. There are no optimized or empirical parameters included in the computation of ccCA energies. Except for a few systems to be discussed, ccCA performs as well as or better than Gn methods for most systems containing first-row atoms, while for systems containing second-row atoms, ccCA is an improvement over Gn model chemistries. 相似文献
993.
994.
We show that there exist k-neighborly centrally symmetric d-dimensional polytopes
with 2(n + d) vertices, where
We also show that this bound is tight. 相似文献
995.
Bayesian Regularized Neural Networks (BRNNs) employing Automatic Relevance Determination (ARD) are used to construct a predictive model for the distribution coefficient logD7.4 from an in-house data set of 5000 compounds with experimental endpoints. A method for assessing the accuracy of prediction is established based upon a query compound's distance to the training set. logD7.4 predictions are also dynamically corrected with an associated library of compounds of continuously updated, experimentally measured logD7.4 values. A comparison of local models and associated libraries comprising separate ionization class subsets of compounds to compounds of a homogeneous ionization class reveals in this case that local models and libraries have no advantage over global models and libraries. 相似文献
996.
997.
[reaction: see text] A 1:1 mixture of the platinum bis(phosphine) complex [(S)-4]PtCl2 [(S)-4 = (S)-3,5-t-Bu-4-MeO-MeOBIPHEP] catalyzes the intramolecular asymmetric hydroarylation of 2-(4-pentenyl)indoles in moderate to good yield with up to 90% ee. 相似文献
998.
We examine individual Si nanowires grown by the vapor-liquid-solid mechanism, using real-time in situ ultra high vacuum transmission electron microscopy. By directly observing Au-catalyzed growth of Si wires from disilane, we show that the growth rate is independent of wire diameter, contrary to the expected behavior. Our measurements show that the unique rate-limiting step here is the irreversible, kinetically limited, dissociative adsorption of disilane directly on the catalyst surface. We also identify a novel dependence of growth rate on wire taper. 相似文献
999.
Using high-speed video, we have studied air bubbles detaching from an underwater nozzle. As a bubble distorts, it forms a thin neck which develops a singular shape as it pinches off. As in other singularities, the minimum neck radius scales with the time until the breakup. However, because the air-water interfacial tension does not drive the breakup, even small initial cylindrical asymmetries are preserved throughout the collapse. This novel, nonuniversal singularity retains a memory of the nozzle shape, size, and tilt angle. In the last stages, the air appears to tear instead of pinch. 相似文献
1000.
Given a graph G=(V, E), let ${\mathcal{P}}$ be a partition of V. We say that ${\mathcal{P}}$ is dominating if, for each part P of ${\mathcal{P}}$, the set V\P is a dominating set in G (equivalently, if every vertex has a neighbor of a different part from its own). We say that ${\mathcal{P}}$ is acyclic if for any parts P, P′ of ${\mathcal{P}}$, the bipartite subgraph G[P, P′] consisting of the edges between P and P′ in ${\mathcal{P}}$ contains no cycles. The acyclic dominating number ad(G) of G is the least number of parts in any partition of V that is both acyclic and dominating; and we shall denote by ad(d) the maximum over all graphs G of maximum degree at most d of ad(G). In this article, we prove that ad(3)=2, which establishes a conjecture of P. Boiron, É. Sopena, and L. Vignal, DIMACS/DIMATIA Conference “Contemporary Trends in Discrete Mathematics”, 1997, pp. 1–10. For general d, we prove the upper bound ad(d)=O(dlnd) and a lower bound of ad(d)=Ω(d). © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 292–311, 2010 相似文献