|
|
Data mining from incoming e-mail messages
Šebesta, Jan ; Žemlička, Michal (advisor) ; Kopecký, Michal (referee)
We study possibilities of automatic sorting of incoming e-mails. Our primary goal is to distinguish information about oncoming workshops and conferences, job offers and published books. We are developing mining tool for extracting the information from data originated in profession-specific mailing lists. Offers in the mailing lists come in html, rtf or plain text format. The messages are written in common spoken language. We have developed the system so it will use text mining methods to extract the information and save it structured form. Then we will be able to work with it. We are examining how user handles the mail and apply the knowledge in the development. We solve the problems with obtaining of the messages, distinguishing language and encoding and estimating the type of message. After recognition of the transported information we are able to mine data. In the end we save the mined information to the database, which allows us to display it in well-arranged way, sort and search according to the user needs.
|
|
|
Support of Requirements Specifications Methods
Kubr, Jan ; Král, Jaroslav (advisor) ; Žemlička, Michal (referee)
There is a significant change in how we collect software requirements nowadays. The two main reasons are the emergence of service oriented architecture and the rising importance of the user involvement. This thesis briefly summarizes the past work in the requirements engineering field and gives an overview of today's requirements management software tools. It then focuses on Service oriented architecture and how its spreading can change requirements specification and management processes. Considering the survey which was conducted for this work among (not only) software companies and a case study based on author's experience, the thesis gives a recommendation on how we should collect requirements in the current situation and near future. To give a proof of concept, the recommendations were implemented in a real world application architecture.
|
|
| |
|
|
Wikipedia viewer for mobile devices
Šurín, Tomáš ; Žemlička, Michal (advisor) ; Kopecký, Michal (referee)
Unlimited access to encyclopedic or other reference sources of information is considered by many people to be very convenient. Thanks to various mobile devices with Internet access, this is possible nowadays. There are, however, situations when there is no available Internet connection or the users are not willing to pay for it. Be-cause of this we decided to allow offline access to this kind of information to users of mobile devices. Specifically we are trying to provide data from encyclopedia Wikipedia. We have chosen this encyclopedia because it is very comprehensive, it has good quality content and its data is freely available. Wikipedia runs on MediaWiki system, which is used in hundreds of other online projects. Additionally many corporations are using MediaWiki to manage their internal knowledgebase. Hence our solution can also provide data from these projects. Solution was designed with simple extensibility in mind as we are planning to add support for other information sources.
|
|
| |
|
|
Min - max heaps
Neuvirth, Jan ; Koubková, Alena (advisor) ; Žemlička, Michal (referee)
The object of the diploma thesis is detailed description of doublended priority queues. Heap data structure is commonly used as their base. Simultaneously we are trying to uncover behavior of these data structures while working with big data and measure its quality on the basis of obtained results in experimental tests. The aim of the thesis is not to indicate the best min{max heap, but to offer a reader a satisfactory amount of useful information, which enable him to choose an optimal structure in certain conditions.
|
|
| |
|
|
Conference and Workshop Important Dates Manager
Podzimek, Michal ; Žemlička, Michal (advisor) ; Skopal, Tomáš (referee)
The goal of this bachelor work is to make an application that should help the frequenter of congresses, symposiums, conferences and workshops to monitor dates of deadlines and act. User can choose from large volumes of events, which he or she is interested in. He or she can set up in which period of preparing for contribution on event he or she is. A calendar of important deadlines is presented on the basis of this information. The choice is simlified by filters and ordering of events.There is a system of user acounts and user rights and restrictions in aplication. These rights are for limitation of adding and editing events and for setting up a form of application. The simple adding events by parsing of incoming e-mails is also a part of this application.
|
|
|
Storage for relaxed objects
Danihelka, Michal ; Žemlička, Michal (advisor) ; Kopecký, Michal (referee)
In object model is standardly to each object assigned one class which defines not only the object data but also the methods working with these data. This approach is not practical in dynamic heterogeneous environment. There is a significant problem with real data homogenity. The known data about some objects are different than about the others. The number of accessible information can change in time too. Despite these facts the maximal possible functionality have to be offered. In this thesis there will be designed an object model in Java, which can work with such a various data. The objects are not explicitly assigned to classes, but the election of methods which can be called on the concrete object depends on accessibility and values of object's attributes. The emphasis will be put on easy of use and high resistance againts errors caused during development and execution of applications. To prove the usability of relaxed objects model the design of an application will be part of this work. The most important parts of model and application will be implemented.
|
|
|
Kind parser generator
Dzurenko, Tomáš ; Žemlička, Michal (advisor) ; Bednárek, David (referee)
Title: Kind parser generator Author: Bc. Tomáš Dzurenko Department: Network and Labs Management Center Supervisor: RNDr. Michal Žemlička, Ph.D., Department of Software and Com- puter Science Education Abstract: This thesis introduces a generator which takes as its input a definition k-kind grammar and creates source code of analyzer or translator for the language generated by this kind grammar. Opposed to traditional LL(k) grammars, k-kind grammars allow usage of direct left recursion in its rules. This allows for more comfortable and clearer formulation of input grammar rules. Keywords: parser, translator, generator, C++, kind grammar
|
guest ::
RSS feed.