Final theses listed in the key activities of the research and educational cooperation project

Bachelor's

• Password-based data security
  • Affiliate partner: Cepia Technologies
  • Supervisor: Mgr. et Mgr. Jan Krhovják, Ph.D.
  • Name of diploma:
  • Briefly: The aim of this bachelor thesis is to study and analyze the security of applications using password data protection. In the introductory part of the work, students study basic cryptographic methods using data passwords. The main task will be detailed analysis (especially) of open-source applications (compression programs, .pdf format browsers, disk encryption, so-called password safes, etc.). The output of the theoretical part of the thesis will be a detailed description of the methods used (up to pseudocode level). The practical part of the work will be a simple program allowing for selected compression program (eg. 7-Zip) breaking passwords with brute force (classic and also attacking the dictionary).
• Parallel search using Bregman's divergence
  • Affiliate partner: Techniserv
  • Supervisor: RNDr. Jan Sedmidubský
  • Name of diploma: Lukáš Holeca
  • Summary: The main aim of this work is to assess the applicability of Bregman's divergence for the purposes of similarity search. The first task is to implement the Bregman divergence function in Java. The second task is to create an algorithm that will modify the input data so that Bregman's divergence can be applied to them. The third task is to index the input data using the R-Tree structure and to evaluate the speed and quality of the results. The thesis is written in the framework of the OP Vpk project entitled The Platform of Research and Educational Cooperation FI MU in Data Processing, Reg. CZ.1.07 / 2.4.00 / 12.0049.
• Semantic classification of prepositional phrases
  • Partner involved: Lexical Computing
  • Supervisor: Mgr. Vojtěch Kovář
  • Name of diploma: Josef Bušta
  • Briefly: Prepositional phrases in Czech most often express proverbs. However, it is not easy to identify which kind of proverbial expression the phrase expresses, that is, whether it is time, place, way, etc. A tool performing such a classification could potentially be a great asset for extracting information from the normal text. The aim of the thesis is to implement a tool for classifying Czech prepositional phrases into basic semantic categories. The researcher will propose a set of semantic categories, familiarize himself with the structure of Czech WordNet and implement classification based on the type of preposition and data available in the Hyper-Hyponymic WordNet hierarchy. The thesis is written in the framework of the OP Vpk project entitled The Platform of Research and Educational Cooperation FI MU in Data Processing, Reg. CZ.1.07 / 2.4.00 / 12.0049.
• Conversion of the Czech sentence to the structure of the predicate-argument
  • Affiliate Partner: Partner
  • Supervisor: RNDr. Aleš Horák, Ph.D.
  • Consultant: Mgr. Miloš Jakubíček
  • Name of diploma: Karel Vaculík
  • Briefly: For the logical analysis of a sentence, the structure is often referred to as the predicate-argument structure. This is a simplified entry of a sentence in the form of a verb (argument1, argument2, ...), eg the sentence Peter sows the sour apples to be recorded as a food (Peter, sour apple). Such a structure can be easily used in a variety of applications for intelligence extraction and intelligent text search. In the Natural Language Processing Laboratory, an automated syntactic analyzer for common texts, called synt. This tool can quickly provide an ambiguous structure for the tree representation of the input sentence called the chart. From this structure, it is not currently possible to simply select one correct tree of analysis, but it is possible to identify the substructures of the input sentence such as the verbal group, the nomenclature, the secondary sentence, The task of the thesis is to implement an automated system that translates the input sentence into the predicate-argument structure based on the results of the syntactic analysis of the input sentence (in the form of the chart structure). The implemented system has to deal with the fact that the chart contains multifaceted analyzes.
• Local service processing data over Oracle databases
  • Affiliate partner: TNS
  • Supervisor: Mgr. Pavel Tuček
  • Name of diploma: Marek Poborský
  • Briefly: Student's task will be to program the Web service and web interface running on IIS 7.5 on Windows Server 2008 R2. The Web service will make Oracle database data available on the UCN hosts' status state and supply them with a web interface that is served by users. These will be able to define limiting queries to the database using a web interface.
• Documentation for iproute
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Marek Grac
  • Name of diploma: Marek Adreansky
  • Briefly: Student examines the current state of English documentation of the iproute program. The aim of the thesis is to extend the documentation in the selected language. Due to incomplete and outdated original documentation, you will need to study the program source code. The documentation will be for advanced users and administrators who are accustomed to using similar tools. The aim is to present to them the basic use of this set of programs, which will present versatility and ease of use in practice.
• Search for similar tattoo pictures
  • Affiliate partner: Techniserv
  • Supervisor: RNDr. Jan Sedmidubský
  • Name of diploma: Petr Hájek
  • Briefly: The main goal of this work is to create a database of tattoo pictures. These images must be at least 500. The second part of the thesis is to apply available MUFIN techniques for searching similar images. For several selected tattoo images, you'll need to manually find the most similar tattoo images and compare this result to the result returned by MUFIN.
