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-15 z 34
Tytuł:
A New Short Signature Scheme with Random Oracle from Bilinear Pairings
Autorzy:
Akleylek, S.
Kirlar, B. B.
Sever, Ö
Yüce, Z.
Powiązania:
https://bibliotekanauki.pl/articles/309497.pdf
Data publikacji:
2011
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
bilinear Diffie-Hellman problem
bilinear pairings
ring signature
short signatur
Opis:
In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is constructed by bilinear inverse-square Diffie-Hellman problem (BISDHP) and does not require any special hash function. The exact security proofs are also explained in the random Oracle model. We give the implementation and comparison results of our proposed signature scheme with the signature scheme proposed by Boneh, Lynn, Shacham (BLS) and Zhang, Safavi, Susilo (ZSS). Furthermore, we use this signature scheme to construct a ring signature scheme.
Źródło:
Journal of Telecommunications and Information Technology; 2011, 1; 5-10
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Relative determinant of a bilinear module
Autorzy:
Koprowski, Przemysław
Powiązania:
https://bibliotekanauki.pl/articles/729187.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
determinant
bilinear forms
projective modules
Opis:
The aim of the paper is to generalize the (ultra-classical) notion of the determinant of a bilinear form to the class of bilinear forms on projective modules without assuming that the determinant bundle of the module is free. Successively it is proved that this new definition preserves the basic properties, one expects from the determinant. As an example application, it is shown that the introduced tools can be used to significantly simplify the proof of a recent result by B. Rothkegel.
Źródło:
Discussiones Mathematicae - General Algebra and Applications; 2014, 34, 2; 203-212
1509-9415
Pojawia się w:
Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł:
Optical image encryption by using diffractive imaging with special constraint in the input plane
Autorzy:
Wang, Z.
Wang, H.
Yang, X.
Zhang, P.
Hou, C.
Qin, Y.
Powiązania:
https://bibliotekanauki.pl/articles/173781.pdf
Data publikacji:
2016
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
optical encryption
diffractive imaging
bilinear interpolation
Opis:
In order to simplify the optical setup and the encryption process, a diffractive-imaging-based optical encryption system using a single diffraction pattern is proposed. A predesigned binary mask is placed before the plaintext in the encryption process, and three randomly distributed phase only masks are placed in the optical path. Only one diffraction pattern needs to be recorded as ciphertext by CCD. In the decryption process, an iterative phase retrieval algorithm is applied, in which the predesigned binary mask acts as a support constraint in the input plane. After the iterative process, an interpolation operation for the zero-valued pixels is also implemented. The effectiveness and robustness of the proposal are demonstrated by numerical simulation results.
Źródło:
Optica Applicata; 2016, 46, 1; 57-69
0078-5466
1899-7015
Pojawia się w:
Optica Applicata
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The unit ball of \(L_s(^2l_{\infty}^3)\)
Autorzy:
Kim, Sung Guen
Powiązania:
https://bibliotekanauki.pl/articles/1912848.pdf
Data publikacji:
2017
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Symmetric bilinear forms
extreme points
exposed points
Opis:
We classify the extreme and exposed symmetric bilinear forms of the unit ball of the space \({\mathcal L}_s(^2l_{\infty}^3)\).
Źródło:
Commentationes Mathematicae; 2017, 57, 1
0373-8299
Pojawia się w:
Commentationes Mathematicae
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ł:
An observer design for Takagi-Sugeno fuzzy bilinear control systems
Autorzy:
Delmotte, François
Hadj Taieb, Nizar
Hammami, Mohamed Ali
Meghnafi, Houria
Powiązania:
https://bibliotekanauki.pl/articles/27314670.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
fuzzy systems
bilinear systems
stability analysis
observer design
Opis:
In this paper, the observer design problem for a T-S fuzzy bilinear control system is investigated. First, an observer of Kalman type is designed to estimate the system states for the linear case. Then, some new sufficient conditions are derived to show the exponential convergence of the solutions of the error equation for fuzzy bilinear systems. Furthermore, we consider some uncertainties of the system that are bounded and satisfy a certain condition where an observer is designed. Moreover, an application to Van de Vusse system is given.
Źródło:
Archives of Control Sciences; 2023, 33, 3; 631--649
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Depth extraction in computational integral imaging based on bilinear interpolation
Autorzy:
Huang, Huihua
Ge, Peng
Powiązania:
https://bibliotekanauki.pl/articles/1835812.pdf
Data publikacji:
2020
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
computational integral imaging
depth extraction
bilinear interpolation algorithm
Opis:
We proposed a method using a merit function to determine the depth of objects in computational integral imaging by analyzing the existing methods for depth extraction of target objects. To improve the resolution of reconstructed slice images, we use a digital camera moving in horizontal and vertical direction with the set interval to get elemental images with high resolution and bilinear interpolation algorithm to increase the number of pixels in slice image which improves the resolution obviously. To show the feasibility of the proposed method, we carried out our experiment and presented the results. We also compared it with other merit functions. The results show that merit function SMD2 to determine the depth of objects is more accurate and suitable for real-time application.
Źródło:
Optica Applicata; 2020, 50, 4; 497-509
0078-5466
1899-7015
Pojawia się w:
Optica Applicata
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some analytical properties of dissolving operators related with the Cauchy problem for a class of nonautonomous partial differential equations. Part. 1
Autorzy:
Pytel-Kudela, M.
Prykarpatsky, A.K.
Powiązania:
https://bibliotekanauki.pl/articles/254883.pdf
Data publikacji:
2006
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
dissolving operators
bilinear forms
Cauchy problem
semigroups
evolution equations
Opis:
The analytical properties of dissolving operators related with the Cauchy problem for a class of nonautonomous partial differential equations in Hilbert spaces are studied using theory of bilinear forms in respectively rigged Hilbert spaces triples. Theorems specifying the existence of a dissolving operator for a class of adiabatically perturbed nonautonomous partial differential equations are stated. Some applications of the results obtained are discussed.
Źródło:
Opuscula Mathematica; 2006, 26, 1; 131-136
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Anonymous signer verifiable encrypted signature from bilinear pairing
Autorzy:
Pomykała, J.
Trabszys, T.
Powiązania:
https://bibliotekanauki.pl/articles/969654.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
anonymous signer
verifiable encrypted signature
GDH group
bilinear pairing
Opis:
In this paper we propose and prove the security of the new cryptographic primitive called the Anonymous Signer Verifiable Encrypted Signature (ASVES), joining the idea of the group signature and the verifiable encrypted signature. It satisfies the traditional requirements of the group signature (unforgeability, anonymity, unlinkability, traceability) and the opacity condition known from the verifiable encrypted signatures. The corresponding scheme may be applied for the fair exchange protocols. Our construction is based on bilinear pairings, defined in the Gap Diffie-Hellman groups.
Źródło:
Control and Cybernetics; 2009, 38, 3; 705-712
0324-8569
Pojawia się w:
Control and Cybernetics
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ł:
Implementation of Bilinear Separation algorithm as a classification method for SSVEP-based brain-computer interface
Autorzy:
Jukiewicz, M.
Cysewska-Sobusiak, A.
Powiązania:
https://bibliotekanauki.pl/articles/114357.pdf
Data publikacji:
2015
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
brain-computer interface
SSVEP
bilinear separation
support vector machine (SVM)
Opis:
: The aim of this study was to create a two-class brain-computer interface. As in the case of research on SSVEP stimuli flashing at different frequencies were presented to four subjects. Optimal SSVEP recognition results can be obtained from electrodes: O1, O2 and Oz. In this work SVM classifier with Bilinear Separation algorithm have been compared. The best result in the offline tests using Bilinear Separation was: average accuracy of stimuli recognition 93% and ITR 33.1 bit/min, SVM: 90% and 32.8 bit/min.
Źródło:
Measurement Automation Monitoring; 2015, 61, 2; 51-53
2450-2855
Pojawia się w:
Measurement Automation Monitoring
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Admissible Disturbance Sets for Discrete Perturbed Systems
Autorzy:
Bouyaghroumni, J.
El Jai, A.
Rachik, M.
Powiązania:
https://bibliotekanauki.pl/articles/908336.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system dyskretny
wskaźnik dopuszczalności
discrete systems
bilinear disturbance
admissibility index
Opis:
We consider a discrete disturbed system given by the difference bilinear equation x^{w}_{i+1} =Ax^{w}_{i} + De_{i} + sum_{j=1}^{q}f^{j}_{i}B_{j}x^{w}_{i}, i geq 0, where w=((e_{i})_{i geq 0}, (f_{i})_{i geq 0}) are disturbances which excite the system in a linear and a bilinear form. We assume that the system is augmented with the output function y^{w}_{i}=Cx^{w}_{i}, i geq 0. Let varepsilon be a tolerance index on the output. The disturbance w is said to be varepsilon-admissible if ||y^{w}_{i}-y_{i}|| leq varepsilon, forall i geq 0, where (y_{i})_{i geq 0} is the output signal associated with the case of an uninfected system. The set of all varepsilon-admissible disturbances is the admissible set {cal W}(varepsilon). The characterization of {cal W}(varepsilon) is investigated and numerical simulations are given.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 2; 349-367
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
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ł:
The simulations of sequential of estimators for objects with a serial structure
Autorzy:
Kwater, T.
Krutys, P.
Powiązania:
https://bibliotekanauki.pl/articles/94851.pdf
Data publikacji:
2016
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
complex systems
dynamics equations
filter sequential
Riccati equation
bilinear equations
simulation
Opis:
The paper concerns the results of simulation of a certain approach, in which estimation of object state associated with the decentralization of calculations. It is realized by dividing the optimization problem into sub-problems of smaller dimensionality. The main idea of the method is to assign individual quality indicators to each sub-object and to carry out the synthesis of estimators in a sequential manner, starting with the last sub-object. Implementation of the estimation process requires knowledge about the measurements of the individual sub-objects. The parameters of the filter sequential gains are calculated based on Riccati equation solutions for subobjects and certain bilinear equations for cross-linkage connections. In the simulation tests the influence of types of connection between the sub-objects, the intensity disturbances of measurements and system on the values of coefficients of gains, as well as the estimation errors is presented.
Źródło:
Information Systems in Management; 2016, 5, 3; 347-357
2084-5537
2544-1728
Pojawia się w:
Information Systems in Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 34

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