|
|
The Shortest Graph's Pahts Finding
Jágr, Petr ; Ohlídal, Miloš (referee) ; Jaroš, Jiří (advisor)
The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a graph. For this task I use modifications of existing algorithms to achive the lowest time consumption of the computation. Modifications are established on Dijkstra's and Floyd-Warshall's algorithm. We also familiarize with Bellman-Ford algorithm.
|
|
|
Generating of the fault record for protection and fault indicator testing
Bažata, Petr ; Jinderle, Pavel (referee) ; Topolánek, David (advisor)
The thesis is focused on a presentation of a model creating which is followed by the simulation of running real network with using the compensatory elements to minimize the incurred failures. This thesis is divided into two thematic parts – the first theoretical one deals with the basis structuring of short-circuit faults and more detailed study of ineffective ground connection. Particularly this part attends to the problematic of a network description with extinguishing suppression. Using the compensation minimizes the impact of the failure state. A short-term fixing of a resistor improves the function of the ground-fault protection and helps to detect the outgoing section damaged by the defect. Furthermore the thesis indicates simulation programs, compares them and chooses the most suitable one for the next practical part. This is focused on a simulation of a real network run, together with elements for an effective defect-reduction or easier detection of ground connection. As a simulation of a ground short-circuit is the model in the end of the thesis modified on a network with an effective grounded bundle. Testing of the model correctness and creating a record of a model using the real ground protection settings is also one part of this thesis.
|
|
|
The Shortest Graph's Pahts Finding
Jágr, Petr ; Ohlídal, Miloš (referee) ; Jaroš, Jiří (advisor)
The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a graph. For this task I use modifications of existing algorithms to achive the lowest time consumption of the computation. Modifications are established on Dijkstra's and Floyd-Warshall's algorithm. We also familiarize with Bellman-Ford algorithm.
|
|
|
Generating of the fault record for protection and fault indicator testing
Bažata, Petr ; Jinderle, Pavel (referee) ; Topolánek, David (advisor)
The thesis is focused on a presentation of a model creating which is followed by the simulation of running real network with using the compensatory elements to minimize the incurred failures. This thesis is divided into two thematic parts – the first theoretical one deals with the basis structuring of short-circuit faults and more detailed study of ineffective ground connection. Particularly this part attends to the problematic of a network description with extinguishing suppression. Using the compensation minimizes the impact of the failure state. A short-term fixing of a resistor improves the function of the ground-fault protection and helps to detect the outgoing section damaged by the defect. Furthermore the thesis indicates simulation programs, compares them and chooses the most suitable one for the next practical part. This is focused on a simulation of a real network run, together with elements for an effective defect-reduction or easier detection of ground connection. As a simulation of a ground short-circuit is the model in the end of the thesis modified on a network with an effective grounded bundle. Testing of the model correctness and creating a record of a model using the real ground protection settings is also one part of this thesis.
|
guest ::
