等概率抽样群体演化算法的隐含并行性

在等概率抽样群体的条件下,讨论了演化算法的隐合并行性,得到了算法每代隐含处理的模式长度不超过ls（0≤ls≤l）的不同模式期望数的精确表达,并估计了其上下界．     

叶剑英军事谋略初探

叶剑英在军事谋略领域给后人留下了极其丰厚和宝贵的精神财富。其精髓,正在于他一贯地坚持“把唯物辩证法正确地运用在军事领域中,作为判断情况、定下决心、指导战争的唯一法宝”。本文以此为切点,探讨了叶剑英军事谋略的主要内容及特色:全面、客观地认识和判断战争;辩证地对待战争局部与全局的关系;依据敌我情况运筹作战行动;善于预见,抓住中心;灵活运用谈判、外交、宣传等手段,化劣势为优势;着眼于特点,着眼于发展。     

地籍数据库点线拓扑一致性并行检查方法

针对拓扑检查算法复杂、计算量大,串行计算已远不能满足海量地籍数据高效拓扑检查需求的问题,在分析了点线拓扑关系的并行特点基础上,将界址点的数据划分方法与界址线的QR空间索引方法相结合,实现了界址点与界址线的并行拓扑计算。用某地区实际的界址点集与界址线集对点线拓扑并行检查进行实验。测试结果表明:并行检查算法的并行效率随着进程数的增加而有所衰减,但稳定在30%以上,加速比达到5以上,且相比于Arc GIS效率提升了30倍以上。并行检查方法以工具的方式集成应用于高性能地理计算平台中,应用效果良好。     

语音识别技术综述

本文综述了语音识别领域里的主要技术。首先,系统地介绍了孤立词识别系统中的算法和技术。然后,简要介绍了连续语音识别系统中的主要处理方法。最后,说明了语音理解系统中的特殊问题。     

Modeling and solution for the ship stowage planning problem of coils in the steel industry

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015     

Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014     

鹤管气阻与泵汽蚀分析

鹤管气阻与泵汽蚀所指的对象不同,但两者具有相同的物理意义,都是指当液体介质的绝对压力小于其实时饱和蒸气压时所体现的物理现象。阐述了鹤管气阻的原因及目前解决的措施,分析了离心泵汽蚀方程的物理意义。根据能量平衡方程,推导出吸入系统管道不发生气阻的安装高度方程,并与泵不发生汽蚀的安装高度方程进行了对比分析。最后得出结论,要保证离心泵正常工作,必须同时满足吸入系统工艺管道安装高度要求以及泵安装高度要求。     

定性测量与定量测量火炸药静电感度的对比分析

采用先进测试系统,对氮化铅、硝化棉、梯恩梯和黑索金火炸药静电感度分别进行了定性测量和定量测量,得出了相对静电感度值和实际静电感度值,并对其进行了对比分析。     

COM文件加密的一种方法

本文在研究微机加密方法及磁盘噪信号后,提出利用噪信号作为一种识别标志,实现了,COM文件的加密。文中对加密的原理、方法及反解密方法进行了介绍。     

A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production

This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011