Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS)becomes a hotspot of research interest nowadays.However,this technology in the ke...Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS)becomes a hotspot of research interest nowadays.However,this technology in the kernel to many of these systems,namely string searching algorithm,has not received enough attention.By utilizing the concurrent mechanisms(multi-threading)provided by modern operation systems,such work can be divided symmetrically and thus improve the throughput of the corresponding application effectively.Presented in this work is a paralleled string searching algorithm-PBM,an algorithm based on the famous Boyer-Moore(BM)string searching algorithm.Taken as a dividable process,the string searching work is distributed between many cooperating threads of execution in the PBM algorithm,while each of them searches the target pattern in their respective share of the target strings.As compared with the traditional string searching algorithms,the PBM algorithm can do the pattern matching work faster by increasing the data processing throughput,thus adapting better to the drastic increase in the network band width.A simplification of the PBM algorithm that can be used as a multi-string searching algorithm is also suggested with supporting simulations,which is a promising approach when the number of target patterns is limited.展开更多
String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that...String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-core based environment. Experimental outcomes reveal that the overall performance of the mentioned string matching algorithm has been improved, and the improvement in the execution time which has been obtained is considerable enough to recommend the multi-core environment as the suitable platform for parallelizing the Quick Search string matching algorithm.展开更多
Rice callus suspension culture(RCSC)has been shown to have anticancer activity based on cytotoxic activity on human colon and lung cancer cell lines.In the present study,the effect of RCSC on the expression of protein...Rice callus suspension culture(RCSC)has been shown to have anticancer activity based on cytotoxic activity on human colon and lung cancer cell lines.In the present study,the effect of RCSC on the expression of proteins in lung(A549)and colon(HT29)cancer cell lines was examined by using proteomics analysis.The protein-protein interaction study of differentially expressed proteins was done by using the Search Tool for the Retrieval of Interacting Genes(STRING),and the results showed that the proteins interacting with each other belong to different pathways.展开更多
By studying the algorithms of single pattern matching, five factors that have effect on time complexity of the algorithm are analyzed. The five factors are： sorting the characters of pattern string in an increasing o...By studying the algorithms of single pattern matching, five factors that have effect on time complexity of the algorithm are analyzed. The five factors are： sorting the characters of pattern string in an increasing order of using frequency, utilizing already-matched pattern suffix information, utilizing already-matched pattern prefix information, utilizing the position factor which is absorbed from quick search algorithm, and utilizing the continue-skip idea which is originally proposed by this paper. Combining all the five factors, a new single pattern matching algorithm is implemented. It＇s proven by the experiment that the efficiency of new algorithm is the best of all algorithms.展开更多
基金This work is supported by National Science Foundatinon Grant60273035"Software Performance Assure and Recovery"
文摘Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS)becomes a hotspot of research interest nowadays.However,this technology in the kernel to many of these systems,namely string searching algorithm,has not received enough attention.By utilizing the concurrent mechanisms(multi-threading)provided by modern operation systems,such work can be divided symmetrically and thus improve the throughput of the corresponding application effectively.Presented in this work is a paralleled string searching algorithm-PBM,an algorithm based on the famous Boyer-Moore(BM)string searching algorithm.Taken as a dividable process,the string searching work is distributed between many cooperating threads of execution in the PBM algorithm,while each of them searches the target pattern in their respective share of the target strings.As compared with the traditional string searching algorithms,the PBM algorithm can do the pattern matching work faster by increasing the data processing throughput,thus adapting better to the drastic increase in the network band width.A simplification of the PBM algorithm that can be used as a multi-string searching algorithm is also suggested with supporting simulations,which is a promising approach when the number of target patterns is limited.
文摘String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-core based environment. Experimental outcomes reveal that the overall performance of the mentioned string matching algorithm has been improved, and the improvement in the execution time which has been obtained is considerable enough to recommend the multi-core environment as the suitable platform for parallelizing the Quick Search string matching algorithm.
文摘Rice callus suspension culture(RCSC)has been shown to have anticancer activity based on cytotoxic activity on human colon and lung cancer cell lines.In the present study,the effect of RCSC on the expression of proteins in lung(A549)and colon(HT29)cancer cell lines was examined by using proteomics analysis.The protein-protein interaction study of differentially expressed proteins was done by using the Search Tool for the Retrieval of Interacting Genes(STRING),and the results showed that the proteins interacting with each other belong to different pathways.
基金the National Natural Science Foundation of China (Nos. 60502032 and 60672068)
文摘By studying the algorithms of single pattern matching, five factors that have effect on time complexity of the algorithm are analyzed. The five factors are： sorting the characters of pattern string in an increasing order of using frequency, utilizing already-matched pattern suffix information, utilizing already-matched pattern prefix information, utilizing the position factor which is absorbed from quick search algorithm, and utilizing the continue-skip idea which is originally proposed by this paper. Combining all the five factors, a new single pattern matching algorithm is implemented. It＇s proven by the experiment that the efficiency of new algorithm is the best of all algorithms.
