|
| |
|
|
A Design of a Portion of Web Application for Overhead Cost Calculation
Florians, Patrik ; Luhan, Jan (referee) ; Neuwirth, Bernard (advisor)
Subject of this thesis is to design a web application for overhead calculation, whose purpose is to be a substitution for presently used solution, which is considered to be deprecated. This is being done as a part of strategy of SAP SE corporation for which the solution is designed. This ambition to develop and improve cloud portfolio of already existing applications of the company should lead to betterment of already existing applications of this type and in a long run an improvement of the company’s market position as well as it’s products. The thesis is divided into 3 parts. It begins with a description of theoretical concepts, tools and principles, which are then utilized in further chapters. The following chapter analyzes current state of the affairs, where it is illustrated, what the current solution looks like along with key parts of it. The final, 3rd chapter is dedicated to a description of implemented solution and it also closely describes key differences mentioned in chapter 2.
|
|
|
Control of concrete mixcure technology
Kurimai, Igor ; Mádl,, Pavel (referee) ; Zezulka, František (advisor)
Thesis presents control of concrete mixcure technology Prefa Brno – production plant Strážnice. It deals with areas of process control system using the control system Siemens S7 – 300. The first part of thesis describes concrete mixcure technology and control system SIMATIC S7 – 300. Algorithms, used for control of concrete mixcure technology, are designed in the next part of thesis. Further it is discussed control program and connection to the system SCADA. Time frame of process is described in the finally. There are defined critical processes, which can occur in the control. In the next the thesis deals with hardware performance for different types of concrete mixcure technology. The results of introduction control system into industrial process are analysed at the end.
|
|
|
Longest Prefix Match Search
Chrastina, Ondřej ; Puš, Viktor (referee) ; Tobola, Jiří (advisor)
This thesis deals with the problem of an efective routing and a data clasification in computer networks, in particular searching for the longest prefix match for the internet protocol of version 6. First the algorithm, Binary Trie, Level Compressed Trie, Lulea Compressed Trie and Binary Search on Intervals, are described and then tested to find the the most suitable algorithm from the viewpoint of memory requirements and the speed of the searching.
|
|
|
Optimized design of reinforcement of concrete cross section
Hudyma, Nazar ; Laníková, Ivana (referee) ; Štěpánek, Petr (advisor)
The subject of this thesis is the optimization of design variables of reinforced concrete cross-section, especially its reinforcement. To solve this problem, it was first necessary to elaborate a search section that discusses various methods and approaches for solving the problem. The research part also includes processing and evaluation of tasks solved by other authors in available literature. For the optimization task, in the following parts both the general formulation and the detailed formulation of the partial parts of the concrete reinforcement structure optimization process are processed. As an example of optimization, a simple beam is chosen, which is subjected to bending moment and normal force one load case, where the example will be divided according to the formulation of both the function and the vector of unknown parameters (variables) defining the exact shape and properties of the reinforced concrete section. The examples will then be tested with regard to the speed of convergence and the degree of deviation between the best solutions found for each optimization algorithm used. At the end there will be a comparison and evaluation of the solution of the given task, as well as a summary of the whole bachelor thesis with reference to another possible direction in the optimization problems focused on reinforced concrete structures. In the appendices there will be a solution of selected examples.
|
|
|
Automated Checking of PC Status
Hodáň, Ján ; Řezníček, Ivo (referee) ; Zemčík, Pavel (advisor)
This thesis describes the design and implementation of automatic control of computer visualization. At the beginning computer control will be introduced. Familiarization with computers control procedures will take the place. Subsequently, another methods that can apply the control will be introduced. The main part of the work will be devoted to describe the basic skills that related to computer control. The last chapter will explain how visualization is implemented and how we evaluated the success of visualization. Result of the work is an application that visualize process and thanks to that control will be easier, faster, improved and automated.
|
|
|
Algorithmic Generation of Esthetical Rhytmical Sequences
Mahnert, Jakub ; Klepárník, Petr (referee) ; Beran, Vítězslav (advisor)
The goal of this project is to design and implement a system, suited for proving or disproving the claim that it is possible to generate unique rhythmical sequences, which a human will perceive as aesthetical. In the project, a framework, aiding the design of such algorithms that create rhythmical sequences using composition was implemented. On top of it, several such algorithms were implemented with the notion to test their performance using a custom testing front end solution. From the gained data, the project tries to find correlations between the aspects of the algorithms with the resulting perceived aesthetical value as well as attempt to answer the initial conundrum.
|
|
|
Component Interconnection Inference
Olšarová, Nela ; Rychlý, Marek (referee) ; Křivka, Zbyněk (advisor)
The Master Thesis deals with the design of hardware component interconnection inference algorithm that is supposed to be used in the FPGA schema editor that was integrated into educational integrated development environment VLAM IDE. The aim of the algorithm is to support user by finding an optimal interconnection of two given components. The editor and the development environment are implemented as an Eclipse plugin using GMF framework. A brief description of this technologies and the embedded systems design are followed by the design of the inference algorithm. This problem is a topic of combinatorial optimization, related to the bipartite matching and assignment problem. After this, the implementation of the algorithm is described, followed by tests and a summary of achieved results.
|
|
|
Internet library of methods and algorithms used for medical image registration
Koňařík, Jakub ; Fedra, Petr (referee) ; Peter, Roman (advisor)
Image registration is a procedure which is heading to search for a geometric transformation, which ensures same position, orientation and size of coresponding objects in pictures. How does these methods work? These methods and principies are explained in first part of this work. Second part of this work is aimed to explain theory about information systems and practical creation of the internet databaze. These practical part was realized in editorial system called Drupal.
|
|
| |
guest ::
