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ę "on-line algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    On-line -coloring of graphs
    Autorzy:
    Borowiecki, Piotr
    Powiązania:
    https://bibliotekanauki.pl/articles/743585.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    on-line algorithm
    graph coloring
    hereditary property
    Opis:
    For a given induced hereditary property , a -coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property . We consider the effectiveness of on-line -coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function of any stingy on-line -coloring algorithm. In the class of generalized trees, we characterize graphs critical for the greedy -coloring. A class of graphs for which a greedy algorithm always generates optimal -colorings for the property = K₃-free is given.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2006, 26, 3; 389-401
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On-line signature partitioning using a population based algorithm
    Autorzy:
    Zalasiński, Marcin
    Łapa, Krystian
    Cpałka, Krzysztof
    Przybyszewski, Krzysztof
    Yen, Gary G.
    Powiązania:
    https://bibliotekanauki.pl/articles/91729.pdf
    Data publikacji:
    2020
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    on-line signature
    biometrics
    signature partitioning
    population-based algorithm
    podpis on-line
    biometria
    partycjonowanie sygnatur
    algorytm populacyjny
    Opis:
    The on-line signature is a biometric attribute which can be used for identity verification. It is a very useful characteristic because it is commonly accepted in societies across the world. However, the verification process using this particular biometric feature is a rather difficult one. Researchers working on identity verification involving the on-line signature might face various problems, including the different discriminative power of signature descriptors, the problem of a large number of descriptors, the problem of descriptor generation, etc. However, population-based algorithms (PBAs) can prove very useful when resolving these problems. Hence, we propose a new method for on-line signature partitioning using a PBA in order to improve the verification process effectiveness. Our method uses the Differential Evolution algorithm with a properly defined evaluation function for creating the most characteristic partitions of the dynamic signature. We present simulation results of the proposed method for the BioSecure DS2 database distributed by the BioSecure Association.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 1; 5-13
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Self-improving Q-learning based controller for a class of dynamical processes
    Autorzy:
    Musial, Jakub
    Stebel, Krzysztof
    Czeczot, Jacek
    Powiązania:
    https://bibliotekanauki.pl/articles/1845515.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    process control
    Q-learning algorithm
    reinforcement learning
    intelligent control
    on-line learning
    Opis:
    This paper presents how Q-learning algorithm can be applied as a general-purpose self-improving controller for use in industrial automation as a substitute for conventional PI controller implemented without proper tuning. Traditional Q-learning approach is redefined to better fit the applications in practical control loops, including new definition of the goal state by the closed loop reference trajectory and discretization of state space and accessible actions (manipulating variables). Properties of Q-learning algorithm are investigated in terms of practical applicability with a special emphasis on initializing of Q-matrix based only on preliminary PI tunings to ensure bumpless switching between existing controller and replacing Q-learning algorithm. A general approach for design of Q-matrix and learning policy is suggested and the concept is systematically validated by simulation in the application to control two examples of processes exhibiting first order dynamics and oscillatory second order dynamics. Results show that online learning using interaction with controlled process is possible and it ensures significant improvement in control performance compared to arbitrarily tuned PI controller.
    Źródło:
    Archives of Control Sciences; 2021, 31, 3; 527-551
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Self-improving Q-learning based controller for a class of dynamical processes
    Autorzy:
    Musial, Jakub
    Stebel, Krzysztof
    Czeczot, Jacek
    Powiązania:
    https://bibliotekanauki.pl/articles/1845530.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    process control
    Q-learning algorithm
    reinforcement learning
    intelligent control
    on-line learning
    Opis:
    This paper presents how Q-learning algorithm can be applied as a general-purpose selfimproving controller for use in industrial automation as a substitute for conventional PI controller implemented without proper tuning. Traditional Q-learning approach is redefined to better fit the applications in practical control loops, including new definition of the goal state by the closed loop reference trajectory and discretization of state space and accessible actions (manipulating variables). Properties of Q-learning algorithm are investigated in terms of practical applicability with a special emphasis on initializing of Q-matrix based only on preliminary PI tunings to ensure bumpless switching between existing controller and replacing Q-learning algorithm. A general approach for design of Q-matrix and learning policy is suggested and the concept is systematically validated by simulation in the application to control two examples of processes exhibiting first order dynamics and oscillatory second order dynamics. Results show that online learning using interaction with controlled process is possible and it ensures significant improvement in control performance compared to arbitrarily tuned PI controller.
    Źródło:
    Archives of Control Sciences; 2021, 31, 3; 527-551
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The look-up algorithm of monitoring an object described by non-linear ordinary differential equations
    Autorzy:
    Hawro, Przemysław
    Kwater, Tadeusz
    Bartman, Jacek
    Kwiatkowski, Bogdan
    Powiązania:
    https://bibliotekanauki.pl/articles/2204529.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    adaptive estimation
    polluted river
    MATLAB
    lookup algorithm
    monitoring online
    algorytm wyszukiwania
    monitorowanie on-line
    zanieczyszczenie rzeki
    szacowanie adaptacyjne
    Opis:
    The article proposes an adaptive algorithm that generates all object signals, including those for which measurements are not performed due to the difficulties associated with on-line measurements. The algorithm is modeled on the idea of the Kalman filter using its equation, however, the selection of gains is optimized in a different way, i.e. the constant values depend on the adopted ranges of adaptation errors. Moreover, the knowledge of the statistics of all noise signals is not imposed and there is no linearity constraint. This approach allowed to reduce the complexity of calculations. This algorithm can be used in real-time systems to generate signals of objects described by non-linear differential equations and it is universal, which allows it to be used for various objects. In the conducted research, on the example of a biochemically contaminated river, only easily measurable signals were used to generated the object signals, and in addition, in the case of absence some measurements, the functioning of the algorithm did not destabilize.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 2; art. no. e144603
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A method for improving the precision of on-line phase measurement profilometry
    Autorzy:
    Mao, Z
    Cao, Y
    Zhong, L
    Cao, S
    Powiązania:
    https://bibliotekanauki.pl/articles/174406.pdf
    Data publikacji:
    2015
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    information optics
    Stoilov's algorithm
    phase measuring profilometry (PMP)
    on-line phase measurement profilometry (OPMP)
    phase-shifting
    pixel matching
    Opis:
    An on-line phase measurement profilometry based on improved Stoilov’s algorithm is proposed to measure the 3D shape of moving object. While only one frame sinusoidal grating is projected on the moving object, the equal phase-shifting step deformed patterns modulated by profile of the measured object can be captured at every equivalent moving distance of the measured object instead of digital phase-shifting. Stoilov’s algorithm is an equal phase-shifting step algorithm at an arbitrary phase-shifting step, which is suitable for on-line phase measurement profilometry. However, the arbitrary phase-shifting step of Stoilov’s algorithm depends on the captured deformed patterns, in which the digitized errors of digital light projector or CCD camera, and the disturbance of surrounding light could be introduced, it will lead to some abnormities in wrapped phase, such as the denominator in Stoilov’s algorithm could be zero, which could cause the reconstructed 3D profile of the measured object appear burr, distortion or aberration, even could not be reconstructed. So an on-line phase measurement profilometry based on improved Stoilov’s algorithm is proposed. The arbitrary phase-shifting step is retrieved by both pixel matching and fringe cycle calibration rather than the captured deformed patterns. Experiments verify the feasibility and effectiveness of the proposed on-line phase measurement profilometry.
    Źródło:
    Optica Applicata; 2015, 45, 1; 51-61
    0078-5466
    1899-7015
    Pojawia się w:
    Optica Applicata
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      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