• Local service monitoring the status of Microsoft Windows operating systems
  • Affiliate partner: TNS
  • Supervisor: Mgr. Pavel Tuček
  • Name of diploma: Petr Smělý
  • Briefly: Student's task is to program the Windows XP, Vista, Windows 7, Windows Server 2003, 2008, and 2008 R2 operating system to monitor the current state of the operating system. The service will primarily monitor the status of the following system components: * antivirus system, * local firewall, * existing local accounts and groups, * Microsoft security patch installation, * selected operating system information. The output of the service will be XML-based messages, which are defined based on an XML schema used by an existing distribution application. The service will load a configuration file when it starts, which will define the output message generation intervals.
• Memory and its efficient use
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Marek Grac
  • Name of diploma: Igor Ludha
  • Briefly: The student will focus on application design principles that have large memory requirements. After analyzing algorithms for allocation algorithms used in Linux, in the practical part, it will propose an application that compares the system's load with different memory operations (eg reallocation, allocation of a larger number of small blocks). The data structures used in the practical part must be designed to measure the behavior of the process depending on the size of the desired block. Each allocation algorithm evaluates total memory requirements and processor machine time requirements.
• Using the verbal valency dictionary for syntactic analysis of Czech
  • Partner involved: Lexical Computing
  • Supervisor: Mgr. Vojtěch Kovář
  • Name of diploma: Josef Bednář
  • Briefly: Verbal valence is one of the basic elements of natural language syntax and its use in automatic syntax analysis could potentially bring significant improvement in analysis results. The VerbaLex verbal vowel lexicon is almost completed. The aim of this thesis is to verify the possibilities of using the VerbaLex dictionary in the automatic syntactic analysis of the Czech language. The student will become acquainted with the theory of verbal valences, data available in VerbaLex dictionary and techniques of syntactic analysis of native languages, especially Czech. Based on this knowledge, it implements the VerbaLex vocabulary search interface, which will be further used in one of the existing syntax analyzers.
• Spam detection using geolocation
  • Affiliate partner: TNS
  • Supervisor: RNDr. Andriy Stetsko
  • Name of diploma: Tomáš Plevko
  • Brief Theme: The main goal of this work is to determine the success of SpamAssassin in the detection of spam using geolocation. Additional rules will be added to the standard detection rules to penalize email if: - the email character set does not match the sender's state, which will be detected by the RelayCountry plugin for the SpamAssassin plugin; - the top-level domain (English TLD) sender's email address does not match the country of the sender; - The email relay TLD (if it is given) does not match the state of this email relay. Part of the work will also find optimal * boundary values for these rules.
• Server of a massively multiplayer game based on the database
  • Partner involved: Hammerware, sro
  • Supervisor: Mgr. Jiří Filipovič
  • Name of diploma: Daniel Mikula
  • Briefly: Massively multiplayer computer games implemented using the client-server model put high demands on the server side. The server must be capable of serving a large number of players and must be able to provide a sufficient response for all players to avoid degradation in the quality or fairness of the game. If there is only one instance of the game world shared by all players, the server side of the game must be able to scale through multiple processors or multiple computational nodes. The server should also be resistant to failures - either by maintaining a sufficiently up-to-date and consistent form of the game world in a total downtime, or even by surviving the loss of fewer computational nodes. As part of a survey of possible technologies for developing a highly scalable, massively multiplayer server, the core of a simple game will be implemented. This will allow players to move around the spatial map (given by the three-dimensional regular grid) where each player colorates the fields they visit. Players can also trade with each other. The core of the game demonstrates the two major issues of a massively multiplayer game: updating one large data structure by all players (updating map fields) and performing atomic operations (replacing owned frames). The task of the student is to design and implement a game server using the existing database system. The student first examines existing approaches and their possible benefits in terms of performance, scalability and tolerance of outages (this is mainly the possible integration of NoSQL databases), then implements the core of the game using this database. Using a simulator of the client's part of the game (arising from a different work), it evaluates performance, scalability, and resilience to its implementation failures.
• Simulator of the client part of a massively multiplayer game
  • Partner involved: Hammerware, sro
  • Supervisor: Mgr. Jiří Filipovič
  • Name of diploma: Vít Svoboda
  • Briefly: The core of a simple game will be implemented as part of a survey of possible technologies for developing a highly scalable, massively multiplayer server. This will allow players to move around the spatial map (given by the three-dimensional regular grid) where each player colorates the fields they visit. Players can also trade with each other. The core of the game demonstrates the two major issues of a massively multiplayer game: updating one large data structure by all players (updating map fields) and performing atomic operations (replacing owned frames). The task of the student is to design and implement the simulator of the client part of the game. This simulator is used to test the server load and its consistency during downtime. This is not a straightforward implementation of the game - the simulator has no graphics or user input, only simulates player behavior (both the movement and the sale of the boxes are generated randomly). The simulator will be able to join the game and simulate a defined number of players. Based on the server's response, it generates statistics on its performance (response time, scatter, deviation for individual players, etc.), it is able to at least partially simulate the game separately, and based on its image of the game world, estimate the extent of the damage due to a server failure. To ensure scalability, the simulator can run in multiple instances - in which case it can collect statistics from all instances.
