基于MSOA神经网络模型的装备保障费用预测

引入基于多步骤优化方法(MSOA)神经网络模型用以预测装备保障费用。实验结果表明,与传统的ARIMA时间序列模型和常规BP神经网络模型相比,基于MSOA神经网络预测模型具有更高预测精度。因此,该模型是一种更有效的装备保障费用预测模型。     

Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种舰船目标一维距离像识别的新方法

提出了一种基于傅里叶-梅林变换和二叉树支持向量机相结合的舰船目标一维距离像识别方法。该方法充分利用了傅里叶-梅林变换具有的时移与尺度不变性和支持向量机在小样本分类中的优势,可以改善目标的特征稳定性,提高识别性能。针对多类舰船目标的识别,提出采用聚类分析中的均值距离来生成二叉树,将分类器分布在各个节点上,构成了多类支持向量机,减少了分类器数量和重复训练样本的数量。对4类舰船目标仿真实验的结果表明,该分类方法具有较高的识别性能、较快的识别速度。     

网络中心化决策优势建模及分析*

决策优势能力是判断军事信息系统体系结构设计优劣的一个重要依据。对网络中心化决策优势能力评估进行了研究,给出了决策优势的能力模型,并利用信息熵理论建立了决策知识的数学描述;将信息系统体系结构转换为抽象的决策网络,并根据任务划分和群决策机制自动生成决策子网;建立了基于拓扑结构的网络复杂性模型;综合决策知识和网络复杂性,建立了决策子网和整个决策网络的决策优势能力评估模型。最后,结合应用案例分析验证了方法的有效性。     

陆军战斗决心方案评估方法研究

战斗决心方案评估是陆军指挥员及指挥机关组织战斗过程中的一项重要工作。研究评估方法为陆军部队行动选择战斗决心方案提供依据。对战斗决心方案的评估,根据决心方案的战术手段、作战目标选择、战斗部署等三项主要内容,建立评估指标体系和评估数学模型,得出综合评估结果。该量化分析的评估方法提高了决策的精确性。     

Coordinated dynamic control of marketing and production

We study the dynamic profit maximization problem for a firm exercising control on both marketing and production. The firs marketing effort impacts the current‐period demand, which in turn affects future demand in a dissipating fashion. Under linear‐cost and zero‐leadtime assumptions, we show that the firm should follow base‐point rules for both marketing and production, whereas trends of the base points reflect a certain complementarity between marketing and production. We obtain comparable results when marketing costs are convex. Our computational study identifies conditions under which simple fixed‐marketing‐effort and fixed‐marketing‐target heuristics would perform well. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

软件保障费用估算模型研究

分析了软件保障费用的基本构成和一般表达式,构建了软件错误更改费用估算模型、新功能保障费用估算模型和有时间限制的保障费用估算模型,并结合实例进行了分析。软件保障模型估算的研究对提高软件保障费用估算的精度和效率有重要意义。     

强化军人精神支柱的途径

在新形势下 ,围绕“打得赢、不变质”两个历史性课题 ,强化精神支柱 ,坚定理想信念 ,应努力建设良好的政治环境 ,以正确的思想理论、昂扬的革命精神和严格的组织纪律来教育、激励和约束官兵 ,不断强化军人精神支柱。     

一种通用仿真支撑系统在模拟器研制中的应用

介绍了一种通用仿真支撑系统MINIS的功能及主要特点,阐述了其建模原理与实现方法,并以一个电站模拟器研制的实例说明了其在仿真软件开发中的应用.     

Scheduling jobs and maintenance activities on parallel machines

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ j ≤ m, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000