|
Webová aplikace pro zadávání, odevzdávání a automatickou kontrolu programátorských prací
LÍSKOVEC, Kryštof
This bachelor's thesis focuses on analysis, design and implementation of a system used for assigning, handing in and automatically checking programming assignments. Analysis was based on functional and non-functional requirements and user needs. It's designed to streamline the evaluation process of programming tasks and provide lecturers with an efficient and intuitive tool for assigning programming tasks to students. Students are able to access the assignments through the same application and submit their solutions. Within the application is set of tools that automate the process of evaluating source code from students. After the evalution the source code is graded based on it's inputs and results are displayed to the user submitting it.
|
| |
|
Methods for Playing the Game 'Liar's Dice' Using Dynamic Programming
Lohn, Marek ; Šátek, Václav (referee) ; Zbořil, František (advisor)
This project is about Methods of playing game Liar’s Dice using dynamic programming. The algorithm that was chosen for my study is SARSA, short for State Action Reward State Action algorithm. It is a modified version of algorithm named Q-Learning. It comparing algorithm SARSA with other algorithms by letting them play against each other in application, that was made in Unity Engine. Algorithms that were compared to SARSA are Q-Learning and Counterfactual Regret Minimization. SARSA achieved a 69,147 % win ratio in a game against Q-Learning. In games against Counterfactual Regret Minimization it was only 25 % win ratio. The main outcome of this study is that modified SARSA is effective against Q-Learning algorithm in a game of Liar’s Dice. On the other hand the SARSA algorithm was very ineffective against the Counterfactual Regret Minimization algorithm.
|
|
Production of pulley for micro-belts at SPN 12CNC/Sinumerik 810D
Juránek, Martin ; Dvořák, Jaromír (referee) ; Píška, Miroslav (advisor)
As the tittle itself suggests, this thesis deals with the production of two two poly-V pulleys on the lathe SPN 12 CNC. In the first chapter, the thesis mentions transmissions and its types. Furthermore, the main advantages of poly-V pulleys compared to classic V-pulleys are outlined here. There is also geometry and calculation relationships of power ratios in a simple belt transmission. The practical part suggests several methods of creating a possible CNC program for the production of the grooves themselves. The practical part suggests several methods of creating a possible CNC program for the production of the grooves themselves. Among the possible methods, the contour creation method using incremental programming is used, and 6 grooves are created using the FOR counting loop. The work is also supplemented about the methodology for measuring the functional dimensions of the grooves, and there is also the measurement of the parameters of the insert with which the grooves were made.
|
|
InSpec Software Programming for SOL311 Optical CMM
Kellerová, Michaela ; Jankových, Róbert (referee) ; Polzer, Aleš (advisor)
This diploma thesis is devoted to the issue of programming in the InSpec software and the evaluation of the achieved measurement results. The theoretical part is devoted to the current state in the area of coordinate measuring machines and the system area focused on the influences acting on user programming. The practical part is devoted to the design of devices intended for measurement and assessment of the achieved measurement results.
|
|
Design and simulation of branch predictor
Liberda, Dominik ; Dvořák, Vojtěch (referee) ; Fujcik, Lukáš (advisor)
Predikce větvení hraje fundamentální roli ve výkonu procesorů. Predikce výsledku větví umožňuje procesoru spekulativně vykonávat instrukce dřív než je výsledek větve znám. Tato práce navrhuje vylepšený algoritmus pro predikci větvení a zároveň přepracovává simulační framework CBP2016 pro testování prediktorů větvení.
|
|
Virtual commissioning of robotic loading of workpieces into the machine tool
Grünwaldová, Kristýna ; Knoflíček, Radek (referee) ; Vetiška, Jan (advisor)
This thesis deals with virtual commissioning of the manipulation station using a robot, while it is a replacement of a workplace that was originally operated by employees. The aim is to make production more efficient by means of robotic loading of workpieces into the machine tool. The thesis describes a sequence of stages that lead to the virtual commissioning of the robotized workpiece placement in the RobotStudio program so that the workplace can be automated. First, it was necessary to design a new concept for the original workplace, then to create this concept in the RobotStudio program, and then to operate the individual elements of the entire workplace and to create a sequence of actions connected to each other as it would be during real operation. In the thesis the connection with the real workplace was not considered, the workplace was put into operation only virtually.
|
|
Robotic Process Automation
Andres, Theodore ; Koch, Miloš (referee) ; Novák, Lukáš (advisor)
The Bachelor's thesis focuses on identifying a process suitable for automation within the corporate environment using RPA technology. It includes theoretical foundations and an analysis of the current state of the company. As part of the proposed solutions, a process for automation is identified, followed by project management and project evaluation.
|
|
Methods for Playing the Game 'Liar's Dice' Using Dynamic Programming
Lohn, Marek ; Šátek, Václav (referee) ; Zbořil, František (advisor)
This project is about Methods of playing game Liar's Dice using dynamic programming. The algorithm that I chose for my study is SARSA, short for State Action Reward State Action algorithm. It is a modified version of algorithm named Q-Learning. I compared SARSA with other algorithms by letting them play against each other in application that I made in Unity Engine. Algorithms that I compared to SARSA are Q-Learning and Counterfactual Regret Minimization. I achieved a 69,147\,\% win ratio in a game against Q-Learning. In games against Counterfactual Regret Minimization it was only 29,84\,\% win ratio. The main outcome of this study is that SARSA, modified version of Q-Learning is effective against Q-Learning algorithm. On the other hand the SARSA algorithm was very ineffective against the Counterfactual Regret Minimization algorithm.
|
|
Bus wiring systems for complex building management
Mokrý, Lukáš ; Macháček, Jan (referee) ; Bátora, Branislav (advisor)
The aim of my thesis is to examine current opportunities of bus wiring systems for complex building management, mainly its power and economic evaluation. It can be simply called intelligent electrical installation. I will examine two systems from INELS and ABB company. These systems contain functional components, mainly modules and controllers. By means of other materials, I’ll create a panel. Components will be placed there and electrically connected. After this, systems will be put into operation and programmed by means of their software. The next step is measuring of quatities during the various conditions of systems and consumption, which is one of the main aims of the thesis. Two apparatuses will be used for measuring. This thesis itself will contain theoretical analysis of systems, their description, using the way of operation and main advantages and disadvantages. Single components and complete process of measuring and working in laboratory will be described. An overall evaluation and comparison of the systems from various points of view, including the price, will be put together from results.
|