Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Algoritmus PSO.
Dissertationen zum Thema „Algoritmus PSO“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Algoritmus PSO" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
1
Ondráček, Pavel. „Optimalizační techniky v obrazových aplikacích“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2021. http://www.nusl.cz/ntk/nusl-442498.
Der volle Inhalt der QuelleAnnotation:
This thesis deals with methods for optimization in image processing. There is described some of optimization techniques and some applications in image processing. There is also described detailed procedure and realization of bee algorithm, genetic algorithm, PSO algorithm and their realization in image registration, matched filtering, image segmentation and image reconstruction. Algorithms and their efficiencies are compared in the particular application for image processing.
2
Götthans, Tomáš. „Pokročilé algoritmy analýzy datových sekvencí v Matlabu“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218618.
Der volle Inhalt der QuelleAnnotation:
Cílem této práce je se seznámení s možnostmi programu Matlab z hlediska detailní analýzy deterministických dynamických systémů. Jedná se především o analýzu časové posloupnosti a o nalezení Lyapunových exponentů. Dalším cílem je navrhnout algoritmus umožňující specifikovat chování systému na základě znalosti příslušných diferenciálních rovnic. To znamená, nalezení chaotických systémů.
3
Kolářová, Jana. „Evoluční algoritmy pro ultrazvukovou perfúzní analýzu“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-401037.
Der volle Inhalt der QuelleAnnotation:
This master´s thesis is focused on the application of evolutionary algorithms for interleaving data obtained by ultrasound scanning of tissue. The interleaved curve serves to estimate perfusion parameters, thus allowing to detect possible pathophysiology in the scanned area. The theoretical introduction is devoted to perfusion and its parameters, contrast agents for ultrasonic application, ultrasonic modality scanning, optimization, evolutionary algorithms in general and two selected evolutionary algorithms - genetic algorithm and bee algorithm. These algorithms were tested on noisy data obtained from clinical images of mice with tumor. The final part summarizes the results of the practical part and provides suggestions and recommendations for further possible development.
4
Rusnák, Jakub. „Vizualizace algoritmů pro plánování cesty“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363819.
Der volle Inhalt der QuelleAnnotation:
Thesis describes library for algorithm vizualization. It helps to create user interface for application with algorithms. It’s usage is demonstrated on some pathfinding algorithms.These applications are presented on web page.
5
Hulva, Jiří. „Koevoluční algoritmus pro úlohy založené na testu“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236019.
Der volle Inhalt der QuelleAnnotation:
This thesis deals with the usage of coevolution in the task of symbolic regression. Symbolic regression is used for obtaining mathematical formula which approximates the measured data. It can be executed by genetic programming - a method from the category of evolutionary algorithms that is inspired by natural evolutionary processes. Coevolution works with multiple evolutionary processes that are running simultaneously and influencing each other. This work deals with the design and implementation of the application which performs symbolic regression using coevolution on test-based problems. The test set was generated by a new method, which allows to adjust its size dynamically. Functionality of the application was verified on a set of five test tasks. The results were compared with a coevolution algorithm with a fixed-sized test set. In three cases the new method needed lesser number of generations to find a solution of a desired quality, however, in most cases more data-point evaluations were required.
6
Volf, Lukáš. „Program pro testování rychlosti šifrovacích algoritmů“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218674.
Der volle Inhalt der QuelleAnnotation:
Program for testing of speed of encryption algorithms is project aimed to build a program, which will be able to test specific properties of each single encryption algorithm protocol and results of testing will be saved for later statistical analysis. Program is going to be build in C# program language. In statistical analysis part all data and results from testing of each single algorithm will be processed and reviewed in transparent reports.
7
Bodeček, Miroslav. „Algoritmus pro cílené doporučování produktů“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-412860.
Der volle Inhalt der QuelleAnnotation:
The goal of this project is to explore the problem of product recommendations in the area of e-commerce and to evaluate known techniques, design product recommendation system for an existing e-commerce site, implement it and test it. This report introduces the problem, briefly examines current state of affairs in this area and defines requirements for a product recommendation module. The concept of data mining in general is introduced. The report proceeds to present detailed design corresponding to defined requirements and summarizes data gathered during testing phase. It concludes with evaluation and with discussion of the remaining goals for this thesis.
8
Povalač, Karel. „Sledování spektra a optimalizace systémů s více nosnými pro kognitivní rádio“. Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-233577.
Der volle Inhalt der QuelleAnnotation:
The doctoral thesis deals with spectrum sensing and subsequent use of the frequency spectrum by multicarrier communication system, which parameters are set on the basis of the optimization technique. Adaptation settings can be made with respect to several requirements as well as state and occupancy of individual communication channels. The system, which is characterized above is often referred as cognitive radio. Equipments operating on cognitive radio principles will be widely used in the near future, because of frequency spectrum limitation. One of the main contributions of the work is the novel usage of the Kolmogorov – Smirnov statistical test as an alternative detection of primary user signal presence. The new fitness function for Particle Swarm Optimization (PSO) has been introduced and the Error Vector Magnitude (EVM) parameter has been used in the adaptive greedy algorithm and PSO optimization. The dissertation thesis also incorporates information about the reliability of the frequency spectrum sensing in the modified greedy algorithm. The proposed methods are verified by the simulations and the frequency domain energy detection is implemented on the development board with FPGA.
9
Melo, Leonardo Alves Moreira de. „Comparação de algoritmos de enxame de partículas para otimização de problemas em larga escala“. Universidade Federal de Goiás, 2018. http://repositorio.bc.ufg.br/tede/handle/tede/9108.
Der volle Inhalt der QuelleAnnotation:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2018-11-29T10:40:19Z
No. of bitstreams: 2
Dissertação - Leonardo Alves Moreira de Melo - 2018.pdf: 2693689 bytes, checksum: 850fbad5a82099825d2478ba3415dcac (MD5)
license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2018-11-29T11:09:58Z (GMT) No. of bitstreams: 2 Dissertação - Leonardo Alves Moreira de Melo - 2018.pdf: 2693689 bytes, checksum: 850fbad5a82099825d2478ba3415dcac (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2018-11-29T11:09:58Z (GMT). No. of bitstreams: 2 Dissertação - Leonardo Alves Moreira de Melo - 2018.pdf: 2693689 bytes, checksum: 850fbad5a82099825d2478ba3415dcac (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2018-10-26
Fundação de Amparo à Pesquisa do Estado de Goiás - FAPEG
In order to address an issue concerning the increasing number of algorithms based on particle swarm optimization (PSO) applied to solve large-scale optimization problems (up to 2000 variables), this article presents analysis and comparisons among five state- of-the-art PSO algorithms (CCPSO2, LSS- PSO, OBL-PSO, SPSO and VCPSO). Tests were performed to illustrate the e ciency and feasibility of using the algorithms for this type of problem. Six benchmark functions most commonly used in the literature (Ackley 1, Griewank, Rastrigin, Rosenbrock, Schwefel 1.2 and Sphere) were tested. The experiments were performed using a high-dimensional problem (500 variables), varying the number of particles (50, 100 and 200 particles) in each algorithm, thus increasing the computational complexity. The analysis showed that the CCPSO2 and OBL-PSO algorithms found significantly better solutions than the other algorithms for more complex multimodal problems (which most resemble realworld problems). However, considering unimodal functions, the CCPSO2 algorithm stood out before the others. Our results and experimental analysis suggest that CCPSO2 and OBL- PSO seem to be highly competitive optimization algorithms to solve complex and multimodal optimization problems.
O número de algoritmos baseados na otimização por enxame de partículas (PSO) aplicados para resolver problemas de otimização em grande escala (até 2.000 variáveis) aumentou significativamente. Este trabalho apresenta análises e comparações entre cinco algoritmos (CCPSO2, LSSPSO, OBL-CPSO, SPSO e VCPSO). Testes foram realizados para ilustrar a eficiência e viabilidade de usar os algoritmos para resolver problemas em larga escala. Seis funções de referência que são comumente utilizadas na literatura (Ackley 1, Griewank, Rastrigin, Rosenbrock, Schwefel 1.2 e Sphere) foram utilizadas para testar a performancedesses algoritmos. Os experimentos foram realizados utilizando um problema de alta dimensionalidade (500 variáveis), variando o número de partículas (50, 100 e 200 partículas) em cada algoritmo, aumentando assim a complexidade computacional. A análise mostrou que os algoritmos CCPSO2 e OBL-CPSO mostraram-se significativamente melhores que os outros algoritmos para problemas multimodais mais complexos (que mais se assemelham a problemas reais). No entanto, considerando as funções unimodais, o algoritmo CCPSO2 destacou-se perante os demais. Nossos resultados e análises experimentais sugerem que o CCPSO2 e o OBL-CPSO são algoritmos de otimização altamente competitivos para resolver problemas de otimização complexos e multimodais em larga escala.
10
Horáková, Pavla. „Optimalizace pro registraci obrazů založená na genetických algoritmech“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-219505.
Der volle Inhalt der QuelleAnnotation:
Diploma thesis is focused on global optimization methods and their utilization for medical image registration. The main aim is creation of the genetic algorithm and test its functionality on synthetic data. Besides test functions and test figures algorithm was subjected to real medical images. For this purpose was created graphical user interface with choise of parameters according to actual requirement. After adding an iterative gradient method it became of hybrid genetic algorithm.
11
Zeizinger, Lukáš. „Optimalizační algoritmus pro příhradové ocelové konstrukce“. Doctoral thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-433630.
Der volle Inhalt der QuelleAnnotation:
The work deals with the optimization of trusses construction building and transport machinery. The goal was to create an algorithm that can design an optimized design. The simulation took place on two experiments involving 52 sets of different entries, which are processed in detail into graphs. One-dimensional target mass or price function is used as part of optimization, but there is also an incorporated multidimensional purpose function. The finite element variation method for the beam system is used for the strength calculation of the truss structure and the genetic algorithm is used for optimization. At the end of the work, specific steps are formulated that lead to the most appropriate algorithm settings.
12
Vrábel, Lukáš. „Paralelní genetický algoritmus pro vícejádrové systémy“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237236.
Der volle Inhalt der QuelleAnnotation:
Genetický algoritmus je optimalizačná metóda zameraná na efektívne hľadanie riešení rozličných problémov. Je založená na princípe evolúcie a prirodzeného výberu najschopnejších jedincov v prírode. Keďže je táto metóda výpočtovo náročná, bolo vymyslených veľa spôsobov na jej paralelizáciu. Avšak väčšina týchto metód je z historických dôvodov založená na superpočítačoch alebo rozsiahlych počítačových systémoch. Moderný vývoj v oblasti informačných technológií prináša na trh osobných počítačov stále lacnejšie a výkonnejšie viacjadrové systémy. Táto práca sa zaoberá návrhom nových metód paralelizácie genetického algoritmu, ktoré sa snažia naplno využiť možnosti práve týchto počítačových systémov. Tieto metódy sú následne naimplementované v programovacom jazyku C za využitia knižnice OpenMP určenej na paralelizáciu. Implementácia je následne použitá na experimentálne ohodnotenie rozličných charakteristík každej z prezentovaných metód (zrýchlenie oproti sekvenčnej verzii, závislosť konvergencie výsledných hodnôt od miery paralelizácie alebo od vyťaženia procesoru, ...). V poslednej časti práce sú prezentované porovnania nameraných hodnôt a závery vyplývajúce z týchto meraní. Následne sú prediskutované možné vylepšenia daných metód vyplývajúce z týchto záverov, ako aj možnosti spracovania väčšieho množstva charakteristík na presnejšie ohodnotenie efektivity paralelizácie genetických algoritmov.
13
Kopáček, Petr. „Algoritmus ochranné funkce pro lokalizaci nesymetrie“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2020. http://www.nusl.cz/ntk/nusl-413129.
Der volle Inhalt der QuelleAnnotation:
The Master Thesis deals with a proposal of algorithm of a protective function for assymetric faults location in resistance-grounded medium voltage networks with decentralized measurement of instantaneous voltage and current values. The theoretical part describes a single pole fault in the resistance-grounded network including the network analysis using the symmetric component method. Furtherly follows brief reserse of nowadays considered possibilities of faults location in the medium voltage networks. The proposed algorithm which works on the principle of negative sequence changes and change differencies of voltage and current is described by mathematical operations and flowchart, and it is furtherly tested in the PSCAD simulator on the proposed network model. Also the algorithm is tested in the Matlab program using the real data from the local distribution network Pod Palackeho vrchem where the initial pilot implementation is assumed. The last part of the thesis includes also the algorithm sensitivity analysis.
14
Sem, Štěpán. „Algoritmy pro řešení speciálních problémů batohu a jejich výpočetní složitost“. Master's thesis, Vysoká škola ekonomická v Praze, 2010. http://www.nusl.cz/ntk/nusl-150159.
Der volle Inhalt der QuelleAnnotation:
The thesis deals with knapsack problems variants and possibility of their solving, furthermore with the impact of particular task (instance) special structure on the effciency of tested approach. The thesis also proposes conversion possibility between described tasks and their continuous extension (continuous relaxation). It describes L3 algorithm and superdecreasing knapsack problem solving from the common sort of algorithms and Monte Carlo Method, simulated annealing and genetic algorithms from the sort of probability ones. Other possibilities are also discussed. Integral part of this thesis is the accompanying application, which was used to create groundwork used in the text and which can be also used to solve other instances.
15
Muñoz, Jugo Cynthia Mariela. „Grafos con peso“. Universidad Peruana de Ciencias Aplicadas - UPC, 2007. http://hdl.handle.net/10757/272786.
Der volle Inhalt der Quelle
16
Esseghir, Mohamed Amir. „Metaheuristics for the feature selection problem : adaptive, memetic and swarm approaches“. Thesis, Artois, 2011. http://www.theses.fr/2011ARTO0206/document.
Der volle Inhalt der QuelleAnnotation:
Afin d’améliorer la qualité de prédiction des techniques de classification automatique et de fouilles de données, plusieurs modèles ont été proposés dans la littérature en vue d’extraire des connaissances à partir des données. Toutefois, avec l’expansion des systèmes d’information et des technologies associées, ces techniques d’apprentissage s’avèrent de moins en moins adaptées aux nouvelles tailles et dimensions des données. On s’intéresse dans cette étude aux problèmes de grande dimensionnalité et à l’amélioration du processus d’apprentissage des méthodes de classification à travers les techniques de filtrage et de sélection d’attributs. Le problème « d’identification d’attributs pertinents » (Feature Selection Problem), tel qu’il est défini dans la littérature, relève d’une nature combinatoire. Dans le cadre de cette thèse, on s’est intéressé au développement de nouvelles techniques d’optimisation approchées et spécifiques au problème traité ainsi qu’à l’amélioration d’algorithmes existants. La conception, l’implémentation et l’étude empirique ont montré l’efficacité et la pertinence des métaheuristiques proposéesAlthough the expansion of storage technologies, networking systems, and information system methodologies, the capabilities of conventional data processing techniques remain limited. The need to knowledge extraction, compact representation and data analysis are highly motivated by data expansion. Nevertheless, learning from data might be a complex task, particularly when it includes noisy, redundant and information-less attributes. Feature Selection (FS) tries to select the most relevant attributes from raw data, and hence guides the construction of final classification models or decision support systems. Selected features should be representative of the underlying data and provide effective usefulness to the targeted learning paradigm (i.e. classification). In this thesis, we investigate different optimization paradigms as well as its adaptation to the requirements of the feature selection challenges, namely the problem combinatorial nature. Both theoritical and empirical aspects were studied, and confirm the effectiveness of the adopted methodology as well as the proposed metaheuristic based approaches
17
Musil, David. „Algoritmus pro detekci pozitívního a negatívního textu“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2016. http://www.nusl.cz/ntk/nusl-242026.
Der volle Inhalt der QuelleAnnotation:
As information and communication technology develops swiftly, amount of information produced by various sources grows as well. Sorting and obtaining knowledge from this data requires significant effort which is not ensured easily by a human, meaning machine processing is taking place. Acquiring emotion from text data is an interesting area of research and it’s going through considerable expansion while being used widely. Purpose of this thesis is to create a system for positive and negative emotion detection from text along with evaluation of its performance. System was created with Java programming language and it allows training with use of large amount of data (known as Big Data), exploiting Spark library. Thesis describes structure and handling text from database used as source of input data. Classificator model was created with use of Support Vector Machines and optimized by the n-grams method.
18
Kratochvíl, Adam. „Algoritmus pro detekci úniku média z potrubí“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2020. http://www.nusl.cz/ntk/nusl-413267.
Der volle Inhalt der QuelleAnnotation:
The thesis deals with the presentation of an overview of the methods used for leak detection set by technical standards. Following the analysis of the pressure records from the pipeline, a new method is proposed, which is based on existing methods and uses the determination of the direction of arrival of the wave directly at the measurement station. The proposed concept was subsequently developed in Matlab, where the ability to detect was also verified. The whole algorithm was then implemented in programmable logic controllers and a suitable communication between them was designed. The entire solution was then tested in terms of functionality.
19
Bartoňová, Veronika. „Optimalizace bezpečnostních algoritmů pro smartkarty“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-374761.
Der volle Inhalt der QuelleAnnotation:
In this diploma thesis I dealt with proposal of optimization security algorithms calculations, that will be implemented on smartcards. This project is based on knowledge of modular arithmetic, that is used in many encryption like public keys, digital signatures and has function. The result of this project is a design of changes for accelerate the security algorithms calculations.
20
Lai, Chun-Hau. „Diseño e implementación de algoritmos aproximados de clustering balanceado en PSO“. Tesis, Universidad de Chile, 2012. http://www.repositorio.uchile.cl/handle/2250/111954.
Der volle Inhalt der QuelleAnnotation:
Magíster en Ciencias, Mención ComputaciónEste trabajo de tesis está dedicado al diseño e implementación de algoritmos aproximados que permiten explorar las mejores soluciones para el problema de Clustering Balanceado, el cual consiste en dividir un conjunto de n puntos en k clusters tal que cada cluster tenga como m ́ınimo ⌊ n ⌋ puntos, k y éstos deben estar lo más cercano posible al centroide de cada cluster. Estudiamos los algoritmos existentes para este problema y nuestro análisis muestra que éstos podrían fallar en entregar un resultado óptimo por la ausencia de la evaluación de los resultados en cada iteración del algoritmo. Entonces, recurrimos al concepto de Particles Swarms, que fue introducido inicialmente para simular el comportamiento social humano y que permite explorar todas las posibles soluciones de manera que se aproximen a la óptima rápidamente. Proponemos cuatro algoritmos basado en Particle Swarm Optimization (PSO): PSO-Hu ́ngaro, PSO-Gale-Shapley, PSO-Aborci ́on-Punto-Cercano y PSO-Convex-Hull, que aprovechan la característica de la generación aleatoria de los centroides por el algoritmo PSO, para asignar los puntos a estos centroides, logrando una solución más aproximada a la óptima. Evaluamos estos cuatro algoritmos con conjuntos de datos distribuidos en forma uniforme y no uniforme. Se encontró que para los conjuntos de datos distribuidos no uniformemente, es impredecible determinar cuál de los cuatro algoritmos propuestos llegaría a tener un mejor resultado de acuerdo al conjunto de métricas (intra-cluster-distancia, índice Davies-Doublin e índice Dunn). Por eso, nos concentramos con profundidad en el comportamiento de ellos para los conjuntos de datos distribuidos en forma uniforme. Durante el proceso de evaluación se descubrió que la formación de los clusters balanceados de los algoritmos PSO-Absorcion-Puntos-Importantes y PSO-Convex-Hull depende fuertemente del orden con que los centroides comienzan a absorber los puntos más cercanos. En cambio, los algoritmos PSO-Hungaro y PSO-Gale-Shapley solamente dependen de los centroides generados y no del orden de los clusters a crear. Se pudo concluir que el algoritmo PSO-Gale-Shapley presenta el rendimiento menos bueno para la creación de clusters balanceados, mientras que el algoritmo PSO-Hungaro presenta el rendimiento más eficiente para lograr el resultado esperado. Éste último está limitado al tamaño de los datos y la forma de distribución. Se descubrió finalmente que, para los conjuntos de datos de tamaños grandes, independiente de la forma de distribución, el algoritmo PSO-Convex-Hull supera a los demás, entregando mejor resultado según las métricas usadas.
21
Šandera, Čeněk. „Heuristické algoritmy pro optimalizaci“. Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2008. http://www.nusl.cz/ntk/nusl-228326.
Der volle Inhalt der QuelleAnnotation:
Práce se zabývá určením pravděpodobnostních rozdělení pro stochastické programování, při kterém jsou optimální hodnoty účelové funkce extrémní (minimální nebo maximální). Rozdělení se určuje pomocí heuristických metod, konkrétně pomocí genetických algoritmů, kde celá populace aproximuje hledané rozdělení. První kapitoly popisují obecně matematické a stochastické programování a dále jsou popsány různé heuristické metody a s důrazem na genetické algoritmy. Těžiště práce je v naprogramování daného algoritmu a otestování na úlohách lineárních a kvadratických stochastických modelů.
22
Komínek, Jan. „Heuristické algoritmy pro optimalizaci“. Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2012. http://www.nusl.cz/ntk/nusl-230306.
Der volle Inhalt der QuelleAnnotation:
This diploma thesis deals with genetic algorithms and their properties. Particular emphasis is placed on finding the influence of mutation and population size. Genetic algorithms are applied on inverse heat conduction problems (IHCP) in the second part of the thesis. Several different approaches and coding methods were tested. Properties of genetic algorithms were improved by definition of two new genetic operators – manipulation and sorting. Reported theoretical findings were tested on the real data of inverse heat conduction problem. The library for easy implementation of GA for solving general optimization problems in C ++ was created and is described in the last chapter.
23
Schulz, Roman. „Algoritmy pro zjednodušování modelů“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-235967.
Der volle Inhalt der QuelleAnnotation:
VYSOKÉ UČENÍ TECHNICKÉ V BRNĚ The purpose of this work is to design and implement a computer system, which should be used for simplification of a polygonal models in 3D space. The system should be allowed to reduce a given number of geometrical primitives from source object. User should have impact to the reducing process by selecting a method, size of target object etc. System uses 3DS file format for model loading and saving. Reader should understand principles of the polygon reduction and used algorithms.
24
Novák, Pavel. „Návrh řídicího algoritmu pro stabilizaci letadla“. Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2013. http://www.nusl.cz/ntk/nusl-230970.
Der volle Inhalt der QuelleAnnotation:
Master’s thesis: "Design of the control algorithm for aircraft stabilization" summarizes aircraft aerodynamics knowledge, from which nonlinear mathematical model of the aircraft and propeller propulsion system are created. Design of the control algorithm for angle position stabilization (for longitudinal motion) and the control algorithm for “Flight Path Angle hold“ and “Flight Level Change” modes is also presented here. Designed control algorithms are tested within the simulation of the real atmosphere at the end of the thesis.
25
Klimčíková, Iveta. „Implementace algoritmu pro shlukování hran grafu“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2015. http://www.nusl.cz/ntk/nusl-264934.
Der volle Inhalt der QuelleAnnotation:
The objective of the thesis is to explore graph layout and edge clustering to improve graph visibility and the overall edge crossings. A summary of tools focusing on improving of graph visualisation is given. The thesis describes in more details a method of geometry--based edge clustering. Further, the method is implemented in a C++ library. The library itself can handle both simple and more complex graphs with a lot of vertices and edges.
26
Handl, Tomáš. „Algoritmus Vivaldi pro nalezení pozice stanice v Internetu“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218110.
Der volle Inhalt der QuelleAnnotation:
Diploma thesis deals with usage of artificial coordinate systems used for localization of a station on the internet and prediction of delay between the stations. There are described and compared basic properties of centralized and decentralized algorithms providing station localization on the internet and RTT prediction. More in depth are presented main representatives of both types of algorithms such as GNP, IDMAPS or Lighthouse. Central part of thesis is aimed at getting to know Vivaldi distributed algorithm. Basic principle of the algorithm for constant and variable time step, using two dimensional coordinate system with 3rd parameter height, is here outlined. Further more implementation of this algorithm as a library Vivaldi-lib in the environment of Java is implemented. Part of the thesis are simulations of behaviour of this algorithm for both variations realized on artificial networks and data obtained from PlanetLab experimental network, using simulation created program VIVALDIMONITOR.
27
Jaroš, Marta. „Akcelerace algoritmů pro shlukování tunelů v proteinech“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2016. http://www.nusl.cz/ntk/nusl-255375.
Der volle Inhalt der QuelleAnnotation:
This thesis deals with the clustering of tunnels in data obtained from the protein molecular dynamics simulation. This process is very computationaly intensive and it has been a challenge for scientific communities. The goal is to find such an algorithm with optimal time and space complexity ratio. The research of clustering algorithms, work with huge highdimensional datasets, visualisation and cluster-comparing methods are discussed. The thesis provides a proposal of the solution of this problem using the Twister Tries algorithm. The implementation details are analysed and the testing results of the solution quality and space complexity are provided. The goal of the thesis was to prove that we could achieve the same results with a stochastic algorithm - Twister Tries , as with an exact algorithm ( average-linkage ). This assumption was not confirmed confidently. Another finding of the hashing functions analysis shows that we could obtain the same results of hashing with a low dimensional hashing function but in much better computational time.
28
Zuniga, Virgilio. „Bio-inspired optimization algorithms for smart antennas“. Thesis, University of Edinburgh, 2011. http://hdl.handle.net/1842/5766.
Der volle Inhalt der QuelleAnnotation:
This thesis studies the effectiveness of bio-inspired optimization algorithms in controlling adaptive antenna arrays. Smart antennas are able to automatically extract the desired signal from interferer signals and external noise. The angular pattern depends on the number of antenna elements, their geometrical arrangement, and their relative amplitude and phases. In the present work different antenna geometries are tested and compared when their array weights are optimized by different techniques. First, the Genetic Algorithm and Particle Swarm Optimization algorithms are used to find the best set of phases between antenna elements to obtain a desired antenna pattern. This pattern must meet several restraints, for example: Maximizing the power of the main lobe at a desired direction while keeping nulls towards interferers. A series of experiments show that the PSO achieves better and more consistent radiation patterns than the GA in terms of the total area of the antenna pattern. A second set of experiments use the Signal-to-Interference-plus-Noise-Ratio as the fitness function of optimization algorithms to find the array weights that configure a rectangular array. The results suggest an advantage in performance by reducing the number of iterations taken by the PSO, thus lowering the computational cost. During the development of this thesis, it was found that the initial states and particular parameters of the optimization algorithms affected their overall outcome. The third part of this work deals with the meta-optimization of these parameters to achieve the best results independently from particular initial parameters. Four algorithms were studied: Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing and Hill Climb. It was found that the meta-optimization algorithms Local Unimodal Sampling and Pattern Search performed better to set the initial parameters and obtain the best performance of the bio-inspired methods studied.
29
Hemzalová, Zuzana. „Evoluční algoritmy pro ultrazvukovou perfúzní analýzu“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2021. http://www.nusl.cz/ntk/nusl-442504.
Der volle Inhalt der QuelleAnnotation:
This thesis deals with the principles of ultrasonic perfusion analysis and methods for determining perfusion parameters. It examines Evolutionary algorithms and their ability to optimize the approximation of dilution curves from ultrasond tissue scannig. It compares the optimization performance of three evolutionary algorithms. Continuous genetic algorithm GA, algorithm SOMA and PSO. Methods are evaluated on simulated and clinical data.
30
Bird, Stefan Charles, und stbird@seatiger org. „Adaptive Techniques for Enhancing the Robustness and Performance of Speciated PSOs in Multimodal Environments“. RMIT University. Computer Science and IT, 2008. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20081027.122244.
Der volle Inhalt der QuelleAnnotation:
This thesis proposes several new techniques to improve the performance of speciated particle swarms in multimodal environments. We investigate how these algorithms can become more robust and adaptive, easier to use and able to solve a wider variety of optimisation problems. We then develop a technique that uses regression to vastly improve an algorithm's convergence speed without requiring extra evaluations. Speciation techniques play an important role in particle swarms. They allow an algorithm to locate multiple optima, providing the user with a choice of solutions. Speciation also provides diversity preservation, which can be critical for dynamic optimisation. By increasing diversity and tracking multiple peaks simultaneously, speciated algorithms are better able to handle the changes inherent in dynamic environments. Speciation algorithms often require a user to specify a parameter that controls how species form. This is a major drawback since the knowledge may not be available a priori. If the parameter is incorrectly set, the algorithm's performance is likely to be highly degraded. We propose using a time-based measure to control the speciation, allowing the algorithm to define species far more adaptively, using the population's characteristics and behaviour to control membership. Two new techniques presented in this thesis, ANPSO and ESPSO, use time-based convergence measures to define species. These methods are shown to be robust while still providing highly competitive performance. Both algorithms effectively optimised all of our test functions without requiring any tuning. Speciated algorithms are ideally suited to optimising dynamic environments, however the complexity of these environments makes them far more difficult to design algorithms for. To increase an algorithm's performance it is necessary to determine in what ways it should be improved. While all performance metrics allow optimisation techniques to be compared, they cannot show how to improve an algorithm. Until now this has been done largely by trial and error. This is extremely inefficient, in the same way it is inefficient trying to improve a program's speed without profiling it first. This thesis proposes a new metric that exclusively measures convergence speed. We show that an algorithm can be profiled by correlating the performance as measured by multiple metrics. By combining these two techniques, we can obtain far better insight into how best to improve an algorithm. Using this information, we then propose a local convergence enhancement that greatly increases performance by actively estimating the location of an optimum. The enhancement uses regression to fit a surface to the peak, guiding the search by estimating the peak's true location. By incorporating this technique, the algorithm is able to use the information contained within the fitness landscape far more effectively. We show that by combining the regression with an existing speciated algorithm, we are able to vastly improve the algorithm's performance. This technique will greatly enhance the utility of PSO on problems where fitness evaluations are expensive, or that require fast reaction to change.
31
Zach, Ondřej. „Nové algoritmy pro kódování videosekvencí“. Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2020. http://www.nusl.cz/ntk/nusl-410822.
Der volle Inhalt der QuelleAnnotation:
Předložená dizertační práce se zabývá moderními algoritmy pro kódovaní videosekvencí, zejména algoritmem High Efficiency Video Coding, a jeho použítím v prostředí online streamování. Vzhledem k tomu, že chování koncových diváků směřuje ke sledování video obsahu kdykoli a kdekoli, způsob, jakým je obsah doručen k divákovi, se stává stejně důležitým, jakým je samotné kódování. V této práci se zaměřujeme na užití HEVC ve službách založených na HTTP adaptivním streamování, zejména ve službách využívajích DASH. Dále se zabýváme dalšími aspekty, které mají vliv na kvalitu zážitku (Quality of Experience) tak, jak jej vnímá koncový uživatel. Takovými jsou na příklad přítomnost reklamy či další systémové parametry. Abychom mohli sbírat názory uživatelů, pro naše experimenty často používáme crowdsourcing. Z tohoto důvodu je část této práce věnována samotnému crowdsourcingu a tomu, jak jej lze využít pro hodnocení kvality videa.
32
Sedláček, Josef. „Algoritmy pro shlukování textových dat“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-218899.
Der volle Inhalt der QuelleAnnotation:
The thesis deals with text mining. It describes the theory of text document clustering as well as algorithms used for clustering. This theory serves as a basis for developing an application for clustering text data. The application is developed in Java programming language and contains three methods used for clustering. The user can choose which method will be used for clustering the collection of documents. The implemented methods are K medoids, BiSec K medoids, and SOM (self-organization maps). The application also includes a validation set, which was specially created for the diploma thesis and it is used for testing the algorithms. Finally, the algorithms are compared according to obtained results.
33
Hundák, Vladimír. „Algoritmy pro řízení asynchronního motoru“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2014. http://www.nusl.cz/ntk/nusl-220893.
Der volle Inhalt der QuelleAnnotation:
Hlavným cieľom tejto práce je vytvorenie simulácií rôznych algoritmov riadenia asynchrónneho motora a vzájomné porovnanie ich vlastností. Zaoberá sa taktiež možnosťami konfigurácie náhradného zapojenia na T-článok, -článok a -článok. Obsahuje jednak teoretický rozbor, a taktiež aj simulácie jednotlivých spôsobov riadenia spolu s podrobným návodom na ich realizáciu. Celkovo budú vykonané 3 simulácie – simulácia vektorového riadenia s orientáciou na rotorový tok, vektorového riadenia s orientáciou na statorový tok a simulácia takzvaného prirodzeného riadenia. Ide o úplne nový typ riadenia, ktorého autorom je vedúci tejto diplomovej práce. Jeho simulácia bola vôbec prvým pokusom o funkčnú realizáciu tohto typu riadenia.
34
Lyko, Antonín. „Algoritmy pro řízení elektrických motorů“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2017. http://www.nusl.cz/ntk/nusl-316275.
Der volle Inhalt der QuelleAnnotation:
This paper presents the structure and basic elements of the Autosar software architecture. In addition, the configuration code generation options are presented for both MC-ISAR drivers and AURIX TriCore TC277 hardware modules using EB tresos Studio. For the purpose of possible integration of the electric motor control algorithms, configurations of the GTM and VADC hardware modules have been created and described to enable the generation of PWM signals along with synchronously triggered parallel analogue-to-digital conversions. For this purpose, an application interface including the PWM driver was also developed and described.
35
Winter, Luca. „Algoritmy pro rozpoznávání pojmenovaných entit“. Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2017. http://www.nusl.cz/ntk/nusl-320108.
Der volle Inhalt der QuelleAnnotation:
The aim of this work is to find out which algorithm is the best at recognizing named entities in e-mail messages. The theoretical part explains the existing tools in this field. The practical part describes the design of two tools specifically designed to create new models capable of recognizing named entities in e-mail messages. The first tool is based on a neural network and the second tool uses a CRF graph model. The existing and newly created tools and their ability to generalize are compared on a subset of e-mail messages provided by Kiwi.com.
36
Hrabina, Martin. „VÝVOJ ALGORITMŮ PRO ROZPOZNÁVÁNÍ VÝSTŘELŮ“. Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-409087.
Der volle Inhalt der QuelleAnnotation:
Táto práca sa zaoberá rozpoznávaním výstrelov a pridruženými problémami. Ako prvé je celá vec predstavená a rozdelená na menšie kroky. Ďalej je poskytnutý prehľad zvukových databáz, významné publikácie, akcie a súčasný stav veci spoločne s prehľadom možných aplikácií detekcie výstrelov. Druhá časť pozostáva z porovnávania príznakov pomocou rôznych metrík spoločne s porovnaním ich výkonu pri rozpoznávaní. Nasleduje porovnanie algoritmov rozpoznávania a sú uvedené nové príznaky použiteľné pri rozpoznávaní. Práca vrcholí návrhom dvojstupňového systému na rozpoznávanie výstrelov, monitorujúceho okolie v reálnom čase. V závere sú zhrnuté dosiahnuté výsledky a načrtnutý ďalší postup.
37
Vozák, Petr. „Knihovna algoritmů pro šifrování textu“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-237044.
Der volle Inhalt der QuelleAnnotation:
p, li { white-space: pre-wrap; } p, li { white-space: pre-wrap; } This thesis deals with text ciphering. The presented paper describes at first basic theoretical background of cryptology and basic distribution of cryptographic algorithms. Then it describes a brief history of encryption from beginning to present. Theoretical description of ciphering methods and its implementation details are discussed here. All basic types of conventional encryption algorithms and also some modern ciphering methods are included; these are substitution, transposition, steganographic or combinations encryption systems. The result of this thesis is the library of algorithms for text ciphering in Java with a sample application, which demonstrates its funcionality.
38
Laščák, Tomáš. „Algoritmy pro segmentaci webových stránek“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2016. http://www.nusl.cz/ntk/nusl-255360.
Der volle Inhalt der QuelleAnnotation:
Segmentation of web pages is one of the disciplines of information extraction. It allows to divide the page into different semantic blocks. This thesis deals with the segmentation as such and also with the implementation of the segmentation method. In this paper, we describe various examples of methods such as VIPS, DOM PS etc. There is a theoretical description of the chosen method and also the FITLayout Framework, which will be extended by this method. The implementation of the chosen method is also described in detail. The implementation description is focused on describing the different problems we had to solve. We also describe the testing that helped to reveal some weaknesses. The conclusion is a summary of the results and possible ideas for extending this work.
39
Řepka, Michal. „Vizualizace algoritmů pro plánování cesty“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2018. http://www.nusl.cz/ntk/nusl-385981.
Der volle Inhalt der QuelleAnnotation:
Finding of collision free path is central in creation of mobile, autonomous robot. Goal of this paper is to show the most important algorithms implementing such solutions. It also describes application that is being created to allow students experiment with these methods. For this purpose it uses library that was introduced by Jakub Rusnák in 2017, which means this is a continuation and possibly extension of his work.
40
Valeš, Ondřej. „Efektivní algoritmy pro stromové automaty“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2019. http://www.nusl.cz/ntk/nusl-403145.
Der volle Inhalt der QuelleAnnotation:
In this work a novel algorithm for testing language equivalence and inclusion on tree automata is proposed and implemented as a module in the VATA library. First, existing approaches to equivalence and inclusion testing on both word and tree automata are examined. These existing approaches are then modified to create bisimulation up-to congruence algorithm for tree automata and a formal proof of the soundness of the new algorithm is provided. Efficiency of this new approach is compared with existing language equivalence and inclusion testing methods for tree automata, showing the performance of our algorithm on hard cases is often superior.
41
Tmejová, Tereza. „Model řidiče pro simulační algoritmy“. Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2020. http://www.nusl.cz/ntk/nusl-417521.
Der volle Inhalt der QuelleAnnotation:
This diploma thesis deals with the creation of a computation driver model. In the first part, there is an overview on driver models for longitudinal and lateral control. Next, driving maneuvres that could be selected for testing of driver model are described. In the practical part, there is created a computational driver model, whose task is to follow required path. The resulting model is tested on three driving maneuvers - steady turning, moose test and slalom. Finally, this model is tested on the passage of a real track. For all these tracks, a comparison is made and the success of the model is evaluated.
42
Čápek, Pavel. „Srovnání nástrojů pro animaci algoritmů“. Master's thesis, Vysoká škola ekonomická v Praze, 2012. http://www.nusl.cz/ntk/nusl-192639.
Der volle Inhalt der QuelleAnnotation:
The diploma thesis focuses on software tools which enable algorithm animation. In theoretical section of the work are introduced different ways how to present algorithms. Then the field of algorithm animation is described; it's history, development and current state. In the last part of theoretical section are shown possibilities how to use algorithm animation in teaching. Practical section of the thesis focuses on comparison of selected software tools. Selected tools are evaluated based on several criteria. The applications are then compared by multi-criteria decision making methods. Main goal of this thesis is to compare the selected software tools. Partial goals are to introduce advantages of using such applications compared to writing the algorithm in text form.
43
Maceška, Radek. „Návrh algoritmu pro elektronickou fokusaci uzv sond“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219222.
Der volle Inhalt der QuelleAnnotation:
This thesis deals with electronic focusing of ultrasonic probes. There is theoretically described, what is the electronic focusing. Further, there are calculations that are used to achieve focusing. These calculations are then implemented into the algorithm that was developed in Matlab. The paper also contains the simulation conducted using the proposed algorithm and the GUI. These simulations are then compared with characteristics measured on a real ultrasound probe.
44
Slepánek, David. „Návrh řídícího algoritmu ABS pro nákladní vozidlo“. Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2018. http://www.nusl.cz/ntk/nusl-378485.
Der volle Inhalt der QuelleAnnotation:
This thesis is concerned with ABS algorithm project for commercial vehicles. In the first part the reader is introduced to the history and first usage of the anti-blocking system, its principles and main functions. There are also driving algorithms and functionality system control. The second part is dedicated to the dynamic model, programs and ADAMS Car and MATLAB Simulink interfaces. It also contains the description of the algorithm, its parameters and basic functionality assay. Simulation, program interlink, testing and tuning are also described. The concluding part deals with results and their assessment.
45
Popela, Tomáš. „Implementace algoritmu pro vizuální segmentaci www stránek“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236592.
Der volle Inhalt der QuelleAnnotation:
Segmentation of WWW pages or page division on di erent semantics blocks is one of the disciplines of information extraction. Master's thesis deals with Vision-based Page Segmentation - VIPS method, which consist in division based on visual properties of page's elements. The method is given in context of other prominent segmentation procedures. In this work, the key steps, that this method consist of are shown and described on examples. For VIPS method it is necessary to cooperate with WWW pages rendering engine in order to obtain Document Object Model of page. The paper presents and describes four most important engines for Java programming language. The output of this work is implementation of VIPS algorithm just in Java language with usage of CSSBox core. The original algorithm implementation from Microsoft's labs is presented. The di erent development stages of library implementing VIPS method and my approach to it's solution are described. In the end of this work the work's outcome is demonstrated on several pages segmentation.
46
Rosa, Štěpán. „Využití prostředků umělé inteligence pro podporu rozhodování v podniku“. Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2012. http://www.nusl.cz/ntk/nusl-223375.
Der volle Inhalt der QuelleAnnotation:
The diploma thesis focuses on the use of genetic algorithms for tasks related to the travelling salesman problem. Based on theoretical knowledge and problem analysis a proposal of the solution is provided. This creates a daily route plan for service technicians with regard to constraints. The case study shows that the proposed solution in comparison with manual scheduling by experience enables to reduce transportation costs.
47
Smilek, Jan. „Modelování a simulace robustních řídicích algoritmů pro EC motory“. Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2013. http://www.nusl.cz/ntk/nusl-230868.
Der volle Inhalt der QuelleAnnotation:
This thesis focuses on developing algorithms for brushless AC motor control. First part of the thesis contains derivation of mathematical model and overview of selected sensor and sensorless control methods. Second part introduces simulation model of the motor, developed in Matlab/Simulink environment, with usage of SimPowerSystems toolbox. Following chapter describes realization of control algorithm, utilizing Hall sensors and position estimation. After that, sensorless rotor position estimation module is developed, and its implementation into the model is mentioned. Last chapters deal with development of graphical user interface, meant for changing selected motor and control parameters, and they also summarize and compare achieved results.
48
GASPERAZZO, S. T. „UM ALGORITMO PSO HÍBRIDO PARA PLANEJAMENTO DE CAMINHOS EM NAVEGAÇÃO DE ROBÔS UTILIZANDO A*“. Universidade Federal do Espírito Santo, 2014. http://repositorio.ufes.br/handle/10/4276.
Der volle Inhalt der QuelleAnnotation:
Made available in DSpace on 2016-08-29T15:33:20Z (GMT). No. of bitstreams: 1
tese_8364_dissertacao_stefano.pdf: 2078703 bytes, checksum: b7e3e083f76858033ffbf089d0223c49 (MD5)
Previous issue date: 2014-11-27Utilizar robos autônomos capazes de planejar o seu caminho é um desafio que atrai vários pesqui quisadores na área de navegação de robôs. Neste contexto, este trabalho tem como objetivo implementar um algoritmo PSO híbrido para o planejamento de caminhos em ambientes dinâmicos. O mundo é discretizado em forma de mapas ladrilhados e cada quadrado representa ou não um obstáculo. O algoritmo proposto possui duas fases: a primeira utiliza o algoritmo A* para encontrar uma trajetória inicial viável que o algoritmo PSO otimiza na segunda fase. O ambiente de simulação de robótica CARMEN (Carnegie Mellon Robot Navigation Toolkit) foi utilizado para realização de todos os experimentos computacionais considerando cinco mapas gerados artificialmente com obstáculos estáticos ou dinâmicos. A análise dos resultados indicou que o algoritmo PSO híbrido proposto superou em qualidade de solução o PSO convencional, para essas instâncias.
49
Horký, Aleš. „Systém pro pokročilé plánování“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2015. http://www.nusl.cz/ntk/nusl-234893.
Der volle Inhalt der QuelleAnnotation:
This master thesis deals with the automatic design of examinations and courses scheduling. The design is adapted to the specific requirements of the Faculty of Information Technology of Brno University of Technology. A genetic algorithm and a heuristic algorithm are employed to solve this task. The genetic algorithm is used to specify the sequence of the examinations (or the courses) and then the heuristic algorithm spread them out into a timetable. An implementation (written in Python 3) provides a fast parallel processing calculation which can generate satisfactory schedules in tens of minutes. Performed experiments show approximately 13% better results in all considered criteria in comparison with utilized examination schedules in the past. The development was periodically consulted with persons responsible for the schedule processing at the faculty. The program will be used while designing of examination schedules for the academic year 2015/2016.
50
Řezáč, Martin. „Podpůrné algoritmy pro řízení elektrických motorů“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2015. http://www.nusl.cz/ntk/nusl-221272.
Der volle Inhalt der QuelleAnnotation:
This thesis is focused on a creating supporting drivers and algorithms for electrical motor control using CPU TriCore TC275 CA. The first part is devoted to processor description and selected peripherals, which are A/D converter, a timer for creating the PWM signals and the second timer for processing singnals from encoder. All drivers are tested on an aplication kit, which is equipped with TC275 CA processor. The second part analyzes the measurement quality of GMR sensor TLE5009. Special testbench was prepared for sin cos data capturing and for their comparison with precise encoder position measurement. It was composed from DC motor having both sensor types on commons shaft. Data are acquired using LabView. Subsequently, it analyzes the sensor data, their compensation and subsequent comparison with measured data from the encoder.