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ę "Wojciechowski, J" wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Automatic parametric fault detection in complex analog systems based on a method of minimum node selection
    Autorzy:
    Bilski, A.
    Wojciechowski, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/330761.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    complex analog system
    support vector machine (SVM)
    tabu search
    genetic algorithm
    parametric fault detection
    system analogowy
    maszyna wektorów wspierających
    metoda tabu search
    algorytm genetyczny
    detekcja uszkodzeń
    Opis:
    The aim of this paper is to introduce a strategy to find a minimal set of test nodes for diagnostics of complex analog systems with single parametric faults using the support vector machine (SVM) classifier as a fault locator. The results of diagnostics of a video amplifier and a low-pass filter using tabu search along with genetic algorithms (GAs) as node selectors in conjunction with the SVM fault classifier are presented. General principles of the diagnostic procedure are first introduced, and then the proposed approach is discussed in detail. Diagnostic results confirm the usefulness of the method and its computational requirements. Conclusions on its wider applicability are provided as well.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 655-668
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Artificial intelligence methods in diagnostics of analog systems
    Autorzy:
    Bilski, P.
    Wojciechowski, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/908112.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    fault detection
    artificial intelligence
    analog system
    detekcja uszkodzeń
    sztuczna inteligencja
    system analogowy
    Opis:
    The paper presents the state of the art and advancement of artificial intelligence methods in analog systems diagnostics. Firstly, the diagnostic domain is introduced and its problems explained. Then, computational intelligence approaches usable for fault detection and identification are reviewed. Particular groups of methods are presented in detail, explaining their usefulness and drawbacks. Examples, such as the induction motor or the electronic filter, are provided to show the applicability of the presented approaches for monitoring the state of analog objects from engineering domains. The discussion section reviews the presented approaches, their future prospects and problems to be solved.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 2; 271-282
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Some remarks on evaluating the quality of the multiple sequence alignment based on the BAliBASE benchmark
    Autorzy:
    Błażewicz, J.
    Formanowicz, P.
    Wojciechowski, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/930013.pdf
    Data publikacji:
    2009
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    dostosowanie odniesienia
    dokładność ustawienia
    multiple sequence alignment
    reference alignment
    alignment accuracy
    Opis:
    BAliBASE is one of the most widely used benchmarks for multiple sequence alignment programs. The accuracy of alignment methods is measured by bali score-an application provided together with the database. The standard accuracy measures are the Sum of Pairs (SP) and the Total Column (TC). We have found that, for non-core block columns, results calculated by bali score are different from those obtained on the basis of the formal definitions of the measures. We do not claim that one of these measures is better than the other, but they are definitely different. Such a situation can be the source of confusion when alignments obtained using various methods are compared. Therefore, we propose a new nomenclature for the measures of the quality of multiple sequence alignments to distinguish which one was actually calculated. Moreover, we have found that the occurrence of a gap in some column in the first sequence of the reference alignment causes column discarding.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2009, 19, 4; 675-678
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A general on-the-fly algorithm for modifying the kinematic tree hierarchy
    Autorzy:
    Stępień, J.
    Polański, A.
    Wojciechowski, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/331314.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    dynamika
    animacja
    bryła sztywna
    dynamics
    articulated system
    rigid bodies
    system hierarchy
    contact
    animation
    Opis:
    When conducting a dynamic simulation of a multibody mechanical system, the model definition may need to be altered during the simulation course due to, e.g., changes in the way the system interacts with external objects. In this paper, we propose a general procedure for modifying simulation models of articulated figures, particularly useful when dealing with systems in time-varying contact with the environment. The proposed algorithm adjusts model connectivity, geometry and current state, producing its equivalent ready to be used by the simulation procedure. Furthermore, we also provide a simple usage scenario-a passive planar biped walker.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2012, 22, 2; 423-435
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Internet shopping optimization problem
    Autorzy:
    Błażewicz, J.
    Kovalyov, M. Y.
    Musiał, J.
    Urbański, A. P.
    Wojciechowski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/907755.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    algorytm
    złożoność obliczeniowa
    algorytm kombinatoryczny
    optymalizacja
    zakupy internetowe
    algorithm
    computational complexity
    combinatorial algorithms
    optimization
    Internet shopping
    Opis:
    A high number of Internet shops makes it difficult for a customer to review manually all the available offers and select optimal outlets for shopping. A partial solution to the problem is brought by price comparators which produce price rankings from collected offers. However, their possibilities are limited to a comparison of offers for a single product requested by the customer. The issue we investigate in this paper is a multiple-item multiple-shop optimization problem, in which total expenses of a customer to buy a given set of items should be minimized over all available offers. In this paper, the Internet Shopping Optimization Problem (ISOP) is defined in a formal way and a proof of its strong NP-hardness is provided. We also describe polynomial time algorithms for special cases of the problem.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 385-390
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      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