全文获取类型
收费全文 | 622743篇 |
免费 | 6364篇 |
国内免费 | 1740篇 |
专业分类
化学 | 331959篇 |
晶体学 | 9291篇 |
力学 | 28099篇 |
综合类 | 20篇 |
数学 | 74828篇 |
物理学 | 186650篇 |
出版年
2021年 | 4854篇 |
2020年 | 5532篇 |
2019年 | 6006篇 |
2018年 | 7875篇 |
2017年 | 7735篇 |
2016年 | 11825篇 |
2015年 | 7400篇 |
2014年 | 11379篇 |
2013年 | 27721篇 |
2012年 | 21062篇 |
2011年 | 25771篇 |
2010年 | 18238篇 |
2009年 | 17896篇 |
2008年 | 23843篇 |
2007年 | 23860篇 |
2006年 | 22129篇 |
2005年 | 19918篇 |
2004年 | 18412篇 |
2003年 | 16416篇 |
2002年 | 16242篇 |
2001年 | 17945篇 |
2000年 | 13810篇 |
1999年 | 10848篇 |
1998年 | 9167篇 |
1997年 | 8946篇 |
1996年 | 8598篇 |
1995年 | 7812篇 |
1994年 | 7809篇 |
1993年 | 7441篇 |
1992年 | 8443篇 |
1991年 | 8460篇 |
1990年 | 8156篇 |
1989年 | 7825篇 |
1988年 | 8004篇 |
1987年 | 7779篇 |
1986年 | 7388篇 |
1985年 | 9621篇 |
1984年 | 9941篇 |
1983年 | 8137篇 |
1982年 | 8275篇 |
1981年 | 8185篇 |
1980年 | 7827篇 |
1979年 | 8165篇 |
1978年 | 8550篇 |
1977年 | 8377篇 |
1976年 | 8406篇 |
1975年 | 7701篇 |
1974年 | 7820篇 |
1973年 | 7960篇 |
1972年 | 5626篇 |
排序方式: 共有10000条查询结果,搜索用时 10 毫秒
171.
Golovchenko A. V. Pil'o S. G. Brovarets V. S. Drach B. S. 《Russian Journal of General Chemistry》2003,73(11):1832-1833
Russian Journal of General Chemistry - 相似文献
172.
A simple procedure for the synthesis of an important standard, isotopically enriched methylmercury, which is not commercially available, has been established successfully. The isotopically enriched standard synthesized is utilized in conventional isotope dilution mass spectrometry (IDMS), as well as in speciated IDMS (SIDMS), for determination of the true concentration of methylmercury in environmental samples. The CH3201Hg+ standard has been synthesized from commercially available 201HgO and tetramethyltin. The synthesis time required is 1 h at 60°C. The product is highly pure, yielding more than 90% as 201Hg in CH3201Hg+. Hazardous dimethylmercury does not occur during this synthesis procedure. The product synthesized was analyzed using high‐performance liquid chromatography coupled with inductively coupled plasma mass spectrometry (ICP‐MS) and ICP‐MS alone in order to determine its concentration, isotopic composition and purity. The stability of the product was also evaluated for over 6 months and found to be stable at 4°C in the dark. The isotopically enriched methylmercury synthesized can be used in SIDMS and IDMS analyses as a standard. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
173.
G. P. Klimov 《Applied Mathematics Letters》1991,4(6):95-97
Let F be a non-arithmetic distribution on the line
, and W be the class of bounded functions w without discontinuity of the second kind such that .In this paper, we show that the solution of the homogeneous renewal equation w = w F in the class W is a constant-function. 相似文献
174.
175.
I. L. Bataronov A. M. Roshchupkin 《Journal of Applied Mechanics and Technical Physics》1991,32(2):259-265
Translated from Zhurnal Prikladnoi Mekhaniki i Tekhnicheskoi Fiziki, No. 2, pp. 127–134, March–April, 1991. 相似文献
176.
177.
178.
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. 相似文献
179.
180.
Translated from Matematicheskie Zametki, Vol. 49, No. 5, pp. 37–44, May, 1991. 相似文献