Definition. A group G consists of a set G together with a binary operation ∗ for which the following properties are satisfied: • (x ∗ y) ∗ z = x ∗ (y ∗ z) for all elements x, y, and z of G (the Associative Law); • there exists an element e of G (known as the identity element of G) such that e ∗ x = x = x ∗ e, for all elements x of G; • for each element x of G there exists an element x′ of G (kn...

We present a trust model extension that attempts to relax the assumptions that are currently taken by the majority of existing trust models: (i) proven identity of agents, (ii) repetitive interactions and (iii) similar trusting situations. The proposed approach formalizes the situation (context) and/or trusted agent identity in a multi-dimensional Identity-Context feature space, and attaches th...

using the analytic-historical method, this article attempts to explain the cultural policies of the first shah of the pahlavi dynasty toward women. relying on the theory of evolution and formation of national identity in iran, the article seeks to answer this question: ‘what is the impact of the cultural policies of the first shah of the pahlavi dynasty on the occurrence of identity crisis amon...

‎Let $R$ be commutative ring with identity and $M$ be an $R$-module‎. ‎The zero divisor graph of $M$ is denoted $Gamma{(M)}$‎. ‎In this study‎, ‎we are going to generalize the zero divisor graph $Gamma(M)$ to submodule-based zero divisor graph $Gamma(M‎, ‎N)$ by replacing elements whose product is zero with elements whose product is in some submodules $N$ of $M$‎. ‎The main objective of this pa...