肠道杆菌的扫描电镜观察

我们用扫描电镜观察肠道杆菌种(Enterobacteriaceae)中的四种细菌,大肠埃希氏杆菌(Escherichiacoli),普通变形杆菌(Proteus vulgaris),伤寒沙门氏菌(Salmonella typhi)和福氏志贺氏菌(Shigella Flexneri)。未处理的菌落标本,菌落表面都可形成一层厚薄不同的表膜(Surface film)。四种细菌菌落的表膜,形状不一,千姿百态。适当处理后的菌落标本,则可显示菌体的本来面目。四种细菌菌体在菌落表面的分布和排列,也是各不相同,千差万别。本文根据扫描电镜的观察,对四种不同菌落进行了讨论。     

An Ant Colony Optimisation algorithm for solving the asymmetric traffic assignment problem

In this paper we propose an Ant Colony Optimisation (ACO) algorithm for defining the signal settings on urban networks following a local approach. This consists in optimising the signal settings of each intersection of an urban network as a function only of traffic flows at the accesses to the same intersection, taking account of the effects of signal settings on costs and on user route choices. This problem, also known as Local Optimisation of Signal Settings (LOSS), has been widely studied in the literature and can be formulated as an asymmetric assignment problem. The proposed ACO algorithm is based on two kinds of behaviour of artificial ants which allow the LOSS problem to be solved: traditional behaviour based on the response to pheromones for simulating user route choice, and innovative behaviour based on the pressure of an ant stream for solving the signal setting definition problem. Our results on real-scale networks show that the proposed approach allows the solution to be obtained in less time but with the same accuracy as in traditional MSA (Method of Successive Averages) approaches.     

Genetic Bee Colony (GBC) algorithm: A new gene selection method for microarray cancer classification

Naturally inspired evolutionary algorithms prove effectiveness when used for solving feature selection and classification problems. Artificial Bee Colony (ABC) is a relatively new swarm intelligence method. In this paper, we propose a new hybrid gene selection method, namely Genetic Bee Colony (GBC) algorithm. The proposed algorithm combines the used of a Genetic Algorithm (GA) along with Artificial Bee Colony (ABC) algorithm. The goal is to integrate the advantages of both algorithms. The proposed algorithm is applied to a microarray gene expression profile in order to select the most predictive and informative genes for cancer classification. In order to test the accuracy performance of the proposed algorithm, extensive experiments were conducted. Three binary microarray datasets are use, which include: colon, leukemia, and lung. In addition, another three multi-class microarray datasets are used, which are: SRBCT, lymphoma, and leukemia. Results of the GBC algorithm are compared with our recently proposed technique: mRMR when combined with the Artificial Bee Colony algorithm (mRMR-ABC). We also compared the combination of mRMR with GA (mRMR-GA) and Particle Swarm Optimization (mRMR-PSO) algorithms. In addition, we compared the GBC algorithm with other related algorithms that have been recently published in the literature, using all benchmark datasets. The GBC algorithm shows superior performance as it achieved the highest classification accuracy along with the lowest average number of selected genes. This proves that the GBC algorithm is a promising approach for solving the gene selection problem in both binary and multi-class cancer classification.     

基于气象威胁的无人机航迹规划方法研究

针对复杂气象条件下的无人机航迹寻优问题,用栅格法进行环境建模;在基本蚁群算法的基础上,用确定性选择与随机性选择相结合的方法对节点的状态转移规则进行改进.用精英蚂蚁系统、最大最小蚂蚁系统及最好最差蚂蚁系统思想更新信息素规则,对部分参数进行自适应处理,并将遗传操作融入航迹搜索过程中,同时对航迹进行平滑处理.仿真结果表明,改...     

Synthesis of satellite footprint patterns from rectangular planar array antenna by using swarm‐based optimization algorithms

A pattern synthesis method based on Firefly Algorithm (FA) and Artificial Bee Colony (ABC) optimization has been presented to generate satellite footprint patterns from a rectangular planar array of isotropic antennas by modifying the amplitude, phase, and the state of the array elements. Three cases comprising three different footprints of rectangular, square, and circular boundary are generated from the same array by using two different swarm‐based optimization algorithms FA and ABC. Both the algorithms, following the proposed procedures are able to generate the three different footprint patterns while maintaining a satisfactory lower peak side lobe level and ripple. A comparative analysis has been carried out between FA, ABC, and Genetic Algorithm (GA) for the presented problem in terms of fitness value for the three different cases. The superiority of FA and ABC over GA has been established in terms of finding better solutions for all the three cases of the proposed problem. Copyright © 2013 John Wiley & Sons, Ltd.     

Ants can orienteer a thief in their robbery

The Thief Orienteering Problem (ThOP) is a multi-component problem that combines features of two classic combinatorial optimization problems: Orienteering Problem and Knapsack Problem. The ThOP is challenging due to the given time constraint and the interaction between its components. We propose an Ant Colony Optimization algorithm together with a new packing heuristic to deal individually and interactively with problem components. Our approach outperforms existing work on more than 90% of the benchmarking instances, with an average improvement of over 300%.     

一种多约束条件下路径规划算法研究

针对目前导航系统中重要的多约束条件下路径规划功能,结合A＊算法和蚁群算法提出一种新的不确定算法,该算法首先将多约束条件进行融合使其适合蚁群转移,并在基本蚁群算法基础上采用了A＊算法的评估指标,为蚁群转移时提供最优预测收敛点。通过实验证明该算法可以大幅度降低时间消耗,并且全局收敛性强,计算结果稳定。     

基于Dijkstra-ACO混合算法的应急疏散路径动态规划

现代建筑设计趋于多样化,内部结构和功能越来越复杂,而传统疏散系统逃生指示方向固定、人员疏散时间较长,火灾发生时,不能够及时改变指示方向,易将逃生人员导向危险区域,威胁被困人员生命安全。该文提出了一种Dijkstra-ACO混合路径动态规划算法,在Dijkstra算法获得全局最优路径的基础上再采用蚁群优化(ACO)算法对每个节点进一步优化以获取最优路径,并节省算法运行时间。通过实验仿真验证了混合算法的有效性,能够根据起火点动态规划疏散路径,及时调整疏散指示方向,为火场中人员疏散逃生赢得宝贵时间。

     

基于蚁群智能和支持向量机的人脸性别分类方法

蚁群优化算法是根据自然界中蚂蚁能够将食物以最短路径搬回蚁巢这一智能行为而提出的一种新颖的进化算法,该算法不仅具有很好的鲁棒性,良好的正反馈特性,而且具有并行分布计算的特点。同时,支持向量机又是一种基于结构风险最小化原理的机器学习技术,具有很强的学习泛化能力,为此,文章提出了基于蚁群优化算法和支持向量机的人脸性别分类的方法。首先,通过KL变换降低人脸性别特征的维数,并根据特征值按照从大到小的顺序进行排列,然后采用10-交叉确认技术,用蚁群优化算法对人脸性别特征面进行选择,以对支持向量机进行学习、训练和测试。实验表明,与其他分类算法相比较,这种方法不仅图像处理简单,实用性强,而且正确识别率特别高。     

一种基于ABC的量子神经网络训练算法

传统的量子神经网络的训练方法容易使得算法陷入局部极小值,将Artificial Bee Colony(ABC)算法引入到原训练算法中,并且对人工蜂群算法进行改进.利用改进后的人工蜂群算法来优化传统量子神经网络,使优化后的量子神经网络具有结构简单、参数少、收敛速度快和可跳出局部极小值等优点.实验结果表明,相比原训练算法该优化算法提高了量子神经网络收敛解的精度.