Homomorphism

This paper proposes a definition of a fuzzy partition element based on the homomorphism between type-1 fuzzy sets and the three-valued Kleene algebra. A new clustering method based on the C-means algorithm, using the defined partition, is presented in this paper, which will be validated with the traditional iris clustering problem by measuring its petals.

In this article, a new notion of $n$-Jordan homomorphism namely the mixed $n$-Jordan homomorphism is introduced. It is proved that how a mixed $(n+1)$-Jordan homomorphism can be a mixed $n$-Jordan homomorphism and vice versa. By means of some examples, it is shown that the mixed $n$-Jordan homomorphisma are different from the $n$-Jordan homomorphisms and the pseudo $n$-Jordan homomorphisms. As a consequence, it shown that every mixed Jordan homomorphism from Banach algebra $\mathcal{A}$ into commutative semisimple Banach algebra $\mathcal{B}$ is automatically continuous. Under some mild conditions, every unital pseudo $3$-Jordan homomorphism can be a homomorphism.

Abstract: Starting with the underlying motivation of developing a general theory of L-fuzzy sets where L is a multilattice (a particular case of non-deterministic algebra), we study the relationship between the crisp notions of congruence, homomorphism and substructure on some non-deterministic algebras which have been used in the literature, ie hypergroups, and join spaces. Moreover, we provide suitable extensions of these notions to the fuzzy case.

In this paper we consider fuzzy relations compatible with algebraic operations, which are called fuzzy relational morphisms. In particular, we aim our attention to those fuzzy relational morphisms which are uniform fuzzy relations, called uniform fuzzy relational morphisms, and those which are partially uniform F-functions, called fuzzy homomorphisms. Both uniform fuzzy relations and partially uniform F-functions were introduced in a recent paper by us. Uniform fuzzy relational morphisms are especially interesting because they can be conceived as fuzzy congruences which relate elements of two possibly different algebras. We give various characterizations and constructions of uniform fuzzy relational morphisms and fuzzy homomorphisms, we establish certain relationships between them and fuzzy congruences, and we prove homomorphism and isomorphism theorems concerning them. We also point to some applications of uniform fuzzy relational morphisms.

Abstract. We define the stability of a subgroup under a class of maps, and establish the basic prop-erties of this notion. Loosely speaking, we will say that a normal subgroup, or more generally a normal series {An} of a group A, is stable under a class of homomorphisms H if ...

Canetti and Fischlin have recently proposed the security notion <em>universal composability</em> for commitment schemes and provided two examples. This new notion is very strong. It guarantees that security is maintained even when an unbounded number of copies of the scheme are running concurrently, also it guarantees non-malleability, resilience to selective decommitment, and security against adaptive adversaries. Both of their schemes uses Theta(k) bits to commit to one bit and can be based on the existence of trapdoor commitments and non-malleable encryption.<br /> <br />We present new universally composable commitment schemes based on the Paillier cryptosystem and the Okamoto-Uchiyama cryptosystem. The schemes are efficient: to commit to k bits, they use a constant number of modular exponentiations and communicates O(k) bits. Furthermore the scheme can be instantiated in either perfectly hiding or perfectly binding versions. These are the first schemes to...

Abstract. We present a generic symbolic analysis framework for imperative programming languages. Our framework is capable of computing all valid variable bindings of a program at given program points. This information is invaluable for domain-specific static program analyses such as memory leak detection, program parallelisation, and the detection of superfluous bound checks, variable aliases and task deadlocks. We employ path expression algebra to model the control flow information of programs. A homomorphism maps path expressions into the symbolic domain. At the center of the symbolic domain is a compact algebraic structure called supercontext. A supercontext contains the complete control and data flow analysis information valid at a given program point. Our approach to compute supercontexts is based purely on algebra and is fully automated. This novel representation of program semantics closes the gap between program analysis and computer algebra systems, which makes supercontext...