Efficient peer-to-peer file sharing in 3G networks

In 3G networks upgraded with high speed packet access (HSPA) technology, the high access bandwidth and advanced mobile devices make it applicable to share large files among mobile users by peer-to-peer applications. To receive files as quickly as possible is essential for mobile users in file sharing applications, since they are subject to unstable signal strength and battery failures. While many researches present peer-to-peer file sharing architectures in mobile environments, few works focus on decreasing the time spent in disseminating files among users. In this paper, we present an efficient peer-to-peer file sharing design for HSPA networks called efficient file sharing (EFS) for 3G networks. EFS can decrease the dissemination time by efficiently utilizing the upstream-bandwidth of mobile nodes. It uses an adaptive rearrangement of a node’s concurrent uploading transfers, which causes the count of the node’s concurrent uploading transfers to lower while ensuring that the node’s upstream-bandwidth can be efficiently utilized. Our simulations show that, EFS achieves much less dissemination time than other protocols including Bullet Prime and a direct implementation of BitTorrent for mobile environments.     

An authenticated group key distribution scheme for wireless sensor networks

In wireless sensor networks (WSNs), group key distribution is the core of secure communications since sensor nodes usually form groups and cooperate with each other in sensing data collection and in-network processing. In this paper, we present a scalable authenticated scheme for group key distribution based on a combinatorial exclusion basis system (EBS) for efficiency and one-way hash chains for authentication. The proposed scheme guarantees a lightweight authenticated group key updating procedure and is efficient in terms of storage, communication and computation overheads. Foundation item: the National High Technology Research and Development Program (863) of China (Nos. 2006AA01Z436, 2007AA01Z455, and 2007AA01Z473).     

城市一卡通IC卡在线加值之解决方案

论文首先对城市一卡通IC卡在线加值解决方案的国内外发展背景进行了分析论述,提出IC卡在线加值要以住建部密钥系统为安全基础保证,并分析了IC卡在线加值安全保证的住建部密钥系统的的重要性,并对住建部密钥的结构进行分解分析；提出了IC卡在线加值系统的系统层次,安全容错方法,并归纳了在线充值的数据处理流程.     

一种基于节点异质性降低跳图维护代价的方法

Skip Graphs提供了一种新的P2P查找算法,但是其系统查询和维护的消息流量巨大,限制了其应用.本文通过构造节点异质性模型,充分考虑节点异质性和节点负载的关系,提出新的Skip Graphs＋＋算法,有效降低系统的维护代价10%～30%,并从理论和仿真两方面进行证明.     

Robust stability of neutral systems: A discretized Lyapunov functional method

This paper focuses on the robust stability for time-delay systems of neutral type. A new complete Lyapunov-Krasovskii function (LKF) is developed. Based on this function and discretization, stability conditions in terms of linear matrix inequalities are obtained. A class of time-varying uncertainty of system matrices can be studied by the method. Foundation item: the National High Technology Research and Development Program (863) of China (No. 2006AA05Z148)     

方格路网车辆路径在线选择模型及竞争分析

为分析城市方格路网遭遇突发性堵塞下的车辆路径选择问题,应用在线问题与竞争策略的方法建模,设计了2种在线路径选择竞争策略,即方向贪婪策略和多选择移动策略,计算了2种策略的竞争性能比。通过策略竞争分析得出:在发生突发性堵塞的情形下,方向贪婪策略下的费用为最优费用的3倍;利用多选择移动策略在对网络具有实际意义约束条件下的部分情形能够得到最优费用,且在最坏情形下的费用为最优费用的2倍;2种策略的竞争性能比优于以往研究给出的堵塞不可恢复问题竞争比的下界。     

船舶机舱监测报警仿真训练系统设计与开发

为满足轮机工程和船舶电气、船机电专业学生船舶机舱监测报警系统训练要求,设计开发了＂船舶机舱监测报警仿真训练系统＂。该系统集监测报警软件、硬件的PLC数据采集系统和传感器于一体,打破了以前开发的监测报警软件只能训练操作使用,不能显示真实数据,传感器独立,没有连入系统,学生只能学习它的工作原理,而并不知道实际工作真实情况的弊端。使用该仿真系统进行培训可以给学生以身临其境的感受,有利于他们迅速掌握船舶机舱监测报警系统的结构和管理要点,对学生将来的工作起到非常重要的促进作用。     

一类新的(k+2,k) Hadamard MSR码

为降低分布式存储系统中节点的存储量,构造了一类新(k+2, k)Hadamard MSR码.该码的每个编码矩阵皆对应于2个值,供其对角元素选取.在编码矩阵中,这2个值循环出现,且不同的矩阵,循环出现的周期不同.基于这一特性构造了节点的修复方案,将失效节点中的个数据分成/2组,每一组重建2个数据,其他k+1个节点为每一组各提供1个数据.证明了若新码编码矩阵的对角元素可取的2个值不相等,则可最优修复系统节点;若所有编码矩阵对角元素可取的2个值的和为同一不为0的值,则可最优修复第1个校验节点;若所有编码矩阵对角元素可取的2个值的逆的和为1,则可最优修复第2个校验节点.新码的节点存储量降低到了Hadamard MSR码的理论界,可最优修复任意系统节点和1个校验节点.      

File Transfer Algorithm for Autonomous Decentralized System

A file transfer algorithm based on ADP (autonomous decentralized protocol) was proposed to solve the problem that the ADS (autonomous decentralized system) middleware (NeXUS/Dlink) lacks of file transfer functions for Windows. The algorithm realizes the peer-to-peer file transfer, one-to-N inquiry/multi-response file transfer and one-to-N file distribution in the same data field based on communication patterns provided by the ADP. The peer-to-peer file transfer is implemented through a peer-to-peer communication path, one-to-N inquiry/multi-response file transfer and one-to-N file distribution are implemented through multicast commtmieation. In this algorithm, a file to be transferred is named with a GUID ( global unique identification), every data packet is marked with a sequence number, and file-receiving in parallel is implemented by caching DPOs (data processing objects) and multithread technologies. The algorithm is applied in a simulation system of the decentralized control platform, and the test results and long time stable mrming prove the feasibility of the algorithm.     

Efficient Search in P2P File Sharing System

A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed algorithm was tested by creating a P2P simulator and varying the input parameters, and was compared to the search algorithms using flooding （FLD） and random walk （RW）. The result shows that with the proposed design, the queries are muted effectively, the network flows are reduced remarkably, and the peer-to-peer file sharing system gains a good expansibility.     

In-home power line communication media access control protocol based on collision resolution

Most existing media access control (MAC) protocols in power line communication (PLC) networks just discard the colliding data packets when collision occurs. The collision deteriorates throughput and delay performance of system under high traffic conditions. This article presents a novel media access scheme with fast collision resolution for in-home power line networks. It works by first recognizing the colliding stations through detecting the inserted unique ID sequence ahead of data packets, then the source nodes retransmitting their packets immediately after the collision slot. The proposed protocol maintains the benefits of ALOHA systems. It needs no scheduling overhead and is suitable for bursty sources, such as multimedia data packets. Computer simulations have demonstrated that this approach can achieve high throughput due to its ability of resolving collisions.     

Generating Domain-Specific Affective Ontology from Chinese Reviews for Sentiment Analysis

Considering the diversities and ambiguities of opinion expressions in Chinese online product reviews,normal sentiment analysis technologies have exposed their inadequateness in both classification accuracy and identifying effectiveness.We propose a novel approach which can easily identify product features and corresponding opinions by building a domain-specific affective ontology and thus mapping comment sentences to the objects defined in the affective ontology.Ontology is created automatically by processing the online reviews;both product features and affective words are presented as nodes which are connected to each other by their semantic relationship.Furthermore,in order to increase the accuracy,we introduce a dynamic polarity detection technique for affective words whose sentimental tendencies are dependent on particular contexts.The experimental results clearly demonstrate the performance improvement of our approach compared with others in real world online product reviews for classification tests.     

未来城市交通技术发展与创新 ——“交通7+1论坛”第五十二次会议

随着移动互联网、大数据和人工智能等技术发展,城市交通系统中涌现出“共享交通”“需求响应式出行服务”“无人驾驶”“城市交通大脑”等新兴的交通工具、服务模式和管理手段,未来交通系统将面临创新发展的机遇,并对传统交通行业带来巨大挑战.本次论坛以“未来城市交通技术发展与创新”为主题,分析了预约交通系统的发展前景,探讨了超级交通仿真系统的相关核心技术,分析了无人驾驶的发展、挑战及仿真技术,说明了大数据和人工智能技术在城市智慧发展中的作用与运用要点.     

基于遗传算法的道路车辆自组织网络源路由机制

