Wavelet twin support vector machine

Twin support vector machine (TWSVM) is a research hot spot in the field of machine learning in recent years. Although its performance is better than traditional support vector machine (SVM), the kernel selection problem still affects the performance of TWSVM directly. Wavelet analysis has the characteristics of multivariate interpolation and sparse change, and it is suitable for the analysis of local signals and the detection of transient signals. The wavelet kernel function based on wavelet analysis can approximate any nonlinear functions. Based on the wavelet kernel features and the kernel function selection problem, wavelet twin support vector machine (WTWSVM) is proposed by this paper. It introduces the wavelet kernel function into TWSVM to make the combination of wavelet analysis techniques and TWSVM come true. The experimental results indicate that WTWSVM is feasible, and it improves the classification accuracy and generalization ability of TWSVM significantly.     

基于交叠社团相似性的生物网络关键节点识别

生物网络是研究生物特性的一个重要工具,目前已经有许多方法用于研究生物网络,关键节点分析是其中最常用的方法之一。关键节点分析通常是根据一定的规则为网络中的各节点分配一个函数值,并由此来确定网络中各节点的重要程度,目前已经发表了一些方法。然而,这些方法在单独使用的情况下,获得的关键节点的生物学意义一般较低,存在一定的缺陷。本文从节点对社团贡献的角度建立关键节点识别方法,首先提取网络中富含生物学功能意义的社团,然后依据交叠社团的相似性为各节点分配贡献值,最后通过两个生物网络实例论证了方法的有效性。     

β-甘露聚糖酶理化性质与其最适pH的相关性

为了探究影响GH5家族β-甘露聚糖酶最适pH的各种因素,利用该酶的序列信息,构建了基于氨基酸组成的β-甘露聚糖酶理化性质与其最适pH的相关性模型。结果表明:该酶N端氨基酸序列是影响其最适pH的重要因素,在243个理化性质中有17个呈极显著相关,其中7个呈正相关。优化的转移能量参数相关性最高,为0.78:7个正相关的理化性质中,与螺旋相关的理化性质占3个。优化的转移能量参数和螺旋是影响pH稳定性的最重要的因素。所建立的模型为研究该酶酸碱适应性机理提供了一种简单有效的方法。     

一种检测单晶炉热场温度的新方法

为去除单晶炉热场温度测量信号中的低频干扰、提高温度信号的估计精度,本文提出了一种基于跨维模拟退火(trans dimensional simulated annealing,TDSA)的单晶炉热场温度检测方法.该方法首先将AIC(Akaike information criterion)信号个数判断准则纳入采样机制中以便对干扰个数采样估计,进而利用所设计的基于信号频谱和轮盘赌思想的Metropolis Hastings机制对相应个数的干扰频率进行采样,最后设计了混合均匀和高斯采样机制对单晶炉热场温度进行采样估计.仿真和单晶炉工程实验结果表明,该方法在干扰个数未知的情况下,能够有效地抑制低频干扰、准确检测单晶炉热场的温度.     

利用煤层气发展山西合成油工业探讨

介绍了国外利用天然气生产油口的生产工艺，探讨了山西省利用丰富的煤层气资源发展合成油的可能性和优势，并提出了相应的发展建议。     

A Rough RBF Neural Network Based on Weighted Regularized Extreme Learning Machine

Adjusting parameters iteratively is a traditional way of training neural networks, and the Rough RBF Neural Networks (R-RBF-NN) follows the same idea. However, this idea has many disadvantages, for instance, the training accuracy and generalization accuracy etc. So how to change this condition is a hot topic in Academics. On the basis of Extreme Learning Machine (ELM), this paper proposes a Weighted Regularized Extreme Learning Machine (WRELM), taking into account both minimizing structured risk and weighted least-squares principle, to train R-RBF-NN. The traditional iterative training method is replaced by the minimal norm least-squares solution of general linear system. The method proposed in this paper, increasing controllability of the entire learning process and considering the structured risk and empirical risk, can improve the performance of learning and generalization. Experiments show that it can reach a very superior performance in both time and accuracy when WRELM trains the Rough RBF Neural Networks in pattern classification and function regression, especially in pattern classification, which can improve the generalization accuracy more than 3.36 % compared with ELM. Obviously, the performance of the method proposed in this paper is better than the traditional methods.     

Image super-resolution based on multi-space sparse representation

Sparse representation provides a new method of generating a super-resolution image from a single low resolution input image. An over-complete base for sparse representation is an essential part of such methods. However, discovering the over-complete base with efficient representation from a large amount of image patches is a difficult problem. In this paper, we propose a super-resolution construction based on multi-space sparse representation to efficiently solve the problem. In the representation, image patches are decomposed into a structure component and a texture component represented by the over-complete bases of their own spaces so that their high-level features can be captured by the bases. In the implementation, a prior knowledge about low resolution images generation is combined to the typical base construction for high construction quality. Experiment results demonstrate that the proposed method significantly improves the PSNR, SSIM and visual quality of reconstructed high-resolution image.     

Coverage enhancement by using the mobility of mobile sensor nodes

Coverage is a fundamental problem in sensor networks. Sensor coverage, which reflects how well a sensor network is monitored by sensors, is an important measure for the quality of service (QoS) that a sensor network can provide. In mobile sensor networks, the mobility of sensor nodes can be utilized to enhance the coverage of the network. Since the movement of sensor nodes will consume much energy, this mobility of sensor nodes should be properly managed by some pre-defined schemes or protocols. By noticing this issue, some existing works have proposed several movement-assisted sensor deployment schemes. These works assume that the target field is a 2-dimensional space. In this paper, we study a generalized case of this problem whereby the target field can be a space which ranges from 1-dimensional to 3-dimensional. Two variations of the movement-assisted sensor deployment problem with different optimization objectives were formulated. We identify a set of basic attributes which can be used as guidelines for designing movement-assisted sensor deployment schemes. Based on these attributes, we propose efficient algorithms for both variants of the movement-assisted sensor deployment problem.     

Prediction-based realistic 3D model compression

The benefit of using the geometry image to represent an arbitrary 3D mesh is that the 3D mesh can be re-sampled as a completely regular structure and coded efficiently by common image compression methods. For geometry image-based 3D mesh compression, we need to code the normal-map images while coding geometry images to improve the subjective quality and realistic effects of the reconstructed model. In traditional methods, a geometry image and a normal-map image are coded independently. However a strong correlation exists between these two kinds of images, because both of them are generated from the same 3D mesh and share the same parameterization. In this paper we propose a predictive coding framework, in which the normal-map image is predicted based on the geometric correlation between them. Additionally we utilize the strong geometric correlation among three components of normal-map image to improve the predicting accuracy. The experimental results show the proposed coding framework improves the coding efficiency of normal-map image, meanwhile the realistic effect of a 3D mesh is significantly enhanced.     

Self-repair ability of evolved self-assembling systems in cellular automata

Self-repairing systems are those that are able to reconfigure themselves following disruptions to bring them back into a defined normal state. In this paper we explore the self-repair ability of some cellular automata-like systems, which differ from classical cellular automata by the introduction of a local diffusion process inspired by chemical signalling processes in biological development. The update rules in these systems are evolved using genetic programming to self-assemble towards a target pattern. In particular, we demonstrate that once the update rules have been evolved for self-assembly, many of those update rules also provide a self-repair ability without any additional evolutionary process aimed specifically at self-repair.