发动机传感器数据证实的贝叶斯信度网络方法

针对发动机及其部件试验传感器数据证实的多源证据融合问题,描述了建立贝叶斯信度网络的方法,给出了传感器状态和检验关系式不确定性信息表达方法,发展了自动建立贝叶斯信度网络、计算可信度概率及更新网络的算法;给出了贝叶斯信度网络方法在模型发动机上的应用示例。     

Inducing coordination in supply chains through linear reward schemes

Decentralized decision‐making in supply chain management is quite common, and often inevitable, due to the magnitude of the chain, its geographical dispersion, and the number of agents that play a role in it. But, decentralized decision‐making is known to result in inefficient Nash equilibrium outcomes, and optimal outcomes that maximize the sum of the utilities of all agents need not be Nash equilibria. In this paper we demonstrate through several examples of supply chain models how linear reward/penalty schemes can be implemented so that a given optimal solution becomes a Nash equilibrium. The examples represent both vertical and horizontal coordination issues. The techniques we employ build on a general framework for the use of linear reward/penalty schemes to induce stability in given optimal solutions and should be useful to other multi‐agent operations management settings. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

时间跨度对GPS坐标序列噪声模型及速度估计影响分析

选取全球范围内72个基准站的坐标序列,采用改进的赤池信息量准则、贝叶斯信息量准则对不同噪声模型组合进行噪声分析,得到基准站坐标序列的最优噪声模型及速度参数,探讨时间序列跨度对噪声模型及速度估计的影响。结果表明,基准站坐标序列噪声模型不能由单一的噪声模型表述,其呈现出多样性特征,主要表现为幂律噪声、高斯马尔科夫噪声、闪烁噪声+白噪声特征,且三坐标分量表现出不同的噪声特性;随着时间跨度的增加,坐标时间序列的最优噪声模型、GPS站速度及其不确定度逐渐由发散趋于收敛,随机游走噪声模型的比重有所增加。结果表明10 a以上的时间跨度是较为理想的噪声模型估计尺度。     

稀疏贝叶斯学习框架下的扩展目标雷达关联成像

传统的关联成像方法未考虑复杂扩展目标的结构信息,在高分辨成像时的应用受到限制,为此提出一种自适应结构配对稀疏贝叶斯学习方法。该方法在稀疏贝叶斯学习的框架内针对扩展目标建立一种结构配对层次化高斯先验模型,然后采用变分贝叶斯期望-最大化算法交替进行目标重构和参数优化。该方法将某一信号分量的重构与周围信号分量联系起来,并能在迭代过程中自适应地调整表征各信号分量相关性的参数。实验结果表明,该方法针对扩展目标可以有效地进行高分辨成像。     

军事云环境下基于动态博弈的资源调度方法

针对军事云环境下联合指挥资源调度优化问题,综合考虑了多部队任务需求,多目标优化,多部队资源竞争等约束条件,运用动态博弈理论及方法,建立并提出了一种基于完全信息扩展博弈的资源调度模型及方法,提高了资源调度效率,兼顾了多部队利益,增加了联合作战效益。最后通过实验验证了其有效性及准确性。     

Decentralized admission control of a queueing system: A game‐theoretic model

Consider a distributed system where many gatekeepers share a single server. Customers arrive at each gatekeeper according to independent Poisson processes with different rates. Upon arrival of a new customer, the gatekeeper has to decide whether to admit the customer by sending it to the server, or to block it. Blocking costs nothing. The gatekeeper receives a reward after a customer completes the service, and incurs a cost if an admitted customer finds a busy server and therefore has to leave the system. Assuming an exponential service distribution, we formulate the problem as an n‐person non‐zero‐sum game in which each gatekeeper is interested in maximizing its own long‐run average reward. The key result is that each gatekeeper's optimal policy is that of a threshold type regardless what other gatekeepers do. We then derive Nash equilibria and discuss interesting insights. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 702–718, 2003.     

基于攻击树的网络安全事件发生概率评估

为了提高网络安全风险概率预测的准确性,采用攻击树模型作为网络安全事件的描述模型,改进了攻击结点的定义,提出了网络安全事件发生概率的推算方法和攻击路径的分析方法,利用贝叶斯网络方法量化攻击树模型中原子事件结点的发生概率。实例表明该方法科学、客观、有效,为制订安全防护策略提供有力支持。     

基于贝叶斯方法的大学生学习成绩影响因素分析

本文采用社会科学研究中常用的贝叶斯方法,利用MCMC模拟中的Gibbs抽样技术,分析了新疆大学某学院本科生的学习成绩的影响因素,研究发现,高考分数和地域因素对该系学生的学业影响较大,同时发现地域和高考分数的交互作用对学生学习成绩也具有较明显的影响。为分析新疆大学学生的学习差异提供了科学依据。     

基于离散模糊动态贝叶斯网络的空战威胁估计

对空战中目标的各个特征因素进行了分析,建立了空战目标威胁估计的离散模糊动态贝叶斯网络模型,并利用离散动态贝叶斯网络的直接推理算法进行了仿真计算.仿真结果表明,该方法得到的推理结果与理论分析完全一致,而且能够将各种并不显著的特征因素进行综合,使得各个特征因素间及不同时间片的同一特征因素相互修正补充.为空战威胁估计提供了一种有效而准确的方法.     

Bayesian inference for a Lanchester type combat model

We undertake inference for a stochastic form of the Lanchester combat model. In particular, given battle data, we assess the type of battle that occurred and whether or not it makes any difference to the number of casualties if an army is attacking or defending. Our approach is Bayesian and we use modern computational techniques to fit the model. We illustrate our method using data from the Ardennes campaign. We compare our results with previous analyses of these data by Bracken and Fricker. Our conclusions are somewhat different to those of Bracken. Where he suggests that a linear law is appropriate, we show that the logarithmic or linear‐logarithmic laws fit better. We note however that the basic Lanchester modeling assumptions do not hold for the Ardennes data. Using Fricker's modified data, we show that although his “super‐logarithmic” law fits best, the linear, linear‐logarithmic, and logarithmic laws cannot be ruled out. We suggest that Bayesian methods can be used to make inference for battles in progress. We point out a number of advantages: Prior information from experts or previous battles can be incorporated; predictions of future casualties are easily made; more complex models can be analysed using stochastic simulation techniques. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 541–558, 2000