基于NS2的AOMDV路由协议的改进与性能仿真

对AOMDV协议进行了分析,指出了协议存在的不足,利用“一主一备”式路由和抢先式路由对其进行了改进,提出了PAOMDV协议。对NS2（Network Simulator Version2）的分裂对象模型进行了分析,基于NS2实现了AOMDV及PAOMDV路由协议的扩展与仿真。仿真结果表明：在相同的网络环境下,与AOMDV协议相比,PAOMDV协议减少了平均时延、降低了路由发现频率、提高了分组传送率。     

eXist数据库结构连接算法的改进和实现

为了进一步提高eXist数据库的查询效率,针对数据库现有的数据存储特点和查询策略,提出一种快速定位的结构连接算法FL-Stack。算法采用栈缓存已遍历过的但仍可能与尚未遍历的后代结点匹配的祖先结点,并对能预先判断不可能满足结构连接匹配的祖先或后代结点,提出相应方法实现快速定位,以批量跳过这类结点。与现有算法必须逐个扫描祖先后代结点序列相比,这种快速定位的结构连接算法避免了逐个扫描带来的多次重复无意义的比较,可大大提高结构连接效率。     

一种抗合谋攻击的基于身份的门限签名方案

基于Paterson签名方案和分布式密钥生成协议,提出了一个新的基于身份的门限签名方案。该方案能有效抵抗合谋攻击和伪造签名攻击,并能实现签名成员的可追查性。无需可信中心参与,群签名成员共同生成群公钥和秘密分发群签名密钥。在标准模型下,该方案是健壮的和对适应性选择消息攻击是不可伪造的。     

无线Mesh网络同步架构研究

提出了基于混合GPS同步与信标同步的无线Mesh网络同步方案,能够简化系统设计,防止同步误差逐级累积.在Mesh骨干节点间采用GPS同步,设计并实现了不依赖于CPLD等硬件的GPS时隙同步算法,简化了系统硬件设计.提出了在失去GPS后骨干节点同步修正算法,在失去GPS信号后能在一定的时间内维持系统的同步,提高了系统的可靠性.在Mesh接入节点与骨干节点之间采用改进的信标同步方案,能够在较远的距离达到10us级的同步精度.最后通过实验数据验证同步方案的同步精度.     

一款基于APA300的创新型FPGA实验板

基于Actel公司Flash型FPGA芯片APA300设计并实现一款创新型FPGA实验板.该实验板包括2片互通的APA300、丰富的外围设备和常用外部设备端口,还提供与外部电路连接的扩展接口,能够开展多种创新性实验,并可作为科学预研的平台.在详细介绍了实验板各部分的实现原理和电路连接图后,给出了实验板的两个典型创新性实验示例:协处理器密码机和MP3播放器.     

Provable secure identity based generalized signcryption scheme

According to actual needs, a generalized signcryption scheme can flexibly work as an encryption scheme, a signature scheme or a signcryption scheme. In this paper, firstly, we give a security model for identity based generalized signcryption which is more complete than the existing model. Secondly, we propose an identity based generalized signcryption scheme. Thirdly, we give the security proof of the new scheme in this complete model. Compared with existing identity based generalized signcryption, the new scheme has less implementation complexity. Moreover, the new scheme has comparable computation complexity with the existing normal signcryption schemes.     

Hard multidimensional multiple choice knapsack problems, an empirical study

Recent advances in algorithms for the multidimensional multiple choice knapsack problems have enabled us to solve rather large problem instances. However, these algorithms are evaluated with very limited benchmark instances. In this study, we propose new methods to systematically generate comprehensive benchmark instances. Some instances with special correlation properties between parameters are found to be several orders of magnitude harder than those currently used for benchmarking the algorithms. Experiments on an existing exact algorithm and two generic solvers show that instances whose weights are uncorrelated with the profits are easier compared with weakly or strongly correlated cases. Instances with classes containing similar set of profits for items and with weights strongly correlated to the profits are the hardest among all instance groups investigated. These hard instances deserve further study and understanding their properties may shed light to better algorithms.     

Building a database for product design knowledge retrieval—A case study in robotic design database

In product design process, when dealing with technical problems or initiating a new design, R&D personnel would often turn to technical database to seek inspiration. The building of a database with such documents has not been systematically dealt with. In this paper, several issues on how to build up a product design database are investigated: input source, sampling scheme and quality control. A case study of building a database for robotic design is used to demonstrate the concept. It is an archive of more than 1500 relevant technical papers. A total of 16 graduates are employed as operators in the labeling process and subsequently the hypothesis tests are utilized to process the labeling results. To ensure this database quality, the labeling consistency of each operator and the understanding of each category are tested. With the use of statistical methods, this work proposes a feasible and practical way to create such a database for product design.     

Global exponential robust stability of reaction–diffusion interval neural networks with continuously distributed delays

This paper considers the existence of the equilibrium point and its global exponential robust stability for reaction-diffusion interval neural networks with variable coefficients and distributed delays by means of the topological degree theory and Lyapunov-functional method. The sufficient conditions on global exponential robust stability established in this paper are easily verifiable. An example is presented to demonstrate the effectiveness and efficiency of our results.