思维进化算法的收敛性研究

依据自然遗传机制的本质,从分形的角度出发,通过引入自相似度量因子对思维进化算法作了改进。利用分形数学理论证明了思维进化算法在最优解搜寻过程中存在自相似性。利用压缩映射原理进一步研究了算法在自相似下的收敛性,指出在满足收敛性的同时,可通过引进自相似度量因子来离线估计收敛的快速性,并可利用自相似度量因子和离线收敛速度的关系来改进算法,以避免陷入局部极小解。     

Models as products of interdisciplinary exchange: Evidence from evolutionary game theory

The development of evolutionary game theory (EGT) is closely linked with two interdisciplinary exchanges: the import of game theory into biology, and the import of biologists’ version of game theory into economics. This paper traces the history of these two import episodes. In each case the investigation covers what exactly was imported, what the motives for the import were, how the imported elements were put to use, and how they related to existing practices in the respective disciplines. Two conclusions emerged from this study. First, concepts derived from the unity of science discussion or the unification accounts of explanation are too strong and too narrow to be useful for analysing these interdisciplinary exchanges. Secondly, biology and economics—at least in relation to EGT—show significant differences in modelling practices: biologists seek to link EGT models to concrete empirical situations, whereas economists pursue conceptual exploration and possible explanation.     

基于信用监管与防范的战略联盟演化博弈

为研究联盟成员信用与自身防范对联盟稳定性的影响,基于对专有性资源的攫取是机会主义行为的动机这一前提,建立战略联盟演化博弈模型,从理论上分析了信用惩罚额度和防范成本对战略联盟稳定性的影响.研究认为,通过进行信用监管,以及联盟成员自身实施一定的防范措施,有助于实现联盟稳定.过高或过低的惩罚额度与防范成本,将不利于联盟稳定.     

Evolutionary Programming for IP/MIP Problems with Linear Constraints

1. INTSODUCTIONThe common illteger programming (lP) is a mathematical model which is designed to find aset of non-negative variables to medmize (or minimize) a nonlinear objective function whilesatisfying a set of constraints under integer restrictions of variables. An lP model with somevariables reqllired to be real is a mixed integer programming (MIP).The history of solving lP/MIP problems is not very old. According to reference [1], ageneral method for solvillg such problems may not…     

Computation, individuation, and the received view on representation

The ‘received view’ about computation is that all computations must involve representational content. Egan and Piccinini argue against the received view. In this paper, I focus on Egan’s arguments, claiming that they fall short of establishing that computations do not involve representational content. I provide positive arguments explaining why computation has to involve representational content, and how that representational content may be of any type (distal, broad, etc.). I also argue (contra Egan and Fodor) that there is no need for computational psychology to be individualistic. Finally, I draw out a number of consequences for computational individuation, proposing necessary conditions on computational identity and necessary and sufficient conditions on computational I/O equivalence of physical systems.     

求最佳生物序列并置排列的算法和程序

本文提出了计算最佳生物序列并置排列的程序和算法。程序使用计算进化距离的改进算法,在IBM-PC/AT上用Turbo-Pascal 4.0版开发。程序有友好的用户界面、操作简便、通用性强,可以移植到多种计算和操作环境。本文以蛋白质分子序列为例,给出了复杂赋权情形下计算进化距离和最佳并置排列的算法,证明了不同赋权方式本质上不改变改进算法的时间和空间复杂性。     

An Evolutionary Real-Time 3D Route Planner for Aircraft

Abstract: A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candi-dates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By usingproblem-specific chromosome structure and genetic operators, the routes are generated in real time, with different missionconstraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving an-gle and route distance constraint taken into account.     

匹配于进化种群的局部网络图度量

为了分析匹配于进化种群的贝叶斯网络结构 ,给出了用于刻画局部贝叶斯网络度量的有关表示。依据贝叶斯狄利克雷度量 ,对于贝叶斯网络图中的 3个顶点 (对应于染色体的某 3个基因位置 ) ,研究了 3个顶点无连接、其中只有两个顶点存在有向连接、及 3个顶点存在两条有向边时的度量值关系。揭示了局部贝叶斯网络结构的固有特性 ,为进一步研究进化算法的种群结构提供了一条可行的途径。     

利用幂律液体压裂时水平裂缝几何尺寸的求解方法

本文提出了利用幂律液体压裂时求解水平裂缝几何尺寸的方法,分析了便于现场使用的图解法。应用实例说明,图版求解法使用简单、方便。     

基于PCE的多域光网络安全组播路由算法

IETF提出了基于路径计算单元(Path Computation Element)的多域光网络架构方式,能够很好的解决跨域路由的计算问题,但由于光网络的透明性,分层PCE架构下的光网络存在安全威胁。因此,如何提高光网络中信息传输的安全性是一个重要的问题。在PCE架构的基础上,利用信任度、接种疫苗及免疫选择等关键技术,设计了多约束条件下基于人工免疫和信任度的多域光网络安全组播路由算法,在保证光树可信和高收敛速度的前提下,可使组播树的综合成本最小。经分析及仿真实验表明,与传统的多域光网络最短路径树组播路由算法相比,具有更低的综合成本和更优的抗阻塞性能。