基于多智能体系统的协同交互式进化计算模型

协同交互式进化计算由于缺乏通用模型而限制了其应用范围。针对该问题，结合多智能体系统结构的灵活性和异构特点，提出基于多智能体系统的协同交互式进化计算模型。模型由交互式进化计算单元和协同单元构成，并给出了每个部分的详细功能描述。采用面向智能体的程序设计方法，提取不同功能组件，给出相应组件的语义描述及派生关系。以网络环境下的服装设计系统为例，给出系统结构及组件派生实例。结果表明该模型的合理性，为协同交互式进化计算的广泛应用奠定了基础。     

混合粒子群算法在高维复杂函数寻优中的应用

针对粒子群算法应用于复杂函数优化时可能出现过早收敛于局部最优解的情况,提出了一种改进的算法结构。通过构造单个粒子的最优序列代替单一的进化方向和类似于蚁群算法信息素表的选择机制,保留了粒子的多种进化可能方向,提高了粒子间的多样性差异,从而改善算法能力。算法同时设计了最优序列的加入规则和基于粒子群聚度的最优序列动态长度控制方法。改进后的混合粒子群算法保证了算法拥有更强的搜索能力,也保留了粒子群算法高效优化的特点。仿真实验证明,混合粒子群方法相对传统方法而言具有明显的精度优势。     

一种基于正交矩的立体匹配方法

通过引入Tchebichef离散正交矩提出了一种新的基于双目立体匹配的方法，该方法利用了Tchebichef离散正交矩在图像空间中的正交性来描述图像的灰度分布特征，然后根据该分布特征对图像对进逐行逐像素匹配，视差计算通过逆变换或者通过比较重建图像的灰度值进行估计，从而得到视差图。给出了利用正交矩处理图像对的重建结果和立体匹配结果。试验结果表明，该方法是可行和有效的。     

MINIMAL INVERSION AND ITS ALGORITHMS OF DISCRETE-TIME NONLINEAR SYSTEMS

The left-inverse system with minimal order and its algorithms of discrete-time nonlinear systems are studied in a linear algebraic framework. The general structure of left-inverse system is described and computed in symbolic algorithm. Two algorithms are given for constructing left-inverse systems with minimal order.     

Echo-state-network classification based multi-services awareness in high-speed optical passive networks

With the challenge of great growing of services diversity,service-oriented supporting ability is required by current high-speed passive optical network (PON).Aimed at enhancing the quality of service (QoS) brought by diversified-services,this study proposes an echo state network (ESN) based multi-service awareness mechanism in 10-Gigabite ethernet passive optical network (10G-EPON).In the proposed approach,distributed architecture is adopted to realize this ESN based multi-service awareness.According to the network architecture of 10G-EPON,where a main ESN is running in OLT and a number of ESN agents works in ONUs.The main-ESN plays the main function of service-awareness from the total view of various kinds of services in 10G-EPON system,by full ESN training.Then,the reservoir information of well-trained ESN in OLT will be broadcasted to all ONUs and those ESN agents working in ONUs are allowed to conduct independent service-awareness function.Thus,resources allocation and transport policy are both determined only in ONUs.Simulation results show that the proposed mechanism is able to better support the ability of multiple services.     

An efficient identity-based key agreement protocol in a multiple PKG environment

Identity-based key agreement protocol affords a natural way to combine the participant’s identity with its public key.However,most of them just consider the key agreement in a single private key generator(PKG)environment.In addition,the existing key agreement protocols have a great computing overhead for mobile computing which is more and more popular today.This paper proposes a new identity based key agreement protocol.With the help of mathematical tools,we make our protocol applied in multiple PKG environment.It also satisfies all the security properties which is set for key agreement protocol.Moreover,some of its time-consuming operations can be delivered to untrusted public computation resources,so its computing complexity can be greatly reduced.     

Histories of molecules: Reconciling the past

Molecular data and methods have become centrally important to evolutionary analysis, largely because they have enabled global phylogenetic reconstructions of the relationships between organisms in the tree of life. Often, however, molecular stories conflict dramatically with morphology-based histories of lineages. The evolutionary origin of animal groups provides one such case. In other instances, different molecular analyses have so far proved irreconcilable. The ancient and major divergence of eukaryotes from prokaryotic ancestors is an example of this sort of problem. Efforts to overcome these conflicts highlight the role models play in phylogenetic reconstruction. One crucial model is the molecular clock; another is that of ‘simple-to-complex’ modification. I will examine animal and eukaryote evolution against a backdrop of increasing methodological sophistication in molecular phylogeny, and conclude with some reflections on the nature of historical science in the molecular era of phylogeny.     

基于近似贝叶斯计算方法的排队模型参数估计

基于贝叶斯推断对单服务台的马尔科夫与非马尔科夫系统下的4个排队模型做参数估计与效果评价,并对银行排队叫号换汇数据做实证研究。采用近似贝叶斯计算的方法有效解决复杂排队模型似然函数难解析表达的问题。利用R中queue computer包给出M/M/1,M/G/1,G/M/1,GI/GI/1这4个排队模型的到达时间与服务时间的参数估计及后验分布图。其中M/M/1:估计值(真实值)分别约为1.02(1)、 1.12(1/0.9),都与真实值接近;M/G/1:1.17(1)、1.21(1.2),对服务时间的估计效果优于到达时间;G/M/1:0.49(0.5)、0.96(1),从后验分布进一步得到对服务时间的估计更准确;GI/GI/1:1.16(1.1)、1.07(1)、0.23(0.251)、0.22(0.25),各分量的估计值与真实值相对接近。对于实际银行数据,估计得的参数所拟合的数据与Ausin的拟合数据分布接近。研究表明,近似贝叶斯的方法在排队模型的参数估计上有较大优势,在实际数据中取得了较好应用。     

Cs相似度函数下正则谱聚类的收敛阶

用覆盖数逼近的方法给出Cs相似度函数下正则谱聚类的收敛阶.     

可扩展路由器并行路由计算模型

分布式控制平面的并行路由计算性能是制约可扩展路由器大规模扩展的关键因素。根据反压理论建立了分布式控制平面并行路由计算模型,利用控制单元的队列长度信息判断每个控制单元的负载大小,自适应地调整控制单元间的负载分配,实现负载均衡。利用排队理论,根据损失率、系统利用率和服务等待时间这3个特征量对该模型进行了性能分析。用真实网络数据模拟验证理论分析的正确性。实验结果表明:与现有并行路由算法相比,该模型采用的反压任务分配算法能够根据控制单元的负载大小和控制单元数量自适应地均衡分配负载,有效地提高了可扩展路由器的并行路由计算性能和可扩展性。