comparable topology

To increase convergence rate and mapping accuracy,and realize visualized topology map,the self-organizing map(SOM)network algorithm is improved with Voronoi vector.

根据SOM网络原理,采用Voronoi向量改进了SOM网络算法,提高了其收敛速度和映射精度,实现了可视拓扑映射图。

Sequence pseudoorbit tracing property is defined,and a sufficient condition on topological transitive is given.

给出序列伪轨跟踪性的定义 ,得到拓扑可迁的一个充分条件 。

In addition,it gives several equivalent propositions of topologically transitive in the sense of semigroup action.

引进了半群的拓扑强混合性和Devaney混沌,证明了在半群S连续作用的紧致度量空间X中,半群S的拓扑强混合性蕴含半群S作用是Devaney混沌的,同时给出了半群S作用的拓扑可迁的几个等价命题。

Gaussian dynamic particle swarm with several canonical topologies and varying topology are tested on five benchmark functions which are commonly used in the evolutionary computation.

针对传统粒子群优化算法中全连接型拓扑和环形拓扑的特点,引入了一种粒子群信息共享方式——多簇结构,进而基于多簇结构提出了动态可变拓扑策略以协调动态概率粒子群优化算法的勘探和开采能力,并从理论上分析了最优信息在各种拓扑中的传播,同时从图论角度分析了几种经典拓扑以及动态可变多簇结构的统计特性。