武器系统研制费投资分布规律的仿真研究

针对大型项目多峰、复杂费用分布的传统仿真建模方法模型选取过于复杂、且难以达到精度要求等不足,提出将一种基于支持向量机的机器学习方法应用于大型复杂武器系统研制费投资分布研究.计算结果表明,这种方法有效弥补了传统建模方法的缺陷,有更好的泛化能力和实用性,因而可以作为研究此类问题的一种新方法.     

A robust policy for serial agile production systems

One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A note on the optimality of index priority rules for search and sequencing problems

We show that the linear objective function of a search problem can be generalized to a power function and/or a logarithmic function and still be minimized by an index priority rule. We prove our result by solving the differential equation resulting from the required invariance condition, therefore, we also prove that any other generalization of this linear objective function will not lead to an index priority rule. We also demonstrate the full equivalence between two related search problems in the sense that a solution to either one can be used to solve the other one and vice versa. Finally, we show that the linear function is the only function leading to an index priority rule for the single‐machine makespan minimization problem with deteriorating jobs and an additive job deterioration function. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

论军事技术和装备保障的关系

探讨了军事技术与装备保障相互影响的一般原理,对陆军装备技术进行了简单分类,并对各类技术对装备保障的影响进行了重点探讨,以期能对陆军装备保障的发展有所启示。     

基于支持向量机的雷达弹道外推方法仿真研究

支持向量机是一种求解回归预测问题的优秀决策方法,具有坚实的理论基础和优秀的预测性能。为解决目前雷达弹道外推中存在的精度不高和不能有效识别弹道等问题,对基于支持向量机的雷达弹道外推方法进行了仿真设计,并通过仿真弹道模拟雷达采样,进行了仿真实验。仿真实验结果表明:基于支持向量机的雷达弹道外推方法实用可行,可以获得较高的外推精度,并且能够有效地进行弹道识别。     

基于灰色系统理论的潜艇作战效能评估

为研究潜艇装备的作战使用效能,提出其效能评价指标体系。用改进的权重分析法确定潜艇作战效能评价指标权重,用改进的灰色评估理论建立潜艇作战效能评估模型。以某常规潜艇为例,用建立的模型进行量化评估,能充分利用决策者的判断信息,较为准确地反映实际情况。该模型可为部队训练和作战提供潜艇装备的战斗效能数据,找出影响潜艇作战能力的敏感因素,为发展新型装备提供依据。     

支持向量机在弹药训练消耗量预测中的应用

针对部队平时弹药训练消耗量预测过程中,样本采集数目较少的实际情况,采用了一种新的预测方法———支持向量机。该方法基于统计学习理论的原理,较好地解决了小样本的学习问题。并以某部队1997—2002年弹药训练消耗量为学习样本,建立了弹药年消耗量的预测模型。计算结果表明,这种方法比传统的方法有更少的误差和更好的预测精度。     

学生“隐性流失”的法律关系分析

因学校对学生及其家长施加种种压力而产生的学生“隐性流失”是“普九”中的普遍现象。“隐性流失”从法律关系的角度看 ,其实质是九年制义务教育法律关系中义务人对权利人接受并完成九年制义务教育权利实施侵害甚至剥夺的结果 ,是对我国教育法律规范侵犯的结果。从违法行为人主观方面看 ,“隐性流失”包含的违法有两种 :一是主观故意的违法 ,二是主观过失的违法。确保学校和政府的“义务人”法律地位 ,应该成为控制“隐性流失”的关键。     

基于协同相关度的作战任务分解优化

针对协同作战中任务分解的优化问题,构建了任务协同相关度的量化模型。对作战任务中几个基本概念进行定义,从时间、逻辑、功能3个维度对任务间的协同关系进行了形式化描述,在此基础上,建立了任务协同关系的综合度量模型。最后,通过设置任务协同度阈值的方法,对协同紧密的任务进行聚合,实现任务分解的优化。通过仿真实验验证了模型的可行性和有效性。     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.