Collective motion in non-reciprocal swarms

This paper studies a non-reciprocal swarm model that consists of a group of mobile autonomous agents with an attraction-repulsion function governing the interaction of the agents. The function is chosen to have infinitely large values of repulsion for vanishing distance between two agents so as to avoid occurrence of collision. It is shown analytically that under the detailed balance condition in coupling weights, all the agents will aggregate and eventually form a cohesive cluster of finite size around the weighted center of the swarm in a finite time. Moreover, the swarm system is completely stable, namely, the motion of all agents converge to the set of equilibrium points. For the general case of non-reciprocal swarms without the detailed balance condition, numerical simulations show that more complex self-organized oscillations can emerge in the swarms. The effect of noise on collective dynamics of the swarm is also examined with a white Gaussian noise model.     

Hybrid information retrieval policies based on cooperative cache in mobile P2P networks

The concept of Peer-to-Peer (P2P) has been introduced into mobile networks, which has led to the emergence of mobile P2P networks, and originated potential applications in many fields. However,mobile P2P networks are subject to the limitations of transmission range, and highly dynamic and unpredictable network topology, giving rise to many new challenges for efficient information retrieval. In this paper, we propose an automatic and economical hybrid information retrieval approach based on cooperative cache. In this method, the region covered by a mobile P2P network is partitioned into subregions, each of which is identified by a unique ID and known to all peers. All the subregions then constitute a mobile Kademlia (MKad) network. The proposed hybrid retrieval approach aims to utilize the floodingbased and Distributed Hash Table (DHT)-based schemes in MKad for indexing and searching according to the designed utility functions. To further facilitate information retrieval, we present an effective cache update method by considering all relevant factors. At the same time, the combination of two different methods for cache update is also introduced. One of them is pull based on time stamp including two different pulls: an on-demand pull and a periodical pull, and the other is a push strategy using update records. Furthermore, we provide detailed mathematical analysis on the cache hit ratio of our approach. Simulation experiments in NS-2 showed that the proposed approach is more accurate and efficient than the existing methods.     

面向服务的中间件管理方法

中间件的繁荣使得中间件的管理面临着管理对象的类型与数量都极大丰富的问题;同时,开放的网络环境使得管理目标呈现出多样化、综合化和柔性化的特点。上述问题要求中间件的管理能力具有可增长的特性,以满足个性、多样的管理需求。提出了一种面向服务的中间件管理方法。方法中,已有的中间件管理功能被封装为服务,通过服务组装的方式实现管理功能的增值。讨论了中间件预置管理功能的封装、管理的组装模式、组装中接口适配和异常处理等问题,并用一个J2EE场景的管理实例示范和论证了提出的方法。     

程序:物理对象上的操作表达式(英文)

把赋值语句看作物理对象上的操作时,程序就呈现为物理对象上的操作构成的表达式(简称O表达式)。给出了定义O表达式语法的BNF公式,并用公理规定O表达式的语义。主动式的O表达式以计算最终结果为目的,因而相关公理给出的是施行表达式中操作以后的变量与施行之前变量之间的准确依赖关系。反应式O表达式要对外来需求作反应。描述反应的公理规定如何反应。有关通讯的公理要求正确的信息被正确的接受者收到。共享变量公理则给出有关共享变量的性质判断。例子用于说明异步顺序O表达式的性质是如何分析的。     

Consensus protocols for discrete-time multi-agent systems with time-varying delays

This paper addresses consensus problems for discrete-time multi-agent systems with time-varying delays and switching interaction topologies and provides a class of effective consensus protocols that are built on repeatedly using the same state information at two time-steps. We show that those protocols can solve consensus problems under milder conditions than the popular consensus algorithm proposed by Jadbabaie et al., specifically, the presented protocols allow for the case that agents can only use delayed information of themselves, whereas the popular one is invalid. It is proved that if the union of the interaction topologies across the time interval with some given length always has a spanning tree, then in the presence of bounded time-varying delays, those protocols solve consensus problems.     

XML发布/订阅数据流系统基于共享的多查询连接算法

XML的发布/订阅系统中的XML多查询连接,涉及到多个XML文件之间关系的订阅的处理,包括了对XPath路径模式的评测,对XML文档之间的比较计算以及对系统时间进行管理等方面。基于共享的连接算法,通过适当的组织,使得多个订阅之间相同的变量连接计算结果得以被重复利用,较大程度地减少了开销很大的连接计算,从而较大地提高系统效率。实验结果表明,基于共享的算法取得了良好的实际效果,能适合于百万以上订阅的场合。     

一种动态维护分布式环境下top-k集合的近似算法

在分布式数据流场景中,如何动态维护top-k集合并尽可能地降低通信开销是非常重要的.通常的做法是:把大量的数据从分布式节点传送到中央节点,然后在中央节点计算top-k集合.这样的通信开销非常大,在许多场合下是根本无法实现的.提出了一种高效地动态维护分布式环境下top-k集合的近似算法top-k'.在算法中对一个top-k查询,通过动态维护k'(K<,max>≥k'≥k)个最高积分的元组,可以从中选取积分最高的k个元组返回.实验表明top-k'显著降低了各节点与中央协调节点之间的通信代价.     

基于三维雷达图像数据的风暴体追踪算法研究

TITAN算法是目前临近天气预报的主要方法之一,主要用于对强对流天气的识别、跟踪和预报。在原算法中速度约束是固定的、预报方法只适用于结构较稳定的风暴,它们会对算法的总体性能有较大的影响。针对这些不足,通过使用动态速度约束和光流法对算法进行了改进。通过实验证明,这些改进对风暴结构变化较大的情况有较好的效果,可以使算法的总体性能平均提高6%左右。     

无线传感器网络应用支撑技术研究

无线传感器网络的出现,产生了许多新型应用.而为了支撑各种各样的应用,需要范围广且复杂的实现技术.作为一个多学科交叉领域,无线传感器网络方向具有大量的应用及相应支撑技术,需要进行适当的分类整理.基于这种情况,本文首先综述了无线传感器网络的应用现状,然后结合无线传感器网络各方面应用,从计算机学科的角度系统地讨论了无线传感器网络的支撑技术,包括通信协议、定位、时钟同步、能量管理等普遍存在于各种无线传感器网络的基础支撑技术,以及目标识别与跟踪、数据存储、数据融合与无线传感器网络安全等几种典型的与应用紧密相关的支撑技术.     

碳纳米管场效应晶体管紧凑模型研究进展

随着摩尔定律逼近极限,碳纳米管场效应晶体管(CNTFET)被认为是5 nm以下CMOS晶体管的有力替代者。CNTFET具有准一维结构,栅极可有效控制导电沟道的导通/关断;同时,载流子在沟道内可实现近弹道输运,具有极高的迁移率。因此,CNTFET在低电压环境下,可提供较大的电流传输能力,为实现纳米级超大规模模拟/逻辑电路提供了解决方案。文章综述了CNTFET紧凑模型的发展现状,分析了现阶段面临的漏极电流精确模型、隧穿效应、寄生效应、多纳米管模型等存在的问题,重点探讨了针对这些问题的解决方案。最后对该紧凑模型未来的应用前景进行了讨论。