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

3rd International Conference on Communication, Computing and Digital Systems, C-CODE 2023

作者： Jannat, Adnan Hayat, Umar Sadiq, Touseef Lab Islamabad Pakistan University of Agder Jon Lilletuns Center for Ai Research Grimstad Norway

ISBN: (纸本)9798350332391

For anomaly-based intrusion detection systems, software implementation of several string-matching algorithms using deep/machine learning approaches are frequently available. The research paper aims to explore the use of machine learning algorithms in developing intelligent intrusion detection systems for preventing unauthorized access to computer networks. A complete intrusion detection system consists of packet decoding, capturing, pre-processing, and pattern or string matching. However, string matching is computationally the most intensive part. Consequently, several architectures/designs have been proposed to accelerate the performance of string matching. This paper provides an architectural evaluation of the existing deep/machine learning-based solutions of string-matching algorithms. First, the most recent state-of-the-art solutions are carefully identified. Then, the identified solutions are compared in terms of the used dataset, number of classes, and accuracy. The architectural evaluation of multiple classification algorithms in this paper allows users of the domain to select an appropriate deep/machine learning algorithm for string matching according to their needs. © 2023 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance and Implementation Comparison of Knuth-Morris-Pratt and Boyer-Moore string Search algorithms 2

Performance and Implementation Comparison of Knuth-Morris-Pr...

引用

2nd International Conference on Advanced Innovations in Smart Cities, ICAISC 2025

作者： Saleh, Taj Ergin, Fatma Corut Malkawi, Malek Alhajj, Reda Department of Computer Engineering Marmara University Istanbul Turkey Department of Computer Engineering Istanbul Medipol University Istanbul Turkey Department of Computer Science University of Calgary Alberta Canada Department of Heath Informatics University of Southern Denmark Odense Denmark

ISBN: (纸本)9798331506995

string search algorithms play an important role in many research areas such as data mining and bioinformatics. While there exist a number of algorithms that handles the topic, we are exploring the the Knuth-Morris-Pratt (KMP) and Boyer-Moore algorithms due to their efficiency and versatility. In this work, we compared the algorithms in terms of characteristics, performance and implementation details. We also tested both the algorithms with various patterns and texts that differs in size. We also analyzed the performance of the algorithms on 4 different processors to understand the technological advancements effects on their performance. Our findings suggest that the BM algorithm perform better with large texts and patterns, while the KMP algorithm is better suited for smaller ones. Also, while newer processor generally exhibit improved performance, the significance of these enhancements may vary. Thus, we should rather be looking specific architectural advancements within generations rather than focusing solely on the generational gap. © 2025 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm

arXiv

引用

arXiv 2024年

作者： Lecroq, Thierry Univ Rouen Normandie INSA Rouen Normandie Université Le Havre Normandie Normandie Univ LITIS UR 4108 CNRS NormaSTIC FR 3638 IRIB RouenF-76000 France CURIB UFR des Sciences et des Techniques Université de Rouen Normandie Mont-Saint-Aignan Cedex 76821 France

string matching is the problem of finding all the occurrences of a pattern in a text. It has been intensively studied and the Boyer-Moore string matching algorithm is probably one of the most famous solution to this problem. This algorithm uses two precomputed shift tables called the good-suffix table and the bad-character table. The good-suffix table is tricky to compute in linear time. Text book solutions perform redundant operations. Here we present a fast implementation for this good-suffix table based on a tight analysis of the pattern. Experimental results show two versions of this new implementation are the fastest in almost all tested situations. Copyright © 2024, The Authors. All rights reserved.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Absent Subsequences in Words

Absent Subsequences in Words

引用

作者： Kosche, Maria Koß, Tore Manea, Florin Siemer, Stefan Institute for Computer Science Georg-August University Göttingen Germany

