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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Permutation, no-wait, no-idle flow shop problems
    Autorzy:
    Makuchowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/229973.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    flow shop problem
    permutation constraint
    no-wait constraint
    no-idle constraint
    permutation-graph models
    Opis:
    The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, no waiting and no idle flow shop problems. It is assessed the impact of the constraints on the extension of the schedules and correlations of the length of the schedules for these variants. It is also examined the effectiveness of a set of insert type algorithms. The efficiency of the algorithms is tested on well-known literature benchmarks.
    Źródło:
    Archives of Control Sciences; 2015, 25, 2; 189-199
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Permutation Coding with Injections for Modified PAM System
    Autorzy:
    Ogunyanda, Opeyemi O.
    Shongwe, Thokozani
    Swart, Theo G.
    Powiązania:
    https://bibliotekanauki.pl/articles/226518.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    injection
    permutation codes
    power line communications
    pulse amplitude modulation
    jitter
    Opis:
    Arriving at a good combination of coding and modulation schemes that can achieve good error correction constitutes a challenge in digital communication systems. In this work, we explore the combination of permutation coding (PC) and pulse amplitude modulation (PAM) for mitigating channel errors in the presence of background noise and jitter. Since PAM is characterised with bi-polar constellations, Euclidean distance is a good choice for predicting the performance of such coded modulation setup. In order to address certain challenges facing PCs, we therefore introduce injections in the coding system, together with a modified form of PAM system. This modification entails constraining the PAM constellations to the size of the codeword’s symbol. The results obtained demonstrate the strength of the modified coded PAM system over the conventional PC coded PAM system.
    Źródło:
    International Journal of Electronics and Telecommunications; 2020, 66, 3; 399-404
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An Improved Method of Permutation Correction in Convolutive Blind Source Separation
    Autorzy:
    Wang, L.
    Ding, H.
    Yin, F.
    Powiązania:
    https://bibliotekanauki.pl/articles/177954.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    blind source separation
    cocktail party
    convolutive mixing
    frequency domain
    permutation problem
    Opis:
    This paper proposes an improved method of solving the permutation problem inherent in frequency-domain of convolutive blind source separation (BSS). It combines a novel inter-frequency dependence measure: the power ratio of separated signals, and a simple but effective bin-wise permutation alignment scheme. The proposed method is easy to implement and surpasses the conventional ones. Simulations have shown that it can provide an almost ideal solution of the permutation problem for a case where two or three sources were mixed in a room with a reverberation time of 130 ms.
    Źródło:
    Archives of Acoustics; 2010, 35, 4; 493-504
    0137-5075
    Pojawia się w:
    Archives of Acoustics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    High-Rate Permutation Coding with Unequal Error Protection
    Autorzy:
    Ogunyanda, Kehinde
    Swart, Theo G.
    Ogunyanda, Opeyemi O.
    Powiązania:
    https://bibliotekanauki.pl/articles/2055239.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    channel coding
    high-rate codes
    permutation codes
    power line communications
    unequal error protection
    Opis:
    Channel coding provides numerous advantages to digital communications. One of such advantages is error correcting capabilities. This, however, comes at the expense of coding rate, which is a function of the codebook’s cardinality |C| or number of coded information bits and the codeword length M. In order to achieve high coding rate, we hereby report a channel coding approach that is capable of error correction under power line communications (PLC) channel conditions, with permutation coding as the coding scheme of choice. The approach adopts the technique of unequal error correction for binary codes, but with the exception that non-binary permutation codes are employed here. As such, certain parts of the information bits are coded with permutation symbols, while transmitting other parts uncoded. Comparisons with other conventional permutation codes are presented, with the proposed scheme exhibiting a relatively competitive performance in terms of symbol error rate.
    Źródło:
    International Journal of Electronics and Telecommunications; 2022, 68, 1; 27--33
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A comparison of nature inspired algorithms for the quadratic assignment problem
    Autorzy:
    Chmiel, W.
    Kadłuczka, P.
    Kwiecień, J.
    Filipowicz, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/202135.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    permutation problem
    quadratic assignment problem
    ant algorithm
    bees algorithm
    problem permutacji
    problem przydziału kwadratowego
    algorytm Ant Colony
    algorytm pszczół
    Opis:
    This paper presents an application of the ant algorithm and bees algorithm in optimization of QAP problem as an example of NP-hard optimization problem. The experiments with two types of algorithms: the bees algorithm and the ant algorithm were performed for the test instances of the quadratic assignment problem from QAPLIB, designed by Burkard, Karisch and Rendl. On the basis of the experiments results, an influence of particular elements of algorithms, including neighbourhood size and neighbourhood search method, will be determined.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 513-522
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    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