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ę "minimum search" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    Electrodermal Response Ratios: Scoring Against the Stronger of Two Comparison Questions in Search of an Optimal Minimum Threshold
    Autorzy:
    Krapohl, Donald J.
    Powiązania:
    https://bibliotekanauki.pl/articles/1201078.pdf
    Data publikacji:
    2020
    Wydawca:
    Krakowska Akademia im. Andrzeja Frycza Modrzewskiego
    Tematy:
    polygraph examination
    electrodermal activity
    galvanic skin response (GSR)
    electrodermal response (EDR)
    Bigger-Is-Better Rule (BIBR)
    Opis:
    Previously, Krapohl (2020) evaluated the Bigger-Is-Better Rule (BIBR) on the polygraph electrodermal channel to assess whether there was a best minimum ratio between response sizes for assigning a score. Performance peaked at a minimum ratio between 10% and 20%. The ratios had been calculated by comparing the electrodermal responses for each relevant question against those of the immediately preceding comparison question. The analysis did not consider whether the same optimal ratio would be found if the relevant question electrodermal responses are compared to those of the stronger of two adjacent comparison questions. To investigate we analyzed responses from an independent sample of 255 laboratory cases. The data from those cases found the highest correlation between scores and ground truth occurred when the minimum difference between two electrodermal responses was 30%.
    Źródło:
    European Polygraph; 2020, 14, 2(52); 9-16
    1898-5238
    2380-0550
    Pojawia się w:
    European Polygraph
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    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ł:
    Ship Collision Avoidance by Distributed Tabu Search
    Autorzy:
    Kim, D.
    Hirayama, K.
    Okimoto, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/116919.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Safety of Navigation
    Collision Avoidance
    Distributed Tabu Search Algorithm (DTSA)
    Distributed Local Search Algorithm (DLSA)
    Quasi-Local Minimum (QLM)
    Tabu Search Algorithm
    Local Search Algorithm
    Distributed Tabu Search
    Opis:
    More than 90% of world trade is transported by sea. The size and speed of ships is rapidly increasing in order to boost economic efficiency. If ships collide, the damage and cost can be astronomical. It is very difficult for officers to ascertain routes that will avoid collisions, especially when multiple ships travel the same waters. There are several ways to prevent ship collisions, such as lookouts, radar, and VHF radio. More advanced methodologies, such as ship domain, fuzzy theory, and genetic algorithm, have been proposed. These methods work well in one-on-one situations, but are more difficult to apply in multiple-ship situations. Therefore, we proposed the Distributed Local Search Algorithm (DLSA) to avoid ship collisions as a precedent study. DLSA is a distributed algorithm in which multiple ships communicate with each other within a certain area. DLSA computes collision risk based on the information received from neighboring ships. However, DLSA suffers from Quasi-Local Minimum (QLM), which prevents a ship from changing course even when a collision risk arises. In our study, we developed the Distributed Tabu Search Algorithm (DTSA). DTSA uses a tabu list to escape from QLM that also exploits a modified cost function and enlarged domain of next-intended courses to increase its efficiency. We conducted experiments to compare the performance of DLSA and DTSA. The results showed that DTSA outperformed DLSA.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 1; 23-29
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Global minimum search using DMC algorithm with continuous weights
    Autorzy:
    Kazimirski, J. K.
    Powiązania:
    https://bibliotekanauki.pl/articles/121973.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
    Tematy:
    DMC algorithm
    diffusion Monte Carlo
    continuous objective function
    minimum search
    algorytm DMC
    metoda Monte Carlo
    funkcja ciągłego celu
    wyszukiwanie minimalne
    Opis:
    In this study we presented an algorithm for an unconstrained optimization of a continuous objective function, inspired by the Diffusion Monte Carlo method using a weight-based implementation. In this algorithm a cloud of replicas explores the solution space. Replicas are moved and evaluated after each step. Each replica carries an additional parameter (weight) which reflects the quality of its local solution. This parameter is updated after each step. Most inefficient replicas, i.e. replicas with the lowest weights, are occasionally replaced with their highest weight counterparts. In our study we present the basic implementation of the algorithm and compare its performance with other approaches, including the previously used implementation of DMC algorithm with a fluctuating population.
    Źródło:
    Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2011, 16; 117-122
    2450-9302
    Pojawia się w:
    Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Sufficient conditions for the convergence of nonautonomous stochastic search for a global minimum
    Autorzy:
    Tarłowski, Dawid
    Powiązania:
    https://bibliotekanauki.pl/articles/1368138.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
    Opis:
    The majority of stochastic optimization algorithms can be written in the general form $x_{t+1}$ = $T_t$ ($x_t$ ; $y_t$), where xt is a sequence of points and parameters which are transformed by the algorithm, Tt are the methods of the algorithm and $y_t$ represent the randomness of the algorithm. We extend the results of papers [11] and [14] to provide some new general conditions under which the algorithm nds a global minimum with probability one.
    Źródło:
    Universitatis Iagellonicae Acta Mathematica; 2011, 49; 73-83
    2084-3828
    0083-4386
    Pojawia się w:
    Universitatis Iagellonicae Acta Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A conception of optimality for algorithms and its application to the optimal search for a minimum
    Pojęcie optymalności algorytmów i jego zastosowanie do poszukiwania minimum
    Autorzy:
    Adamski, A.
    Korytowski, A.
    Mitkowski, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/740642.pdf
    Data publikacji:
    1977
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Źródło:
    Applicationes Mathematicae; 1976-1977, 15, 4; 499-510
    1233-7234
    Pojawia się w:
    Applicationes Mathematicae
    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