基于Lua的Linux内核测试工具开发

为减小传统的通过编写大量代码来调用Linux内核及驱动接口进行测试的编程难度,缩短测试周期,采用将Lua脚本语言载入Linux内核并使用脚本语言进行内核及驱动测试的方法,设计并实现一种简易Linux内核驱动测试工具。实验结果表明,该工具所占用的Linux内核空间小,使用灵活方便,可对内核及驱动模块进行准确有效的测试。     

基于CK-CPU的Linux2.6实时性能优化

针对Linux2.6在实时中断应用上的局限性,提出一种基于CK-CPU的实时性能优化方案。设计用于实时中断的快速中断请求(FIQ)机制,在FIQ处理程序退出时增加实时进程调度策略,将FIQ服务程序的公共代码和堆栈保留在便笺式存储器中,减少FIQ服务程序的内存访问次数并加快其执行速度。实验结果证明,该方案可显著提高Linux2.6的实时性能。     

实时操作系统Toppers在ARM 7上移植的研究

为简化应用程序的编写,在嵌入式系统开发时,采用实时嵌入式操作系统开发平台,将源码开放的嵌入式实时操作系统Toppers/asp内核,移植到嵌入式微控制器ARM7(S3C44B0)。该方法能解决系统启动和加载过程中的特定工作状态等问题,明确Toppers/asp内核在移植过程中的重点和难点。经多任务运行结果表明,Toppers嵌入式实时操作系统稳定可靠。     

基于树核函数的英文句子情感分类研究

最近几年,由于在线客户评论信息飞快地增长。如何把这些信息分类为正向和负向情感是一个迫切需要解决的问题。提出了一种细粒度级别(句子级别)的情感分类方法,该方法在SVM分类器中使用了树核和复合核函数来进行句子级别情感的分类。实验结果表明在句子级别的情感分类中树核和复合核的方法比线性核具有更佳的性能。     

A novel approach for analog fault diagnosis based on neural networks and improved kernel PCA

We have developed a neural-network-based fault diagnosis approach of analog circuits using maximal class separability based kernel principal components analysis (MCSKPCA) as preprocessor. The proposed approach can detect and diagnose faulty components efficiently in the analog circuits by analyzing their time responses. First, using wavelet transform to preprocess the time responses obtains the essential and reduced candidate features of the corresponding response signals. Then, the second preprocessing by MCSKPCA further reduces the dimensionality of candidate features so as to obtain the optimal features with maximal class separability as inputs to the neural networks. This simplifies the architectures reasonably and reduces the computational burden of neural networks drastically. The simulation results show that our resulting diagnostic system can classify the faulty components of analog circuits under test effectively and achieves a competitive classification performance.     

Gaussian kernel optimization: Complex problem and a simple solution

The Gaussian kernel function implicitly defines the feature space of an algorithm and plays an essential role in the application of kernel methods. The parameter of Gaussian kernel function is a scalar that has significant influences on final results. However, until now, it is still unclear how to choose an optimal kernel parameter. In this paper, we propose a novel data-driven method to optimize the Gaussian kernel parameter, which only depends on the original dataset distribution and yields a simple solution to this complex problem. The proposed method is task irrelevant and can be used in any Gaussian kernel-based approach, including supervised and unsupervised machine learning. Simulation experiments demonstrate the efficacy of the obtained results. A user-friendly online calculator is implemented at: www.csbio.sjtu.edu.cn/bioinf/kernel/ for public use.     

支持向量机的进化多核设计

为提高支持向量机分类精度,提出一种基于遗传程序设计的进化多核算法.算法中每个个体表示一个多核函数,并采用树形结构进行编码,增强了多核函数的非线性;初始种群由生长法产生,经过遗传操作后得到适合具体问题的进化多核函数.遗传程序设计的全局搜索性能使得算法设计不需要先验知识.与单核函数及其他多核函数的对比实验结果表明,进化多核...     

非参数回归模型均值函数结构变点的检测与应用

本文将一类系统参数变点检测问题转化为非参数回归模型均值函数结构变点的检测问题.针对当非参数模型均值函数跃度的长期均值为零时,残量累积和(cumulative sum,CUSUM)统计量无效的问题,首先利用均值函数的核估计构造新统计量,给出了原假设和备择假设下统计量的极限分布;进一步构造Bootstrap检验,证明了Bootstrap检验的一致性;最后以模拟结果表明新方法明显优于已有的方法,并应用于两类实际数据分析,说明方法的有效性.     

Robustness of temporal logic specifications for continuous-time signals

In this paper, we consider the robust interpretation of Metric Temporal Logic (MTL) formulas over signals that take values in metric spaces. For such signals, which are generated by systems whose states are equipped with non-trivial metrics, for example continuous or hybrid, robustness is not only natural, but also a critical measure of system performance. Thus, we propose multi-valued semantics for MTL formulas, which capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance, ε$\epsilon$, from unsatisfiability. We prove that any other signal that remains ε$\epsilon$-close to the initial one also satisfies the same MTL specification under the usual Boolean semantics. Finally, our framework is applied to the problem of testing formulas of two fragments of MTL, namely Metric Interval Temporal Logic (MITL) and closed Metric Temporal Logic (clMTL), over continuous-time signals using only discrete-time analysis. The motivating idea behind our approach is that if the continuous-time signal fulfills certain conditions and the discrete-time signal robustly satisfies the temporal logic specification, then the corresponding continuous-time signal should also satisfy the same temporal logic specification.     

Gaussian kernel optimization for pattern classification

This paper presents a novel algorithm to optimize the Gaussian kernel for pattern classification tasks, where it is desirable to have well-separated samples in the kernel feature space. We propose to optimize the Gaussian kernel parameters by maximizing a classical class separability criterion, and the problem is solved through a quasi-Newton algorithm by making use of a recently proposed decomposition of the objective criterion. The proposed method is evaluated on five data sets with two kernel-based learning algorithms. The experimental results indicate that it achieves the best overall classification performance, compared with three competing solutions. In particular, the proposed method provides a valuable kernel optimization solution in the severe small sample size scenario.