|
|
Automatic Creation of PLC Programs for Crane Models using TIA Portal Openness
Slanina, Václav ; Kaczmarczyk, Václav (referee) ; Arm, Jakub (advisor)
This thesis deals with TIA Portal Openness, its potential in terms of automating PLC program generation, compilation and management of individual devices. It aims to its basic features, such as working with hardware and network configuration, exporting and importing source files of blocks, and demonstrates them on a simple application for crane models. For generation, a desktop application was created as a practical example for easy understanding of this topic. It is possible to get basic overview of this tool and it’s aplication from this thesis.
|
|
|
Design of the control program for industrial robot IRB 120 using RobotStudio software
Nevřiva, Václav ; Lang, Stanislav (referee) ; Parák, Roman (advisor)
The aim of the bachelor thesis is to design a control program for a selected laboratory task in RobotStudio program, its implementation for the industrial robot IRB 120 from ABB Robotics and to verify the proposed solution by simulation and test on real hardware. The introductory part introduces ABB, company products and the development environment. The following chapters describe the selected laboratory task, its solution and testing of the proposed program. The bachelor thesis was extended with the design of user interface for controlling the task and demonstration of working with the robot using virtual reality.
|
|
|
The robotic manipulator for the Hanoi towers solving
Spáčil, Radim ; Zuth, Daniel (referee) ; Marada, Tomáš (advisor)
Main theme of the bachelor’s thesis is to design and manufacture a manipulator which can solve mathematic issue called the Hanoi towers. Main goal is to make a machine, which will automatically solve the above mentioned mathematic issue and will server for institute of automation and informatics for presentational purposes. This thesis contains of choosing the proper mechanical solution. Chosen solution will be afterwards design in Autodesk Inventor 2015 programme. Unique components which cannot be bought will be made by using 3D printer and machine will be assembled and then control by micro controller Arduino Mega 2560.
|
|
|
String Searching and Rekursive Algorithms in C Language
Porč, Jiří ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
The problem of finding a specified pattern in a text is one of the most frequently used tasks in the computers field. My work deals with the problems of searching and recursive algorithms. The objective of my work is to create programs for animated demonstration of selected algorithms and rewriting of the Study supporting materials for the course Algorithms into the C language. The created demonstrational programs are dealing with the problems of searching text strings in a text and recursion.
|
|
|
Quantitative analysis of data backup schemes
Süss, Ivo ; Smékal, David (referee) ; Burda, Karel (advisor)
The aim of master thesis was to create a program for the quantitative analysis of data backup schemes and with its help to identify and analyze the properties of commonly used schemes for different loads. Based on the obtained results, compile a set of principles for choosing the optimal data backup scheme. The program was created by Matlab. It can be used to find out parameters for individual backup schemes: Parameters C (total backup volume) and E (medium volume of recovery backups), backups size of individual days, workload of individual storages, cost of storages and cost of overall backup scheme, size the total amount of data written per storage per time slot. At the end of the thesis is defined a scheme for choosing the optimal backup scheme.
|
|
|
Classic problems in combinatorics
Stodolová, Kristýna ; Slavík, Antonín (advisor) ; Calda, Emil (referee)
This work is concerned with five problems in combinatorics. In Josephus problem, people are standing in a circle or in a row and every q-th is executed until only one person remains. We show how to find the survivor, and discuss the generalization when each person has more lives. In Tower of Hanoi, we study the numbers and properties of moves necessary to transport the tower from one rod to another, where the total number of rods is either three or four. We mention related problems with restrictions on the legal moves. In ménage problem, we calculate the number of seatings of couples around a table such that men and women alternate and nobody sits next to his or her partner. We also discuss permutations with restricted positions and rook polynomials. In ballot problem, we consider two candidates competing against each other and calculate the probability that, throughout the count, the first candidate always had more votes than k times the number of votes of the second one; we also mention the relation to Catalan numbers. In Kirkman's schoolgirl problem, the task is to find a weekly schedule for fifteen girls walking daily out in triads so that no two go together more than once. We also discuss the social golfer problem and Schurig's tables.
|
|
|
Quantitative analysis of data backup schemes
Süss, Ivo ; Smékal, David (referee) ; Burda, Karel (advisor)
The aim of master thesis was to create a program for the quantitative analysis of data backup schemes and with its help to identify and analyze the properties of commonly used schemes for different loads. Based on the obtained results, compile a set of principles for choosing the optimal data backup scheme. The program was created by Matlab. It can be used to find out parameters for individual backup schemes: Parameters C (total backup volume) and E (medium volume of recovery backups), backups size of individual days, workload of individual storages, cost of storages and cost of overall backup scheme, size the total amount of data written per storage per time slot. At the end of the thesis is defined a scheme for choosing the optimal backup scheme.
|
|
|
Design of the control program for industrial robot IRB 120 using RobotStudio software
Nevřiva, Václav ; Lang, Stanislav (referee) ; Parák, Roman (advisor)
The aim of the bachelor thesis is to design a control program for a selected laboratory task in RobotStudio program, its implementation for the industrial robot IRB 120 from ABB Robotics and to verify the proposed solution by simulation and test on real hardware. The introductory part introduces ABB, company products and the development environment. The following chapters describe the selected laboratory task, its solution and testing of the proposed program. The bachelor thesis was extended with the design of user interface for controlling the task and demonstration of working with the robot using virtual reality.
|
|
|
Automatic Creation of PLC Programs for Crane Models using TIA Portal Openness
Slanina, Václav ; Kaczmarczyk, Václav (referee) ; Arm, Jakub (advisor)
This thesis deals with TIA Portal Openness, its potential in terms of automating PLC program generation, compilation and management of individual devices. It aims to its basic features, such as working with hardware and network configuration, exporting and importing source files of blocks, and demonstrates them on a simple application for crane models. For generation, a desktop application was created as a practical example for easy understanding of this topic. It is possible to get basic overview of this tool and it’s aplication from this thesis.
|
|
|
Classic problems in combinatorics
Stodolová, Kristýna ; Slavík, Antonín (advisor) ; Calda, Emil (referee)
This work is concerned with five problems in combinatorics. In Josephus problem, people are standing in a circle or in a row and every q-th is executed until only one person remains. We show how to find the survivor, and discuss the generalization when each person has more lives. In Tower of Hanoi, we study the numbers and properties of moves necessary to transport the tower from one rod to another, where the total number of rods is either three or four. We mention related problems with restrictions on the legal moves. In ménage problem, we calculate the number of seatings of couples around a table such that men and women alternate and nobody sits next to his or her partner. We also discuss permutations with restricted positions and rook polynomials. In ballot problem, we consider two candidates competing against each other and calculate the probability that, throughout the count, the first candidate always had more votes than k times the number of votes of the second one; we also mention the relation to Catalan numbers. In Kirkman's schoolgirl problem, the task is to find a weekly schedule for fifteen girls walking daily out in triads so that no two go together more than once. We also discuss the social golfer problem and Schurig's tables.
|
guest ::
