|
|
Automatic Testing of JavaScript Restrictor Project
Bednář, Martin ; Pluskal, Jan (referee) ; Polčák, Libor (advisor)
The aim of the thesis was to design, implement and evaluate the results of automatic tests for the JavaScript Restrictor project, which is being developed as a web browser extension. The tests are divided into three levels - unit, integration, and system. The Unit Tests verify the behavior of individual features, the Integration Tests verify the correct wrapping of browser API endpoints, and the System Tests check that the extension does not suppress the desired functionality of web pages. The System Tests are implemented for parallel execution in a distributed environment which has succeeded in achieving an almost directly proportional reduction in time with respect to the number of the tested nodes. The benefit of this work is detection of previously unknown errors in the JavaScript Restrictor extension and provision of the necessary information that allowed to fix some of the detected bugs.
|
|
| |
|
|
A Service for Verification of Czech Attorneys
Jílek, Radim ; Glembek, Ondřej (referee) ; Szőke, Igor (advisor)
This thesis deals with the design and implementation of the Internet service, which allows to objectively assess and verify the reliability and diligence of Czech lawyers based on publicly available data of several courts. The aim of the thesis is to create and put into operation this service. The result of the work are the programs that provide partial actions in the realization of this intention.
|
|
|
Comparison of signatures using metrics for the eye movements
Vyhlas, Petr ; Děchtěrenko, Filip (advisor) ; Gemrot, Jakub (referee)
Comparison of signatures is part of the identity verification. The study focuses on comparison of signatures using metrics for the eye movements. In first part of study we review algorithms for the signature verification and we introduce metrics for comparing eye movements. We used Levenshtein distance, Fréchet distance and correlation coefficient for the comparison of signatures. We discovered behavior of these metrics and choose their combination for the computation of percentage similarity between two signatures. We designed and implemented universal Windows application which digitizes signatures, compares two signatures and determines their similarity. We conducted an experiment in which participants tried to sign themselves or tried to sign someone else. We did not find improvement during the signing. Powered by TCPDF (www.tcpdf.org)
|
|
|
Mathematical Methods in Economics
Blaha, Ladislav ; Půža, Bedřich (referee) ; Novotná, Veronika (advisor)
This bachelor thesis is follow up to an analyses made of actual state of affairs in public administration and business ambience in Moldova, focusing on the missing professional terminology, which is necessary for the effective function of both sectors. The main purpose is to make an application, which would be used to determine the Levenshtein distance from two textual chains. This application is used primarily for comparing textual chains in different languages. In other words it finds the scale of their similarity the application will be used later to create a dictionary, which will focus on terminology from the area of public administration.
|
|
|
Application for Practicing Rapid Typing Techniques
Adamec, Jaroslav ; Polok, Lukáš (referee) ; Herout, Adam (advisor)
This thesis considers the technique of practicing touch typing method on keyboard. Final program is based on this method and is trying to teach users the touch typing method. Program is using technique of text rewriting without the cursor, which would mark user's position in text. Another programs tested in this thesis are using cursor. To reach more real situation program shows the real physical size of A4 paper format. Program contains Levenshtein distance algorithm to compare source and target string. Final program was distributed to users and their reaction were written down and analysed.
|
|
|
MediaDiff - Diff for Static Images
Brothánek, Jan ; Mlích, Jozef (referee) ; Chmelař, Petr (advisor)
This bachelor's thesis focuses on comparison of digital documents, especially static images. This paper presents algorithms, which are usable for general data comparison and also specific algorithms major in image data comparison. We introduce possibilities of document comparison which are now available for users. On the basis of this current situation, a prototype of new modular application MediaDiff for various documents comparison is designed and implemented. We describe in detail each stage of the application development, problems which had arisen and their solutions. The possibilities of future development of the application are discussed.
|
|
|
Comparison and Transformations of Pathway Databases
Němeček, Pavel ; Šilhavá, Jana (referee) ; Smrž, Pavel (advisor)
The main topic of this work are comparison and transformations of pathway databases. Large part is dedicated to databases KEGG and BioCarta. In work are described formats of provided data. In process of searching for overlapping pathways between databases are used clustering, edit distance, NCBI gene numbers and equivalent relationships comparison. The system was written in C++ and using XML parser. Results are text outputs, eventually files in DOT language, which can be executed with GraphViz to generate graphs.
|
|
|
Hardware Acceleration of Algorithms for Approximate String Matching
Nosek, Ondřej ; Kořenek, Jan (referee) ; Martínek, Tomáš (advisor)
Methods for aproximate string matching of various sequences used in bioinformatics are crucial part of development in this branch. Tasks are of very large time complexity and therefore we want create a hardware platform for acceleration of these computations. Goal of this work is to design a generalized architecture based on FPGA technology, which can work with various types of sequences. Designed acceleration card will use especially dynamic algorithms like Needleman-Wunsch and Smith-Waterman.
|
|
|
Program Similarity Recognition Based on Behaviour Analysis
Otočka, Dávid ; Vojnar, Tomáš (referee) ; Peringer, Petr (advisor)
The goal of this master thesis was to design an algorithm that will be able to measure the difference between two programs based on their behavioral description. For the algorithm needs, the Levenshtein distance method between two strings and NCD method, were used. Both methods have their implementation approach and test result described. This term also discusses various methods of program analysis in virtual machine environment, as well as explanation of some basic concepts regarding malware analysis.
|
guest ::
