生产碳纤维的关键设备——碳化炉

具有耐热梯型结构的有机预氧丝经过高温热处理转化为含碳量在92%以上的无机碳纤维。实现这一转化的关键设备是碳化炉。工程实践与研究表明:其核心技术是宽口碳化炉及其配套的迷宫密封、废气排除和牵伸系统。对于ht级碳纤维生产线,炉口宽度需在1m以上,而且要正压操作,就需非接触式迷宫密封装置;为使热解废气不污染纤维,排除系统要畅通而瞬时排出;牵伸系统则是制造高性能碳纤维重要手段。     

国产短程纺牵联合机纺制烟用聚丙烯丝束的工艺研究

用国产SLHP001短程纺牵联合机和SLHP 101丝束加工联合机,通过选择合理生产工艺,着眼于提高纤维的刚性和膨松性,研制出了高质量的烟用聚丙烯丝束。不加胶粘剂成型的滤棒(120mm),圆周稳定,硬度达到88%—89.5%,吸阻为3.2-3.4kPa,产出率达到125万支/t,比国内同类产品高15—20万支/t。     

轻型高效精馏塔的计算机辅助设计

论述了在Win9x操作环境下，用Visual Baisc 6.0可视化语言设计界面，用Microsoft Access建立数据库，用Auto CAD VBA编辑绘图程序，以Auto CAD作为平台，开发设计轻型高效精馏塔辅助设计软件。通过对实际设计结果的检验与试用，该软件具有良好的用户界面、人机对活功能和图形功能，使用简单方便，输入初始条件即可设计并绘制出塔结构图。     

电致发热多孔碳化硅陶瓷的绝缘涂层

以异丙醇铝{Al[OCH(CH3)2]3}为原料,用溶胶-凝胶法制备氧化铝(Al2O3)溶胶,然后再以碳化硅(SiC)多孔陶瓷为基体,用浸渍提拉法对陶瓷进行涂层,涂覆完成后进行热处理即可在陶瓷表面和孔隙内部形成致密的Al2O3涂层.当涂层后的陶瓷用作电加热元件时,就可以达到陶瓷和流体绝缘的目的.从扫描电镜照片可以看出:在陶瓷表面及其孔隙内部确实涂覆了Al2O3涂层.Al2O3具有高电阻系数、高介电常数,抗氧化、耐腐蚀性等优异性能,所以,涂层后陶瓷的电阻率明显增加,可以弥补电致发热过程可能引起危险性的缺陷.Al2O3的涂覆也很好地改善了陶瓷成分SiC的氧化问题.结果表明:涂层中Al2O3的质量分数(下同)为43.1%,二氧化硅(SiO2)为38.8%,硅(Si)为18.1%.Al2O3是涂层物质的主要成分,SiO2有两种来源,一是作为基体的多孔陶瓷在渗硅过程中的剩余硅在陶瓷冷却过程中氧化生成存留于陶瓷中;二是陶瓷中的剩余硅在涂层的热处理过程中再次氧化形成.所以SiO2的含量相对较高,其中的硅显然就是陶瓷中的残留硅.     

Drawing non‐layered tidy trees in linear time

The well‐known Reingold–Tilford algorithm produces tidy‐layered drawings of trees: drawings where all nodes at the same depth are vertically aligned. However, when nodes have varying heights, layered drawing may use more vertical space than necessary. A non‐layered drawing of a tree places children at a fixed distance from the parent, thereby giving a more vertically compact drawing. Moreover, non‐layered drawings can also be used to draw trees where the vertical position of each node is given, by adding dummy nodes. In this paper, we present the first linear‐time algorithm for producing non‐layered drawings. Our algorithm is a modification of the Reingold–Tilford algorithm, but the original complexity proof of the Reingold–Tilford algorithm uses an invariant that does not hold for the non‐layered case. We give an alternative proof of the algorithm and its extension to non‐layered drawings. To improve drawings of trees of unbounded degree, extensions to the Reingold–Tilford algorithm have been proposed. These extensions also work in the non‐layered case, but we show that they then cause a O(n²) run‐time. We then propose a modification to these extensions that restores the O(n) run‐time. Copyright © 2013 John Wiley & Sons, Ltd.     

Group‐in‐a‐Box Meta‐Layouts for Topological Clusters and Attribute‐Based Groups: Space‐Efficient Visualizations of Network Communities and Their Ties

An important part of network analysis is understanding community structures like topological clusters and attribute‐based groups. Standard approaches for showing communities using colour, shape, rectangular bounding boxes, convex hulls or force‐directed layout algorithms remain valuable, however our Group‐in‐a‐Box meta‐layouts add a fresh strategy for presenting community membership, internal structure and inter‐cluster relationships. This paper extends the basic Group‐in‐a‐Box meta‐layout, which uses a Treemap substrate of rectangular regions whose size is proportional to community size. When there are numerous inter‐community relationships, the proposed extensions help users view them more clearly: (1) the Croissant–Doughnut meta‐layout applies empirically determined rules for box arrangement to improve space utilization while still showing inter‐community relationships, and (2) the Force‐Directed layout arranges community boxes based on their aggregate ties at the cost of additional space. Our free and open source reference implementation in NodeXL includes heuristics to choose what we have found to be the preferable Group‐in‐a‐Box meta‐layout to show networks with varying numbers or sizes of communities. Case study examples, a pilot comparative user preference study (nine participants), and a readability measure‐based evaluation of 309 Twitter networks demonstrate the utility of the proposed meta‐layouts.     

Skeleton-enhanced line drawings for 3D models

We present a novel line drawing approach for 3D models by introducing their skeleton information into the rendering process. Based on the silhouettes of the input 3D models, we first extract feature lines in geometric regions by utilizing their curvature, torsion and view-dependent information. Then, the skeletons of the models are extracted by our newly developed skeleton extraction algorithm. After that, we draw the skeleton-guided lines from non-geometric regions through the skeleton information. These lines are combined with the feature lines to render the final line drawing result using the line optimization. Experimental results show that our algorithm can render line drawings more effectively with enhanced skeletons. The resulting artistic effects can capture the local geometries as well as the global skeletons of the input 3D models.     

以写字本为例辨析Canvas绘图机制的优劣

通过比较SVG和Canvas两种绘图机制,辨析了使用Canvas在网页中绘图方案的优缺点。使用一个在线写字本案例,论述了Canvas捕获用户的鼠标事件根据用户输入来绘图的过程。最后总结了Canvas绘图的特性以及应用前景。     

基于人脸特征和线积分卷积的肖像素描生成

为了更好地模拟素描的笔画和突显肖像素描中五官的部分,提出基于人脸特征和线积分卷积的肖像素描生成方法.首先进行人脸分割,由人脸特征点确定GrabCut算法中每个特征的初始trimap,然后根据分割结果使用线积分卷积算法绘制肖像素描.文中使用了基于分割结果的多分辨率白噪声和方向场,并提出了基于分割结果的自适应性边界提取算法.实验结果表明,该算法改善了肖像素描的生成效果.