In this paper, a novel method for predicting RNA secondary structure called RNA secondary structure prediction based on Tabu Search (RNATS) is proposed. In RNATS, two search models, intensification search and diversif...
详细信息
Services computing is an interdisciplinary subject that devotes to bridging the gap between business services and IT services. It is recognized that Requirements Engineering is fundamental in implementing the service ...
详细信息
Separation logic is an extension of Hoare logic for reasoning about mutable heap structure. To represent separation logic in the first-order logic, there are several choices to determine what are constants, what are p...
详细信息
At present,the internet pornographic text is in varied forms and changeful, although it is prohibited ever. It severely harms people's mental and physical health development and social stability. There are IP-base...
详细信息
At present,the internet pornographic text is in varied forms and changeful, although it is prohibited ever. It severely harms people's mental and physical health development and social stability. There are IP-based,keyword-based and intelligent content analysis filtering system against it today. But they are difficult to deal with manifestations of diversity, changeful, and increasingly concealed porn. In this paper, a in-depth research has done for the appeared characteristics of such undesirable information on our statistical analysis. And based on this characteristics, a new text pre-processing algorithm PA-PTCI is proposed, and a effective model combined with content filtering technology to the current text information filtering pornography problem is designed. The experimental result shows the PA-PTCI algorithm and the model of Chinese pornography text filtering are quite effective.
Fast stereoscopic video encoding becomes a highly desired technique because the stereoscopic video has been realizable for applications like TV broadcasting and consumer electronics. The stereoscopic video has high in...
详细信息
Fast stereoscopic video encoding becomes a highly desired technique because the stereoscopic video has been realizable for applications like TV broadcasting and consumer electronics. The stereoscopic video has high inter-view dependency subject to epipolar restriction, which can be used to reduce the encoding complexity. In this paper, we propose a fast inter-prediction mode selection algorithm for stereoscopic video encoding. Different from methods using disparity estimation, candidate modes are generated by sliding a window along the macro-block line restricted by the epipolar. Then the motion information is utilized to rectify the candidate modes. A selection failure handling algorithm is also proposed to preserve coding quality. The proposed algorithm is evaluated using independent H.264/AVC encoders for left and right views and can be extended to MVC. Experimental results show that encoding times of one view are reduced by 41.4% and 24.4% for HD and VGA videos respectively with little quality loss.
In this paper, we propose a novel manifold alignment method by learning the underlying common manifold with supervision of corresponding data pairs from different observation sets. Different from the previous algorith...
A variety of wavelet transform methods have been introduced to remove noise from images. However, many of these algorithms remove the fine details and smooth the structures of the image when removing noise. The wavele...
详细信息
A variety of wavelet transform methods have been introduced to remove noise from images. However, many of these algorithms remove the fine details and smooth the structures of the image when removing noise. The wavelet coefficient magnitude sum (WCMS) algorithm can preserve edges, but it is at the expense of removing noise. The Non-Local means algorithm can removing noise effective. But it tend to cause distortion ( eg white). Meanwhile, when the noise is large, the method is not so effective. In this paper, we propose an efficient denoising algorithm. we denoised the image with non-local means algorithm in the spatial domain and WCMS algorithm in wavelet domain, weighted, combined them and got the image that we want. The experiment shows that our algorithm can improve PSNR form 0.6 dB to 1.0 dB and the image boundary is more clearly.
Cone-Beam Computed Tomography (CBCT) has always been in the forefront of medical image processing. The denoising as a image pre-processing, has a great affected on the image analysis and recognition. In this paper, a ...
详细信息
Cone-Beam Computed Tomography (CBCT) has always been in the forefront of medical image processing. The denoising as a image pre-processing, has a great affected on the image analysis and recognition. In this paper, a new algorithm for image denoising was proposed. By thresholding the interscale wavelet coefficient magnitude sum(WCMS) within a cone of influence (COI), the wavelet coefficients are classified into 2 categories: irregular coefficients, and edge-related and regular coefficients. They are processed by different ways. Meanwhile according to the projection image sequences characteristics in CBCT system, an effective noise variance estimated methods was proposed. The experiment shows that our algorithm can improve PSNR form 1.3dB to 2.6dB, and the image border is more clearly.
The coordination between agent service and Web service is the key factor for intelligent Web service management in the multi-agent based Web service framework. In view of the drawbacks of existing coordination approac...
详细信息
Text clustering is an important technology for automatically structuring large document collections. It is much more valuable in peer-to-peer networks. The high dimensionality of documents means much more communicatio...
详细信息
Text clustering is an important technology for automatically structuring large document collections. It is much more valuable in peer-to-peer networks. The high dimensionality of documents means much more communication could be saved if each node could get the approximate clustering result by distributed algorithm instead of transferring them into a center and do the clustering. Most of the existing text clustering algorithms in unstructured peer-to-peer networks are based on K-means algorithm. A problem of those algorithms is that the clustering quality may decreased with the increase of the network size. In this paper, we propose a text clustering algorithm based on frequent term sets for peer-to-peer networks. It requires relatively lower communication volume while achieving a clustering result whose quality will not be affected by the size of the network. Moreover, it gives a term set describing each cluster, which makes it possible for people to have a clear comprehension for the clustering result, and facilitates the users to find resource in the network or manage the local documents in accordance with the whole network.
暂无评论