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     

基于事例推理的装备软件成本估算研究

采用基于事例推理的估算方法可以很好地解决传统经验函数估算软件成本时的局限性。讨论了装备软件成本估算和基于事例推理研究的特点，从总体上描述了基于事例推理装备软件成本估算系统结构和实现流程，阐述了主要的研究内容，包括影响软件成本因素、系统的事例表示方法以及相似度的基本算法及事例的改写，并通过实例验证了事例推理在装备软件成本估算实践中的具体应用。     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

机动目标一维距离像RAT法线性化补偿

研究了机动目标宽带线性调频脉冲回波全去斜率信号模型,根据速度和加速度的调频频谱展宽特点,提出了机动目标宽带一维距离像线性化调频回波模型,给出了Radon模糊图转换(RAT)法线性参数估计与运动补偿方法,并进一步分析了测速和测距误差.仿真实验验证了RAT法一维距离像线性化参数估计与补偿,表明该方法很好地解决了运动参数未知情况下机动目标的一维距离像频谱展宽问题.     

基于分数阶傅立叶变换的ARM检测技术

分数阶傅立叶变换(FRFT)是傅立叶变换的广义形式,对线性调频(LFM)信号具有很好的能量积累作用.针对反辐射导弹(ARM)雷达回波信号的线性调频特性,提出了一种基于FRFT的反辐射导弹检测方法,并根据ARM信号的调频特性将FRFF局域化,缩小了峰值搜索区域,提高了检测效率.仿真实验表明该方法能够在高斯、非高斯分布杂波环境下有效地检测ARM信号.     

基于自适应累量算法的舰船轴频电场信号检测方法

提出一种新的舰船轴频电场信号检测方法.该方法利用高阶累量对高斯噪声的抑制作用,首先使用基于自适应累量算法的FIR滤波器对接收信号进行滤波消噪处理,以提高信噪比;然后再对滤波输出信号进行滑动功率谱检测.实测数据处理结果表明了该方法的稳健性和有效性.     

海洋环境中基于WVD的LFM信号检测方法

海洋环境中弱信号的谱与海杂波的谱相混叠 ,目标和背景的位置差异很小 ,经典的频域或空域处理对海杂波中弱信号的检测难以奏效。鉴于Wigner-Ville分布 (WVD)对线性调频信号 (LFM )具有时频聚集性这一特点 ,提出了一种海洋环境中基于WVD的LFM信号检测方法。利用雷达采集的真实海杂波数据 ,在不同信杂比的条件下 ,研究了该方法与经典频域法在信号检测中的差别。通过实验分析 ,与经典方法相比 ,该方法具有明显的优越性 ,且信杂比达到 -14 . 3dB时 ,其仍能很好地对信号进行检测。     

内置频率对Duffing振子微弱二进制相移键控信号盲检测影响

采用Duffing振子实现对微弱二进制相移键控（Binary Phase Shift Keying, BPSK）信号的盲检测时，Duffing系统输出的周期态和混沌态转换之间存在过渡带。针对这一问题，推导出过渡带时长和Duffing系统内置频率之间的关系表达式；指出内置频率越高，过渡带时间越短；仿真实验给出时间频率响应曲线。内置频率的提高，会降低系统检测微弱信号的灵敏度。针对这一问题，推导出周期态下Duffing系统输出幅度作为因变量、内置频率作为自变量的表达式；仿真实验给出幅频响应曲线。针对微弱BPSK信号盲检测，建立变尺度方法和检测阵列相结合的基于S变换提取Duffing系统输出幅度包络的微弱BPSK信号盲检测模型，仿真实验验证了模型方法的有效性。     

用相位梯度法校正超宽带雷达系统的相位误差

线性调频 (LFM)信号体制的超宽带雷达 (UWBR)系统的相位误差 ,会影响雷达系统脉冲压缩的结果。本文提出的相位梯度 (PG)算法 ,能够有效地估计系统相位误差 ,改善脉冲压缩的性能。     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001