基于TMS320F2812与LabVIEW的串口通信

介绍利用TMS320F2812数字信号处理器（DSP）的串行通信模块实现与外设间串行通信的原理,结合实际应用给出异步串行通信的程序设计。针对电力传动控制系统数字变量不易观察的问题,将DSP运算得到的数据通过RS232串口送至PC。采用LabVIEW开发上位机软件,无须额外增加硬件,实现了数据的采集、显示、处理和存储。该系统还可以对数据进行FFr变换、谐波分析等特定的分析和处理。给出利用DSP产生的4路波形数据在LabVIEW下的实验波形。     

基于正则表达式的测试数据自动生成技术

软件测试是提高软件可靠性、保证软件质量的重要手段。数据自动生成是测试自动化的重要组成部分。提出一种基于正则表达式的测试数据自动生成技术,生成的数据应该具有随机性、可控制、可定义、有意义、无错误等特性,特别是对大字段／专有类型等特殊类型的支持,可以解决目前测试数据自动生成存在的问题,具有良好的扩展性。     

异步128位AES算法的硬件设计

基于四相握手协议设计异步流水线,实现单轮运算内流水操作,设计轮运算启动模块和异步控制信号生成模块,满足算法多轮运算的需要。在子密钥生成模块、字节替代模块和列混合模块使用复用技术,降低了对硬件的需求。在COMS0.18μm工艺下进行综合、布局布线和仿真,与采用同样数据路径设计方法的同步电路相比,吞吐率提高了12.5%。     

一种伪随机自治服务可生存调度算法

可生存调度算法是服务可生存性研究中的重要内容,在服务器集群系统中引入随机策略,使服务在各个服务器之间的轮转产生不确定效果,可增加攻击者攻击系统的难度,增强系统可生存性。介绍可生存性研究的层次划分,指出可生存调度算法在可生存性研究中的作用,分析现有可生存调度算法的优缺点,提出一种伪随机自治服务可生存调度算法,并分析算法的性能。     

集群系统中的FP-Growth并行算法

针对FP-Growth算法面临大规模数据库时空效率不高的问题,提出一种面向计算机集群的并行算法。采用投影方法直接寻找频繁项的条件数据库,将挖掘条件数据库的工作分化成若干独立的子任务,分配到集群中的节点上并行实现,由中央节点汇总结果并输出。结果证明,该算法不仅能够提高计算速度,解决数据库规模过大时内存溢出的情况,且具有良好的延展性。     

A divide-and-conquer hole-filling method for handling disocclusion in single-view rendering

Large holes are unavoidably generated in depth image based rendering (DIBR) using a single color image and its associated depth map. Such holes are mainly caused by disocclusion, which occurs around the sharp depth discontinuities in the depth map. We propose a divide-and-conquer hole-filling method which refines the background depth pixels around the sharp depth discontinuities to address the disocclusion problem. Firstly, the disocclusion region is detected according to the degree of depth discontinuity, and the target area is marked as a binary mask. Then, the depth pixels located in the target area are modified by a linear interpolation process, whose pixel values decrease from the foreground depth value to the background depth value. Finally, in order to remove the isolated depth pixels, median filtering is adopted to refine the depth map. In these ways, disocclusion regions in the synthesized view are divided into several small holes after DIBR, and are easily filled by image inpainting. Experimental results demonstrate that the proposed method can effectively improve the quality of the synthesized view subjectively and objectively.     

Dual graph regularized NMF model for social event detection from Flickr data

In this work, we aim to discover real-world events from Flickr data by devising a three-stage event detection framework. In the first stage, a multimodal fusion (MF) model is designed to deal with the heterogeneous feature modalities possessed by the user-shared data, which is advantageous in computation complexity. In the second stage, a dual graph regularized non-negative matrix factorization (DGNMF) model is proposed to learn compact feature representations. DGNMF incorporates Laplacian regularization terms for the data graph and base graph into the objective, keeping the geometry structures underlying the data samples and dictionary bases simultaneously. In the third stage, hybrid clustering algorithms are applied seamlessly to discover event clusters. Extensive experiments conducted on the real-world dataset reveal the MF-DGNMF-based approaches outperform the baselines.     

一种改进的面向切面编程系统设计与实现

简要介绍AOP技术,提出基于AspectJ技术框架的AOP系统的解决方案。给出其在J2EE项目的设计与实现方法,实例研究表明,该框架在设计AOP系统时具有良好的扩展性和简洁性。     

Testbed results of an opportunistic routing for multi-robot wireless networks

Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing + MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV + CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV + CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed.