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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    Identification of stable elementary bilinear time-series model
    Autorzy:
    Malinski, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/229601.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    bilinear model
    time-series
    identification
    Opis:
    The paper presents new approach to estimation of the coefficients of an elementary bilinear time series model (EB). Until now, a lot of authors have considered different identifiability conditions for EB models which implicated different identifiability ranges for the model coefficient. However, all of these ranges have a common feature namely they are significantly narrower than the stability range of the EB model. This paper proposes a simple but efficient solution which makes an estimation of the EB model coefficient possible within its entire stability range.
    Źródło:
    Archives of Control Sciences; 2016, 26, 4; 577-595
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model
    Autorzy:
    Jurkiewicz, Mariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/2055214.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    forward secure digital signature scheme
    bilinear pairing of Type 3
    random oracle model
    bilinear Diffie-Hellman inversion problem
    Opis:
    In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a completely abstract fashion it ought to be viewed as being actually defined over E(Fqn )[p] × E(Fqnk )[p] → Fqnk [p]. The crucial element of the scheme is the key updater algorithm. With the adoption of pairings and binary trees where a number of leaves is the same as a number of time periods, we are assured that an updated secret key can not be used to recover any of its predecessors. This, in consequence, means that the scheme is forward-secure. To formally justify this assertion, we conduct analysis in fu-cma security model by reducing the security of the scheme to the computational hardness of solving the Weak ℓ-th Bilinear Diffie-Hellman Inversion problem type. We define this problem and explain why it can be treated as a source of security for cryptographic schemes. As for the reduction itself, in general case, it could be possible to make only in the random oracle model.
    Źródło:
    International Journal of Electronics and Telecommunications; 2021, 67, 4; 717--726
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Secure And Efficient Encryption Scheme Based on Bilinear Mapping
    Autorzy:
    Verma, Vandani
    Mishra, Pragya
    Powiązania:
    https://bibliotekanauki.pl/articles/2124750.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    bilinear mapping
    encryption
    KGC
    ID-OWE
    discrete log problem
    Opis:
    With the increasing uses of internet technologies in daily life, vulnerability of personal data/information is also increasing. Performing secure communication over the channel which is insecure has always been a problem because of speedy development of various technologies. Encryption scheme provides secrecy to data by enabling only authorized user to access it. In the proposed paper, we present an encryption algorithm designed for data security based on bilinear mapping and prove it secure by providing its security theoretical proof against adaptive chosen cipher-text attack. With the help of a lemma, we have shown that no polynomially bounded adversary has non-negligible advantage in the challenging game. We also give the comparative analysis of the proposed scheme in terms of security and performance with Deng et al., 2020 and Jiang et al., 2021 schemes and prove that proposed algorithm is more efficient and secure than others existing in literature against adaptive chosen cipher-text attack.
    Źródło:
    International Journal of Electronics and Telecommunications; 2022, 68, 3; 469--473
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Ideal observability for bilinear discrete-time systems with and without delays in observation
    Autorzy:
    Lhous, M.
    Rachik, M.
    Magri, E. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/229630.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    bilinear systems
    Hilbert spaces
    ideal observability
    observability subspace
    delayed observation
    Opis:
    An ideal observability subspace expression is stated for bilinear abstract system with bounded operator in Hilbert spaces. The case of finite dimentional space is also treated. However, it’s noticed that the state ideal observability can never be fulfilled within an infinite dimensional phase space in the case of scalar output. The case of bilinear discrete-time system with delays in observation is also described. To illustrate this work some examples are presented.
    Źródło:
    Archives of Control Sciences; 2018, 28, 4; 601-616
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Uniform exponential stabilization of distributed bilinear parabolic time delay systems with bounded feedback control
    Autorzy:
    Tsouli, Azzeddine
    Ouarit, Mostafa
    Powiązania:
    https://bibliotekanauki.pl/articles/2134886.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    time delay
    uniform exponential stabilization
    bilinear parabolic systems
    bounded feedback control
    Opis:
    In this paper we deal with the problem of uniform exponential stabilization for a class of distributed bilinear parabolic systems with time delay in a Hilbert space by means of a bounded feedback control. The uniform exponential stabilization problem of such a system reduces to stabilizing only its projection on a suitable finite dimensional subspace. Furthermore, the stabilizing feedback control depends only on the state projection on the finite dimensional subspace. An explicit decay rate estimate of the stabilized state is given provided that a non-standard weaker observability condition is satisfied. Illustrative examples for partial functional differential equations are displayed.
    Źródło:
    Archives of Control Sciences; 2022, 32, 2; 257--278
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An efficient and provably - secure digital signature scheme based on elliptic curve bilinear pairings
    Autorzy:
    Islam, S. K. H.
    Biswas, G. P.
    Powiązania:
    https://bibliotekanauki.pl/articles/375650.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    Elliptic curve cryptography
    bilinear pairing
    Map-to-point function
    digital signature
    random oracle model
    provably secure
    Opis:
    We proposed an efficient and secure digital signature scheme using elliptic curve cryptography (ECC) and bilinear pairings in this paper. The proposed scheme employs the general cryptographic hash function (i.e., SHA-1) instead of map-to-point function, because the map-to-point is a cost-intensive operation and it is usually implemented as a probabilistic algorithm. Further, our scheme is computationally efficient as one bilinear paring and three elliptic curve scalar point multiplication operations are executed for signature generation and verification, and thus the scheme requires much lesser computation cost than other related schemes. In addition, in the random oracle model, our scheme is proven to be existential unforgeable against the adaptive chosen message and identity attacks (EUF-CMA) based on a variation of the collusion attack algorithm with ktraitors (k-CAA3) problem.
    Źródło:
    Theoretical and Applied Informatics; 2012, 24, 2; 109-118
    1896-5334
    Pojawia się w:
    Theoretical and Applied Informatics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Static anti-windup compensator based on BMI optimisation for discrete-time systems with cut-off constraints
    Autorzy:
    Horla, Dariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/2090701.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    anti-windup compensation
    bilinear matrix inequalities
    cut-off constraint
    kompensacja zjawiska windup
    dwuliniowe nierówności macierzy
    ograniczenie odcięcia
    Opis:
    In the paper, a design method of a static anti-windup compensator for systems with input saturations is proposed. First, an anti-windup controller is presented for system with cut-off saturations, and, secondly, the design problem of the compensator is presented to be a non-convex optimization problem easily solved using bilinear matrix inequalities formulation. This approach guarantees stability of the closed-loop system against saturation nonlinearities and optimizes the robust control performance while the saturation is active.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 1; e135837, 1--8
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Static anti-windup compensator based on BMI optimisation for discrete-time systems with cut-off constraints
    Autorzy:
    Horla, Dariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/2173541.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    anti-windup compensation
    bilinear matrix inequalities
    cut-off constraint
    kompensacja zjawiska windup
    dwuliniowe nierówności macierzy
    ograniczenie odcięcia
    Opis:
    In the paper, a design method of a static anti-windup compensator for systems with input saturations is proposed. First, an anti-windup controller is presented for system with cut-off saturations, and, secondly, the design problem of the compensator is presented to be a non-convex optimization problem easily solved using bilinear matrix inequalities formulation. This approach guarantees stability of the closed-loop system against saturation nonlinearities and optimizes the robust control performance while the saturation is active.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 1; art. no. e135837
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      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