全文获取类型
收费全文 | 452564篇 |
免费 | 6326篇 |
国内免费 | 2298篇 |
专业分类
化学 | 249979篇 |
晶体学 | 6562篇 |
力学 | 18097篇 |
综合类 | 67篇 |
数学 | 55006篇 |
物理学 | 131477篇 |
出版年
2020年 | 3744篇 |
2019年 | 4180篇 |
2018年 | 5118篇 |
2017年 | 5066篇 |
2016年 | 7943篇 |
2015年 | 5476篇 |
2014年 | 7748篇 |
2013年 | 20317篇 |
2012年 | 16169篇 |
2011年 | 19574篇 |
2010年 | 13330篇 |
2009年 | 13043篇 |
2008年 | 17842篇 |
2007年 | 18037篇 |
2006年 | 16724篇 |
2005年 | 15405篇 |
2004年 | 13682篇 |
2003年 | 12064篇 |
2002年 | 11791篇 |
2001年 | 12876篇 |
2000年 | 9767篇 |
1999年 | 7560篇 |
1998年 | 6326篇 |
1997年 | 6284篇 |
1996年 | 6142篇 |
1995年 | 5538篇 |
1994年 | 5492篇 |
1993年 | 5409篇 |
1992年 | 5847篇 |
1991年 | 5891篇 |
1990年 | 5545篇 |
1989年 | 5424篇 |
1988年 | 5415篇 |
1987年 | 5287篇 |
1986年 | 5147篇 |
1985年 | 6936篇 |
1984年 | 7151篇 |
1983年 | 5872篇 |
1982年 | 6414篇 |
1981年 | 6066篇 |
1980年 | 5828篇 |
1979年 | 5968篇 |
1978年 | 6318篇 |
1977年 | 6236篇 |
1976年 | 6411篇 |
1975年 | 5806篇 |
1974年 | 5959篇 |
1973年 | 6284篇 |
1972年 | 4352篇 |
1971年 | 3449篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
971.
For any two points p and q in the Euclidean plane, define LUNpq = { v | v ∈ R2, dpv < dpq and dqv < dpq}, where duv is the Euclidean distance between two points u and v . Given a set of points V in the plane, let LUNpq(V) = V ∩ LUNpq. Toussaint defined the relative neighborhood graph of V, denoted by RNG(V) or simply RNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of RNG(V) if and only if LUNpq (V) = ?. The relative neighborhood graph has several applications in pattern recognition that have been studied by Toussaint. We shall generalize the idea of RNG to define the k-relative neighborhood graph of V, denoted by kRNG(V) or simply kRNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of kRNG(V) if and only if | LUNpq(V) | < k, for some fixed positive number k. It can be shown that the number of edges of a kRNG is less than O(kn). Also, a kRNG can be constructed in O(kn2) time. Let Ec = {epq| p ∈ V and q ∈ V}. Then Gc = (V,Ec) is a complete graph. For any subset F of Ec, define the maximum distance of F as maxepq∈Fdpq. A Euclidean bottleneck Hamiltonian cycle is a Hamiltonian cycle in graph Gc whose maximum distance is the minimum among all Hamiltonian cycles in graph Gc. We shall prove that there exists a Euclidean bottleneck Hamiltonian cycle which is a subgraph of 20RNG(V). Hence, 20RNGs are Hamiltonian. 相似文献
972.
973.
L Dalla Libera M Fasolo P Cavallini E Ratti G Gaviraghi 《Journal of chromatography. A》1991,566(2):427-434
Avian myosin light-chain kinase from smooth muscle of the gizzard and its catalytic domain, derived from the intact enzyme by trypsin digestion, was purified within 30-40 min by both analytical and preparative anion-exchange high-performance liquid chromatography. The proteins obtained were more than 95% pure and retained their biological activity. The high-performance anion-exchange chromatography protocols represent a significant decrease in purification time when compared with conventional ion-exchange chromatography. 相似文献
974.
975.
The existence of a Nash equilibrium in the undiscounted repeated two-person game of incomplete information on one side is
established. The proof depends on a new topological result resembling in some respect the Borsuk-Ulam theorem. 相似文献
976.
L. B. Parnovski 《Mathematische Nachrichten》1995,174(1):253-263
We investigate the asymptotic behaviour of the counting function of Dirichlet eigenvalues on some class of noncompact manifolds. We prove that in cases when the volume or the perimeter (the volume of the boundary) of the manifold is infinite, some additional (nonclassical) terms appear in the precise asymptotics. The coefficients at the classical terms in those are regularized in some special way volume (resp. perimeter) of the manifold. 相似文献
977.
A conjecture of Toft [17] asserts that any 4-critical graph (or equivalently, every 4-chromatic graph) contains a fully odd subdivision ofK
4. We show that if a graphG has a degree three nodev such thatG-v is 3-colourable, then eitherG is 3-colourable or it contains a fully oddK
4. This resolves Toft's conjecture in the special case where a 4-critical graph has a degree three node, which is in turn used to prove the conjecture for line-graphs. The proof is constructive and yields a polynomial algorithm which given a 3-degenerate graph either finds a 3-colouring or exhibits a subgraph that is a fully odd subdivision ofK
4. (A graph is 3-degenerate if every subgraph has some node of degree at most three.) 相似文献
978.
979.
It is demonstrated theoretically that the initial (both elastic and viscous) magnetic susceptibility components for nanocrystalline
magnets caused by the processes of rotations (in the region of linear response) have resonant rather than relaxation character
typical already for the susceptibility component caused by displacements of domain boundaries.
__________
Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Fizika, No. 6, pp. 88–92, June, 2007. 相似文献
980.
N. B. Valetova L. L. Semenycheva I. S. Il’ichev A. N. Artemov D. F. Grishin 《Russian Journal of Applied Chemistry》2007,80(5):818-821
Features of radical polymerization of styrene in the presence of (diphenylbutadiene)tricarbonylchromium were studied. 相似文献