全文获取类型
收费全文 | 1095篇 |
免费 | 37篇 |
国内免费 | 6篇 |
专业分类
化学 | 719篇 |
晶体学 | 7篇 |
力学 | 20篇 |
数学 | 193篇 |
物理学 | 199篇 |
出版年
2023年 | 4篇 |
2022年 | 24篇 |
2021年 | 19篇 |
2020年 | 22篇 |
2019年 | 25篇 |
2018年 | 21篇 |
2017年 | 20篇 |
2016年 | 37篇 |
2015年 | 32篇 |
2014年 | 32篇 |
2013年 | 66篇 |
2012年 | 84篇 |
2011年 | 79篇 |
2010年 | 55篇 |
2009年 | 45篇 |
2008年 | 74篇 |
2007年 | 62篇 |
2006年 | 62篇 |
2005年 | 49篇 |
2004年 | 58篇 |
2003年 | 29篇 |
2002年 | 33篇 |
2001年 | 26篇 |
2000年 | 12篇 |
1999年 | 16篇 |
1998年 | 9篇 |
1997年 | 14篇 |
1996年 | 19篇 |
1995年 | 8篇 |
1994年 | 10篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1975年 | 3篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1958年 | 2篇 |
1957年 | 6篇 |
1956年 | 6篇 |
1954年 | 10篇 |
排序方式: 共有1138条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
5.
Stanislav Man 《Tetrahedron letters》2006,47(39):6961-6963
Two different procedures for β-allenyloxime cyclization are described. One leads to substituted 1-hydroxypyrrolidines and the other represents a new route to pyrroline-N-oxides. 相似文献
6.
The influence of the sample orientation on the effective value of the hydrostatic piezoelectric coefficients d
h
(i)
of Sn2P2S6 crystals has been studied. The hydrostatic piezoelectric coefficients d
h
(1)
and d′
h
(3)
, were measured, d
h
(1)
=(244±3) pC/N and d′
h
(3)
=(92±1) pC/N. The hydrostatic piezoelectric coefficient d
h
(3)
for orthogonal axis system was calculated to be d
h
(3)
=(87±2) pC/N. The, optimal orientation of the sample has been found as (Xy l)−20°-cut. Maximal value of the effective hydrostatic piezoelectric coefficient d
h
(1)
equals 260 pC/N. Double rotated samples were also studied. The orientation of the samples insensitive to the pressure has
been found. The theoretical mean value of hydrostatic piezoelectric coefficient (d
h
)
mean
corresponding to randomly oriented Sn2P2S6 grains in a poled composite has been calculated to be (d
h
)
mean
=136 pC/N. 相似文献
7.
Stanislav Volkov 《Journal of Theoretical Probability》2006,19(3):691-700
Vertex-reinforced random walk is a random process which visits a site with probability proportional to the weight w
k
of the number k of previous visits. We show that if w
k
∼ k
α, then there is a large time T
0 such that after T
0 the walk visits 2, 5, or ∞ sites when α < 1, = 1, or > 1, respectively. More general results are also proven.
相似文献
8.
The reaction of a new fluorinated unsymmetrical allenylazine with dimethyl acetylenedicarboxylate and phenylacetylene affords the combined intra-intermolecular criss-cross cycloaddition products, 2,3-disubstituted-1,10-diazatricyclo[5.2.1.04,10]deca-2,6-diene derivatives. The products contain three fused five-membered rings with two nitrogen atoms within an unsaturated heterocyclic system. The structures were assigned using 2D NMR correlations and in the case of the phenylacetylene adduct by X-ray structure analysis. 相似文献
9.
We prove that a for a mapping f of finite distortion , the -Hausdorff measure of any point preimage is zero provided is integrable, with , and the multiplicity function of f is essentially bounded. As a consequence for we obtain that the mapping is then open and discrete.
Received: 18 June 2001 / Revised version: 31 January 2002 / Published online: 27 June 2002 相似文献
10.
Stanislav Busygin 《Discrete Applied Mathematics》2006,154(15):2080-2096
A new simple generalization of the Motzkin-Straus theorem for the maximum weight clique problem is formulated and directly proved. Within this framework a trust region heuristic is developed. In contrast to usual trust region methods, it regards not only the global optimum of a quadratic objective over a sphere, but also a set of other stationary points of the program. We formulate and prove a condition when a Motzkin-Straus optimum coincides with such a point. The developed method has complexity O(n3), where n is the number of vertices of the graph. It was implemented in a publicly available software package QUALEX-MS.Computational experiments indicate that the algorithm is exact on small graphs and very efficient on the DIMACS benchmark graphs and various random maximum weight clique problem instances. 相似文献