高脉冲重复频率雷达混合滤波解距离模糊方法

针对高脉冲重复雷达距离模糊问题,提出一种新的混合滤波解距离模糊方法.通过把脉冲间隔数和脉冲间隔变化量作为目标待估计状态,对离散的脉冲间隔数、间隔变化量和连续的目标状态(位置和速度)进行混合滤波,从而将解距离模糊问题转换为对脉冲间隔数的估计问题.初始时刻,由于距离量测模糊,利用多个高脉冲重复频率(HPRF)采用欧氏距离对混合状态进行初始化.在滤波过程中,为了避免门限选择,首先根据脉冲间隔变化量的有限个离散取值,将六维向量的混合滤波模型等效为有限个五维向量的混合滤波模型;然后对量测分别进行混合滤波;最后通过对各模型得到的新息的2范数进行比较获得混合状态估计,从而实现解距离模糊.混合滤波解距离模糊方法为实现高脉冲重复频率雷达实时解距离模糊提供了一种新的研究思路,仿真结果表明,本文提出的混合滤波方法在只有一个脉冲重复频率获得目标量测时较现有多假设方法收敛速度快,并且可以克服多假设方法在脉冲间隔数变化时发生的解模糊错误.     

Coordination of discrete‐time multi‐agent systems via relative output feedback

This paper investigates the joint effects of agent dynamic and network topology on the consensusability of linear discrete‐time multi‐agent systems via relative output feedback. An observer‐based distributed control protocol is proposed. A necessary and sufficient condition for consensusability under this control protocol is given, which explicitly reveals how the intrinsic entropy rate of the agent dynamic and the eigenratio of the undirected communication graph affect consensusability. As a special case, multi‐agent systems with discrete‐time double integrator dynamics are discussed where a simple control protocol directly using two‐step relative position feedback is provided to reach a consensus. Finally, the result is extended to solve the formation and formation‐based tracking problems. The theoretical results are illustrated by simulations. Copyright © 2010 John Wiley & Sons, Ltd.     

Energy-aware weighted graph based dynamic topology control algorithm

In this paper a new energy-aware weighted dynamic topology control (WDTC) algorithm is proposed to extend the lifetime of wireless network and balance the nodes’ energy consumption. The idea is that each node builds its local minimum spanning tree (MST) based on the energy-aware weighted graph and the network topology is adjusted accordingly. It was proved theoretically that the topology under WDTC algorithm could preserve the network connectivity and a sufficient condition for the degree of no more than 6 was also given. Simulation shows that WDTC algorithm can effectively prolong the network lifetime and has good topological features.     

具有QoS保障功能的服务网格资源映射策略

针对网格资源映射对用户的服务质量(QoS)偏好考虑不足的问题,对保障多维QoS的网格资源映射算法进行研究,从服务网格资源的多维QoS属性分析入手,在满足用户全局约束的前提下,根据服务中各子任务的QoS约束筛选出符合要求的网格资源,并给出合理的映射结果,提出一种网格资源映射算法——QoS-Sufferage算法。利用GridSim平台进行仿真比较,结果验证了算法的有效性。     

应用于LTE上行链路的MMSE-TEDF均衡器

提出了一种适用于LTE上行SC-FDMA中的判决反馈均衡架构TEDF.依照最小均方误差准则,组成MMSE-TEDF均衡器.在3GPP LTE协议中常用的EVA信道下将这种均衡器进行计算机仿真,结果表明该均衡器在EVA信道下系统性能明显提高.     

An overview of dynamic parameter identification of robots

Due to the importance to model-based control, dynamic parameter identification has attracted much attention. However, until now, there is still much work for the identification of dynamic parameters to be done. In this paper, an overview is given of the existing work on dynamic parameter identification of serial and parallel robots. The methods for estimating the dynamic parameters are summarized, and the advantages and disadvantages of each method are discussed. The model to be identified and the trajectory optimization are reviewed. Further, the methods for validating the estimated model are summarized and the application of dynamic parameter identification is mentioned. The results of this review are useful for manufacturers of robots in selecting proper identification method and also for researchers in determining further research areas.     

2009年下半年网络规划设计师考试分析

网络规划设计师考试属于全国软件水平考试中高级级别的考试。该文根据2009年11月网络规划设计师考试试题的情况,分析了考试的难点和重点。     

PKI网络信任模型的分析与研究

信任模型是整个网络安全体系的基础,决定了在网络上采用信任的形式与采用该形式带来的信任风险,并提供了建立和管理信任关系的框架。可见,对于信任模型的研究在网络安全中非常重要。文章着重分析了基于PKI的各类信任模型的信任机制、认证过程及其存在优缺点,指出了各类信任模型对网络信息安全产生影响的主要原因。通过总结与对比,指出了PKI信任模型的设计策略与发展趋势。     

STBC系统在非同分布Nakagami信道下的一种快速性能评估算法

针对非同分布的Nakagami信道,基于矩生成函数MGF(Moment Generation Function)的分析方法,提出正交空时分组码系统STBC(Space-Time Block Coding)的一种快速性能评估算法,不需要涉及超几何函数积分运算,可在中高信噪比时,快速准确地估计STBC系统的符号错误概率性能。在平坦瑞利衰落信道下的计算机仿真表明,该算法与已有的STBC系统的近似估计算法相比,具有较优的性能。