相参频率捷变雷达目标稀疏重建性能边界综述

相比频率固定的脉冲多普勒体制, 频率捷变体制在抗干扰方面具有显著优势。但在该体制下, 基于匹配滤波的信号处理算法存在旁瓣平台问题, 难以与动目标检测兼容。压缩感知理论将目标参数估计建模作为欠定方程求解, 为该问题提供了解决思路。在相参频率捷变雷达中, 压缩感知能否准确重建目标是一个基础性问题。本文梳理了针对该问题的相关研究, 借助相变理论与相变曲线的解析表达式, 定量描述了捷变频雷达重建目标的成功概率与主要系统和目标参数之间的关系; 该理论性能边界与仿真实际所能达到的性能相接近。此外, 还探讨了现有成果在实际应用中的价值, 展望了未来研究方向。     

广义次正定矩阵上的Oppenheim不等式

用矩阵分析的方法, 通过对广义次正定矩阵性质的进一步研究, 得到了更一般条件下的两个广义次正定矩阵的Hadamard乘积的行列式下界估计的Oppenheim不等式, 在适用范围和估计精度上都改进了已有的相应结果.     

Host selection by a kleptoparasitic spider

Argyrodes globosus (Keyserling, 1884) is a small kleptoparasite spider that steals prey from the web of web-building spiders. In coffee plantations in the south of Mexico it was observed to parasitize five species: Gasteracantha cancriformis (Linnaeus, 1785) and Verrucosa arenata (Walckenaer, 1841) (Araneidae), Leucauge mariana (Keyserling, 1881) and Leucauge venusta (Walckenaer, 1841) (morphologically indistinguishable species) and Leucauge argyra (White, 1841) (Tetragnathidae). G. cancriformis was more frequently parasitized than the other hosts. An analysis of web diameter for each host species indicated that for L. mariana/venusta, L. argyra and V. arenata the kleptoparasite was associated with webs of a certain size range (23-33cm diameter) although a far larger range of web sizes was available (17-50cm diameter). The average size of the web of G. cancriformis (~23cm) appeared to be close to the preferred size for the kleptoparasite and this, together with an apparent absence of host aggression, may explain the prevalence of A. globosus with this host. For the parasite, web size choice may involve a tradeoff among diverse factors including prey capture rate, ease of access to the web and aggressive behaviour by the host.     

微分方程的反序上下解方法

利用反序上下解组合单调迭代技术,讨论了一类带积分边界条件的微分方程解的存在性问题,得到了几个新的存在性定理.     

Analysis for MIMO correlated frequency-selective channel in the presence of interference

The space time spreading, superimposed training sequences, and space-time coding are used to present a multiple input and multiple output （MIMO） systems model, and a closed-form of average error probability upper bound expression for MIMO correlated frequency-selective channel in the presence of interference （co-channel interference and jamming signals） is derived. Moreover, the correlation at both ends of the wireless link that can be incorporated equivalently into correlation at the transmit end is also derived, which is significant to analyze space-time link algorithm of MIMO systems.     

SAR图像目标增强模型最优性能分析

研究用于SAR图像目标增强的lk范数正则化方法的最优性能.从有偏参数估计的统计性能极限角度,将达到渐进最小总方差的参数估计看作目标增强的最优效果.根据Bayes框架以及罚最大似然估计原理,研究了达到最优性能时正则项需满足的条件,该条件与图像大小、信号统计分布以及观测数据噪声方差有关,可为模型设计与迭代算法设计提供依据.并证明了仅当噪声方差较小时lk范数约束才能使得处理结果达到该最优估计性能.仿真实验验证了该结论的正确性.     

An improved branch-and-bound algorithm to minimize the weighted flowtime on identical parallel machines with family setup times

This article investigates identical parallel machines scheduling with family setup times. The objective function being the weighted sum of completion times, the problem is known to be strongly NP-hard. We propose a constructive heuristic algorithm and three complementary lower bounds. Two of these bounds proceed by elimination of setup times or by distributing each of them to jobs of the corresponding family, while the third one is based on a lagrangian relaxation. The bounds and the heuristic are incorporated into a branch-and-bound algorithm. Experimental results obtained outperform those of the methods presented in previous works, in term of size of solved problems.     

多变量网络控制系统建模与稳定性分析

研究了一类多变量网络控制系统的建模和稳定性问题,基于线性时不变对象,推导了该类网络控制系统的时滞连续时间数学模型,并利用李雅普诺夫第二法,分析了系统的渐近稳定性,得到了系统稳定运行的最大允许时延和全时滞稳定的条件。最后,通过实例仿真分析证实了本文所提理论的有效性,以及稳定判据的可行性。     

Alpha稳定分布噪声环境下新的类RLS自适应算法

给出在分数低阶Alpha稳定分布环境中一种新的类RLS自适应算法.由于Alpha稳定分布信号不存在有限的二阶和二阶以上矩,因此用最小p范数准则代替了传统的最小均方准则,并利用矩阵求逆定理提出一种直接递推的类RLS算法,避免了以往类RLS算法中的IRLS迭代计算,从而使算法的计算复杂度大大降低.最后对几种自适应算法进行仿真,并对其收敛特性进行了分析.结果表明,算法的收敛速度明显快于LMP和NLMP算法.     

一类3-紧优双环网无限族

到给定顶点数的双环网的最小直径是图论和计算机工作者广泛研究的问题。虽然大多数双环网可以达到紧优,但仍然有一部分双环网不能达到。本文给出了一类3-紧优的双环网无限族。