scholarly journals Performance Testing of GPU-Based Approximate Matching Algorithm on Network Traffic

2015 ◽  
Author(s):  
Mujeeb B. Jimoh
Keyword(s):  
Network Traffic ◽  
Performance Testing ◽  
Matching Algorithm ◽  
Approximate Matching

scholarly journals An Improved Bytewise Approximate Matching Algorithm Suitable for Files of Dissimilar Sizes

Mathematics ◽  
2020 ◽  
Vol 8 (4) ◽  
pp. 503
Author(s):  
Víctor Gayoso Martínez ◽  
Fernando Hernández-Álvarez ◽  
Luis Hernández Encinas
Keyword(s):  
Digital Forensics ◽  
Ad Hoc ◽  
Full Description ◽  
Matching Algorithm ◽  
Approximate Matching ◽  
Digital Devices ◽  
Signature Generation ◽  
Actual Content ◽  
Similarity Preserving ◽  
Generation Procedure

The goal of digital forensics is to recover and investigate pieces of data found on digital devices, analysing in the process their relationship with other fragments of data from the same device or from different ones. Approximate matching functions, also called similarity preserving or fuzzy hashing functions, try to achieve that goal by comparing files and determining their resemblance. In this regard, ssdeep, sdhash, and LZJD are nowadays some of the best-known functions dealing with this problem. However, even though those applications are useful and trustworthy, they also have important limitations (mainly, the inability to compare files of very different sizes in the case of ssdeep and LZJD, the excessive size of sdhash and LZJD signatures, and the occasional scarce relationship between the comparison score obtained and the actual content of the files when using the three applications). In this article, we propose a new signature generation procedure and an algorithm for comparing two files through their digital signatures. Although our design is based on ssdeep, it improves some of its limitations and satisfies the requirements that approximate matching applications should fulfil. Through a set of ad-hoc and standard tests based on the FRASH framework, it is possible to state that the proposed algorithm presents remarkable overall detection strengths and is suitable for comparing files of very different sizes. A full description of the multi-thread implementation of the algorithm is included, along with all the tests employed for comparing this proposal with ssdeep, sdhash, and LZJD.

An error-tolerant approximate matching algorithm for labeled combinatorial maps

2015 ◽  
Vol 156 ◽  
pp. 211-220 ◽  
Author(s):  
Tao Wang ◽  
Hua Yang ◽  
Congyan Lang ◽  
Songhe Feng
Keyword(s):  
Matching Algorithm ◽  
Approximate Matching ◽  
Combinatorial Maps

scholarly journals Parallel Scalable Approximate Matching Algorithm for Network Intrusion Detection Systems

2020 ◽  
Vol 18 (1) ◽  
Keyword(s):  
Intrusion Detection ◽  
Intrusion Detection Systems ◽  
Network Intrusion Detection ◽  
Matching Algorithm ◽  
Approximate Matching ◽  
Detection Systems ◽  
Network Intrusion ◽  
Network Intrusion Detection Systems ◽  
Computer Processor ◽  
Sequential Matching

Matching algorithms are working to find the exact or the approximate matching between text “T” and pattern “P”, due to the development of a computer processor, which currently contains a set of multi-cores, multitasks can be performed simultaneously. This technology makes these algorithms work in parallel to improve their speed matching performance. Several exact string matching and approximate matching algorithms have been developed to work in parallel to find the correspondence between text “T” and pattern “P”. This paper proposed two models: First, parallelized the Direct Matching Algorithm (PDMA) in multi-cores architecture using OpenMP technology. Second, the PDMA implemented in Network Intrusion Detection Systems (NIDS) to enhance the speed of the NIDS detection engine. The PDMA can be achieved more than 19.7% in parallel processing time compared with sequential matching processing. In addition, the performance of the NIDS detection engine improved for more than 8% compared to the current SNORT-NIDS detection engine

Reconstruction of the Mekhilta Deuteronomy Using Philological and Computational Tools

2018 ◽  
Vol 9 (1) ◽  
pp. 2-25
Author(s):  
Michal Bar-Asher Siegal ◽  
Avi Shmidman
Keyword(s):  
13Th Century ◽  
Computational Tools ◽  
Matching Algorithm ◽  
Approximate Matching ◽  
Independent Form ◽  
The Future ◽  
Final Text

