全文获取类型
收费全文 | 1864篇 |
免费 | 48篇 |
国内免费 | 6篇 |
专业分类
化学 | 860篇 |
晶体学 | 9篇 |
力学 | 89篇 |
数学 | 399篇 |
物理学 | 561篇 |
出版年
2023年 | 9篇 |
2022年 | 23篇 |
2021年 | 38篇 |
2020年 | 33篇 |
2019年 | 44篇 |
2018年 | 40篇 |
2017年 | 41篇 |
2016年 | 64篇 |
2015年 | 41篇 |
2014年 | 60篇 |
2013年 | 105篇 |
2012年 | 112篇 |
2011年 | 127篇 |
2010年 | 81篇 |
2009年 | 81篇 |
2008年 | 109篇 |
2007年 | 82篇 |
2006年 | 87篇 |
2005年 | 85篇 |
2004年 | 57篇 |
2003年 | 61篇 |
2002年 | 49篇 |
2001年 | 21篇 |
2000年 | 21篇 |
1999年 | 36篇 |
1998年 | 25篇 |
1997年 | 25篇 |
1996年 | 27篇 |
1995年 | 23篇 |
1994年 | 20篇 |
1993年 | 15篇 |
1992年 | 12篇 |
1991年 | 17篇 |
1990年 | 20篇 |
1989年 | 11篇 |
1987年 | 10篇 |
1986年 | 13篇 |
1984年 | 14篇 |
1980年 | 8篇 |
1979年 | 13篇 |
1978年 | 8篇 |
1977年 | 16篇 |
1976年 | 10篇 |
1975年 | 10篇 |
1974年 | 7篇 |
1972年 | 9篇 |
1969年 | 8篇 |
1968年 | 8篇 |
1967年 | 7篇 |
1938年 | 7篇 |
排序方式: 共有1918条查询结果,搜索用时 187 毫秒
1.
Valentin A. Semenov Dmitry O. Samultsev Leonid B. Krivdin 《Magnetic resonance in chemistry : MRC》2020,58(6):532-539
The density functional theory calculation of 1H and 13C NMR chemical shifts in a series of ten 10 classically known Strychnos alkaloids with a strychnine skeleton was performed at the PBE0/pcSseg-2//pcseg-2 level. It was found that calculated 1H and 13C NMR chemical shifts provided a markedly good correlation with experiment characterized by a mean absolute error of 0.08 ppm in the range of 7 ppm for protons and 1.67 ppm in the range of 150 ppm for carbons, so that a mean absolute percentage error was as small as ~1% in both cases. 相似文献
2.
S. A. Gurevich T. A. Zaraiskaya S. G. Konnikov V. M. Mikushkin S. Yu. Nikonov A. A. Sitnikova S. E. Sysoev V. V. Khorenko V. V. Shnitov Yu. S. Gordeev 《Physics of the Solid State》1997,39(10):1691-1695
The concentration and chemical state of copper in the subsurface region of Cu/SiO2 composite films obtained by simultaneous magnetron sputtering from two sources (Cu and SiO2) are determined by x-ray photoelectron spectroscopy (XPS). It is established that copper in the as-grown film is primarily in the form of unoxidized atoms dispersed in a SiO2 matrix. Annealing of the film results in practically no oxidation, but about 70% of the copper atoms condense into metallic clusters with sizes below 10 Å in the subsurface region and about 50 Å in the bulk of the film. The changes in the binding energy of core electrons, and especially in the energies of Auger electrons, are so large in this situation that photoelectron and Auger spectroscopy are efficient methods for monitoring the chemical state of this composite material. 相似文献
3.
We develop a theory of the magnetic-zenith effect (MZE) observed upon the ionosphere modification by powerful radio waves.
The dependences of MZE on main parameters, such as the magnetic-field inclination angle, pump-wave frequency and power, and
angular width of HF beam are obtained. The optimal elevation angle of pump-wave beam is predicted.
__________
Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Radiofizika, Vol. 48, No. 9, pp. 772–787, September 2005. 相似文献
4.
5.
B. M. Gurevich 《Theoretical and Mathematical Physics》1992,90(3):289-312
The Liouville operator for an infinite-particle Hamiltonian dynamics corresponding to interaction potentialU is used to introduce the concept of a locally weakly invariant measure on the phase space and to show that if a Gibbs measure with potential of general form is locally weakly invariant then its Hamiltonian is asymptotically an additive integral of the motion of the particles with the interactionU.Moscow State University. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 90, No. 3, pp. 424–459, March, 1992. 相似文献
6.
Multinomial permutations on a circle are considered in the framework of combinatorics. Different cases are presented and shown to agree with previously derived formula for the number of cyclic necklaces. Two applied examples are discussed with a view to illustrate the implications of derived formulas. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
7.
We prove that the sequence of finite reflecting branching Brownian motion forests defined by Burdzy and Le Gall ([1]) converges in probability to the “super-Brownian motion with reflecting historical paths.” This solves an open problem posed in [1], where only tightness was proved for the sequence of approximations. Several results on path behavior were proved in [1] for all subsequential limits–they obviously hold for the unique limit found in the present paper.Mathematics Subject Classification (2000): Primary 60H15, Secondary 35R60Supported in part by NSF Grant DMS-0071486, Israel Science Foundation Grants 12/98 and 116/01 - 10.0, and the U.S.-Israel Binational Science Foundation (grant No. 2000065). 相似文献
8.
Leonid Polterovich 《Geometric And Functional Analysis》1996,6(4):726-739
Supported by the United States-Israel Binational Science Foundation grant 94-00302 相似文献
9.
S. G. Barsov A. L. Getalov S. L. Ginsburg V. P. Koptev S. P. Kruglov L. A. Kuzmin S. V. Maleyev E. I. Maltsev S. M. Mikirtychyants N. A. Tarasov G. V. Shcherbakov V. G. Grebinnik V. N. Duginov A. B. Lazarev V. G. Olshevski S. N. Shilov V. A. Zhukov I. I. Gurevich B. F. Kirillov A. I. Klimov B. A. Nikolski A. V. Pirogov A. N. Ponomarev V. A. Suetin 《Hyperfine Interactions》1991,64(1-4):415-419
The zero field μSR-method has been used to study the magnetism in the disordered magnetic alloy Fe82−xNixCr18 near the three-critical, pointx=25. The dynamic and static local field distributions are analyzed. The difference between spin-glass states obtained either
from the paramagnetic or after the double transition is discussed. 相似文献
10.
Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s1 and s2 to, respectively, a given vertex t1, and each vertex of a given subset of vertices T2. 相似文献