应用D-S证据理论进行多传感器雷达体制识别

在阐述Dempster-Shafer(D-S)证据理论的基础上,较系统地论述了基于D-S证据理论的多传感器雷达体制识别的数据融合方法,并给出了具体的识别实例。实验结果证明了基于多传感器融合后的识别结果明显优于单传感器的识别结果,说明了D-S证据理论的有效性和先进性。     

综合目标识别的输入信息源研究

利用多源信息进行综合目标识别能提高识别的准确性和及时性,为了解决综合目标识别中输入信息源的运用问题,通过分析各种输入信息源的特点,根据这些特点分别采用了针对性的技术手段转化和处理,为最后的识别决策提供了有效的信息,对进一步深入研究综合目标识别具有参考价值。     

毛泽东战场造势思想探析

谋势造势是毛泽东军事思想的重要组成部分,具有丰富的内涵和鲜明的特色。研究这一内容,既是继承和发扬毛泽东军事思想的需要,也是指导信息化条件下作战的需求。研究认为,争夺优势和主动是毛泽东战场造势的灵魂;善于机动和调敌是毛泽东战场造势的核心;利用民势和地势是毛泽东战场造势的特色。     

基于贝叶斯网络的空中目标意图识别方法

针对空中目标意图识别问题,对防空作战中的战场事件进行了分类定义,根据事件之间的关联关系,提出了基于贝叶斯网络的空中目标意图识别方法,在此基础上,给出了网络模型的构建和推理方法,最后以一个示例说明了方法的有效性。     

试论高校思想政治理论课实践环节教育

社会实践环节是高校思想政治理论课的重要组成部分,在大学生思想政治教育中占有不可替代的重要位置。然而当前社会实践环节在思想认识、组织领导、运行机制等方面存在着一些亟待解决的困难和问题。本文认为,思想政治理论课社会实践环节必须坚持自主性、专业性、互利性、实效性原则,从制度建设、资金保障、评价制度等多方面提高思想政治理论课社会实践环节教育的实效性。     

军用认知无线电网络中功率控制博弈算法的探讨

通过对比军用认知无线功率控制博弈模型与一些经典的功率控制博弈算法,提出了一种认知无线电网络中的功率控制的博弈算法。通过仿真结果性能分析,证明算法具有一定的优越性,并且能够为军事无线通信提供一定的理论依据和现实作用。     

编队协同反导决策方案优选

为了充分地调度好编队全部的抗导资源,实现抗导弹群的成功概率最大,在利用随机服务系统理论对编队协同反导决策方案各指标值进行计算的基础上,将"模糊优选理论"与"协同学原理"有机地结合起来,求解了在反舰导弹到达强度与舰空导弹的单发杀伤概率在不同值的情况下,编队协同反导决策方案的隶属度,为编队指挥员进行反导决策方案的优选提供了科学依据。     

基于关联离散度的目标类型识别方法

针对空中作战空中目标识别问题,在分析影响目标类别因素的基础上,提出了一种基于关联离散度的空中目标灰色识别方法。该方法采用灰色理论,通过应用定义的关联离散度作为识别测度,因而在无需对现役雷达作太多技术改进的情况下,就可以提高低分辨雷达对空中目标粗略分类的自动判别能力。给出了应用该方法的具体步骤,通过仿真实例证明该算法的有效性。     

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time. Most of this work has focused on makespan minimization as social objective. In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics. In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time; and each machine sequences its jobs in weighted shortest processing time (WSPT) order. Whereas for the makespan social cost the price of anarchy is not bounded by a constant in most environments, we show that for our minsum social objective the price of anarchy is bounded above by a small constant, independent of the instance. Specifically, we show that the price of anarchy is exactly 2 for the class of unit jobs, unit speed instances where the finite processing time values define the edge set of a forest with the machines as nodes. For the general case of mixed job strategies and restricted uniform machines, we prove that the price of anarchy equals 4. From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Bayesian analysis of queues with impatient customers: Applications to call centers

Queuing models have been extensively used in the literature for obtaining performance measures and developing staffing policies. However, most of this work has been from a pure probabilistic point of view and has not addressed issues of statistical inference. In this article, we consider Bayesian queuing models with impatient customers with particular emphasis on call center operations and discuss further extensions. We develop the details of Bayesian inference for queues with abandonment such as the M/M/s + M model (Erlang‐A). In doing so, we discuss the estimation of operating characteristics and its implications on staffing. We illustrate the implementation of the Bayesian models using actual arrival, service, and abandonment data from call centers. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012