模糊优选BP神经网络及其应用

本文采用模糊优选算法（BP）算法来训练前馈人工神经网络（BPN），用BP算法进行精确训练，使网络收敛速度加快和避免局部极小。     

考虑负载平衡的科学工作流容错聚类算法研究

科学工作流执行过程中,多个任务组成的聚类作业相对单任务故障风险更高。容错聚类算法在进行故障恢复的同时面临着负载不平衡问题,为此提出了一种平衡重聚类算法（Balanced Re-clustering,BR）。该算法结合水平运行时间平衡聚类算法（Horizontal Runtime Balancing,HRB）对选择重聚类方法（Selective Re-clustering,SR）进行改进,将运行时间最长的任务分配给运行时间最短的类,在故障发生后重新运行失败的任务。实验结果表明,与现有的两种任务重聚类方法相比,BR算法的性能增益最高分别可达84%和18.75%,显著降低了工作流执行成本,提高了系统的运行效率。     

混沌协同人工鱼粒子群混合算法及其应用

针对基本人工鱼群算法（AFSA）收敛速度较慢、精度较低和粒子群易陷于局部的缺点,提出了混沌协同人工鱼粒子群混合算法（CCAFSAPSO）。该算法采取AFSA、PSO的全局并行搜索与模拟退火算法（SA）的局部串行搜索机制相结合的搜索方式,并用混沌映射的遍历性和模拟退火算法的突跳功能,克服了AFSA、PSO的收敛速度、求解精度和易陷于局部最优的不足。典型函数测试进一步表明CCAFSAPSO算法和同类算法相比,收敛速度更快、求解精度较高。最后将算法应用于化工数据处理,获得满意效果。     

近邻分类法的改进及其在刀具分类中的应用

本文研究三种在近邻分类法基础上的改进算法：（1）编辑技术，（2）边界抽取，（3）边界补缀。编辑技术使识别率已接近Bayes标准。再经边界抽取仅保存对分类直接起作用的设计样本集，从而提高了分类速度，但识别率有所下降，边界补缀法是本文作者之一最近提出的一种新算法。此算法在重新审查部分设计样本的过程中，“拣”回在边界抽取时失掉的个别位于两类交界处的样本，进一步完善了分类器。补缀后的边界样本集使分类速度保持在（2）的水平，而识别率又上升到使用编辑技术（1）后的情况。将以上算法依次应用到刀具分类的两类问题，给出可喜的结果，经过（1），（2），（3）处处理过的设计样本集，其识别率接近大样本集时1－NNR的结果，同时分类速度也提高了约6倍。     

一种基于AntNet改进的QoS路由算法

对具有NP完全难度的网络状态动态变化下的路由问题，提出了一种基于蚁群网络（Antnet）的蚁群优化分布式QoS路由算法．算法的主要特点是；（1）采用了动态更新的概率表替代传统的路由表；（2）采用了智能的初始化方法；（3）采用了一种新颖的信息素更新机制；（4）采用一种新的节点选择机制；（5）引入蚂蚁相遇机制．与标准的AntNet相比，该算法具有更快的收敛速度和较好的吞吐能力．另外，算法同时考虑了满足QoS度量和负载平衡等问题。     

基于PSO—BP神经网络的图像压缩算法

本文阐述了使用BP神经网络压缩图像的方法和粒子群算法（PSO）的原理。为提高BP算法的训练速度和图像重建质量．本文设计了一种利用PSO—BP网络进行图像压缩的算法，该算法结合了PSO算法和BP算法的优点，将BP网络的训练过程分为两个阶段。实验表明，利用该算法压缩图像，不仅速度较快，而且重建后的图像质量有明显提高。     

基于多种群的自适应免疫进化计算

将免疫思想同思维进化计算相结合，提出一种新的基于多种群的自适应免疫进化算法（IABM），算法定义了选择、记忆、克隆、超变异、抑制5种基本算子．试验结果表明该算法具有高效的收敛速度，并能收敛到全局最优点．与多种群遗传算法和思维进化计算相比，IABM收敛速度更快，收敛率更高．     

一种鲁棒BP算法及其在非线性动态系统辨识中的应用

利用多层前馈神经网络的非线性建模特性，基于动态ＢＰ网络的串并联和并联模型，提出了一种高鲁棒性ＢＰ算法，与传统的ＢＰ算法相比，鲁棒ＢＰ算法有５个优点：（１）适合于非线性动态系统辨识，（２）辨识精度高；（３）不必内插所有训练样本；（４）具有高鲁棒性，能抵制过失误差和量测误差；（５）收敛速度得到了改进，因为错误差样本的影响得到了适度的抑制，把该算法用于非线性动态系统辨识，仿真结果表明此方法是有效的。     

多策略融合的改进黏菌算法

