Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
GPU-accelerated segmented Top-k query algorithm
HUANG Yulong ZOU Xunjin LIU Kui SU Benyue
Journal of Computer Applications    2014, 34 (11): 3112-3116.   DOI: 10.11772/j.issn.1001-9081.2014.11.3112
Abstract533)      PDF (723KB)(651)       Save

The existing algorithms of Top-k query can not make full use of the powerful parallel throughput of Graphic Processing Unit (GPU) to timely return the query results. So, a segmented query algorithm based on Compute Unified Device Architecture (CUDA) model was proposed. By dividing the query process and using the strategy of segmented parallel process, the maximal calculation and comparison efficiency in query process could be obtained in this algorithm. The experimental results show that this algorithm has obvious performance advantages compared with four-thread parallel optimization algorithm on multi-core CPU. When the number of ordered lists is 6 and the traversal stride is 120, the optimal performance can be obtained which is 40 times faster than multi-core CPU algorithm.

Reference | Related Articles | Metrics
Concurrent signature scheme constructed by identity-based ring signcryption
LIU Kui LIANG Xiangqian LI Xiaolin
Journal of Computer Applications    2013, 33 (05): 1386-1390.   DOI: 10.3724/SP.J.1087.2013.01386
Abstract850)      PDF (812KB)(614)       Save
The identity-based ring signcryptions have both high efficiency of identity-based cryptosystem and signcryption technology and the ambiguity of ring signature. In the fair exchange protocol based on signcryption proposed by Luo, et al (Luo M, Zou C H, Hu J, 〖WTBX〗et al.〖WTBZ〗Signcryption-based fair exchange protocol. Journal of Communications, 2010, 31(8A): 146-150), the fairness and efficiency are not good enough. The new scheme introduced a more efficient identity-based ring signcryption and dealt with the decryption and the signature-and-identity binding separately. A new fair exchange protocol was proposed based on this new scheme. The analysis shows that this scheme overcomes the fairness defect of the original scheme and has a better efficiency, which makes it a good application in electronic payment and contract signing.
Reference | Related Articles | Metrics
Analysis and improvement of verifiable ring signature schemes
LI Xiao-lin LIANG Xiang-qian LIU Kui PAN Shuai
Journal of Computer Applications    2012, 32 (12): 3466-3469.   DOI: 10.3724/SP.J.1087.2012.03466
Abstract972)      PDF (828KB)(509)       Save
By analyzing the certificateless verifiable ring signature scheme (LUO DAWEN, HE MINGXING, LI XIAO. Certificateless verifiable ring signature scheme. Computer Engineering,2009, 35(15): 135-137) and the verifiable proxy ring signature scheme (LUO DAWEN, HE MINGXING, LI XIAO.A verifiable proxy ring signature scheme.Journal of Southwest University for Nationalities:Natural Science Edition, 2009, 35(3):608-611), it was found that these convertible ring signature schemes were susceptible to non-repudiation attack, i.e., any member in the ring can impersonate others identity to sign the message and the verifier believed the signature was signed by the latter. To address the above problems, improved schemes were proposed by using the private key of the signer to have a secret value. The security analysis proves that the improved schemes overcome the security defect of the original scheme and satisfy all security requirements of verifiable ring signature.
Related Articles | Metrics
Text feature selection method based on invasive weed optimization
LIU Kui ZHOU Zhu-rong
Journal of Computer Applications    2012, 32 (08): 2245-2249.   DOI: 10.3724/SP.J.1087.2012.02245
Abstract1113)      PDF (807KB)(528)       Save
In order to select text feature more comprehensively and improve the accuracy of the text feature selection, a new text feature selection method based on Invasive Weed Optimization (IWO) was proposed. The biggest advantage of IWO is that the offspring individuals are being randomly spread around their parents according to Gauss normal distribution, and the standard deviation of the random function is adjusted dynamically during the evolution process; thus, the algorithm explores new areas aggressively to maintain the diversity of the species in the early and middle iterations, and enhances the feature selection of the optimal individuals in final iteration. Such mechanism ensured the steady convergence of the algorithm to global optimal solution, and improved the accuracy of the text feature selection. The results of experiments indicate that this method can provide the entry of low weight value with feature selection opportunity, and ensure the feature selection advantage of the entry with high weight value, thereby enhancing the completeness and accuracy of the text feature selection.
Reference | Related Articles | Metrics
Image inpainting method based on structure tensor
LIU Kui SU Ben-yue ZHAO Xiao-jing
Journal of Computer Applications    2011, 31 (10): 2711-2713.   DOI: 10.3724/SP.J.1087.2011.02711
Abstract1536)      PDF (550KB)(640)       Save
Because the traditional anisotropic diffusion equation for image restoration only considers the gradient size, and produces false edges in color image inpainting, this paper proposed an image inpainting method based on structure tensor. Structure tensor was used as diffusion coefficient which can implement different diffusion processes in different regions. The experimental results show that the new method, in comparison with Total Variation (TV) and BSCB methods, improves the image inpainting results, and effectively inpaints color images.
Related Articles | Metrics