INS辅助的GNSS接收机信号捕获性能分析

针对信号捕获过程中Doppler频移造成的影响,采用INS辅助的GNSS信号捕获方法,分析了INS辅助后卫星信号捕获的性能。利用INS速度误差方程与Doppler误差之间的关系,分析INS辅助后的捕获性能,并通过性能参数的比较,理论上验证了INS辅助后的捕获能力的提升。仿真结果表明,INS辅助能够有效提高信号捕获的检测概率和对弱信号的捕获能力,并大幅减小平均捕获时间。同时,考虑到INS器件参数的关键性作用,采用战术级的INS器件完全满足工程需求。     

基于负熵最大的FastICA语音信号分离算法

语音信号分离是现代信号处理的热点问题,针对未知信号源个数的情况,提出一种基于负熵最大的FastICA(Fast Independent Component Algorithm)语音信号盲分离算法,有效解决了源信号数目估计、语音信号分离及复原等问题。改进的算法增加了源信号数目估计环节,放宽了算法适用条件,即在源信号数目未知的情况下,也能够实现信号盲分离功能。并将其成功应用于运用信号分选过程中,最终复原语音时域波形,完成信号分选任务。仿真实验中,详细讨论了该方法在不同信噪比以及不同源信号数目情况下的分选能力,证明了方法的有效性和优越性。     

Visual C6.0中串行通信控件在GPS信号接收中的运用

对Visual C++6.0中的串行通信控件进行了详细的分析,描述了其属性,并介绍了在实际应用中的使用方法,通过编程实例,介绍了在接收GPS信号时的具体运用,可供从事串行通信人员参考.     

应用于流水时序调度的归一化定时数据流图理论

流水时序调度是专用数字信号处理器高层综合中的一个困难而急待解决的问题 ,文中提出了一种有着鲜明物理意义的归一化定时数据流图 ,基于节点移动研究了合法流水调度变换的内部机理 ,从而证明从任一合法的初始流水调度出发 ,通过合法的节点移动可以搜索到设计空间中任何一个合法的流水调度。一个合法、完备的变换集 ,为寻优搜索的算法应用于流水调度解决了理论和算法实现问题。文中还给出了一些实验结果。     

基于模糊神经网络的武器控制系统信号分析

某新型飞机武器控制系统故障诊断过程复杂,故障征兆和故障原因之间存在着许多不确定因素,精确定位故障存在许多困难.针对这种情况,提出了基于模糊神经网络,研究了模糊神经网络技术在武器控制系统故障诊断领域的应用,并根据系统本身的特点,提出了诊断和算法模型.在此基础上,研制出武器控制系统检查仪,对该方法作了验证.结果表明:该方法是可行和有效的.     

单颗卫星对弹道导弹的预警模型及其仿真

卫星预警系统在现代战争中发挥着重要的作用.通过分析研究,建立了单颗预警卫星对战术弹道导弹(TBM)预警的数学模型,主要包括了用预警卫星探测信息确定TBM坐标的模型,并对TBM弹道参数的精度进行了分析,得出了具有一定理论意义和工程应用价值的结论.     

现代故障诊断技术研究现状与趋势

回顾了状态监测与故障诊断技术的发展历史,归纳和总结了基于系统数学模型、基于系统输入输出信号处理以及基于人工智能等途径的故障诊断方法。从混合智能诊断技术、BIT技术、远程协作诊断技术3个方面,对现代故障诊断技术的发展趋势和有待解决的问题进行了分析与探讨。提出了故障诊断领域目前和将来的研究方向。     

Modeling and analysis of vessel casualties resulting from tanker traffic through narrow waterways

In this paper, we present a physics-based stochastic model to investigate vessel casualties resulting from tanker traffic through a narrow waterway. A state-space model is developed to represent the waterway and the location of vessels at a given time. We first determine the distribution of surface current at a given location of the waterway depending on channel geometry, bottom topography, boundary conditions, and the distribution of wind. Then we determine the distribution of the angular drift for a given vessel travelling at a given location of a waterway. Finally, we incorporate the drift probabilities and random arrival of vessels into a Markov chain model. By analyzing the time-dependent and the steady-state probabilities of the Markov chain, we obtain risk measures such as the probability of casualty at a given location and also the expected number of casualties for a given number of vessels arriving per unit time. Analysis of the Markovian model also yields an analytical result that shows that the expected number of casualties is proportional to square of the tanker arrival rate. We present our methodology on an experimental model of a hypothetical narrow waterway. © 1999 John Wiley & Sons, Inc. Naval Reseach Logistics 46: 871–892, 1999     

A comparative study of three tool replacement/operation sequencing strategies in a flexible manufacturing system

This paper studies three tool replacement/operation sequencing strategies for a flexible manufacturing system over a finite time horizon: (1) failure replacement—replace the tool only upon failure, (2) optimal preventive tool replacement for a fixed sequence of operations, and (3) joint scheduling of the optimal preventive tool replacement times and the optimal sequence of operations. Stochastic dynamic decision models are used for strategies 2 and 3. The optimization criterion for strategies 2 and 3 is the minimization of the total expected cost over the finite time horizon. We will show through numerical studies that, with the same amount of information, the total expected costs can be reduced considerably by choosing an optimal strategy. Our conclusion is that in flexible manufacturing, optimal tool replacement and optimal operations sequencing are not separate issues. They should be considered jointly to minimize the expected total cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 479–499, 2000     

Distribution free bounds for service constrained (Q,r) inventory systems

A classical and important problem in stochastic inventory theory is to determine the order quantity (Q) and the reorder level (r) to minimize inventory holding and backorder costs subject to a service constraint that the fill rate, i.e., the fraction of demand satisfied by inventory in stock, is at least equal to a desired value. This problem is often hard to solve because the fill rate constraint is not convex in (Q, r) unless additional assumptions are made about the distribution of demand during the lead‐time. As a consequence, there are no known algorithms, other than exhaustive search, that are available for solving this problem in its full generality. Our paper derives the first known bounds to the fill‐rate constrained (Q, r) inventory problem. We derive upper and lower bounds for the optimal values of the order quantity and the reorder level for this problem that are independent of the distribution of demand during the lead time and its variance. We show that the classical economic order quantity is a lower bound on the optimal ordering quantity. We present an efficient solution procedure that exploits these bounds and has a guaranteed bound on the error. When the Lagrangian of the fill rate constraint is convex or when the fill rate constraint does not exist, our bounds can be used to enhance the efficiency of existing algorithms. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 635–656, 2000