|
|
Automation tasks for education
Kouba, Martin ; Holoubek, Tomáš (referee) ; Dosoudilová, Monika (advisor)
This bachelor's thesis focuses on the creation of educational tasks of Automation. The thesis includes three main types of control: logical control, continuous control, and discrete control. Each type of control is described in a separate chapter with the basic theory, which is subsequently applied to sample examples including the solution process. For practice purposes, unsolved examples with solution results are provided at the end of each chapter
|
|
|
Design of automated terrarium
Heczko, Dominik ; Cejpek, Zdeněk (referee) ; Dosoudilová, Monika (advisor)
The thesis deals with the design of automated terrarium for breeding corn snake. The terrarium will be automated using programmable logic controller Siemens LOGO!. The design of the terrarium, including a description of the concept, selection of components and description of the control program is the main goal of the presented work. The basic theory of logical control and FBD programming were used for our purpose. The automation system was constructed and tested in real conditions finally.
|
|
|
Design of automated terrarium
Heczko, Dominik ; Cejpek, Zdeněk (referee) ; Dosoudilová, Monika (advisor)
The thesis deals with the design of automated terrarium for breeding corn snake. The terrarium will be automated using programmable logic controller Siemens LOGO!. The design of the terrarium, including a description of the concept, selection of components and description of the control program is the main goal of the presented work. The basic theory of logical control and FBD programming were used for our purpose. The automation system was constructed and tested in real conditions finally.
|
|
|
The Optimisation Of Large Scale Logical Circuits
Seda, Pavel
In the phase of designing the logical circuits, it is essential to minimise the number of elements because it leads to the more reliable, more secure, and cheaper solution. For the logical functions with less than 4 variables, the Karnaugh maps are suitable. However, in practice, we encounter usually a much more complex function, in those cases, we could apply Boolean algebra laws directly or use the Quine-McCluskey method, which is based on their systematic use. Unfortunately, this method does not usually provide a minimal form of logical function for really large scale logical functions, and in a result may be redundant expressions. For that reason, we show that we could apply an additional phase which leads to the set covering problem which needs to cover all the inputs by the obtained outputs. Since this problem is N P-hard, it is necessary to use heuristic methods, such as simulated annealing.
|
guest ::
