防区外导弹对舰攻击的效能分析

在综合分析了目前使用效能评估方法的基础上,针对导弹对舰攻击的实际,给出一种改进的阶段概率法,并对防区外导弹对舰导弹攻击的效能进行了分析,提出了评估的模型。此方法也可应用于其它对地攻击的效能评估。     

对第四层交换技术的分析

针对网络技术发展的现状 ,确定了第四层交换的定义 ,阐述了第四层交换应用的优势     

网格方程组并行计算预条件迭代若干性质及应用

对网格方程组作区域分裂并行计算 ;分析了预条件迭代谱条件的若干性质及其对算法收敛性的影响 ,为构造预处理提供了理论依据 ,并应用于区域分裂并行计算     

船用反应堆堆芯物理计算软件包的研制

基于船用反应堆结构特点与运行方式 ,通过对核电站大型机版堆芯物理计算软件的移植与修改 ,研制了微机版船用反应堆堆芯物理计算软件包 .可用于船用反应堆燃料组件参数及堆芯三维细网临界与燃耗的计算研究     

热动力系统循环泵配置方案的可靠性分析

分析了热动力系统单、双循环泵配置方案的系统可靠性影响因素 ,对双泵方案的设备、结构组件的相关性作了初步的估计和评述     

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     

一维热构件模型及其在船用核动力装置运行分析中的应用

建立了一维热构件模型 ,该模型具有广泛的适用性 ,可以模拟是否有内热源、不同几何形状及具有多种边界条件的热构件 .方程采用隐式有限差分法求解热传导方程 ,并将模型应用于核动力装置的运行分析中 .计算结果表明 ,本文所建立的一维热构件模型能逼真地描述一维热构件的温度场分布 ,计算精度高 .     

马林诺夫斯基装甲兵学院的教学分析及启示

介绍了马林诺夫斯基装甲兵学院的教学编制,对其教学计划的课程体系进行了分析研究,归纳了各类课程的教学组织特点及师资队伍建设情况,最后提出了关于我军院校建设、人才培养的几点想法.     

基于仿真的潜艇装备作战能力ANP幂指数评估方法

针对潜艇装备作战能力幂指数评估模型中评估指标之间存在相互依赖或影响关系,以及评估过程主观性较强的情况,建立了基于仿真的潜艇装备作战能力ANP幂指数评估流程;以潜艇反舰作战能力评估为例,给出了网络化评估指标体系设计与优化方法;基于专家和仿真数据的ANP超矩阵构建方法以及基于指标权重的幂指数评估模型构建方法,建立了基于仿真...     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017