|
|
Transport optimization
Šimora, Peter ; Kučera, Luděk (advisor) ; Loebl, Martin (referee)
Considering decreasing reserves of oil and increasing population is necessary to talk about the question of logistics. We have chosen the railway transport. The advantages of railway transport are built railway system and the existing fleet of vehicles. The optimization and measuring are made at the railway network of Czech Republic. Packages are generated with the information of population of town, in which stations lie. For every package is chosen the optimal route. Packages are assigned to trains regard to decreasing the total number of traveled kilometers. Packages are placed to wagons regard to placing the most packages. We have found out that the total number of traveled kilometers in our algorithm is less by 36% than in the simple algorithm, at the optimal number of generated packages per hour.
|
|
|
Algebraické aspekty fuzzy logiky
Víta, Martin ; Kučera, Luděk (referee) ; Hájek, Petr (advisor)
In this thesis we study filters on algebras of fuzzy logics and their possible applications. We are going to generalize the notion of an implicative/ positive implicative/fantastic filter on BL-algebras by introducing a notion of R-S-filter. We state and prove some properties of R-S-filters and then we show the connection between characterization of R-S-filter and alternative axiomatization of a given logic. We are going to describe the way how to characterize given algebra of implicative logic via R-S-filters. We show that the results published in [1] and [3] are simple consequences of our theory. Next topics of this work are uniform spaces and uniform topologies. Filters are there used to set up so-called Leibnitz congruences. A set of this congruences on the algebra is a (sub)base of a uniformity that we are going to study. We are going to show that results published in [2] and [4] can be easily generalized for any implicative logics.
|
|
|
Preprocessor of a graph language
Švec, Petr ; Kučera, Luděk (advisor) ; Skopal, Tomáš (referee)
Úkolem bylo navrhnout grafový jazyk, ve kterém by bylo snadné napsaní libovolného grafového algoritmu. Kromě intuitivního psaní kódu byl kladen důraz i na jeho délku. Výsledkem je tedy množinové chápaní grafu (vysvětleno dále). K jazyku byl vytvořen program PSGraph jako preprocesor navrženého grafového jazyka, který ve spolupráci s určitým pluginem zkonvertuje vstupní algoritmus do jiného libovolného objektového jazyka, jako c, c++, c#, Java, Object Pascal, Delphi " .. K programu je v bakalářské verzi i plugin pro konverzi do c++, jehož vystup je psán jako counted-pointerl. Powered by TCPDF (www.tcpdf.org)
|
|
|
Simulation of long message routing
Bečka, Michal ; Mareš, Martin (referee) ; Kučera, Luděk (advisor)
This work deals with specific type of routing, created for directing long messages. The goal is to determine optimal settings for this routing by simulation. Part of the work is a design of a network node of a network for routing long messages, in VHDL language, this design is simulated for determining its performance. Another path is a simulation program for performance testing of various settings of this routing. By this program, optimal settings are determined for a network composed of the designed nodes, primarily for latency and network throughput. These settings are then implemented in the simulation program.
|
|
| |
|
|
Animation of file sorting algorithms
Louženský, Zdeněk ; Kryl, Rudolf (advisor) ; Kučera, Luděk (referee)
This bachelor's thesis describes main components of the Animator software project. Animator off ers studying of file sorting algorithms. Users can single-stop algorithms or watch tapes with sorted elements on variable oriented views. Algorithm progress may be in fluenced by changing variable values or elements placed on tapes. Users also may orient on examining algorithm efectivity using statistics collected during algorithm progress. It is possible to extend Animator by new views or file sorting algorithms.
|
|
| |
|
|
Routing simulation in wireless networks
Kouba, Jan ; Peterka, Jiří (referee) ; Kučera, Luděk (advisor)
This work deals with creation of system for routing simulation in wireless networks. System allows the user to enter relevant parameters for simulation and analyses the network. System can assign simulation parameters automaticaly based on chosen algorithm. First it counts node output powers and second communication routes. It is easy to add new algorithms. System is focused on user friendliness and good extensionality. The objective was not to implement realistic model of real network, but to create system where could be new algorithms tested. There is described architecture of the system in the work, so one can continue with development.
|
|
|
Algorithm Visualisation
Vranec, Maroš ; Kučera, Luděk (referee) ; Senft, Martin (advisor)
Animelib is Java library, which visualizes data structures. It is designated for user-friendly visualization of algorithms. User-friendlyness is done in two ways - programmer of algorithm has much less graphics code to write (none ideally), and user - viewer should be pleased with what he sees.
|
|
|
HyperCuts pro filtrování Linuxových paketů
Mašíček, Viktor ; Peterka, Jiří (referee) ; Kučera, Luděk (advisor)
Filtering of packets by multidimensional cutting is one of the new approaches to the solution of the packet classiffication problem. It is based on creating a tree that contains the set rules of filtering. In this case a packets matching is considerably faster than linear traversing of all rules. The HyperCuts methods are one of the latest methods that use multidimensional cutting. At first sight the implementation of the HyperCuts method demonstrated its utility. However, the final decision about the usage of the HyperCuts program in practice can be made only on the basis of the results of testing in it is necessary to can be using in a practice it have to be tested in practical operation. In comparison with the PTree program, which is based on the TBF method, the HyperCuts program, was more successful. The comparison was based on resolving the problem rather than on implementation aspect or success with the same data. In case, where we use PTree source code for confrontation, we compare it with source code of HyperCuts from our implementation. We compare time and memory complexity. In the theoretic part there is explain why the "range match" was used. There is definition of term "cut" which is very advantageous for time and memory complexity. One of the goals of the work was HyperCuts method...
|
guest ::
