期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Application of a Cleaning System Made up of a Centrifugal Fan with Double Channel and One Sieve to Combine
1
作者 Shen Dechao(Northeast Agricultural University. Harbin 150030, PRC) 《Journal of Northeast Agricultural University(English Edition)》 CAS 1995年第2期142-151,共10页
In this paper the application of a cleaning system which was made up of a centrifugal fan with double channel and one sieve to 4LZ-3.5 combine was introduced. This cleaning system with double channel compared with the... In this paper the application of a cleaning system which was made up of a centrifugal fan with double channel and one sieve to 4LZ-3.5 combine was introduced. This cleaning system with double channel compared with the traditional air-sieve cleaning system of combines may omit one two sieves and simplify the transmission mechanism. It is also compared with the present cleaning system with double channel applied to some combines, such as the Commandor 112CS/ 228CS combines of Claas Corporation in Germany and the MAXIMIZERTMombincs of John Deerc company in U.S.A. It may omit one sieve and the preclcaner and simlify the transmission mechanism. The measuring results indicated that the cleaning ratio of wheat grain is 99.1% and the cleaning loss ratio of wheat is 0.17% when the feed rate is 4.01 kg/ s. 展开更多
关键词 APPLICATION Centrifugal fan with double channel Cleaning system
下载PDF
Gracefulness of Two Kinds of Unconnected Graphs with Even Vertices
2
作者 WEN Xiaoyan WANG Tao SUI Lili 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2022年第3期185-188,共4页
Two kinds of unconnected double fan graphs with even vertices,(P^((1))_(1)∨(P^((1))_(2n)∪P^((2))_(2n)))∪P_(2n+1)∪(P_(1)^((2))∨K_(2n))and(P_(1)^((1))∨(P^((1))_(2n)∪P^((2))_(2n)))∪(P_(1)^((2))∨K_((1))^(2n))∪(P... Two kinds of unconnected double fan graphs with even vertices,(P^((1))_(1)∨(P^((1))_(2n)∪P^((2))_(2n)))∪P_(2n+1)∪(P_(1)^((2))∨K_(2n))and(P_(1)^((1))∨(P^((1))_(2n)∪P^((2))_(2n)))∪(P_(1)^((2))∨K_((1))^(2n))∪(P^((3))_(1)∨K_((2))^(2n))were presented.For natural number n∈N,n≥1,the two graphs are all graceful graphs,where P^((1))_(2n),P^((2))_(2n)are even-vertices path,P_(2n+1)is odd-vertices path,K_(2n),K^((1))_(2n),K^((2))_(2n)are the complement of graph K_(2 n),G_(1)∨G_(2)is the join graph of G_(1)and G_(2). 展开更多
关键词 unconnected graph double fan graph graceful graph graceful label even vertices
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部