基于SWOT分析的军队审计容错免责机制完善路径研究

军队审计容错免责机制是在审计权限范围内对符合容错免责情形的事由减轻或免于问责并及时纠正的稳定工作机制,是审计问责态势下应对“为官不为”问题的合理路径。本文基于SWOT法分析认为,当前审计环境下建立军队审计容错免责机制的优势在于独立的经济监督地位、专业的经济监督力量和广泛的经济监督对象,劣势在于单一的认定主体、缺失的法律规范和匮乏的免责素质,机遇在于利好政策的出台、国家审计的实践经验和军队审计的职能定位,威胁在于制度规范笼统、审计风险扩大和资源矛盾加剧。在此基础上,本研究基于W-T（劣势-威胁）的战略选择,提出完善军队审计容错免责机制的现实路径,即：明确机制定位,科学界定边界;完善制度规范,形成法律依据;完备容错清单,转变审计模式;优化容错环境,降低容错风险。     

TBM模型的目标综合识别算法

利用电子支援措施(ESM)和光学成像传感器等不同类型传感器进行目标综合识别,是现代综合电子战中的一个重要研究课题。TBM是D-S证据理论的一个扩展模型,它研究了D-S证据理论的动态部分,从数据融合的角度来看,它是一种层次化的递进模型,尤其适用于需要逐层进行数据、特征或决策级融合的融合系统。提出了一种基于TBM模型的异类传感器目标综合识别算法,充分利用了电子侦察和光学成像侦察提供的独立、互补的信息,获得了对目标的有效识别。仿真结果证明了这种算法的有效性。     

空袭目标流威胁评估与排序模型研究

结合现代防空作战的特点和指挥自动化系统的工作过程,对影响目标威胁评估的各种因素进行了分析,利用模糊综合评价等理论和方法,给出了进行威胁评估的因素集和评价集,建立了相应的数学模型,叙述了进行威胁评估与排序的方法、步骤和一般准则.     

基于评价指标模糊集的复杂系统效能评估方法研究*

提出了一种基于评价指标模糊集的复杂系统效能评估方法。该方法利用系统评价指标的模糊性构造模糊集,以模糊集贴近度来定义评价指标的模糊隶属度函数,结合模糊层次分析法,提出了一种适用于复杂系统功能与多层评估指标体系的效能评估新方法。仿真应用的结果表明:该方法行之有效,具有较好的实用前景。     

具有节点失效的网络可靠度的信息交互算法

提出了一种用于计算具有节点失效的网络可靠度的新计算方法。该算法依据不交化代数及协同计算的思想,采用节点信息义互的方法直接获得网络的不交化最小路集。算法简便易行,具有分布计算的特点,为大型网络系统的可靠性度计算提供了一种新的途径。     

Minimal LST representations of MAP(n)s: Moment fittings and queueing approximations

A Markovian arrival process of order n, MAP(n), is typically described by two n × n transition rate matrices in terms of rate parameters. While it is straightforward and intuitive, the Markovian representation is redundant since the minimal number of parameters is n² for non‐redundant MAP(n). It is well known that the redundancy complicates exact moment fittings. In this article, we present a minimal and unique Laplace‐Stieltjes transform (LST) representations for MAP(n)s. Even though the LST coefficients vector itself is not a minimal representation, we show that the joint LST of stationary intervals can be represented with the minimum number of parameters. We also propose another minimal representation for MAP(3)s based on coefficients of the characteristic polynomial equations of the two transition rate matrices. An exact moment fitting procedure is presented for MAP(3)s based on two proposed minimal representations. We also discuss how MAP(3)/G/1 departure process can be approximated as a MAP(3). A simple tandem queueing network example is presented to show that the MAP(3) performs better than the MAP(2) in queueing approximations especially under moderate traffic intensities. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 549–561, 2016     

基于区间直觉模糊集的目标优先级求解方法

针对复杂防空作战环境下多目标优先级难以准确评估的问题,提出了基于区间直觉模糊集理论的目标优先级求解算法。首先系统分析了影响目标优先级的因素以及各影响因素与目标优先级之间的非线性关系。其次,对区间直觉模糊集的得分函数和精确函数进行了改进,考虑了犹豫度信息对决策结果的影响,并且提出了基于得分函数和精确函数的目标优先级求解算法。最后通过仿真算例验证了算法的有效性。     

集对分析和LS-SVM相结合的装备研制风险综合评价法

为有效降低或规避武器装备研制风险,确保装备研制项目的顺利推进,提出一种基于集对分析理论与最小二乘支持向量机方法的装备研制风险综合评价方法。根据武器装备研制特点,建立装备研制风险评价指标体系。在此基础上,引入集对分析理论中的联系度和集对概念构建训练样本和测试样本。利用样本对最小二乘支持向量机进行训练测试,得到装备研制风险的评价模型,并给出评价结果。案例分析表明,所提方法过程简便,定性定量结合,形式易于理解,评价结果也更加贴近实际,对于提升装备研制项目风险管理和决策水平,具有重要的实际意义。     

Optimal motion planning in rapid‐fire combat situations with attacker uncertainty

This article provides a modeling framework for quantifying cost and optimizing motion plans in combat situations with rapid weapon fire, multiple agents, and attacker uncertainty characterized by uncertain parameters. Recent developments in numerical optimal control enable the efficient computation of numerical solutions for optimization problems with multiple agents, nonlinear dynamics, and a broad class of objectives. This facilitates the application of more realistic, equipment‐based combat models, which track both more realistic models, which track both agent motion and dynamic equipment capabilities. We present such a framework, along with a described algorithm for finding numerical solutions, and a numerical example.     

An eikonal equation based path planning method using polygon decomposition and curve evolution

Path planning is a key technique of autonomous navigation for robots, and the velocity field is an important part. Constructing velocity field in a complex workspace is still challenging. In this paper, an inner normal guided segmentation algorithm in a complex polygon is proposed to decompose the complex workspace in this paper. The artificial potential field model based on probability theory is then used to calculate the potential field of the decomposed workspace, and the velocity field is obtained by utilizing the potential field of this workspace. Path optimization is implemented by curve evolution, during which the internal force generated in the smoothing process of the initial path by a mean filter and the external force is obtained from the gradient of the workspace potential field. The parameter selection principle is deduced by analyzing the influence of several parameters on the path length and smoothness. Simulation results show that the designed polygon decomposition algorithm can effectively segment complex workspace and that the path optimization algorithm can shorten and smoothen paths.