|
|
Electronic Mail Room of the BUT
Tomášek, Milan ; Křena, Bohuslav (referee) ; Marušinec, Jaromír (advisor)
The main purpose of this master's thesis is to create electronic mail room of The BUT. First of all I described problems concerning a digital signature, its use and safety, and as well as sphere of qualified certificates and method of their issuing by certification authority. The next part of the thesis deals with systems enabling electronic submission (so-called "Electronic Mail Room"). I have focused on available applications providing electronic submission service to civil offices, and subsequently analyzed functions that individual applications offer to the Mail Room clients as well as to authority staff. On the basis of gained knowledge and according CVIS requirements I created project of electronic submission for needs of the Brno University of Technology. Result of this thesis is the application of electronic mail room, implemented in BUT portal.
|
|
|
Evaluation of Migration from REST API Architecture to GraphQL Language
Parma, Pavel ; Smrčka, Aleš (referee) ; Křena, Bohuslav (advisor)
The aim of this work is to evaluate technologies used for web service development and find out if the newer technology is ready to be used and under what conditions. It is architecture called REST and query language called GraphQL. Outcome is description of those technologies, simple web service as reference implementation, and author's evaluation of few aspects that have direct or indirect impact on sustainability and extensibility.
|
|
|
Comparison of Programs for Scheduling
Kubalcová, Monika ; Martinek, David (referee) ; Křena, Bohuslav (advisor)
This thesis deals with timetabling issues at the Faculty of Information Technology, Brno University of Technology. It focuses mainly on scheduling of lectures and exams for students. In first part, the current situation, restrictive conditions and actual procedure are described. Afterwards, theoretical aspects of scheduling problem are discussed. In the second part of the thesis, selected software application for automatic generation of timetables are compared. The most suitable application is then evaluated by producing a real timetable. The achieved results are discussed and the future directions are suggested in the conclusion.
|
|
|
Module for Electronic Communication with the Czech Tax Administration
Havlena, Jan ; Jurka, Pavel (referee) ; Křena, Bohuslav (advisor)
Bachelor thesis "Module for Electronic Communication with the Czech Tax Administration" has aim at the creation of module for electronic communication with the Czech Tax Administration (CTA) and implementation of one pilot electronic declaration of taxes for this office. It deals with legislation and methods used for declaring tax. It analyzes the used technologies: XML, methods of creation of digital signatures, signed certificate, certificate authority and HTTPS communication. Next, it describes procedure of layout, implementation of module for communication with CTA and problems solved during the implementation.
|
|
|
Front-End for Generator of Test Data
Naňo, Andrej ; Křena, Bohuslav (referee) ; Smrčka, Aleš (advisor)
This bachelor thesis focuses on the design and development of the Dataster web applica- tion which provides data generating functionality for use in the testing of software. Web application is a part of the Testos platform which supports automation of software testing. Aim of the project was to create a web and application interface for the existing application dbgenx which is also part of the platform. Provided solution fulfills specified goals and is suitable for the deployment to a production environment.
|
|
|
Ethical and Law Issues in IT
Žila, Milan ; Honzík, Jan M. (referee) ; Křena, Bohuslav (advisor)
This thesis deals with the problem of software piracy. It analyses the legal issues and copyright law, describes the posibilities of copy protection and the impact software piracy has on society. It also describes various forms of software piracy and presents possible solutions to this problem.
|
|
|
Fine-Grain Noise-Injection Heuristics for SearchBestie Infrastructure
Kozák, David ; Smrčka, Aleš (referee) ; Křena, Bohuslav (advisor)
The main topic of this thesis is testing of concurrent Java programs. Concurrency errors often manifest rarely. To increase a chance to spot such errors, a technique called noise injection can be used. This technique inserts extra instruction into the application under test to disturb the scheduler and thus to explore less common thread scheduling. Because noise injection can be parameterized in many ways, a tool called SearchBestie was created to handle noise-based testing as a search problem. SearchBestie used a tool called Contest for bytecode instrumentation and test execution. However, the development of ConTest has been discontinued and therefore an alternative tool was necessary. In the first part of this thesis, SearchBestie was connected with a tool called RoadRunner, which replaced ConTest. Afterwards new fine-grain noise-injection heuristics have been proposed and implemented. Experiments proved that these heuristics achieve better results in most cases.
|
|
|
Negation in Fuzzy Logic
Dekrét, Lukáš ; Havlena, Vojtěch (referee) ; Křena, Bohuslav (advisor)
This thesis deals with fuzzy logical connections, mainly negations, their properties and constructions.We focused our attention on triangular norms and conorms, which are often used for modeling of fuzzy conjunction and disjunction.We showed the possibilities of constructions of triangular norm and conorm using involutive negations.Futhermore, we dealed with approximation of function, which was created using empirical data to well known fuzzy negator.
|
|
| |
|
|
Model Checking Infinite-State Systems Using Language Inference
Rozehnal, Pavel ; Křena, Bohuslav (referee) ; Vojnar, Tomáš (advisor)
Regular model checking is a method for verifying infinite-state systems based on coding their configurations as words over a finite alphabet, sets of configurations as finite automata, and transitions as finite transducers. We implement regular model checking using inference of regular languages. The method builds upon the observations that for infinite-state systems whose behavior can be modeled using length-preserving transducers, there is a finite computation for obtaining all reachable configurations. Our new approach to regular model checking via inference of regular languages is based on the Angluin's L* algorithm that is used for finding out an invariant which can answer our question whether the system satisfies some property. We also provide an intro to the theory of finite automata, model checking, SAT solving and Anguin's L* and Bierman algorithm of learning finite automata.
|
guest ::
