层次非负矩阵分解及在文本聚类中的应用

文本聚类的目标是把数据集中内容相似的文档归为一类,而使内容不同的文档分开。目前针对不同领域的需求,多种解决聚类问题的算法应运而生。然而,由于文本数据本身固有的复杂特点,如海量、高维、稀疏等,使得对海量文本数据的聚类仍然是一个棘手的问题。提出了层次非负矩阵分解聚类方法,该方法不但保留了非负矩阵分解的优点,如同步识别文档类别和找出类别本质特征,而且能够展现类别间的层次结构。这种类别层次结构在网页预览等应用中是非常有用的。在真实数据集20Newsgroups和Reuters-RCV1上的实验结果表明,层次非负矩阵分解相比已有的方法更有效。     

基于Matlab的网络控制系统仿真平台

为了在不同网络情况下对NCS性能进行比较,并且能够方便控制算法研究,建立了功能完善的网络控制系统（NCS）平台。对Matlab／TrueTime主要特点进行了分析,并利用其核心模块和网络模块,建立了一种NCS仿真模型;详细介绍了基于TrueTime网络仿真环境下NCS仿真模型的构建方法,并针对网络传输中出现的问题进行了实验研究和全面分析,对NCS的时延和丢包实验进行了深人地分析。实验结果表明该平台为NCS研究提供了便捷的途径。     

Rough approximations based on intersection of indiscernibility,similarity and outranking relations

Rough sets theory has proved to be a useful mathematical tool for dealing with the vagueness and granularity in information tables. Classical definitions of lower and upper approximations were originally introduced with reference to an indiscernibility relation. However, indiscernibility relation is still restrictive for many applications. Many real-world problems deal with assignment of some objects to some preference-ordered decision classes. And, the objects are described by a finite set of qualitative attributes and quantitative attributes. In this paper, we construct the indiscernibility relation for the subset of nominal attributes, the outranking relation for the subset of ordinal attributes, and the similarity relation for the subset of quantitative attributes. Then the global binary relation is generated by the intersection of indiscernibility relation, outranking relation and similarity relation. New definitions of lower and upper approximations of the upward and downward unions of decision classes are proposed based on the global relation. We also prove that the lower and upper approximation operations satisfy the properties of rough inclusion, complementarity, identity of boundaries, and monotonicity.     

一种嵌入式视频存储的专用文件系统设计

基于嵌入式视频存储的特点,分析目前已有的文件系统在视频应用上的不足,提出了适合硬盘录像机的专用文件系统设计方案,并从数据存储、检索、读取和恢复等方面阐述了设计思想及具体实现。经过在相关产品上的应用,表明该文件系统可以实现高效、安全的视频存储。     

设计速写教学模块的分解与组合

为提高设计速写课程的教学质量,采用模块化设计法对教学结构进行研究。首先,把课程分解为艺术、技术与设计三个体系。在此基础上,将各个体系分为若干训练项目。再把每个项目细化为彼此间可组合的子模块。最后从三个体系中分别抽取若干子模块,从而组建单节课的教学内容。由于每次教学都在一定程度上均衡了多方面的要求,此方法可用于提高学生的设计速写综合能力。本文结合工业设计工科类学生进行研究,结果表明该方法是正确可行的。     

An efficient memetic algorithm for solving the job shop scheduling problem

The job shop scheduling problem (JSP) is well known as one of the most complicated combinatorial optimization problems, and it is a NP-hard problem. Memetic algorithm (MA) which combines the global search and local search is a hybrid evolutionary algorithm. In this paper, an efficient MA with a novel local search is proposed to solve the JSP. Within the local search, a systematic change of the neighborhood is carried out to avoid trapping into local optimal. And two neighborhood structures are designed by exchanging and inserting based on the critical path. The objective of minimizing makespan is considered while satisfying a number of hard constraints. The computational results obtained in experiments demonstrate that the efficiency of the proposed MA is significantly superior to the other reported approaches in the literature.     

基于证据理论数据融合的双效水印

提出一种新的基于证据理论的数据融合的双效水印算法.首先应用水印公式构造特殊的水印嵌入后条件,根据嵌入系数之间的定性分析提取鲁棒水印;利用嵌入系数之间的定量分析能提取脆弱水印,并能准确定位篡改的区域.其次在嵌入过程中还使用纠错码对水印信息进行调和,把水印重复嵌入到图像信息的不同位置,以便利用纠错码的辅助信息来估计出提取的...     

Entropy Optimization Filtering for Fault Isolation of Nonlinear Non-Gaussian Stochastic Systems

In this paper, the fault isolation (FI) problem is investigated for nonlinear non-Gaussian systems with multiple faults(or abrupt changes of system parameters) in the presence of noises. By constructing a filter to estimate the states, the FI problem can be reduced to an entropy optimization problem subjected to the non-Gaussian estimation error systems. The design objective for the FI purpose is that the entropy of the estimation error is maximized in the presence of diagnosed fault and is minimized in the presence of the nuisance faults or noises. It is shown that the error dynamics is represented by a nonlinear non-Gaussian stochastic system, for which new relationships are applied to formulate the probability density functions (PDFs) of the stochastic error in terms of the PDFs of the noises and the faults. The Renyi's entropy has been used to simplify the computations in the filtering for the recursive design algorithms. It is noted that the output can be supposed to be immeasurable (but with known stochastic distributions), which is different from the existing results where the output is always measurable for feedback. Finally, simulations are given to demonstrate the effectiveness of the proposed data-driven FI filtering algorithms.     

Learning algorithm for multimodal optimization

We present a new evolutionary algorithm—“learning algorithm” for multimodal optimization. The scheme for reproducing a new generation is very simple. Control parameters, of the length of the list of historical best solutions and the “learning probability” of the current solutions being moved towards the current best solutions and towards the historical ones, are used to assign different search intensities to different parts of the feasible area and to direct the updating of the current solutions. Results of numerical tests on minimization of the 2D Schaffer function, the 2D Shubert function and the 10D Ackley function show that this algorithm is effective and efficient in finding multiple global solutions of multimodal optimization problems.     

Global asymptotic stability of delayed neural networks with discontinuous neuron activations

This paper investigates a class of delayed neural networks whose neuron activations are modeled by discontinuous functions. By utilizing the Leray–Schauder fixed point theorem of multivalued version, the properties of M-matrix and generalized Lyapunov approach, we present some sufficient conditions to ensure the existence and global asymptotic stability of the state equilibrium point. Furthermore, the global convergence of the output solutions are also discussed. The assumptive conditions imposed on activation functions are allowed to be unbounded and nonmonotonic, which are less restrictive than previews works on the discontinuous or continuous neural networks. Hence, we improve and extend some existing results of other researchers. Finally, one numerical example is given to illustrate the effectiveness of the criteria proposed in this paper.