Application of CO2 laser heating zone drawing and zone annealing to nylon 6 fibers

Nlon 6 fibers were zone drawn and zone annealed by using a continuous wave carbon dioxide laser to develop their mechanical properties. A laser‐heating zone drawing was carried out under a applied tension of 35.4 MPa at a power density of 9.65 W · cm^?2, and then the zone‐drawn fiber was annealed. A laser‐heating zone annealing was carried out in two steps at a power density of 9.65 W · cm^?2; the first step was carried out under 423 MPa and the second under 517 MPa. The treating temperature of the fiber heated by the CO₂ laser was measured by using an infrared thermographic camera equipped with a magnifying lens. The treating temperature at the zone drawing is 138°C, and those at the first and the second zone annealing are 121 and 125°C, respectively. The second laser‐heated zone‐annealed fiber has a birefringence of 65.2 × 10^?3, a degree of crystallinity of 54%, and a storage modulus of 21 GPa at 25°C. Wide‐angle X‐ray diffraction patterns for the laser‐heated zone‐drawn and the zone‐annealed fibers show (200) reflection and (002/202) doublet due to only an α form on the equator. The laser‐heated zone‐drawn fiber has a melting endotherm peaking at 216°C and a trace of shoulder on the higher temperature side of its peak, and the laser‐heated zone‐annealed fibers have a single melting endotherm peaking at 216°C. © 2002 Wiley Periodicals, Inc. J Appl Polym Sci 83: 1711–1716, 2002     

基于相位测量的微波位移测量方法

为满足建筑结构全天候、高精度及低成本的位移监测要求,提出了基于相位测量的微波位移测量方法。该方法以微波作为全天候测量信号,利用高精度相位测量实现高精度位移监测,并采用低成本的标准频率器件搭建位移测量系统。实验结果表明:系统位移测量精度可达0.12 mm,并验证了系统具有全天候、高精度、低成本的位移监测特性。     

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绘图的特性以及应用前景。     

基于APIC的高精度定时器设计

在操作系统开发过程中需要一定精度的计时器支持。在Windows实时扩展改造过程中,针对原有定时精度低和波动较大的问题,提出一种基于高级可编程中断控制器(APIC)的高精度定时器设计方案。利用CPU片上结构APIC的计数寄存器编程,构建高精度时钟。运用内核驱动建立内核调度管理,通过内存映射提高用户态到内核态的数据传输速度,保证实时性能。利用DLL提供一组和内核交互的定时器接口供用户使用。实验结果表明,该方案有效解决了定时精度和稳定性问题,构造的定时器性能稳定,具有良好的实用性。     

基于A-VFSA粒子发生器的PSO算法的研究

对超快速模拟退火算法进行改进(A-VFSA),并以此为粒子发生器,提出了PSO-PG算法.该算法通过粒子发生器对搜索域内粒子进行改进,从而生成一个精英粒子池;并根据随机策略从粒子池中选择粒子,作为初始种群,采用PSO算法进行优化,得到全局最优解.相比于标准PSO算法和LDW算法,PSO-PG算法拥有更好的稳定性和优化精度,能够更加快速地收敛到全局最优解,在一定范围内几乎不依赖于初始参数的选择.