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

3rd International Conference on Computing and Applied Informatics 2018, ICCAI 2018

作者： Timanta Tarigan, Jos Fajar, Rahmat Sharif, Amer Faculty of Computer Science and Information Technology Universitas Sumatera Utara Indonesia

The availability of various string-matching algorithm raises the concern of finding the one with the best performance. With the growth of digital content, especially a text-based content, using an optimal algorithm is crucial to decrease the cost of performing a task. There are numerous studies using a specific content to evaluate the performance of ones algorithm. In this paper, we chose two commonly used string-matching algorithm;Reverse Colussi and Raita and compare the performance of these algorithm in finding text in Indonesian language. We specifically use Indonesian songs lyrics as our samples. To perform the test, we build and text-based song finder Android application. Our test result shows that Raita outperformed Reverse Colussi in most of the cases. This finding is due to the requirement of Reverse Colusi algoritm to have pre-processing step before performing the search. © 2019 Published under licence by IOP Publishing Ltd.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimization and Implementation of Sunday Algorithm

Optimization and Implementation of Sunday Algorithm

引用

2019 International Conference on Artificial Intelligence and Advanced Manufacturing, AIAM 2019

作者： Song, Junzhi Miao, Chengshuang Southwest Jiaotong University Hope Collage Chengdu China

ISBN: (纸本)9781728146911

string matching algorithm plays an important role in many applications such as data retrieval, network content audit, multi-protocol recognition and so on. An improved algorithm is proposed for string matching based on the discussions of several common string matching algorithms. The algorithm adds suffix comparison before the start of comparing to reduce the times of attempts and increases the average moving step. In this case, it improves the matching efficiency. In the end, the analysis of this algorithm's performance and the comparisons of the testing results of several matching algorithms are given. The experimental results show that Insunday algorithm is the most efficient of several algorithms tested. In the same case, the number of matching times of Insunday algorithm is reduced by 62.67% compared with Sunday algorithm, and it can significantly improve the efficiency of string matching. © 2019 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

PURR: A primitive for reconfigurable fast reroute: Hope for the best and program for the worst 19

PURR: A primitive for reconfigurable fast reroute: Hope for ...

引用

15th ACM International Conference on Emerging Networking Experiments and Technologies, CoNEXT 2019

作者： Chiesa, Marco Sedar, Roshan Antichi, Gianni Borokhovich, Michael Kamisiński, Andrzej Nikolaidis, Georgios Schmid, Stefan KTH Royal Institute of Technology Sweden Universitat Politècnica de Catalunya Spain Queen Mary University of London United Kingdom Independent Researcher AGH University of Science and Technology in Kraków Poland Barefoot Networks United States Faculty of Computer Science University of Vienna Austria

ISBN: (纸本)9781450369985

Highly dependable communication networks usually rely on some kind of Fast Re-Route (FRR) mechanism which allows to quickly re-route traffic upon failures, entirely in the data plane. This paper studies the design of FRR mechanisms for emerging reconfigurable switches. Our main contribution is an FRR primitive for programmable data planes, PURR, which provides low failover latency and high switch throughput, by avoiding packet recirculation. PURR tolerates multiple concurrent failures and comes with minimal memory requirements, ensuring compact forwarding tables, by unveiling an intriguing connection to classic "string theory" (i.e., stringology), and in particular, the shortest common supersequence problem. PURR is well-suited for high-speed match-action forwarding architectures (e.g., PISA) and supports the implementation of arbitrary network-wide FRR mechanisms. Our simulations and prototype implementation (on an FPGA and Tofino) show that PURR improves TCAM memory occupancy by a factor of 1.5x - 10.8x compared to a naïve encoding when implementing state-of-the-art FRR mechanisms. PURR also improves the latency and throughput of datacenter traffic up to a factor of 2.8x - 5.5x and 1.2x - 2x, respectively, compared to approaches based on recirculating packets. © 2019 ACM.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Implementation of algorithm rabin-karp for thematic determination of thesis 4

Implementation of algorithm rabin-karp for thematic determin...

引用

4th International Conference on Information Technology, Information Systems and Electrical Engineering, ICITISEE 2019

