Bit-parallel approximate string matching algorithms with transposition

Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms.     

Tomographic reconstruction using heuristic Monte Carlo methods

A tomographic reconstruction method based on Monte Carlo random searching guided by the information contained in the projections of radiographed objects is presented. In order to solve the optimization problem, a multiscale algorithm is proposed to reduce computation. The reconstruction is performed in a coarse-to-fine multigrid scale that initializes each resolution level with the reconstruction of the previous coarser level, which substantially improves the performance. The method was applied to a real case reconstructing the internal structure of a small metallic object with internal components, showing excellent results.     

《图雅的婚事》：图雅的爱情救赎

影片《图雅的婚事》是导演由纯个人化表达向电影故事性转变的探索，因此更注重电影叙事表达和影像表意性。影片贴近于普通人的现实生活，表现真实的生活质感，赞扬人类面对无奈命运时自我救赎的乐观坚忍精神。     

从像上提取非旋转对称系统的传递函数制作解卷空间滤波器

本文提出从高分辨电子显微像中,利用光学、全息和部分相干等方法,提取传递函数,制作相位和振幅滤波器,实现解卷,提高高分辨电子显微像的分辨率.     

基于图像处理技术的束流剖面监视系统

 介绍了在兰州重离子加速器上利用荧光靶图像获取装置测量并计算束流剖面参数的方法，并建立了图像获取、处理、束流参数计算的实时测量软件系统。该系统具有可靠性好、测量直观、界面友好等优点。     

匹配问题实例空间和解空间结构

本文通过研究匹配问题的实例空间，匈牙利算法和解空间三者之间的关系，指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的，而如何对问题的解空间进行合理的分解才能是问题的关键。     

Fold‐2‐covering triangular embeddings

For a graph G and a positive integer m, G_(m) is the graph obtained from G by replacing every vertex by an independent set of size m and every edge by m² edges joining all possible new pairs of ends. If G triangulates a surface, then it is easy to see from Euler's formula that G_(m) can, in principle, triangulate a surface. For m prime and at least 7, it has previously been shown that in fact G_(m) does triangulate a surface, and in fact does so as a “covering with folds” of the original triangulation. For m = 5, this would be a consequence of Tutte's 5‐Flow Conjecture. In this work, we investigate the case m = 2 and describe simple classes of triangulations G for which G₍₂₎ does have a triangulation that covers G “with folds,” as well as providing a simple infinite class of triangulations G of the sphere for which G₍₂₎ does not triangulate any surface. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 79–92, 2003     

象质评价中光学孔径与波象差的最佳匹配

导出了光学孔径与波象差共同决定成象质量的一些关系式，并从理论和实践两方面找出上述两参数的最佳匹配范围。文中得出的结果与以往传统的象质评价判据有明显的区别。     

液体可视图象序列中杂质小目标的检测方法

在分析红外图象和视图象差异的基础上，研究了一种适用于可视图像序列的运动小目标检测算法。受目标影响的象素点具有较弱的时间相关性，即相对普通象素点有较大的时间方差，根据此特征，用管道更新的方法产生新方差图象序列，再用管道更新的方法累积，增加信噪比，然后用基于统计均值的自适应门限方法分割出目标，最后将原图象的梯度倒数作为象素点强度的加权，有效地抑制灰度突变边界的传感器噪音，保存目标点。