• Advanced authentication in Kerberos-based Java applications
  • Affiliate partner: Y Soft, sro
  • Supervisor: Mgr. Pavel Tuček
  • Name of diploma: Adam Navrátil
  • Briefly: The task of the student is to describe Apache Tomcat deployment in Microsoft Active Directory (MS AD) and to program Kerberos authentication against MS AD in Java. The bachelor's thesis will have two parts: First it describes the changes that need to be made in the server application and the Tomcat configuration in order to use MS AD authentication. In this case, the client will be IE7 / IE8 on Windows XP / Vista / 7 and Tomcat will run on Windows Server 2008 The second part will be based on programming client and server applications. The client part of the application runs only after successful authentication of the user, and successful authentication is deemed to receive approval from the server side of the application. The server part of the application is in communication with Kerberos KDC (Key Distribution Center) in Microsoft Active Directory. It expects to receive the credentials from the client and passes it to the KDC. If the authentication is successful, the client application passes approval to run.
• Spam detection using geolocation
  • Affiliate partner: TNS
  • Supervisor: RNDr. Andriy Stetsko
  • Name of the diploma: Martin Mareš
  • Brief Theme: The main goal of this work is to implement a SpamAssassin plugin that allows drafting and evaluating (extra-standard) detection rules using available information on sender and email relay geolocation. The components of the work will also: - Design detection rules and test them on the leading email database; - finding optimal * boundary values ​​for these rules.
• Process Management in Educational Processes - MEDUSY project
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of diploma:
  • Briefly: http://www.medusy.sf.net MEDUSY is a project for the use of business processes (in the sense of BPM) for modeling, launching and monitoring of learning processes. The challenge is to continue developing the tool developed within the project. The work is a part of a project that is being developed within the framework of cooperation between LaSArIS and RedHat, an industrial partner FI. In case of good results, maybe further cooperation on this project.
• Seed of Linux OS Random Number Boot
  • Affiliate partner: RedHat
  • Supervisor: Ing. Mgr. Zdeněk Říha, Ph.D.
  • Name of diploma:
  • Briefly: Quantitative analysis of data entropy serving as a seed generator of pseudorandom numbers of the Linux kernel during OS booting. We wonder how many entropy bits are actually contained in the data inserted into the random number generator in the Linux kernel during boot - ideally to find these values ​​at different boot phases and in different conditions - HW and VM. The work involves modifying the Linux kernel so that some data will be stored continuously for the random number generator and subsequent data analysis.
• Running library for ANTLR3 in C ++
  • Partner involved: Lexical Computing
  • Supervisor: Mgr. Miloš Jakubíček
  • Name of diploma:
  • Briefly: ANTLR is a highly expressive system (similar to standard UNIX tools such as flex and bison) for parser generation based on the specified context-free LL (*) grammar. In addition to the code generator and supporting runtime libraries, the system includes part of the generated parser. The aim of the thesis is to create an effective implementation of the C ++ runtime library (version 3) and its sample integration using an ANTLR3 parser (specifically in a corpus manager) using the available Java and C solutions. An attempt is made to integrate the library into the main distribution of ANTLR under the BSD license and possible communication with ANTLR developers.
• Plugin for FreeIPA
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of diploma:
  • Briefly: Student examines issues of centralized identity management (users, machines, services, etc.). Compares products that address this issue (MS Active Directory, FreeIPA, NIS +, LDAP, and more) and creates documentation for the FreeIPA frame management plugin. It also creates a FreeIPA plugin to manage (arbitrarily) a new type of object. Plugin must have CLI interface, web interface is a bonus. Technology: FreeIPA, Python The work is being worked out in collaboration between LaSArIS and RedHat, an industrial partner FI. Good results may require further cooperation.
• Integration of Stanse into IDE (plugin)
  • Affiliate partner: ANF DATA spol. s ro,
  • Supervisor: Mgr. Jan Obdržálek, Ph.D.
  • Name of diploma: Miroslav Cupák
  • Briefly: The open-source Stanse tool developed at FI is designed to automatically detect bugs in C written programs. This is a fully functional tool that has detected non-trivial errors, for example in the latest Linux kernel (2.6.28 - selected errors are available on tool pages). The aim of the bachelor thesis is to implement the plugin for integration of Stanis tool into one of the widely used development environment - Eclipse, NetBeans, KDevelop, MS Visual Studio ...
• CPP preprocessor support in Stanse
  • Affiliate partner: ANF DATA spol. s ro,
  • Supervisor: Mgr. Jan Obdržálek, Ph.D.
  • Name of diploma: Michal Krajňanský
  • Briefly: The open-source Stanse tool developed on FI is designed to automatically detect bugs in C written programs. The tool internally works over preprocessed code, but returned errors would be useful to display in unexpanded source code. The aim of the thesis is to modify CPP preprocessor to provide mapping between original and preprocessed code. In particular, it will be necessary to treat the expansion of macros, inserting files, and so on. Part of the work is to design a format for storing data and to offer a suitable API for other StanS components.
