粒子群算法中惯性权重的实验与分析

简要介绍了粒子群算法(PSO)，对算法中的重要参数惯性权重进行了系统的实验，分析了固定权重与时变权重的选择问题，并从问题依赖性、种群大小和拓扑结构等方面详细分析了惯性权重对于算法性能的影响．结果表明，惯性权重的问题依赖性较小，随着种群的增大，其取值应适当减小，局部版本下，惯性权重的选择具有更大的自由度．     

两层非线性规划问题的并行模拟退火全局优化

两层非线性规划问题的非凸性和非可微性给全局最优解的求解带来了较大的困难，目前还缺乏成熟的全局优化策略，同时其易并行计算特性未得到重视。提出了基于模拟退火算法的两层非线性规划问题的并行全局优化策略。融合单纯形法和模拟退火算法设计了一种并行模拟退火算法，用来求解上层问题，用精确惩罚函数处理约束。下层的非线性规划问题则采用可变容差单纯形算法完成求解。所设计的组合算法有效地结合了两层非线性规划问题的易并行性，便于实现网络并行计算。计算表明算法有着可靠的全局收敛性和较高的收敛速度。     

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

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

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

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

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

通过引入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.     

一类三阶时滞微分方程在Banach空间中的周期解的存在性

利用上下解单调迭代方法, 考虑有序Banach空间E中三阶时滞微分方程u(t)+M₀u(t-τ₀)=f(t,u(t), u(t-τ₁), u(t-τ₂)),〓t∈R,2π-周期解的存在性, 其中 f: R×E³→E 连续, 关于 t 以 2π-为周期, τ₀,τ₁,τ₂为正常数。 通过建立新的极大值原理和构造方程 2π-周期解的单调迭代求解程序, 得到了该方程 2π-周期解的存在性与唯一性结果。     

微小薄壁变形预测的迭代有限元法

将迭代有限元法引入微小薄壁铣削中,建立了变形量的预测模型,预测了不同径向切削深度、不同薄壁厚度时的铣削变形量大小,通过试验加工和Deform-3D仿真对模型进行了验证.结果表明:迭代有限元变形预测值与试验加工变形量较为接近;加工后的薄壁残余厚度大于理想状况下的加工厚度;最大变形量随壁厚的增大先保持最大值然后逐渐减小至0;薄壁厚度应当与切削参数相协调,调整工件刚度与切削力大小相适应,否则会导致变形量过大.     

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.