基于相似性度量的面向对象程序方法级克隆侦测

代码克隆侦测对于代码重构以及可复用资产抽取都有着重要的作用.现有的克隆侦测方法及工具以相似代码片段为单位,给进一步的克隆分析以及代码重构带来困难.针对这一问题,本文提出了一种基于相似性度量的面向对象程序方法级克隆侦测方法,即以方法为单位进行克隆代码侦测.该方法综合利用代码中的注释、签名以及语法相似性来度量方法代码之间的克隆程度.在此基础上合并子类中的相似方法并提取到父类中,从而实现进一步的代码重构.本文通过对JDK包中代码的实验分析验证了本文所提出方法的有效性.初步的实验结果表明,本文方法能够准确、有效地辅助开发者实现方法级的克隆代码侦测.     

面向嵌入式视频处理平台的Linux移植

Linux系统是嵌入式视频处理平台的关键组成部分。介绍了一种实用的Linux移植方法,详细介绍了各个模块的设计,形成了一个完整的Linux移植体系,包括交叉编译环境创建、BootLoader设计、Linux内核移植以及LCD、USB设备驱动程序的开发,并以TMS320DM6446为开发平台,实现了Linux在其上的移植,为实时视频处理应用开发提供了良好平台。     

基于支持向量机的克隆代码有害性评价方法

克隆代码是软件中彼此相似的代码片段。传统观点认为克隆代码是有害的，会降低软件质量，但最近研究发现克隆代码不一定是有害的。如何评估克隆代码的有害性是一个值得研究的问题。本文提出了一种基于支持向量机的克隆代码有害性评价方法，可以以较高的准确性和查准率评价其有害性。为验证方法有效性，本文在6个系统上进行实验，结果表明本文方法可以有效地评价克隆代码的有害性，并且所提出的静态度量和演化度量对评价克隆代码有效性具有积极意义。     

大米虫蚀粒图像边缘检测方法

虫蚀严重影响大米的品质,大米虫蚀粒的检测具有重要的意义。图像分析是客观检测大米虫蚀粒的一种有效方法。边缘检测是采用图像法检测大米虫蚀粒的一个重要环节,该文分析了LoG算子法,频域检测法以及形态学边缘检测法,对比分析了它们的检测效果和速度,以期得到最适合检测大米虫蚀粒的图像边缘检测方法。实验结果表明,形态学检测方法效果较好,并且处理速度快。     

Anomaly Detection for Hyperspectral Images Based on Robust Locally Linear Embedding

In this paper, anomaly detection in hyperspectral images is investigated using robust locally linear embedding (RLLE) for dimensionality reduction in conjunction with the RX anomaly detector. The new RX-RLLE method is implemented for large images by subdividing the original image and applying the RX-RLLE operations to each subset. Moreover, from the kernel view of LLE, it is demonstrated that the RX-RLLE is equivalent to introducing a locally linear embedding (LLE) kernel into the kernel RX (KRX) algorithm. Experimental results indicate that the RX-RLLE has good anomaly detection performance and that RLLE has superior performance to LLE and principal component analysis (PCA) for dimensionality reduction in the application of anomaly detection.     

基于DDK的IEEE1394设备驱动程序的设计与开发

结合IEEE1394驱动程序的开发流程,在DDK的环境下开发了IEEE1394设备的WDM的驱动程序,用文中的方法创建的驱动程序具有代码简洁、结构清晰、执行效率高等特点,结果表明完全能满足工程需要.     

类傅里叶变换的多分量信号分离重构

针对多分量信号重构的问题,该文提出了一种新颖的类傅里叶变换方法,并对其基本性质进行了分析。采用该方法将频域上混叠但在时频二维频谱图上不重叠的多分量信号变换到类傅里叶变换域,使之在频谱上不产生混叠,从而达到信号分离重构的目的。与分数傅里叶域最优滤波的方法进行的对比分析说明,类傅里叶变换方法的适用范围更宽。文中对非线性的多分量调幅信号进行了仿真计算,得到了满意的结果。表明该方法在信号检测和分析方面具有应用价值。     