• Converting test records to Message Sequence Chart Descriptions
  • Affiliate partner: ANF DATA spol. s ro
  • Supervisor: RNDr. Vojtěch Řehák, Ph.D.
  • Name of diploma: Martin Vodila
  • Brief Theme: Bachelor Thesis Topics fall within the field of testing distributed network systems. During the execution of tests, a large number of logs are created on individual machines, which are very confusing for the person. At the time of the ANF DATA affiliate, a pearl script was created to collect and display this information from the log in an HTML file. Unfortunately, this program has become obsolete and not fully functional over time. The task of the student is: * to study the problems of network traffic testing * to study the existing solution in ANF DATA (a pearl script that generates an HTML description) * to design a new solution for display (eg using SCStudio) and to determine which items from the log file to convert (set parameter scripting so that the user can define the relevant log file items for viewing itself) * edit the pearl script so that it correctly generates a clear output (eg in Message Sequence Charts) * modify the script to work for network Level 3 and 4 tests
• Implement algorithms to control time constraints in MSC designs
  • Affiliate partner: ANF DATA spol. s ro
  • Supervisor: Ing. Petr Gotthard
  • Consultant: RNDr. Vojtěch Řehák, Ph.D.
  • Name of diploma: Ondřej Kocian
  • Briefly: The FI MUNI student team is developing Sequence Chart Studio (SCStudio) to draw and verify Message Sequence Charts (MSC) and UML sequence diagrams. The aim of this work is to develop an extension of this application, which will allow the control of time constraints in MSC designs. Partial tasks and requirements: 1. Check out selected time limitations in MSC diagrams 2. Design and implement basic operations over time intervals. Intervals can be top / bottom limited by a decimal number. 3. Implement an algorithm to control and refine time constraints in basic MSC and HMSC diagrams. The output of the algorithm will be modified (H) MSC. The application must be implemented in C / C ++ and licensed by the GNU Lesser General Public License (LGPL).
• Graphical layout of sequence diagrams
  • Affiliate partner: ANF DATA spol. s ro
  • Supervisor: Ing. Petr Gotthard
  • Consultant: RNDr. Vojtěch Řehák, Ph.D.
  • Name of diploma: Zuzana Pekarčíková
  • Briefly: The task of the thesis is to design and implement an algorithm that will readily rearrange objects in bMSC on the drawing area.
• E-learning CMS and formats used in them
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of the diploma: Richard Garčár
  • Briefly: One of the students aims to analyze the market in both commercial and opensource E-learning tools (eg. Moodle) and compare their functionality (Course, Content and Test Management, Coruse planning, Roles support, Monitoring and Feedback). Based on this knowledge, one of the tools for the project will be put into operation and customized. The other student is tasked to analyze and compare the formats that use these tools (e.g. SCORM). Subsequently, the proposed extension of the selected format for project needs. (Following the virtual lab module). Because the tasks are closely related, both participants will work together and use mutual knowledge. The work is part of the opensource project of a collaborative framework between LaSArIS and RedHat, FI's industrial partner. In case of good results, maybe further cooperation on this project.
• E-learning patterns in courses at MUNI
  • Affiliate partner: Red Hat
  • Supervisor: Ing. Mgr. Lucie Pekárková
  • Consultant: Mgr. Jiří Kolář
  • Name of diploma: Milan Mužík
  • Briefly: The student has the task of choosing a suitable way to describe the structure of the course (ideally any procedural notation). Then perform a small survey at MU (especially FI), contact the teacher or study the course descriptions taught at the FI and prepare a study where the most commonly used "patterns" for the structure of the course and for each model will mention the courses that use it. The work is a part of the project of a collaborative framework between the LaSArIS laboratory and RedHat, FI's industrial partner. In case of good results, maybe further cooperation on this project.
• Build and report the site and other infrastructure for the project together in collaboration with RedHat
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of diploma:
  • Briefly: The student has the task to prepare the infrastructure for the project. This includes preparing CMS for creating a site, filling it with relevant content, opening a forum, wiki, blog, and other things to do. The work is a part of the project of a collaborative framework between the LaSArIS laboratory and RedHat, FI's industrial partner.
• Process Management in eLearning - MEDUSY project
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of diploma: http://www.medusy.sf.net MEDUSY is a project for the use of business processes (in the sense of BPM) for modeling, launching and monitoring of learning processes. The task is to develop the tool developed within the project. The project is built on the Java EE platform and the BPMS platform Activiti. http://www.activiti.org/ The work is a part of a project that is being developed in collaboration between LaSArIS and RedHat, an industrial partner FI.
  • Briefly:

Diplomas

