The revolution of multimedia has been a driving force behind fast and secured data transmission techniques. The security of image information from unapproved access is imperative. Encryptions technique is used to transfer data, where each kind of data has its own special elements; thus various methods should to be used to conserve distributing the image. This paper produces image encryption improvements based on proposed an approach to generate efficient intelligent session (mask keys) based on investigates from the combination between robust feature for ECC algebra and construction level in Greedy Randomized Adaptive Search Procedure (GRASP) to produce durable symmetric session mask keys consist of ECC points. Symmetric behavior for ECC

     The messages are ancient method to exchange information between peoples. It had many ways to send it with some security.

    Encryption and steganography was oldest ways to message security, but there are still many problems in key generation, key distribution, suitable cover image and others. In this paper we present proposed algorithm to exchange security message without any encryption, or image as cover to hidden. Our proposed algorithm depends on two copies of the same collection images set (CIS), one in sender side and other in receiver side which always exchange message between them.

      To send any message text the sender converts message to ASCII c

Digital forensic is part of forensic science that implicitly covers crime related to computer and other digital devices. It‟s being for a while that academic studies are interested in digital forensics. The researchers aim to find out a discipline based on scientific structures that defines a model reflecting their observations. This paper suggests a model to improve the whole investigation process and obtaining an accurate and complete evidence and adopts securing the digital evidence by cryptography algorithms presenting a reliable evidence in a court of law. This paper presents the main and basic concepts of the frameworks and models used in digital forensics investigation.

      In this work, the notion is defined by using    and some properties of this set are studied also,  and   Ù€ set are two concepts that are defined by using ; many examples have been cited to indicate that the reverse of the propositions and remarks is not achieved. In addition, new application example of nano was studied.

The concept of closed quasi principally injective acts over monoids is introduced ,which signifies a generalization for the quasi principally injective as well as for the closed quasi injective acts. Characterization of this concept is intended to show the behavior of a closed quasi principally injective property. At the same time, some properties of closed quasi principally injective acts are examined in terms of their endomorphism monoid. Also, the characterization of a closed self-principally injective monoid is given in terms of its annihilator. The relationship between the following concepts is also studied; closed quasi principally injective acts over monoids, Hopfian, co Hopfian, and directly finite property. Ultimately, based on

This article aims to cast a shadow over the history of mental health education and training in Iraq and a projection of Islamic scientific heritage in Baghdad during the seventh century. It also discloses the foundation of first teaching and training centers in psychiatry focusing on the marked contribution of the pioneer psychiatrists. Introduction. Up to our knowledge there is no elaborate published literature focusing on historical role of Iraq in mental health education and training and its current reality apart from scares data about mental health in Mediterranean region as a whole. In this article, we try calling the attention to the outstanding contribution of Iraq in mental health and medical educati

  Let L be a commutative ring with identity and let W be a unitary left L- module. A submodule D of an L- module W is called  s- closed submodule denoted by  D ≤sc W, if D has   no  proper s- essential extension in W, that is , whenever D ≤ W such that D ≤se H≤ W, then D = H. In  this  paper,  we study  modules which satisfies  the ascending chain  conditions (ACC) and descending chain conditions (DCC) on this kind of submodules.

The huge amount of documents in the internet led to the rapid need of text classification (TC). TC is used to organize these text documents. In this research paper, a new model is based on Extreme Machine learning (EML) is used. The proposed model consists of many phases including: preprocessing, feature extraction, Multiple Linear Regression (MLR) and ELM. The basic idea of the proposed model is built upon the calculation of feature weights by using MLR. These feature weights with the extracted features introduced as an input to the ELM that produced weighted Extreme Learning Machine (WELM). The results showed   a great competence of the proposed WELM compared to the ELM.