检索结果-内蒙古大学图书馆

2010 Cross Language Evaluation Forum Conference, CLEF 2010

作者： Nawab, Rao Muhammad Adeel Stevenson, Mark Clough, Paul University of Sheffield United Kingdom

This paper describes the University of Sheffield entry for the 2nd international plagiarism detection competition (PAN 2010). Our system attempts to identify extrinsic plagiarism. A three-stage approach is used: pre-processing, candidate document selection (using word n-grams) and detailed analysis (using the Running Karp-Rabin Greedy string Tiling string matching algorithm). This approach achieved an overall performance of 0.20 in the official evaluation with a precision of 0.40, recall of 0.16 and granularity of 1.21.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Rule based phonetic search approaches for central europe

Rule based phonetic search approaches for central europe

引用

8th IEEE International Symposium on Intelligent Systems and Informatics, SIISY 2010

作者： Zahoranský, Dušan Polášek, Ivan Slovak University of Technology Faculty of Informatics and Information Technologies Bratislava Slovakia Gratex International Slovakia

ISBN: (纸本)9781424473946

This paper deals with a topic of phonetic search in text form, which is a type of string matching algorithms. It describes a proposed solution for phonetic searching of the Slovak and neighborhood languages surnames. This solution was designed to improve a search precision and recall for persons with the surnames originated in these languages. ©2010 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A fast single pattern matching algorithm based on the bit-parallel

A fast single pattern matching algorithm based on the bit-pa...

引用

International Conference on Frontier of Computer Science and Technology

作者： Wang, Jun-Bo Kang, Fei Xu, Xin-Lei Chen, Jing-Ning Zhen Zhou Institute of Information Science and Technology Zhen Zhou China

ISBN: (纸本)9780769541396

The string matching algorithm is an important one of the key techniques. On the basis of the research on some kind of algorithms and the test to these algorithms, a faster single-mode matching algorithm-QBP algorithm is proposed in this paper. By adding the seat shifted table and using the fixed window in this algorithm, higher efficiency is achieved. It is illustrated by an experiment that when the character string is within a machine word-length, the performance of QBP algorithm is more excellent than other similar algorithms. © 2010 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Realizing a sub-linear time string-matching algorithm with a hardware accelerator using bloom filters

引用

IEEE Transactions on Very Large Scale Integration (VLSI) Systems 2009年第8期17卷 1008-1020页

作者： Lin, Po-Ching Lin, Yin-Dar Lai, Yuan-Cheng Zheng, Yi-Jun Lee, Tsern-Huei Department of Computer Science National Chiao Tung University Hsinchu 300 Taiwan Department of Information Management National Taiwan University of Science and Technology Taipei 106 Taiwan Department of Communication Engineering National Chiao Tung University Hsinchu 300 Taiwan

Many network security applications rely on string matching to detect intrusions, viruses, spam, and so on. Since software implementation may not keep pace with the high-speed demand, turning to hardware-based solutions becomes promising. This work presents an innovative architecture to realize string matching in sub-linear time based on algorithmic heuristics, which come from parallel queries to a set of space-efficient Bloom filters. The algorithm allows skipping characters not in a match in the text, and in turn simultaneously inspect multiple characters in effect. The techniques to reduce the impact of certain bad situations on performance are also proposed: the bad-block heuristic, a linear worst-case time method and a non-blocking interface to hand over the verification job to a verification module. This architecture is simulated with both behavior simulation in C and timing simulation in HDL for antivirus applications. The simulation shows that the throughput of scanning Windows executable files for more than 10000 virus signatures can achieve 5.64 Gb/s, while the worst-case performance is 1.2 Gb/s if the signatures are properly specified. © 2006 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Nested Counters in Bit-Parallel string Matching

Nested Counters in Bit-Parallel String Matching

引用

3rd International Conference on Language and Automata Theory and Applications

作者： Fredriksson, Kimmo Grabowski, Szymon Univ Kuopio Dept Comp Sci POB 1627 FIN-70211 Kuopio Finland Tech Univ Lodz Comp Engn Dept PL-90924 Lodz Poland

ISBN: (纸本)9783642009815

Many algorithms. e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism. The recently presented technique of nested counters (Matryoshka counters) [1] is to handle small counters most of the time, and refer to larger counters periodically, when the small counters may g et full, to prevent overflow. In this work, we present several non-trivial applications of Matryoshka counters in string matching algorithms, improving their worst- or average-case time complexities. The set of problems comprises (delta, alpha)-matching, matching with k insertions, episode matching, and matching under Levenshtein distance.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A Compressed Enhanced Suffix Array Supporting Fast string Matching

A Compressed Enhanced Suffix Array Supporting Fast String Ma...

引用

16th International Symposium on string Processing and Information Retrieval

作者： Oblebusch, Enno Gog, Simon Univ Ulm Inst Theoret Comp Sci D-89069 Ulm Germany

ISBN: (纸本)9783642037832

