量子Haar小波变换算法设计及应用

设计了基于通用量子语言Q_language的量子Haar小波变换算法,该算法对于小波变换的应用和量子算法的完善具有重要的意义.分析了3个量子位Haar小波变换过程,给出了量子Haar小波变换算法的Q_language语言描述,并分析得出其时间和空间复杂度,然后给出了实现量子Haar小渡变换应用方法.     

基于非下采样Contourlet和MRF的纹理图像分割

提出了一种基于非下采样Contourlet变换(NSCT)和马尔科夫随机场(MRF)相结合的纹理图像分割算法.算法包括两个步骤,首先通过NSCT实现对图像纹理特征的提取,并使用模糊C-均值完成对图像的初始分割;然后将初始分割结果用 MRF模型表示,通过贝叶斯置信传播得到图像的最终分割结果.实验结果表明,对于纹理图像,该方法在分割错误率、区域一致性以及边缘的准确性方面都比传统小波变换的方法有了明显的改善.     

一种基于启发式搜索的论文元数据提取算法

随着大量的科研论文以电子文档的形式出现, 为了高效地检索这些科研文献资料,从中精确地抽取这些论文头部的元数据信息显得十分有必要.在条件随机场模型的基础上,提出了一种启发式搜索算法来对论文头部的元数据信息进行提取.该算法首先利用文本分块技术和特征提取规则来对文本进行预处理,然后结合条件随机场概率模型利用启发式搜索来进行元数据的提取.实验结果表明,在相同概率模型的基础上,该算法有着较好的性能,在精确度和召回率方面都有了明显的提高.     

逆M序列在机抖激光陀螺消除动态闭锁中的应用

对逆M序列在消除激光陀螺动态闭锁误差中的应用进行了研究和验证.目前多采用M序列对抖动的幅度进行调制来消除激光陀螺动态闭锁误差,而逆M序列与M序列相比不仅满足注入到激光陀螺抖动中的要求,且比M序列有其性质等方面优势.通过理论分析及M序列和逆M序列在消除机抖激光陀螺动态闭锁中实验中的应用对比,实验数据表明逆M序列在消除动态闭锁中的作用要优于M序列.     

光电编码器在齿轮传动误差中的应用

提出了降低传动系统转速,用光电编码器代替圆光栅测量齿轮传动误差信号的思想,对于采集的行星轮系传动误差实验数据进行了有效性的判定,用Burg算法对传动误差信号进行了功率谱密度的AR模型的参数估计,绘制出实验测得的传动误差功率谱密度曲线,对光电编码器测量传动误差结果进行了分析,证明了在低转速情况下,用光电编码器代替圆光栅测量传动误差是行之有效的。     

用于二维不规则排样的离散临界多边形模型

提出了一个用于求解二维不规则排样问题的离散临界多边形模型.Burke等人的BLF算法是求解排样问题的一种有效算法,但其算法对一些特殊实例会产生非法的解.为了解决这个问题,提出了一种基于离散临界多边形模型,并对其正确性作了严格证明.新模型是只含有点和区间的简单模型,在大大降低原问题几何复杂性的同时,也使许多启发式策略可以更容易地求解该问题.计算结果表明,基于离散临界多边型模型的排样算法是很有效的.     

基于group-based模型的无线传感器网络密钥管理方案

由于无线传感器网络受电源、计算能力、内存容量等方面的限制,传统的基于公钥和可信任的密钥管理方式不再适用.为了进一步提高无线传感器网络的安全连通性,在分析DU Wen-liang等人的group-based节点投放模型的基础上,提出了一种改进的密钥管理方案:多密钥空间与多路径增强相结合的随机密钥预分配方案.结果分析表明,该方案需要较少的内存存储空间,不仅提高了系统的连通性,还降低了节点的被捕获概率.     

基于遗传算法的自动组卷系统研究与实现

自动组卷系统是在已有的题库基础上,按照考核目的,按一定算法生成一份满足一定要求的试卷管理系统。计算机如何自动选题形成一套科学合理的试卷算法是最关键的问题,本文首先比较了几种常见的自动组卷方法,然后介绍了遗传算法组卷算法,最后给出了实现方法。     

Detecting Overlapping Community Structures in Networks

Community structure has been recognized as an important statistical feature of networked systems over the past decade. A lot of work has been done to discover isolated communities from a network, and the focus was on developing of algorithms with high quality and good performance. However, there is less work done on the discovery of overlapping community structure, even though it could better capture the nature of network in some real-world applications. For example, people are always provided with varying characteristics and interests, and are able to join very different communities in their social network. In this context, we present a novel overlapping community structures detecting algorithm which first finds the seed sets by the spectral partition and then extends them with a special random walks technique. At every expansion step, the modularity function Q is chosen to measure the expansion structures. The function has become one of the popular standards in community detecting and is defined in Newman and Girvan (Phys. Rev. 69:026113, 2004). We also give a theoretic analysis to the whole expansion process and prove that our algorithm gets the best community structures greedily. Extensive experiments are conducted in real-world networks with various sizes. The results show that overlapping is important to find the complete community structures and our method outperforms the C-means in quality.     

Face detection and recognition of natural human emotion using Markov random fields

This paper presents an integrated system for emotion detection. In this research effort, we have taken into account the fact that emotions are most widely represented with eye and mouth expressions. The proposed system uses color images and it is consisted of three modules. The first module implements skin detection, using Markov random fields models for image segmentation and skin detection. A set of several colored images with human faces have been considered as the training set. A second module is responsible for eye and mouth detection and extraction. The specific module uses the HLV color space of the specified eye and mouth region. The third module detects the emotions pictured in the eyes and mouth, using edge detection and measuring the gradient of eyes’ and mouth’s region figure. The paper provides results from the system application, along with proposals for further research.