A dynamic fuzzy clustering method based on genetic algorithm

A dynamic fuzzy clustering method is presented based on the genetic algorithm. By calculating the fuzzy dissimilarity between samples the essential associations among samples are modeled factually. The fuzzy dissimilarity between two samples is mapped into their Euclidean distance, that is, the high dimensional samples are mapped into the two-dimensional plane. The mapping is optimized globally by the genetic algorithm, which adjusts the coordinates of each sample, and thus the Euclidean distance, to approximate to the fuzzy dissimilarity between samples gradually. A key advantage of the proposed method is that the clustering is independent of the space distribution of input samples, which improves the flexibility and visualization. This method possesses characteristics of a faster convergence rate and more exact clustering than some typical clustering algorithms. Simulated experiments show the feasibility and availability of the proposed method.     

生物机制在智能计算中的应用

揭示生物机制在智能计算中的应用。与生物学相关理论相结合 ,论述遗传算法、人工神经网络和DNA计算的生物机制 ,揭示生物学思想在其中的应用 ,说明现在各类学科交叉发展的趋势     

一种基于轮廓特征的图像拼接算法设计与实现

提出了一种新的基于轮廓特征的图像拼接算法。在特征提取阶段 ,对卷积图进行增强 ,并用区域增长方法进行辅助校正 ,能改善轮廓提取效果 ;在特征表示方面 ,用形状签名代替链码来描述轮廓 ,从而提高了计算速度 ,降低了由噪声干扰和镜头形变造成的影响。实验结果表明 ,该算法在速度上优于基于链码的配准算法 ,准确率高 ,并且可以适用于未经过几何形变校正的图像的配准与拼接。     

二维装配图的快递交点排序裁剪算法

提出一个任意多边形的快速交点排序线裁剪算法,该算法简单快捷,效率高,并将其成功用于工程装配图的二维消隐。解决了大多数算法将凹多边形裁剪分解为凸多边形处理存在计算时间长、难度大等问题。     

Automatic evolutionary modeling by the Lattice-Boltzmann method

The Lattice-Boltzmann method is an effective tool for solving fluid mechanics problems, but there isn’t still a good scheme to determinate some parameters in Boltzmann equations. In this paper, a technique using evolutionary algorithm to automatically model Boltzmann equations is introduced. Numerical simulation shows that the designed scheme is fast and efficient. Biography: Chen Ju-hua ( 1963-), male, Associate professor, research direction: Lattice-Boltzmann method, evolutionary algorithm.     

An iterative algorithm in potential-field inversion

1　Principle and MethodAll the problems of potential- field inversioncan be concluded that of solving nonlinear functionas follows:b =f( x) ( 1 )where x =( x1,x2 ,… .xn) T,xj( j =1 ,2 ,… ,n)indicate geometricparameters and physical parame-ters of the object;b=( b1,b2 ,… ,bm) T,bi( i=1 ,2 ,… ,m) indicate potential- field measurements.Main algorithms for expression( 1 ) are leastsquare method ( include damping least squaremethod ) ,gradient method ( conjugate gradientmethod and variable met…     

一种用于多峰函数优化的改进混合遗传算法

针对遗传算法在处理复杂多峰函数优化问题中存在的一些缺陷，提出了一种改进型的混合遗传算法，它在小生境技术的基础上引入单纯搜索算法、最优保存算法和近优淘汰算法，并使之相互结合，经编程实践证明，这种改进的混合遗传算法在处理复杂多峰函数优化问题时，局部搜索能力和克服过早收敛能力方面都显著优于标准遗传算法，并在实际应用中取得了较好的效果。     

基于Turbo编码和二进制脉冲位置调制的快跳频光码分多址系统

在不考虑噪声和仅考虑散粒噪声两种情况下，分析了Turbo码对二进制脉冲位置调制(BPPM)的快跳频光码分多址(FFH OCDMA)系统性能的影响，并对该系统进行了数值模拟。结果表明，Turbo码对BPPM调制的FFH OCDMA系统性能有明显的改善。     

某第二类Fredholm积分方程的一种数值解法

我们考虑第二类 Fredholm积分方程的快速数值解法 .本文假设核函数除在 x=t处带有弱奇性外 ,是解析的 [1] .我们利用分片多项式插值逼近核函数 ,由此得到近似的系数矩阵 A.设 n为积分节点的个数 ,k2为每个小区域的插值节点数 ,我们证明矩阵 A的计算和矩阵 -向量相乘 Ax各需要 O( nk)次运算 ,存贮 A需要占用 O( nk)内存 .最后我们对算法的稳定性进行讨论并给出数值结果