异类值多目标二人零和约束矩阵对策及求解方法

矩阵对策是对策理论的一个重要分支。本文根据多目标决策和模糊对策理论,研究了支付值是异类值情况下的多目标二人零和约束矩阵对策问题。文章基于不同的排序方法将直觉模糊值、三角直觉模糊数和区间直觉模糊数的多目标对策清晰化,然后根据理想点法求解多目标规划问题。通过一个数值实例说明了该方法的有效性和实用性。

STRUCTURE OPTIMIZATION STRATEGY OF NORMALIZED RBF NETWORKS

Aimed at studying normali zed radial basis function network (NRBFN), this paper introduces the subtractiv e clustering based on a mountain function to construct the initial structure of NR BFN, adopts singular value decomposition (SVD) to analyze the relationship betwe en neural nodes of the hidden layer and singular values, cumulative contribution ratio, index vector, and optimizes the structure of NRBFN. Finally, simulation and performance comparison show that the algorithm is feasible and effective.

NETWORK INTRUSION DETECTION METHOD BASED ON RS-MSVM

A new method called RS-MSVM （Rough Set and Multi-class Support Vector Machine） is proposed for network intrusion detection. This method is based on rough set followed by MSVM for attribute reduction and classification respectively, The number of attributes of the network data used in this paper is reduced from 41 to 30 using rough set theory. The kernel function of HVDM-RBF （Heterogeneous Value Difference Metric Radial Basis Function）, based on the heterogeneous value difference metric of heterogeneous datasets, is constructed for the heterogeneous network data. HVDM-RBF and one-against-one method are applied to build MSVM. DARPA （Defense Advanced Research Projects Agency） intrusion detection evaluating data were used in the experiment. The testing results show that our method outperforms other methods mentioned in this paper on six aspects： detection accuracy, number of support vectors, false positive rate, falsc negative rate, training time and testing time.

Multiwavelets domain singular value features for image texture classification

A new approach based on multiwavelets transformation and singular value decomposition (SVD) is proposed for the classification of image textures. Lower singular values are truncated based on its energy distribution to classify the textures in the presence of additive white Gaussian noise (AWGN). The proposed approach extracts features such as energy, entropy, local homogeneity and max-min ratio from the selected singular values of multiwavelets transformation coefficients of image textures. The classification was carried out using probabilistic neural network (PNN). Performance of the proposed approach was compared with conventional wavelet domain gray level co-occurrence matrix (GLCM) based features, discrete multiwavelets transformation energy based approach, and HMM based approach. Experimental results showed the superiority of the proposed algorithms when compared with existing algorithms.

Random seismic noise attenuation by learning-type overcomplete dictionary based on K-singular value decomposition algorithm

The transformation of basic functions is one of the most commonly used techniques for seismic denoising,which employs sparse representation of seismic data in the transform domain. The choice of transform base functions has an influence on denoising results. We propose a learning-type overcomplete dictionary based on the K-singular value decomposition( K-SVD) algorithm. To construct the dictionary and use it for random seismic noise attenuation,we replace fixed transform base functions with an overcomplete redundancy function library. Owing to the adaptability to data characteristics,the learning-type dictionary describes essential data characteristics much better than conventional denoising methods. The sparsest representation of signals is obtained by the learning and training of seismic data. By comparing the same seismic data obtained using the learning-type overcomplete dictionary based on K-SVD and the data obtained using other denoising methods,we find that the learning-type overcomplete dictionary based on the K-SVD algorithm represents the seismic data more sparsely,effectively suppressing the random noise and improving the signal-to-noise ratio.

Matched Field Localization Based on CS-MUSIC Algorithm

The problem caused by shortness or excessiveness of snapshots and by coherent sources in underwater acoustic positioning is considered.A matched field localization algorithm based on CS-MUSIC(Compressive Sensing Multiple Signal Classification) is proposed based on the sparse mathematical model of the underwater positioning.The signal matrix is calculated through the SVD(Singular Value Decomposition) of the observation matrix.The observation matrix in the sparse mathematical model is replaced by the signal matrix,and a new concise sparse mathematical model is obtained,which means not only the scale of the localization problem but also the noise level is reduced;then the new sparse mathematical model is solved by the CS-MUSIC algorithm which is a combination of CS(Compressive Sensing) method and MUSIC(Multiple Signal Classification) method.The algorithm proposed in this paper can overcome effectively the difficulties caused by correlated sources and shortness of snapshots,and it can also reduce the time complexity and noise level of the localization problem by using the SVD of the observation matrix when the number of snapshots is large,which will be proved in this paper.