Dual–primal proximal point algorithms for extended convex programming

This paper presents a class of dual–primal proximal point algorithms (PPAs) for extended convex programming with linear constraints. By choosing appropriate proximal regularization matrices, the application of the general PPA to the equivalent variational inequality of the extended convex programming with linear constraints can result in easy proximal subproblems. In theory, the sequence generated by the general PPA may fail to converge since the proximal regularization matrix is asymmetric sometimes. So we construct descent directions derived from the solution obtained by the general PPA. Different step lengths and descent directions are chosen with the negligible additional computational load. The global convergence of the new algorithms is proved easily based on the fact that the sequences generated are Fejér monotone. Furthermore, we provide a simple proof for the O(1/t) convergence rate of these algorithms.     

一种相控阵天线安装精度检测与校准

文中论述了一种相控阵雷达天线安装后的精度检测方法。按照雷达天线安装后的几何形态,采用光学测量仪器进行相关的数据采集,建立检测的数学模型,利用线性回归法以及最小二乘法进行数据拟合,计算出安装后雷达天线底面与水平面的最大夹角和天线边缘与正北方向的夹角,并进行了试验误差评估和分析,依据检测数据对雷达天线的水平和方位角度进行校...     

A novel artificial bee colony algorithm with Powell's method

Artificial bee colony (ABC) algorithm is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, there is still an insufficiency in ABC regarding its solution search equation, which is good at exploration but poor at exploitation. To address this concerning issue, we first propose a modified search equation which is applied to generate a candidate solution in the onlookers phase to improve the search ability of ABC. Further, we use the Powell's method as a local search tool to enhance the exploitation of the algorithm. The new algorithm is tested on 22 unconstrained benchmark functions and 13 constrained benchmark functions, and are compared with some other ABCs and several state-of-the-art algorithms. The comparisons show that the proposed algorithm offers the highest solution quality, fastest global convergence, and strongest robustness among all the contenders on almost all test functions.     

PSO和K均值混合分类算法在远程教学系统中的应用

现行的多数网络教学系统在学生按需学习和＂因材施教＂上存在局限性,本文用PSO和K均值的混合分类算法对传统的网络教学系统进行改进,根据获取的用户基本信息和兴趣特征进行聚类,充分体现＂以学习者为中心＂个性化教学模式。实验结果表明,该算法具有较好的全局收敛性,寻优能力明显提升。     

自适应均衡器的FPGA实现

在无线通信系统中,由于多径效应的干扰导致信号在传输过程中不可避免地产生码间干扰,因此必须在接收端增加均衡器,以消除码间干扰,提高传输质量。该自适应均衡器设计以FPGA为设计平台,使用自上而下的模块化的设计方法,利用StratixⅡ系列EP1C20F324C6芯片,采用横向滤波器结构,设计并行结构的8阶复数滤波器。最后在QuartusⅡ中进行仿真与综合,结果显示I、Q两路误差信号趋于零,从而实现自适应均衡,降低误码率。     

Web proxy cache replacement scheme based on back-propagation neural network

Web proxy caches are used to reduce the strain of contemporary web traffic on web servers and network bandwidth providers. In this research, a novel approach to web proxy cache replacement which utilizes neural networks for replacement decisions is developed and analyzed. Neural networks are trained to classify cacheable objects from real world data sets using information known to be important in web proxy caching, such as frequency and recency. Correct classification ratios between 0.85 and 0.88 are obtained both for data used for training and data not used for training. Our approach is compared with Least Recently Used (LRU), Least Frequently Used (LFU) and the optimal case which always rates an object with the number of future requests. Performance is evaluated in simulation for various neural network structures and cache conditions. The final neural networks achieve hit rates that are 86.60% of the optimal in the worst case and 100% of the optimal in the best case. Byte-hit rates are 93.36% of the optimal in the worst case and 99.92% of the optimal in the best case. We examine the input-to-output mappings of individual neural networks and analyze the resulting caching strategy with respect to specific cache conditions.     

基于混沌系统和极化恒等式的数字图像加密算法

混沌系统具有初值敏感性,参数敏感性和类随机性等特性。将图像分成大小为8 8的图像子块,利用经典的Logistic方程产生的混沌序列并对其排序生成匹配模板来改变图像子块的位置,然后利用极化恒等式内积分解加密算法改变图像像素的值。因此,基于混沌系统和极化恒等式的数字图像加密算法使图像的像素的位置和值都发生了变化,实现了图像的混淆和扩散。仿真实验表明该方法进行图像加密具有可行性和安全性。     

改进的猴王遗传算法求解组合拍卖最优竞胜标

应用遗传算法求解第一价格封闭组合拍卖问题,编码及约束条件复杂,在交叉和变异的过程中容易产生大量不可行解,并且在选择和精英保留中,一些局部最优点(早熟点)对应的个体容易被大量复制,使群体多样性下降。该文就以上的问题,改进了原有遗传算法求解组合拍卖最优竞胜标的方法,并采用了猴王遗传算法的精英保留策略。实际计算证明本算法编码方式自然并且直观表达了个体和标的的关系。在交叉和变异算子中,产生不可行解的数量下降,更积极的保存了上一代进化的部分成果。而改进猴王遗传算法的精英保留策略,使算法能够以高概率跳出早熟,达到算法速度与准确的平衡。