基于免疫禁忌混合算法的航班快速恢复研究

为了减少枢纽机场大面积航班延误带来的经济损失，结合航班延误经济损失模型，在免疫进化算法的基础上，通过引入禁忌搜索进行优化改进，尝试用免疫禁忌混合算法解决航班延误恢复的问题。仿真实验结果表明，算法在航班快速恢复的问题中收敛速度和解的质量方面均优于标准遗传进化算法，既提高了航班恢复求解的效率，又减少了延误损失。     

一种高效的基于启发式规则和词典相结合的双语词对齐方法

双语词对齐是指在互译的双语句对中找到词汇级的对译关系,是自然语言处理领域一个非常有用而又比较困难的研究课题。本文在对当前主流的词对齐方法进行实验分析的基础上,综合考虑了各种因素,提出了基于启发式统计规则和词典相结合的方法,该方法充分利用现有资源,同时考虑到了后续的应用问题。实验表明,该方法在训练语料规模较小的情况下,取得了较好的对齐结果。     

求团之间最优路径的扩展双向广度搜索算法的改进

对求团之间最优路径的扩展扩度深度混合搜索算法进行了改进，将原算法中扩展双向广度搜索的三个过程合并为一个过程．改进算法当路径深度较小时与原算法等效，当路径深度较大时有更高的运行效率．     

Fast approximate maximum likelihood period estimation from incomplete timing data

 To estimate the period of a periodic point process from noisy and incomplete observations, the classical periodogram algorithm is modified. The original periodogram algorithm yields an estimate by performing grid search of the peak of a spectrum, which is equivalent to the periodogram of the periodic point process, thus its performance is found to be sensitive to the chosen grid spacing. This paper derives a novel grid spacing formula, after finding a lower bound of the width of the spectral mainlobe. By employing this formula, the proposed new estimator can determine an appropriate grid spacing adaptively, and is able to yield approximate maximum likelihood estimate (MLE) with a computational complexity of O(n²). Experimental results prove that the proposed estimator can achieve better trade-off between statistical accuracy and complexity, as compared to existing methods. Simulations also show that the derived grid spacing formula is also applicable to other estimators that operate similarly by grid search.     

燃油最省的四维导引算法

 本文提出了一种燃油最省的四维导引算法,可用于在线性计算同时满足燃油最省及到达时间两个条件的最优飞行轨迹。数字仿真结果表明,该算法速度快、精度高,具有工程实用价值。本文所做的工作是为机载四维飞行管理系统实现的必要准备。     

在计量管理中实现全文检索

在计量工作中,需要对大量的文档、数据进行管理.在寻找相关资料时,依靠人工方式或者简单的搜索方式,搜索效率低,不易管理.本文首先分析了这一情况,然后提出了一种基于Lucene的构建全文检索的方案,简要介绍了实现原理,并通过一个实例说明了实现方法,最后和现有的相关搜索方案进行了对比.实现全文检索后,可以有效的提高搜索效率,方便计量工作的进行.     

Rectangle expansion A*pathfinding for grid maps

Search speed, quality of resulting paths and the cost of pre-processing are the principle evaluation metrics of a pathfinding algorithm. In this paper, a new algorithm for grid-based maps, rectangle expansion A* (REA*), is presented that improves the performance of A* significantly. REA*explores maps in units of unblocked rectangles. All unnecessary points inside the rectangles are pruned and boundaries of the rectangles (instead of individual points within those boundaries) are used as search nodes. This makes the algorithm plot fewer points and have a much shorter open list than A*. REA*returns jump and grid-optimal path points, but since the line of sight between jump points is protected by the unblocked rectangles, the resulting path of REA*is usually better than grid-optimal. The algorithm is entirely online and requires no offline pre-processing. Experi-mental results for typical benchmark problem sets show that REA*can speed up a highly optimized A* by an order of magnitude and more while preserving completeness and optimality. This new algorithm is competitive with other highly successful variants of A*.     

蚁群算法在宽弦风扇叶片优化排序中的应用

从风扇转子的力学模型出发,推导了同时考虑三个维度质量矩的风扇转子静不平衡量和偶不平衡量的计算公式,并使用某型发动机风扇叶片装配和试车验证,结果表明考虑三个维度质量矩的不平衡量计算方法能显著减少配重块的使用,并减少配平次数。提出了基于邻域搜索改进的蚁群算法的风扇叶片排序优化方法,对某套风扇叶片进行优化排序。本优化算法的最优不平衡量比传统蚁群算法减少88.9%,比改进的遗传算法减少36.8%,优势明显。      

基于随机搜索法的机匣安装边螺栓连接优化设计

引入一种简便的约束优化方法——随机搜索法,通过建立机匣安装边螺栓连接的优化模型,基于Matlab平台进行了实例计算和分析,结果表明该方法应用于机匣安装边的螺栓连接优化是可行的。     

考虑目标间不同转换方式的成像卫星调度

针对相邻目标间具有不同转换方式的成像卫星调度问题,分析动作转换时间、存储容量、卫星能量等复杂约束,建立动态拓扑结构无环路有向图模型,引入非约束支配路径的概念,提出基于标记更新思想的动态路径搜索算法(DPSA)对问题进行求解。实验结果表明,考虑目标间不同转换方式的DPSA算法在牺牲一定求解效率的基础上,能够全面提高调度效果。