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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Creation of unequal error protection codes for two groups of symbols
    Autorzy:
    Kuriata, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/907938.pdf
    Data publikacji:
    2008
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    kody z niejednakową ochroną
    kody doskonałe
    górna granica Hamminga
    dolna granica Hilberta
    macierz generująca
    kody pływające
    unequal error protection codes (UEP codes)
    perfect codes
    Hamming’s upper bound
    Hilbert’s lower bound
    generation matrix
    Opis:
    This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of generating asymptotic UEP codes is built. An analog model of Hamming’s upper bound and Hilbert’s lower bound for asymptotic UEP codes is determined.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2008, 18, 2; 251-257
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Peopling an Unaccustomed Earth with a New Generation: Jhumpa Lahiri’s Supreme Fictional Journey into Human Conditions
    Zaludnianie nieoswojonej ziemi nową generacją: Jhumpy Lahiri niezwykła podróż w głąb ludziej natury.
    Autorzy:
    Saxena, Neela Bhattacharya
    Powiązania:
    https://bibliotekanauki.pl/articles/437213.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Pedagogiczny im. Komisji Edukacji Narodowej w Krakowie. Instytut Filozofii i Socjologii
    Tematy:
    Bengali literature
    diasporic writing
    feminism
    generation
    Gynocentric matrix
    Jhumpa Lahiri
    postcolonial studies
    Opis:
    Using a theoretical framework derived from my ongoing engagement with what I have called a ‘Gynocentric matrix’ of Indic sensibility, along with James Hillman’s polytheistic psychology and Wallace Stevens’ notion of a Supreme Fiction, this paper offers a reading of Jhumpa Lahiri’s (b. 1967) short stories beyond postcolonial criticism. Stemming from a depth consciousness where life, living and death, joy, indifference and sorrow, generation, de/re-generation, and transformation are intricately intertwined, Lahiri’s fictional multiverse, opposed to universe, is peopled by a new generation of characters who speak to the soul of the reader, while in the process, she sculpts a reality that does not tolerate any homogenizing impulse in the name of an abstract unity.
    Źródło:
    ARGUMENT: Biannual Philosophical Journal; 2012, 2, 1; 129-150
    2083-6635
    2084-1043
    Pojawia się w:
    ARGUMENT: Biannual Philosophical Journal
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Experimental Determination of a Reflective Muffler Scattering Matrix for Single-Mode Excitation
    Autorzy:
    Gorazd, Łukasz
    Powiązania:
    https://bibliotekanauki.pl/articles/2141712.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    cylindrical duct
    reflective muffler
    single mode generation
    multi-port method
    scattering matrix
    Opis:
    The aim of the paper is to experimentally determine the scattering matrix S of an example reflective muffler of cylindrical geometry for Helmholtz number exceeding the plane wave propagation. Determining the scattering matrix of an acoustic systems is a new and increasingly used approach in the assessment of reduction of noise propagating inside duct-like elements of heating, ventilation and air conditioning systems (HVAC). The scattering matrix of an acoustic system provides all necessary information on the propagation of wave through it. In case of the analysed reflective silencer, considered as a two-port system, the noise reduction was determined by calculating the transmission loss parameter (TL) based on the scattering matrix (S). Measurements were carried out in two planes of the cross-section of pipes connected to the muffler. The paper presents results of the scattering matrix evaluation for the wave composed of the plane wave (mode (0,0)) and the first radial mode (0,1), each of which was generated separately using the self-designed and constructed single-mode generator. The gain of proceeding measurements for single modes stems from the fact that theoretically, calculation of the S-matrix does not require, as will be presented in the paper, calculation of the measurement data inverse matrix. Moreover, if single mode sound fields are well determined, it ensures error minimization. The presented measurement results refer to an example of a duct like system with a reflective muffler for which the scattering matrix S was determined. The acoustic phenomena inside such a system can be scaled by the parameter ka.
    Źródło:
    Archives of Acoustics; 2021, 46, 4; 667-675
    0137-5075
    Pojawia się w:
    Archives of Acoustics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization on the complementation procedure towards efficient implementation of the index generation function
    Autorzy:
    Borowik, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/330597.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    data reduction
    feature selection
    indiscernibility matrix
    logic synthesis
    index generation function
    redukcja danych
    selekcja cech
    synteza logiczna
    funkcja generowania indeksów
    Opis:
    In the era of big data, solutions are desired that would be capable of efficient data reduction. This paper presents a summary of research on an algorithm for complementation of a Boolean function which is fundamental for logic synthesis and data mining. Successively, the existing problems and their proposed solutions are examined, including the analysis of current implementations of the algorithm. Then, methods to speed up the computation process and efficient parallel implementation of the algorithm are shown; they include optimization of data representation, recursive decomposition, merging, and removal of redundant data. Besides the discussion of computational complexity, the paper compares the processing times of the proposed solution with those for the well-known analysis and data mining systems. Although the presented idea is focused on searching for all possible solutions, it can be restricted to finding just those of the smallest size. Both approaches are of great application potential, including proving mathematical theorems, logic synthesis, especially index generation functions, or data processing and mining such as feature selection, data discretization, rule generation, etc. The problem considered is NP-hard, and it is easy to point to examples that are not solvable within the expected amount of time. However, the solution allows the barrier of computations to be moved one step further. For example, the unique algorithm can calculate, as the only one at the moment, all minimal sets of features for few standard benchmarks. Unlike many existing methods, the algorithm additionally works with undetermined values. The result of this research is an easily extendable experimental software that is the fastest among the tested solutions and the data mining systems.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2018, 28, 4; 803-815
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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