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ę "basin of attraction" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Non-linear optimization methods for small earthquake locations
    Autorzy:
    Pszczoła, G.
    Leśniak, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/1964207.pdf
    Data publikacji:
    2004
    Wydawca:
    Politechnika Gdańska
    Tematy:
    global optimization
    basin of attraction
    earthquake location
    Opis:
    The problem of locating mine tremors using P-wave arrival times is revisited in the paper. A multidimensional, global, non-linear, constrained optimization method is used as a minimization algorithm for tremor location.In order to see the general properties of the minimized function a few images showing its basins of attractions have been constructed. These pictures enable us to choose efficient algorithms needed to solve location problems. The classical genetic algorithm, pure random search and the most efficient multistart algorithm have been tested. Local minimization methods should be introduced to the location procedure to increase the efficiency of tremor location.
    Źródło:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2004, 8, 4; 583-590
    1428-6394
    Pojawia się w:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Recognizing Sets in Evolutionary Multiobjective Optimization
    Autorzy:
    Gajda-Zagórska, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/308467.pdf
    Data publikacji:
    2012
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    basin of attraction
    clustering
    genetic algorithm
    multiobjective optimization
    Opis:
    Among Evolutionary Multiobjective Optimization Algorithms (EMOA) there are many which find only Paretooptimal solutions. These may not be enough in case of multimodal problems and non-connected Pareto fronts, where more information about the shape of the landscape is required. We propose a Multiobjective Clustered Evolutionary Strategy (MCES) which combines a hierarchic genetic algorithm consisting of multiple populations with EMOA rank selection. In the next stage, the genetic sample is clustered to recognize regions with high density of individuals. These regions are occupied by solutions from the neighborhood of the Pareto set. We discuss genetic algorithms with heuristic and the concept of well-tuning which allows for theoretical verification of the presented strategy. Numerical results begin with one example of clustering in a single-objective benchmark problem. Afterwards, we give an illustration of the EMOA rank selection in a simple two-criteria minimization problem and provide results of the simulation of MCES for multimodal, multi-connected example. The strategy copes with multimodal problems without losing local solutions and gives better insight into the shape of the evolutionary landscape. What is more, the stability of solutions in MCES may be analyzed analytically.
    Źródło:
    Journal of Telecommunications and Information Technology; 2012, 1; 74-82
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the region of attraction of dynamical systems: Application to Lorenz equations
    Autorzy:
    Hammami, M. A.
    Rettab, N. H.
    Powiązania:
    https://bibliotekanauki.pl/articles/229791.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    nonlinear dynamical systems
    Lyapunov function
    basin of attraction
    Lorenz equations
    Opis:
    Many nonlinear dynamical systems can present a challenge for the stability analysis in particular the estimation of the region of attraction of an equilibrium point. The usual methodis based on Lyapunov techniques. For the validity of the analysis it should be supposed that the initial conditions lie in the domain of attraction. In this paper, we investigate such problem for a class of dynamical systems where the origin is not necessarily an equilibrium point. In this case, a small compact neighborhood of the origin can be estimated as an attractor for the system. We give a method to estimate the basin of attraction based on the construction of a suitable Lyapunov function. Furthermore, an application to Lorenz system is given to verify the effectiveness of the proposed method.
    Źródło:
    Archives of Control Sciences; 2020, 30, 3; 389-409
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Improving Population-Based Algorithms with Fitness Deterioration
    Autorzy:
    Wolny, A.
    Schaefer, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/308437.pdf
    Data publikacji:
    2011
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    basin of attraction
    clustering
    fitness deterioration
    genetic algorithm
    optics
    sequential niching
    Opis:
    This work presents a new hybrid approach for supporting sequential niching strategies called Cluster Supported Fitness Deterioration (CSFD). Sequential niching is one of the most promising evolutionary strategies for analyzing multimodal global optimization problems in the continuous domains embedded in the vector metric spaces. In each iteration CSFD performs the clustering of the random sample by OPTICS algorithm and then deteriorates the fitness on the area occupied by clusters. The selection pressure pushes away the next-step sample (population) from the basins of attraction of minimizers already recognized, speeding up finding the new ones. The main advantages of CSFD are low memory an computational complexity even in case of large dimensional problems and high accuracy of deterioration obtained by the flexible cluster definition delivered by OPTICS. The paper contains the broad discussion of niching strategies, detailed definition of CSFD and the series of the simple comparative tests.
    Źródło:
    Journal of Telecommunications and Information Technology; 2011, 4; 31-44
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-4 z 4

      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