Differencing and merging of architectural views

Differencing and merging architectural views is an important activity in software engineering. However, existing approaches are still based on restrictive assumptions, such as requiring view elements to have unique identifiers or exactly matching types, which is often not the case in many application domains. We propose an approach based on structural information. We generalize a published polynomial-time tree-to-tree correction algorithm that detects inserts, renames and deletes, into a novel algorithm that additionally detects restricted moves. Our algorithm also supports forcing and preventing matches between view elements. We incorporate the algorithm into tools to compare and merge Component-and-Connector (C&C) architectural views. We provide an empirical evaluation of the algorithm. We illustrate the tools using extended examples, and use them to detect and reconcile interesting differences between real architectural views. This article is an expanded version of the following paper: Abi-Antoun, M., Aldrich, J., Nahas, N., Schmerl, B., and Garlan, D: 2006, ‘Differencing and Merging of Architectural Views’. In: Proceedings of the 21st IEEE International Conference on Automated Software Engineering, pp. 47–58.     

Continuous query processing over music streams based on approximate matching mechanisms

It is foreseen that more and more music objects in symbolic format and multimedia objects, such as audio, video, or lyrics, integrated with symbolic music representation (SMR) will be published and broadcasted via the Internet. The SMRs of the flowing songs or multimedia objects will form a music stream. Many interesting applications based on music streams, such as interactive music tutorials, distance music education, and similar theme searching, make the research of content-based retrieval over music streams much important. We consider multiple queries with error tolerances over music streams and address the issue of approximate matching in this environment. We propose a novel approach to continuously process multiple queries over the music streams for finding all the music segments that are similar to the queries. Our approach is based on the concept of n-grams, and two mechanisms are designed to reduce the heavy computation of approximate matching. One mechanism uses the clustering of query n-grams to prune the query n-grams that are irrelevant to the incoming data n-gram. The other mechanism records the data n-gram that matches a query n-gram as a partial answer and incrementally merges the partial answers of the same query. We implement a prototype system for experiments in which songs in the MIDI format are continuously broadcasted, and the user can specify musical segments as queries to monitor the music streams. Experiment results show the effectiveness and efficiency of the proposed approach.     

基于极坐标区间运算的2D形状匹配

形状匹配是遥感图像目标识别、字符识别、手形识别和步态识别等任务中的关键步骤之一.针对刚体识别任务中形状匹配易受方向、尺度和位置等仿射变化量影响的情况,提出了一种新的基于极坐标区间运算的2D形状匹配算法.该算法首先以形状区域的中心点为极点,区域的最长轴方向为极轴,对形状区域进行归一化的极坐标变换;然后定义了同一角度对应的区域内点区间之间的运算;最后定义了两个区域归一化极坐标变换结果在区间运算下的相似度函数,用以表征两个区域之间的匹配度.从可见光遥感图像中提取的实物图像实验结果证明,该方法能够有效归类相似形状,并能区分各类不同的形状.     

基于眨眼持续时间的司机疲劳检测方法

利用红外敏感的摄像机获得司机脸部图像,通过可变性模板匹配的方法对眼睛进行定位,然后利用卡尔曼滤波的方法跟踪眼睛,得到司机的眨眼持续时间参数,以此为依据判断司机是否疲劳.主要研究了其中的图像处理方法--特征提取算法和眼睛定位、跟踪算法.实验结果证明,眨眼持续时间判断是否疲劳的有效指标.     

干涉超光谱图像的压缩算法

干涉超光谱图像的数据呈现非平稳特性,相邻谱线之间的相关性较弱,所以直接采用小波变换不利于去除数据之间的相关性.提出了一种将光谱数据采用EMD预处理,并对处理后的数据采用分类处理的算法,将每根谱线分为主干涉区域和非主干涉区域两部分,分别采用相似匹配和二次曲线拟合的方法对数据进行分解,避免了相似匹配中不利于硬件实现的开方运算.仿真结果表明:该算法可降低无损压缩输出码率达0.3bpp左右,并且可以提高有损压缩的效率.     

一种改进的公式结构分析方法

结构分析是印刷体数学公式识别系统的关键部分,目前相关研究还很欠缺.针对结构分析的基准线方法的一些不足之处,提出一种逆向匹配方法,并结合语义规则对分析后的数学公式进行后处理.实验表明,提出的方法能够有效提高数学公式结构分析的正确率和鲁棒性.     

基于粗糙集理论的图像平滑算法研究

基于粗糙集理论,针对高斯噪声和脉冲噪声,分别采用高斯模板和中值滤波技术,提出了图像平滑算法.这两种算法在去噪的同时,都能够很好地保持图像细节,并且简单易行、处理速度快、使用范围广.通过实验,该算法对灰度图像和彩色图像的处理效果较之传统的处理方法,质量上有较大的提高.     

一种基于预测的改进的三步搜索算法

基于对运动矢量分布的中心偏向特性研究,结合零运动预判断,提出了一个基于预测的改进的三步搜索算法(PBITSS),有效地提高了运动估计搜索速度并保持较高的搜索精度.实验结果显示,与三步搜索算法(TSS)相比,图像质量和搜索速度都得到了提高,综合性能高于TSS算法.     

中文分词算法解析

中文分词是计算机中文信息处理中的难题,而中文分词算法是其中的核心,但由于中英文环境中语素的不同特点,使得中文必须要解决分词的问题。这篇文章较为深刻的阐述了中分分词的算法,基于对分词算法的理解和对匹配法分词的分析,对最大匹配分词方法进行了较深入的研究探讨,提出了什么算法是解决分词效率的最佳方法以及各种方法的比较优劣等问题,及可能产生的歧义．对不同的算法给予了充分的解释,通过对各种算法的比较,总结出了比较常用和效率较高的算法。     

串匹配算法的简单并行实现

结合BM模式匹配算法和并行计算的思想,提出了一种快速的串匹配并行实现策略,该策略将文本串划分成一定长度的子串,将子串分配到不同的处理器中,在各个处理器中分别并行执行BM模式匹配,即便是在最坏的情况下也能达到较好的时间复杂度。