基于TSS方法的雷达性能优选分析研究

通过TSS方法进行了雷达性能的优选分析研究,分别针对雷达的单一性能指标和综合性能指标进行了优选分析。首先运用TSS方法完成了基于单一性能指标的雷达性能优选分析,然后通过欧几里德贴近度完成了雷达的综合性能指标优选分析,最后给出了TSS方法在雷达性能优选分析研究中的应用实例。     

一种改进的均方根容积粒子滤波算法

传统的粒子滤波算法在重要性采样估计时忽略了当前量测影响。在非线性场景下,传统的粒子滤波导致个别粒子具有大权值,造成估计结果精度差。针对该问题,结合均方根容积卡尔曼滤波(SCKF)算法和Gating技术,提出了一种新的重要性函数估计算法。本算法将后验概率作为重要性采样函数,通过利用SCKF和统计距离,建立粒子与量测的关联关系,实现对重要性采样函数的均值和协方差矩阵的估计。而后,使用粒子滤波算法,对多目标状态和数目进行估计。实验表明,在非线性跟踪场景下,本算法估计精度高,估计结果稳定。     

面向诸元计算精度鉴定的二次抽样试验设计方法

针对诸元计算精度常规试验方法的缺点和不足之处,提出了"二次抽样"的试验设计方法,在一次抽样的基础上,通过对试验结果进行分析,进行第二次有针对性的抽样试验,并采用贝叶斯估计方法,对两次相关联的试验结果进行综合评价。最后采用该方法对某型炮兵指控系统的诸元计算精度进行了检验,证明了该方法的实用性和有效性。与常规试验方法相比,二次抽样法对诸元计算中各变量不同值域的权重进行了重新分配,其计算结果对被试装备的实际性能更具有指向性。     

基于分层核粒子滤波的快速运动目标跟踪

针对目标发生快速、运动不规则及遮挡等情况下的跟踪问题,提出了一种分层核采样策略。首先通过先验转移和后验转移分别预测2组粒子来建立联合分布,利用聚类算法近似联合分布粒子集的混合高斯分布;然后对每个聚类进行采样;最后采用均值漂移算法将粒子移动到后验密度的局部极值处。实验结果表明:算法在目标发生快速机动情况时,跟踪性能优于传统粒子滤波、核粒子滤波及分层粒子滤波,且对遮挡具有较好的鲁棒性。     

改进多重信号分类算法的宽带频谱快速感知方法

针对宽带频谱感知中采样率大、感知时间长的问题,在调制宽带转换器采样的基础上提出了一种改进多重信号分类算法的宽带频谱快速感知方法。调制宽带转换器对宽带频谱进行欠奈奎斯特采样,以最小描述长度准则估计信号个数,用改进多重信号分类谱估计信号位置。算法引入调整因子,使得多重信号分类谱中信号位置更为明显,降低了噪声的干扰。整个感知过程无须重构原始波形,无须计算频谱,大大降低了计算量,而且感知算法计算复杂度低,提高了感知效率。仿真结果表明,在低信噪比的情况下,该算法仍具有很好的检测性能。     

空气采样早期探测系统应用前景展望

介绍了空气采样早期探测系统的原理,通过将其与常见的常规探测器相比较,充分探讨了不同探测环境下的优越性所在。其中,着重分析了其极早期报警、准确探测火灾、不产生误报的特点。通过对空气采样早期探测系统在国外发展历史的分析,并结合我国的实际情况,认为这种探测方式将在我国得到广泛应用,并会根据我国的国情不断继续发展完善。     

Probabilistic solution and bounds for serial inventory systems with discounted and average costs

We consider the infinite horizon serial inventory system with both average cost and discounted cost criteria. The optimal echelon base‐stock levels are obtained in terms of only probability distributions of leadtime demands. This analysis yields a novel approach for developing bounds and heuristics for optimal inventory control polices. In addition to deriving the known bounds in literature, we develop several new upper bounds for both average cost and discounted cost models. Numerical studies show that the bounds and heuristic are very close to optimal.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Myth and the small war tradition: Reassessing the discourse of British counter-insurgency

In recent years a number of commentators have posited that the British reputation for conducting small wars has suffered in the wake of setbacks in Iraq and Afghanistan. The argument here contests whether such a tradition can be truly said to have ever existed. A close examination of this supposed tradition reveals it to be a myth. In fact, rarely have the British armed forces claimed a facility for counter-insurgency or small war. Invariably, commentators outside the Army have ascribed the tradition to them. Most notably, commentators in the United States keen to discern practices of minimum force or rapid institutional learning generated the narrative of British COIN expertise. Ultimately, what this myth reveals is that, when deconstructed, it is political will, not an ingrained understanding of fighting insurgencies, that has determined Britain's success, or otherwise, in so-called small wars.     

Nonparametric bayesian lifetime data analysis using dirichlet process lognormal mixture model

We propose a nonparametric Bayesian lifetime data analysis method using the Dirichlet process mixture model with a lognormal kernel. A simulation‐based algorithm that implements the Gibbs sampling is developed to fit the Dirichlet process lognormal mixture (DPLNM) model using rightly censored failure time data. Five examples are used to illustrate the proposed method, and the DPLNM model is compared to the Dirichlet process Weibull mixture (DPWM) model. Results indicate that the DPLNM model is capable of estimating different lifetime distributions. The DPLNM model outperforms the DPWM model in all the examples, and the DPLNM model shows promising potential to be applied to analyze failure time data when an appropriate parametric model for the data cannot be specified. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria

We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004