摩托车轨迹的光电检测系统

介绍了一种适用于驾驶执照考试的摩托车轨迹光电检测系统的构成和工作原理.系统以MCUAT89C52为核心,选用可见红光波长的激光束、霍尔接近开关作探测器,探测摩托车是否越界或碰撞障碍物,与PC机通过串行接口进行双向通信,完成摩托车轨迹的检测.系统采取激光束调制及其它措施保证了检测系统的可靠性。     

一种高效的面向虚拟桌面恶意代码检测机制简

 与传统的恶意代码检测方式相比,面向虚拟桌面的恶意代码检测方法面临着性能方面的挑战,同一物理服务器上多个虚拟桌面同时开展恶意代码检测使得磁盘等硬件成为严重的IO性能瓶颈.本文提出了一种高效的虚拟桌面恶意代码检测方案,基于母本克隆技术的虚拟桌面恶意代码检测机制（MCIDS）,MCIDS根据虚拟桌面系统的特点,通过系统映像网络存储克隆技术以及部署在网络存储系统中的恶意代码引擎减少虚拟桌面系统中的恶意代码检测范围,有效减少恶意代码检测所需的磁盘IO开销;同时MCIDS还克服了传统“Out-of-the-Box”安全检测机制存在的语义差别问题,改善了系统的安全性能.在原型系统上的实验显示该方法在技术上是可行的,与现有方法相比MCIDS具有较好的性能优势.     

Distributed source coding using short to moderate length rate-compatible LDPC codes: the entire Slepian-Wolf rate region

In this paper, we propose a scheme for distributed source coding of correlated sources using a single systematic LDPC code. In particular, since we are interested in wireless sensor network applications, we consider LDPC codes with short to moderate lengths that achieve every arbitrary coding rate on the Slepian-Wolf rate region. We simplify the distributed source coding problem to the rate-compatible LDPC code design with an unequal error protection property. The decoders communicate to each other to exchange information bits prior to decoding. However, thereafter, each performs the decoding independently. Therefore, errors in one decoder do not affect the other one. The simulation results confirm that the gap from the theoretical limit remains almost the same for different rates on the Slepian-Wolf rate region. First, we consider two correlated sources. We show that our proposed scheme improves the performance of distributed source coding of two sources considerably. This benefit is more stressed for application with short to moderate length sequences. Then, we study distributed source coding of three sources. As a special case, we investigate three sources that are pairwise correlated with the same correlation probability. We show that the gap from the theoretical limit is smaller than that of previous work. We also investigate the distributed source coding of correlated sources when there is no prior knowledge of the correlation parameter at the time of code design. We note that although the proposed distributed source coding is well suited for sensor networks (where sequences with less than 10000 bits are used), the method can be generalized to other distributed source coding applications.     

Applications of Time-Domain Numerical Electromagnetic Code to Lightning Surge Analysis

Recently, applications of 3-D numerical electromagnetic analysis have been increasing either for lightning electromagnetic impulse (LEMP) studies or lightning surge analyses on transmission and distribution lines. This paper is mainly concerned with the use of time- and frequency-domain codes for electromagnetic analysis of lightning surges. The thin-wire in time-domain (TWTD) code and numerical electromagnetic code (NEC-2) in the frequency domain based on the method of moments are chosen for comparative studies. The accuracy of TWTD code in the analysis of lightning surge characteristics of a double-circuit transmission tower is first investigated by comparing the computed results with the measured results on a reduced-scale tower model, computed results by NEC-2 on a full-scale tower model, and those computed by electromagnetic transients program. In the latter part of the paper, a switch model is combined with the TWTD code, and its applicability in analyzing the lightning surge characteristics of a transmission tower equipped with a surge arrester or in analyzing lightning-induced voltage on an overhead line is demonstrated.     

Direction of arrival estimation using adaptive directional time-frequency distributions

Time-frequency distributions (TFDs) allow direction of arrival (DOA) estimation algorithms to be used in scenarios when the total number of sources are more than the number of sensors. The performance of such time–frequency (t–f) based DOA estimation algorithms depends on the resolution of the underlying TFD as a higher resolution TFD leads to better separation of sources in the t–f domain. This paper presents a novel DOA estimation algorithm that uses the adaptive directional t–f distribution (ADTFD) for the analysis of close signal components. The ADTFD optimizes the direction of kernel at each point in the t–f domain to obtain a clear t–f representation, which is then exploited for DOA estimation. Moreover, the proposed methodology can also be applied for DOA estimation of sparse signals. Experimental results indicate that the proposed DOA algorithm based on the ADTFD outperforms other fixed and adaptive kernel based DOA algorithms.     

Solution of the problem of electromagnetic scattering by a thin dielectric cylinder with the use of the auxiliary source method

The problem of electromagnetic scattering by a thin solid dielectric cylinder is solved in the resonance frequency range by means of the auxiliary source method. The developed computer code is briefly described. The domain of applicability of the method for calculating the scattering characteristics of thin dielectric objects is investigated. The scattering cross sections of cylinders having various lengths and various values of the relative permittivity are numerically calculated.     

嵌入式Linux下ADC的驱动程序实现与应用

详细介绍S3C2410芯片ADC模块以及Linux的驱动模型,并且通过S3C2410内置的ADC驱动程序设计说明字符型设备驱动开发方法;将驱动编译为模块的方式,单独加载入内核,便于调试。以MINICOM为操作台,控制驱动模块的加载和应用程序的运行。并通过实例介绍ADC驱动程序在电阻、电压等测试中的实际应用;从实验结果可以看出ADC驱动可以被成功加载和调用;该驱动可以测试电压、电流等标准工程量信号,或作为工业传感器接口的一部分对现场标准工程量信号进行采集处理。     

基于分块LBP和鲁棒核编码的人脸识别

针对人脸识别中的遮挡和姿态偏转等问题,提出了一种基于分块LBP和鲁棒核编码(Robust Kernel Coding,RKC)的人脸识别算法,简称LBP-RKC算法.该算法首先对人脸图像进行多级分块的LBP特征提取,得到图像的每一块统计直方图特征.然后,将特征投影到核空间中,在核空间中建立一个鲁棒的回归模型来处理图像中的异常值,并利用迭代重加权算法求解该模型.最后,计算测试样本的每一块核表示重构残差并进行分类识别.实验表明,提出的LBP-RKC算法在处理遮挡、姿态偏转等人脸问题时能取得很好的识别效果,同时算法效率较高.     

Win32平台下内核溢出的原理与攻击方法

针对系统内核的溢出是当今研究溢出漏洞攻击的发展趋势,而内核溢出主要是由处在系统内核态的驱动程序中的漏洞所产生,文章通过分析Win32平台下的一个内核驱动程序漏洞实例,详细阐述了内核溢出漏洞的产生原理,并引出了相应的攻击方法。     

卷积神经网络在脑疲劳检测中的研究

脑疲劳是由于持续进行脑力劳动导致的一种状态，脑电被认为是脑疲劳状态检测的最佳工具。如何选取合适的脑疲劳特征成为脑疲劳检测的关键问题，传统模式识别中手动提取特征会产生信息损失，针对脑电的时空特性，本文设计了具有时域卷积核、空间域卷积核的深层卷积神经网络和浅层卷积神经网络两种网络结构，将特征提取和状态分类合二为一，对正常态与疲劳态脑电数据进行分类，可视化了卷积神经网络的空间域卷积核。结果表明，浅层卷积神经网络平均分类正确率为98.868%，深层卷积神经网络平均分类正确率为98.217%，均高于传统分类方法，通过空间域卷积核的可视化，能够了解不同导联在网络中的参与程度，验证了该模型在脑疲劳检测任务中具有很高的有效性，同时为脑疲劳检测提供了新思路。      

