n值逻辑系统中的随机化研究

利用赋值集的随机化方法,在n值逻辑系统Rn提出了公式的DRn-真度的概念。给出了两公式间的DRn-相似度与伪距离的概念,建立了DRn-逻辑度量空间。     

利用网络编码优化Ad Hoc网安全路由协议SAODV

网络编码可大大提高网络吞吐量、减少延迟。然而,由于编码意义上网络信息流的复杂性,实际应用中仍存在困难。另一方面,Ad Hoc网作为自组织形式的特殊网络,其安全路由协议是研究重点。针对Ad Hoc网安全路由协议中较优秀的SAODV,提出一种基于网络编码的优化方案,较传统编码易于实现、具有较强实用性。     

线面拓扑和度量关系的细分描述和计算方法

由于单独的拓扑关系、度量关系无法区分复杂要素之间的空间关系,在语义描述上存在歧义,提出一种二维空间R~2下空间关系的细分表达模型.该模型将面与线求交后,线面可以表示成n-1个拓扑和度量分量的序列矩阵,在语义上进行更细致的分段描述;采用折线节点微小圆求交的算法,考虑面带洞和目标的不确定性,归纳出线面拓扑关系细分判断的7个规则,以及长度、分割度等度量项的计算方法.最后以土地利用中图斑扣除线状地物计算地类面积为实例,验证了该模型和计算方法对解决实际问题的有效性.     

基于自适应蚁群优化的Ad Hoc网络路由算法

针对蚁群优化固有的搜索时间长、易陷入局部最优解的缺点,提出一种改进的基于蚁群优化的AdHoc网络路由算法.通过增加自适应因子提高路由搜索能力,充分考虑节点间的时延来改进信息的更新机制,同时对路由表做出修改,提高路由算法性能,增强算法的适应能力.经过与已有路由算法DSR和AODV的仿真比较,结果表明该算法在成功传输率和平均端到端延迟上表现了较好的性能.     

一种基于内容的双向共享组播路由协议

针对组播协议在大规模分布式交互系统应用中面临的可扩展性问题,提出一种基于内容的双向共享组播路由协议CBSMRP(content-based bi-directional shared multicast routing protocol).该协议结合运用了主动路由思想和基于内容的发布-订购模式,在基于CBT(core-based tree)结构的双向共享组播树中,根据数据包的内容实现主动路由和双向过滤,不仅解决了组播地址的维护和分配等问题,而且能够有效地减轻系统的网络负载.仿真实验及实际应用表明,该协议具有较好的扩展性,能够满足大规模分布式交互系统的网络通信要求.     

提取多尺度光照不变量的人脸识别

光照变化条件下的人脸图像识别一直以来都是图像处理中的热点和难点问题,为了提高人脸图像的识别率,提出了一种用于非均匀光照条件下人脸识别的算法.利用对数及二维小波变换的多尺度特性提取出人脸的光照不变量,然后运用PCA+LDA方法进行人脸特征提取,并采用基于欧氏距离的最近邻分类器进行识别.通过Matlab编程实验,在Yale B人脸库中达到了较高的识别率.     

移动自组网安全技术研究

移动Ad Hoc网络由于其动态拓扑和无线通信等特点,容易受到安全威胁.将现有的移动Ad Hoc网络的网络安全技术分为入侵检测与防范、安全路由协议技术、架构模型技术、密钥技术和其他技术.其中,入侵检测与防范主要基于移动Ad Hoc网络的特点,在一定教学模型的基础上对于网络节点的行为进行分析和监测,以保证整个移动网络的网络安全.安全路由协议技术包括全新的安全路由协议技术和现有路由协议的安全化改进技术.密钥技术主要是基于移动Ad Hoc网络的特点对现有密钥技术进行改造.对上述移动Ad Hoc网络的网络安全技术分别进行了介绍和分析.     

煤矿井下ZigBee无线传感器网络路由协议的研究

文章介绍了无线传感器网络的发展及其特点,在分析比较了目前流行的几种无线传感器网络路由协议的基础上,结合煤矿井下掘进工作面的特点和需求,提出了一种适用于掘进工作面的网状拓扑结构的ZigBee无线传感器网络的路由算法,并从路由建立、路由维护、路由恢复等方面进行了详细描述。该路由算法对其它具有ZigBee网状拓扑结构的系统具有一定的参考价值。     

A test for stability robustness of linear time‐varying systems utilizing the linear time‐invariant ν‐gap metric

A stability robustness test is developed for internally stable, nominal, linear time‐invariant (LTI) feedback systems subject to structured, linear time‐varying uncertainty. There exists (in the literature) a necessary and sufficient structured small gain condition that determines robust stability in such cases. In this paper, the structured small gain theorem is utilized to formulate a (sufficient) stability robustness condition in a scaled LTI ν‐gap metric framework. The scaled LTI ν‐gap metric stability condition is shown to be computable via linear matrix inequality techniques, similar to the structured small gain condition. Apart from a comparison with a generalized robust stability margin as the final part of the stability test, however, the solution algorithm implemented to test the scaled LTI ν‐gap metric stability robustness condition is shown to be independent of knowledge about the controller transfer function (as opposed to the LMI feasibility problem associated with the scaled small gain condition which is dependent on knowledge about the controller). Thus, given a nominal plant and a structured uncertainty set, the stability robustness condition presented in this paper provides a single constraint on a controller (in terms of a large enough generalized robust stability margin) that (sufficiently) guarantees to stabilize all plants in the uncertainty set. Copyright © 2008 John Wiley & Sons, Ltd.     

Degree-Optimal Routing for P2P Systems

We define a family of Distributed Hash Table systems whose aim is to combine the routing efficiency of randomized networks—e.g. optimal average path length O(log ² n/δlog δ) with δ degree—with the programmability and startup efficiency of a uniform overlay—that is, a deterministic system in which the overlay network is transitive and greedy routing is optimal. It is known that Ω(log n) is a lower bound on the average path length for uniform overlays with O(log n) degree (Xu et al., IEEE J. Sel. Areas Commun. 22(1), 151–163, 2004). Our work is inspired by neighbor-of-neighbor (NoN) routing, a recently introduced variation of greedy routing that allows us to achieve optimal average path length in randomized networks. The advantage of our proposal is that of allowing the NoN technique to be implemented without adding any overhead to the corresponding deterministic network. We propose a family of networks parameterized with a positive integer c which measures the amount of randomness that is used. By varying the value c, the system goes from the deterministic case (c=1) to an “almost uniform” system. Increasing c to relatively low values allows for routing with asymptotically optimal average path length while retaining most of the advantages of a uniform system, such as easy programmability and quick bootstrap of the nodes entering the system. We also provide a matching lower bound for the average path length of the routing schemes for any c. This work was partially supported by the Italian FIRB project “WEB-MINDS” (Wide-scalE, Broadband MIddleware for Network Distributed Services), .