低速纺制8.3tex三角异形有光PET长丝——Ⅰ.前纺工艺研究

用VC403纺丝机纺制题示纤维。对设备及工艺进行了改进:在切片干燥前加入0.01%的硬酯酸钙,以增加切片的润滑性能;干燥升温阶段放慢升温速率,冷却阶段通入减湿空气。在切片含水率≤0.006%的情况下,纺丝温度应控制比同规格半消光PET高8—12℃;吹风温度为40—50℃,吹风速度0.2—0.3m/s;加强喷丝板保温;改进吹风窗结构及设计水字形喷丝孔形。     

Connectivity compression of triangle meshes based on geometric parameter predict

An efficient encoding algorithm for lossless compression of triangle mesh connectivity is presented to further optimize the compression ratio. The algorithm firstly cuts a given mesh into a cutaway graph, then uses a triangle nodes tree to present the graph, containing the triangle strips topology information on the graph in the adjacency relationships between the leaf nodes and the branch nodes, reducing the mesh topology information needed to be encoded. Finally, we use the minimum interior angle maximum principle to predict the internal topology of the triangle strips, only encoding the prediction error elements, thus further reducing the information needed to be encoded. Compared with the current compression algorithms, this algorithm does not traverse the triangular mesh, only encoding and storing a small amount of mesh topology information and prediction information. Experimental results show that the algorithm can greatly reduce the compression ratios and process various triangle meshes.     

基于三角模算子的RPL协议路由优化算法

针对当前低功耗有损网络拓扑构建及路径选择的参考度量单一,能量均衡性差的问题,提出了一种基于三角模算子的RPL协议路由优化算法。本文阐述了低功耗有损网络路由协议的网络拓扑构建机理和路由过程,基于三角模融合算法,重新定义了网络节点的能量指标和逻辑距离隶属度并进行了融合,更为合理地进行父节点选定,实现数据采集传输业务可靠性和有效性的进一步提升,最后通过实验仿真验证了改进后的路由协议性能。     

异构不规则无线传感器网络的定位算法

异构WSN节点在感知对象时由于遮蔽效应引起感测半径不规则,为了解决传播路径上的因障碍物遮挡引起的损耗,先求出传感器节点的感知半径,再利用Fuzzy集中最大最小法求出贴近度;然后选出一定数量满足实际需要的最大的前k个节点构成区域,求出该区域的质心坐标,即为定位坐标,为了降低算法复杂度,提出了近似算法,同时对该算法的定位误差进行了分析;最后与SBL算法进行了比较,实验表明,该算法在不同半径时平均定位率均高于SBL算法,并且定位精度随着样本点个数的增加而增大.     

Invariant representation of facial expressions for blended expression recognition on unknown subjects

Facial expressions analysis plays an important part in emotion detection. However, having an automatic and non-intrusive system to detect blended facial expression is still a challenging problem, especially when the subject is unknown to the system. Here, we propose a method that adapts to the morphology of the subject and that is based on a new invariant representation of facial expressions. In our system, one expression is defined by its relative position to 8 other expressions. As the mode of representation is relative, we show that the resulting expression space is person-independent. The 8 expressions are synthesized for each unknown subject from plausible distortions. Recognition tasks are performed in this space with a basic algorithm. The experiments have been performed on 22 different blended expressions and on either known or unknown subjects. The recognition results on known subjects demonstrate that the representation is robust to the type of data (shape and/or texture information) and to the dimensionality of the expression space. The recognition results on 22 expressions of unknown subjects show that a dimensionality of the expression space of 4 is enough to outperform traditional methods based on active appearance models and accurately describe an expression.     

摄影测量中一种非编码点的自动匹配方法

在极限约束法基础上提出了一种非编码点匹配的改进算法,首先采用极限约束法得到候选匹配对应点,然后按编码点位置将图像Delaunay三角化,缩小匹配范用。在对应Delaunay三角形内确定匹配点,若在三角形范围内仍不能唯一的确定匹配点,则通过交比不变性来实现对应点的匹配。本方法不限制标志点的粘贴位置,满足摄影测量中实际应用要求。     

梯图的点可区别全染色（n≡4（mod8））

一个图的全染色被称为点可区别的即对任意两个不同点的相关联元素及其本身所构成的色集合不同,其中所用的最少颜色数称为G的点可区别全色数。本文定义了一种排序方法：三角排序。利用该排序的结果证明了当n≡4（mod8）和C4n-1/2＋2〈m≤C4n/2＋2时,梯图Lm■Pm×P2的点可区别全色数为n。     

基于测地路径的牙齿模型交互分割算法研究

从3维牙颌模型中精确地分离出单颗牙齿是计算机辅助正畸治疗的重要步骤。由于牙齿有不同的形状并且不同个体之间有很大差异,其自动分离比较困难。为此,提出一种交互分割单颗牙齿的方法：首先,在牙颌模型上交互选定特征点,然后计算特征点间近似测地路径,待测地路径封闭后,利用区域生长方法从整个牙颌模型上精确分离出单颗牙齿。实验结果显示,该算法执行速度快,用户交互量少,且分割得到的牙齿边界线平滑,较好地满足口腔正畸的临床要求。     

基于三角形和正方形的NAM灰度图像表示方法研究

非对称逆布局模型(NAM)适用于图像模式、语音模式、文本模式、视频模式的表示,是一个通用的模式表示模型。图像表示是计算机图形学、计算机视觉、机器人、图像处理和模式识别等领域里的一个重要问题。借助于三角形和正方形Packing问题的思想,本文提出了一种基于三角形和正方形的NAM灰度图像表示方法,简称NAMTS表示方法。给出了灰度图像的NAMTS表示算法,并对其存储结构和总数据量进行了详细分析。理论分析和实验结果表明:与经典的基于线性四元树的表示方法相比,基于三角形和正方形的NAM灰度图像表示方法能更有效地减少子模式数和数据存储空间,是灰度图像的一种良好的表示方法。     

Fault tolerance in cellular automata at high fault rates

A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply remembering a bit in the presence of faults, and that is the case we treat in this paper. We are concerned with the degree (the number of neighboring cells on which the state transition function depends) needed to achieve fault tolerance when the fault rate is high (nearly 1/2). We consider both the traditional transient fault model (where faults occur independently in time and space) and a recently introduced combined fault model which also includes manufacturing faults (which occur independently in space, but which affect cells for all time). We also consider both a purely probabilistic fault model (in which the states of cells are perturbed at exactly the fault rate) and an adversarial model (in which the occurrence of a fault gives control of the state to an omniscient adversary). We show that there are cellular automata that can tolerate a fault rate 1/2−ξ (with ξ>0) with degree O((1/ξ²)log(1/ξ)), even with adversarial combined faults. The simplest such automata are based on infinite regular trees, but our results also apply to other structures (such as hyperbolic tessellations) that contain infinite regular trees. We also obtain a lower bound of Ω(1/ξ²), even with only purely probabilistic transient faults.