联合防空目标分配方案优化研究

目标分配是联合防空作战指挥决策的核心内容,是各级联合防空指挥中心的重要工作,其模型的合理性与可信性会对作战结局产生重大影响。为提高目标分配的合理性与可信性,对联合防空作战混合部署下的目标优化分配问题进行了详细分析,建立了相应的数学规划决策模型。为了有效获得问题的全局最优解,将改进遗传算法(GA)应用于数学规划决策模型的求解过程中,并给出了模型求解的方法和步骤,经实例应用,取得了满意的结果。     

Fibonacci数列及其算法分析

讨论了方程x^k=x^k-1＋x^k-2＋……＋x＋1的性质根，并利用其给出了k阶Fibonacci数列的通项公式及其性质，最后，给出了该数列的一些算法，并对这些算法做了简要分析。     

战场运动目标快速跟踪研究

针对现有的基于图像序列目标提取算法HS算法和LK算法过于复杂、运算量大等缺点,提出了快速微分光流法,并利用Matlab仿真实验验证了该技术的可行性。     

Approximation algorithms for sequential batch‐testing of series systems

We introduce and study a generalization of the classic sequential testing problem, asking to identify the correct state of a given series system that consists of independent stochastic components. In this setting, costly tests are required to examine the state of individual components, which are sequentially tested until the correct system state can be uniquely identified. The goal is to propose a policy that minimizes the expected testing cost, given a‐priori probabilistic information on the stochastic nature of each individual component. Unlike the classic setting, where variables are tested one after the other, we allow multiple tests to be conducted simultaneously, at the expense of incurring an additional set‐up cost. The main contribution of this article consists in showing that the batch testing problem can be approximated in polynomial time within factor , for any fixed . In addition, we explain how, in spite of its highly nonlinear objective function, the batch testing problem can be formulated as an approximate integer program of polynomial size, while blowing up its expected cost by a factor of at most . Finally, we conduct extensive computational experiments, to demonstrate the practical effectiveness of these algorithms as well as to evaluate their limitations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 275–286, 2016     

基于MUSIC算法的罗兰C接收机天地波自动识别方法研究

针对常规罗兰C接收机天地波识别方法不能有效利用信号能量的缺点,根据天波到来时间的估计与合成信号频率的分离相似的特点,提出了一种基于多信号分类算法估计天波延迟的方法.该方法在低信噪比条件下可分离出地波和天波,并能根据天波的延迟变化实时地选择接收机采样基准点的最佳位置.计算机仿真结果表明,该方法可以用于天地波的自动识别,能增加基准点处的信噪比,因而能显著提高罗兰C接收机的性能.     

一种面向个性化服务的无需反例集的用户建模方法

随着WWW信息的快速增长 ,查找用户感兴趣的信息变得越来越耗时耗力。个性化服务能为不同的用户提供有针对性的服务 ,日益受到研究者的重视。用户建模是实现个性化服务的关键技术。传统的需要正、反例集作为训练例集的用户建模方法容易干扰用户的正常浏览 ,或者由于推断失误而引入噪声。基于遗传算法和k近邻方法提出了一种无需反例集的用户建模方法 ,该方法被应用于个性化信息过滤中。实验结果表明 ,基于无需反例集的用户建模方法的信息过滤算法可以达到 73 91%的过滤率和 94 4 4 %的过滤精度。无需反例集的用户建模方法是一种可行、高效的用户建模方法     

Stochastic regret minimization for revenue management problems with nonstationary demands

We study an admission control model in revenue management with nonstationary and correlated demands over a finite discrete time horizon. The arrival probabilities are updated by current available information, that is, past customer arrivals and some other exogenous information. We develop a regret‐based framework, which measures the difference in revenue between a clairvoyant optimal policy that has access to all realizations of randomness a priori and a given feasible policy which does not have access to this future information. This regret minimization framework better spells out the trade‐offs of each accept/reject decision. We proceed using the lens of approximation algorithms to devise a conceptually simple regret‐parity policy. We show the proposed policy achieves 2‐approximation of the optimal policy in terms of total regret for a two‐class problem, and then extend our results to a multiclass problem with a fairness constraint. Our goal in this article is to make progress toward understanding the marriage between stochastic regret minimization and approximation algorithms in the realm of revenue management and dynamic resource allocation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 433–448, 2016     

多目标的分布式协同进化MDO算法

通过引入非优超排序和排挤的多目标处理机制 ,将分布式协同进化MDO算法的能力扩展到多目标的多学科设计优化问题。多目标的分布式协同进化MDO算法在保持各学科充分自治和各学科并行设计优化协同的基础上 ,通过一次运行即可获得具有良好分布的多个Pareto最优解 ,逼近整个Pareto最优前沿。应用于导弹气动 /发动机 /控制三学科两目标设计优化问题 ,与约束法计算结果的对比表明算法能够有效逼近该问题的Pareto最优前沿 ,为设计决策提供了丰富的信息     

导弹总体参数优化设计的合作协同进化MDO算法

传统的导弹设计方法不能很好地实现各子系统设计的协同 ,而多学科设计优化技术十分适合现代计算机网络环境下的多学科协同设计。根据协同进化与MDO在本质上的相似性 ,采用合作协同进化的方法进行MDO算法研究 ,以充分发挥进化算法的优越性。给出了一种基于合作协同进化的MDO算法 ,将该算法应用于导弹的气动 发动机 控制一体化优化设计。     

用于复杂系统环境的遗传分类器系统

设计了一个针对复杂系统分析的遗传分类器系统,该系统不仅利用了遗传算法强大的搜索能力和便于从大量历史数据中发现规律的优点进行分类器获取,而且还具有如下两个主要特点;①它能够适用于复杂的、缺少完整描述且训练信号带有噪声的系统环境;②它是一个白箱系统,所获取分类器的置信度与统计结果相符,从而支持定性、定量相结合的综合推理模式。