A pseudo-random network mobile automaton with linear growth

Based on the mobile automaton model, an algorithm is introduced that grows planar, tri-valent graphs by exhibiting a peculiar, twofold dynamics. In a first phase, graph growth appears to be pseudo-random and O(n) then it settles to a very regular behavior and rate. A pseudo-random mobile automaton is already known; the new automaton provides now a finite, but surprisingly long, pseudo-random, linear growth process. Applications of mobile automata to fundamental physics and quantum gravity have been recently suggested.     

An experimental study on the applicability of evolutionary algorithms to craniofacial superimposition in forensic identification

Photographic supra-projection is a forensic process that aims to identify a missing person from a photograph and a skull found. One of the crucial tasks throughout all this process is the craniofacial superimposition which tries to find a good fit between a 3D model of the skull and the 2D photo of the face. This photographic supra-projection stage is usually carried out manually by forensic anthropologists. It is thus very time consuming and presents several difficulties. In this paper, we aim to demonstrate that real-coded evolutionary algorithms are suitable approaches to tackle craniofacial superimposition. To do so, we first formulate this complex task in forensic identification as a numerical optimization problem. Then, we adapt three different evolutionary algorithms to solve it: two variants of a real-coded genetic algorithm and the state of the art evolution strategy CMA-ES. We also consider an existing binary-coded genetic algorithm as a baseline. Results on several superimposition problems of real-world identification cases solved by the Physical Anthropology lab at the University of Granada (Spain) are considered to test our proposals.     

A genetic algorithm with gene rearrangement for K-means clustering

In this paper, a new clustering algorithm based on genetic algorithm (GA) with gene rearrangement (GAGR) is proposed, which in application may effectively remove the degeneracy for the purpose of a more efficient search. A new crossover operator that exploits a measure of similarity between chromosomes in a population is also presented. Adaptive probabilities of crossover and mutation are employed to prevent the convergence of the GAGR to a local optimum. Using the real-world data sets, we compare the performance of our GAGR clustering algorithm with K-means algorithm and other GA methods. An application of the GAGR clustering algorithm in unsupervised classification of multispectral remote sensing images is also provided. Experiment results demonstrate that the GAGR clustering algorithm has high performance, effectiveness and flexibility.     

A hybrid multi-criteria decision-making model for firms competence evaluation

In this paper, we present a hybrid multi-criteria decision-making (MCDM) model to evaluate the competence of the firms. According to the competence-based theory reveals that firm competencies are recognized from exclusive and unique capabilities that each firm enjoy in marketplace and are tightly intertwined within different business functions throughout the company. Therefore, competence in the firm is a composite of various attributes. Among them many intangible and tangible attributes are difficult to measure. In order to overcome the issue, we invite fuzzy set theory into the measurement of performance. In this paper first we calculate the weight of each criterion through adaptive analytic hierarchy process (AHP) approach (A³) method, and then we appraise the performance of firms via linguistic variables which are expressed as trapezoidal fuzzy numbers. In the next step we transform these fuzzy numbers into interval data by means of α-cut. Then considering different values for α we rank the firms through TOPSIS method with interval data. Since there are different ranks for different α values, we apply linear assignment method to obtain final rank for alternatives.     

基于亲缘选择的遗传算法

针对传统遗传算法容易陷入局部最优解的缺陷,借鉴生物中亲缘选择的思想,提出基于亲缘选择的遗传算法。该算法构造新选择算子,通过按亲缘关系放弃一个解而获得另一个解来保证算法在最优解的领域内的有效搜索,提高遗传算法对全局最优解的搜索能力和收敛速度。仿真结果表明,该算法正确有效,性能优于现有的传统算法。     

基于信息熵多种群遗传算法的组播路由

针对网络信息不确定性和链路负载不均匀所造成的网络拥塞,提出基于信息熵的组播路由算法。该遗传算法从最小代价树开始,在多种群中不断选择信息熵较大的种群,以求得满足延时要求且路径负载较小的组播树。结果表明,该算法性能快速、有效地构造最小时延组播树,且保证网络负载均衡分布。     

佳点集遗传覆盖算法

针对覆盖算法中识别精度与泛化能力之间的一对矛盾,结合佳点集遗传算法思想,提出佳点集遗传覆盖算法。通过在覆盖种群中引入竞争,淘汰不好的覆盖,保留较优的覆盖,减少了覆盖个数和拒识样本个数,从而提高了整体覆盖种群的分类能力。与Lib-SVM、领域覆盖、交叉覆盖的对比实验证明了该算法具有良好的分类识别精度与泛化能力。     

基于推理信息量的BN参数学习变量离散化方法

提出推理信息量的概念,将其作为贝叶斯网络连续变量离散化评价标准。在连续变量离散化的过程中,采用遗传算法寻求最优解,设计个体编码方式、交叉算子和变异算子,将推理信息量作为衡量个体适应度的标准。实例分析证明,通过该方法对变量进行离散化后学习得到的贝叶斯网络在推理时能得到更大的推理信息量。     

RSA公钥密码算法的计时攻击与防御

计时攻击根据密码算法在密码设备中运行时的执行时间差异,分析和判断密码算法的各种有效信息,是最具威胁的旁路攻击方式之一。该文研究RSA加密算法和计时攻击的原理,分析RSA解密过程,阐述针对基于模幂算法的RSA计时攻击的原理,讨论如何抵御该计时攻击。