An Optimal Parallel Algorithm for the Knapsack Problem Based on EREW

IntroductionGivenn positiveintegersW =(w1,w2 ,… ,wn)andapositiveintegerM ,theknapsack problem (alsocalledthesubsetsum problembysomeauthors)isthedecisionproblemoffindingasetI {1 ,2 ,… ,n},suchthat∑i∈I=M ,i∈I .ThisproblemwasprovedtobeNP complete[1] ;i     

A Polynomial Time Algorithm for Checking Regularity of Totally Normed Process Algebra

A polynomial algorithm for the regularity problem of weak and branching bisimilarity on totally normed process algebra(PA) processes is given. Its time complexity is O(n3+ mn), where n is the number of transition rules and m is the maximal length of the rules. The algorithm works for totally normed basic process algebra(BPA) as well as basic parallel process(BPP).     

基于OpenMP的并行遗传算法求解SAT问题

为了提高SAT （boolean satisfiability） 问题求解效率,在OpenMP （open multi-processing） 编程框架下,将遗传算法与局部搜索算法结合,改进了混合遗传算法中的选择算法,将原有选择操作的时间复杂度降低到O(N)级别. 算法采用OpenMP中的编译制导语句#pragma omp parallel粗粒度并行化驱动混合遗传算法,采用#pragma omp single语句块实现了子种群间个体的同步迁移操作. 与同类算法HCGA （hybrid cloud genetic algorithm）比较分析表明:改进算法HGA （hybrid genetic algorithm）以及并行后的混合遗传算法CGPHGA （coarse-grained parallel hybrid genetic algorithm）在求解成功率和求解效率上都有显著提高,部分问题求解成功率提高达5倍.      

求解背包问题的一种新的近似算法

给出了求解背包问题的一种新的近似算法,这一算法是一种改进的贪婪算法,即将部分枚举法与贪婪算法相结合.从而使其具有更好的性能保证.同时,从理论上证明了这一算法的可靠性.最后,通过具体算例验证了算法的有效性.     

A NEW RSA CRYPTOSYSTEM HARDWARE IMPLEMENTATION BASED ON MONTGOMERY‘S ALGORITHM

IntroductionData security is becoming a more and more im-portantissue nowadays with the ever- creasing pop-ularity of electronical communication[1] . The fun-damental security requirements include confiden-tiality,authentication,data integrity,and nonre-pudiation.To provide such security services,mostsystems use public key cryptography. Among thevarious public key cryptography algorithms,theRSA cryptosystem is the bestknown,most versa-tile,and widely used public key cryptosystem to-day.In pu…     

遗传算法在求解背包问题中的应用

对决策优化的经典背包问题进行了研究,提出了应用遗传算法对该模型进行求解,两例背包问题实例研究表明,遗传算法优化结果较其它方法都更合理。     

运输问题原设－对偶算法的一个改进

本文对运输问题的原设－对偶算法运用推拉流思想进行改进,得到一个拟多项式时间算法。该算法使用的数据结构简单,运行时间界为Ｏ（Ｕ＿ｎ（ｍ＋ｎ）￣３）,其中ｍ为产地数目,ｎ为销地数口,Ｕ表示整体待运量。      

基于能效的D2D通信系统中资源复用策略研究

针对D2D通信(device-to-device communication)与传统蜂窝通信共存下的能效资源复用问题,联合考虑蜂窝用户和D2D用户对的QoS约束,结合电路消耗功率,提出一种基于能效的D2D用户对与蜂窝用户最优匹配的资源复用和功率分配策略,分析了D2D用户对复用蜂窝用户资源的最优功率的存在性,并用分式规划理论求解了该最优功率的闭合表达式.仿真结果表明,相比已有算法,所提的能效资源复用策略的D2D用户的总能效最优,并且该总能效在低QoS要求下相比最大化和速率算法提高36.25%,高QoS要求下略高于基于节能的功率分配算法,同时还具有1.7~3 Mbit/s的和速率.      

RES脉内特征的差分进化粒子群投影寻踪评价模型

针对雷达辐射源信号脉内特征综合评估存在标准单一、缺乏客观性等问题,提出了基于群体智能的雷达辐射源信号脉内特征综合评估模型.首先,通过投影寻踪算法将雷达辐射源信号脉内特征的综合评估问题转化为有条件限制的多元非线性目标函数的优化问题;其次,通过改进的粒子群优化算法与差分进化算法的结合得到新的智能算法;最后,利用该算法实现多元非线性目标函数的优化求解.仿真结果表明:该群体智能算法对Rosenbrock测试函数的最优适应度值最小,对Rastrigrin函数和Girewank测试函数的最优适应度值为0,说明该算法的计算精度优于其他算法.同时适应度值的方差比标准粒子群算法和差分进化算法小,说明该算法的收敛性和鲁棒性较好.通过与加速遗传算法对评估问题目标函数5次优化结果的比较,本算法的计算结果没有波动,说明基于群体智能的RES脉内特征综合评估模型能够更客观、更有效地实现对RES脉内特征的综合评估.      

