|
|
High-Level Petri Nets Interpreter in Python
Grigorev, Danil ; Kočí, Radek (referee) ; Janoušek, Vladimír (advisor)
This work is targeting a goal of implementing a high level Petri net interpret in Python. The implementation is based on SNAKES library. The final product is capable of executing and visualising Petri nets, created by user. The simulator is based on distributed systems theory and is executed in real-time. The end user is able to experience a simple and human-friendly API, made for creation and execution of High-Level Petri Nets.
|
|
|
Procedural Generation of Dungeon Type Structures
Šipoš, Marek ; Rychlý, Marek (referee) ; Bartík, Vladimír (advisor)
The main aim of this bachelor thesis was to design and develop a library for procedural generation of dungeons and web application for its practical use. The library offers a configuration interface, output generation according to this configuration and file support. The web application allows the visualization of the obtained input. The implementation was done in Java language.
|
|
|
Graphs, Graph Algorithms and their Use in Finding the Shortest Path
Ott, Lukáš ; Moravec, Petr (referee) ; Bobalová, Martina (advisor)
This Bachelor thesis concentrates on introducing graphs and graph algorithms theories for finding the shortest path and consequential implementation of acquired pieces of knowledge into program MS Excel 2003 using VBA language. Chart theory applies to everything, from small problems to complex actions. If we are able to understand the basic pieces of knowledge presented in this thesis, we will also be able to put them into practice.
|
|
|
Discovery of Wireless Sensor Network Topology Using Genetic Algorithms
Dalecký, Štěpán ; Samek, Jan (referee) ; Zbořil, František (advisor)
The thesis deals with a design of the genetic algorithm that is able to discover the wireless sensor network topology using signal strength among particular sensors. At first, the thesis describes the theory of genetic algorithm and wireless sensor network. Subsequently, on the basis of this theory, the genetic algorithm serving for the wireless sensor network topology discovery has been designed. The thesis also describes important features of the algorithm implementation. In conclusion, the outcomes have been reviewed.
|
|
|
Automatic Diagram Layout
Jezný, Lukáš ; Chmelař, Petr (referee) ; Herout, Adam (advisor)
Automatic layouts for diagram drawing is described in this paper. Major methods, algorithms, metrics for automatic layouts are introduced in theretical part. Practical part of this work was developing algorithms for automatic layouts of organizational structures and business process model diagrams.
|
|
|
ESP/ESC Impact to Behavior of Vehicle
Weigel, Filip ; Mrázek, Vojtěch (referee) ; Strnadel, Josef (advisor)
This bachelor thesis focuses on active safety - ESP. System ESP greatly improves stability of vehicle while turning. The thesis analyses modelling, brake functionality, subordinate systems of ESP - ABS and ASR, physical forces and phenomenons, model example, analysis of problem, design of model, implementation of model and experiments evaluation of implemented model in UPPAAL enviroment. The goal of the thesis is to prove that ESP system helps to stabilize vehicle while turning by simulation of vehicle model. Results are presented in well-aranged graphs side-by-side. It is possible to analyze the behaviour of vehicle while turning with ESP or without ESP.
|
|
|
The Pushdown Automaton Simulator
Graizely, Martin ; Blatný, Petr (referee) ; Bidlo, Radek (advisor)
Visualization often helps with the understanding and allows for a quicker grasp of the problem. This work is aimed on implementation of pushdown automaton simulator. The purpose of the application is to ease understanding of such abstract machine and its abilities, by providing visual design and possibility of algorithm's interactive animation.
|
|
|
Methods for Segmented Image Processing
Štěrba, Radek ; Číka, Petr (referee) ; Zukal, Martin (advisor)
This work deals with the representation of segmented images using graphs. Different segmentation methods used in processing visual information are described here. Today is mathematics increasingly needed. This fact is not omitted, basic information of graph theory are described in this paper. The second part of this work is practical. It contains a survey of libraries processing graphs. Further the data structures for describing the segmented image are described. Last but not least, there is also described the formation and properties of the operators designed for environment RapidMiner that fill these structures.
|
|
|
Graph Coloring
Procházka, Lukáš ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This thesis is about graph coloring, which is assigning colors to vertices of a graph such that no two vertices, which are linked with an edge, have the same color. This problem is very computational hard, because it's NP-complete. It's also very important, because it has many practical applications. Here are described some of the heuristic algorithms, which try to solve this problem by iteratively improving the initial solution with given number of colors. Three of them have been implemented, tested on different graphs and compared considering several criteria.
|
|
|
Methods for Coloring Nodes in Multigraf
Knotek, Martin ; Kunovský, Jiří (referee) ; Šátek, Václav (advisor)
This thesis deals with algorithms for verticies coloring and their application to the coloring elements of electrical low voltage grid. Result of this thesis is a program, which displays progress of coloring five implemented algorithms on a selected graph. The graph represents electricity distribution network in a city.
|
guest ::