• GPUs and their applications in cryptography (GPUs and their applications in cryptography)
  • Affiliate partner: Cepia Technologies
  • Supervisor: Mgr. et Mgr. Jan Krhovják, Ph.D.
  • Name of diploma:
  • Summary: The aim of this diploma thesis is a detailed analysis of possibilities of using programmable graphic processors (GPUs) for cryptographic purposes. The student will focus on the nVidia GPU with the CUDA programming interface. In the introductory part of the work, we will make a clear overview of the possibilities and basic ways of programming these GPUs and the acquired experience (and examples of elementary programmers' constructions). The final text of this part of the work should explain to readers the basic differences in CPU and GPU programming and allow potential entrants to easily enter the GPU programming area. In the next part of the thesis students study possibilities of using GPU for cryptological (ie cryptographic and cryptoanalytical) purposes. It will also include a brief look at the current state of applied research in this area (what results / speeds have been achieved by different teams with different encryption algorithms and different GPUs, what are the latest findings and trends for the future, etc.). The practical part of the thesis will be the implementation of selected cryptographic algorithms (Kasumi or A5 / 3) optimized for both cryptographic (speed of given instance of algorithm) and cryptanalytical (number of instances) purposes. Part of the thesis will also be the speed tests given by the implementations and their comparison with equivalent algorithms running on common CPUs. All work examples, including well-documented source codes, will be included on the DVD.
• Automatic creation of knowledge from corpus data and dialogue
  • Partner involved: Lexical Computing
  • Supervisor: Mgr. Vojtěch Kovář
  • Name of diploma: Miloš Husák
  • Briefly: Extracting regular text information is one of the basic tasks of the natural language processing industry. Basic knowledge of the type "dog is an animal", "car has a motor", etc. are even one of the basic prerequisites for language analysis at higher levels. The work will deal with the extraction of such basic knowledge from different types of text data, especially language corpora, but also by transcription of dialogues. The student first learns about the issues and sums up the results already achieved in this area. It also suggests methods that will perform this extraction using the available morphological and syntactic analysis tools. An essential part of the work will be the evaluation of the success (especially the accuracy) of the proposed methods and the comparison with the previously achieved results. Particular emphasis will be placed on evaluating success depending on the type of linguistic corpus - for example, it can be expected that the extraction from the corpus of Wikipedia pages or dialog transcripts will be higher than the success of extraction from the corpus of newspaper articles.
• Cryptography based on elliptic curves
  • Affiliate partner: Cepia Technologies
  • Supervisor: Mgr. et Mgr. Jan Krhovják, Ph.D.
  • Name of diploma:
  • Summary: The aim of this diploma thesis is a detailed analysis of efficient implementations of elliptical curves (ECC) for cryptographic purposes. In the first part of the work the student is acquainted with basic operations and cryptographic algorithms based on elliptic curves. Next part of the thesis will be devoted to the study of various representations of elliptic curves and algorithms for their effective implementation (including analysis of their effectiveness). The practical part of the thesis will be the implementation of individual algorithms for working with elliptical curves, real-rate tests, and comparison of achieved speeds with implementation speeds available in common cryptographic libraries.
• Time-memory trade-off (TMTO) attacks in cryptology (Time-memory trade-off (TMTO) attacks in cryptology)
  • Affiliate partner: Cepia Technologies
  • Supervisor: Mgr. et Mgr. Jan Krhovják, Ph.D.
  • Name of diploma:
  • Briefly: The aim of this diploma thesis is a thorough study of time-memory trade-off (TMTO) attacks in cryptology. The student will study the current state of the theory of TMTO attacks. The first part of the thesis outlines the basic use of these attacks on common classes of cryptographic algorithms (block ciphers, current ciphers, hash functions, etc.). It will also focus on the construction and pre-calculation of tables / chains - including analyzes and estimates of the number of collisions when sampling the entire state space. During these analyzes, he examines both the expected behavior of pseudorandom functions and the behavior of selected (simplified or weak) cryptographic algorithms. An integral part of the thesis will also be an analysis of the possibilities of efficient (compact) storing of pre-calculated data and their easy (fast) search (eg using so-called distinguishing points). In the next section, it will focus on the online phase of TMTO attacks, where it also analyzes the possibilities of its improvement (eg by using control points). The practical part of the thesis will be a selection of several weak cryptographic algorithms (eg 40 bit RC4 cipher) or simplified strong cryptographic algorithms (with reduced key space and / or block size) and simulation of TMTO attacks on these algorithms.
• Test IDS throughput
  • Affiliate partner: TNS
  • Supervisor: RNDr. Václav Lorenc
  • Name of diploma: Jakub Dobrovolný
  • Briefly: The aim is to develop a methodology and procedures suitable for verifying the performance and permeability of network intrusion detection systems without being bound to one system manufacturer. This is all done with the help of freely available tools and resources. The described procedures should be tested on IDS Kernun.
• Modernization of Rational Platform for Teaching
  • Affiliate Partner: IBM, Czech Republic
  • Supervisor: RNDr. Jan Pavlovič, Ph.D.
  • Name of diploma: Vladimír Hromada
  • Summary: The aim of this diploma thesis is to propose the concept of Rational platform for teaching MU MU. Especially within the scope of PA165 and PV167. The platform will be based on Rational Workbench for Collaborative Lifecycle Management in Version 3. It is necessary to identify and solve university specificities in the implementation and management of student projects. Especially from the point of view of integration with IS MU, mutliproject management, reporting, Part of the work will also be the innovation of the development processes for team cooperation within the subject PA165 and PV167
• Implementation In the Rational Team Concert model
  • Affiliate Partner: IBM, Czech Republic
  • Supervisor: RNDr. Jan Pavlovič, Ph.D.
  • Name of diploma: Radek Kohút
  • Briefly: The aim of the diploma thesis is to analyze the development model of the software V. Further formalize the process structure In the model in the numerous role-plays in Rational Method Composer. Part of the thesis will be a case study involving the implementation of the formalized V model in the Rational Team Concert version 2 and 3, analogous to the existing RTC models such as Scrum and OpenUP. The thesis will also analyze the possibilities of using the model in teaching and innovative projects at the university.
• Data entropy analysis serving as seed of a random Linux OS generator when booting
  • Affiliate partner: RedHat
  • Supervisor: Ing. Mgr. Zdeněk Říha, Ph.D.
  • Name of diploma:
  • Briefly: Quantitative and qualitative data entropy analysis serving as a seed generator of pseudorandom numbers of the Linux kernel during OS booting. We wonder how many entropy bits are actually contained in the data inserted into the random number generator in the Linux kernel during boot - ideally to find these values ​​at different boot phases and in different conditions - HW and VM. The work involves modifying the Linux kernel so that some data will be stored continuously for the random number generator and subsequent data analysis.
• Using MS Reporting Services
  • Affiliate partner: Gemma
  • Supervisor: Ing. Mgr. Zdeněk Říha, Ph.D.
  • Name of diploma:
  • Briefly: Extend the Gemma GSR Reporting Application with the MS Reporting Service. Above the ERP data tables, the IS is created using the SQL Reporting Service GSR application, which reports data to users. Expand your existing GSR applications with additional reports and customizations based on customer requirements. Customer requirements are processed by the consultant on the basis of which they prepare the assignment of the report, the task of the student will be to create a report in accordance with the assignment. [This is a preliminary entry - the final entry will show exactly what to do]. At least the basic orientation in the IS ERP VISUAL tables must be handled, for this reason basic training will be provided and consultation with an experienced programmer will be available.
• Compare freeIPA and MS Windows Active Directory
  • Affiliate partner: RedHat
  • Supervisor: Ing. Mgr. Zdeněk Říha, Ph.D.
  • Name of diploma: Lukáš Jakubík
  • Briefly: Compare the functionality offered by freeIPA with what MS Windows Active Directory offers in Windows Server 2008.
• Face search in MUFIN
  • Affiliate partner: Techniserv
  • Supervisor: RNDr. Michal Batko, Ph.D.
  • Consultant: RNDr. Jan Sedmidubský
  • Name of diploma: Jiří Jánoš
  • Brief Thesis : The aim of the diploma thesis is to integrate detection, excercise and face search into the MUFIN system. * detection - use of CUDA acceleration for the learning phase * excursion and search - finding a suitable descriptor and similar search functions, combining with the eye detector to increase accuracy * user interface
• Web application stress tests in the context of ongoing integration
  • Affiliate partner: oXy online
  • Supervisor: RNDr. Radek Ošlejšek, Ph.D.
  • Name of diploma: Ján Kotúč
  • Briefly: The aim of the thesis is to study and compare the existing tools for stress tests of web applications and problems and tools for continuous integration, especially the Vulcan system. The work will contain a description of various types of stress tests and the issue of monitoring their results. The thesis will propose and implement an extension of the Vulcan system to support stress testing during continuous integration. The selected stress tests will be described and the way of their integration into the Vulcan system will be described. The load test functionality will be experimentally verified on a real project.
• Web application stress tests
  • Affiliate partner: oXy online
  • Supervisor: RNDr. Radek Ošlejšek, Ph.D.
  • Name of diploma: Jakub Vavřík
  • Briefly: Review and describe stress tests for web applications, compare existing tools. Design and create an application that will simulate real behavior with hundreds / thousands of users and allow you to evaluate the stress tests performed within the ongoing integration of the developed sites. The work will contain a description of various types of stress tests and the issue of monitoring their results. It will also include the results of practical experiments on real, large-scale commercial websites. Part of the work will be the implementation of the necessary tools.
• Distribution of current data processing load on computing units
  • Partner involved: JavlinConsulting
  • Supervisor: RNDr. Radek Ošlejšek, Ph.D.
  • Name of diploma: Michal Řihák
  • Briefly: Study the current data processing and ETL tools. Design a runtime algorithm for individual nodes of current data processing with respect to their dependency (producer-consumer) and the number and performance of available computing units. The goal is to efficiently serialize logically many fiber tasks to available computing resources to minimize data processing time. Program the algorithm as a Java module. The text part of the diploma thesis will include an introduction to the problem, description and comparison of selected ETL tools, description of the solution and implementation. The practical part will include a functional implementation of the Java module.
• Server massively multiplayer games
  • Partner involved: Hammerware, sro
  • Supervisor: Mgr. Jiří Filipovič
  • Name of diploma: Martin Jirman
  • Briefly: Massively multiplayer computer games implemented using the client-server model put high demands on the server side. The server must be capable of serving a large number of players and must be able to provide a sufficient response for all players to avoid degradation in the quality or fairness of the game. If there is only one instance of the game world shared by all players, the server side of the game must be able to scale through multiple processors or multiple computational nodes. The server should also be resistant to failures - either by maintaining a sufficiently up-to-date and consistent form of the game world in a total downtime, or even by surviving the loss of fewer computational nodes. As part of a survey of possible technologies for developing a highly scalable, massively multiplayer server, the core of a simple game will be implemented. This will allow players to move around the spatial map (given by the three-dimensional regular grid) where each player colorates the fields they visit. Players can also trade with each other. The core of the game demonstrates the two major issues of a massively multiplayer game: updating one large data structure by all players (updating map fields) and performing atomic operations (replacing owned frames). The task of the student is to design and implement a game server without the use of a database (access to data and their archiving will therefore be solved by the solved problem). The server can be implemented in conventional imperative language (C / C ++ is preferred) using MPI or another API for parallel applications, but also in functional supporting parallelism (e.g. Erlang). In the first phase, the student searches for accesses and selects the language and API for implementation. It then implements the distributed game server, secures the game world to the disk and recreates it from stored data. The student also examines the possibilities of failure resistance and implements at least a correct recovery of atomic operations. Using a simulator of the client's part of the game (arising from a different work), it evaluates performance, scalability, and resilience to its implementation failures.
• Automate the connection of the C ++ code to the .Net interface
  • Affiliate partner: AVG Technologies
  • Supervisor: RNDr. Vojtěch Řehák, Ph.D.
  • Name of diploma: Martin Gracík
  • Briefly: Interoperability between .Net and C ++ is a relatively new issue and is currently only realistically applicable. The student will study the existing interoperability capabilities of managed and native code on a more general level and will become familiar with existing solutions (e.g. COM interoperability). AVG has created a requirement for interoperability with a purely virtual C ++ interface, but it does not directly conform to COM conventions. The student also has the task of studying the usage problem in AVG, comparing with the existing solution for COM objects and designing and implementing its own solution. Part of the work will be a sample test of the implementation in AVG and a proposal for the follow-up procedure for automatic generation of the interface of newly created components.
• C ++ support in Stanse
  • Affiliate partner: AVG Technologies
  • Supervisor: Mgr. Jan Obdržálek, Ph.D.
  • Name of diploma: Martin Vejnár
  • Briefly: The open-source Stanse tool developed at FI is designed to automatically detect errors in C written programs. The aim of this diploma thesis is to extend Stanse to programs written in C ++. For this purpose, it will be necessary to implement a new C ++ parser, to support functionality typical of object languages ​​(eg late binding) and to adapt the Stanse kernel accordingly.
• Knowledge Management System for ISO / IES 200000: 2005
  • Partner involved: Microsoft sro
  • Supervisor: RNDr. Jan Pavlovič, Ph.D.
  • Name of diploma: Lubomír Dočkal
  • Summary: The aim of this diploma thesis is to design and implement a knowledge management system aimed at supporting the development of software applications and ISO / IEC 20000: 2005 quality standard. The proposed knowledge management will support the implementation of ISO 20000 at OVSS ITS especially in the context of the agile development and ITIL v3 concept. The solution will be built on the Microsoft Sharepoint server.
• New Checkers for Sequence Chart Studio
  • Affiliate partner: ANF DATA, spol. s ro
  • Supervisor: RNDr. Vojtěch Řehák, Ph.D.
  • Name of diploma: Václav Vacek
  • Briefly: The FI MUNI student team develops the Sequence Chart Studio application to draw and verify the MSC (ITU-T Z.120 standard) and UML sequence diagrams. The aim of this work is to: * detail the existing control algorithms (acyclic, deadlock, livelock, FIFO, race), * eliminate the identified deficiencies (reimplementation, add test examples, documentation improvements), * design and implement new verification algorithms , recursivity, name checker, strong realizability) and export filter to DiVinE format (implementation of MSC design). The application must be implemented in C / C ++ and licensed by the GNU Lesser General Public License (LGPL)
