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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Quantum Factorization of Integers 21 and 91 using Shor’s Algorithm
    Autorzy:
    Ardhyamath, Poornima
    Naghabhushana, N. M.
    Ujjinimatad, Rohitha
    Powiązania:
    https://bibliotekanauki.pl/articles/1070857.pdf
    Data publikacji:
    2019
    Wydawca:
    Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
    Tematy:
    Euclidean Algorithm
    Factorization
    GCD
    Quantum Fourier Transform
    Shor’s Algorithm
    Opis:
    In this paper we focused on the factorization of integer in detail using well known Shor’s algorithm and its quantum part realization. The algorithm finds prime factors any integer more efficiently than any known classical algorithm. It is based on prior knowledge of the answer to the factorization problem. Algorithm includes finding gcd using polynomial time Euclidean algorithm, determination of unknown period from quantum computer and continued fraction expansion approach. Factorization of two integers 21 and 91 are shown in this paper with all steps. Quantum part of the factorization described mathematically.
    Źródło:
    World Scientific News; 2019, 123; 102-113
    2392-2192
    Pojawia się w:
    World Scientific News
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem
    Autorzy:
    Bereta, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/308683.pdf
    Data publikacji:
    2017
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    Euclidean Steiner tree problem
    MCTS
    Monte Carlo Tree Search
    UCT algorithm
    Opis:
    This study is concerned with a novel Monte Carlo Tree Search algorithm for the problem of minimal Euclidean Steiner tree on a plane. Given p p p points (terminals) on a plane, the goal is to find a connection between all the points, so that the total sum of the lengths of edges is as low as possible, while an addition of extra points (Steiner points) is allowed. Finding the minimum Steiner tree is known to be np-hard. While exact algorithms exist for this problem in 2D, their efficiency decreases when the number of terminals grows. A novel algorithm based on Upper Confidence Bound for Trees is proposed. It is adapted to the specific characteristics of Steiner trees. A simple heuristic for fast generation of feasible solutions based on Fermat points is proposed together with a correction procedure. By combing Monte Carlo Tree Search and the proposed heuristics, the proposed algorithm is shown to work better than both the greedy heuristic and pure Monte Carlo simulations. Results of numerical experiments for randomly generated and benchmark library problems (from OR-Lib) are presented and discussed.
    Źródło:
    Journal of Telecommunications and Information Technology; 2017, 4; 71-81
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Algorithms for integral solutions of a class of diophantine equations
    Autorzy:
    Polak, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/206419.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    integral quadratic form
    unit form
    diophantine equations
    roots
    Euler bilinear form
    Euclidean diagrams
    mesh quiver
    algorithm
    Maple
    Opis:
    In 1970 a negative solution to the tenth Hilbert problem, concerning the determination of integral solutions of diophantine equations, has been published by Y. W. Matiyasevich (see Matiyasevich, 1970). Despite this result, we can present algorithms to compute integral solutions (roots) for a wide class of quadratic diophantine equations of the form q(x) = d, where q : Zn → Z is a homogeneous quadratic form. We will focus on the roots of one (i.e., d = 1) of quadratic Euler forms of selected posets from Loupias list (see Loupias, 1975). In particular, we will describe the roots of positive definite quadratic forms and the roots of quadratic forms that are principal (see Simson, 2010a). The algorithms and results we present here are successfully used in the representation theory of finite groups and algebras.
    Źródło:
    Control and Cybernetics; 2011, 40, 2; 491-514
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Online parameter identification of SPMSM based on improved artificial bee colony algorithm
    Autorzy:
    Wu, Chunli
    Jiang, Shuai
    Bian, Chunyuan
    Powiązania:
    https://bibliotekanauki.pl/articles/1955171.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    artificial bee colony algorithm
    Euclidean distance
    online identification
    parameter identification
    urface-mounted permanent magnet synchronous motor
    algorytm sztucznej kolonii pszczół
    odległość euklidesowa
    identyfikacja online
    identyfikacja parametrów
    silnik synchroniczny z magnesami trwałymi montowany na powierzchni czołowej
    Opis:
    The artificial bee colony (ABC) intelligence algorithm is widely applied to solve multi-variable function optimization problems. In order to accurately identify the parameters of the surface-mounted permanent magnet synchronous motor (SPMSM), this paper proposes an improved ABC optimization method based on vector control to solve the multi-parameter identification problem of the PMSM. Because of the shortcomings of the existing parameter identification algorithms, such as high computational complexity and data saturation, the ABC algorithm is applied for the multi-parameter identification of the PMSM for the first time. In order to further improve the search speed of the ABC algorithm and avoid falling into the local optimum, Euclidean distance is introduced into the ABC algorithm to search more efficiently in the feasible region. Applying the improved algorithm to multi-parameter identification of the PMSM, this method only needs to sample the stator current and voltage signals of the motor. Combined with the fitness function, the online identification of the PMSM can be achieved. The simulation and experimental results show that the ABC algorithm can quickly identify the motor stator resistance, inductance and flux linkage. In addition, the ABC algorithm improved by Euclidean distance has faster convergence speed and smaller steady-state error for the identification results of stator resistance, inductance and flux linkage.
    Źródło:
    Archives of Electrical Engineering; 2021, 70, 4; 777-790
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    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