An absent factor of a string w is a string u which does not occur as a contiguous substring (a.k.a. factor) inside w. We extend this well-studied notion and define absent subsequences: a string u is an absent subsequence of a string w if u does not occur as subsequence (a.k.a. scattered factor) inside w. Of particular interest to us are minimal absent subsequences, i.e., absent subsequences whose every subsequence is not absent, and shortest absent subsequences, i.e., absent subsequences of minimal length. We show a series of combinatorial and algorithmic results regarding these two notions. For instance: we give combinatorial characterisations of the sets of minimal and, respectively, shortest absent subsequences in a word, as well as compact representations of these sets;we show how we can test efficiently if a string is a shortest or minimal absent subsequence in a word, and we give efficient algorithms computing the lexicographically smallest absent subsequence of each kind;also, we show how a data structure for answering shortest absent subsequence-queries for the factors of a given string can be efficiently computed. © 2022 - IOS Press. All rights reserved.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

引用

3rd IEEE International Conference on Social Sciences and Intelligence Management, SSIM 2023

作者： Kaur, Sarabjot Bhatt, Priyanka C. Jindal Global Business School O.P. Jindal Global University Sonipat India Chaoyang University of Technology Department of Business Administration Taichung Taiwan

ISBN: (纸本)9798350327786

Information was retrieved from patent documents using a robust framework centered on the advanced DeBERTa model in this study. Emphasizing the crucial interplay between algorithmic selection and patent language intricacies, the developed method involved four epochs of model training. Significant enhancements were found through the Pearson correlation analysis. The proposed novel method improved model understanding. Cross-validation was conducted to ensure a balanced evaluation, and the contemplation of an ensemble approach was used for the model's refinement. string-matching algorithms validated the analysis of this research showing the model's efficacy in capturing relationships within patents. The research results allowed for algorithmic tailoring and applications in patent search. By fine-tuning, transferring learning exploration, and addressing biases, continual innovation in patent analysis and information retrieval is continued based on multi-modal integration. © 2023 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal-Hash Exact string Matching algorithms

arXiv

引用

arXiv 2023年

作者： Lecroq, Thierry Univ Rouen Normandie INSA Rouen Normandie Université Le Havre Normandie Normandie Univ LITIS UR 4108 CNRS NormaSTIC FR 3638 IRIB RouenF-76000 France

string matching is the problem of finding all the occurrences of a pattern in a text. We propose improved versions of the fast family of string matching algorithms based on hashing q-grams. The improvement consists of considering minimal values q such that each q-grams of the pattern has a unique hash value. The new algorithms are fastest than algorithm of the HASH family for short patterns on large size alphabets. © 2023, CC BY.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Parallel Hybrid string Matching Algorithm Using CUDA API Function

Parallel Hybrid String Matching Algorithm Using CUDA API Fun...

引用

2021 International Conference on Computing and Communications Applications and Technologies, I3CAT 2021

作者： Al-Dabbagh, Sinan Sameer Mahmood Abdal, Yasir M. Al-Mansour University College Computer Engineering Department Baghdad Iraq Northern Technical University Technical Engineering College Mosul Iraq

ISBN: (纸本)9781665424417

Due to the fast growth of information recently, traditional string matching algorithms face a significant speed challenge. A good string matching algorithm is an algorithm with a small number of character comparisons, a small number of attempts, and a short execution time. These three factors measure the efficiency and performance of string matching algorithms. string matching algorithms are essential in many different applications such as search analysis, intrusion detection, internet search engines, editor's information retrieval, computer security, and computational biology. These applications use string matching algorithms to search for a small string called a pattern in a large dataset. This search takes a long time and high resources to execute. This paper proposed a parallel design of a hybrid string matching called SSTBMQS on a GPU device using CUDA API. The result shows that the parallel version of SSTBMQS algorithm on GPU device using CUDA API function is unappropriated and un-recommended. © 2021 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach for Pattern string Matching in Intrusion Detection System

A Novel Approach for Pattern String Matching in Intrusion De...

引用

2021 International Conference on Computing, Communication, Electrical and Biomedical Systems, ICCCEBS 2021