• Modeling of learning processes
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of diploma: Jiří Novák
  • Briefly: The task is to explore the possibilities of modeling learning processes, to map existing tools for visual modeling of processes (BPM) and to suggest how to use them for modeling of learning processes. In the practical part, the student will design and implement or expand the existing tool for modeling learning processes. The modeling tool will expand with new elements - a set of teaching patterns often used in teaching. Prerequisites and co-requisites Knowledge of Java development incl. GUI. The work is a part of a project that is being developed within the framework of cooperation between LaSArIS and RedHat, an industrial partner FI.
• Use of e-learning web services
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of diploma: Miroslav Baláž
  • Briefly: Student examines web services that can be used in the context of e-learning, describing their presence in staging LMS. It also designs and implements the missing web services for one of them. Prerequisite is intermediate knowledge of Web Services (SOAP). The thesis is dealt with within the MEDUSY project.
• Process management in e-learning
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of diploma: Daniel Tovarňák
  • Summary: The aim of the thesis is to analyze the possibilities of using Business Process Management in electronic education. The student will deal with the issue of launching learning patterns and processes modeled in BPMN 2.0. The practical output of the work will be the prototype of a process-based learning support application. The thesis is dealt with within the MEDUSY project.
• Virtual Laboratories, resource allocation
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of diploma: Bohuslav Kabrda
  • Briefly: The task is to enable the allocation of virtual systems for e-learning courses. The e-learning target is a functioning system with a predefined environment for the given course. The student has the task of studying Cloud computing, distributed system and resource allocation. Furthermore, the issue of provisioning and quick installation of required environments. The aim is to design this system and the proof of concept that will meet the above requirements. Prerequisite is Cloud Computing and Virtualization. The work is a part of a project that is being developed within the framework of cooperation between LaSArIS and RedHat, an industrial partner FI.
