MADM中不同属性的规范化研究

不同属性值的规范化是多属性决策问题中的重要过程.提出了一种属性值作为点到优区间和劣区间的距离的定义,依据该定义得到了属性值规范化新方法,并通过实例证明了新规范化方法的有效性.     

基于鱼雷航程实时预报的潜射线导鱼雷可攻性判断

针对新型潜射线导鱼雷可攻性判断的决策需求,在分析传统的鱼雷可攻性判断方法不足的基础上,提出以鱼雷航程实时预报作为线导鱼雷可攻性判断的决策依据.并对线导方位导引法进行了深入分析,给出了概略目标运动要素情况下鱼雷航程实时预报的解析模型,该模型可实时预报线导鱼雷航程和鱼雷线导段航行时间.经大量仿真计算验证.解析模型预报结果作为鱼雷可攻性判断依据是具有合理性的,该方法能较好地满足线导鱼雷攻击决策的需求.     

双枝模糊评判在舰炮性能评估中的应用*

针对舰炮武器性能指标,运用双枝模糊决策方法对舰炮武器性能进行综合评估.该方法提出了新的论域[-1,1],使评估更能符合人的思维逻辑,能够客观的对舰炮性能进行评估,通过对多中舰炮的具体参数指标进评估,得出各种舰炮的性能优劣的排序,具体的数学模型仿真表明,对舰炮武器性能的评估是行之有效的.     

能力型防空群指控系统概念模型及效能评估

为提高能力型防空群整体作战能力,应用系统论方法分析了能力型防空群指控系统的构成要素及运行模式,提出了指控系统信息结构力的概念,建立了能力型防空群指控系统概念模型。在此基础上,提出了能力型防空群指控系统效能评估指标体系,运用网络复杂性理论、图论、集合论及信息论方法建立了能力型防空群指控系统的物理性能及信息结构力计算模型,给出了指控系统效能综合评估函数,可为防空指控系统构建提供参考。     

基于GAHP的模糊综合评判法在潜艇 作战方案评估中的应用

潜艇作战方案评估是辅助对潜指挥员决策的重要方法,而评估的科学性对决策的有效性影响很大.利用多人层次分析法(GAHP)和模糊综合评判相结合的方法,对潜艇作战方案进行评估,评估的结果可信度高,有利于对潜指挥员的正确决策.最后,通过实例证明了方法的有效性.     

数据挖掘在器材保障决策支持中的应用研究

针对器材保障现状,运用数据挖掘技术,探索器材保障决策支持问题.设计了器材保障决策支持系统中数据挖掘应用的解决方案,该方案包括了项目规划和应用设计,并以器材平时消耗预测为例,运用多元回归模型算,法进行了挖掘实现.数据挖掘为保障决策提供了更加丰富和科学的信息,可以较好地满足器材保障决策支持的需要.     

一种新的基于粗糙集的连续属性离散化算法

粗糙集理论作为一种新的处理含糊和不确定性问题的数学工具,已成为国际学术界的一个前沿的研究领域.传统的粗糙集理论只能对数据库中的离散属性进行处理,而绝大多数现实的数据库既包含了离散属性,又包含了连续属性.针对传统粗糙集理论的这一缺陷,提出了一种改进的基于断点重要性的属性离散化方法.最后,通过实例分析说明该方法是有效的.     

Information security: Designing a stochastic‐network for throughput and reliability

Todas information and communication network requires a design that is secure to tampering. Traditional performance measures of reliability and throughput must be supplemented with measures of security. Recognition of an adversary who can inflict damage leads toward a game‐theoretic model. Through such a formulation, guidelines for network designs and improvements are derived. We opt for a design that is most robust to withstand both natural degradation and adversarial attacks. Extensive computational experience with such a model suggests that a Nash‐equilibrium design exists that can withstand the worst possible damage. Most important, the equilibrium is value‐free in that it is stable irrespective of the unit costs associated with reliability vs. capacity improvement and how one wishes to trade between throughput and reliability. This finding helps to pinpoint the most critical components in network design. From a policy standpoint, the model also allows the monetary value of information‐security to be imputed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008