|
|
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.
|
|
|
Periodic Patterns Mining
Stríž, Rostislav ; Zendulka, Jaroslav (referee) ; Šebek, Michal (advisor)
Data collecting and analysis are commonly used techniques in many sectors of today's business and science. Process called Knowledge Discovery in Databases presents itself as a great tool to find new and interesting information that can be used in a future developement. This thesis deals with basic principles of data mining and temporal data mining as well as with specifics of concrete implementation of chosen algorithms for mining periodic patterns in time series. These algorithms have been developed in a form of managed plug-ins for Microsoft Analysis Services -- service that provides data mining features for Microsoft SQL Server. Finally, we discuss obtained results of performed experiments focused on time complexity of implemented algorithms.
|
|
|
Map machine recognition and optimal path planning
Peška, Jaroslav ; Ligocki, Adam (referee) ; Chromý, Adam (advisor)
This masters thesis continues in the work of two previous theses dealing with machine understanding of maps and modelling terrain. The final program also has to be able to interpret position data from dataloggers and integrate it with the loaded map. The goal for the program is to serve during training of Czech orienteering runners. Position measurement and storage is researched first. Also researched are map markers used to define the terrain. Afterwards, past approaches are evaluated, including identification of most severe issues hindering the usage in real world applications. Many improvements are proposed, for example methods to remove noise in the input data, or to improve processing speed. Lastly, a set of possible improvements to the original applications are made, i.e. methods for denoising the input data or for speedup of the image processing. Proposed improvements are then implemented, the most impactful being processing speed and contour segmentation improvements.
|
|
|
Terrain passability analysis using machine understanding of maps
Pařík, David ; Jelínek, Aleš (referee) ; Chromý, Adam (advisor)
The diploma thesis deals with creation of computer aplication that can be used for conversion of raster maps for orienteering into model. Aplication will use this model to calculate optimal track between two selected locations. The thesis describes the development of a module for speed analysis in different types of terrain and another module for detection of roads and impassable objects. Thesis builds on work of Ing. Pavol Kršák and describes new features that were implemented to simplify user's control.
|
|
|
Terrain passability analysis using machine understanding of maps
Pařík, David ; Jelínek, Aleš (referee) ; Chromý, Adam (advisor)
The diploma thesis deals with creation of computer aplication that can be used for conversion of raster maps for orienteering into model. Aplication will use this model to calculate optimal track between two selected locations. The thesis describes the development of a module for speed analysis in different types of terrain and another module for detection of roads and impassable objects. Thesis builds on work of Ing. Pavol Kršák and describes new features that were implemented to simplify user's control.
|
|
|
iPhone Application for Number Plate Recognition
Sládeček, Roman ; Dvořák, Radim (referee) ; Procházka, Boris (advisor)
This thesis talks about theoretical and practical side of development of application for Apple iPhone mobile cell phone and for its operating system called iOS. In theoretical part are contained informations about history of this device, about tools for creating application for this mobile platform and there is shortly sketched procedure and process how the application is deployed into the phone. Next part deals with the licence number plates, their signification and integrity restrictions. Main core of whole thesis is a practical part about creation and implementation mobile application for recognition of that number plates with supporting of built-in camera and its consecutive text representation or manipulation with that data. In the final part there is a review of results which this application brings after testing and experimenting in different conditions.
|
|
|
Construction of the Generalized Finite Automaton
Šoka, Martin ; Košař, Vlastimil (referee) ; Kaštil, Jan (advisor)
The thesis deals with the creation of an algorithm for the construction of the generalized finite automaton. This automaton differs from the conventional finite automaton by the fact that its transitions are defined by words, therefore it is possible to reduce the number of states of the generalized finite automaton. The introduction includes definitions of terms used later in the thesis. In the next chapters I describe the algorithm itself, including the comprehensive analysis of the heuristics for finding a maximal acyclic subgraph in the graph of the automaton. It also describes implementation of the algorithm and experimentation with automatons created by the algorithm.
|
|
|
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.
|
|
|
Analysis of Business Process Diagrams
Ludvík, Martin ; Květoňová, Šárka (referee) ; Weiss, Petr (advisor)
The aim of Analysis of Business Process Diagrams is to create procedure that is able to find typical patterns in business process diagrams. Besides, it is necessary to design and implement application, which will be able to find and mark selected workflow patterns. This analysis is based on XML document, in which a business process diagram is stored. Important thing is to keep the ability to extend the number of patterns, which can be find out in a diagram. Also, it is important to solve some special situations, i.e. overlapping of patterns.
|
|
|
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.
|
guest ::