The tannaitic legal Midrashim did not all survive and are not all known to us in a complete independent form. David Zvi Hoffman was one of the first scholars to recognize the 13th century Yemenite Midrash, Midrash haGadol, written by R. David of Aden, as a major source of the lost legal Midarshim. He published the Midrash Tannaim, containing all of the tannaitic looking paragraphs from Midrash haGadol on the book of Deuteronomy. However, the author of Midrash haGadol often introduced changes into the material he borrowed from rabbinic and medieval sources. The resulting passages often seem to be unparalleled tannaitic sources, when in fact they are not. This article proposes a re-examination of the Mekhilta material as found in the Midrash haGadol, in order to reconstruct more accurately the tannaitic text. We propose a methodology for contending with this challenge, via a new approximate-matching algorithm designed to identify modified sources of this sort. Using this algorithm, we first compared Hoffman’s Midrash Tannaim on Deuteronomy to the Sifre, filtering out all parts of the text that are simply reworkings of the Sifre, despite many interpolations, omissions, and modified words. Having removed the Sifre passages from within the Midrash Tannaim text, we then proceeded to the next stage, in which we investigated the presence of reworked Maimonidean excerpts within the remaining text. The Maimonidean excerpts pose a particular challenge, because their reuse in the Midrash haGadol involves not only modifications and interpolations, but also changes of order. We describe the modifications that were necessary to the algorithm in order to handle these out-of-order cases of reuse as well. We have thus far succeeded in identifying and removing the reworked material appropriated from the Sifre and from Maimonides, and in the future we plan to tweak the algorithm such that it can successfully identify additional rabbinic passages as well, including the Babylonian and Palestinian Talmudic material, and other midrashic compilations. This will ultimately allow us to produce a final text approximating the original Mekhilta, to the greatest extent possible.

Development of the two-side matching algorithm for improving the quality of student’s allocation to thesis advisors

2020 ◽  
Author(s):  
Dmitriy Lagerev ◽  
Ekaterina Antyukhova
Keyword(s):  
Educational Institution ◽  
Performance Testing ◽  
Mathematics Model ◽  
Requirements Management ◽  
Matching Algorithm ◽  
Allocation System ◽  
Conceptual Problems ◽  
Model Components ◽  
Allocation Approach

The article considers the problem of students allocation to thesis advisors, provides the result of the experimental approbation of student’s allocation approach based on two-side matching algorithm that has been performed by using automated student’s allocation system, and result of requirements management, which had taken place after performance testing. The article analysing user’s requirements of changing allocation method replacing tutors with thesis projects embedded into tutor-project hierarchy, in terms of development feasibility and possibility. Mathematics model modifications for the approach to allocating students according to the two-side matching algorithm integrated with new model components is suggested below in the text of the article. The algorithmic and conceptual problems of such changes are pointed out along with solution for overcoming. In the general case, two-side matching model as well as presented modification might be used not only in case of educational and methodical activity aimed at creating mappings lists of students and thesis advisors of a department of a higher educational institution, but also regarding other production and service area, which faces with the problem of limited countable resource distribution to consumers with no outright antagonism.

EVALUATION OF NETWORK TRAFFIC ANALYSIS USING APPROXIMATE MATCHING ALGORITHMS

2021 ◽  
pp. 89-108
Author(s):  
Thomas Göbel ◽  
Frieder Uhlig ◽  
Harald Baier
Keyword(s):  
Network Traffic ◽  
Traffic Analysis ◽  
Approximate Matching ◽  
Network Traffic Analysis

Research on Wildcard Character of Appoximate Matching in Manufacturing Engineering

2013 ◽  
Vol 312 ◽  
pp. 502-505
Author(s):  
Xi Hong Wu
Keyword(s):  
Pattern Matching ◽  
Experimental Result ◽  
Forward Algorithm ◽  
Matching Algorithm ◽  
Approximate Matching ◽  
Engineering Problems ◽  
Flow Charts ◽  
Manufacturing Engineering

The paper first analysiss the types and methods of the wildcard characters, then discuss the matching in manufacturing engineering problems which it exists in the pattern matching. According to the problems, it puts forward algorithm to realize approximate matching. At last, it provides the flow charts and examples of the algorithm. From the example of experimental result, exact machining can be realized approximate matching through the wildcard characters. So various matching algorithm can be extended and used more.

Sign in / Sign up

Export Citation Format

Share Document