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ę "Mutation" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Parallel Mutant Execution Techniques in Mutation Testing Process for Simulink Models
    Autorzy:
    Hanh, L. T. M.
    Binh, N. T.
    Tung, K. T.
    Powiązania:
    https://bibliotekanauki.pl/articles/307992.pdf
    Data publikacji:
    2017
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    mutant execution
    mutation testing
    parallel processing
    software testing
    Opis:
    Mutation testing – a fault-based technique for software testing – is a computationally expensive approach. One of the powerful methods to improve the performance of mutation without reducing effectiveness is to employ parallel processing, where mutants and tests are executed in parallel. This approach reduces the total time needed to accomplish the mutation analysis. This paper proposes three strategies for parallel execution of mutants on multicore machines using the Parallel Computing Toolbox (PCT) with the Matlab Distributed Computing Server. It aims to demonstrate that the computationally intensive software testing schemes, such as mutation, can be facilitated by using parallel processing. The experiments were carried out on eight different Simulink models. The results represented the efficiency of the proposed approaches in terms of execution time during the testing process.
    Źródło:
    Journal of Telecommunications and Information Technology; 2017, 4; 90-100
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multi-operator Differential Evolution with MOEA/D for Solving Multi-objective Optimization Problems
    Autorzy:
    Aggarwal, Sakshi
    Mishra, Krishn K.
    Powiązania:
    https://bibliotekanauki.pl/articles/2142322.pdf
    Data publikacji:
    2022
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    erential evolution
    multi-objective
    mutation operator
    weighted-aggregation
    Opis:
    In this paper, we propose a multi-operator differentia evolution variant that incorporates three diverse mutation strategies in MOEA/D. Instead of exploiting the local region, the proposed approach continues to search for optimal solutions in the entire objective space. It explicitly maintains diversity of the population by relying on the benefit of clustering. To promowe convergence, the solutions close to the ideal position, in the objective space are given preference in the evolutionary process. The core idea is to ensure diversity of the population by applying multiple mutation schemes and a faster convergence rate, giving preference to solutions based on their proximity to the ideal position in the MOEA/D paradigm. The performance of the proposed algorithm is evaluated by two popular test suites. The experimental results demonstrate that the proposed approach outperforms other MOEA/D algorithms.
    Źródło:
    Journal of Telecommunications and Information Technology; 2022, 3; 85--95
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Unequally Spaced Antenna Array Synthesis Using Accelerating Gaussian Mutated Cat Swarm Optimization
    Autorzy:
    Kumar, Prasanna K.
    Pappula, Lakshman
    Madhav, B. T. P.
    Prabhakar, V. S. V.
    Powiązania:
    https://bibliotekanauki.pl/articles/2058505.pdf
    Data publikacji:
    2022
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    Gaussian mutation
    cat swarm optimization
    linear antenna array
    PSLL
    Opis:
    Low peak sidelobe level (PSLL) and antenna arrays with high directivity are needed nowadays for reliable wireless communication systems. Controlling the PSLL is a major is sue in designing effective antenna array systems. In this paper, a nature inspired technique, namely accelerating Gaussian mutated cat swarm optimization (AGMCSO) that attributes global search abilities, is proposed to control PSLL in the radiation pattern. In AGM-SCO, Gaussian mutation with an acceleration parameter is used in the position-updated equa tion, which allows the algorithm to search in a systematic way to prevent premature convergence and to enhance the speed of convergence. Experiments concerning several benchmark multimodal problems have been conducted and the obtained results illustrate that AGMCSO shows excellent performance concerning evolutionary speed and accuracy. To validate the overall efficacy of the algorithm, a sensitivity analysis was per formed for different AGMCSO parameters. AGMCSO was researched on numerous linear, unequally spaced antenna ar rays and the results show that in terms of generating low PSLL with a narrow first null beamwidth (FNBW), AGMCSO out performs conventional algorithms.
    Źródło:
    Journal of Telecommunications and Information Technology; 2022, 1; 99--109
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Self-Adaptive Stable Mutation Based on Discrete Spectral Measure for Evolutionary Algorithms
    Autorzy:
    Obuchowicz, A.
    Prętki, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/308441.pdf
    Data publikacji:
    2011
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    discrete spectral measure
    evolutionary algorithms
    heavy-tailed distributions
    mutation parameters adaptation
    Opis:
    In this paper, the concept of a multidimensional discrete spectral measure is introduced in the context of its application to the real-valued evolutionary algorithms. The notion of a discrete spectral measure makes it possible to uniquely define a class of multivariate heavy-tailed distributions, that have recently received substantial attention of the evolutionary optimization community. In particular, an adaptation procedure known from the distribution estimation algorithms (EDAs) is considered and the resulting estimated distribution is compared with the optimally selected referential distribution.
    Źródło:
    Journal of Telecommunications and Information Technology; 2011, 4; 11-19
    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