This master’s thesis deals with the issue of scanning human fingerprints, which is currently very topical and represents the most widespread biometric technology. The theoretical part of the work acquaints the reader with basics of dactyloscopy and biometrics and concerns technologies used for fingerprinting, image preprocessing methods and commercially available contactless optical scanners. The practical part is a realisation of a contactless optical scanner based on a Raspberry Pi minicomputer, implementation of preprocessing algorithms in Python and testing of the device from the perspective of image quality.

The main subject of the diploma thesis is a market price modeling by real estates. As a tool for modeling, is used a multiple linear regression. As starting points, are used an econometrical theory and knowledge about real estate valuation. The main goal is to find optimal model for best capture in the time and place.

Languages such as C use pointers very heavily. Implementation of operations on dynamically linked structures is, however, quite difficult. This can cause the programmer to make more mistakes than usual. One method for dealing with this situation is to use the static analysis tools. This thesis elaborates on the extension to the Code Listener architecture which is an interface for building static analysis tools. Code Listener is able to construct a call-graph or a control flow graph for a given source code and send it to the analyzing tool. One ability of the architecture is that it can conduct the live variable analysis internally. It detects places in the control flow graph where some subset of variables may be killed. The problem was that every variable for which a pointer address was assigned could not been killed, before. This decision had been made because there was no assurance that the variable could never been used through the pointer. So the goal of this work was to design and incorporate a points-to analysis which is able to exclude some references from the set of considered pointers to improve the live variable analysis.

This Master's Thesis describes methods of software certification and development of airborne systems, focusing on software testing and verification during project's life cycle. Thesis includes also designed software verification plan for concrete application according to RTCA/DO-178B. Another part of thesis illustrates the exemplary realization of tests according to designed verification plan. At the close we describe the options of applying the designed verification plan and evaluation of its results.

The master's thesis deals with biometric systems, especially these based on human recognition by finger veins. It describes some development principles of the new biometric system. It proposes some new approaches to the comparison of finger vein patterns and their fast identification in sizable databases. Verification is based on templates comparison by similarity and distance measures with proposed alignment approaches. The proposed method of identification is based on the combination of clustering and genetic algorithm. The second option is using the indexing tree structure and searching by range query.

Numerous computer systems use dynamic control and data structures of unbounded size. These data structures have often the character of trees or they can be encoded as trees with some additional pointers. This is exploited by some currently intensively studied techniques of formal verification that represent an infinite number of states using a finite tree automaton. However, currently there is no tree automata library implementation that would provide an efficient and flexible support for such methods. Thus the aim of this Mas- ter's Thesis is to provide such a library. The present paper first describes the theoretical background of finite tree automata and regular tree languages. Then it surveys the cur- rent implementations of tree automata libraries and studies various verification techniques, outlining requirements for the library. Representation of a finite tree automaton and algo- rithms that perform standard language operations on this representation are proposed in the next part, which is followed by description of library implementation. Through a series of experiments it is shown that the library can compete with other available tree automata libraries, in certain areas being even significantly superior to them.

This paper concerns methods of verification of person's signature and handwriting. Some of commonly used techniques are resumed and described with related literature being referred. Next aim of this work is design and implementation of a simple handwriting verification application. Application is based on edge detection and comparison of a set of structural and statistical features. As a support classification tool a SVM classifier of the LIBSVM software is employed. The Application is written in C language using OpenCV graphics library. Testing and training set was extracted from samples found in the IAM Handwriting Database. Application was created and tested in the Windows XP operating system.

Finding concurrency bugs in complex software is difficult. As a contribution to coping with this problem the thesis proposes an architecture for a fully automated dynamic detection and healing of data races and atomicity violations in Java. Two distinct algorithms for detecting of data races are presented. One of them is a novel algorithm called AtomRace which detects data races as a special case of atomicity violations. The healing is based on suppressing a recurrence of the detected problem and can be performed by introducing an additional synchronization or by legally influencing the Java scheduler. Basically forces certain parts of the code  to be executed atomically. The proposed architecture uses bytecode instrumentation to be able to track and influence the execution. The architecture and algorithms were implemented and tested on multiple case studies.

V disertační práci je nejprve uvedena taxonomie chyb v souběžném zpracování dat a přehled technik pro jejich dynamickou detekci. Následně jsou navrženy nové metriky pro měření synchronizace a souběžného chování programů společně s metodologií jejich odvozování. Tyto techniky se zejména uplatní v testování využívajícím techniky prohledávání prostoru a v saturačním testování. Práce dále představuje novou heuristiku vkládání šumu, jejímž cílem je maximalizace proložení instrukcí pozorovaných během testování. Tato heuristika je porovnána s již existujícími heuristikami na několika testech. Výsledky ukazují, že nová heuristika překonává ty existující v určitých případech. Nakonec práce představuje inovativní aplikaci stochastických optimalizačních algoritmů v procesu testování vícevláknových aplikací. Principem metody je hledání vhodných kombinací parametrů testů a metod vkládání šumu. Tato metoda byla prototypově implementována a otestována na množině testovacích příkladů. Výsledky ukazují, že metoda má potenciál vyznamně vylepšit testování vícevláknových programů.

This diploma thesis is focused on Selected problems in planimetry. The aim of this diploma thesis is description not only planimetric problems and their verification in a dynamic mathematical program GeoGebra, but also presentation of the author after whom it is called. The thesis is illustrated with pictures, which can help the reader to understand the problem and verification. This thesis can be used as a supplement the curriculum in secondary schools, where using dynamic program GeoGebra and subsequent verification may reach a better understanding of the topic.