作者： Azarudeen, K. Chakkaravarthy, G Vinoth Murugiah, Premkumar Kharthikeyan, S. Department of Computer Science and Engineering Velammal College of Engineering and Technology Madurai Tamil Nadu 625009 India Department of Computer Science and Engineering KPR Institute of Engineering and Technology Coimbatore Tamil Nadu 641407 India

string matching algorithms are critical for web usage devices which screen the packets and moves on the basis of load. Intrusion detection or prevention systems, web cleansing, anti-virus and junk preventive systems all have a necessity for effective algorithms when managing string matching scenarios. Some of the algorithms viz. Aho-Corasick, WuManber, Rabin-Karp, Commentz-Walter, Bit parallel etc. entails lot of space and time. AhoCorasick algorithm is built on the basis of finite state machines. On the shadow of KnuttMorris-Pratt, Commentz Walter developed an algorithm which in turn uses finite state machines. Bit parallel algorithms like shift-or takes the help of varied computer words ie. the registers in CPU, to compare the efforts. Rabin Karp implements hashing for discovering matching pattern strings in a given text. Wu-Manber looks text in chunks than of every character coalescing the work of Aho-Corasick and Boyer-Moore. Our algorithm reduces character comparisons and consumption of memory on the basis of graph evolution structure and search procedure by means of dynamic linked list. Theoretic study and trial results demonstrates that the projected work is much enhanced in terms of space and time consumption, when compared with previously known pattern-matching algorithms. © Published under licence by IOP Publishing Ltd.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Pre-annotation Based Approach for Development of a Sanskrit Named Entity Recognition Dataset 18

Pre-annotation Based Approach for Development of a Sanskrit ...

引用

18th World Sanskrit Conference

作者： Sarkar, Sujoy Krishna, Amrith Goyal, Pawan IIT Kharagpur India IT University of Copenhagen Denmark

ISBN: (纸本)9781950737710

Recent NLP algorithms for Named Entity Recognition require a large amount of annotated resources. Low resourced languages such as Sanskrit lack adequate annotated data and manual annotation is costly as well as time-consuming. A sequence labeling tool that supports manual annotation with automatic suggestions to reduce time and increase annotators' productivity is appealing, especially for low-resourced languages. Most of the tools developed with such capabilities are for resource-rich western European languages and are not tuned to the need of morphologically rich language like Sanskrit. In our work, we deploy an annotation tool for crowd-sourcing a Sanskrit NER dataset annotation. The selected corpus is Srimad-Bhagavatam. The annotation environment is augmented to help the annotators with automatic suggestions. The suggestions are pre-annotated using our proposed heuristic. The heuristic works based on string-matching algorithms. The key idea is to compare transliterated Sanskrit text with an English translation and identify words of similar forms as likely named entities (NE). A gazetteer is applied to further classify the NEs into semantic classes. On a small manually annotated dataset, the heuristic identified the NEs reasonably with an F-Score of 0.80. © 2022 Proceedings of the Computational Sanskrit and Digital Humanities at the 18th World Sanskrit Conference. All rights reserved.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Prevalent Exact string-Matching algorithms in Natural Language Processing: A Review

Prevalent Exact String-Matching Algorithms in Natural Langua...

引用

2020 International Conference on Future of Engineering Systems and Technologies, FEST 2020

作者： Pandey, R.K. Taruna, S. Department of Computer Science Jk Lakshmipat University Jaipur India

string matching and searching problems are one of the classical hitches to the domain of computer engineering. There exist numerous variants of such algorithms, which can be categorized into dual classes;i.e. an approximate match and exact match algorithms. This paper engrossed on comparing prevalent algorithms of exact matching category in terms of their functionality and complexity along with critical opinions for a better understanding of the differences among them. The application of string matching is used in various fields like for intrusion detection in the networks, DNA matching in the field of bioinformatics, plagiarism checking for fraud detection, in the field of information security, pattern recognition, text mining, web searching, recommendation system, the document comprising, authentication system and web scraping. The uses are not only restricted to the fields termed above but also the notion has copious advantages for ongoing and forthcoming research work. © Published under licence by IOP Publishing Ltd.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：