|
|
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.
|
|
|
Application of graph theory to the design and optimization data network architectures
Římský, Adam ; Trzos, Michal (referee) ; Novotný, Vít (advisor)
This masters'sthesis deals with graph theory and utilization of this theory for design and optimization of data network structures. Introduction chapter describes graph theory in general view, i.e. fundamental terms used for graph description, graph distinguishing, etc. Next part describes graph algorithms, for example a shortest path finding. After this I write about actual routing protocols where the graph algorithms are used. Last but one part deals with queuing theory and final part describes practical presentation of using graph theory for design and optimization of data network structure in Matlab programme environment.
|
|
|
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.
|
|
|
Game theory on graphs
Osička, Ondřej ; Vašík, Petr (referee) ; Hrdina, Jaroslav (advisor)
The subject of this thesis is to introduce game theory and cooperative game theory in relation to graph theory. Game in characteristic function form is used to model the cooperative game. The optimal division of payoff among the players is determined by means of Shapley value and game kernel. Examples of practical use are presented. To examine more complicated game network or to express relationship between players both directed and undirected graphs are used.
|
|
|
Mathematical models in logistics
Nevrlý, Vlastimír ; Holešovský, Jan (referee) ; Popela, Pavel (advisor)
The aim of the bachelor thesis is to model and generate test transportation networks, which are similar to real-world waste management networks. Several software tools (Mathematica, GAMS, Excel, VBA) are used to develop suitable procedures. The next task is to analyze dependence of computational complexity on the size of network by using statistical test computations. The existing original optimization model called NERUDA that supports decision-making in the eld of waste management is utilized. The obtained results are processed, analysed and interpreted in detail.
|
|
|
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.
|
|
| |
|
|
Use of mathematical modeling in social networks
Kříž, Jan ; Fábry, Jan (advisor) ; Kuncová, Martina (referee)
The aim of this work is to create a functional specification of mobile application newly emerging asocial network for generating meetings with friends. Generating will be divided into two phases. In the first phase, we will use a mathematical model which will generate appointments with those friends that the user meets the least. In the second phase, we will use a mathematical model and multi-criteria decision making process for invitation of maximum number of friends to this meeting. Using graph theory, we will develope an algorithm which will optimize the computing system over all its users. And finally, we will define functionality for meeting friends in partner establishments in the city, which will use the principle of finding the shortest path.
|
|
|
Graph theory – an alternative method of solving LP problems
Hrabovská, Michaela ; Šindelářová, Irena (advisor) ; Chýna, Vladislav (referee)
This bachelor thesis analyses an example of an alternative method of solving selected linear programming problems using graph theory. These alternative methods are explained not only theoretically, but also illustrated on the practical examples. For comparison, there is a theoretical description and also practical solution of selected problems with using linear programming stated in the text. In the introductory part of the thesis, the theory of operations research is briefly discussed. The selected problems are: knapsack problem, transportation problem, assignment problem.
|
|
|
Storing hierarchical and unstructured data with Java Content Repository
Pytelka, Petr ; Pavlíčková, Jarmila (advisor) ; Feuerlicht, Jiří (referee)
This paper discusses the possibilities of storing hierarchical and unstructured data using standards JSR-170 and JSR-283 - "Content Repository for Java". Background of this paper is the graph theory. A definition of hierarchical data that is based on this theory is presented in the paper. Other methods of storing data such as the file-system, the database systems and the content management systems are discussed. The paper provides a detailed description of standard JSR-283 itself and the available features thereof. This is followed by a comparison of relation-, object-relational databases and the features of the individual techniques of object-relational mapping. Reference implementation JackRabbit is described in detail. It includes the description of the relevant API and its configuration. A case study dealing with the realization of the internal structure of a document management system is a part of this paper. Some performance tests were carried out on the reference implementation; the results thereof are presented in the paper. The conclusion of the work provides for a set of criteria to determine situations where it is appropriate to use a repository compatible with JSR-170/283 to store hierarchical and unstructured data, or where reference implementation JackRabbit can be used.
|
guest ::
