|
|
Methods of Social Network Analysis for Data Mining
Machulka, Tomáš ; Rozman, Jaroslav (referee) ; Samek, Jan (advisor)
This bachelor thesis describes some of many methods for social network analysis. There is also a description of the data visualization. The thesis contains description of implementation of aplication for social network analysis using several methods. Output of analysis is confronted with output of other software for social network analysis.
|
|
|
Network simplex method
Khýr, Lukáš ; Janošťák, František (referee) ; Popela, Pavel (advisor)
This thesis is focused on summary knowledges relating to mathematical modeling in optimization area. We will deal with simplex method in detail and especially its network modification, which is used in various practical applications. We will solve tasks of various sizes and compare their solutions using implementation these two methods in Matlab. There is solved a task with real data provided by the Institute of Process Engineering at the end of the work.
|
|
|
Graph Isomorphism Problem in Databases
Stejskal, Roman ; Jirák, Ota (referee) ; Chmelař, Petr (advisor)
This project introduces history and basic notions of the graph theory. It describes graph theory problems, possible graph representations and practical graph management in databases. Aims to subgraph and graph isomorphism. It describes possible ways to find graph isomorphism and chosen algorithms for subgraph and graph isomorphism. The experimental part aims to comparing two implemented algorithms. These are Ullmann and VF2 algorithm. Also searches difference between graphs stored in memory and graphs stored in database.
|
|
|
Systems for remote measurement in power engineering
Hudec, Lukáš ; Mlýnek, Petr (referee) ; Mišurec, Jiří (advisor)
The work deals with the measurement and management in power. Provides an introduction to the problems of remote meter reading, management, and describes the current situation in the field of modern technologies Smart metering and Smart grids. It also analyzed the issue of collection of networks and data collection from a large number of meters over a wide area. For the purpose of data transmission are described GPRS, PLC, DSL, ... Further, there are given options to streamline communication. This area is used hierarchical aggregation. Using k-means algorithm is a program designed to calculate the number of concentrators and their location in the group of meters. The finished program is written in Java. It has a graphical interface and shows how the calculation is conducted. To verify the results of the optimization program is given simulation model in OPNET Modeler tool. Audited results are described in the conclusion and can deduce that using the optimization program is to streamline communications.
|
|
|
Optimization of rail waste transportation
Ambrozková, Anna ; Hrabec, Dušan (referee) ; Pavlas, Martin (advisor)
The bachelor thesis focuses on optimization of rail waste transportation. Theoretical part is about graph theory and optimization, where is introduced for example representation of graphs, network flows or linear programming. Practical part deals with comparison of road and rail networks, motivational example and at least with the application on real data of whole Czech Republic.
|
|
|
Optimization in Logistics
Huclová, Alena ; Škapa, Stanislav (referee) ; Popela, Pavel (advisor)
The thesis is focused on the optimization of models of transportation and transshipment problem with random demand, additional edges, and dynamic pricing. The theoretical part of the thesis introduces mathematical models of transportation. The software GAMS, which is used for the solution, is all so described. The practical part is a split among chapters and implements the described models by using real data.
|
|
|
Segmentation of hippocampus in MRI data
Kodym, Oldřich ; Chmelík, Jiří (referee) ; Walek, Petr (advisor)
The thesis deals with application of graph-based methods in segmentation of low contrast image data, specifically hippocampus segmentation from magnetic resonance data. Firstly, basics and terminology of graph theory is introduced. Next, minimum graph cut method is explained along with algorithms capable of finding this cut. After that comes the description of its implementation for 2D and 3D image data segmentation. Method was tested on sample data and then implemented as a 3D Slicer software module. Here the method was tested on the hipocampus data of healthy patients as well as patients suffering from Alzheimer’s disease. Most common problems occuring during the segmentation were forshadowed as well as possible ways to solve them.
|
|
|
Mathematical models for transportation problems
Votavová, Helena ; Novotný, Jan (referee) ; Popela, Pavel (advisor)
The thesis deals with modelling and solution techniques for the selected transportation problems. Firstly, historical remarks and application-related comments are introduced. Then the selected transportation problems are defined and mathematical programming and graph theory concepts are utilised to model them. The travelling salesman problem and suitable algorithms are under focus. The original implementation in GAMS and Python is discussed. Algorithms have been tested for the instance based on the set of 73 towns in the Czech Republic. Finally, the test results are evaluated and compared.
|
|
|
Selected optimization models in logistics
Málek, Martin ; Pavlas, Martin (referee) ; Popela, Pavel (advisor)
The bachelor thesis focuses on optimization models in logistics, which are solved by linear programming. Theoretical part introduces basic terms of graph theory, optimization, linear programming and network flows. Practical part contains mathematical models, their implementation, and obtained results. Furthermore, real-world application is solved at the end.
|
|
|
Stochastic Programming for Engineering Design
Hrabec, Dušan ; Roupec, Jan (referee) ; Popela, Pavel (advisor)
Stochastické programování a optimalizace jsou velmi užitečné nástroje pro řešení široké škály inženýrských úloh zahrnujících neurčitost. Diplomová práce se zabývá stochastickým programováním a jeho aplikací při řešení logistických úloh. Teoretická část práce je věnována jak základním pojmům z teorie grafů, tak pojmům souvisejících s matematickým, lineárním, celočíselným a stochastickým programováním. Pozornost je věnována také návaznosti zmíněných pojmů na logistiku. Druhá část se zabývá tvorbou vlastních úloh prezentujících stochastické logistické modely, jejich implementací a výsledky.
|
guest ::
