A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function

This short note considers and resolves the apparent contradiction between known worst-case complexity results for first- and second-order methods for solving unconstrained smooth nonconvex optimization problems and a recent note by Jarre [On Nesterov's smooth Chebyshev–Rosenbrock function, Optim. Methods Softw. (2011)] implying a very large lower bound on the number of iterations required to reach the solution's neighbourhood for a specific problem with variable dimension.     

Genetic algorithm‐based neural‐network modeling approach applied to AlGaN/GaN devices

An accurate equivalent circuit large‐signal model (ECLSM) for AlGaN‐GaN high electron mobility transistor (HEMT) is presented. The model is derived from a distributed small‐signal model that efficiently describes the physics of the device. A genetic neural‐network‐based model for the gate and drain currents and charges is presented along with its parameters extraction procedure. This model is embedded in the ECLSM, which is then implemented in CAD software and validated by pulsed and continuous large‐signal measurements of on‐wafer 8 × 125‐μm GaN on SiC substrate HEMT. Pulsed IV simulations show that the model can efficiently describe the bias dependency of trapping and self‐heating effects. Single‐ and two‐tone simulation results show that the model can accurately predict the output power and its harmonics and the associated intermodulation distortion (IMD) under different input‐power and bias conditions. © 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2013.     

宽带钢厚度模型的研究与优化

介绍莱钢宽带钢厚度模型的优化,以改善板形,提高控制精度.     

Bounded Consensus Algorithms for Multi‐Agent Systems in Directed Networks

In this paper, the consensus problem is investigated via bounded controls for the multi‐agent systems with or without communication. Based on the nested saturation method, the saturated control laws are designed to solve the consensus problem. Under the designed saturated control laws, the transient performance of the closed‐loop system can be improved by tuning the saturation level. First of all, asymptotical consensus algorithms with bounded control inputs are proposed for the multi‐agent systems with or without communication delays. Under these consensus algorithms, the states’ consensus can be achieved asymptotically. Then, based on a kind of novel nonlinear saturation functions, bounded finite‐time consensus algorithms are further developed. It is shown that the states’ consensus can be achieved in finite time. Finally, two examples are given to verify the efficiency of the proposed methods.     

微控制器中按键处理技巧及应用

针对微控制器中按键处理问题。列举不同场合对按键处理的设计优化。重点讨论了非编码键盘的抖动及干扰消除优化。结合ADC按键,设计一种新型软件滤波方法一阀值平滑滤波,详细介绍了其软硬件的实现过程。通过验证,此方法既能有效扩展键盘又能实现消抖,有效提高微控制器资源的利用。     

非圆曲线的数控处理及程序实现

引用优化设计中一维搜索和黄金分割法,针对数控加工中非圆曲线的处理,给出实用、简洁和新颖的宏程序实现方法,解决在数控系统中求解方程组的问题,是数控用户快速解决相关应用问题的有效手段。     

Expected runtimes of evolutionary algorithms for the Eulerian cycle problem

Evolutionary algorithms are randomized search heuristics, which are applied to problems whose structure is not well understood, as well as to problems in combinatorial optimization. They have successfully been applied to different kinds of arc routing problems. To start the analysis of evolutionary algorithms with respect to the expected optimization time on these problems, we consider the Eulerian cycle problem. We show that a variant of the well-known (1+1)$(1+1)$ EA working on the important encoding of permutations is able to find an Eulerian tour of an Eulerian graph in expected polynomial time. Altering the operator used for mutation in the considered algorithm, the expected optimization time changes from polynomial to exponential.     

一种基于GPU加速的细粒度并行蚁群算法

为改善蚁群算法对大规模旅行商问题的求解性能,提出一种基于图形处理器(GPU)加速的细粒度并行蚁群算法.将并行蚁群算法求解过程转化为统一计算设备架构的线程块并行执行过程,使得蚁群算法在GPU中加速执行.实验结果表明,该算法能提高全局搜索能力,增大细粒度并行蚁群算法的蚂蚁规模,从而提高了算法的运算速度.     

基于双极偏好控制的多目标粒子群优化算法

考虑双极偏好信息对粒子群的控制作用,提出一种使用双极偏好——正偏好和负偏好引导粒子群向 Pareto 前沿偏好区域进化的方法．根据TOPSIS 决策法思想,将外部种群粒子与正负偏好点的相对贴近度排序作为 外部种群管理和全局最优解更新策略;根据贴近度值确定解集的分布度;选取6 种不同类型的多目标测试函数进行 算法模拟,从世代距离、空间测度和超体积测度3 个指标与基于单极偏好的多目标粒子算法进行性能比较．结果显 示,基于双极偏好控制的多目标粒子群算法的收敛性和综合性能更优秀．     

Optimal hole shape for minimum stress concentration using parameterized geometry models

The goal of this work is to obtain optimal hole shape for minimum stress concentration in two-dimensional finite plates using parameterized geometry models. The boundary shape for a hole is described by two families of smooth curves: one is a “generalized circular” function with powers as two parameters; the other one is a “generalized elliptic” function a and b are ellipse axes) with powers as two parameters and one of the ellipse axes as the third parameter. Special attention is devoted to the practicability of parameterized equations and the corresponding optimal results under the condition with and without the curvature radius constraint. A number of cases were examined to test the effectiveness of the parameterized equations. The numerical examples show that extremely good results can be obtained under the conditions with and without curvature radius constraint, as compared to the known solutions in the literature. The geometries of the optimized holes are presented in a form of compact parametric functions, which are suitable for use and test by designers. It is anticipated that the implementation of the suggested parameterized equations would lead to considerable improvements in optimizing hole shape with high quality.