Index structures like the suffix tree or the suffix array are of utmost importance in stringology, most notably in exact string matching. In the last decade, research on compressed index structures has flourished because the main problem in many applications is the space consumption of the index. It is possible to simulate the matching of a pattern against a suffix tree on an enhanced suffix array by using range minimum queries or the so-called child table. In this paper, we show that the Super-Cartesian tree of the LCP-array (with which the suffix array is enhanced) very naturally explains the child table. More important, however, is the fact that the balanced parentheses representation of this tree constitutes a very natural compressed form of the child table which admits to locate all occ occurrences of pattern P of length m in O(m log vertical bar Sigma vertical bar + occ) time, where Sigma is the underlying alphabet. Our compressed child table uses less space than previous solutions to the problem. An implementation is available.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Input-independent, scalable and fast string matching on the cray XMT

Input-independent, scalable and fast string matching on the ...

引用

23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009

作者： Villa, Oreste Daniel, Chavarría-Miranda Maschhoff, Kristyn High-Performance Computing Pacific Northwest National Laboratory United States Cray Inc Netherlands

ISBN: (纸本)9781424437504

string searching is at the core of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filters. The growing size of on-line content and the increasing wire speeds push the need for fast, and often real-time, string searching solutions. For these conditions, many software implementations (if not all) targeting conventional cache-based microprocessors do not perform well. They either exhibit overall low performance or exhibit highly variable performance depending on the types of inputs. For this reason, real-time state of the art solutions rely on the use of either custom hardware or Field- Programmable Gate Arrays (FPGAs) at the expense of overall system flexibility and programmability. This paper presents a software based implementation of the Aho-Corasick string searching algorithm on the Cray XMT multithreaded shared memory machine. Our solution relies on the particular features of the XMT architecture and on several algorithmic strategies: it is fast, scalable and its performance is virtually contentindependent. On a 128-processor Cray XMT, it reaches a scanning speed of 28 Gbps with a performance variability below 10%. In the 10 Gbps performance range, variability is below 2.5%. By comparison, an Intel dual-socket, 8-core system running at 2.66 GHz achieves a peak performance which varies from 500 Mbps to 10 Gbps depending on the type of input and dictionary size. © 2009 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A string matching algorithm based on efficient hash function

A string matching algorithm based on efficient hash function

引用

2009 International Conference on Information Engineering and Computer Science, ICIECS 2009

作者： Zhao, Fuyao Liu, Qingwei School of Information Science and Engineering Central South University Hunan China

ISBN: (纸本)9781424449941

Based on the Karp-Rabin algorithm, a fast string matching algorithm is presented in this paper. It is also a hashbased approach, comparing the hash value of strings called fingerprint rather than the letters directly. The characteristic of the algorithm is that the hash function exploits bitwise operations and also considers about the size of the alphabet and the length of the pattern. We prove that the probability of a hash collision is minute and that the average running time is linear. Through a series of experiments, the remarkable performance of our algorithm is demonstrated. ©2009 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-patterns parameterized shift-and string matching algorithm with super alphabets 09

Multi-patterns parameterized shift-and string matching algor...

引用

International Conference on Advances in Computing, Communication and Control, ICAC3'09

作者： Prasad, Rajesh Agarwal, Suneeta Motilal Nehru National Institute of Technology Allahabad 211004 India

ISBN: (纸本)9781605583518

In the parameterized string matching, a given pattern P is said to match with a sub-string t of the text T, if there exist a bijection from the symbols of P to the symbols of t. This problem has an important application in software maintenance where it is required to find equivalency between two sections of codes. Two sections of codes are said to be equivalent if one can be transformed into the other by renaming identifiers and variables only. In this paper, we extend single pattern exact shift-and string matching algorithm to find all parameterized occurrences of multiple patterns P0, P1, P2 Pr-1′, (r1), each of equal size m, in the text T. The set of r multiple patterns is being handled by using the concept of classes of characters. The new algorithm is named as multi-pattern parameterized shift-and (MPSA) string matching algorithm. We further extend MPSA by using the concept of super alphabets. Implementation results show that by using a super alphabet of size s, the algorithm (MPSA) is speeded-up by a factor of s, where s is the size of the super alphabet (i.e. s is the number of characters processed simultaneously). By using multi-pattern parameterized string matching, the search time is lesser than individual pattern searching in the text. We also show the performance of super alphabet MPSA with respect to duplicity present in the code. However these algorithms are applicable only when pattern length (m) is less than or equal to word length (w) of computer used (i.e. mw). Copyright 2009 ACM.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

RSMA Matching Algorithm for searching Biological Sequences

RSMA Matching Algorithm for Searching Biological Sequences

引用

International Conference on Innovations in Information Technology

作者： Klaib, Ahmad Fadel Osborne, Hugh Univ Huddersfield Dept Informat Huddersfield HD1 3DH W Yorkshire England

ISBN: (纸本)9781424456987

Huge amounts of biological data are stored in linear files. Biological proteins are sequences of amino acids. The quantities of data in these fields tend to increase year on year. string matching algorithms play a key role in many computer science problems, and in the implementation of computer software. For this reason efficient string-matching algorithms should be used which use minimal computer storage and which minimize the searching response time. In this study, we propose a new algorithm called the Random string Matching Algorithm (RSMA). RSMA combines our enhanced preprocessing phase from the Berry Ravindran algorithm with our proposed new searching phase procedure. This variety of searching order allows our proposed algorithm to reduce the number of comparison characters and enhances the searching response time. Experimental results show that the RSMA algorithm offers a smaller number of comparisons and offers improved elapsed searching time when compared to other well-known algorithms.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：