基于遗传算法的图像边缘信息链表匹配技术

提出了一种基于遗传算法的图像边缘信息链表匹配方法。首先,采用CANNY算子的方法提取图像边缘;然后,将图像边缘信息链表化;最后,基于链表化结果利用遗传算法进行链表匹配。该方法能够减少匹配过程中的计算量,且能实现高效匹配。通过仿真实验,验证了该方法的性能。     

OFDM系统信道盲估计的一种新算法

利用循环前缀（CP）引入的信息冗余，在利用接受信号的二阶统计特性实现正交频分复用（OFDM）系统信道盲估计的子空间算法基础上，采用矩阵变换的方法，改善信息序列的非周期相关函数，推导出信道估计的新算法。     

An adaptive non‐conforming finite‐element method for Reissner–Mindlin plates

Adaptive algorithms are important tools for efficient finite‐element mesh design. In this paper, an error controlled adaptive mesh‐refining algorithm is proposed for a non‐conforming low‐order finite‐element method for the Reissner–Mindlin plate model. The algorithm is controlled by a reliable and efficient residual‐based a posteriori error estimate, which is robust with respect to the plate's thickness. Numerical evidence for this and the efficiency of the new algorithm is provided in the sense that non‐optimal convergence rates are optimally improved in our numerical experiments. Copyright © 2003 John Wiley & Sons, Ltd.     

基于混合遗传算法的树状注水管网拓扑优化

以投资最小为目标函数,以井间隶属关系的惟一性、连接注水井数量等限制为约束条件,建立了树状注水管网拓扑优化数学模型.根据模型特点,将优化问题分为分配层和几何层,分别采用遗传算法和非线性优化方法进行求解.并对遗传算法的操作过程进行了改进,调整了适应函数,采用随机多父辈适应函数值加权交叉和多种变异操作,结合了模拟退火算法,并给出了初温的确定方法,改进了选择复制操作,从而形成了混合遗传算法.该算法能够有效地提高收敛速度,避免早熟收敛.利用算例说明了该方法的有效性.     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

Banach空间Fuzzy多值隐拟变分包含

在Banach空间中并在不具紧性的条件下，引入和研究了一类fuzzy多值隐拟变分包含及相应的fuzzy隐预解算子方程，借助预解算子技巧，建立了Banach空间中fuzzy多值隐拟变分包含与预解算子方程的等价性，得到了该类fuzzy多值隐拟变分包含的迭代算法与某些解的存在性定理及解的迭代逼近。     

坐标旋转法的收敛性,误差估计及扩展

本文通过推广正规序列的定义,得到一个不等式,由此证明了统一计算初等函数数值的坐标旋转法的收敛性,作了误差估计,并拓广了所计算的函数范围,成为快速计算所有初等函数的统一算法．     

渐变填充的性质和算法

本文着重研究了Jordan数字流形上的渐变填充,设计了紧缩渐变填充算法和分裂渐变填充算法;并证明:如果D是离散网格空间上的Jordan凸集,那么存在O(|D||D|)时间的紧缩算法去做渐变填充.最后,我们对Jordan正方形区域、三角域和圆盘,分别给出了它们各自的O(|D|log_2|D|)时间的分裂渐变填充算法.     

基于广义最小均方的自适应递归滤波算法

本文提出了一种广义最小均方(GLMS)算法,分析了GLMS算法的性能,并根据GLMS算法,导出一种自适应递归滤波(ARF)算法。在推导中,ARF算法避开了超稳定定理,从而考虑自适应系统的严格正实条件和Popov不等式是不必要的。计算机模拟表明ARF算法具有很高的收敛速度。