全文获取类型
收费全文 | 146篇 |
免费 | 4篇 |
国内免费 | 6篇 |
专业分类
化学 | 4篇 |
力学 | 10篇 |
数学 | 127篇 |
物理学 | 15篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 6篇 |
2021年 | 1篇 |
2020年 | 2篇 |
2019年 | 4篇 |
2018年 | 7篇 |
2017年 | 1篇 |
2016年 | 2篇 |
2015年 | 4篇 |
2014年 | 10篇 |
2013年 | 7篇 |
2012年 | 4篇 |
2011年 | 12篇 |
2010年 | 11篇 |
2009年 | 11篇 |
2008年 | 16篇 |
2007年 | 5篇 |
2006年 | 9篇 |
2005年 | 2篇 |
2004年 | 10篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 3篇 |
1998年 | 4篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有156条查询结果,搜索用时 15 毫秒
1.
For a stochastic matrix (Q
ij
T
)
i,j=1
M
withQ
ij
T
exp(–U(ij)/T) at the off-diagonal positions, we develop an algorithm to evaluate the asymptotic convergence rate of all eigenvalues ofQ
ij
T
asT 0 using Ventcel's optimal graphs. As an application we can compare the convergence rates of some random updating schemes used in image processing.This research was partially supported by the National Science Council, Taiwan and Air Force Office of Scientific Research Contract No. F49620 S5C 0144, and was completed while Tzuu-Shuh Chiang was visiting the Center for Stochastic Processes, Department of Statistics, University of North Carolina, Chapel Hill, NC 27599-3260, USA. 相似文献
2.
3.
4.
Extendable Cycles in Multipartite Tournaments 总被引:1,自引:0,他引:1
An n-partite tournament is an orientation of a complete n-partite graph. If D is a strongly connected n-partite (n3) tournament, then we shall prove that every partite set of D has at least one vertex which lies on a cycle Cm of each length m for such that V(C3)V(C4)V(Cn), where V(Cm) is the vertex set of Cm for . This result extends those of Bondy [2], Guo and Volkmann [4], Gutin [6], Moon [8], and Yeo [12].Final version received: June 9, 2003 相似文献
5.
Let be a class of graphs on n vertices. For an integer c, let be the smallest integer such that if G is a graph in with more than edges, then G contains a cycle of length more than c. A classical result of Erdös and Gallai is that if is the class of all simple graphs on n vertices, then . The result is best possible when n-1 is divisible by c-1, in view of the graph consisting of copies of Kc all having exactly one vertex in common. Woodall improved the result by giving best possible bounds for the remaining cases when n-1 is not divisible by c-1, and conjectured that if is the class of all 2-connected simple graphs on n vertices, thenwhere , 2tc/2, is the number of edges in the graph obtained from Kc+1-t by adding n-(c+1-t) isolated vertices each joined to the same t vertices of Kc+1-t. By using a result of Woodall together with an edge-switching technique, we confirm Woodall's conjecture in this paper. 相似文献
6.
7.
A.O. Terent’ev M.M. Platonov I.V. Krylova M.P. Egorov G.I. Nikishin 《Journal of organometallic chemistry》2009,694(12):1786-1788
First, previously unknown, cyclic organogermanium peroxides, 1,2,4,5,7,8-hexaoxa-3-germonanes, were synthesized by the reaction of 1,1′-dihydroperoxydi(cyclododecyl)peroxide with (di)alkyl(aryl)dihalogengermanes. The new compounds have a higher tendency to undergo hydrolysis compared to silicon-containing analogs. 相似文献
8.
Stephan Matos Camacho 《Discrete Mathematics》2009,309(15):4916-4919
In 1992 Gyárfás showed that a graph G having only k odd cycle lengths is (2k+1)-colourable, if it does not contain a K2k+2. In this paper, we will present the results for graphs containing only odd cycles of length 2m−1 and 2m+1 as done in [S. Matos Camacho, Colourings of graph with prescribed cycle lengths, diploma thesis, TU Bergakademie Freiberg, 2006. [3]]. We will show that these graphs are 4-colourable. 相似文献
9.
10.