GNSS阵列接收机信号解扩前的欺骗干扰检测算法

为了降低天线阵接收机欺骗干扰检测方法的计算量,提出一种信号解扩前的欺骗干扰检测方法。该方法利用不同天线上信号和噪声相关性的差异,在信号解扩前估计其功率,从而进行欺骗干扰检测。仿真结果表明,该方法在降低运算量的同时,具有良好的检测性能。     

具有时滞的比率型Chemostat模型的全局稳定性

研究一类具有时滞的比率型功能性反应的Chemostat模型。研究了模型的边界平衡点和正平衡点的局部稳定性以及Hopf分支的存在性;利用比较定理证明了边界平衡点的全局稳定性;通过构造Liapunov泛函给出了保证系统正平衡点全局稳定的充分条件;并通过数值模拟验证了理论结果。     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

联合补充博弈的费用分摊

就一个仓库、多个零售商,对联合订货费用函数的模型进行分析,给出了一个求解最佳订货周期的多项式时间的算法,且算法的时间复杂性为O（nlogn）。利用文献[8]中的技巧,给出了该库存博弈的核。     

二进制偏移载波调制信号畸变误差评估指标

针对三种常见的信号畸变,给出完善的畸变误差评估指标,从而能够全面评估畸变误差。同时采用提出的评估指标对北斗全球系统B1频段上的基线信号BOC(14,2)及MBOC(6,1,1/11)信号进行评估。所提出的畸变误差评估指标能够用于评估现代卫星导航信号的畸变误差,对现代导航信号体制设计及完好性监测均具有指导意义。     

Regional mediation strategy: The case of Zimbabwe

The growth and survival of the field of conflict resolution can only be attained if practice is used to generate theory, rather than a reliance on the current situation where theory attempts to direct practice. Some conflict resolution practitioners believe that theory and practice cannot be separated. This article evaluates the art of mediation using Zimbabwe as a case study, where the strategy was used in an attempt to resolve the Zimbabwean conflict that began in 1999. Employing primary and secondary sources, the article delineates the major characteristics of mediation and clarifies principles of the strategy. It further establishes the affinity and dissonance between practice and theory. In addition, it asserts that in the Zimbabwean case, the achievements of insider-partial mediation as a strategy were limited. In the long term the mediation strategy failed because the Government of National Unity did not fulfil all the outstanding issues enunciated by the global political agreement as a precursor to free and fair, credible and legitimate elections. In opposition to the mediation targets towards sustainable peace, Zimbabwe witnessed rushed elections before the accomplishment of the issues at stake, leading to the overall failure of the insider-partial mediation.     

一类具有标准发生率的SI型传染病模型的全局稳定性

研究如下一类具有标准发生率的SI型传染病模型{ds/dt=rS（1-（S＋I）/K-β SI/（S＋I）, dI/dt=βSI/（S＋I）-dI。应用微分方程定性理论,给出了该系统地方病平衡点、无病平衡点和总人口消亡平衡点的全局渐近稳定的充分条件。     

微分方程解的稳定性与周期性

综合利用相空间理论、压缩映像原理、算子的性质以及Liapunov泛函的方法,研究了具有无限时滞中立型泛函微分方程周期解的存在性、唯一性及稳定性问题,得到新的结果,推广了已有的结果。     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A stochastic approximation algorithm to compute bid prices for joint capacity allocation and overbooking over an airline network

In this article, we develop a stochastic approximation algorithm to find good bid price policies for the joint capacity allocation and overbooking problem over an airline network. Our approach is based on visualizing the total expected profit as a function of the bid prices and searching for a good set of bid prices by using the stochastic gradients of the total expected profit function. We show that the total expected profit function that we use is differentiable with respect to the bid prices and derive a simple expression that can be used to compute its stochastic gradients. We show that the iterates of our stochastic approximation algorithm converge to a stationary point of the total expected profit function with probability 1. Our computational experiments indicate that the bid prices computed by our approach perform significantly better than those computed by standard benchmark strategies and the performance of our approach is relatively insensitive to the frequency with which we recompute the bid prices over the planning horizon. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011