ADAPTIVE RANKS CLONE AND k‐NEAREST NEIGHBOR LIST–BASED IMMUNE MULTI‐OBJECTIVE OPTIMIZATION

Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The AIS‐based algorithms typically exploit the immune system's characteristics of learning and adaptability to solve some complicated problems. Although, several AIS‐based algorithms have proposed to solve multi‐objective optimization problems (MOPs), little focus have been placed on the issues that adaptively use the online discovered solutions. Here, we proposed an adaptive selection scheme and an adaptive ranks clone scheme by the online discovered solutions in different ranks. Accordingly, the dynamic information of the online antibody population is efficiently exploited, which is beneficial to the search process. Furthermore, it has been widely approved that one‐off deletion could not obtain excellent diversity in the final population; therefore, a k‐nearest neighbor list (where k is the number of objectives) is established and maintained to eliminate the solutions in the archive population. The k‐nearest neighbors of each antibody are founded and stored in a list memory. Once an antibody with minimal product of k‐nearest neighbors is deleted, the neighborhood relations of the remaining antibodies in the list memory are updated. Finally, the proposed algorithm is tested on 10 well‐known and frequently used multi‐objective problems and two many‐objective problems with 4, 6, and 8 objectives. Compared with five other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, IBEA, HYPE, and NNIA, our method achieves comparable results in terms of convergence, diversity metrics, and computational time.     

Stable local dimensionality reduction approaches

Dimensionality reduction is a big challenge in many areas. A large number of local approaches, stemming from statistics or geometry, have been developed. However, in practice these local approaches are often in lack of robustness, since in contrast to maximum variance unfolding (MVU), which explicitly unfolds the manifold, they merely characterize local geometry structure. Moreover, the eigenproblems that they encounter, are hard to solve. We propose a unified framework that explicitly unfolds the manifold and reformulate local approaches as the semi-definite programs instead of the above-mentioned eigenproblems. Three well-known algorithms, locally linear embedding (LLE), laplacian eigenmaps (LE) and local tangent space alignment (LTSA) are reinterpreted and improved within this framework. Several experiments are presented to demonstrate the potential of our framework and the improvements of these local algorithms.     

基于混合聚类的城市道路多时段控制研究*

多方案控制具有简单实用、可靠性好,稳定性高,性价比高等的优点,在城市交通控制中得到了广泛应用。本研究在利用指数平滑异同移动平均法对缺失交通数据进行修补的基础上,运用快速聚类与系统聚类相结合的混合聚类方法对交通数据进行分析,并以经典的Silhouttte评价指标作为聚类终止条件,同时兼顾/考虑了交通数据时序性,消除聚类结果中的三类“奇异点”,最后利用交通信号配时软件SYNCHRO制定了相应时段的控制方案。相关的案例分析显示,优化后的多时段控制方案可以更好地适应交通流的波动,车均延误减少9.79%,其中时序性考虑可以有效改善控制方案频繁切换对交通流的扰动,避免其负效应对混合聚类改善效果的影响。     

基于双链式存储的可靠通信网合并

本文介绍图的双链式存储结构在可靠通讯网合并算法中的应用.     

Globally stable adaptive robust tracking control using RBF neural networks as feedforward compensators

In previous adaptive neural network control schemes, neural networks are usually used as feedback compensators. So, only semi-globally uniformly ultimate boundedness of closed-loop systems can be guaranteed, and no methods are given to determine the neural network approximation domain. However, in this paper, it is showed that if neural networks are used as feedforward compensators instead of feedback ones, then we can ensure the globally uniformly ultimate boundedness of closed-loop systems and determine the neural network approximation domain via the bound of known reference signals. It should be pointed out that this domain is very important for designing the neural network structure, for example, it directly determines the choice of the centers of radial basis function neural networks. Simulation examples are given to illustrate the effectiveness of the proposed control approaches.     

装甲车车身自动调平系统原理及算法设计

为了提高6点装甲车辆调平的快速性和稳定性,根据装甲车结构,考虑响应时间、速度和可靠性等综合因素,将车身系统由6点调平系统等效为4点调平系统。利用相应的角度和压力传感器检测车架的水平状态,以确定油气簧的动作量。采用双速调整的方法计算比例阀门的开启大小及时间,运用西门子控制器实现对调平系统的控制。试验结果表明,该系统具有较高的快速性和稳定性。