Foreground object detection using top-down information based on em framework

In this paper, we present a novel foreground object detection scheme that integrates the top-down information based on the expectation maximization (EM) framework. In this generalized EM framework, the top-down information is incorporated in an object model. Based on the object model and the state of each target, a foreground model is constructed. This foreground model can augment the foreground detection for the camouflage problem. Thus, an object's state-specific Markov random field (MRF) model is constructed for detection based on the foreground model and the background model. This MRF model depends on the latent variables that describe each object's state. The maximization of the MRF model is the M-step in the EM framework. Besides fusing spatial information, this MRF model can also adjust the contribution of the top-down information for detection. To obtain detection result using this MRF model, sampling importance resampling is used to sample the latent variable and the EM framework refines the detection iteratively. Besides the proposed generalized EM framework, our method does not need any prior information of the moving object, because we use the detection result of moving object to incorporate the domain knowledge of the object shapes into the construction of top-down information. Moreover, in our method, a kernel density estimation (KDE)-Gaussian mixture model (GMM) hybrid model is proposed to construct the probability density function of background and moving object model. For the background model, it has some advantages over GMM- and KDE-based methods. Experimental results demonstrate the capability of our method, particularly in handling the camouflage problem.     

Support OpenCL 2.0 Compiler on LLVM for PTX Simulators

Heterogeneous systems that consist of multiple CPUs and GPUs for high-performance computing are becoming increasingly popular, and OpenCL (Open Computing Language) provides a framework for writing programs that can be executed across heterogeneous devices. Compared with OpenCL 1.2, the new features of OpenCL 2.0 provide developers with better expressive power for programming heterogeneous computing environments. Currently, gem5-gpu, which includes gem5 and GPGPU-Sim, can offer an experimental simulation environment for OpenCL. In gem5-gpu, gem5 only supports CUDA, although GPGPU-Sim can support OpenCL by compiling an OpenCL kernel code to PTX code using real GPU drivers. However, this compilation flow in GPGPU-Sim can only support up to OpenCL 1.2. OpenCL 2.0 provides new features such as workgroup built-in functions, extended atomic built-in functions, and device-side enqueue. To support OpenCL 2.0, the compiler must be extended to enable the compilation of OpenCL 2.0 kernel code to PTX code. In this paper, the proposed compiler is modified from the low level virtual machine (LLVM) compiler to extend such features to enhance the emulator to support OpenCL 2.0. The proposed compiler creates local buffers for each workgroup to enable workgroup built-in functions and adds atomic built-in functions with memory order and memory scope for OpenCL 2.0 in NVPTX. Furthermore, the APIs available in CUDA are utilized to implement the OpenCL 2.0 device-side enqueue kernel and compilation schemes in Clang are revised. The AMD APP SDK 3.0 and NTU OpenCL benchmarks are used to verify that the proposed compiler can support the features of OpenCL 2.0.

     

On code design for the Slepian-Wolf problem and lossless multiterminal networks

A Slepian-Wolf coding scheme for compressing two uniform memoryless binary sources using a single channel code that can achieve arbitrary rate allocation among encoders was outlined in the work of Pradhan and Ramchandran. Inspired by this work, we address the problem of practical code design for general multiterminal lossless networks where multiple memoryless correlated binary sources are separately compressed and sent; each decoder receives a set of compressed sources and attempts to jointly reconstruct them. First, we propose a near-lossless practical code design for the Slepian-Wolf system with multiple sources. For two uniform sources, if the code approaches the capacity of the channel that models the correlation between the sources, then the system will approach the theoretical limit. Thus, the great advantage of this design method is its possibility to approach the theoretical limits with a single channel code for any rate allocation among the encoders. Based on Slepian-Wolf code constructions, we continue with providing practical designs for the general lossless multiterminal network which consists of an arbitrary number of encoders and decoders. Using irregular repeat-accumulate and turbo codes in our designs, we obtain the best results reported so far and almost reach the theoretical bounds.