在当前基于交叉路口的城市车辆自组织网络(VANETs)路由协议中，道路上数据包传输大多采用基于地理位置的贪婪转发策略，当数据量较大时，个别节点负载较重，极易引起传输延迟增大乃至丢包的情况.本文提出了一种基于遗传算法的源路由机制，通过记录单体车辆的驾驶信息而非传统方法中的车流均值数据，来预测道路上车辆网络的连通情况，并借助遗传算法，首次基于道路连通性、节点负载和连接跳数这3 点综合考虑，计算得出道路上最佳的源路由节点序列.仿真实验结果表明，在传输率与延迟时间上，性能均优于传统的贪婪路由机制，尤其在车流量为250 veh· lane-1· h-1时，传输率提升约13%.该研究可为智能交通信息通讯提供可靠助力.     

基于遗传算法的道路车辆自组织网络源路由机制

在当前基于交叉路口的城市车辆自组织网络(VANETs)路由协议中，道路上数据包传输大多采用基于地理位置的贪婪转发策略，当数据量较大时，个别节点负载较重，极易引起传输延迟增大乃至丢包的情况.本文提出了一种基于遗传算法的源路由机制，通过记录单体车辆的驾驶信息而非传统方法中的车流均值数据，来预测道路上车辆网络的连通情况，并借助遗传算法，首次基于道路连通性、节点负载和连接跳数这3 点综合考虑，计算得出道路上最佳的源路由节点序列.仿真实验结果表明，在传输率与延迟时间上，性能均优于传统的贪婪路由机制，尤其在车流量为250 veh· lane-1· h-1时，传输率提升约13%.该研究可为智能交通信息通讯提供可靠助力.     

Implementation of dynamic matrix control on field programmable gate array

High performance computer is often required by model predictive control (MPC) systems due to the heavy online computation burden. To extend MPC to more application cases with low-cost computation facilities, the implementation of MPC controller on field programmable gate array (FPGA) system is studied. For the dynamic matrix control (DMC) algorithm, the main design idea and the implemental strategy of DMC controller are introduced based on a FPGA’s embedded system. The performance tests show that both the computation efficiency and the accuracy of the proposed controller can be satisfied due to the parallel computing capability of FPGA.     

Ad Hoc网络保持连通度的临界传输范围的研究

连通度是Ad Hoc网络的根本属性.保持网络的连通性对于提高网络的吞吐量至关重要.目前的研究主要以概率论方法为理论基础,讨论节点的发射半径在什么范围内,保持Ad Hoc网络的k连通.文中对Ad Hoc网络连通度目前的研究进展进行了综述,在引入能量模型的基础上,对Ad Hoc网络的连通度进行了仿真,并基于仿真结果,提出了Ad Hoc网络保持连通的临界传输范围,最后对将来的研究方向进行了展望.     

AR-Dedupe: An Efficient Deduplication Approach for Cluster Deduplication System

As data are growing rapidly in data centers,inline cluster deduplication technique has been widely used to improve storage efficiency and data reliability.However,there are some challenges faced by the cluster deduplication system:the decreasing data deduplication rate with the increasing deduplication server nodes,high communication overhead for data routing,and load balance to improve the throughput of the system.In this paper,we propose a well-performed cluster deduplication system called AR-Dedupe.The experimental results of two real datasets demonstrate that AR-Dedupe can achieve a high data deduplication rate with a low communication overhead and keep the system load balancing well at the same time through a new data routing algorithm.In addition,we utilize application-aware mechanism to speed up the index of handprints in the routing server which has a 30%performance improvement.     

基于ARIMA-RBF神经网络的沿海港口吞吐量预测研究

在沿海吞吐量预测中，影响因素多且复杂，传统的计量经济模型很难得到满意的结果。针对此特点，提出一种组合预测模型，先后用ARIM A模型和RBF神经网络模型探求港口吞吐量历史数据的线性和非线性变化规律，最后将两者预测结果组合。对福建省港口货物吞吐量预测作为实例进行验证，结果表明，相对单一预测模型，该方法的预测精确度更高。     

怎样实现模糊查询

模糊查询采用联想式的模糊推理方式,帮助用户在查找对象特征不确切的情况下,找 出相关的信息,并通过联想确认最终的查询结果。这种查询方式适用于人文档案管 理、户口管理、道路咨询等系统。本文以铁道部TG系统(铁道部干部信息管理系统) 的扩展系统中的姓名查询模块为实例,谈模糊查询的设计思路。