侵华日军暴行的铁证——日军战俘及投诚官兵控诉日军暴行档案揭秘

解放军档案馆馆藏档案中,珍藏着多件抗战期间被改造日军战俘和投诚日军官兵控诉侵华日军暴行的档案,从暴行直接参与者、见证人的视角,反思、忏悔和揭露侵华日军对中国军民所犯下的累累罪行,是研究侵华日军暴行极其重要的历史文献。70多年后的今天,公布和研究这些档案史料,对于世人了解日本侵华战争的血腥历史和日本军国主义的滔天罪行,驳斥日本右翼势力刻意篡改历史、美化侵略行径的恶毒言论,警示爱好和平的人们,具有十分重要的意义。     

被动全向声纳浮标跟踪潜艇的优化布放方法

反潜飞机利用被动全向声纳浮标可以隐蔽地跟踪潜艇,但浮标消耗量大。在满足定位精度的条件下,如何优化布放浮标以便有效增加跟踪时间是一个亟待解决的问题。首先分析了浮标探测性能和浮标群相对位置对定位精度的影响,得到浮标布放的五种基本原则;然后结合水下目标跟踪技术提出了两种用被动全向声纳浮标跟踪潜艇的优化布放方法:一种是利用遗传算法来优化每一枚浮标的布放位置,另一种是将一批次投放2-4枚浮标的多维优化问题简单转换成一维优化问题来确定浮标的布放位置。最后仿真计算了这两种方法的跟踪性能及浮标消耗量。仿真结果表明,两种优化布放方法均能满足跟踪要求,前者的浮标消耗量比后者略少,但后者的投放批次少很多,有利于减少人员的工作量。     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

基于实体的指挥控制仿真建模

指挥控制是军队遂行军事任务的关键环节,对指挥控制过程进行建模并采用仿真的方法对其效能进行评估,进而考察指挥控制系统的典型效能指标是否符合预期的需求,具有重要的理论和应用意义。采用基于实体的仿真建模方法,提出指挥控制过程的实体仿真建模框架,以信息流为重点,从信息获取、信息融合、信息共享、自身任务规划、作战筹划、部队掌控、任务执行和信息输出等八个方面对其进行建模,实现了对指挥控制过程的描述,有效支撑了指挥控制系统仿真效能评估。     

舰载弹炮结合近程反导武器系统火力分配模型研究

为最大程度发挥弹炮结合武器系统的作战效能,引入优化设计方法求取最大毁伤概率,建立了基于毁伤概率的火力分配模型。该模型将弹炮结合武器系统导弹和火炮的火力分配转化为导弹火力分配。根据导弹杀伤纵深和发射间隔确定导弹发射数量。根据导弹在杀伤区内毁伤概率特性,确定导弹发射时机。     

The bottleneck problem with minimum quantity commitments

Given an edge‐distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introduce minimum quantity commitments to balance workloads of suppliers, provide the best possible approximation algorithm, and study its generalizations and specializations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

信息化车辆装备试验场建设探析

本文主要阐述了建设信息化车辆装备试验场的必要性、基本概念、基本特点与建设的基本途径,旨在为我军轮式车辆装备试验场的信息化建设提供参考。     

军工企业转型问题中的三个不等式

在当前鼓励民营资本进入军品市场,参与军工企业的改组改造这一政策背景下,分析了当前军工企业转型中的竞争与管制、姓"军"与姓"民"、法制与法治等三对辩证关系,澄清了对民营资本参与军工企业改组改造这一举措的模糊认识,对更好地推进优质民营企业参与军工建设有现实意义。     

硫二甘醇及其相关氧化产物的硅烷化衍生反应条件优化及应用

研究了衍生气相色谱法测定芥子气的降解产物硫二甘醇、硫二甘醇亚砜和硫二甘醇砜的方法,并对影响衍生反应的溶剂、温度、时间和衍生试剂用量进行了优化,该法操作简便、灵敏度高。     

甲基三硫代膦酸二乙酯合成反应液的气相色谱-质谱分析

在OPCW第18次水平考试土样中检测到一未知化合物,经多种分析技术测定,判断可能是甲基三硫代膦酸二乙酯．对合成甲基三硫代膦酸二乙酯的反应液进行了气相色谱一质谱测定,并对此反应液中的部分产物进行了质谱解析．