分形信号的滤波算法

提出了分形信号的小波分解与重构的一种快速算法。针对分形信号的自相似和长时相关的特点，采用离散小波变换（DWT）对分形信号进行多尺度分解，使其成为各尺度上的近似平稳信号，从而可利用通常的Wiener滤波或Kalman滤波方法进行估计，然后再由DWT进行多尺度重构，估计出被噪声污染了的原始信号。重点对DWT的滤波过程进行算法设计，并估计了计算复杂度。     

利用Hough变换实现目标检测与航迹启动

经典的目标检测方法是Ｂａｙｅｓ方法，通常为门限检测。本文将利用Ｈｏｕｇｈ变换推导一种通过非相参积累实现目标检测和航迹启动的方法。针对目标的信噪比不同的情况，讨论了两种非相参积累形式，一种是直接积累，另一种是二值积累。二值积累在检测微弱目标时有独特的优越性。本文还讨论了两种非相参积累方法的理论检测性能。     

基于小波变换和数据融合的多导联ECG信号QRS波群精确检测算法

本文首先对单导联心电图（ Ｅ Ｃ Ｇ）信号的小波变换进行假设检验，得到 Ｑ Ｒ Ｓ波群的位置和检验的虚警漏报概率，然后对 １２ 导联检测结果作峰点比对融合和决策加权融合处理，最终得到精确的 Ｑ Ｒ Ｓ位置。实验表明这种方法对各种主要病症的 Ｑ Ｒ Ｓ波群均能准确检出，正确率在 ９９９５％ 以上。     

弹道目标微多普勒特性基于逆Radon变换的稀疏表示

作为识别空间弹道目标的有效方法,微多普勒特性提取对于雷达系统的时频分辨率提出了很高的要求,因此,要求雷达系统具有更高的采样频率。作为近年来新兴的技术手段,在远低于奈奎斯特采样定理的采样频率下,压缩感知技术可以对具有稀疏特性的信号实现高精度还原。对空间弹道目标时频分布进行逆Radon变换,在变换后的IRT域内获得时频分布的稀疏表示,从而可以借助压缩感知技术有效降低采样频率的要求。     

基于小波变换的直升机声目标识别

综述了小波变换的原理和性质以及它在直升机声目标识别当中的应用。主要论述了利用小波变换进行信号分解与滤波、目标特征提取等方面的应用,最后给出了计算机模拟仿真结果。结果表明,利用信噪分离方法和目标特征提取方法可以在低信噪比情况下准确识别目标。     

解二维卷积型积分方程的正则化方法

基于傅立叶变换和Tikhonov的正则化方法,讨论了解二维卷积型积分方程的正则化方法。     

黑体辐射数值反演新方法

应用广义偏离原则对黑体辐射问题进行了反演的研究,给出了正则参数的选择方法,由计算机仿真结果知,该方法计算精度高,有良好的应用前景。     

点数任意时的快速插值算法

本文建立了运算量级为O(nlog_2m) 的多项式快速除法(其中,m,n分别为除式与被除式的多项式次数),把点数n+1为2的幂次的多项式快速插值推广到n+1为任意数情形,提出了运算量级为O (n log_2~2n) 的快速插值算法。     

Heuristics for the multi‐resource generalized assignment problem

The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001     

Bayesian inference based on partial monitoring of components with applications to preventive system maintenance

Consider a binary, monotone system of n components. The assessment of the parameter vector, θ, of the joint distribution of the lifetimes of the components and hence of the reliability of the system is often difficult due to scarcity of data. It is therefore important to make use of all information in an efficient way. For instance, prior knowledge is often of importance and can indeed conveniently be incorporated by the Bayesian approach. It may also be important to continuously extract information from a system currently in operation. This may be useful both for decisions concerning the system in operation as well as for decisions improving the components or changing the design of similar new systems. As in Meilijson [12], life‐monitoring of some components and conditional life‐monitoring of some others is considered. In addition to data arising from this monitoring scheme, so‐called autopsy data are observed, if not censored. The probabilistic structure underlying this kind of data is described, and basic likelihood formulae are arrived at. A thorough discussion of an important aspect of this probabilistic structure, the inspection strategy, is given. Based on a version of this strategy a procedure for preventive system maintenance is developed and a detailed application to a network system presented. All the way a Bayesian approach to estimation of θ is applied. For the special case where components are conditionally independent given θ with exponentially distributed lifetimes it is shown that the weighted sum of products of generalized gamma distributions, as introduced in Gåsemyr and Natvig [7], is the conjugate prior for θ. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 551–577, 2001.