A basis of the conjunctively polynomial-like Boolean functions.
Page 1 Next
Gonda, J. (2009)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Fon-Der-Flaass, D.G. (2007)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Qian Fang, Ying Liu, Xiaoqun Zhao (2008)
Kybernetika
Security mechanisms for wireless sensor networks (WSN) face a great challenge due to the restriction of their small sizes and limited energy. Hence, many protocols for WSN are not designed with the consideration of security. Chaotic cryptosystems have the advantages of high security and little cost of time and space, so this paper proposes a secure cluster routing protocol based on chaotic encryption as well as a conventional symmetric encryption scheme. First, a principal-subordinate chaotic function...
Vladimir D. Tonchev (1986)
Mathematische Zeitschrift
L. Losonczi (1981)
Metrika
Bruce R. Ebanks (1981)
Kybernetika
Gül Deniz Çayli (2023)
Kybernetika
Uninorms on bounded lattices have been recently a remarkable field of inquiry. In the present study, we introduce two novel construction approaches for uninorms on bounded lattices with a neutral element, where some necessary and sufficient conditions are required. These constructions exploit a t-norm and a closure operator, or a t-conorm and an interior operator on a bounded lattice. Some illustrative examples are also included to help comprehend the newly added classes of uninorms.
Doretta Vivona, Maria Divari (2005)
Kybernetika
In the fuzzy setting, we define a collector of fuzzy information without probability, which allows us to consider the reliability of the observers. This problem is transformed in a system of functional equations. We give the general solution of that system for collectors which are compatible with composition law of the kind “inf”.
Bliudze, S., Krob, D. (2006)
The Electronic Journal of Combinatorics [electronic only]
Igor Vajda, Petr Nedoma (1973)
Kybernetika
Mahmud Yunus, Mohamad Ilham Dwi Firmansyah, Kistosil Fahim Subiono (2024)
Kybernetika
We propose a cryptographic algorithm utilizing integer wavelet transform via a lifting scheme. In this research, we construct some predict and update operators within the lifting scheme of wavelet transforms employing operations in min-max-plus algebra, termed as lifting scheme integer wavelet transform over min-max-plus algebra (MMPLS-IWavelet). The analysis and synthesis process on MMPLS-IWavelet is implemented for both encryption and decryption processes. The encryption key comprises a sequence...
Kim, D.G., Kim, H.K. (2002)
International Journal of Mathematics and Mathematical Sciences
de Oliveira Casaca, Wallace Correa, Boaventura, Maurílio (2010)
Mathematical Problems in Engineering
Grolmusz, Vince (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Igor Vajda (1971)
Aplikace matematiky
Igor Vajda (1971)
Aplikace matematiky
John R. Williams, Kevin Amaratunga (1997)
The journal of Fourier analysis and applications [[Elektronische Ressource]]
Saifallah Ghobber (2018)
Czechoslovak Mathematical Journal
The aim of this paper is to prove a quantitative version of Shapiro's uncertainty principle for orthonormal sequences in the setting of Gabor-Hankel theory.
Popescu, Constantin, Oros, Horea (2004)
Acta Universitatis Apulensis. Mathematics - Informatics
Ng, Michael K. (2002)
Electronic Journal of Mathematical and Physical Sciences (EJMAPS)
Page 1 Next