|
|
Reliability Measurement of the Pattern Matching
Dvořák, Milan ; Košař, Vlastimil (referee) ; Kaštil, Jan (advisor)
This thesis deals with the pattern matching methods based on finite automata and describes their optimizations. It presents a methodology for the measurement of reliability of pattern matching methods, by comparing their results to the results of the PCRE library. Experiments were conducted for a finite automaton with perfect hashing and faulty transition table. Finally, the resulting reliability evaluation of the algorithm is shown and possible solutions of the identified problems are proposed.
|
|
|
Graphical Simulation of Finite Automata
Šrajer, Roman ; Goldefus, Filip (referee) ; Čermák, Martin (advisor)
This Bachelor's Thesis is about the theory of converting regular expression to finate state machine and vice versa. The goal of practical part is to make web application that performs these coversions and do simulation for input string. For converting automata into regular expression it is used the algebraic method which is based on making an equation system to be solved. I have chosen Java as programming language and Java Applet and Java Web Start as technologies that make possible to access the application through the web page. The possibilities like working with three types of automata views, saving atomatons into XML and intuitively creating own automatons are the important part of the application.
|
|
|
Automatic Grouping of Regular Expressions
Stanek, Timotej ; Kořenek, Jan (referee) ; Kaštil, Jan (advisor)
This project is about security of computer networks using Intrusion Detection Systems. IDS contain rules for detection expressed with regular expressions, which are for detection represented by finite-state automata. The complexity of this detection with non-deterministic and deterministic finite-state automata is explained. This complexity can be reduced with help of regular expressions grouping. Grouping algorithm and approaches for speedup and improvement are introduced. One of the approches is Genetic algorithm, which can work real-time. Finally Random search algorithm for grouping of regular expressions is presented. Experiment results with these approches are shown and compared between each other.
|
|
|
Algorithm Database of Digital Audio Signal Processing with Automatic Classification and Searching using Web Interface
Kouba, Petr ; Sysel, Petr (referee) ; Schimmel, Jiří (advisor)
The aim of the bachelor was to design a database structure for classification source code and implementations of digital audio effects algorithms. Classification criteria for these algorithms are described in the thesis. A new project can be added to the database using web form or via of the automatic classification. The automatic classification is called a function for automatic recognition information in source files. For this purpose a format of saving catalog information into the source file was designed. These saved data can be further recognized by the suitable algorithm which utilizes PHP standard functions and then they inserted into the database. The saved projects can be searched by the project name, author’s name, the project description, or the criteria described in the introduction of this thesis.
|
guest ::
