全文获取类型
收费全文 | 192篇 |
免费 | 2篇 |
专业分类
化学 | 131篇 |
力学 | 5篇 |
数学 | 29篇 |
物理学 | 29篇 |
出版年
2019年 | 2篇 |
2016年 | 2篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 3篇 |
2012年 | 7篇 |
2011年 | 4篇 |
2010年 | 4篇 |
2009年 | 1篇 |
2008年 | 13篇 |
2007年 | 11篇 |
2006年 | 12篇 |
2005年 | 15篇 |
2004年 | 9篇 |
2003年 | 11篇 |
2002年 | 10篇 |
2001年 | 8篇 |
2000年 | 3篇 |
1997年 | 1篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1976年 | 4篇 |
1974年 | 3篇 |
1973年 | 2篇 |
1972年 | 4篇 |
1971年 | 3篇 |
1970年 | 7篇 |
1969年 | 2篇 |
1968年 | 2篇 |
1967年 | 3篇 |
1966年 | 2篇 |
1965年 | 3篇 |
1960年 | 1篇 |
1959年 | 1篇 |
1943年 | 1篇 |
1927年 | 2篇 |
排序方式: 共有194条查询结果,搜索用时 15 毫秒
51.
In the last 20 years, the reaction of many different CuI complexes and with dioxygen has been described. There is quite a big variety in their coordination geometry and most of them have been characterized by X-ray crystallography. Beyond structural information, stopped-flow kinetics experiments have provided additional mechanistic insights. In the particular systems [(BQPA)CuI]+ and [(Me2-TMPA)CuI]+ a new equilibrium between the two species trans-mu-1,2-peroxo and bis-mu-oxo is demonstrated. In the case of [(BQPA)CuI]+ the two species are in an equilibrium, presumably via the transient superoxo species. The reaction of [(Me2-TMPA)CuI]+ with dioxygen leads to the parallel formation of both species. The kinetically preferred trans-mu-peroxo species is then isomerised to the thermodynamically more stable bis-mu-oxo species. 相似文献
52.
Computing Center, Siberian Branch of the USSR Academy of Sciences, Krasnoyarsk. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 88, No. 3, pp. 430–441, September, 1991. 相似文献
53.
54.
55.
56.
Chemistry of Natural Compounds - It has been established that two trisaccharide chains are present in sibiroside C, one combined with the 3-hydroxyl and the other with the 28-carboxyl of... 相似文献
57.
58.
59.
60.
Consider a particle that moves on a connected, undirected graphG withn vertices. At each step the particle goes from the current vertex to one of its neighbors, chosen uniformly at random. Tocover time is the first time when the particle has visited all the vertices in the graph starting from a given vertex. In this paper, we present upper and lower bounds that relate the expected cover time for a graph to the eigenvalues of the Markov chain that describes the random walk above. An interesting consequence is that regular expander graphs have expected cover time (n logn).This research was done while this author was a postdoctoral fellow in the Department of Computer Science, Princeton University, and it was supported in part by DNR grant N00014-87-K-0467. 相似文献