全文获取类型
收费全文 | 300篇 |
免费 | 3篇 |
国内免费 | 1篇 |
专业分类
化学 | 117篇 |
晶体学 | 1篇 |
力学 | 12篇 |
数学 | 131篇 |
物理学 | 43篇 |
出版年
2019年 | 5篇 |
2017年 | 4篇 |
2015年 | 4篇 |
2014年 | 3篇 |
2013年 | 13篇 |
2012年 | 7篇 |
2011年 | 9篇 |
2010年 | 3篇 |
2008年 | 5篇 |
2007年 | 6篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 5篇 |
2003年 | 3篇 |
2002年 | 7篇 |
2001年 | 9篇 |
2000年 | 5篇 |
1998年 | 3篇 |
1997年 | 5篇 |
1996年 | 10篇 |
1995年 | 9篇 |
1994年 | 5篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 5篇 |
1988年 | 5篇 |
1987年 | 8篇 |
1986年 | 3篇 |
1985年 | 8篇 |
1984年 | 7篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 8篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 4篇 |
1974年 | 3篇 |
1972年 | 3篇 |
1971年 | 6篇 |
1970年 | 5篇 |
1969年 | 6篇 |
1968年 | 3篇 |
1965年 | 3篇 |
1962年 | 4篇 |
1959年 | 3篇 |
排序方式: 共有304条查询结果,搜索用时 0 毫秒
41.
42.
Seymour V. Parter 《Numerische Mathematik》1988,52(6):701-723
Summary TheMGR[v] algorithms of Ries, Trottenberg and Winter, the Algorithms 2.1 and 6.1 of Braess and the Algorithm 4.1 of Verfürth are all multigrid algorithms for the solution of the discrete Poisson equation (with Dirichlet boundary conditions) based on red-black Gauss-Seidel smoothing. Both Braess and Verfürth give explicit numerical upper bounds on the rate of convergence of their methods in convex polygonal domains. In this work we reconsider these problems and obtain improved estimates for theh–2h Algorithm 4.1 as well asW-cycle estimates for both schemes in non-convex polygonal domains. The proofs do not depend on the strengthened Cauchy inequality.Sponsored by the Air Force Office of Scientific Research under Contract No. AFOSR-86-0163 相似文献
43.
A single orthogonalized plane wave calculation has been made, to zero order in the pseudopotential, of the direct contact Knight shift for 30 liquid metals. The average deviation from experimental values is approximately 15%. Larger unexplained divergences occur for Cu and Hg. In addition it is shown that to zero order in the pseudopotential the factorΩP F in the Knight shift describing the electron density at the nucleus is almost unaffected by thermal expansion. 相似文献
44.
P.D Seymour 《Journal of Combinatorial Theory, Series B》1982,33(1):17-26
It has been conjectured that in any matroid, if W1, W2, W3 denote the number of points, lines, and planes respectively, then W22 ≥ W1W3. We prove this conjecture (and some strengthenings) for matroids in which no line has five or more points, thus generalizing a result of Stonesifer, who proved it for graphic matroids. 相似文献
45.
46.
47.
Seymour B. Elk 《Journal of mathematical chemistry》1990,4(1):55-68
The correlation described over twenty years ago by Matula between the prime factorization of integers and the class of alkanes is re-examined with a view to explaining the probable reason why there have, to date, been no major extensions of this idea. By considering the class of alkanes as a one-dimensional one-parameter system, a new perspective on the method is gained that is amenable to extension, but in a different direction than originally anticipated. With this new perspective, the classes of polybenzenes and polymantanes are seen to be the representatives of two- and three-dimensional one-parameter systems, respectively. A nomenclature, comparable to one that Matula used for alkanes, is created that gives a unique canonical name to all possible combinations of either polybenzene or polymantane modules. Such a nomenclature contains a built-in means of positioning the molecule in the field of interest in accordance with arbitrary pre-selected criteria, such as Patterson's rules, and also coding that indicates symmetries inherent in the structure of this molecule. 相似文献
48.
Relaxation times for 203,205Tl, 79,81Br and 35,37Cl are reported for molten TlBr, TlCl and TlBr : Tl. For Br and Cl, relaxation is predominantly quadrupolar; for Tl the relaxation indicates contact hyperfine interaction with paramagnetic centres produced thermally and by adding Tl. 相似文献
49.
P.D Seymour 《Journal of Combinatorial Theory, Series B》1981,31(3):327-338
We prove that a planar graph can be partitioned into edge-disjoint circuits of even length, if and only if every vertex has even valency and every block has an even number of edges. 相似文献
50.