Parallel Distributed Implementation of Truss Optimization on a Local Area Network

A two-level optimization method for the design of complex truss and parallel distributed implementation on a LAN is presented using parallel virtual machine (PVM) for Win 32 as message passing between PCs. The volumes of truss are minimized by decomposing the original optimization problem into a number of bar optimization problems executed concurrently and a coordinate optimization problem, subject to constraints on nodal displacements, and stresses, buckling and crippling of bars, etc. The system sensitivity analysis that derives the partial derivatives of displacements and stresses with respect to areas are also performed in parallel so as to shorten the analysis time. The convergence and the speedup performances as well as parallel computing efficiency of the method are investigated by the optimization examples of a 52-bar planar truss and a 3 126-bar three-diraensional truss. The results show that the ideal speedup is obtained in the cases of 2 PCs for the 3 126-bar space truss optimization, while no speedup is observed for the 52-bar truss. It is concluded that (1) the parallel distributed algorithm proposed is efficient on the PC-based LAN for the coarsegrained large optimization problem; (2) to get a high speedup, the problem granularity should match with the network granularity;and (3) the larger the problem size is, the higher the parallel efficiency is.     

一种基于盲运算的1比特压缩感知重建算法

为了解决1比特压缩感知中符号匹配追踪算法(matching sign pursuit)在稀疏度未知的情况下不能自适应重构信号的问题,提出了向前/向后迭代符号匹配追踪算法(forward-backward matching sign pursuit, FBMSP).该算法以逐步逼近理论为核心,通过逐步扩大支撑集来扩大搜索范围,把相邻两次迭代的差值作为终止条件,在MSP算法模型下进行盲运算,以实现信号的重构.数值试验表明:在控制迭代系数=8,=1的情况下,FBMSP算法比传统的符号匹配追踪算法重构精度提高了3 dB,运算时间减少了40%.      

基于在线有向无环图的船舶轨迹压缩算法

为了解决船舶轨迹数据的压缩问题, 提出了一种船舶轨迹在线压缩算法; 使用多次滑动推算船位判断方法清洗船舶轨迹, 使用在线有向无环图在干净轨迹上建立压缩路径树并输出采样点; 为了提高轨迹队列和路径树在内存中的查询速度, 使用哈希表对其进行管理; 为了验证提出算法的效果, 比较了真实船舶自动识别系统数据与方向保留算法、道格拉斯-普克算法的压缩时间和误差, 采用可视化方法分析了原始轨迹、清洗轨迹和压缩轨迹。试验结果表明: 在压缩时间方面, 方向保留算法和道格拉斯-普克算法的压缩时间分别约为提出算法的1.1、1.3倍, 说明提出的算法比其他2种算法的处理时间更短; 提出的算法在压缩过程中保留了时间信息, 平均同步欧氏距离误差在任何压缩率下都能保持在10 m以下, 最大同步欧氏距离误差在压缩率为1%时仅有127 m, 而其他2种算法的平均同步欧氏距离误差和最大同步欧氏距离误差不受控制, 会随机变化; 在垂直距离误差方面, 提出的算法与道格拉斯-普克算法在压缩率不小于5%的条件下, 都能保证垂直距离误差小于20 m, 而方向保留算法的垂直距离误差会随机变化; 在显示效果方面, 提出的算法能有效清除轨迹噪声点, 压缩轨迹能够较好地代表原始轨迹的宏观交通流情况。可见, 提出的算法能更高效地保留原始轨迹的形状和时间信息。      

基于移动Agent的MANET多约束QoS路由算法

针对节点能量和可用带宽2个约束条件的问题,提出了一种基于移动Agent的QoS路由算法.该算法利用移动Agent采集网络中各节点的详细信息,以最大链路的生存时间作为选择路由的基础,增强了路径的稳定性;采用多路径策略,以缩短路由重构的时间;优先选择剩余能量多的节点,延长了网络的生存时间.利用网络仿真工具NS2进行的仿真实验结果证明,与AODV协议相比,该算法具有较高的包传输率和较低的端到端平均延时.     

应急车辆动态路径选择的两阶段优化模型