• Plugin for FreeIPA
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of diploma:
  • Briefly: Student examines issues of centralized identity management (users, machines, services, etc.). Compares products that address this issue (MS Active Directory, FreeIPA, NIS +, LDAP, and more) and creates documentation for the FreeIPA frame management plugin. It also creates a FreeIPA plugin to manage (arbitrarily) a new type of object. Plugin must have CLI interface, web interface is a bonus. Technology: FreeIPA, Python The work is being worked out in collaboration between LaSArIS and RedHat, an industrial partner FI.
• Process Management in eLearning - MEDUSY project
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of diploma: http://www.medusy.sf.net MEDUSY is a project for the use of business processes (in the sense of BPM) for modeling, launching and monitoring of learning processes. The task is to develop the tool developed within the project. The project is built on the Java EE platform and the BPMS platform Activiti. http://www.activiti.org/ The work is a part of a project that is being developed in collaboration between LaSArIS and RedHat, an industrial partner FI.
  • Briefly:
• Using Google eLearning Services - MEDUSY project
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of diploma:
  • Briefly: MEDUSY is a project for the use of business processes (in the sense of BPM) for modeling, launching and monitoring of learning processes. The aim of this thesis is to analyze the possibilities of using Google services (Google Forms, Google Docs) for elearning purposes. And the subsequent integration of these services into the project. The project is built on the Java EE platform and the BPMS platform Activiti. http://www.activiti.org/ The work is a part of a project that is being developed in collaboration between LaSArIS and RedHat, an industrial partner FI.