针对标准黏菌算法（SMA）存在的容易陷入局部最优解、收敛速度慢以及求解精度低等问题，提出一种多策略融合的改进黏菌算法（MSISMA）。首先，引入布朗运动和莱维飞行机制以增强算法的搜索能力；其次，根据算法进行的不同阶段分别改进黏菌的位置更新公式，以提高算法的收敛速度和收敛精度；然后，应用区间自适应的反向学习（IAOBL）策略生成反向种群，以提升种群的多样性和质量，从而提高算法的收敛速度；最后，引入收敛停滞监测策略，当算法陷入局部最优时，通过对部分黏菌个体的位置重新初始化使算法跳出局部最优。选取23个测试函数，将MSISMA与平衡黏菌算法（ESMA）、黏菌-自适应引导差分进化混合算法（SMA-AGDE）、SMA、海洋捕食者算法（MPA）和平衡优化器（EO）进行测试和比较，并对算法运行结果进行Wilcoxon秩和检验。相较于对比算法，MSISMA在19个测试函数上获得最佳平均值，在12个测试函数上获得最佳标准差，优化精度平均提升23.39%～55.97%。实验结果表明，MSISMA的收敛速度、求解精度和鲁棒性明显较优。     

一种新的变步长LMS自适应滤波算法

传统LMS算法的优点是计算简单、易于实现，缺点是收敛速度慢，如果为加快收敛速度而增大步长因子μ，则会导致大的稳态误差，甚至引起算法发散。固定步长因子无法解决收敛速度和稳态误差之间的矛盾。本文通过建立步长因子μ与误差信号之间的非线性函数关系，得出一种新的变步长自适应滤波算法（SVSLMS）。理论分析和计算机仿真结果表明该算法的性能优于传统的LMS算法和NLMS算法。即在计算量增加不多的前提下，能同时获得较快的收敛、跟踪速度和较小的稳态误差。     

Fast Stereo Matching Using Rectangular Subregioning and 3D Maximum-Surface Techniques

This paper presents a fast and reliable stereo matching algorithm which produces a dense disparity map by using fast cross correlation, rectangular subregioning (RSR) and 3D maximum-surface techniques in a coarse-to-fine scheme. Fast correlation is achieved by using the box-filtering technique whose speed is invariant to the size of the correlation window and by segmenting the stereo images into rectangular subimages at different levels of the pyramid. By working with rectangular subimages, not only can the speed of the correlation be further increased, the intermediate memory storage requirement can also be reduced. The disparity map for the stereo images is found in the 3D correlation coefficient volume by obtaining the global 3D maximum-surface rather than simply choosing the position that gives the local maximum correlation coefficient value for each pixel. The 3D maximum-surface is obtained using our new two-stage dynamic programming (TSDP) technique. There are two original contributions in this paper: (1) development of the RSR technique for fast similarity measure; and (2) development of the TSDP technique for efficiently obtaining 3D maximum-surface in a 3D volume. Typical running time of our algorithm implemented in the C language on a 512 × 512 image is in the order of a few seconds on a 500 MHz PC. A variety of synthetic and real images have been tested, and good results have been obtained.     

一种改进的RSA快速算法

本文提出一种新的RSA算法,这种算法是传统二进制算法的改进,即将指数e进行2^k进制化,减少e的序列长度,从而使新算法的迭代计算步数养活,理论分析和实际应用均表明,新算法效率有明显提高。     

工程三视图的三维恢复

本文在总结边界表示法（ＢＲ）的结构式立体几何表示法（ＣＳＧＲ）重建三维图形的基础上，提出了一种基于两者结合的三维重建方法。采用ＢＲ方法，把工程图纸的二维矢量化信息作为原始数据，逐步恢复三维点，三维边，面及ＣＳＧＲ意义下的基元体。采用ＣＳＧＲ方法，组合基元体，最终生成复合体，重建三维图形。算法以多面体为研究对象，在ＷＩＮＤＯＷ５３．０环境下实现。     

A spatially variant white-patch and gray-world method for color image enhancement driven by local contrast

Starting from the revolutionary Retinex by Land and McCann, several further perceptually inspired color correction models have been developed with different aims, e.g. reproduction of color sensation, robust features recognition, enhancement of color images. Such models have a differential, spatially-variant and non-linear nature and they can coarsely be distinguished between white-patch (WP) and gray-world (GW) algorithms. In this paper we show that the combination of a pure WP algorithm (RSR: Random Spray Retinex) and an essentially GW one (ACE) leads to a more robust and better performing model (RACE). The choice of RSR and ACE follows from the recent identification of a unified spatially-variant approach for both algorithms. Mathematically, the originally distinct non-linear and differential mechanisms of RSR and ACE have been fused using the spray technique and local average operations. The investigation of RACE allowed us to put in evidence a common drawback of differential models: corruption of uniform image areas. To overcome this intrinsic defect, we devised a local and global contrast-based and image-driven regulation mechanism that has a general applicability to perceptually inspired color correction algorithms. Tests, comparisons and discussions are presented.     

Efficient implementation of modular multiplication over 192-bit NIST prime for 8-bit AVR-based sensor node

