基于DSP机动目标自动跟踪仿真系统设计

从硬件角度叙述了机动目标自动跟踪仿真系统设计的几个问题.系统由两片超高速信号处理芯片(TMS320C30)组成并行系统,计算容量大,既能脱机运行,又能在微机的监控下工作,为机动目标的实时跟踪计算、状态滤波估计和解命中等问题的仿真研究,提供了方便、灵活的硬件环境.     

Shifting power,preventive logic,and the response of the target: Germany,Russia, and the First World War

If a declining state has incentives for preventive war, the rising state should have incentives to delay a confrontation until it is stronger. We develop the theoretical paradox and examine the July 1914 crisis. Why did Russia, rising relative to Germany, not adopt a buying-time strategy? We argue that although most Russian leaders hoped to avoid a confrontation, they feared that the failure to support Serbia would lead to a loss of Russian credibility and a significant setback to Russia’s position in the Balkans, one that could not easily be reversed, even with Russia’s expected increase in relative military power.     

基于规则控制的快速高度跟踪算法

提出一种全新的基于模糊推理与规则控制的高度跟踪算法。这种算法无论是在跟踪效果与运算速度上都大大优于以往的最速下降法、动态规划法、最优控制法等,而且可以对最大俯仰角、最大可用过载、希望跟踪程度等跟踪参数进行随意设定。大量的仿真计算证明,该算法具有很好的实时性、收敛性及可扩展性。可以极大地减轻对地攻击低空轨迹规划的工作,对巡航导弹、无人机更具应用价值     

A fluid queueing model for link travel time moments

We analyze the moments of the random time required for a vehicle to traverse a transportation network link of arbitrary length when its speed is governed by a random environment. The problem is motivated by stochastic transportation network applications in which the estimation of travel time moments is of great importance. We analyze this random time in a transient and asymptotic sense by employing results from the field of fluid queues. The results are demonstrated on two example problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

坦克火控系统处理射表的两种算法

射表的处理速度是火控系统的关键,提高射表的处理速度能够缩短整个系统的反应时间。本文对此提出了两种算法,并作了比较。     

联合补充博弈的费用分摊

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

基于ARM的嵌入式指纹图像处理技术研究

研究了特征提取方法和匹配算法;设计了基于ARM的嵌入式指纹处理核心模块,并将其应用于综合业务平台的用户身份认证系统中;具有自主版权的认证加载模式实现了对登录平台的用户身份验证,识别率达到了99.3%.结果表明,该方法能确保平台系统的安全.     

On‐line algorithms for minimizing makespan on batch processing machines

We consider problem of scheduling jobs on‐line on batch processing machines with dynamic job arrivals to minimize makespan. A batch machine can handle up to B jobs simultaneously. The jobs that are processed together from a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. Each job becomes available at its arrival time, which is unknown in advance, and its processing time becomes known upon its arrival. In the first part of this paper, we address the single batch processing machine scheduling problem. First we deal with two variants: the unbounded model where B is sufficiently large and the bounded model where jobs have two distinct arrival times. For both variants, we provide on‐line algorithms with worst‐case ratio (the inverse of the Golden ratio) and prove that these results are the best possible. Furthermore, we generalize our algorithms to the general case and show a worst‐case ratio of 2. We then consider the unbounded case for parallel batch processing machine scheduling. Lower bound are given, and two on‐line algorithms are presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 241–258, 2001     

目标自动跟踪与信息处理综合系统的研究与实现

根据将目标自动跟踪与信息处理综合的思想,在目标自动跟踪与信息处理综合的实现方面作了大量工作,并进行了实验.实验结果表明,只有在自动跟踪系统中综合目标信息处理,火控系统性能才能有质的提高.同时,数字信号处理(DSP)技术、自适应滤波算法的应用,使得系统设计能够基本达到实际应用的阶段.     

基于复合CBR的炮兵侦察情报处理系统模型研究

本文针对当前炮兵侦察情报处理系统工作现状,指出了现有侦察情报处理系统所存在的问题和局限性,利用人工智能中的基于案例推理技术,建立起基于复合案例推理的炮兵侦察情报处理系统的模型。该模型详细地描述了炮兵侦察情报处理过程,克服了现有基于规则推理系统不易扩展和修改的弊端,具备更好的处理效果。