|
|
Using hierarchical finite automata for behavior-description
Renát, Dušan ; Pergel, Martin (advisor) ; Holan, Tomáš (referee)
In the present work we introduce and study the hierarchical finite state machines as a model of artificial intelligence of autonomous agents in various virtual environments and systems. We define the concept of hierarchical finite state machine formally, analyze its computational power compared to common types of automata and point out the possibilities of increasing it. Then we list the usual methods of artificial intelligence simulation, tell apart the direct and indirect behavioral pattern description and present advantages of hierarchical finite state machines as a tool for the direct form. We propose a library interpreting these automata, created as a part of this work. By demonstrating its usage for controlling an example robot within the Robocode environment, we show that they are generic and viable solution for this kind of settings.
|
|
|
Graph Visualisation
Kratochvíl, Jakub ; Bálek, Martin (referee) ; Pergel, Martin (advisor)
This thesis concentrates on drawing graphs in 3D. In the first part of the text, we concentrate on orthogonal layouts of graphs with maximum degree 6. We show how to draw graphs using high dimensional embedding (HDE) and propose a new fast algorithm based upon sampling of the HDE. Further, we developed an application for Win32 that allows the user to translate, zoom and rotate the graph drawing, thus taking full advantage of the 3D layout.
|
|
|
Creative extension of the Diplomacy-game
Švagerka, Michal ; Spousta, Miroslav (referee) ; Pergel, Martin (advisor)
In the present work we study the problematics of the online gaming of the board games. We describe past and present of this genre and try to spot the problems of the current processes. The aim of this work is to design an easy environment for quick development of virtually any board game. The Diplomacy game will be implemented in this system to provide a proof of concept.
|
|
|
Informational system for cooperation of small groups
Svoboda, Martin ; Pergel, Martin (referee) ; Bílý, Tomáš (advisor)
The main aim of this work is to implement concrete informational system for cooperation and information interchange within small working groups of users and to analyze all aspects which have exposed to be important during the development of this informational system. That means not only to design the structure of relatively complex program, but also to design main concepts of its behaviour and other features, which significantly affect functionality, which is then provided by the system to its users. For example it comprises the draft of user registration model, membership of those users in groups, multilevel hierarchy of user powers or managing user sessions. All those important models are discussed in this work and there are also analyzed their advantages and potential difficulties. The second part of this work contains the description of implementation of all interesting or important parts of the system. It means for example the mechanisms of database queries execution, generating universal paged listings, editing processes and inputs from users, working desktop layout or other functionality provided by the kernel, as well as the description of system sections such as Actions planning, Discussions, Inquiries etc.
|
|
|
Visualization of Molecules Described in Geneva System
Procházka, Jan ; Karabáš, Ján (referee) ; Pergel, Martin (advisor)
The subject of this work is to implement the tool for automatic processing of the names of the organic compounds into three-dimensional models of the molecules. The VRML language is used for description of the model. It allows (apart from other things) next processing in most tools designated for work with threedimensional subject. It is possible to control the program from the command line or over the WWW-form. It causes both comfort during common use and possibility of next using by other programs. We focused on processing of the language of the organic chemistry, while the created model is not precise. However, for acquisition of general information about the structure it suffices.
|
|
|
Information system for capital brokers
Pastorek, Jaroslav ; Pergel, Martin (referee) ; Tichý, Tomáš (advisor)
Bachelor thesis considers design and implementation of information system for capital broker based on client - server architecture. System provides storage for most important evidencies - clients, contracts, payments, trade orders and other respective evidencies. System also provides functionality for creating sevices of Centrálny depozitár cenných papierov SR and operating trades through Burza cenných papierov Bratislava. All operations accord to legal conditions of Slovenská republika.
|
|
|
Graph drawing with constrained face sizes
Bernáthová, Anna ; Pergel, Martin (referee) ; Kratochvíl, Jan (advisor)
In this thesis, we are working with straight-line drawings of planar graphs with prescribed face areas. We employ a genetic algorithm to help with searching for graphs that likely cannot be drawn in a way that all their faces have equal areas. Then we pick one of these graphs and after solving a system of polynomial equations in several variables, we formally prove that the graph cannot be drawn in such a way. We continue by describing graphs that can be drawn with arbitrary prescribed face areas. We also try to verify a conjecture that all the planar triangulations with minimum degree greater than three cannot be drawn with arbitrary prescribed face areas. We investigate all such triangulations with ten vertices or less - we try to set areas of their faces at random and we verify that a drawing with such areas really exists. We disprove this conjecture at the end.
|
|
|
Spread of delay on railway network
Straka, Martin ; Pergel, Martin (referee) ; Babilon, Robert (advisor)
Title: Spread of delay on railway network Author: Martin Straka Department: Department of Applied Mathematics Supervisor: Mgr. Robert Babilon Supervisor's e-mail address: babilon@kam.ms.mff.cuni.cz Abstract: The subject of this work is a simulation of late trains spreading in railway net. This program shows the single simulations and creates their statistics according to different criteria (for example changing waiting periods or changes in crossing of the trains). This work evaluates and compares the results. Next point of this work is an effort to suggest the most appropriate criteria in order to prevent the train lag. Another element of this work includes searching for weak points in grafikon, which includes the trains that are late more frequently than other or do not wait for an arrival of the previous ones on their way because of the great lag. Keywords: trains, late, simulation, statistic Keywords: trains, late, simulation, statistic
|
|
|
Data archiving using longest common subsequence
Pihera, Josef ; Pergel, Martin (referee) ; Surynek, Pavel (advisor)
This thesis examines existing algorithms for solving the problem of the longest common subsequence. It tries to apply them to the problem of effective archiving of data which differ a little, because they are, for example, just versions of one file. There are also new methods suggested. Those are based on the examined algorithms. Then the algorithms are compared according to the reached results and their running time.
|
|
|
Hry na grafech
Gavenčiak, Tomáš ; Kratochvíl, Jan (advisor) ; Pergel, Martin (referee)
In this thesis we study properties of one cop&robber game. In this game two players (Cop and Robber) take turns in moving on a finite undirected graph. Both players move with the speed at most one edge per turn. They both know the complete game status. If at any time Cop shares a vertex with Robber, Cop wins. If that never happens, Robber wins. Games of this type are important as models of searching in graphs and networks and for the connection to the width parameters of graphs. We closely examine the class of graphs with a winning strategy for Cop (the so called cop-win graphs) and construct best strategies for both Cop and Robber. The previously known results include the fact that the number of moves in which Cop can catch Robber on every cop-win graph on n vertices is bounded by n3 and there are graphs which require n 4. We show that this number is exactly n 4.
|
guest ::