• Multimedia as an e-learning content
  • Affiliate partner: RedHat
  • Supervisor: Mgr. Jiří Kolář
  • Name of diploma:
  • Briefly: Student will explore the possibility of integrating multimedia content into e-learning tools, Moodle. In particular, it will focus on video and audio streaming, web casting, and shared learning, as well as multimedia content (such as screencasts). Design a prototype for one of the e-learning tools.The work is a part of the project of a collaborative framework between the LaSArIS laboratory and RedHat, FI's industrial partner.
• Advanced authentication in Kerberos-based Java applications
  • Affiliate partner: Y Soft, sro
  • Supervisor: Mgr. Pavel Tuček
  • Name of diploma: Tomáš Král
  • Briefly: Student will study transfer and work with Ticket-Granting Ticket and Session Ticket. Subsequently, the student creates an application that enables the user to authenticate against the Kerberos KDC (Key Distribution Center) in Microsoft Active Directory and after successful TGT ticket authentication and session ticket for the selected service / source. A part of the work will be a sample application that stores the issued ticket of the session on a chip card or flash memory, according to the user's choice. Subsequently, the user authorizes the service using the smart card / flash memory and proves that it is authorized to use it. The student should consider the risks of his theft and use adequate methods to reduce this risk in both transfer session sessions.
• Automatic extraction of idioms from the corpus
  • Partner involved: Lexical Computing
  • Supervisor: Mgr. Miloš Jakubíček
  • Name of the diploma: Jan Bušta
  • Course curriculum : The student will study the current algorithms used for automatic searching of idiomatic phrases in text corpuscles, compare them and subsequently implement the appropriate ones. In addition to the implementation, the database of extracted idiomatic links from selected Czech corpora (eg. SYN2000, czes), evaluation of the accuracy of part of the data thus obtained and their comparison with the SČFI.
• Using modern ICT approaches in incident management
  • Affiliate Partner: IBM Česká Republika, sro
  • Supervisor: RNDr. Jan Pavlovič, Ph.D.
  • Name of diploma: Michal Holešinský
  • Abstract : The aim of the diploma thesis is to analyze the current state and modern knowledge in the field of incident management and to propose a methodology for solving this discipline in SME and university sector. The methodology will be based on the use of contemporary ICT tools.

Doctoral

• Attacking Path Explosion for Effective Bug-Finding
  • Affiliate partner: ANF DATA spol. s ro
  • Supervisor: prof. RNDr. Antonín Kučera, Ph.D.
  • Consultant: Mgr. Jan Obdržálek, Ph.D.
  • Student Name: Marek Trtík
  • Briefly:
• Automatic Bug-Find Techniques for Linux Kernel
  • Affiliate partner: ANF DATA spol. s ro
  • Supervisor: prof. RNDr. Antonín Kučera, Ph.D.
  • Consultant: Mgr. Jan Obdržálek, Ph.D.
  • Student Name: Jiří Slabý
  • Briefly:
• Techniques of Industrial Modeling and Verification of Network Services
  • Affiliate partner: ANF DATA spol. s ro
  • Supervisor: prof. RNDr. Mojmír Křetínský, CSc.
  • Consultant: RNDr. Vojtěch Řehák, Ph.D.
  • Name of diploma: ing. Petr Gotthard
  • Briefly:
• Syntactic and Logical Analysis of Natural Language
  • Partner involved: Lexical Computing
  • Supervisor: doc. PhDr. Karel Pala, CSc.
  • Consultant:
  • Name of the diploma: Mgr. Miloš Jakubíček
  • Briefly: