Temat: binary representation - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Non-renewal multistate system with Semi-Markov components
Autorzy:: Grabski, F.
Powiązania:: https://bibliotekanauki.pl/articles/2069483.pdf
Data publikacji:: 2014
Wydawca:: Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:: Semi-Markov process
multistate system
multistate reliability functions
binary representation
Opis:: The paper deals with non-renewal multistate monotone systems consisting of multistate components which are modeled by the semi-Markov processes. In the case of a non-renewal system the multistate reliability functions of the system components and the whole system are discussed. All presented concepts and models are illustrated by simple numerical examples.
Źródło:: Journal of Polish Safety and Reliability Association; 2014, 5, 1; 63--70
2084-5316
Pojawia się w:: Journal of Polish Safety and Reliability Association
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: New formula for the failure/repair frequency of multi-state monotone systems and its applications
Autorzy:: Korczak, E.
Powiązania:: https://bibliotekanauki.pl/articles/969720.pdf
Data publikacji:: 2007
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: multi-state monotone systems
availability
repair frequency
binary representation
Shannon decomposition
random demand
Opis:: The paper deals with calculation methods for failure and repair frequencies of multi-state monotone systems, both for the instantaneous and steady state cases. First, the fixed demand is considered. Based on the binary representation of multi-state structure, we have obtained a new formula for the failure/repair frequency. This formula is used to derive simple rules for the calculation of failure/repair frequency. These rules show how to convert an expression for the system availability into appropriate expression for the system failure/repair frequency. The applicability of the rules is illustrated by some examples. Finally, expressions for the failure/repair frequency for systems operating under random demand are obtained. Since both input and output data have similar format, the rules can be used in a recursive manner, allowing easy analysis of complex systems with hierarchical structure.
Źródło:: Control and Cybernetics; 2007, 36, 1; 219-239
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Construction of Generalized Rademacher Functions in Terms of Ternary Logic : Solving the Problem of Visibility of Using Galois Fields for Digital Signal Processing
Autorzy:: Vitulyova, Elizaveta S.
Matrassulova, Dinara K.
Suleimenov, Ibragim E.
Powiązania:: https://bibliotekanauki.pl/articles/2055235.pdf
Data publikacji:: 2022
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: digital signal processing
non-binary Galois fields
fourier transform
rademacher functions
walsh function
multivalued logic
visibility problem
algebraic extensions
ternary representation of number
Opis:: Generalized Rademacher functions, constructed as a sequence of elements of Galois fields are intended to find the spectral representation of signals with levels. These functions form a complete basis on the interval corresponding to -1 discrete time intervals and for passing into the classical Rademacher functions. The advantage of such spectra obtained using Galois Fields Fourier Transform is that the range of variation of the spectrum amplitudes remains the same as the range of variation of the original signal, which is modeled on discrete time functions taking values in the Galois field.
Źródło:: International Journal of Electronics and Telecommunications; 2022, 68, 2; 237--244
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: FSM encoding for BDD representations
Autorzy:: Gosti, W.
Villa, T.
Saldanha, A.
Sangiovanni-Vincentelli, A. L.
Powiązania:: https://bibliotekanauki.pl/articles/911255.pdf
Data publikacji:: 2007
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: binarny diagram decyzyjny
kodowanie
automat skończony
synteza logiczna
weryfikacja formalna
binary decision diagram
encoding
finite state machine
logic synthesis
formal verification
logic representation
Opis:: We address the problem of encoding the state variables of a finite state machine such that the BDD representing the next state function and the output function has the minimum number of nodes. We present an exact algorithm to solve this problem when only the present state variables are encoded. We provide results on MCNC benchmark circuits.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2007, 17, 1; 113-128
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja