基于UART的智能卡接口IP核设计

分析了UART核的结构和智能卡的传输协议,提出一种基于UART核的智能卡接口IP核的设计。该设计以成熟的UART核为基础,无需编写异步串口的时序与接口逻辑,仪在串口核中增加收发缓冲器和协议处理等模块,减少了工作量并缩短了开发周期。最后对所设计的IP核进行仿真和实际测试,结果表明该IP核设计正确,运行稳定,适合在多卡系统中应用。     

An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more expensive in terms of circuit complexity as well as power consumption. Therefore, efficient algorithmic solutions are essentially required to be implemented using network processors as low cost solutions.Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution. In order to construct a balanced search tree, the prefixes with the nesting relationship should be converted into completely disjointed prefixes. A leaf-pushing technique is very useful to eliminate the nesting relationship among prefixes [V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion, ACM Transactions on Computer Systems 17 (1) (1999) 1-40]. However, it creates duplicate prefixes, thus expanding the search tree.This paper proposes an efficient IP address lookup algorithm based on a small balanced tree using entry reduction. The leaf-pushing technique is used for creating the completely disjointed entries. In the leaf-pushed prefixes, there are numerous pairs of adjacent prefixes with similarities in prefix strings and output ports. The number of entries can be significantly reduced by the use of a new entry reduction method which merges pairs with these similar prefixes. After sorting the reduced disjointed entries, a small balanced tree is constructed with a very small node size. Based on this small balanced tree, a native binary search can be effectively used in address lookup issue. In addition, we propose a new multi-way search algorithm to improve a binary search for IPv4 address lookup. As a result, the proposed algorithms offer excellent lookup performance along with reduced memory requirements. Besides, these provide good scalability for large amounts of routing data and for the address migration toward IPv6. Using both various IPv4 and IPv6 routing data, the performance evaluation results demonstrate that the proposed algorithms have better performance in terms of lookup speed, memory requirement and scalability for the growth of entries and IPv6, as compared with other algorithms based on a binary search.     

Systematic robustness analysis of least squares mobile robot velocity estimation using a regular polygonal optical mouse array

This paper presents the robust velocity estimation of an omnidirectional mobile robot using a regular polygonal array of optical mice that are installed at the bottom of a mobile robot. First, the velocity kinematics from a mobile robot to an array of optical mice is derived, from which the least squares estimation of the mobile robot velocity is obtained as the simple average of the optical mouse velocity readings. Second, it is shown that a redundant number of optical mice contributes to the robustness of the least squares mobile robot velocity estimation against both measurement noises and partial malfunction of optical mice. Third, the sensitivity analysis of the least squares mobile robot velocity estimation to imprecise installation of optical mice is made, from which a practical method of optical mouse position calibration is devised. Finally, some experimental results using commercial optical mice are given to demonstrate the validity and performance of the proposed mobile robot velocity estimation. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

根据客户网络应答DNS服务器的设计与实现

为了解决网络互连带宽"瓶颈"问题,很多单位的WWW服务器或邮件服务器同时申请不同网络的IP。若这些服务器所申请的不同网络IP对应不同的域名,即通过不同域名来区分不同的访问线路,会给用户访问服务器时带来不便。而一种能根据客户源IP地址所归属网络,把同一个域名解析成不同IP地址的DNS服务器的实现,既解决带宽"瓶颈"问题又方便网民。在Windows平台下,设计和实现了具有根据客户所归属网络应答功能的DNS服务器。     

Mobile learning in chemical engineering: An outlook based on case studies

In the context of the electronic learning (E-learning) methodology, mobile learning (M-learning) focuses on the use of portable technology (such as mobiles or tablets) and the mobility of students. E-learning, and particularly M-learning, can be implemented in combination with other pedagogical methodologies for chemical engineering teaching and learning. We can consider that the vast majority of undergraduates own personal mobile devices nowadays. Moreover, many case studies have shown that M-learning is an effective methodology to capture students’ attention and to actively engage them in the learning process. In most cases, lecturers have reported an improvement in both academic performance and qualifications and have expressed a favourable opinion towards this type of initiative in surveys. In line with the increasing interest in the incorporation of E-learning, this review discusses cases studies based on M-learning within the field of chemical engineering teaching through different technological platforms and apps which can be installed or directly used on mobile devices. All the platforms described in this work offer a free version, emphasizing the possibility of extending this methodology within the university with no need for additional economic resources.     

Time-optimized contextual information forwarding in mobile sensor networks

We study on the forwarding of quality contextual information in mobile sensor networks (MSNs). Mobile nodes form ad-hoc distributed processing networks that produce accessible and quality-stamped information about the surrounding environment. Due to the dynamic network topology of such networks the context quality indicators seen by the nodes vary over time. A node delays the context forwarding decision until context of better quality is attained. Moreover, nodes have limited resources, thus, they have to balance between energy conservation and quality of context. We propose a time-optimized, distributed decision making model for forwarding context in a MSN based on the theory of optimal stopping. We compare our findings with certain context forwarding schemes found in the literature and pinpoint the advantages of the proposed model.     

Peer-to-peer bichromatic reverse nearest neighbours in mobile ad-hoc networks

The increasing use of mobile communications has raised many issues of decision support and resource allocation. A crucial problem is how to solve queries of Reverse Nearest Neighbour (RNN). An RNN query returns all objects that consider the query object as their nearest neighbour. Existing methods mostly rely on a centralised base station. However, mobile P2P systems offer many benefits, including self-organisation, fault-tolerance and load-balancing. In this study, we propose and evaluate 3 distinct P2P algorithms focusing on bichromatic RNN queries, in which mobile query peers and static objects of interest are of two different categories, based on a time-out mechanism and a boundary polygon around the mobile query peers. The Brute-Force Search Algorithm provides a naive approach to exploit shared information among peers whereas two other Boundary Search Algorithms filter a number of peers involved in query processing. The algorithms are evaluated in the MiXiM simulation framework with both real and synthetic datasets. The results show the practical feasibility of the P2P approach for solving bichromatic RNN queries for mobile networks.     

基于BACnet/IP的设备与实时数据库通信实现

针对不同厂商、不同系统的楼宇自控设备互操作、互通信的局限性,分析了BACnet/IP技术和实时数据库,设计开发了一种基于BACnet/IP技术的实时数据库DasRdb的设备驱动程序。该设备驱动程序采用UDP通信方式,通过调用每个BACnet/IP设备的标准接口函数来驱动实时数据库DasRdb分别进行写操作和读操作,能够有效地实现BACnet/IP设备与实时数据库DasRdb之间的通信,从而使楼控设备的互操作成为可能。现场工程应用表明,该程序的运行契合BACnet的一致性要求,具有简单、高效、精确度高、实时性好的特点。     

手机银行风险评价体系研究

从手机银行的应用现状出发,阐述手机银行的技术架构以及常见的安全风险。结合国家等级保护及行业主管部门的相关技术要求,分析手机银行的各个层面的风险评估指标,并采取层次分析法确定各指标的权重,最后得出手机银行的总体安全情况。在此基础上形成的手机银行风险评价体系,可量化风险评估结果,为手机银行的风险管理提供依据。     

位置相关信息服务中的一种数据预取方法

位置相关信息服务中访问数据涉及到复杂的空间计算,导致访问数据的延迟时间较长,而数据预取能够显著提高数据的访问速度,缩短访问数据的时间。基于LDD的预取策略如DDP考虑了数据距离,但是没有考虑数据的访问概率和更新频率及数据大小。针对以上问题提出基于价值的数据预取（CDP）策略,一些重要的数据预取因素如访问概率、更新频率、数据项大小、数据距离和有效范围等都包含在价值函数里,根据价值函数值的大小来选择被预取的数据。通过实验对比,CDP比DDP策略能更有效的提高缓存命中率。