期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Texture Characteristics of Thin Grain Oriented Silicon Steel Sheet Produced by Cross Shear Rolling 被引量:2
1
作者 Xiuhua GAO, Kemin QI, Renlong LI, Chunlin QIU, Bo MA and Guangrun BAI (Department of Metal Forming, Northeastern University, Shenyang 110006, China) 《Journal of Materials Science & Technology》 SCIE EI CAS CSCD 2000年第2期155-156,共2页
Commercial grain oriented silicon steel was cold rolled to thickness from 0.06 to 0.10 mm by cross shear rolling, then annealed in vacuum or a hydrogen atmosphere furnace. Deformation textures of the sheets were resea... Commercial grain oriented silicon steel was cold rolled to thickness from 0.06 to 0.10 mm by cross shear rolling, then annealed in vacuum or a hydrogen atmosphere furnace. Deformation textures of the sheets were researched by ODF method and reverse pole figure quantitative analyses. The results indicate that: in the condition of the cross shear rolling, the deformation texture of rolled sheet is generally similar to that of conventional rolled sheet, however, the texture distribution through the thickness is asymmetrical. With mismatch speed ratio increasing, the amount of Goss texture increases. With reduction ratio increasing, the intensity of γ-fiber becomes strong. 展开更多
关键词 Texture Characteristics of Thin Grain Oriented Silicon Steel Sheet Produced by Cross Shear Rolling THIN
下载PDF
Pfaffian graphs embedding on the torus 被引量:2
2
作者 ZHANG LianZhu WANG Yan LU FuLiang 《Science China Mathematics》 SCIE 2013年第9期1957-1964,共8页
An orientation of a graph G with even number of vertices is Pfaffian if every even cycle C such that G-V(C) has a perfect matching has an odd number of edges directed in either direction of the cycle. The significance... An orientation of a graph G with even number of vertices is Pfaffian if every even cycle C such that G-V(C) has a perfect matching has an odd number of edges directed in either direction of the cycle. The significance of Pfaffian orientations stems from the fact that if a graph G has one, then the number of perfect matchings of G can be computed in polynomial time. There is a classical result of Kasteleyn that every planar graph has a Pfaffian orientation. Little proved an elegant characterization of bipartite graphs that admit a Pfaffian orientation. Robertson, Seymour and Thomas (1999) gave a polynomial-time recognition algorithm to test whether a bipartite graph is Pfaffian by a structural description of bipartite graphs. In this paper, we consider the Pfaffian property of graphs embedding on the orientable surface with genus one (i.e., the torus). Some sufficient conditions for Pfaffian graphs on the torus are obtained. Furthermore, we show that all quadrilateral tilings on the torus are Pfaffian if and only if they are not bipartite graphs. 展开更多
关键词 Pfaffian graph perfect matching crossing orientation
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部