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

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

基于模糊时间序列的时变动态系统模糊建模

要想建立结构不确定、参数时变的动态系统的模型是很困难的。改进了Song Chisson的模糊时间序列方法,并成功应用于时变动态系统的辨识与建模和自适应控制。仿真结果表明该方法计算量小,实时性好,能很快地跟踪系统的变化。     

具有镀铬层的铁磁材料和零件的裂纹检测

阐述了具有镀铬层铁磁性零件的裂纹漏磁检测机理,探讨了基于循环搜索逼近的裂纹定量检测的基本方法。实测结果证明漏磁法检测具有镀铬层工件的缺陷是可靠的。     

Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue

We use the matrix‐geometric method to study the MAP/PH/1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady‐state probabilities for M/M/1 priority queues, Oper Res 29(5) (1981), 945–958] can be extended to an upper triangular block structure. Moreover, the subblock matrices of matrix R also have such a structure. With this special structure, we develop a procedure to compute the matrix R. After obtaining the stationary distribution of the system, we study two primary performance indices, namely, the distributions of the number of jobs of each type in the system and their waiting times. Although most of our analysis is carried out for the case of K = 3, the developed approach is general enough to study the other cases (K ≥ 4). © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 662–682, 2003.     

基于贝叶斯方法的退化失效型产品实时可靠性评估

通过传统可靠性方法得到的失效分布反映了相同受试环境下同一类产品的平均特征,并不能直接应用于系统实时定量可靠性分析。为此,针对有历史试验数据的退化失效型产品,依据局部更新的思想,利用贝叶斯方法最大可能地采用现场测试数据,并将之及时反映到实时可靠性模型中去。结果表明,随着融合现场数据的增多,产品的实时可靠性模型也逐渐全面反映出产品的个性特征。     

一种快速有效的循环平稳信号检测方法

TSAE-Z算法把时间切片自相关包络检测和可变步进的Zoom-FFT检测相结合,实现了对循环平稳信号的快速、精确检测,仿真结果表明,在相同数据长度条件下,TSAE-Z算法能够使检测运算时间减少3个数量级;在相同执行时间的条件下,TSAE-Z算法能在提高检测分辨率的同时使检测性能提升6dB以上。     

结合动态时间弯曲与决策树方法的液体火箭发动机故障诊断

对某大型液体火箭发动机的热试车数据及通过发动机模型仿真得到的故障数据进行动态时间弯曲分析,得到弯曲路径集,然后结合决策树方法进行了故障检测和诊断。对于故障试车没有出现漏报警和误报警,对于正常试车没有出现误报警。通过与神经网络、支持向量机等方法所得结果的对比,证明该方法可以成功地应用于火箭发动机的故障检测和诊断。     

时域磁场积分方程迭代求解

利用时间步进算法(MOT)求解时域电场积分方程解决导体目标瞬态散射问题时,其计算结果不稳定,会发生后期震荡现象。通过对时域磁场积分方程显式和隐式方案的分析,推导出一种隐式的迭代方案,它不但易于实现,而且数值结果表明这种时域磁场积分方程MOT迭代方案比时域电场积分方程MOT具有更好的稳定性,延缓了后期震荡效应。     

On competitive analysis for polling systems

Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems.     

先期毁伤原则下武器单元的射击时机分配

以先期毁伤为原则,首次对武器单元的射击时机分配问题进行数学建模。提出一种使毁伤概率密度在时间上靠前分布的武器单元射击时机分配模型,在保证指定瞬时之前以期望概率毁伤目标的前提下,合理分配各武器单元的射击时机,实现对目标的尽早毁伤。根据射击时机分配模型中约束函数的单调性特点,提出一种改进的连续域蚁群算法,使算法自变量满足约束条件的"优良区域"开始搜索,采用搜索窗口平移的方法逐步寻找最好解,提高了算法的搜索速度。实例分析验证了模型和算法的有效性。