Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Evolution algorithms" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
    Wyświetlanie 1-12 z 12
    Tytuł:
    Image reconstruction with the use of evolutionary algorithms and cellular automata
    Autorzy:
    Seredyński, F.
    Skaruz, J.
    Piraszewski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/106216.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    image reconstruction
    evolution algorithms
    cellular automata
    genetic algorithm
    Opis:
    In the paper we present a new approach to the image reconstruction problem based on evolution algorithms and cellular automata. Two-dimensional, nine state cellular automata with the Moore neighbourhood perform reconstruction of an image presenting a human face. Large space of automata rules is searched through efficiently by the genetic algorithm (GA), which finds a good quality rule. The experimental results show that the obtained rule allows to reconstruct an image with even 70% damaged pixels. Moreover, we show that the rule found in the genetic evolution process can be applied to the reconstruction of images of the same class but not presented during the evolutionary one.
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 4; 39-49
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The use of evolution algorithms for identification of transmission backlash
    Zastosowanie algorytmów genetycznych do identyfikacji luzów w przekładni
    Autorzy:
    Korbel, K.
    Zygmunt, H.
    Powiązania:
    https://bibliotekanauki.pl/articles/369069.pdf
    Data publikacji:
    2011
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    algorytmy genetyczne
    napęd elektryczny
    luz
    identyfikacja
    symulacja
    evolution algorithms
    electrical drive
    backlash
    identification
    simulation
    Opis:
    Mechanical propulsion system including, inter alia, an electric motor, shaft and transmission is characterized by certain parameters whose values cannot be calculated using mathematical methods (transmission backlash) or may vary during operation time. Such parameters have to be known to ensure proper operation of the system. In this article a method for identification of these parameters is described. The method is based on an evolution algorithm. This algorithm utilizes natural selection methods and natural transformation processes within a population, similar to those in animal world. The least-fit individuals are rejected by applying the fitness function. The population will improve, and in infinite time it will be perfect. That means that the perfect solution can be attained in a very long time. This time can be shortened by defining the termination criteria, e.g. the identification can be stopped if one of the population individuals has a very low error. Such identification requires a transition function (model), as well as reference measurement made on a real system.
    Mechaniczny system napędowy zawierający, między innymi, silnik elektryczny, sprzęgło i przekładnię jest określony przez niektóre parametry, których wartość nie może być wyliczona metodami matematycznymi (np.: luzy w przekładni), albo może się zmieniać w czasie pracy. Również te parametry powinny być znane dla zapewnienia właściwej pracy systemu. W artykule opisano metodę identyfikacji takich parametrów. Metoda ta opiera się na algorytmie genetycznym. Ten algorytm używa metod doboru naturalnego i procesu naturalnej modyfikacji wewnątrz populacji, podobnych do procesów zachodzących w świecie istot żywych. Najsłabsze osobniki są odrzucane przez zastosowanie funkcji dopasowania. Populacja staje się lepsza i lepsza; po czasie nieskończenie długim byłaby doskonała. To znaczy, że doskonałe rozwiązanie może być znalezione po bardzo długim czasie. Ten czas może być skrócony przez określenie kryterium zatrzymania, tzn.: jeżeli jeden z członków populacji wykazuje bardzo małą odchyłkę, to identyfikacja może zostać zatrzymana. Aby uruchomić ten rodzaj identyfikacji, potrzebna jest funkcja przejścia (model) oraz wzorcowy pomiar na rzeczywistym obiekcie.
    Źródło:
    Mechanics and Control; 2011, 30, 1; 1-5
    2083-6759
    2300-7079
    Pojawia się w:
    Mechanics and Control
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Systemic Evolutionary Algorithm inspired by the methods of quantum computing to improve the accuracy of the model on the neuronal motion the end of the robot arm PR–02
    Autorzy:
    Wołynka, Ł.
    Tchórzewski, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/97323.pdf
    Data publikacji:
    2016
    Wydawca:
    Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
    Tematy:
    Evolution algorithms
    Quantum computing
    Modeling systems
    Robot PR–02
    Artificial Neural Networks
    Environment MATLAB and Simulink
    Opis:
    The article contains selected results of research on the design Systemic Evolutionary Algorithm inspired by quantum informatics methods and description how to implement it in Matlab language in order to use for improve parameters neural model on example robot robot PR–02 arm motion. Initial population was based on weights matrix of artificial neural network. Randomly selected population of individual chromosomes in both the initial and in the following parent population have been converted to binary values, and these to quantum values by using created for this purpose quatization() function. Quantum gene value was determined on the basis of stonger pure state represented by different chromosomes, to which dequantization() function was used. Selection of individuals was conducted based on the model of neural robot PR–02 motion implemented in Matlab language using calculationsNeuralNetworks() function.
    Źródło:
    Computer Applications in Electrical Engineering; 2016, 14; 297-312
    1508-4248
    Pojawia się w:
    Computer Applications in Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Artificial Life. Biologically-inspired algorithms
    Autorzy:
    Komosiński, Maciej
    Powiązania:
    https://bibliotekanauki.pl/articles/703205.pdf
    Data publikacji:
    2008
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    artificial life
    simulation
    biologically-inspired algorithms
    evolution
    computing
    Opis:
    This article presents Artificial Life, an interdisciplinary field of study that helps understand life on Earth (life as we know it) and other, possible kinds of life (as it could be). Artificial Life research builds models of life and synthesizes related phenomena and processes in all currently available media – software, hardware and wetware. The first part of this work focuses on Artificial Life as a research field. In the second part, three exemplary computer science algorithms are shown that are inspired by biological processes. These are evolutionary and coevolutionary algorithms, swarm intelligence and ant algorithms, and artificial immune systems. The final part of this work provides a number of reflections on the goals of Artificial Life research, human nature and limitations, and our problems with evaluating complex outcomes of digital life experimentation.
    Źródło:
    Nauka; 2008, 4
    1231-8515
    Pojawia się w:
    Nauka
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Effect of strategy adaptation on differential evolution in presence and absence of parameter adaptation: an investigation
    Autorzy:
    Dawar, D.
    Ludwig, S. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/91882.pdf
    Data publikacji:
    2018
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    evolutionary algorithms
    differential evolution
    mutation strategy
    adaptive control
    Opis:
    Differential Evolution (DE) is a simple, yet highly competitive real parameter optimizer in the family of evolutionary algorithms. A significant contribution of its robust performance is attributed to its control parameters, and mutation strategy employed, proper settings of which, generally lead to good solutions. Finding the best parameters for a given problem through the trial and error method is time consuming, and sometimes impractical. This calls for the development of adaptive parameter control mechanisms. In this work, we investigate the impact and efficacy of adapting mutation strategies with or without adapting the control parameters, and report the plausibility of this scheme. Backed with empirical evidence from this and previous works, we first build a case for strategy adaptation in the presence as well as in the absence of parameter adaptation. Afterwards, we propose a new mutation strategy, and an adaptive variant SA-SHADE which is based on a recently proposed self-adaptive memory based variant of Differential evolution, SHADE. We report the performance of SA-SHADE on 28 benchmark functions of varying complexity, and compare it with the classic DE algorithm (DE/Rand/1/bin), and other state-of-the-art adaptive DE variants including CoDE, EPSDE, JADE, and SHADE itself. Our results show that adaptation of mutation strategy improves the performance of DE in both presence, and absence of control parameter adaptation, and should thus be employed frequently.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 3; 211-235
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Solution of linear and non-linear boundary value problems using population-distributed parallel differential evolution
    Autorzy:
    Nasim, Amnah
    Burattini, Laura
    Fateh, Muhammad Faisal
    Zameer, Aneela
    Powiązania:
    https://bibliotekanauki.pl/articles/91569.pdf
    Data publikacji:
    2019
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    parallel evolutionary algorithms
    differential evolution
    boundary value problems
    optimization
    Opis:
    Cases where the derivative of a boundary value problem does not exist or is constantly changing, traditional derivative can easily get stuck in the local optima or does not factually represent a constantly changing solution. Hence the need for evolutionary algorithms becomes evident. However, evolutionary algorithms are compute-intensive since they scan the entire solution space for an optimal solution. Larger populations and smaller step sizes allow for improved quality solution but results in an increase in the complexity of the optimization process. In this research a population-distributed implementation for differential evolution algorithm is presented for solving systems of 2nd-order, 2-point boundary value problems (BVPs). In this technique, the system is formulated as an optimization problem by the direct minimization of the overall individual residual error subject to the given constraint boundary conditions and is then solved using differential evolution in the sense that each of the derivatives is replaced by an appropriate difference quotient approximation. Four benchmark BVPs are solved using the proposed parallel framework for differential evolution to observe the speedup in the execution time. Meanwhile, the statistical analysis is provided to discover the effect of parametric changes such as an increase in population individuals and nodes representing features on the quality and behavior of the solutions found by differential evolution. The numerical results demonstrate that the algorithm is quite accurate and efficient for solving 2nd-order, 2-point BVPs.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2019, 9, 3; 205-218
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Emerging modularity during the evolution of neural networks
    Autorzy:
    Praczyk, Tomasz
    Powiązania:
    https://bibliotekanauki.pl/articles/2201327.pdf
    Data publikacji:
    2023
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    neuro-evolution
    modular neural networks
    emergent modularity
    hybrid algorithms
    Opis:
    Modularity is a feature of most small, medium and large–scale living organisms that has evolved over many years of evolution. A lot of artificial systems are also modular, however, in this case, the modularity is the most frequently a consequence of a handmade design process. Modular systems that emerge automatically, as a result of a learning process, are very rare. What is more, we do not know mechanisms which result in modularity. The main goal of the paper is to continue the work of other researchers on the origins of modularity, which is a form of optimal organization of matter, and the mechanisms that led to the spontaneous formation of modular living forms in the process of evolution in response to limited resources and environmental variability. The paper focuses on artificial neural networks and proposes a number of mechanisms operating at the genetic level, both those borrowed from the natural world and those designed by hand, the use of which may lead to network modularity and hopefully to an increase in their effectiveness. In addition, the influence of external factors on the shape of the networks, such as the variability of tasks and the conditions in which these tasks are performed, is also analyzed. The analysis is performed using the Hill Climb Assembler Encoding constructive neuro-evolutionary algorithm. The algorithm was extended with various module-oriented mechanisms and tested under various conditions. The aim of the tests was to investigate how individual mechanisms involved in the evolutionary process and factors external to this process affect modularity and efficiency of neural networks.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2023, 13, 2; 107--126
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The performance profile: A multi-criteria performance evaluation method for test-based problems
    Autorzy:
    Jaśkowski, W.
    Liskowski, P.
    Szubert, M.
    Krawiec, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/331220.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    coevolutionary algorithms
    evolution strategies
    Othello
    Reversi
    games
    multiobjective analysis
    algorytm koewolucyjny
    strategie ewolucyjne
    gra Othello
    analiza wielokryterialna
    Opis:
    In test-based problems, solutions produced by search algorithms are typically assessed using average outcomes of interactions with multiple tests. This aggregation leads to information loss, which can render different solutions apparently indifferent and hinder comparison of search algorithms. In this paper we introduce the performance profile, a generic, domain-independent, multi-criteria performance evaluation method that mitigates this problem by characterizing the performance of a solution by a vector of outcomes of interactions with tests of various difficulty. To demonstrate the usefulness of this gauge, we employ it to analyze the behavior of Othello and Iterated Prisoner’s Dilemma players produced by five (co)evolutionary algorithms as well as players known from previous publications. Performance profiles reveal interesting differences between the players, which escape the attention of the scalar performance measure of the expected utility. In particular, they allow us to observe that evolution with random sampling produces players coping well against the mediocre opponents, while the coevolutionary and temporal difference learning strategies play better against the high-grade opponents. We postulate that performance profiles improve our understanding of characteristics of search algorithms applied to arbitrary test-based problems, and can prospectively help design better methods for interactive domains.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 1; 215-229
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The identification of the boundary geometry with corner points in inverse two-dimensional potential problems
    Autorzy:
    Zieniuk, E.
    Gabrel, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/1931586.pdf
    Data publikacji:
    2002
    Wydawca:
    Politechnika Gdańska
    Tematy:
    inverse boundary value problem
    boundary geometry identification
    geometry
    parametric integral equation system
    finite element method
    boundary element method
    evolution algorithm
    genetic algorithms
    Opis:
    The paper presents fragment of a larger study concerning the effective methods of solving the inverse boundary value problems. The boundary value problem described here is formulated as a problem of the identification of a boundary geometry with corner points. A method using a parametric integral equations system (PIES) is proposed. PIES used in the method makes the easy modelling of the geometry with corner points possible. This effect is obtained by the application of modified splines. An evolution algorithm is used for the effective control of modifications of the boundary geometry. Some experimental tests of the efficiency of the discussed method were performed for two-dimensional inverse potential problems.
    Źródło:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2002, 6, 4; 651-660
    1428-6394
    Pojawia się w:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Using multiobjective genetic algorithms for optimal resource management in an autonomous power system
    Wykorzystanie wieloobiektowych algorytmów genetycznych do optymalnego zarządzania zasobami w autonomicznym systemie energetycznym
    Autorzy:
    Gozhyi, A.
    Burlachenko, I.
    Gromaszek, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/408253.pdf
    Data publikacji:
    2012
    Wydawca:
    Politechnika Lubelska. Wydawnictwo Politechniki Lubelskiej
    Tematy:
    niezależny system energetyczny
    algorytm genetyczny
    wieloobiektowy algorytm ewolucyjny
    non-dominated sorting genetic algorithm-II
    archive-based micro genetic algorithm -2
    e-Multi-Objective Evolution Algorithm
    stand-alone power system
    genetic algorithms
    multi-objective evolutionary algorithm
    Opis:
    This paper presents the results of research of multi-objective genetic algorithms applied to solving the problem of system construction and power management. Research is determined by the need for optimal and efficient distribution of different types of energy (renewable or residual) and attempts to improve overall energy efficiency in the energy system which is independent of centralized networks.
    Artykuł przedstawia rezultaty badań nad zastosowaniem wieloobiektowych algorytmów genetycznych do rozwiązania problemów tworzenia i projektowania i zarządzania systemem energetycznym. Przeprowadzenie badań zostało uwarunkowane potrzebą optymalnej i efektywnej dystrybucji różnego rodzaju energii (odnawialna czy pozostałe) oraz próbą poprawy ogólnej efektywności energetycznej w systemie energetycznym, niezależnym od zcentralizowanych sieci.
    Źródło:
    Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska; 2012, 4b; 48-50
    2083-0157
    2391-6761
    Pojawia się w:
    Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Direct least squares and derivative-free optimisation techniques for determining mine-induced horizontal ground displacement
    Autorzy:
    Rusek, Janusz
    Tajduś, Krzysztof
    Powiązania:
    https://bibliotekanauki.pl/articles/2090675.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    horizontal ground displacement
    mining
    direct least squares
    derivative-free optimisation
    genetic algorithms
    differential evolution
    particle swarm optimization
    przemieszczenie poziome gruntu
    górnictwo
    optymalizacja bez pochodnych
    optymalizacja roju cząstek
    algorytmy genetyczne
    ewolucja różnicowa
    bezpośrednie najmniejsze kwadraty
    Opis:
    The paper presents the results of analyses concerning a new approach to approximating trajectory of mining-induced horizontal displacements. Analyses aimed at finding the most effective method of fitting data to the trajectory of mining-induced horizontal displacements. Two variants were made. In the first, the direct least square fitting (DLSF) method was applied based on the minimization of the objective function defined in the form of an algebraic distance. In the second, the effectiveness of differential-free optimization methods (DFO) was verified. As part of this study, the following methods were tested: genetic algorithms (GA), differential evolution (DE) and particle swarm optimization (PSO). The data for the analysis were measurements of on the ground surface caused by the mining progressive work at face no. 698 of the German Prospel-Haniel mine. The results obtained were compared in terms of the fitting quality, the stability of the results and the time needed to carry out the calculations. Finally, it was found that the direct least square fitting (DLSF) approach is the most effective for the analyzed registration data base. In the authors’ opinion, this is dictated by the angular range in which the measurements within a given measuring point oscillated.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 1; e135840, 1--12
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Direct least squares and derivative-free optimisation techniques for determining mine-induced horizontal ground displacement
    Autorzy:
    Rusek, Janusz
    Tajduś, Krzysztof
    Powiązania:
    https://bibliotekanauki.pl/articles/2173560.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    horizontal ground displacement
    mining
    direct least squares
    derivative-free optimisation
    genetic algorithms
    differential evolution
    particle swarm optimization
    przemieszczenie poziome gruntu
    górnictwo
    optymalizacja bez pochodnych
    optymalizacja roju cząstek
    algorytmy genetyczne
    ewolucja różnicowa
    bezpośrednie najmniejsze kwadraty
    Opis:
    The paper presents the results of analyses concerning a new approach to approximating trajectory of mining-induced horizontal displacements. Analyses aimed at finding the most effective method of fitting data to the trajectory of mining-induced horizontal displacements. Two variants were made. In the first, the direct least square fitting (DLSF) method was applied based on the minimization of the objective function defined in the form of an algebraic distance. In the second, the effectiveness of differential-free optimization methods (DFO) was verified. As part of this study, the following methods were tested: genetic algorithms (GA), differential evolution (DE) and particle swarm optimization (PSO). The data for the analysis were measurements of on the ground surface caused by the mining progressive work at face no. 698 of the German Prospel-Haniel mine. The results obtained were compared in terms of the fitting quality, the stability of the results and the time needed to carry out the calculations. Finally, it was found that the direct least square fitting (DLSF) approach is the most effective for the analyzed registration data base. In the authors’ opinion, this is dictated by the angular range in which the measurements within a given measuring point oscillated.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 1; art. no. e135840
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-12 z 12

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies