基于SVM的不良文本信息识别

不良文本识别的实际应用中,大多数文本之间总有交界甚至彼此掺杂,这种非线性不可分问题给不良文本识别带来了难度。应用 SVM 通过非线性变换可以使原空间转化为某个高维空间中的线性问题,而选择合适的核函数是 SVM 的关键。由于单核无法兼顾对独立的不良词汇和词汇组合的识别,使识别准确率不高,而且也无法兼顾召回率。针对不良文本识别的特定应用,依据 Mercer 定理结合线性核与多项式核提出了一种新的组合核函数,这种组合核函数能兼顾线性核与多项式核的优势,能够实现对独立的不良词汇以及词汇组合进行识别。在仿真实验中评估了线性核、齐次多项式核以及组合核函数,实验结果表明组合核函数的识别准确率与召回率都比较理想。     

基于测地距离的KPCA人脸识别

针对人脸检测数据集中的信息均为高维特征向量且人脸识别易受表情变化影响等问题,本文提出一种基于测地距离的KPCA人脸识别方法,该方法利用非线性方法提取主成分。先采用KPCA方法把人脸数据映射到高维空间,进而在高维空间中提取人脸的主成分,其中核函数为多项式核函数;然后引入测地距离替换原来的欧氏距离进行相似度量,其能更准确地测量出两像素点间的实际距离,使得人脸识别率受表情变化影响小。该方法不但可以实现降维,而且还能达到有效提取特征的目的。在ORL人脸库上的实验结果表明,该方法的识别率明显优于PCA、KPCA等方法的识别率。     

Linux内核提权攻击研究

提权攻击是针对Linux系统的一种重要攻击手段。根据提权攻击所利用的漏洞类型,一般可将其分为应用层提权攻击和内核提权攻击。现有的防御技术已经能够防御基本的应用层提权攻击,但是并不能完全防御内核提权攻击,内核提权攻击仍是Linux系统面临的一个重要威胁。内核提权攻击一般通过利用内核提权漏洞进行攻击。针对内核提权攻击,分析研究了基本的内核提权漏洞利用原理以及权限提升方法,并对典型的内核提权攻击防御技术进行了分析。最后通过实验对SELinux针对内核提权攻击的防御效果进行了分析验证,并针对发现的问题指出了下一步具有可行性的研究方向。     

基于改进最小噪声分离变换的特征提取与分类

在最小噪声分离变换的基础上,引入核方法,采用小波核函数代替传统核函数对最小噪声分离变换予以改进。小波核函数的多分辨率分析特性可进一步提高算法的非线性映射能力。相关向量机高光谱图像分类是一种较新的高光谱图像分类方法,将新型核最小噪声分离变换方法与相关向量机相结合,对高光谱影像数据进行分类实验。仿真实验结果表明,基于小波核最小噪声分离变换的方法体现了高光谱影像的非线性特征,将所提出的方法应用于HYDICE系统在Washington DC Mall上空拍摄的数据,与对照算法相比,分类精度可提高3%~8%,并可有效地提高小样本区域的分类精度。     

基于嵌入式Linux系统的键盘驱动设计

摘要：为了适应嵌入式设备外设的多样性,本文以特殊矩阵键盘为例,设计了一套完整的驱动控制模块。硬件电路设计采用外扩3片SN74HCl64芯片的方式,节省了GPIO引脚的使用,大大提高了利用效率。同时,在此基础上引出了Linux内核中input子系统的特性和工作机制,呈现了较为完整的输入事件由内核空间传递到用户空间进程的过程。实验结果表明,设计的驱动模块具有良好的实时性和准确性。     

基于X86平台的简单多任务内核的分析与实现

描述了一个简单多任务内核的设计和实现方法。分析了该简单内核的基本结构和加载运行的基本原理,然后描述了其被加载进机器RAM中以及两个任务进行切换的运行方法。     

基于完全虚拟化的安全监控技术探析

