Consensus of heterogeneous first‐ and second‐order multi‐agent systems with directed communication topologies

In this paper, we consider the consensus problem for heterogeneous multi‐agent systems composed of some first‐order and some second‐order dynamic agents in directed communication graphs. Consensus protocols are proposed for the second‐ and first‐order dynamic agents, respectively. Under certain assumptions on the control parameters, for fixed communication topologies, necessary and sufficient conditions for consensus are given, and the consensus values of all agents are established. For switching topologies, sufficient conditions are given for all agents to reach consensus. Finally, simulation examples are presented to demonstrate the effectiveness of the proposed methods. Copyright © 2013 John Wiley & Sons, Ltd.     

煤矿应急救援中无线Mesh网络多信道分配算法

针对现有的无线Mesh网络多信道分配算法无法解决煤矿应急救援中无线Mesh网络因传输干扰导致的信道分配抖动问题,结合无线Mesh网络连通性以及干扰模型,提出了一种基于拓扑分层和干扰避免的多信道分配算法,即对网络拓扑分层,在确定第1层节点与边的基础上,继续对其他层进行拓扑分配,然后根据干扰情况对各层进行信道分配。设计了仿真模型:无线Mesh节点发射距离为200m,干扰距离为500m,拓扑范围为1 000m×1 000m。随机选取20个节点,在可用信道变化和网关变化2种情况下对该算法进行仿真分析,结果表明该算法较常用的拓扑结构算法提高了网络的吞吐量,降低了信道分配中的传输干扰。     

A destination-based approach for cut detection in wireless sensor networks

Wireless sensor networks often suffer from disrupted connectivity caused by its numerous aspects such as limited battery power of a node and unattended operation vulnerable to hostile tampering. The disruption of connectivity, often referred to as network cut, leads to ill-informed routing decisions, data loss and waste of energy. A number of protocols have been proposed to efficiently detect network cuts; they focus solely on a cut that disconnects nodes from the base station. However, a cut detection scheme is truly useful when a cut is defined with respect to multiple destinations (i.e. target nodes), rather than a single base station. Thus, we extend the existing notion of cut detection, and propose an algorithm that enables sensor nodes to autonomously monitor the connectivity to multiple target nodes. We introduce a novel reactive cut detection solution, the point-to-point cut detection, where given any pair of source and destination, a source is able to locally determine whether the destination is reachable or not. Furthermore, we propose a lightweight proactive cut detection algorithm specifically designed for a network scenario with a small set of target destinations. We prove the effectiveness of the proposed algorithms through extensive simulations; specifically, in our network configurations, proposed cut detection algorithms achieve more than an order of magnitude improvement in energy consumption, when coupled with an underlying routing protocol.     

The Impact of Serial Solutions’ Summon™ on Information Literacy Instruction: Librarian Perceptions

Web-scale discovery systems, such as Serial Solutions’ Summon? Service, are replacing older federated search technologies as the tool for users to access library resources quickly and easily. The impact of Web-scale discovery systems on instruction is not known. This study of instruction librarian perceptions of Summon's impact on instruction and student information literacy skills is based on a survey. The survey reveals librarians’ ambivalence toward Summon. While some librarians agree that Summon has the potential to change the way librarians teach information literacy skills, it has not been fully integrated into the classroom.     

ACT-LDA:集成话题、社区和影响力分析的概率模型

随着社交网络的发展,社交网络中的用户形成大规模的用户关系图,用户在社交网络中发表内容,这些内容及其链接关系形成大规模的文档图.如何根据用户关系图、文档图,挖掘出用户所形成的社区、社区用户的影响力以及各个社区的话题,是重要的问题,而目前这些工作相对独立.考虑了用户发表内容、用户之间的关系信息,利用话题传播、社区形成和用户影响力之间的关联性,提出了一个基于LDA (latent Dirichlet allocation)的集成话题发现、社区发现和用户影响力分析的统一模型ACT-LDA(author-community-topic LDA).模型采用变分推理的方法解决推理问题.在DBLP数据上进行了实验,取得了非常好的结果,证明了模型的有效性.     

基于语义的QoS感知Web服务发现机制

随着提供相同功能的Web服务数量的日益增多,服务质量(Quality of Service,QoS)成为用户选择Web服务的重要考虑因素.目前,通过对服务QoS属性在语法层匹配来提供Web服务选取的机制不能很好地满足复杂QoS属性匹配的要求.研究了基于用户QoS需求偏好,将用户需求的QoS与候选服务的QoS进行语义比较,结合约束规划(Constraint Programming)方法,在语义层匹配Web服务的QoS属性,选取满足匹配要求的服务,最后对满足QoS属性值约束的候选服务进行优化选择处理,获取最终匹配的候选服务.     

基于复杂网络模型的基因调控网络的计算模拟

随着大通量基因芯片数据的产生,基因调控机制的网络化研究需求日趋迫切。提出了基于复杂网络理论的基因调控网络的模拟方法,构建了基因调控网络模拟器GN-Simulator。通过分析真实基因调控网络的拓扑特性,提出了对应的矩阵模型,并充分考虑了网络的生物学鲁棒性和动力学稳定性,给出了人工基因网络的生成过程和计算模拟方法。计算实验表明,GN-Simulator能高效地模拟出与真实基因调控网络高度相似的大规模人工网络,并可为不同算法提供无偏验证的多样化人工模拟数据。     

Skitter与Ark探测架构下AS级Internet拓扑分析

选取CAIDA授权的AS级2003年1月—2007年12月的Skitter数据及2008年1月—12月的Ark数据进行层层深入的对比分析,以说明Internet拓扑探测架构的改变对拓扑探测结果的影响。首先统计了Skitter及Ark架构下AS级Internet拓扑的多种宏观特征,分析了Skitter与Ark在各特征值上的异同,进而分析了网络的幂率特征与网络连通性以及拓扑核数的演化,指出幂率性质以及高聚类性质在Internet拓扑中是真实存在的,不随探测方式的改变而消失。     

分布式系统中的资源发现机制综述

资源发现问题亦即由给定的资源描述找到满足该描述的资源地址。如何快速并且准确地从分布存储的资源中找到所需的资源,是一个挑战性的问题。传统的网格资源发现系统采用注册中心和索引的方式,但这些方式不能满足网格系统规模不断扩大的需求。而对等网络是一种扩展性好的分布式系统,采用已有的P2P技术解决网格环境下的资源发现问题是一种有效的途径。介绍了网格系统中的资源发现、P2P系统的资源发现以及基于P2P的网格资源发现系统,并对它们进行了比较。