|
|
System for Administration of Tests
Karlík, Ľubomír ; Vyskočil, Jiří (advisor) ; Surynek, Pavel (referee)
The task of the work is the implementation of aplication for tests administration. The aplication provides creating templates with questions for tests generation and provides set of tests administration. The system enables to print tests on papier and is able to evaluate tests automatically from scanned images. The programme supports internet tests generation and administration.
|
|
|
Modeling of Cooperative Path Finding
Ježek, Milan ; Surynek, Pavel (advisor) ; Majerech, Vladan (referee)
In this thesis we describe new models for solving the cooperative pathfinding (cpf) with the requirement of minimal makespan and experimental comparison with current models is performed. These new models investigate the possibilities of encoding the cpf problem into binary integer programming (bip) or constraint satisfaction problem (csp). Mainly the new active-edges IP model tests with high number of agents yielded good results, where it fell only slightly behind the best SAT model. A new csp model reached the fastest times in tests with low number of obstacles and agent interactions while struggling heavily in the opposite cases. Powered by TCPDF (www.tcpdf.org)
|
|
|
Portfolio Optimisation
Huml, Tomáš ; Barták, Roman (advisor) ; Surynek, Pavel (referee)
The goal of this work is to propose an algorithm selecting an optimal portfolio from input projects, which are assessed by costs, profits and potential risk. Any interdependencies can be defined among these input projects. Summary of alternative approaches concerning this topic is part of this work too. Program implementing proposed algorithm is attached to this work. Output of program computation is a portfolio achieving the highest possible profit as well as satisfying all of input constraints and defined interdependencies among the projects. The program allows graph comparison of resulted portfolios and provides detail information about each portfolio.
|
|
|
Workflow Modelling
Rovenský, Vladimír ; Barták, Roman (advisor) ; Surynek, Pavel (referee)
The goal of this thesis was to design and implement a graphical editor for workflow modelling, focusing on productivity, simplicity and usability for the common user. The resulting application is integrated into the FlowOpt project, in which the workflows can be used to manage manufacturing processes in small and medium size factories. The workflow editor should serve among other things as a proof of concept of practical usability of the Nested TNA workflow model. The main parts of the thesis include a working implementation of the editor, a procedure for automatic verification of the workflows and support of the XPDL (BPMN) standard for saving workflows.
|
|
|
Solving Boolean satisfiability problems
Balyo, Tomáš ; Surynek, Pavel (advisor) ; Barták, Roman (referee)
In this thesis we study the possibilities of decomposing Boolean formulae into connected components. For this reason, we introduce a new concept - component trees. We describe some of their properties and suggest some applications. We designed a class of decision heuristics for SAT solvers based on component trees and experimentally examined their performance on benchmark problems. For this purpose we implemented our own solver, which uses the state-of-theart SAT solving algorithms and techniques.
|
|
|
Constraint modelling
Haničinec, Tomáš ; Barták, Roman (advisor) ; Surynek, Pavel (referee)
Constraint programming is one of the possible ways how to solve complicated combinatorial (and other) problems. We model a problem using variables representing real world objects and constraints representing various relations between the objects. However, there are often many possible ways how to model a problem. And what's more, the choice of a modeling strategy can a®ect the resulting efficiency dramatically. Unfortunately, there is no general recipe how to model problems e±ciently. Nevertheless there are still several modeling techniques, heuristics or advices that could improve the e±ciency of models. Some of these techniques are problem dependent, some can be applied only to a certain classes of problems but they still often help. This thesis is trying to give more or less complete list of the most important modeling techniques along with an explanation of why, how and for which classes of problems they work best and also with empirical results underlying the presented facts.
|
|
|
Emergence of Intelligent Behaviour of Social Insects
Ulman, Attila ; Surynek, Pavel (advisor) ; Holan, Tomáš (referee)
Naxov prace: Vznik intcligcntniho chovani u hmyzich spolec'enstcv Autor: Attila Ulman Katedra (ustav): Katcdra tcorctickc informatiky a matematicke logiky Veduci bakalarskej prace: RNDr. Pavel Surynck e-mail veduccho: Pavcl.Surynek@mff.euni.cz Abstrakt: Praca sa zaobcra skiimanim a simulaciou rozsiahleho spoloCenstva jcdnoduchych agentov - mravcov. Tito rclativnc jcdnocluchi jedinci v spojeni dokazu dosiahnut' ovcl'a zlozitejSie ciele, ktore viacnasobne prevySia ich individualize schopnosli. Su schopni kolcktivnc ricsit' iilohy, ktorc by jednotlivo ncmali sancu zvladnul' a to bez cxistencie nejakej riadiacej autority a dopredu danych fixnych struktur, naprick pritomnosti silneho vnutorneho gumu. Aplikaciou jcdnoduehych pravidicl vznika komplexnc chovanie cclku. Zaujimavy jc najma ich primarily zivotny ciel' - hfadanie potravy - pravc tu sa najviac prejavuje ich koopcracia a inleligencia celeho systemu ako ,,supcrorganizmu". Pochopenic emcrgcntnych schopnosti mravcich ko!6nii moze byt' prinosne pri Studii koleklivneho chovania vyspclcjsich spoloCcnsticv. Zamerom praec je skumat' chovanie socialneho hinyzu a pokusit' sa vytvorit' simulaciu ,,in silico" ktora je co najblizSic k realite a co najviac zachycuje Jntcligentnu kooperaciujedincov. Kl'ucovc slova: umely zivot, socialny hmyz, pocitacova simulacia...
|
|
|
Recognition and Filtration of Unwanted Video-Sequences
Vlček, Jakub ; Surynek, Pavel (advisor) ; Kolomazník, Jan (referee)
The thesis deals with the possibilities of recognition video sequences and possibility of machine learning based on previous knowledge. I use neural networks which I learn on characteristics generated from images. Images are characterized using image functions like histogram and statistical functions such as mean and correlations to detect scenes in video-sequence. I used all of these findings to implement the demonstration program. The program can play video, display statistical information about the sequence or frame by frame and detect sequences similar to advertisements on the basis of statistical properties and respond to it by defined events.
|
|
|
Application of ACO to simple subsitution ciphers
Turek, Luboš ; Tůma, Jiří (advisor) ; Surynek, Pavel (referee)
Název práce: Použití ACO algoritmu na řešení jednoduché substituční šifry Autor: Luboš Turek Katedra (ústav): Katedra algebry Vedoucí bakalářské práce: doc. RNDr. Jiří Tůma, DrSc. e-mail vedoucího: jiri.tuma@mff.cuni.cz Abstrakt: V předložené práci studujeme kombinatorickou metaheuristiku Ant Colony Optimization a zkoumáme možné způsoby jejího použití k pro- lomení jednoduché substituční šifry. Součástí práce je návrh a implementace programu. Tento program je srovnán s genetickým algoritmem. Klíčová slova: jednoduchá substituční šifra, ant colony optimization, ACO, kryptologie, kryptografie Title: Application of ACO to simple subsitution ciphers Author: Luboš Turek Department: Department of Algebra Supervisor: doc. RNDr. Jiří Tůma, DrSc. Supervisor's e-mail address: jiri.tuma@mff.cuni.cz Abstract: In the present work we study combinatorial metaheuristic Ant Colony Optimization and we search for its application to the problem of cracking simple subtitution cipher. Functional implementation is a part of the thesis. The program is compared to genetic algorithm. Keywords: simple substitution cipher, ant colony optimization, ACO, cryp- tology, cryptography 6
|
|
|
Constraint Programming in Planning
Surynek, Pavel ; Barták, Roman (advisor) ; Vojtáš, Peter (referee) ; Štěpánková, Olga (referee)
This thesis deals with planning problems and Boolean satisfiability problems that represent major challenges for artificial intelligence. Planning problems are stated as finding a sequence of actions that reaches certain goal. One of the most successful techniques for solving planning problems is a concept of plan- ning graphs and the related GraphPlan algorithm. In the thesis we identified a weak point of the original GraphPlan algorithm which is the search for actions that support certain goal. We proposed to model this problem as a constraint satisfaction problem and we solve it by maintaining arc-consistency. Several propagation variants for maintaining arc-consis- tency in the model are proposed. The model and its solving process were integrated into the general GraphPlan-based planning algorithm. The performed experimental evaluation showed improvements in order of magnitude in several measured characteristics (overall solving time, number of backtracks) compared to the standard version of the GraphPlan algorithm. Next we proposed a stronger consistency technique for pruning the search space during solving the problem of finding supports. It is called projection consistency and it is based on disentangling the structure of the problem formulation. If the problem of finding sup- porting actions is...
|
guest ::
