基于MDFT框架的海上能源通道航线动态决策建模与仿真

针对常规海上航线决策没有考虑决策选择过程的问题,引入多选择决策场理论（ MDFT）,构建了海上能源通道航线动态决策模型。基于信息完备、信息不确定和特殊情况等三种情景想定,进行了海上能源通道航线规划决策及其实验仿真。结果表明,决策过程受时间压力和信息质量的制约,时间压力会制约决策质量,同时还可能引起“偏好逆转”现象,信息不确定也会导致确定性决策。该模型不仅综合考虑了海上能源通道航线选择时需关注的各类要素,且模型参数可动态调整,进而能合理模拟真实的海上状况和决策过程。     

信息化条件下空战威胁评估指标体系

目标威胁评估是空战决策研究的重要组成部分,评价指标是进行威胁评估的前提和基础。根据现代空战的特点,借鉴网络中心战思想,从空间态势、物理域、信息域、认知域4个角度,构建了信息化条件下空战目标威胁评估指标体系,并对指标体系进行了完备性、合理性、有效性检验。通过实例分析表明威胁评估指标能较好地反映信息化条件下空中目标的实际威胁,为空战决策研究提供参考。     

基于向量相似度的组合赋权方法

针对多属性决策中属性权重的确定问题,提出了一种基于向量相似度的主、客观权重的集成方法。用权向量的相似度作为不同赋权方法重要性的度量,意义明确,计算简单,可操作性强。最后结合算例验证了此方法的有效性和实用性。     

行政复议机关在行政诉讼中的被告地位研究

行政复议制度具有其独立的功能价值,而我国现行法律关于经复议后如何确定行政诉讼被告的规定,却存在着许多弊端,使得这种功能价值很难体现。实践中,行政权的依法行使需要司法权强有力的监督,因此,有必要将行政复议的结果尤其是行政复议维持决定纳入司法审查范围。从行政诉讼法关于被告问题的规定和行政复议法中复议机关的职责责任方面对现行法律规定的完善进行了探讨。     

A novel gradient approach for optimal design and sensitivity analysis of EWMA control charts

Conventional control charts are often designed to optimize out‐of‐control average run length (ARL), while constraining in‐control ARL to a desired value. The widely employed grid search approach in statistical process control (SPC) is time‐consuming with unsatisfactory accuracy. Although the simulation‐based ARL gradient estimators proposed by Fu and Hu [Manag Sci 45 (1999), 395–413] can alleviate this issue, it still requires a large number of simulation runs to significantly reduce the variance of gradient estimators. This article proposes a novel ARL gradient estimation approach based on integral equation for efficient analysis and design of control charts. Although this article compares with the results of Fu and Hu [Manag Sci 45 (1999), 395–413] based on the exponentially weighted moving average (EWMA) control chart, the proposed approach has wide applicability as it can generally fit into any control chart with Markovian property under any distributions. It is shown that the proposed method is able to provide a fast, accurate, and easy‐to‐implement algorithm for the design and analysis of EWMA charts, as compared to the simulation‐based gradient estimation method. Moreover, the proposed gradient estimation method facilitates the computation of high‐order derivatives that are valuable in sensitivity analysis. The code is written in Matlab, which is available on request. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 223–237, 2014     

基于马尔科夫决策的目标选择策略

目标选择是军事计划的关键要素之一。基于马尔科夫决策方法,解决具有复杂目标间关联的多阶段目标选择问题。使用与或树描述目标体系各层状态间的影响关联,并以目标体系整体失效为求解目的,建立了基于离散时间MDP的多阶段打击目标选择模型。在LRTDP算法基础上提出一种启发式方法,通过判断从当前目标体系状态到达体系失效状态的演化过程中的可能资源消耗和失败概率,来提供对当前状态的评估值,该方法能有效排除问题搜索空间中不能到达体系失效目的的中间状态,压缩了由于目标间复杂关联而增长的巨大状态空间。用实验验证了该方法有效性,实验结果表明,该方法直观实用,对目标间具有复杂关联关系的目标打击决策有一定参考价值。     

因素状态值为模糊数的变权综合决策方法

对因素权重为实数、因素状态值为模糊数的多因素不确定性决策问题,由实数型状态变权向量导出模糊数状态变权向量,得出模糊数变权公式,建立模糊数变权综合决策模型,最后给出一个应用模糊数变权综合决策模型的实例.     

South Sudan and the pitfalls of power

For the people of South Sudan, the promise of independence is saddled with challenges similar to those witnessed by post-independence Africa in the late 1950s and early 1960s. Then, the euphoria was short lived as several African countries lapsed into a state of authoritarianism, corruption and instability. The question is, what went wrong and can South Sudan learn from Africa's past? This update observes that there are differences in context between South Sudan and post-independence Africa, but maintains that South Sudan faces similar dangers: independence could easily turn into disenchantment and come to haunt the leaders of Africa's newest state should they fail to take concrete measures to transform institutions to be accountable, inclusive and responsive to people's needs.     

基于可能性决策的敌对危机行动预测与仿真

可能性决策能较好地应对军事领域常常出现的概率难以获得,或者强调“出奇制胜”而有意规避概率风险的情形,是解决知识不完备情况下敌对行动预测的有力手段。从可能性理论基本公理体系出发,结合动态规划方法,提出并证明可能性决策的最优化定理,给出多步条件下可能性决策的实现算法,结合危机条件下敌对行动预测的范例和仿真分析,与传统概率风险决策进行比较,体现可能性决策的优越性,为该方法的推广应用创造条件。     

Limiting behavior of the stochastic sequential assignment problem

The stochastic sequential assignment problem (SSAP) considers how to allocate available distinct workers to sequentially arriving tasks with stochastic parameters such that the expected total reward obtained from the sequential assignments is maximized. Implementing the optimal assignment policy for the SSAP involves calculating a new set of breakpoints upon the arrival of each task (i.e., for every time period), which is impractical for large‐scale problems. This article studies two problems that are concerned with obtaining stationary policies, which achieve the optimal expected reward per task as the number of tasks approaches infinity. The first problem considers independent and identically distributed (IID) tasks with a known distribution function, whereas in the second problem tasks are derived from r different unobservable distributions governed by an ergodic Markov chain. The convergence rate of the expected reward per task to the optimal value is also obtained for both problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013