Email is one of the most commonly utilized communication methods. The confidentiality, the integrity and the authenticity are always substantial in communication of the e-mail, mostly in the business utilize. However, these security goals can be ensured only when the cryptography is utilized. Cryptography is a procedure of changing unique data into a configuration with the end goal that it is just perused by the coveted beneficiary. It is utilized to shield data from other individuals for security purposes. Cryptography algorithms can be classified as symmetric and asymmetric methods. Symmetric methods can be classified as stream cipher and block cipher. There are different operation modes provided by the block cipher, these are Cipher B

Automatic document summarization technology is evolving and may offer a solution to the problem of information overload. Multi-document summarization is an optimization problem demanding optimizing more than one objective function concurrently. The proposed work considers a balance of two significant objectives: content coverage and diversity while generating a summary from a collection of text documents. Despite the large efforts introduced from several researchers for designing and evaluating performance of many text summarization techniques, their formulations lack the introduction of any model that can give an explicit representation of – coverage and diversity – the two contradictory semantics of any summary. The design of gener

In any security system, we need a high level of security, to maintain the secrecy of important data. Steganography is one of the security systems that are hiding secret information within a certain cover (video, image, sound, text), so that the adversary does not suspect the existence of such confidential information. In our proposed work will hide secret messages (Arabic or English) text in the Arabic cover text, we employed the RNA as a tool for encoding the secret information and used non-printed characters to hide these codes. Each character (English or Arabic) is represented by using only six bits based on secret tables this operation has provided a good compression since each Arabic character needs 16 bits and each English characte

This research aims to analyze and simulate biochemical real test data for uncovering the relationships among the tests, and how each of them impacts others. The data were acquired from Iraqi private biochemical laboratory. However, these data have many dimensions with a high rate of null values, and big patient numbers. Then, several experiments have been applied on these data beginning with unsupervised techniques such as hierarchical clustering, and k-means, but the results were not clear. Then the preprocessing step performed, to make the dataset analyzable by supervised techniques such as Linear Discriminant Analysis (LDA), Classification And Regression Tree (CART), Logistic Regression (LR), K-Nearest Neighbor (K-NN), Naïve Bays (NB

The widespread of internet allover the world, in addition to the increasing of the huge number of users that they exchanged important information over it highlights the need for a new methods to protect these important information from intruders' corruption or modification. This paper suggests a new method that ensures that the texts of a given document cannot be modified by the intruders. This method mainly consists of mixture of three steps. The first step which barrows some concepts of "Quran" security system to detect some type of change(s) occur in a given text. Where a key of each paragraph in the text is extracted from a group of letters in that paragraph which occur as multiply of a given prime number. This step cannot detect the ch

Let  be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset  is a minimum neighborhood dominating set if  is a dominating set and if for every  holds. The minimum cardinality of the minimum neighborhood dominating set of a graph  is called as minimum neighborhood dominating number and it is denoted by  . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the

        Most vegetation’s are Land cover (LC) for the globe, and there is an increased attention to plants since they represent an element of balance to natural ecology and maintain the natural balance of rapid changes due to systematic and random human uses, including the subject of the current study (Bassia eriophora ) Which represent an essential part of the United Nations system for land cover classification (LCCS), developed by the World Food Organization (FAO) and the world Organization for environmental program (UNEP), to observe basic environmental elements with modern techniques. Although this plant is distributed all over Iraq, we found that this plant exists primarily in the middle

The sending of information at the present time requires the speed and providing protection for it. So compression of the data is used in order to provide speed and encryption is used in order to provide protection. In this paper a proposed method is presented in order to provide compression and security for the secret information before sending it. The proposed method based on especial keys with MTF transform method to provide compression and based on RNA coding with MTF encoding method to provide security. The proposed method based on multi secret keys. Every key is designed in an especial way. The main reason in designing these keys in special way is to protect these keys from the predication of the unauthorized users.

     . Suppose that  is the Cayley graph whose vertices are all elements of  and two vertices  and  are adjacent if and only if . In this paper,we introduce the generalized Cayley graph denoted by  which is a graph with a vertex set consisting of all column matrices  in which all components are in  and two vertices  and  are adjacent if and only if , where  is a column matrix that each entry is the inverse of the similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and  and m . We aim to provide some basic properties of the new graph and determine the structure of  when  is a complete graph  for every , and n, m  .