三维声音处理技术的研究

在声音定位原理研究的实验中,运用软件编程的方法改变原有．WAV文件(单声道、16位)的数据存储格式为有空间感立体声的．WAV声音文件(双声道、16位),在变换过程中加入了ITD、IID的数学模型,效果令人满意,听者能明显感到随着声源位置信息的改变,声源位置、音量也在改变     

BP神经网络的收敛问题

研究了BP神经网络的收敛问题。基于随机理论 ,提出了解决网络收敛性问题的随机优选法。该方法不仅在任何条件下都能得到问题的具有一定精度的解答 ,而且收敛速度很快     

虚拟现实技术及其在军事上的应用

虚拟现实技术与多媒体技术、网络技术并称为三大前景最好的计算机技术。它自诞生以来,就在航空航天、军事、核工业等行业中发挥着不可替代的作用。本文仅就虚拟现实技术的概念、特点、设备及在军事上的应用作一综述。     

基于时频分析的飞机目标识别

本文利用小波变换对五种飞机目标的雷达回波进行时频分析,得到了回波信号的时频分布图。全面清楚地描述了目标的散射特性。文中通过提取时频分布图的矩特征作为目标特征量,对五种飞机的目标作了识别实验,取得了良好的识别效果     

空间应急飞行器姿态快速机动控制研究

以空间应急飞行器姿态机动快速控制过程为研究对象,对姿态快速解耦控制问题进行研究.采用决策树理论对时间最优控制和倾斜开关曲线控制这两种控制策略进行综合,以控制时间作为代价函数,获得三通道时间最优控制策略.与其他方法相比,本控制策略控制时间大幅缩短,控制精度满足设计需求.另外对控制器不同控制周期下的控制效果进行仿真比较,对控制器控制周期选择具有指导意义.     

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     

Workload distribution of discrete‐time parallel queues with two servers

We study discrete‐time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a geometric distribution and the service times are assumed to have a general distribution. It is a no‐jockeying queue. The two‐dimensional state space is truncated into a banded array. The resulting modified queue is studied using the method of probability generating function (pgf) The workload distribution in steady state is obtained in form of pgf. A special case where the service time is a deterministic constant is further investigated. Numerical examples are illustrated. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 440–454, 2000     

基于可拓方法的C3I作战方案生成与评价

作战指挥决策支持系统是指挥自动化系统的重要组成部分,作战方案生成与评价是作战指挥决策支持系统的基本功能.根据作战指挥决策支持系统特点将可拓方法应用于作战方案生成与评价,并分析了其优势所在.结合空战案例运用发散树方法进行作战方案集的开拓,并利用优度评价方法进行作战方案的评价,从而得到最佳作战方案.     

Optimal nonmyopic gambling strategy for the generalized Kelly criterion

We consider the optimal wagers to be made by a gambler who starts with a given initial wealth. The gambler faces a sequence of two-outcome games, i.e., “win” vs. “lose,” and wishes to maximize the expected value of his terminal utility. It has been shown by Kelly, Bellman, and others that if the terminal utility is of the form log x, where x is the terminal wealth, then the optimal policy is myopic, i.e., the optimal wager is always to bet a constant fraction of the wealth provided that the probability of winning exceeds the probability of losing. In this paper we provide a critique of the simple logarithmic assumption for the utility of terminal wealth and solve the problem with a more general utility function. We show that in the general case, the optimal policy is not myopic, and we provide analytic expressions for optimal wager decisions in terms of the problem parameters. We also provide conditions under which the optimal policy reduces to the simple myopic case. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 639–654, 1997     

ATS:一种基于通告时间戳的BGP收敛性改进机制

研究BGP收敛性改进问题,考虑网络运行状况,提出一种新的机制,称为通告时间戳机制ATS(advertisement time stamp)。在该机制中,BGP路由器在向对等体发送路由通告报文时,将相应的路由前缀打上时间戳。当通告报文准备好时,通过查看相应前缀的时间戳来判断报文是否可以立即发送还是应该等待。该机制充分融合了每对等体每目的网络速率限制定时器和每对等体速率限制定时器各自的优点,克服各自缺点。分析表明,该机制可以较大地减少Tup、Tlong及Tshort事件的收敛延迟。