Analytic solution for the nucleolus of a three‐player cooperative game

The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Supply chain coordination with shelf‐space and retail price dependent demand and heterogeneous retailers

We consider supply chain coordination in which a manufacturer supplies some product to multiple heterogeneous retailers and wishes to coordinate the supply chain via wholesale price and holding cost subsidy. The retail price is either exogenous or endogenous. The market demand is described by the market share attraction model based on all retailers'shelf‐spaces and retail prices. We obtain optimal solutions for the centralized supply chain, where the optimal retail pricing is a modified version of the well‐known cost plus pricing strategy. We further get feasible contracts for the manufacturer to coordinate the hybrid and decentralized supply chains. The manufacturer can allocate the total profit free to himself and the retail market via the wholesale price when the retail price is exogenous, but otherwise he cannot. Finally, we point out that different characteristics of the retail market are due to different powers of the manufacturer, and the more power the manufacturer has, the simpler the contract to coordinate the chain will be. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于先验知识的降秩STAP方法研究

提出了一种基于杂波先验知识的降秩(RR)空时自适应处理(STAP)方法——KA-RR法,该方法首先利用载机平台运动参数、雷达系统参数及地形、地貌参数等先验知识构建机载雷达杂波模型,然后通过该模型对机载雷达杂波数据进行预白化处理,最后利用降秩STAP方法自适应抑制剩余杂波。仿真结果表明,相对于传统的降秩STAP方法,KA-RR方法具有更好的杂波抑制性能和更强的鲁棒性。     

在排球比赛中双人拦网时吊球技术的运用

现代排球技战术的飞速发展,运动员的不断＂身高化＂使得排球比赛的网上对抗异常激烈,当主、副攻位置遭到拦网的阻挠而不能有效的扣球时,积极合理的采用排球吊球技术可以达到扣球同样效果,所以在平时的训练和比赛中要重视排球吊球在比赛中起到的作用。     

海浪水压场正态性及参数模型

在对不同海域、不同海况和不同水深下测的大量海浪水压场数据分析的基础上,采用Epps-Pulley检验方法对海浪水压场信号的正态性进行了检验,进而利用Box-Jenkins方法对海浪水压场信号服从何种线性模型进行了辨识。结果表明,在100 s时间内,海浪水压场信号服从或近似服从正态分布,并可利用AR模型对其进行描述。     

基于CAS/Agent的装甲装备战损模型仿真

针对传统战损模型研究方法存在的不足,提出用人工神经网络的学习能力模拟Agent的适应性。借鉴CAS(Complex Adaptive System)理论的建模思想,引入ERA(Environment-Rules-Agents)方案建立战损模型。在外部干预Agent作用下,运用BP算法并结合CT(Cross Target)算法对红蓝双方对抗战斗进行仿真,模拟动态战场环境下装备损伤的演化过程。该模型可更好地理解装备损伤的动力学特性。     

对特殊类型Feistel密码的Square攻击

对轮函数为SP结构的两类特殊类型Feistel密码抗Square攻击的能力进行了研究。通过改变轮函数中P置换的位置从而给出了此类Feistel密码的等价结构,以SNAKE(2)和CLEFIA为例,给出了基于等价结构Square攻击的具体过程,将6轮SNAKE(2)的Square攻击的时间复杂度由224降为213.4;将6轮CLEFIA的Square攻击的时间复杂度由234.4降为212.4。结果表明,在设计轮函数为SP结构的Feistel密码时,必须充分考虑等价结构对算法抗Square攻击的影响。     

饱和系统的线性最优容错不变集

针对饱和系统的容错控制问题,提出了一种D稳定约束下系统吸引域的估计方法。分别以不变集和参考集的容量为优化目标,给出了两个优化容错不变集的充分条件。为解决不变集优化中出现的双线性矩阵不等式(BMI)问题,通过构造包含线性矩阵不等式(LMI)的目标函数,将它转化为非线性规划的形式进行求解。通过一个仿真实例对该方法进行验证。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

FMEA与粗糙集相结合的故障预测方法

基于FMEA和粗糙集决策系统基本理论,对飞机中分系统故障预测问题进行了研究。首先定义故障预测所需的征兆并对系统进行FMEA,按照FMEA分析结果分次向系统模型注入引起特定故障的事件,采集含有故障趋势的系统模型的信息用于构建适用于故障预测的粗糙集决策表,对该表进行了处理,最终发现用于故障预测的知识(即决策规则和算法);最后运用所发现的知识进行故障预测。