作者： Yaqin, Ainul Dahlan, Akhmad Hermawan, Reno Diandika Universitas Amikom Yogyakarta Jl Ringroad Utara Condongcatur Informatics Faculty of Computer Science Depok Sleman Yogyakarta55283 Indonesia

ISBN: (纸本)9781728151182

Thesis / scientific work is a science composition that presents facts and is written according to a good and correct writing methodology. But to find out what the theme discussed should read the abstract of the essay. Along with the development of information technology that offers convenience for human labor in simplification of his work. Difficulty in determining the theme in the thesis can be aided with applications that are able to set themes based on abstract. To make the application of thesis thematic determination can use string matching algorithm, one of string matching algorithm is Rabin-Karp algorithm by doing string matching based on the hash value on text and hash value in a pattern. The Rabin-Karp algorithm is often used to detect plagiarism text document, comparing the overall hash value of k-gram contained in all text documents, then deciding the degree of similarity. Then it can be concluded that Rabin-Karp is able to string a text as a whole, from this the researcher is interested in proving what if the Rabin-Karp algorithm is implemented in the classification field wherein in this study it is used to string matching each word or keyword refers to the theme of an Indonesian essay or thesis abstract. The application is built using web programming language PHP and MySQL database. The confusion matrix is used to determine accuracy, obtained 88% and 12% for misclassification rates. © 2019 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Faster STR-EC-LCS computation

arXiv

引用

arXiv 2020年

作者： Yamada, Kohei Nakashima, Yuto Inenaga, Shunsuke Bannai, Hideo Takeda, Masayuki Department of Informatics Kyushu University Fukuoka Japan PRESTO Japan Science and Technology Agency Kawaguchi Japan

The longest common subsequence (LCS) problem is a central problem in stringology that finds the longest common subsequence of given two strings A and B. More recently, a set of four constrained LCS problems (called generalized constrained LCS problem) were proposed by Chen and Chao [J. Comb. Optim, 2011]. In this paper, we consider the substring-excluding constrained LCS (STR-EC-LCS) problem. A string Z is said to be an STR-EC-LCS of two given strings A and B excluding P if, Z is one of the longest common subsequences of A and B that does not contain P as a substring. Wang et al. proposed a dynamic programming solution which computes an STR-EC-LCS in O(mnr) time and space where m = |A|, n = |B|, r = |P | [Inf. Process. Lett., 2013]. In this paper, we show a new solution for the STR-EC-LCS problem. Our algorithm computes an STR-EC-LCS in O(n|Σ| + (L + 1)(m − L + 1)r) time where |Σ| ≤ min{m, n} denotes the set of distinct characters occurring in both A and B, and L is the length of the STR-EC-LCS. This algorithm is faster than the O(mnr)-time algorithm for short/long STR-EC-LCS (namely, L ∈ O(1) or m − L ∈ O(1)), and is at least as efficient as the O(mnr)-time algorithm for all cases. Copyright © 2020, The Authors. All rights reserved.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

The Analysis of KMP Algorithm and its Optimization 2

The Analysis of KMP Algorithm and its Optimization

引用

2nd International Conference on Computer Information Science and Application Technology, CISAT 2019

作者： Lu, Xiangyu Department of Computer Science Harbin Institute of Technology at Weihai Weihai Shandong264200 China

Knuth-Morris-Pratt (KMP) algorithm is an essential manifestation of matching algorithms. This paper presents and discusses the KMP algorithm and some of its optimization. Calculating and searching in a letter numbered table and a new data structure called last-identical array propose a new string searching algorithm L-I-KMP based on the KMP algorithm. This new method is faster than KMP in practice of specific situations. © Published under licence by IOP Publishing Ltd.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Greedy-reduction from Shortest Linear Superstring to Shortest Circular Superstring

arXiv

引用

arXiv 2020年

作者： Cazaux, Bastien Rivals, Eric LIRMM University of Montpellier CNRS Montpellier France

