基于改进AOE网络的低频浮动车数据地图匹配算法

由于低频浮动车数据时间间隔较长,现有地图匹配方法难以满足低频浮动车数据地图匹配的要求.综合考虑浮动车数据轨迹点之间的整体特性,在局部和全局地图匹配算法的基础上,提出了一种基于改进AOE网络的低频浮动车数据地图匹配方法.首先,采用相交分析判断GPS点缓冲区和候选路段的关系,以获取候选路段和候选匹配点;其次,基于四叉树空间索引和Dijkstra算法,获取候选匹配点之间的最短路径;第三,设计了一种改进AOE网络,提出了基于改进AOE网络的最短可达路径算法,以获取最终的地图匹配点;最后,对改进AOE网络的地图匹配算法进行评价,并通过实验分析了算法的时间效率和正确率.实验结果表明:基于改进AOE网络的地图匹配算法正确率为95.3%,程序执行总时间为96.8 s. 其正确率分别比点到线的局部地图匹配方法和基于弱Frchet距离的全局地图匹配方法的正确率高13.6%和2.8%.      

A POCS-Based Algorithm for Blocking Artifacts Reduction

Introduction Block-based discrete cosine transform(BDCT) is considered to be a basic tool in bothstill and moving image compression standards,such as JPEG, H.261/263, and MPEG, owing toits near-optimal energy compaction property andmoderate hardware complexity. However, sinceeach N×N block is coded independently, the re-constructed images would exhibit annoying discon-tinuities along block boundaries at low bit rate,which are often referred to as the“blocking arti-facts”in the transfo…     

A Note on Shor''s Quantum Algorithm

Shor proposed a polynomial time algorithm for computing the order of one element in a multiplicative group using a quantum computer. Based on Miller's randomization, he then gave a factorization algorithm. But the algorithm has two shortcomings, the order must be even and the output might be a trivial factor. Actually, these drawbacks can be overcome if the number is an RSA modulus. Applying the special structure of the RSA modulus,an algorithm is presented to overcome the two shortcomings. The new algorithm improves Shor's algorithm for factoring RSA modulus. The cost of the factorization algorithm almost depends on the calculation of the order of 2 in the multiplication group.     

求解Job-Shop车间作业调度的混合算法

提出了一种解决车间作业调度最短完成时间的有效的混合算法．基于考虑到遗传算法的早熟收敛问题和禁忌搜索算法的自适应优点，该算法结合了遗传算法和禁忌搜索算法对Job—Shop车间作业调度问题的解进行编码，通过实例表明该算法是可行和有效的．     

A Novel Method for Character Segmentation in Natural Scenes

Introduction Nowadays the applications of scene text recog-nition are rapidly expanding with the developmentof portable digital imaging devices[1]. However,character extraction from scene images has alwaysbeen a challenging problem due to complex back-ground, uneven illumination, shadows and noise ofimages[2]. Besides, languages also impose anotherlevel of variation in text. Characters in such lan-guages as Chinese, Japanese and Korean are usual-ly composed of several strokes, which do not n…     

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

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

改进的自适应遗传算法及其在作业车间调度中的应用

针对自适应遗传算法在复杂问题应用中前期收敛速度缓慢和容易陷入局部最优的不足，引入了一种新的调节交叉概率和变异概率的方法，并提出了一种新的交叉方式，该算法很好地增强了自适应遗传算法的全局搜索能力，提高了收敛速度．通过比较几个优化实例，验证了本文算法的有效性．     

A Distributed Authentication Algorithm Based on GQ Signature for Mobile Ad Hoc Networks

Introduction Mobile ad hoc networks (MANETs) are newinfrastructureless networks without the usual rout-ing infrastructure like fixed routers and routingbackbones. A mobile ad hoc network is a multi-hop temporary self-organizing system compromisedof a group of mobile nodes with radios. MANETshave some special characteristics: self organizing,dynamic topology, limited bandwidth, resourceconstraint nodes, multi-hop routing, vulnerable tosecurity attacks etc. Recently, MANET has beenone of t…     

A Distributed Virtual Backbone Formation for Wireless Ad Hoc and Sensor Networks

The virtual backbone is an approach for solving routing problems in wireless ad hoc and sensor networks. A connected dominating set (CDS) was proposed as a virtual backbone to improve the performance of wireless networks. The quality of a virtual backbone is measured not only by approximation factor, which is the ratio of its size to that of minimum CDS, but also time complexity and message complexity. In this paper, a distributed algorithm is presented to construct a minimum CDS for ad hoc and sensor networks. By destroying triangular loops in the virtual backbone, the proposed algorithm can effectively construct a CDS with smaller size. Moreover, our algorithm, which is fully localized, has a constant approximation ratio, linear message and time complexity, and low implementation complexity. The simulation results and theoretical analysis show that our algorithm has better efficiency and performance than conventional approaches.     

A Note on k-Limited Maximum Base

Introduction Findingaspecialmaximumbaseofamatroidis aninterestingproblem.Theproblemhasmanyappli cationsinnetworks,graphtheory,andcombinatorial optimization.InRef.[1],Edmondsgavearelation betweenamatroidandgreedyalgorithm,which answeredhowtofindthemaximumb…     

