脉压雷达信号处理仿真分析研究

针对脉冲压缩雷达,从系统仿真的角度建立了描述雷达与目标位置的三维坐标系,根据雷达信号脉冲压缩和非相参积累模型,通过计算机Matlab仿真得出了目标回波经过脉压雷达信号处理后的结果,并进一步分析了脉冲压缩和脉冲积累处理的效能。结果表明:目标回波信号通过脉冲压缩和脉冲积累处理后,显著提高了目标回波信噪比以及对目标距离估计的精度。     

视觉惯性导航系统初始化方法综述

视觉惯性导航系统通过初始化,对尺度信息、重力向量、速度、惯性传感器偏差等一系列状态估计所需参数进行快速求解,以提升系统后续导航定位与环境感知的准确性。根据传感信息耦合方式,视觉惯性导航系统初始化方法可以分为三类:联合初始化、非联合初始化和半联合初始化。基于现有研究工作,从基础理论、发展与分类、现有方法、性能评估四个方面展开,对目前主流的初始化方法进行综述,并总结视觉惯性导航系统初始化领域未来的发展趋势,有利于对视觉惯性导航系统初始化方法形成总体性了解并把握其发展方向。     

民用飞机运行可靠性研究进展

结合民用飞机运行可靠性研究的技术现状与发展趋势,根据现有的型号设计、研制和在役飞机的具体情况,阐述了民用飞机运行可靠性研究需求。通过梳理民用飞机运行可靠性理论研究进展及工程应用现状,从运行数据采集与处理、运行可靠性分析方法、运行可靠性预测反馈技术、运行可靠性的优化设计、优化维修任务、运行可靠性综合管理平台六个方面,详细阐述民用飞机运行可靠性研究现状及面临问题,展望了民用飞机运行可靠性研究未来发展方向。     

一种低信噪比下的伪码快速捕获算法

传统的伪码捕获算法消耗时间长且在低信噪比条件下伪码捕获虚警率高,针对该问题,提出了一种低信噪比条件下的伪码快速捕获算法。该算法首先利用快速傅里叶变换完成信号相干积累,然后根据频率进行门限判决,从而捕获相应的时域伪码。仿真实验结果表明：该算法可减少伪码捕获时间,降低伪码捕获的虚警概率。     

军用系统间歇可用度及其战时计算模型研究

根据我军训练和作战的实际情况,对间歇可用度（AP）的概念进行了分析,说明了它在一次作战任务周期内计算精度要优于使用可用度,推导出了它的战时计算模型,界定了其使用条件与限制要求。最后通过仿真计算,证明了间歇可用度战时计算模型的可行性。     

基于图像处理的火焰检测算法研究

简要介绍了火焰检测系统构成和火焰燃烧特性,并根据全炉膛火焰的燃烧特性,从火焰图像中提取了反映炉膛火焰燃烧状态的特征量.最后,通过对火焰图像的处理及对火焰检测算法的分析与研究,利用计算机仿真得出火焰图像特征量与燃烧状态的关系,提出火焰燃烧稳定性判据.该算法能够实时、准确地检测全炉膛火焰的燃烧状况和炉膛中心火焰偏移情况,为...     

基于最小最大决策的三站时差定位布阵优化

提出了一种基于最小最大决策的三站时差定位布阵优化方法,以提高系统对目标区域的整体定位精度。应用基于最小最大决策的最优化理论,建立布阵优化问题的数学模型。该模型以三站坐标为决策变量,以目标区域的最大水平定位误差最小为目标函数,然后运用基于最小最大决策的最优化算法,求解模型的最优解,并将此最优解作为三站时差定位系统的最优布阵。仿真结果与理论计算一致,验证了这种布阵优化结果的最优性。     

以优质的信息服务打造武警高校名牌图书馆

武警院校图书馆要以提供优质的信息服务为着眼点,不断创新服务理念、服务方法和服务手段,并通过各项措施保障优质信息服务,达到创建武警高校名牌图书馆的目的。     

网络中心战战场精确时间的同步技术

本文阐述网络中心战战场的时间同步技术、精确时间体系结构、双向比对远距离时间同步技术。对各种时间获取技术进行了比较,对GPS定时原理作了较为详细的说明。     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004