为研究突发事件情境下交通路网动态变化时的应急车辆路径选择问题，提出应急车辆动态路径选择的两阶段调度优化模型。通过结合路网动态状况和应急救援特征，建立基于最大路径可靠度和最短行程时间的两阶段优化模型；通过混沌搜索改进布谷鸟算法初始种群，并加入蛙跳算法改进局部搜索操作，设计混合布谷鸟算法，改善全局寻优能力；以某市某区部分区域路网为例，将该区域路网实时交通数据应用于模型和求解算法中。实验表明，利用两阶段优化模型和算法编码方案能成功获得出发点到救援点的动态可靠路径，相同行驶路径情况下模型与算法求解的最短行程时间与实地驾车获得的最短行程时间最大误差不超过8%，说明优化模型可行。3 种不同算法求解K最短路径的结果发现，混合布谷鸟算法得到的最短行程时间比粒子群算法和 经典布谷鸟算法得到的结果都要小，且计算时间最短，表明混合布谷鸟算法求解的结果最优，性能最好。     

Distributed model predictive control with one-step delay communication for large-scale systems and a case study

A distributed model predictive control（MPC） scheme with one-step delay communication is proposed for on-line optimization and control of large-scale systems in this paper. Cooperation between subsystems is achieved by exchanging information with neighbor-to-neighbor communication and by optimizing the local problem with the improved performance index in the neighborhood. A distributed MPC algorithm with one-step delay communication is developed for the situation that there is a one-step delay in the information available from its neighbors when a subsystem solves the local optimization problem. The nominal stability is employed for the whole system under the distributed MPC algorithm without the inequality constraints. Finally, the case study of the reactor-storage-separator（RSS） system is illustrated to test the practicality of the presented control algorithm.     

Image series segmentation and improved MC algorithm

A semiautomatic segmentation method based on active contour is proposed for computed tomography （CT） image series. First, to get initial contour, one image slice was segmented exactly by C-V method based on Mumford-Shah model. Next, the computer will segment the nearby slice automatically using the snake model one by one. During segmenting of image slices, former slice boundary, as next slice initial contour, may cross over next slice real boundary and never return to right position. To avoid contour skipping over, the distance variance between two slices is evaluated by an threshold, which decides whether to initiate again. Moreover, a new improved marching cubes （MC） algorithm based on 2D images series segmentation boundary is given for 3D image reconstruction. Compared with the standard method, the proposed algorithm reduces detecting time and needs less storing memory. The effectiveness and capabilities of the algorithm were illustrated by ,experimental results.     

寻找车辆最优路径的混合算法

从可见度、信息浓度更新、参数对蚁群算法加以改进,可见度计算利用节约值及距离,使用较优的数个解完成信息浓度的更新,根据迭代次数的改变灵活设置的影响系数,然后引入交换法完成局部搜索,得到混合算法。用此法对物流配送车辆路径问题进行求解,寻找最优路径。该方法得到车辆数为5veh,配送路径总长为855．68km,优于遗传算法的求解结果,表明该方法可行。     

UET系统在m台处理机上的一种调度算法及其性能分析

本文介绍了一种UET系统中有效的调度算法,其时间复杂性函数为O(na(n)+e)。该算法对m=2台处理机的调度为最优,而对m≥3台处理机上的未确定调度子问题,其解与最优解之比的最小上界为2-2/m,它也是一个近似程度相当好的有效算法。     

实时监测无线传感器网络改进方法

结合危险品运输监测应用,搭建了基于无线传感器网络的实时监测系统,并对其MAC层协议和物理层无线数据发送时序进行了改进和优化。改进了MAC层中的原始BEB算法,引入了支持优先级的GDCF算法。对MAC层中的RTS/CTS方式进行了有效性分析,并出于节能考虑,引入了睡眠技术。在物理层数据无线发送过程中,为缩短发送时间,减少碰撞可能性,对其时序进行了优化。在工程车辆上安装基于IRIS无线传感器的节点平台进行实际测试。测试结果表明:改进后的退避算法节点丢包率随网络节点数目增加变化不明显;去除RTS/CTS机制后,在采样间隔时间为50ms时,网络丢包率由20%左右下降到了6%以内;一个工作周期内节省能量达到95%;无线数据发送时序优化达到了设计要求,满足了实际应用中对实时监测无线传感网络的性能要求。     

An Enhanced NEH Method in Solving Permutation Flow Shop Problem

This paper proposed an enhanced NEH with full insertion moves to solve the permutation flow shop problem.The characteristics of the original NEH are investigated and analyzed,and it is concluded that the given method would be promising to find better solutions,while the cost would be increased.Fast makespan calculating method and eliminating non-promising permutation policy are introduced to reduce the evaluation effort.The former decreases the time complexity from O(n4m) to O(n3m),which is an acceptable cost for medium and small size instances considering the obtained solution quality.The results from computational experience show that the latter also can eliminate a lot of non-promising solutions.