A basis of the conjunctively polynomial-like Boolean functions.
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...
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.
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”.
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.