一种改进的模型跟随自适应控制算法

提出了一种改进的模型跟随自适应算法(DS-AMFC),即把系统输出的误差引入控制信号,同时,利用线性神经网络对系统(k+1)时刻输出误差预测,并利用该预测值对系统进行控制。仿真表明该改进算法较原算法有较强的跟随模型的能力。     

求解旅行商问题的一种新方法

目前关于旅行商问题的启发式算法主要分为两类:环路构造算法和环路改进算法.通过对两类近似算法的深入研究,提出了一种新的方法――简化模型法来求解旅行商问题.该方法通过排序和选择操作得到原网络图的简化模型,对简化模型中的路径进行重构得到旅行商问题的解.通过测试TSPLIB中的实例,表明用简化模型法求解旅行商问题解的质量高、收敛快,时耗小,该算法是实用的.     

一种集装箱船配载问题改进算法探讨

集装箱船配载问题是整个集装箱海上运输工程中重要的一个环节。在装箱问题的降序最先适应算法和降序最优适应算法的基础上,提出了一个改进的降序最优适应的集装箱船配载算法,模拟配载的结果表明该算法能够较好解决集装箱船配载问题的求解。     

一种新型多核判别分析方法

为了给模式分类和维度约简提供有效的手段,在综合L1-MKDA和L2-MKDA两种多核KDA优点的基础上,提出一种以预定内核函数的线性组合,并结合混合范数正则化函数实现核权重的稀疏性和非稀疏性平衡的新型弹性多核判别分析方法(semi-infinite-programming-based flexible multi-kernel discriminant analysis, S-FMKDA).该方法用半无限规划方法求解弹性多核判别分析算法,并通过混合正则化实现核的自学习.在不同数据集上的实验结果表明:S-FMKDA比目前常见的KDA、KDAP、KDAG、L1-MKDA、L2-MKDA、UMKDA核判别分析方法的精度提高5%.      

基于货物时间价值的物流网络最优配送路径模型研究

本文构建了物流配送网络中货物时间价值相关的最小配送费用路径模型,并研究了其算法。模型把整个配送过程分为运输过程和装卸过程,并且考虑了由于运输过程和装卸过程时间延迟造成的货物价值损失,这也是和其它类似成本路径模型最大的区别。该模型算法可以利用计算机自动完成,不受物流配送网络大小和节点的限制,并保证算法的正确性。     

一种获取与优化模糊规则基的混合学习算法

提出了一种二层学习算法来优化模糊规则基。利用Ｔａｋａｇｉ－Ｓｕｇｅｎｏ模糊神经网络对一个模糊规则基进行参数学习,学习方法为梯度下降法,然后利用遗传算法对规则基进行结构调整,采用二进制编码方法,一条规则对应于一个基因位,一个规则基对应于一条染色体。这种二层优化方法能较好地减少模糊规则基的冗余度,化简模糊规则基。仿真实验也证实了这一点。     

结合区域分割和Wishart分类器的机场跑道区域快速检测方法

提出了一种结合区域分割和Wishart分类器的极化合成孔径雷达图像机场跑道区域快速检测方法; 利用简单线性迭代聚类算法分割极化合成孔径雷达图像, 并将分割得到的超像素作为后续分类处理的基本单元; 采用一种优化后的距离度量方式给超像素分配类别标签, 解决了传统Wishart距离度量因子冗余运算量大的问题; 分析了机场跑道区域像素的极化散射特性, 利用机场跑道区域的弱散射特性从分类结果中提取感兴趣区域; 利用机场跑道的结构特征筛选辨识感兴趣区域, 进而确定机场跑道区域的准确位置; 利用极化合成孔径雷达实测数据测试了算法的有效性, 并与传统基于像素的检测结果进行对比。试验结果表明: 该算法在复杂大场景下能够快速有效检测出机场跑道区域, 检测出的跑道轮廓清晰, 结构比较完整; 采用简单线性迭代聚类算法预处理图像极大地降低了后续处理的复杂性; 针对墨西哥湾试验数据, Wishart分类器处理单元个数分别是Freeman+Wishart算法和FCM+Wishart算法的1.0%和2.4%, 整个检测过程耗时分别为Freeman+Wishart算法和FCM+Wishart算法的9.9%和27.1%;针对大岛试验数据, Wishart分类器处理单元个数分别是Freeman+Wishart算法和FCM+Wishart算法的1.0%和2.6%, 整个检测过程耗时分别为Freeman+Wishart算法和FCM+Wishart算法的14.0%和31.8%。可见, 所提检测方法的实时性能优于基于像素的检测方法。      

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…     

求解预支约束下商品批发零售问题的近似算法

研究了求解预支约束下批发零售问题的一种新的近似算法,这一算法是一种改进的贪婪算法,即将部分穷举法与贪婪算法相结合并从理论上分析了该算法的可靠性和有效性,最后得出了该算法的性能保证为1-e-1.     

求解流水车间调度问题的一种启发式算法

针对以总完工时间最小为目标的流水调度问题,提出了一个启发式算法:采用经典的调度规则构造初始解,通过禁忌搜索提高解的质量.仿真结果表明了算法的可行性,具有较好的工程应用价值.