基于虚拟布站和运动目标信源的时差控制模型

针对时差定位无源雷达战场目标模拟问题,构建了基于虚拟长基线布站和运动目标信源的时差控制模型,设计的新型时差调制模式,可满足时差信号生成设备的时差范围和精度要求,突破了时差定位无源雷达零基线状态无法定位的技术难题。基于该模型的战场目标模拟系统,实现了携有高精度时差信息的多路射频信号输出,能够为该类装备日常操作演练提供电磁环境支撑。     

基于案例的推理在舰船维修费预测中的应用

针对市场经济条件下舰船维修费预测不确定性越来越大的问题,提出了一种基于案例推理的舰船维修费预测模型。首先,利用修船厂的历史数据,采用特征向量表示法构建舰船维修费案例库;其次,为提高案例检索效率,采用组合模糊聚类算法建立舰船维修费案例的分类索引结构,并提出基于最近邻法的两步检索策略检索相似案例;最后,采用加权平均法对相似案例进行修改以获取预测值,同时采用主动学习策略保存当前案例并更新案例库。实例仿真结果表明:与传统舰船维修费预测模型相比,基于案例的推理模型具有更高的预测精度,所提模型是有效的。     

15000m~3钢板贴壁油罐建设静态投资分析

以部队某保障基地油库军用柴油扩容工程采用钢板贴壁工艺新建的1座15 000 m3地下水封油池为例,从技术经济学角度对钢板贴壁油罐作了静态投资分析。该钢板贴壁油罐静态总投资1 756.95万元,其中占总投资比例最高者为地下工程建设,达到53.76%,库容投资1 171.30元/m3。结果表明:钢板贴壁油罐较地下水封石洞油罐整体经济效益明显;投资定额可供编制预算参考。     

基于作业成本原理的飞行训练保障费用模型

飞行训练保障费用是飞机使用保障费用中的重要组成部分,也是使用保障费用估算的重点和难点。结合目前航空兵部队实际工作情况,首先利用作业成本法的基本原理,对航空兵部队飞行保障阶段的作业进行划分,得出成本库及成本动因。其次针对军机飞行保障阶段的多种作业,建立基于作业成本法的飞行训练保障费用模型。最后通过算例说明其比其他估算方法所具备的优势。     

Batch scheduling with step‐deteriorating processing times to minimize flowtime

Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于OPENGL的面目标平均相对毁伤计算方法

目前,均匀面目标平均相对毁伤的计算无论是解析法还是模拟法都采用了将面目标离散化的思想,存在着离散方法困难、计算精度差等特点.基于OpenGL像素颜色混合机制,提出了直接用像素点对面目标进行离散的方法,并结合Monte-Carlo模拟方法实现了对均匀面目标平均相对毁伤的计算,给出了算法的实现步骤,通过计算实例对计算结果进行了分析.实验结果表明,此方法是计算均匀面目标平均相对毁伤一种快速有效的方法.     

储运过程反应失控型火灾爆炸事故的预测与防范

储运化学活泼性物质时易发生反应失控型火灾爆炸事故,其危险性随着容器的增大和储运时间的增长而增加.介绍一种储运容器中反应失控火灾爆炸事故危险性预测的方法,预测结果与实际情况具有良好的一致性,并对预防事故的冷却方法进行了实验研究.     

装备采办与军代表工作形势及应对措施

分析了我军装备采办的现状与军代表工作面临的形势 ,着重从体制、技术以及军代表意识三个方面就如何发挥军代表在装备采办中的作用谈些个人观点     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

Case‐based reasoning and improved adaptive search for project scheduling

Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule‐based methods still constitute the most important class of these heuristics. Of these, in turn, parametrized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rule‐based methods known. Yet, even the “best” such algorithms are unable to relate to the full range of instances of a problem: Usually there will exist instances on which other algorithms do better. We maintain that asking for the one best algorithm for a problem may be asking too much. The recently proposed concept of control schemes, which refers to algorithmic schemes allowing to steer parametrized algorithms, opens up ways to refine existing algorithms in this regard and improve their effectiveness considerably. We extend this approach by integrating heuristics and case‐based reasoning (CBR), an approach that has been successfully used in artificial intelligence applications. Using the resource‐constrained project scheduling problem as a vehicle, we describe how to devise such a CBR system, systematically analyzing the effect of several criteria on algorithmic performance. Extensive computational results validate the efficacy of our approach and reveal a performance similar or close to state‐of‐the‐art heuristics. In addition, the analysis undertaken provides new insight into the behaviour of a wide class of scheduling heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 201–222, 2000