National Repository of Grey Literature 218 records found  previous11 - 20nextend  jump to record: Search took 0.00 seconds. 
Optimization of concrete structures using stochastic optimization methods
Slowik, Ondřej ; Pukl,, Radomír (referee) ; Novák, Drahomír (advisor)
The thesis focuses the reader on the sense of optimization and its importance for civil engineering. It outlines the principles used by some optimization methods and discusses the possibility of combination of any type of methods LHS with other optimization method. The result is a new type of optimization method named Nested LHS described in the text of the third chapter. The fifth chapter applies some of the lessons learned to solve practical optimization problem - reinforced concrete bridge solved by nonlinear finite element analysis using pseudostochastic optimization method LHS mean.
Creating 3D Model of Temporomandibular Joint
Šmirg, Ondřej ; Bartušek, Karel (referee) ; Liberda,, Ondřej (referee) ; Smékal, Zdeněk (advisor)
The dissertation thesis deals with 3D reconstruction of the temporomandibular joint from 2D slices of tissue obtained by magnetic resonance. The current practice uses 2D MRI slices in diagnosing. 3D models have many advantages for the diagnosis, which are based on the knowledge of spatial information. Contemporary medicine uses 3D models of tissues, but with the temporomandibular joint tissues there is a problem with segmenting the articular disc. This small tissue, which has a low contrast and very similar statistical characteristics to its neighborhood, is very complicated to segment. For the segmentation of the articular disk new methods were developed based on the knowledge of the anatomy of the joint area of the disk and on the genetic-algorithm-based statistics. A set of 2D slices has different resolutions in the x-, y- and z-axes. An up-sampling algorithm, which seeks to preserve the shape properties of the tissue was developed to unify the resolutions in the axes. In the last phase of creating 3D models standard methods were used, but these methods for smoothing and decimating have different settings (number of polygons in the model, the number of iterations of the algorithm). As the aim of this thesis is to obtain the most precise model possible of the real tissue, it was necessary to establish an objective method by which it would be possible to set the algorithms so as to achieve the best compromise between the distortion and the model credibility achieve.
Traffic Signs Detection and Recognition
Číp, Pavel ; Honec, Peter (referee) ; Horák, Karel (advisor)
The thesis deals with traffic sign detection and recongnition in the urban environment and outside the town. A precondition for implementation of the system is built-in camera, usually in a car rear-view mirror. The camera scans the scene before the vehicle. The image data are transfered to the connected PC, where the data are transformation to information and evalutations. If the sign was detected the system is visually warned the driver. For a successful goal is divided into four separate blocks. The first part is the preparing of the image data. There are color segmentation with knowledge of color combination traffic signs in Czech Republic. Second part is deals with shape detection in segmentation image. Part number three is deals with recognition of inner pictogram and its finding in the image database. The final part is the visual output of displaying founded traffic signs. The thesis has been prepader so as to ensure detection of all relevant traffic signs in three basic color combinations according to existing by Decree of Ministry of Transport of Czech Republic. The result is the source code for the program MATLAB. .
Image registration of ultrasound sequences using evolutionary algorithms
Hnízdilová, Bohdana ; Odstrčilík, Jan (referee) ; Mézl, Martin (advisor)
This master´s thesis deals with the registration of ultrasound sequences using evolutionary algorithms. The theoretical part of the thesis describes the process of image registration and its optimalization using genetic and metaheuristic algorithms. The thesis also presents problems that may occur during the registration of ultrasonographic images and various approaches to their registration. In the practical part of the work, several optimization methods for the registration of a number of sequences were implemented and compared.
Optimization of Investment Strategy Using Genetic Algorithms
Novák, Tomáš ; Brázdil, Jiří (referee) ; Budík, Jan (advisor)
This thesis is focused on the design and optimization of automated trading system, which will be traded in FOREX. The aim is to create a business strategy that is relatively safe, stable and profitable. Optimization and testing on historical data are a prerequisite for the deployment into real trading.
Intelligent Web Work Planner
Kmeť, Miroslav ; Vrábel, Lukáš (referee) ; Čermák, Martin (advisor)
This thesis describes basic principles governing the use of evolutionary algorithms. Thesis deals with the usage of the evolutionary algorithms for scheduling the work between group of employees. Genetic algorithms, which represents intelligent stochastic optimization techniques based on the mechanism of natural selection and genetics are mainly used to solve this problem. Each solution is represented as an individual in population and only the most adapted ones are selected for the process of reproduction.
Automated Planning and Scheduling in Manufacturing
Bucher, Michal ; Kočí, Radek (referee) ; Hrubý, Martin (advisor)
Thesis deals with a problem of automated planning and scheduling in manufacturing. Problem is formally defined by mathematical model Resource Constrained Project Scheduling Problem. Based on this model scheduling system was developed, which is using the optimizer based on Genetic algoritms. Developed system was then tested in real manufacturing. System can also visualize schedules in form of Gantt chart.
Optimization of network position prediction
Pospíšil, Petr ; Pfeifer, Václav (referee) ; Burget, Radim (advisor)
This work is about position prediction in network, it is focused to find Landmark closest to the Host in the network (with lowest distance vector). The algorithm is based on GNP system. In terms of GNP system simulation was selected method for mathematical part of position prediction. The method was Simplex Downhill. The designed algorithm was implemented in Java. In the first step chose Host continent by meassuring the distance vector. In next step is selected nearest part in the continent. In conclusion estimate Host its position and then closest Landmark. Results from this work is important for designing TTP protocol. The verdict is that the GNP can be used for TTP, but Landmarks must be located in uniform density.
MES systems
Štrublíková, Iva ; Kantor, Tomáš (referee) ; Simeonov, Simeon (advisor)
The content of the diploma thesis is a description of the functions and features of the production control systems - MES (manufacturing execution systems), an analysis of these systems implemented in The Czech Republic, an elaboration of the system proposal of an intelligent production control system and retrieving new algorithms and functions according to which these systems can by formed. The MES systems analysis is performed by comparing implemented systems to the modules of production control systems conformably to MESA international. In the system suggestion there will be the intelligent component formed by automatic analysis of the effect of the order delay in production - automatic Gantt chart comparison of the plan versus reality. According to the adjusted system parameters it will separately make decisions about production scheduling. Searching new algorithms and functions will proceed in the reagions of artificial intelligence - genetic algorithms, holonic and multiagent systems, experts systems.
Evolution of CoreWar Warriors by Means of Genetic Algorithms
Tříska, Martin ; Beran, Vítězslav (referee) ; Zuzaňák, Jiří (advisor)
Evolutionary algorithms are a progressive and constantly evolving part of computer science. They are used mainly to solve the multidimensional problems with many local maxima, which are impossible to solve analytically. This thesis discusses how to use them for creating programs in Redcode language, which will be able to fight by the rules of game Corewars. Suggests possible representations of programs written in Redcode for evolutionary algorithms, discusses platform for evaluating their fitness and possible implementations of crossover and mutation. This thesis also contains application capable of development of such programs.

National Repository of Grey Literature : 218 records found   previous11 - 20nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.