Modular multiplication is one of the most time-consuming operations that account for almost 80% of computational overhead in a scalar multiplication in elliptic curve cryptography. In this paper, we present a new speed record for modular multiplication over 192-bit NIST prime P-192 on 8-bit AVR ATmega microcontrollers. We propose a new integer representation named Range Shifted Representation (RSR) which enables an efficient merging of the reduction operation into the subtractive Karatsuba multiplication. This merging results in a dramatic optimization in the intermediate accumulation of modular multiplication by reducing a significant amount of unnecessary memory access as well as the number of addition operations. Our merged modular multiplication on RSR is designed to have two duplicated groups of 96-bit intermediate values during accumulation. Hence, only one accumulation of the group is required and the result can be used twice. Consequently, we significantly reduce the number of load/store instructions which are known to be one of the most time-consuming operations for modular multiplication on constrained devices. Our implementation requires only 2888 cycles for the modular multiplication of 192-bit integers and outperforms the previous best result for modular multiplication over P-192 by a factor of 17%. In addition, our modular multiplication is even faster than the Karatsuba multiplication (without reduction) which achieved a speed record for multiplication on AVR processor.

     

A fuzzy set approach to Retinex spray sampling

The color sensation at a point, for the Human Visual System (HVS), derives not only from the color stimulus at that point, but also from the relative spatial arrangement of the stimuli in the image. Based on this observation, the Retinex algorithm, an early and widely studied model of the HVS, determines the output – for each chromatic channel – by rescaling the input intensity of a pixel w.r.t. a reference white level, computed by sampling the brightest points in the neighborhood of the target pixel. In this work, we argue that several elements, inherent to the above observation, can benefit from a fuzzy formalization. We show that the adoption of the fuzzy formalism allows to better encode the mutual influence of pixels. Overall, the fuzzy formalization can provide a general framework for designing and tuning image enhancement algorithms inspired by the HVS. We demonstrate its use by the construction of a fuzzy version of the point-sampling algorithm Random Spray Retinex (RSR). Using RSR as a guide, we build a more efficient algorithm, based on the fact that each spray (a set of sampled points used in RSR to determine the reference white of a specific target) can be assumed to belong to some degree to all the target pixels of the image, provided that a suitable membership function is defined. The features of this alternative formalization of RSR are discussed here, using synthetic and natural test images.     

多目的批量过程的受影响批次再调度算法

为解决多目的批量过程调度受延迟扰动的问题,提出了综合考虑新调度质量和稳定性的受影响批次再调度ABR算法,根据状态任务网STN所定义的工艺过程将受到延迟影响的所有批次向后移动最小可能值。仿真算例表明,ARB再调度算法在完成时间指标和开始时间总延迟指标上均优于现有的右移再调度法RSR。     

防范边信道攻击的逆伪操作实现算法

针对模幂运算的二元表示(BR)算法在防范边信道攻击方面存在的问题,以消除运算单元之间的功耗差异为目的,提出模幂运算的逆伪操作算法。通过对基本BR算法和逆伪操作算法的实测功耗轨迹对比和对逆伪操作算法防范边信道攻击分析,证明逆伪操作运算已达到消除运算单元之间功耗差异的预期目标。     

Investigation on uplink collaborative contention-based bandwidth request for WiMAX three hop relay networks

This paper suggests a collaborative contention bandwidth request (BR) mechanism for worldwide interoperability for microwave access (WiMAX) three-hop relay networks. By complimenting message and code BR in three hops of a link, the proposed framework enables low block error rate (BLER), packet dropping and signaling overhead while preserving the connection throughput and access delay requirements of best effort (BE) services. With three hops between base station (BS) and mobile station (MS) via relay station 1 (RS1) and relay station 2 (RS2), there take place eight possible BR mechanisms with message and code BR. Among eight BR mechanisms, message-message-code (MMC) BR performs better with message dominant BR and code-message-code (CMC) BR performs better with code dominant BR. Further, with CMC BR, the BLER is reduced by 5.88%, packet dropping is reduced by 8.68%, medium access control (MAC) overhead is reduced by 7.6%, MAC wastage is reduced by 4.47%, connection delay is reduced by 28.30%, queuing delay is reduced by 8.65%, queue size is reduced by 15.25% and throughput is improved by 11.51% than MMC BR mechanism.     

An Adaptive Borrow-and-Return Model for Broadcasting Videos

Yang proposed the concept of borrow-and-return (BR) to leverage the unused server bandwidth when a group of popular videos being broadcast with the FSFC (first segment on the first channel) broadcasting schemes in order to improve the mean waiting time (MWT) of the viewers with the help of additional receiving bandwidth available at the high-end clients. The BR model borrows the bandwidth of the videos with no new-coming viewers during a timeslot to speed up the transmission of the first segments of some of the remaining videos. In this paper, we first address the relative advantage issue among various possible BR schemes by developing a parametric generic BR (GBR) scheme controlled externally by independent borrow parameters. Later, we propose a new BR (NBR) model by incorporating an efficient transmission strategy to reduce the MWT further. Finally, an optimal NBR scheme is developed by augmenting with the optimal borrow parameters, which significantly outperforms the existing and new BR schemes in terms of overall MWT.