Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Optimalization algorithms“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Optimalization algorithms" 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.
Zeitschriftenartikel zum Thema "Optimalization algorithms"
1
Handrik, Marián, Filip Dorčiak, Milan Sága, Milan Vaško und Lenka Jakubovičová. „Modification of the optimization model for simulation of large-diameter pipes bending“. MATEC Web of Conferences 254 (2019): 02024. http://dx.doi.org/10.1051/matecconf/201925402024.
Der volle Inhalt der QuelleAnnotation:
This paper presents a modification of the existing optimalization model in order to increase the accuracy of the solution in the initial and the end part of the bend. Developed optimalization algorithms are implemented in the program MATLAB, and the simulation of the bending process is solved in the FEM program ADINA. Created optimisation program automatically generate model for FEM analysis and automaticaly analyses obtained results from FEM analysis.
2
Szczepaniak, Marcin, Paweł Otręba, Piotr Otręba und Tomasz Sikora. „Use of the Maximum Power Point Tracking Method in a Portable Lithium-Ion Solar Battery Charger“. Energies 15, Nr. 1 (21.12.2021): 26. http://dx.doi.org/10.3390/en15010026.
Der volle Inhalt der QuelleAnnotation:
The use of solar panels in low-power applications is an increasingly developing topic. Various methods are currently used to obtain the highest possible solar panel power generation efficiency. The methods of determining the maximum power point (MPP) and its tracking are under constant development, resulting in the creation of new algorithms to accelerate the operational efficiency while maintaining good parameters. Typically, these methods are only used in high-power photovoltaic installations. Due to the problems resulting from the adjustment to MPP working conditions for low-power solar panels used to charge a Li-Ion battery, an attempt was made to check the feasibility of operating control based on a Pulse Width Modulation (PWM) method and a Maximum Power Point Tracking (MPPT) algorithm like the one used in high-power solar systems also for low-power systems. The article presents adaptation of PWM and MPPT methods for small chargers, including the stages of modelling a solar charger and the results of a computer simulation of the charger operation. The stages of building a real, physical device are also presented. From the analysis of the test results of the constructed charger in real- and laboratory conditions with the use of a device imitating sunlight, the so-called solar box, and comparisons with computer simulations show that the assumed goal was achieved. The results obtained with the PWM method were compared with the MPPT method. The optimization of the device operation parameters and improvement of the algorithms used in the MPPT method resulted in better optimalization of maximum point tracking, improving the efficiency of energy storage from solar cells.
3
Mrowczynska, Maria. „THE ESTIMATION OF ERRORS OF AREA MODELS DESCRIBED BY THE SHAPE FUNCTIONS BY THE MEANS OF NEURAL NETWORKS“. Environment. Technology. Resources. Proceedings of the International Scientific and Practical Conference 1 (23.06.2007): 219. http://dx.doi.org/10.17770/etr2007vol1.1733.
Der volle Inhalt der QuelleAnnotation:
The article deals with the issue of estimation of the area models errors determined on the basis of a discrete points set with the given values of space coordinates (x, y, z). The object was assumed to be described by shape functions in the form of the elliptic paraboloid and the hyperbolic paraboloid. The digital task accomplishment consisted in the statistic verification of errors of the models determined by neural networks and by the accomplishment of adjustment tasks. Modeling by the means of neural networks was carried out by the unidirectional multilayer networks with the application of gradient methods of optimalization and by Resilientback Propagation algorithm (RPROP). The obtained results were compared with the following results of approximation of the second and the third degree of polynomial, the b-spline function and the kriging’s method.
4
Larsen, A. S. F., R. Pedersen und G. Sandbaek. „Computed tomography of the urinary tract: optimalization of low-dose stone protocol in a clinical setting“. Acta Radiologica 46, Nr. 7 (November 2005): 764–68. http://dx.doi.org/10.1080/02841850500216194.
Der volle Inhalt der QuelleAnnotation:
Purpose: To establish whether information would be lost if slice reconstruction thickness was increased from 3 to 5 mm, and whether this altered how difficult it was to interpret the examinations. Material and Methods: Twenty-three consecutive patients referred with suspected or known urinary stones were included. All examinations were performed without intravenous contrast media. The original series, with effective mAs 50, were reconstructed with slice thickness 3 and 5 mm, respectively. All demographic and examination data were removed and the series reviewed in PACS by two independent radiologists. Objective findings, i.e. number and size of stones, signs of obstruction, and evaluation of interpretation difficulty, were registered. Results: Identical findings were registered in 18 of the series of 3 mm ( n = 23) and 19 of the series of 5 mm ( n = 23). In two series reconstructed with 3 mm slice thickness and in one series with 5 mm slice thickness, the observers disagreed on the presence of urinary stones. Main reasons for interpretation difficulties were given as “lack of intra-abdominal fat” and “many phleboliths in the pelvic region”, but never “disturbing noise”. Conclusion: To determine the presence and size of urinary stones at low-dose computed tomography, 5 mm reconstruction algorithm seems equal to 3 mm. Patient-related factors influence the interpretation more than image quality.
5
Pattirajawane, Ignatius Danny, und Erfen G. Suwangto. „METODE ANALISIS KOMPONEN INDEPENDEN DAN PENGGUNAANNYA PADA DEKOMPOSISI SINYAL ELEKTROENSEFALOGRAFI“. Jurnal Matematika Sains dan Teknologi 19, Nr. 2 (12.09.2018): 114–25. http://dx.doi.org/10.33830/jmst.v19i2.116.2018.
Der volle Inhalt der QuelleAnnotation:
Independent component analysis (ICA) is a multivariate statistical method that is used to find factors or independent component from the data. ICA is a further development of factor analysis (FA). The different of ICA to FA is that in FA the distribution of the data is assumed to be normal (gaussian) while it is non-gaussian in ICA. In this paper we will elucidate ICA shortly from the formulation of the problem, the linear modeling of the problem, the solution of the problem through maximum likelihood method and information theory approach, to the formulation of computational algorithm through neural network optimalization of weight matrix. Since one of the common application of ICA is in analysis of biomedical signal, in this paper we will give an illustration of decomposition of electroencephalographic signals in to independent components. This action could help researchers or cliniciansto differentiate brain activities from artifact such as mucles of heart activities. The data samples are taken from open source EEG dataset and would be analyze with EEGLAB which is an open source extension module to Matlab.
Analisis komponen independen (AKI) merupakan metode statistik multivariat yang digunakan untuk menemukan faktor atau komponen independen dari suatu data. AKI merupakan pengembangan lebih lanjut dari analisis faktor (AF). Perbedaannya AKI dengan AF ialah komponen diasumsikan berdistribusi normal (gaussian) pada AF, sedangkan pada AKI komponen diasumsikan berdistribusi non-gaussian. Pada makalah ini akan dipaparkan secara singkat AKI mulai dari perumusan masalah yang memunculkan metode AKI serta permodelan linear yang dihasilkan, pemecahan masalah linear tersebut melalui metode maximum likelihood (ML) dan pendekatan teori informasi, hingga formulasi algoritma komputasi melalui pendekatan optimalisasi matriks beban pada model jaringan syaraf. Karena salah satu penerapan AKI adalah pada analisis sinyal biomedis, dalam makalah ini akan disajikan ilustrasi dekomposisi sinyal elektroensefalografi (EEG) ke dalam komponen independen. Tindakan ini dapat membantu peneliti atau tenaga medis dalam membedakan mana sinyal dari otak dan mana yang merupakan artefak seperti sinyal dari aktivitas otot atau jantung. Data yang digunakan berupa data set EEG sumber terbuka dari daring yang kemudian dianalisis dengan menggunakan perangkat lunak EEGLAB yang merupakan modul tambahan atas perangkat lunak Matlab.
6
Antoš, Karel. „The Use of Weighted Adjacency Matrix for Searching Optimal Transportation Routes“. Periodica Polytechnica Transportation Engineering, 24.01.2018. http://dx.doi.org/10.3311/pptr.11171.
Der volle Inhalt der QuelleAnnotation:
This article provides a new approach to searching solutions of the ship transport optimalization problems. It brings a new variant of one algorithm of searching for the Minimum Spanning Tree. The new element in the algorithm is that it uses the Weighted Adjacency Matrix. This Weighted Adjacency Matrix is suitable for searching for the Minimum Spanning Tree (MST) of the graph. It shows how it could be used in cases where weighted edges of the graph are given. This creates a new procedure of searching for the MST of the graph and completes previously known algorithms of searching for the MST. In the field of transportation it could be succesfully used for solutions of optimizing transportation routes where smallest costs are wanted. Proposed Weighted Adjacency Matrix could be used in similar issues in the field of the graph theory, where graphs with weighted edges are given. The procedure is shown on the attached example.
7
Ganeshkumar, C., Sanjay Kumar Jena, A. Sivakumar und T. Nambirajan. „Artificial intelligence in agricultural value chain: review and future directions“. Journal of Agribusiness in Developing and Emerging Economies, 22.12.2021. http://dx.doi.org/10.1108/jadee-07-2020-0140.
Der volle Inhalt der QuelleAnnotation:
Purpose This paper is a literature review on use of artificial intelligence (AI) among agricultural value chain (AVC) actors, and it brings out gaps in research in this area and provides directions for future research. Design/methodology/approach The authors systematically collected literature from several databases covering 25 years (1994–2020). They classified literature based on AVC actors present in different stages of AVC. The literature was analysed using Nvivo 12 (qualitative software) for descriptive and content analysis. Findings Fifty percent of the reviewed studies were empirical, and 35% were conceptual. The review showed that AI adoption in AVC could increase agriculture income, enhance competitiveness and reduce cost. Among the AVC stages, AI research related to agricultural processing and consumer sector was very low compared to input, production and quality testing. Most AVC actors widely used deep learning algorithm of artificial neural networks in various aspects such as water resource management, yield prediction, price/demand forecasting, energy efficiency, optimalization of fertilizer/pesticide usage, crop planning, personalized advisement and predicting consumer behaviour. Research limitations/implications The authors have considered only AI in the AVC, AI use in any other sector and not related to value chain actors were not included in the study. Originality/value Earlier studies focussed on AI use in specific areas and actors in the AVC such as inputs, farming, processing, distribution and so on. There were no studies focussed on the entire AVC and the use of AI. This review has filled that literature gap.
Dissertationen zum Thema "Optimalization algorithms"
1
Hnízdilová, Bohdana. „Registrace ultrazvukových sekvencí s využitím evolučních algoritmů“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2021. http://www.nusl.cz/ntk/nusl-442502.
Der volle Inhalt der QuelleAnnotation:
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.
2
Filák, Jakub. „Evoluční optimalizace turnusů jízdních řádů“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2009. http://www.nusl.cz/ntk/nusl-236673.
Der volle Inhalt der QuelleAnnotation:
This thesis deals with the problem of vehicle scheduling in public transport. It contains a theoretical introduction to vehicles scheduling and evolutionary algorithms. Vehicle scheduling is analyzed with respect to the bus timetables. Analysis of evolutionary algorithms is done with emphasis on the genetic algorithms and tabu-search method After the theoretical introduction, a memetic algorithm for the given problem is analyzed. Finally, the thesis contains a description of the optimization system implementation and discusses the experiments with the system.
3
Novotná, Kateřina. „Heuristické řešení plánovacích problémů“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236335.
Der volle Inhalt der QuelleAnnotation:
This thesis deals with the implementation of the metaheuristic algorithms into the Drools Planner. The Drools Planner is an open source tool for solving optimization problems. This work describes design and implementation of Ant colony optimization metaheuristics in the Drools Planner. Evaluation of the algorithm results is done by Drools Planner benchmark with different kinds of optimization problems.
4
Bajcar, Martin. „Použití OpenCl v AVG na platformě Windows“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236431.
Der volle Inhalt der QuelleAnnotation:
The main topic of this thesis is the practical use of OpenCL at AVG company. AVG is looking for ways to decrease hardware requirement of their security product and also to decrease computation time of some algorithms. Using OpenCL is one way to achieve this requirement. Significant part of this thesis deals with optimization strategies for AMD and NVIDIA graphics cards as they are most common cards among users. Practical part of the thesis describes parallelization of two algorithms, their analysis and implementation. After that, the obtained results are presented and cases in which the use of OpenCL is beneficial are identified. As a part of implementation, library containing various utility functions which can aid programmers to implement OpenCL based code was developed.
5
Jílek, Tomáš. „Optimalizace návrhu celulárních automatů“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236042.
Der volle Inhalt der QuelleAnnotation:
Focus of this master's thesis is on evolutionary design of cellular automata and it's optimalization. There are described Evolutionary algorithms and Cellular automata in first part. Thereafter, one of the new ways of transition function representation and its possible evolutionary design is presented. Name of this method is Conditionally Matching Rules. This is followed by description of realized experiments with detailed results. Finally, success with optimalization for some tasks is presented in last chapter along with discussion.
6
Gabonay, Michal. „Metody optimalizace plánování nákladní přepravy“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2020. http://www.nusl.cz/ntk/nusl-417240.
Der volle Inhalt der QuelleAnnotation:
The following work concerns the study of the evolutionary algorithm, which optimizes freight transport planning. The demand for freight transport is constantly increasing nowadays and with creating, implementing and using proper route planning we are able to significantly reduce transportation costs. However, it is preferably to implement it in companies with large numbers of served customers and with a sufficiently large fleet of vehicles. The study starts by defining what fright transport planning problem is and by characterizing its existing specifications and variants. My work proceeds to give a background of the possible solutions to the multifaceted aspects of the problem. The specific subproblem I choose to focus on is the Vehicle routing problem with Pickup and Delivery for which I apply the optimization solution. In the main body of my thesis, I will elaborate on the chosen optimization solution which encompasses the genetic algorithm and evolutionary strategy. The aim of the study is to measure the suitability of the algorithms and techniques used, for which reason the final part of my work will deal with the analysis and evaluation of the experiments.
7
Hruda, Petr. „Využití přibližného počítání v oblasti zpracování obrazu“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2020. http://www.nusl.cz/ntk/nusl-417265.
Der volle Inhalt der QuelleAnnotation:
This master thesis focuses on approximate computing applied to image processing. Specifically, the approximation is applied to adaptive thresholding. Two approaches were used, the design of a new system using approximated components and the approximation of an existing algorithm. The resulting effect on thresholding quality was investigated. Experimental evaluation of the first approach shows quality improvements of thresholding with usage of aproximated components. Also, area of found aproximated solutions is smaller. Evaluation of the second approach shows worse quality of thresholding with usage of aproximated components. The second approach is then declared inappropriate.
8
Bistrý, Jan. „Registrace obrazu pomocí metody Optical Flow“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219258.
Der volle Inhalt der QuelleAnnotation:
Registration of medical images is technique, which is developing with new hybrid diagnostic imaging systems. Nowadays is a trend in image registration focused on monomodality and multimodality images registration. The first part of this master’s thesis is intent on present basic information about image registration. Concretely is intending on image transformation, interpolation, criteria function and at optimalization. Further part present realized Optical Flow technique and used “Demon” algorithm for image registration. The next part is focused on presentation of program solution and GUI. In the last section of this master’s thesis is verifying of created program on usual images and real CT images.
9
Herrman, Tomáš. „Metodika aplikace testu obvodu založená na identifikaci testovatelných bloků“. Doctoral thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-261253.
Der volle Inhalt der QuelleAnnotation:
The PhD thesis deals with the analysis of digital systems described on RT level. The methodology of data paths analysis is decribed, the data path controller analysis is not solved in the thesis. The methodology is built on the concept of Testable Block (TB) which allows to divide digital component to such segments which can be tested through their inputs/outputs, border registers and primary inputs/outputs are used for this purpose. As a result, lower number of registers is needed to be included into scan chain - border registers are the only ones which are scanned. The segmentation allows also to reduce the volume of test vectors, tests are generated for segments, not for the complete component. To identify TBs, two evolutionary algorithms are used, they operate on TB formal model which is also defined in the thesis.
10
Raudenská, Lenka. „Metriky a kriteria pro diagnostiku sociotechnických systémů“. Doctoral thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2010. http://www.nusl.cz/ntk/nusl-233879.
Der volle Inhalt der QuelleAnnotation:
This doctoral thesis is focused on metrics and the criteria for socio-technical system diagnostics, which is a high profile topic for companies wanting to ensure the best in product quality. More and more customers are requiring suppliers to prove reliability in the production and supply quality of products according to given specifications. Consequently the ability to produce quality goods corresponding to customer requirements has become a fundamental condition in order to remain competitive. The thesis firstly lays out the basic strategies and rules which are prerequisite for a successful working company in order to ensure provision of quality goods at competitive costs. Next, methods and tools for planning are discussed. Planning is important in its impact on budget, time schedules, and necessary sourcing quantification. Risk analysis is also included to help define preventative actions, and reduce the probability of error and potential breakdown of the entire company. The next part of the thesis deals with optimisation problems, which are solved by Swarm based optimisation. Algorithms and their utilisation in industry are described, in particular the Vehicle routing problem and Travelling salesman problem, used as tools for solving specialist problems within manufacturing corporations. The final part of the thesis deals with Qualitative modelling, where solutions can be achieved with less exact quantitative information of the surveyed model. The text includes qualitative algebra descriptions, which discern only three possible values – positive, constant and negative, which are sufficient in the demonstration of trends. The results can also be conveniently represented using graph theory tools.
Konferenzberichte zum Thema "Optimalization algorithms"
1
Harmini und Mochamad Ashari. „Optimalization of ANFIS-PSO Algorithm Based on MPPT Control for PV System Under Rapidly Changing Weather Condition“. In 2022 IEEE International Conference in Power Engineering Application (ICPEA). IEEE, 2022. http://dx.doi.org/10.1109/icpea53519.2022.9744674.
Der volle Inhalt der Quelle
2
Simeunovic´, Goran, Pavel Zitek und Jan Chysky´. „The Parameters Identification of Time - Delay Models of Heat Transfer Systems From Input-Output Measurements“. In 17th International Conference on Nuclear Engineering. ASMEDC, 2009. http://dx.doi.org/10.1115/icone17-75361.
Der volle Inhalt der QuelleAnnotation:
The paper presents the identification issues and proposes a parameter identification algorithm that separates the system parameters from the time-delays for a class of single input single output (SISO) linear time delay systems (LTDS). The presence of the unknown time delay greatly complicates the parameters estimation problem, because the parameters of the model are not linear with respect to the time-delay. However, once the time delay is determined, the model becomes linear for the other parameters and hence the common least square method can be utilized directly. Motivated by the nonlinear least squares problem developed in the paper Golub and Pereyra (1973), a novel modification of the so-called variable projection functional is worked out for identification of time delays. In this way, the parameters estimation is separated from the estimation of time delays and the large errors in the parameter estimates, in the case of presence of errors in the time-delay identified values, are avoided. Namely, the small error in the time-delay identified values may often cause a large error in the system parameters identification. A hybrid optimalization method combining a Genetic Algorithm and Nelder-Mead technique is used for minimization of variable projection functional for the identification of time delays. This approach is illustrated by a particular application in the field of heat transfer, concretely on the time-delay model of the recuperative heat exchanger.