An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels

Studies for the cognitive model are relatively new in the literature; however there is a growing interest in the communication field nowadays. This paper considers the cognitive model in the communication field as the problem of minimizing a fractional quadratic problem, subject to two or more quadratic constraints in complex field. Although both denominator and numerator in the fractional problem are convex, this problem is not so simple since the quotient of convex functions is not convex in most cases. We first change the fractional problem into a non-fractional one. Second, we consider the semi-definite programming (SDP) method. For the problem with m (m≤2) constraints, we use the SDP relaxation and obtain the exact optimal solution. However, for the problem with m (m>2) constraints, we choose the randomization method to gain an approximation solution in the complex case. At last, we apply this method to practical communications over wireless channels with good results.     

A surrogate-based optimization method with RBF neural network enhanced by linear interpolation and hybrid infill strategy

In engineering, it is computationally prohibitive to directly employ costly models in optimization. Therefore, surrogate-based optimization is developed to replace the accurate models with cheap surrogates during optimization for efficiency. The two key issues of surrogate-based optimization are how to improve the surrogate accuracy by making the most of the available training samples, and how to sequentially augment the training set with certain infill strategy so as to gradually improve the surrogate accuracy and guarantee the convergence to the real global optimum of the accurate model. To address these two issues, a radial basis function neural network (RBFNN) based optimization method is proposed in this paper. First, a linear interpolation (LI) based RBFNN modelling method, LI-RBFNN, is developed, which can enhance the RBFNN accuracy by enforcing the gradient match between the surrogate and the trend observed from the training samples. Second, a hybrid infill strategy is proposed, which uses the surrogate prediction error based surrogate lower bound as the optimization objective to locate the promising region and meanwhile employs a linear interpolation-based sequential sampling approach to improve the surrogate accuracy globally. Finally, extensive tests are investigated and the effectiveness and efficiency of the proposed methods are demonstrated.     

Robust consensus for uncertain multi‐agent systems with discrete‐time dynamics

This paper investigates robust consensus for multi‐agent systems with discrete‐time dynamics affected by uncertainty. In particular, the paper considers multi‐agent systems with single and double integrators, where the weighted adjacency matrix is a polynomial function of uncertain parameters constrained into a semialgebraic set. Firstly, necessary and sufficient conditions are provided for robust consensus based on the existence of a Lyapunov function polynomially dependent on the uncertainty. In particular, an upper bound on the degree required for achieving necessity is provided. Secondly, a necessary and sufficient condition is provided for robust consensus with single integrator and nonnegative weighted adjacency matrices based on the zeros of a polynomial. Lastly, it is shown how these conditions can be investigated through convex programming by exploiting linear matrix inequalities and sums of squares of polynomials. Some numerical examples illustrate the proposed results. Copyright © 2013 John Wiley & Sons, Ltd.     

利用仿真软件优化电磁场与电磁波教学

针对电磁场与电磁波课程理论公式复杂、相关概念模型抽象的特点,结合长期积累的教学经验,利用软件仿真将电磁场定理模型、分布特性可视化,简化推导计算过程,优化课程结构、节省课时的同时提高了教学效果。     

Control policies for an industrial acetylene hydrogenation reactor

This paper addresses the problem of finding optimal operational policies for an acetylene reactor for day to day operation. A lumped parameter model based on four main reactions is developed and used to examine the effects of the reactor manipulated variables on key reaction parameters. An optimal and a sub-optimal operational policy which minimize the ethylene loss over time are formulated and the solution techniques are presented. The results indicate that the reactor model is in good agreement with industrial plant data. The performance of the optimal control policy is very similar to the performance of the sub-optimal control policy. However, the sub-optimal formulation, while retaining the dominant features of the optimal response, reduces the computational requirements. Finally, some issues concerning the real-time implementation of an advanced acetylene reactor control scheme are presented. These include the estimation of the optimum regeneration cycle, a recursive model update algorithm, the process optimizer and their overall coordination. A preliminary analysis of the benefits associated with the advanced control scheme suggests a considerable reduction in the yearly ethylene loss.     

高负荷下聚酯工艺参数的优化

介绍原 2 0万t/a装置增容到 2 4万t/a时的工艺参数优化。PTA平均粒径 95～ 110 μm ,n(EG) /n(PTA) =2 .6～ 2 .7,酯化液位 63 %～ 64 % ,温度 2 92～ 2 96℃ ;乙二醇锑催化剂 ,稳定EG、DEG量 ,选择TiO2 消光剂 ,滤除凝聚粒子 ;预缩聚温度 2 87～ 2 89℃ ,压力 2 .4～ 2 .8kPa,液位 42～ 48cm ;终缩聚温度 2 90～ 2 91℃ ,压力 2 .5～ 3 .0hPa,液位 60～ 62cm ,搅拌速度 2 .7r/min。     

基于蜂群算法的移动agent迁移策略研究*

旅行agent问题是一个复杂的组合优化问题,在于解决保证agent在不同主机间移动时如何根据任务情况规划路线,实现在完成任务时间最短的路线上迁移。采用进化算法的搜索求解具有启发性强、鲁棒性强的特点,但也面临着陷于局部最优解,导致agent在迁移过程中整体任务完成效率降低等问题。提出了一种基于蜂群算法的agent迁移模型,将agent划分为侦察、引领和跟随三种角色,agent通过彼此间的信息互换,在群体迁移的过程中同时实施新路径的发现和调整。实验结果表明,该算法可以很好地实现目标寻径效率,与经典蚁群算法相比     

基于混沌微粒群算法的文本分类研究*

针对中文文本分类问题,将其用于分类规则的抽取。为了避免微粒群算法在全局优化中陷入局部极值,利用混沌运动遍历性、随机性等特点,对标准微粒群算法进行了改进,提出了基于混沌微粒群算法的文本自动分类方法。仿真实验表明本算法对文档进行分类是一种比较可行的分类方法,分类精度高、速度快。     

基于流程树的BPEL4WS中流程服务动态优化方法*

针对服务流程建模语言BPEL4WS难以满足用户个性化需求也无法适应动态环境变化的问题,提出了一种动态优化BPEL4WS中流程服务的方法。该方法给出了一种Web服务交互代价计算模型,用来评价用户对Web服务的偏好程度以及实时环境下Web服务交互的现实代价。将BPEL4WS描述的服务组合流程转换为服务组合流程树,并借助领域本体对流程树节点进行语义检查,消除流程树中不合法的流程组合。通过深度优先遍历流程树,利用单亲遗传算法对流程服务进行优化组合。最后给出应用算例,并对用来优化组合流程服务的单亲遗传算法的适用性与