|
|
Social Network Analysis and Simulations
Vorlová, Pavla ; Král, Jiří (referee) ; Samek, Jan (advisor)
This diploma thesis is focusing on description of processing social network analysis, design and implementation of a model that simulates a particular social network and its analysis. Social networks are modern and very used in this time. They are very good point for exploring. This project deal with static analysis social network, where social network is constructed by graph. We nd out di erent properties of single component and than we establish signi cance of them. Relationships between components are important too for us, because they have a big influence on propagation information in network. Structural properties figure out existence of di fferent communities. We simulate social network with multi-agent systems, they are desirable for represent changes in network. Multi-agent systems have implemented a simulation model that represents a particular social network. His behaviour was analyzed and examinated by chosen methods.
|
|
| |
|
|
Agent Based Gameplaying System
Trutman, Michal ; Zbořil, František (referee) ; Král, Jiří (advisor)
This thesis deals with general game playing agent systems. On the contrary with common agents, which are designed only for a specified task or a game, general game playing agents have to be able to play basically any arbitrary game described in a formal declarative language. The biggest challenge is that the game rules are not known beforehand, which makes it impossible to use some optimizations or to make a good heuristic function. The thesis consists of a theoretical and a practical part. The first part introduces the field of general game playing agents, defines the Game Description Language and covers construction of heuristic evaluation functions and their integration within the Monte Carlo tree search algorithm. In the practical part, a general method of creating a new heuristic function is presented, which is later integrated into a proper agent, which is compared then with other systems.
|
|
| |
|
| |
|
|
Piston for Two Stroke Motorcycle Engine
Král, Jiří ; Beran, Martin (referee) ; Svída, David (advisor)
This bachelor work deals with a proposal and construction solution of a piston for two stroke motorcycle engine. The thesis is focused to basic dimension of piston, strength calculation of the main stressing places of piston and some possible construction enhances. Part of this work is also short summary of development for two stroke motorcycle pistons.
|
|
|
Machine Learning in Image Classification
Král, Jiří ; Španěl, Michal (referee) ; Hradiš, Michal (advisor)
This project deals vith analysis and testing of algorithms and statistical models, that could potentionaly improve resuts of FIT BUT in ImageNet Large Scale Visual Recognition Challenge and TRECVID. Multinomial model was tested. Phonotactic Intersession Variation Compensation (PIVCO) model was used for reducing random e ffects in image representation and for dimensionality reduction. PIVCO - dimensionality reduction achieved the best mean average precision while reducing to one-twenyth of original dimension. KPCA model was tested to approximate Kernel SVM. All statistical models were tested on Pascal VOC 2007 dataset.
|
|
|
Conversion of Raster-Curve into Vector Representation
Král, Jiří ; Sumec, Stanislav (referee) ; Beran, Vítězslav (advisor)
In my process of tracing I deal with converting an input grayscale image into a vector one trying to keep as big similarity with the input image as possible. Tracing is carried out with the help of curve approximation even if the approximation is possible only with line elements, that is to say the curve in raster. Therefore it is necessary to extract the line elements from the input image. We can do it in two different ways according to two different objects in the image. The first group is represented by thin, ablong objects which are substituted by their skeleton. The second group is represented by large objects which are susbstituted by their contour. The found lines are then divided into such parts which can be easily curve approximated. Resulting curves are then only depicted into the output by suitable raster method.
|
|
|
Cooperative Game in Multi-Agent System Jason
Husa, Jakub ; Rozman, Jaroslav (referee) ; Král, Jiří (advisor)
The subject of this thesis is creation of a game based on a multi-agent system. First part of the thesis introduces theory of multi-agent systems, strategic computer games, language AgentSpeak and his extension Jason which were used for implementation. Then design of turn-based strategic game Prison Escape is described, which pitches two asymmetrical teams of intelligent agents with different goals against each other. Each team has three modes of intelligent behavior designed for them, which differ by their complexity and extent of inter-agent cooperation. One team can be controlled by a player, or both teams can be controlled by computer. The game is tested on a set of testing maps. The thesis compares the three designed modes of behavior and evaluates their ability to succeed against varying opponents and thinking speed.
|
|
|
Strategic Game in Multi-Agent System Jason
Vais, Roman ; Zbořil, František (referee) ; Král, Jiří (advisor)
This thesis describes artificial inteligence used in developement of computer games, particularly discusses with theory behing artificial inteligence used in real-time strategy games. It deals with implementation of extensions for one such a game. It analyzes posibylities of use multi-agent systems architecture for purposess of artificial inteligence in games. It describes concept of swarm inteligence as suitable but not used tool for developing not only videogame artificial inteligence. Moreover it attempts to find suitable representation of sensation for software agents and shows the difficulties of this task.
|
guest ::
