基于MDA和可执行形式化的可信软件设计

提出基于模型驱动架构的软件开发过程,利用可执行形式化规范,有效提高软件开发效率和可测试性,并通过基于可执行规范的运行时监控技术保证系统行为的可信性,降低由于软件测试阶段遗留的错误以及系统受到非法入侵所带来的风险。     

基于约简SVM的网络入侵检测模型

支持向量的数量越大,基于SVM的网络入侵检测系统速度越慢。针对该问题提出一种新的SVM约简方法,在特征空间中对支持向量进行聚类,寻找聚类质心在输入空间中的原像,将其作为约简向量,以实现支持向量削减目的。实验结果证明,该方法能提高SVM入侵检测引擎的速度,增强入侵检测系统的实时响应能力。     

Set-membership estimation from poor quality data sets: Modelling ammonia volatilisation in flooded rice systems

A set-membership (bounded-error) estimation approach can handle small and poor quality data sets as it does not require testing of statistical assumptions which is possible only with large informative data sets. Thus, set-membership estimation can be a good tool in the modelling of agri-environmental systems, which typically suffers from limited and poor quality observational data sets. The objectives of the paper are (i) to demonstrate how six parameters in an agri-environmental model, developed to estimate NH₃ volatilisation in flooded rice systems, were estimated based on two data sets using a set-membership approach, and (ii) to compare the set-membership approach with conventional non-linear least-squares methods. Results showed that the set-membership approach is efficient in retrieving feasible parameter-vectors compared with non-linear least-squares methods. The set of feasible parameter-vectors allows the formation of a dispersion matrix of which the eigenvalue decomposition reflects the parameter sensitivity in a region.     

Virtual Reference Feedback Tuning for non-minimum phase plants

Model reference control design methods fail when the plant has one or more non-minimum phase zeros that are not included in the reference model, leading possibly to an unstable closed loop. This is a very serious problem for data-based control design methods, where the plant is typically unknown. In this paper, we extend the Virtual Reference Feedback Tuning method to non-minimum phase plants. This extension is based on the idea proposed in Lecchini and Gevers (2002) for Iterative Feedback Tuning. We present a simple two-step procedure that can cope with the situation where the unknown plant may or may not have non-minimum phase zeros.     

Model reduction of multi-scale chemical Langevin equations

This paper addresses the model reduction problem for a class of stiff chemical Langevin equations that arise as models of biomolecular networks with fast and slow reactions and can be described as continuous Markov processes. Initially, a coordinate transformation is sought that allows the decoupling of fast and slow variables in the model equations. Necessary and sufficient conditions are derived for such a linear transformation to exist, along with an explicit change of variables which achieves the desired decoupling. For the systems for which this step is applicable, the method of adiabatic elimination is applied to determine a representation of the slow dynamics. Theoretical concepts and results are illustrated with simple examples.     

Flash memory efficient LTL model checking

As the capacity and speed of flash memories in form of solid state disks grow, they are becoming a practical alternative for standard magnetic drives. Currently, most solid-state disks are based on NAND technology and much faster than magnetic disks in random reads, while in random writes they are generally not.So far, large-scale LTL model checking algorithms have been designed to employ external memory optimized for magnetic disks. We propose algorithms optimized for flash memory access. In contrast to approaches relying on the delayed detection of duplicate states, in this work, we design and exploit appropriate hash functions to re-invent immediate duplicate detection.For flash memory efficient on-the-fly LTL model checking, which aims at finding any counter-example to the specified LTL property, we study hash functions adapted to the two-level hierarchy of RAM and flash memory. For flash memory efficient off-line LTL model checking, which aims at generating a minimal counterexample and scans the entire state space at least once, we analyze the effect of outsourcing a memory-based perfect hash function from RAM to flash memory.Since the characteristics of flash memories are different to magnetic hard disks, the existing I/O complexity model is no longer sufficient. Therefore, we provide an extended model for the computation of the I/O complexity adapted to flash memories that has a better fit to the observed behavior of our algorithms.     

中英文文本分类系统异同因素的探讨

论文介绍了文本分类技术的研究进展及发展方向,给出了中英文文本分类系统构建的一般模型和过程,分析总结了中英文文本分类过程中的异同,并介绍了针对这些异同因素常用的处理方法。     

一种基于聚类的空间数据知识获取算法

本文提出了一个针对空间数据库基于聚类的知识获得取算法,该算法可解决空间的数据的聚类问题。