近几年来随着计算机虚拟化技术的迅速发展,基于完全虚拟化技术的安全监控应运而生,它不仅能确保监控工具的有效性、牢固性,而且监控技术易于实现.本文将从安全监控架构中内核、内核可加戢模块两个方面存在的问题对基于完全虚拟化的安全监控技术进行探析.     

Key-dependent 3D model hashing for authentication using heat kernel signature

Multimedia-based hashing is considered an important technique for achieving authentication and copy detection in digital contents. However, 3D model hashing has not been as widely used as image or video hashing. In this study, we develop a robust 3D mesh-model hashing scheme based on a heat kernel signature (HKS) that can describe a multi-scale shape curve and is robust against isometric modifications. We further discuss the robustness, uniqueness, security, and spaciousness of the method for 3D model hashing. In the proposed hashing scheme, we calculate the local and global HKS coefficients of vertices through time scales and 2D cell coefficients by clustering HKS coefficients with variable bin sizes based on an estimated L² risk function, and generate the binary hash through binarization of the intermediate hash values by combining the cell values and the random values. In addition, we use two parameters, bin center points and cell amplitudes, which are obtained through an iterative refinement process, to improve the robustness, uniqueness, security, and spaciousness further, and combine them in a hash with a key. By evaluating the robustness, uniqueness, and spaciousness experimentally, and through a security analysis based on the differential entropy, we verify that our hashing scheme outperforms conventional hashing schemes.     

Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions

In this paper, we generalize polynomial-time primal–dual interior-point methods for symmetric optimization based on a class of kernel functions, which is not coercive. The corresponding barrier functions have a finite value at the boundary of the feasible region. They are not exponentially convex and also not strongly convex like many usual barrier functions. Moreover, we analyse the accuracy of the algorithm for this class of functions and we obtain an upper bound for the accuracy which depends on a parameter of the class.     

Sparse kernel logistic regression based on L 1/2 regularization

The sparsity driven classification technologies have attracted much attention in recent years, due to their capability of providing more compressive representations and clear interpretation. Two most popular classification approaches are support vector machines (SVMs) and kernel logistic regression (KLR), each having its own advantages. The sparsification of SVM has been well studied, and many sparse versions of 2-norm SVM, such as 1-norm SVM (1-SVM), have been developed. But, the sparsification of KLR has been less studied. The existing sparsification of KLR is mainly based on L ₁ norm and L ₂ norm penalties, which leads to the sparse versions that yield solutions not so sparse as it should be. A very recent study on L _1/2 regularization theory in compressive sensing shows that L _1/2 sparse modeling can yield solutions more sparse than those of 1 norm and 2 norm, and, furthermore, the model can be efficiently solved by a simple iterative thresholding procedure. The objective function dealt with in L _1/2 regularization theory is, however, of square form, the gradient of which is linear in its variables (such an objective function is the so-called linear gradient function). In this paper, through extending the linear gradient function of L _1/2 regularization framework to the logistic function, we propose a novel sparse version of KLR, the 1/2 quasi-norm kernel logistic regression (1/2-KLR). The version integrates advantages of KLR and L _1/2 regularization, and defines an efficient implementation scheme of sparse KLR. We suggest a fast iterative thresholding algorithm for 1/2-KLR and prove its convergence. We provide a series of simulations to demonstrate that 1/2-KLR can often obtain more sparse solutions than the existing sparsity driven versions of KLR, at the same or better accuracy level. The conclusion is also true even in comparison with sparse SVMs (1-SVM and 2-SVM). We show an exclusive advantage of 1/2-KLR that the regularization parameter in the algorithm can be adaptively set whenever the sparsity (correspondingly, the number of support vectors) is given, which suggests a methodology of comparing sparsity promotion capability of different sparsity driven classifiers. As an illustration of benefits of 1/2-KLR, we give two applications of 1/2-KLR in semi-supervised learning, showing that 1/2-KLR can be successfully applied to the classification tasks in which only a few data are labeled.