In modern technology, the ownership of electronic data is the key to securing their privacy and identity from any trace or interference. Therefore, a new identity management system called Digital Identity Management, implemented throughout recent years, acts as a holder of the identity data to maintain the holder’s privacy and prevent identity theft. Therefore, an overwhelming number of users have two major problems, users who own data and third-party applications will handle it, and users who have no ownership of their data. Maintaining these identities will be a challenge these days. This paper proposes a system that solves the problem using blockchain technology for Digital Identity Management systems. Blockchain is a powerful technique to build a digital identity in chain matters that enables a secure environment. The idea of Blockchain is to distribute the data across multiple devices in a cryptographic way, which will reduce the ability to an impossible level. Therefore, in this paper a proposed Digital Identity based on Blockchain (ERC 725, and ERC 735) with MD6 as a hashing algorithm will be implemented in a Secure smart contract can prevent function calls from being carried out until the sender has received confirmation from a reliable issuer; for example, we might include a feature that restricts smart contract interactions to legitimate users only. Many additional use cases are possible with ERC-725, including multi-sig execution approvals and contract call verification in place of key validation.
Graph is a tool that can be used to simplify and solve network problems. Domination is a typical network problem that graph theory is well suited for. A subset of nodes in any network is called dominating if every node is contained in this subset, or is connected to a node in it via an edge. Because of the importance of domination in different areas, variant types of domination have been introduced according to the purpose they are used for. In this paper, two domination parameters the first is the restrained and the second is secure domination have been chosn. The secure domination, and some types of restrained domination in one type of trees is called complete ary tree are determined.
In this research, we introduce and study the concept of fibrewise bitopological spaces. We generalize some fundamental results from fibrewise topology into fibrewise bitopological space. We also introduce the concepts of fibrewise closed bitopological spaces,(resp., open, locally sliceable and locally sectionable). We state and prove several propositions concerning with these concepts. On the other hand, we extend separation axioms of ordinary bitopology into fibrewise setting. The separation axioms we extend are called fibrewise pairwise T_0 spaces, fibrewise pairwise T_1 spaces, fibrewise pairwise R_0 spaces, fibrewise pairwise Hausdorff spaces, fibrewise pairwise functionally Hausdorff spaces, fibrewise pairwise regular spaces, fibrewise
... Show MoreThe bandwidth requirements of telecommunication network users increased rapidly during the last decades. Optical access technologies must provide the bandwidth demand for each user. The passive optical access networks (PONs) support a maximum data rate of 100 Gbps by using the Orthogonal Frequency Division Multiplexing (OFDM) technique in the optical access network. In this paper, the optical broadband access networks with many techniques from Time Division Multiplexing Passive Optical Networks (TDM PON) to Orthogonal Frequency Division Multiplex Passive Optical Networks (OFDM PON) are presented. The architectures, advantages, disadvantages, and main parameters of these optical access networks are discussed and reported which have many ad
... Show MoreThis article investigates Iraq wars presentation in literature and media. The first section investigates the case of the returnees from the war and their experience, their trauma and final presentation of that experience. The article also investigates how trauma and fear is depicted to create an optimized image and state of fear that could in turn show Iraqi society as a traumatized society. Critics such as Suzie Grogan believes that the concept of trauma could expand to influence societies rather than one individual after exposure to trauma of being involved in wars and different major conflicts. This is reflected in Iraq as a country that was subjected to six comprehensive conflicts in its recent history, i.e. less than half a century; th
... Show MoreThis paper introduces a relationship between the independence of polynomials associated with the links of the network, and the Jacobian determinant of these polynomials. Also, it presents a way to simplify a given communication network through an algorithm that splits the network into subnets and reintegrates them into a network that is a general representation or model of the studied network. This model is also represented through a combination of polynomial equations and uses Groebner bases to reach a new simplified network equivalent to the given network, which may make studying the ability to solve the problem of network coding less expensive and much easier.
The moon tree, the lover of the night, cholera, the sea changes its colors are poetic products left by the pioneer of free poetry, as many have called her. She used to write poetry and publish it in magazines and newspapers until she published it with collections that came into existence from an early age. Several factors helped her in that that contributed to the formation of her personality and the maturity of her talent, including factors Family, including environmental, and psychological, until she later became the focus of attention of many, so she became taught in the universities of London, and students stood by her method of writing free poetry, this poetic color that Badr Shaker Al-Sayyab participated in pioneering. Whoever exam
... Show MoreLet be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.