National Repository of Grey Literature 36 records found  beginprevious27 - 36  jump to record: Search took 0.00 seconds. 
Comparison of Implementation Strategies of the DFA
Balgar, Marek ; Šimek, Václav (referee) ; Kaštil, Jan (advisor)
This bachelor thesis focuses upon the choices of methods, which are used to store automata on FPGA. There have been chosen these methods: bit-split, compress method and hash table. Then there are being compared the sizes of used memory, which are taken by automata in representation of these methods. The importaint part of this work is testing many kinds of samples. After the results have been achieved, I was able to examine the advantages and disadvantages of each method. Finally the analysis reveals which of the chosen methods is the best to store the automata on FPGA.
Construction of Nondeterministic Finite Automata
Stanek, Timotej ; Šimek, Václav (referee) ; Kaštil, Jan (advisor)
This thesis discuss about dilemma in construction of nondeterministic finite automata from PCRE expressions with respect of their parameters with use in Intrusion Detection Systems. There is showed PCRE expressions syntax too. We discussed two different approaches to construct nondeterministic finite automata from PCRE expressions. The implementation of these two algorithms is described. We constructed finite automata with them from expressions of three Intrusion Detection Systems: SNORT, Bro IDS and L7-Filter, and finally we compared their parameters and deduced conclusions.
Applications for Teaching Work with Regular Expressions
Heroutová, Tereza ; Čermák, Martin (referee) ; Koutný, Jiří (advisor)
The document describes the formation of an application, which allows interactiv instruction how to work with regular expressions. We stress clear interpretation of material and effective user interface to make handling intuitive as much as possible. The document describes theory of regular expressions, pedagogic side of the things and implementation with feature extensions.
Implementation of the Pattern Matching Unit in the FPGA
Košař, Vlastimil ; Kořenek, Jan (referee) ; Kaštil, Jan (advisor)
This term project focuses on algorithms for pattern matching used in modern IDS. The main focus is on regular expression matching. It deals with methods based on deterministic and nondeterministic finite automata, hybrid methods and with method based on regular expressions as programing langue for specialised processors. Implementation of pattern matching units based on some of described methodologies is described in next part. Methodology for resource consumption estimation is also described. Developed software system for unit generation is described in the next part. In the final part results are presented and discused.
Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata
Podhorský, Michal ; Techet, Jiří (referee) ; Masopust, Tomáš (advisor)
This work describes models of modern language theory - finite automata, regular grammars and regular expressions. A web application converting among these models is implemented.
Detection of Dynamic Network Applications
Burián, Pavel ; Drahošová, Michaela (referee) ; Kaštil, Jan (advisor)
This thesis deals with detection of dynamic network applications. It describes some of the existing protocols and methods of their identification from IP flow and packet contents. It constitues a design of a detection system based on the automatic creation of regular expressions and describes its implementation. It presents the created regular expressions for BitTorrent and eDonkey protocol. It compares their quality with the solution of L7-filter.
Scientific Web Portal Generator
Pavelka, Petr ; Schwarz, Petr (referee) ; Smrž, Pavel (advisor)
Scientific web portal generator is a large project. It's purpose is to create a system for building web portals for providing the view of science publications of authors. One of the parts of this project is module for searching of homepages. The goal of this bachelor's thesis is the implementation of of this module using the program or script. Content of this thesis is to find the best way of method of extraction the semantic information from the marked text, design and development o the system and creating the test set for the purpose of testing. The output of this thesis should be prototype of program or script, which will generate XML file with the URL adresses of homepages of authors. System should have XML input. Almost entire thesis is about analyzing of this problem and choosing the best solution.
Library for Fast Network Traffic Processing
Vokráčko, Lukáš ; Viktorin, Jan (referee) ; Kořenek, Jan (advisor)
This thesis is focused on time-critical operations in context of computer networks. Processed operations are packet classification, specially one-dimensional classification, longest prefix matching using binary search on prefix length and TreeBitmap, pattern matching using Aho-Corasick, regular expression matching and packet header analysis and extraction. Purpose of this work is to design API for library implementing these operations. Implementation speed of these operations is measured on Intel and ARM platforms.
Regular expressions in programming languages
Benešová, Patricie ; Pavlíčková, Jarmila (advisor) ; Fortinová, Jana (referee)
The target of this thesis is to describe the usage of regular expressions in flavors of PCRE library and programming languages such as Java, Perl and Javascript and in Unix systems in languages AWK and GAWK and the grep program. The first part of this thesis deals with a general description of metacharactes, lookaround or Unicode properties used in regular expressions. The second part of this thesis is divided according to listed flavors. For every programming language or library there are specified supported options. Furthermore, there are examples of usage of regular expressions in the code of a given language. A separate chapter provides information about the Java flavor and an educational application in Java. The application can be used for trying out options described in this thesis and therefore it is set up especially for students. In the end, there is a comparison of all of the listed flavors and chosen syntax.
Possibility of using regular expressions in data quality management
Elznic, Matěj ; Pejčoch, David (advisor) ; Kyjonka, Vladimír (referee)
In this bachelor thesis is analyzed problem of data quality and then there are adduced the options, through which it is possible to keep the data quality. The thesis is focused on the usage of regular expressions and their application in the online ambience. The thesis consists of three parts. The first part contents theoretical definition of data quality and regular expressions. The second part presents the theoretical concept of specific roles, which are focused on e-shops and presentation of some selected programming languages, which will be used in practical part. In the last part is presented an analysis of user behavior, which is in connection with web registration forms and the practical demonstration of realization this form.

National Repository of Grey Literature : 36 records found   beginprevious27 - 36  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.