基于有限障碍的全牛顿步内点算法

针对线性规划问题,文中引入了一种与传统障碍函数不同的新的障碍函数,其在可行域边界上的取值是有限的.沿此有限障碍函数所确定的新的搜索方向,给出了短步长全牛顿步内点算法,结果证明该算法具有目前求解线性规划问题最好的复杂性界.     

用于高速列车移动网络的资源分配实时算法

误码率高、频繁中断的高速列车移动场景宜采用多宿主容迟网络。但其资源分配计算复杂,实时性较差。基于效用差分法设计初始化过程资源分配算法,以保证过程中每一步的效用单调不减,算法时间复杂度降至O(n)。     

A weighted H1 seminorm regularization method for Fredholm integral equations of the first kind

Many problems in mathematics and engineering lead to Fredholm integral equations of the first kind, e.g. signal and image processing. These kinds of equations are difficult to solve numerically since they are ill-posed. Therefore, regularization is required to obtain a reasonable approximate solution. This paper presents a new regularization method based on a weighted H¹ seminorm. Details of numerical implementation are given. Numerical examples, including one-dimensional and two-dimensional integral equations, are presented to illustrate the efficiency of the proposed approach. Numerical results show that the proposed regularization method can restore edges as well as details.     

Lossless asymmetric single instruction multiple data codec

This report introduces a new lossless asymmetric single instruction multiple data codec designed for extremely efficient decompression of large satellite images. A throughput in excess of 3GB/s allows decompression to proceed in parallel with asynchronous transfers from fast block devices such as disk arrays. This is made possible by a simple and fast single instruction multiple data entropy coder that removes leading null bits. Our main contribution is a new approach for vectorized prediction and encoding. Unlike previous approaches that treat the entropy coder as a black box, we account for its properties in the design of the predictor. The resulting compressed stream is 1.2 to 1.5 times as large as JPEG‐2000, but can be decompressed 100 times as quickly – even faster than copying uncompressed data in memory. Applications include streaming decompression for out of core visualization. To the best of our knowledge, this is the first entirely vectorized algorithm for lossless compression. Copyright © 2011 John Wiley & Sons, Ltd.     

关于《求解LP问题的部分基变量算法》的勘误及补正

文章针对周康等人的《求解LP问题的部分基变量算法》一文进行了分析,指出其文中算法原理及算法步骤存在的一些错误,补正了算法的不完善之处,并通过数值试验验证算法的计算性能。     

基于结构继承的贝叶斯网结构学习优化设计

采用遗传算法建立贝叶斯网络的优化学习结构,一直是贝叶斯网络研究倍受关注的课题.传统遗传算法的个体设计存在需要反复进行无环性检验的问题,降低了进化效率.针对这个问题,提出一种新的个体编码方式.考虑到进化过程中家族得分的可继承性,提出基于家族继承的结构评分改进算法,进而设计相应的改进遗传算法.实验结果表明,改进算法在BN建网精度与效率上都得到明显提升.     

基于遗传算法的关联议题并发谈判

基于遗传算法的并发谈判在电子商务应用中具有独特的优势,但已有的研究尚未考虑议题之间的相关性、动态权重的变化规则依赖于对手信息的获取,极大地限制了其使用价值.对此,提出议题分组的方法以解决议题的相关性问题,而议题权重的变化则采取从历史资源中发掘知识的方法进行动态调整.构建了基于遗传算法的关联性议题并发谈判模型,给出了模型的形式化描述、谈判算法设计和动态权重更新方案.通过对模型的实验和比较分析,证实了该方案能够更方便地满足用户谈判的多样性需求,解决谈判中议题关联性的问题,而且能够快速、有效地得出最优谈判结果.     

基于Matlab的0-1背包问题的动态规划方法求解

背包问题是经典的NP-hard组合优化问题之一,在经济管理、资源分配、投资决策、装载设计等领域有着重要的应用价值。文中用动态规划方法解决0-1背包问题,通过在Matlab6.5环境下对其算法进行测试和与其他方法对比分析,表明应用该方法可节省大量的计算时间,因而具有更高运行效率。