|
|
Family Trees Making from Archive Records
Haltmar, Adam ; Zbořil, František (referee) ; Rozman, Jaroslav (advisor)
This thesis is about optimalization and increasing precision of already existing program for processing, comparing and linking archive records about people in a way to store them in a graph database while constructing family pedigrees as a side effect. It shows where the algorithm was approached badly and makes better alternatives for lowering the computation time. It also presents new methods for increasing the precision of record linking like name standardization and compares tests with the original program. Result of these changes is accelerating the program by more than 5000 %.
|
|
|
Process model of the switchgear laboratory
Paloš, Radek ; Bušov, Bohuslav (referee) ; Šimek, David (advisor)
This thesis deals with the issue of process optimization. Especially with two selected methods, Lean six sigma and TRIZ. Both of these methods are briefly described, especially we could find in this thesis chapters about history, options of usage, and description of selected tools for realization. The thesis also deals with the comparison between methods, including their advantages and disadvantages. The next part of the thesis is about process mapping of preparation before testing electrical devices in the UVEE department FEEC laboratory, which is part of BUT. Except process map, there is an analysis of each process, evaluation, and future possible optimization.
|
|
|
Registration of retinal image data using evolutionary algorithms
Matoušek, Šimon ; Mézl, Martin (referee) ; Odstrčilík, Jan (advisor)
This thesis deals with the registration of retinal images. Firstly, the introductory chapter summarizes the theory related to evolutionary algorithms and their practical application in the form of a literature search, then different approaches of retinal image registration and image transformation are described. At the same time, the anatomy of the eye as a key organ for visual perception is briefly introduced. In the practical part of the thesis, the method of registration of static and then dynamic retinal images is implemented using MATLAB software environment, and finally the results of different approaches are compared.
|
|
|
Optimizing the line-up of a sports team in a sallary capped league
Sabo, Adam ; Popela, Pavel (referee) ; Hrabec, Pavel (advisor)
This thesis is focused on the optimization of the lineup of a professional sports team operating under a salary cap condition. In the first part of the thesis, the theoretical foundations necessary for a proper understanding of the issue are introduced. Further, mathematical statistics and optimization methods are explained here and used in data analysis and in the creation of the relevant model. Particular emphasis is put on the methods of principal component analysis and linear programming. In the second part of the thesis, the problem of the optimization task, which takes into account the relevant NHL rules of competition and the salary cap together with performance characteristics of players, is formulated. The formulation was used to develop an optimization model that simulates real conditions in the NHL. This section also presents the application of the model based on historical data. Results obtained from calculations using the Python programming language are presented in the form of graphs, tables, and commentaries, showcasing the optimal team lineups, their characteristics, and respective rankings.
|
|
|
Evolutionary Design of Neural Networks
Kastner, Jan ; Hurta, Martin (referee) ; Sekanina, Lukáš (advisor)
The thesis deals with the implementation of a problem-solving method for the automated design of convolutional neural networks (CNN) architectures. The optimization of two fundamental and often conflicting characteristics, the number of parameters and the quality of CNN classification, is performed using a multi-criteria optimization genetic algorithm (NSGA-II). To encode this problem, the Cartesian genetic programming (CGP) technique is used, which enables the wide range of CNN architectures to be represented, and at the same time, the searched area can be appropriately limited by parameterization. Experiments were performed on the MNIST dataset to understand the effect of population size on the quality of the resulting solution. It is also evident from the results of the experiments that the quality of the architectures found can compete with already established models. This is therefore an alternative approach that does not require human intervention compared to manual design.
|
|
|
Improvement of turbocharger inlet manifold parameters
Kula, Štěpán ; Vacula, Jiří (referee) ; Novotný, Pavel (advisor)
The bachelor thesis deals with the design of a new elbow geometry to reduce the pressure drop in the inlet suction pipe of a turbocharger compressor. At the beginning of the thesis there is a description of the fluid flow and hydraulics losses that result in pressure loss in the pipe. Next, possible methods by which the shape of the piping can be optimized are described. The last, main section deals with the actual optimization of the elbow using the manual method and the Adaptive Single-Objective method, which succeeded in reducing the pressure losses and improving the outlet flow profile.
|
|
|
Optimization of the Manual Coil Wrapping Workplace
Válková, Aneta ; Machačová, Simona (referee) ; Videcká, Zdeňka (advisor)
This bachelor's thesis is focused on the optimization of the manual coil winding workplace in the Elektromotory Drásov spin-off plant of the Innomotics company. There are downtimes at the workplace due to excessive walking, which is the result of an inefficient layout of the workplace. In the theoretical part, individual concepts of process management in production are explained together with methods and tools for improving processes. In the analytical part, the company is described in more detail, especially its current state, including the waste that occurs here. In the design part, two proposals for a new workplace layout are created, which are further compared and, with the help of analyses, their savings in production time, excess walking and financial resources are evaluated.
|
|
|
Advanced Budget Optimization
Golasowski, Martin ; Janíček, Ladislav (referee) ; Popela, Pavel (advisor)
The aim of this diploma thesis is to show possibilities of mathematical modeling of creating budget of public universities in Czech republic based on a deeper study of the issue. In the first part of the work, the financing of universities in the Czech Republic is explained and according to what rules and patterns money is distributed to universities. In the next part, the basic knowledge regarding mathematical optimization and stochastic programming, including the creation of models, is presented. Subsequently, a model of stochastic nonlinear programming is compiled to optimize the distribution of funds from some funding sources to universities. In the last chapter, the model is implemented in the GAMS software and the obtained results are evaluated.
|
|
|
Tax and Accounting Aspects of Emploee Benefits from the Employer's Perspective
Balcárková, Hana ; Gláserová, Jana (referee) ; Křížová, Zuzana (advisor)
The bachelor's thesis is devoted to employee benefits from an accounting and tax point of view in a limited liability company. The first part characterizes the research from the professional literature on the given topic, which the bachelor's thesis deals with. The second part is devoted to the analysis of the current state of provided employee benefits in the company. And as part of the collection of analytical data, a questionnaire survey was conducted in the company. The last part of the work is based on the results of the analytical part and based on these results I suggest possible proposals for improving the current provision of employee benefits, which could increase employee satisfaction in the future.
|
|
|
Initialization for optimization of real world vehicle routing problem
Volf, Robin ; Klhůfek, Jan (referee) ; Sedlák, David (advisor)
The goal of this work is to optimize the initialization phase in solving the rich vehicle routing problem on a specific dataset which comes from a czech logistics company's data. This dataset has characteristics of VRPTW, VRPSPD and HFVRP. A modified cheapest insertion heuristic was chosen for the solution. Cost calculation consists of six partial costs which reflect individual constraints. Proposed heuristic is able to solve the instances in a matter of few seconds. Construction heuristic which generates valid solutions in short time enables more effective optimization in latter parts of solution.
|
guest ::
