具快速增长非线性定态Cahn-Hilliard方程解的遍历有限性

考虑具快速增长非线性项的定态Ｃａｈｎ－Ｈｉｌｌｉａｒｄ方程的Ｎｅｕｍｍａｎ边值问题,证明了解的有限性和遍历有限性。     

一类CA的遍历理论

一类特殊CA的遍历理论。主要结果有：关于这类CA的Ruelle's Perron Frobenius定理;Gibbs测度的存在性;平衡态的唯一性。     

冗余拓扑图简易遍历算法的研究与应用

简单图遍历算法已经非常成熟,但是还没有完善的冗余拓扑图遍历算法。本文提出了一种简易的冗余拓扑图遍历算法。它基于简单图的遍历算法,将带有冗余链路的拓扑图转化为不带冗余链路的简单拓扑图进行遍历。通过在计算机网络虚拟实验系统中的应用,证明了此算法的可行性和正确性。     

一种新的基于混沌序列的图像分块加密方法

给出一种新的图像置乱加密算法并进行实验验证.首先给定一对初始值和参数,以此作为密钥生成混沌序列及其主遍历矩阵,把一幅较大的图像分解为适当大小的图像子块,根据混沌序列的主遍历矩阵,对图像子块进行置乱;然后再选择另一对初始值和参数,生成一个新的混沌序列及其主遍历矩阵,以该主遍历矩阵对图像的每个子块进行置乱加密;最后,把加密后的图像隐藏到一幅适当的载体图像中.     

族F-遍历与F-混合

本文给出族F-遍历,族F-强混合,族F-弱混合,族F-2混合,族F-一致混合和族F-Césaro一致混合的概念,研究了它们的性质、判定及相互关系,并且讨论了对于连续变换的不变测度的族F-遍历和族F-混合的刻划.     

一种改进的Splatting体绘制方法

Splatting方法是一种基于物序的直接体绘制方法，由于要提前将重构核积分成二维的足迹表，故并不能生成很精确的图像，并且Splatting中较流行的sheet—buffer方法会带来popping问题。该文通过定义平行于视平面的view—buffer，采用平行于view—buffer的体素遍历方法，并根据预先计算好的三维查找表，来改善经典Splatting算法。该方法能很好地消除体旋转过程中的popping现象，还能得到更高质量和更精细的绘制结果。     

三类三角剖分的对角线翻转距离

在对凸n(n》7)边形的三类特殊形态三角剖分研究基础上,证明三类三角剖分的对角线翻转距离,从而求得三类三角剖分对角线翻转距离的上下界,并且通过三角剖分与二叉树之间的对应关系,给出与这三类三角剖分相对应的二叉树之间的旋转距离.     

Human resources allocation for aircraft maintenance with predefined sequence

There are always large-scale items in the maintenances schedule of aircraft system, many of which have been fixed to be done in predefined sequences, which leads the workflow to be systematically complex and makes this kind of problem quite different from all sorts of existing job-selection modes. On the other hand, the human resources are always limited and men have different working capabilities on different items, which make the allocation operation of human resources be much roomy. However, the final total time span of maintenance is often required to be as short as possible in many practices, in order to suffer only the lowest cost of loss while the system is stopping. A new model for optimizing the allocation if aircraft maintenance human resources with the constraint of predefined sequence is presented. The genetic algorithm is employed to find the optimal solution that holds the shortest total time span of maintenance. To generate the ultimate maintenance work items and the human resource array, the sequences among all maintenance work items are considered firstly, the work item array is then generated through traversal with the constraint of maintenance sequence matrix, and the human resources are finally allocated according to the work item array with the constraint of the maintenance capability. An example is demonstrated to show that the model and algorithm behave a satisfying performance on finding the optimal solution as expected.     

基于分离程度的二叉树的多类SVM在焊接缺陷分类和识别中的应用

本文提出了基于分离程度的SVM决策树的焊缝缺陷分类识别方法。首先对X射线焊缝图像进行缺陷特征提取,然后结合聚类的思想,定义了分离程度,每次将分离程度最大的缺陷类分离出来,成功解决了传统欧氏距离不能处理的类交叉分类情况,得到了累积误差更小的决策树。将基于分离程度的二叉树的多类SVM算法运用于X射线焊接缺陷图像的分类识别,通过计算机仿真,表明该方法比其它SVM多分类算法在分类精度和识别效果方面有明显的提高。