A superstring of a set of strings correspond to a string which contains all the other strings as substrings. The problem of finding the Shortest Linear Superstring is a well-know and well-studied problem in stringology. We present here a variant of this problem, the Shortest Circular Superstring problem where the sought superstring is a circular string. We show a strong link between these two problems and prove that the Shortest Circular Superstring problem is NP-complete. Moreover, we propose a new conjecture on the approximation ratio of the Shortest Circular Superstring *** Codes 68W32 Copyright © 2020, The Authors. All rights reserved.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A note on some interesting test results for the Rabin-Karp string matching algorithm 18

A note on some interesting test results for the Rabin-Karp s...

引用

18th Conference Information Technologies - Applications and Theory, ITAT 2018

作者： Jajcayová, Tatiana Majeríková, Zuzana Department of Applied Informatics Comenius University Bratislava Slovakia

ISBN: (纸本)9781727267198

While analyzing and testing some of the well known string matching algorithms, we came across rather interesting phenomenon in tests results for the Rabin-Karp algorithm. Testing which moduli work best in the algorithm, we realized that on some texts some moduli perform much worse then others. This caught our attention, and we continued testing. In this paper, we summarize tests using different moduli on the same text, tests run on different English texts (fiction, scientific, law, newspaper), and tests run on different languages and alphabets (English, Slovak, French, German and Russian). We include analysis of the obtained results and state some hypotheses. © 2018 Tatiana Jajcayová and Zuzana Majeríková.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Detecting missed and anomalous action segments using approximate string matching algorithm 6th

Detecting missed and anomalous action segments using approxi...

引用

6th National Conference on Computer Vision, Pattern Recognition, Image Processing and Graphics, NCVPRIPG 2017

作者： Jain, Hiteshi Harit, Gaurav Indian Institute of Technology Jodhpur Jodhpur India

ISBN: (纸本)9789811300196

We forget action steps and perform some unwanted action movements as amateur performers during our daily exercise routine, dance performances, etc. To improve our proficiency, it is important that we get a feedback on our performances in terms of where we went wrong. In this paper, we propose a framework for analyzing and issuing reports of action segments that were missed or anomalously performed. This involves comparing the performed sequence with the standard action sequence and notifying when misalignments occur. We propose an exemplar based Approximate string Matching (ASM) technique for detecting such anomalous and missing segments in action sequences. We compare the results with those obtained from the conventional Dynamic Time Warping (DTW) algorithm for sequence alignment. It is seen that the alignment of the action sequences under conventional DTW fails in the presence of missed action segments and anomalous segments due to its boundary condition constraints. The performance of the two techniques has been tested on a complex aperiodic human action dataset with Warm up exercise sequences that we developed from correct and incorrect executions by multiple people. The proposed ASM technique shows promising alignment and missed/anomalous notification results over this dataset. © Springer Nature Singapore Pte Ltd. 2018.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Three strategies for the dead-zone string matching algorithm 22

Three strategies for the dead-zone string matching algorithm

引用

22nd Prague stringology Conference, PSC 2018

作者： Daykin, Jacqueline W. Groult, Richard Guesnet, Yannick Lecroq, Thierry Lefebvre, Arnaud Léonard, Martine Mouchard, Laurent Prieur-Gaston, Élise Watson, Bruce Department of Computer Science Aberystwyth Univ. Department of Informatics Kings College London London United Kingdom Normandie Univ. UNIROUEN LITIS Rouen76000 France Univ. de Picardie Jules Verne Amiens France Department of Information Science Stellenbosch Univ. South Africa CAIR CSIR Meraka Pretoria South Africa

ISBN: (纸本)9788001064849

Online exact string matching consists in locating all the occurrences of a pattern in a text where only the pattern can be preprocessed. Classical online exact string matching algorithms scan the text from start to end through a window whose size is equal to the pattern length. Exact string matching algorithms from the deadzone family first locate the window in the middle of the text, compare the content of the window and the pattern and then recursively apply the same procedure on the left part and on the right part of the text while possibly excluding some parts of the text. We propose three different strategies for performing the symbol comparisons and, we compute the shifts for determining the left and right parts of the text at each recursive call. © Proceedings of the Prague stringology Conference, PSC 2018. All rights reserved.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：