With the increasing rate of unauthorized access and attacks, security of confidential data is of utmost importance. While Cryptography only encrypts the data, but as the communication takes place in presence of third parties, so the encrypted text can be decrypted and can easily be destroyed. Steganography, on the other hand, hides the confidential data in some cover source such that the existence of the data is also hidden which do not arouse suspicion regarding the communication taking place between two parties. This paper presents to provide the transfer of secret data embedded into master file (cover-image) to obtain new image (stego-image), which is practically indistinguishable from the original image, so that other than the indeed user, cannot detect the presence of the secrete data sent. Least Significant Bit (LSB) and Pseudo Random Number Generator (PRGN) are used to hide the secrete data. The Proposed approach is better in PSNR value and Capacity as shown experimentally than existing techniques.
Arab translators have always paid great attention to the translation of the Persian literary genres, in particular, contemporary Iranian novels. They have always translated for the most prominent Iranian novelists such as Jalal Al Ahmad, Sadiq Hidayat, Mahmoud Dowlatabadi, Bozorg Alavi, Ismail Fasih, Houshang Golshiri, Gholam-Hossein Saedi, Simin Daneshvar, Sadiq Chubak, Samad Behrangi and others that have succeeded in perfectly picturing the Iranian society.
Within the perspectives of Arab translators and by using the descriptive - analytical approach, the present study provides an analytical study of the translation into Arabic some of the modern Persian novels. Moreove
... Show MoreThe current work concerns preparing cobalt manganese ferrite (Co0.2Mn0.8Fe2O4) and decorating it with polyaniline (PAni) for supercapacitor applications. The X-ray diffraction findings (XRD) manifested a broad peak of PAni and a cubic structure of cobalt manganese ferrite with crystal sizes between 21 nm. The pictures were taken with a field emission scanning electron microscope (FE-SEM), which evidenced that the PAni has nanofibers (NFs) structures, grain size 33 – 55 nm, according to the method of preparation, where the hydrothermal method was used. The magnetic measurements (VSM) that were conducted at room temperature showed that the samples had definite magnetic properties. Additionally, it was noted that the saturation magnetizatio
... Show MoreThe reaction of 2-amino-benzothiazole with bis [O,O-2,3,O,O – 5,6 – (chloro(carboxylic) methiylidene) ] – L – ascorbic acid (L-AsCl2) gave new product 3-(Benzo[d]Thaizole-2-Yl) – 9-Oxo-6,7,7a,9-Tertrahydro-2H-2,10:4,7-Diepoxyfuro [3,2-f][1,5,3] Dioxazonine – 2,4 (3H) – Dicarboxylic Acid, Hydro-chloride (L-as-am)), which has been insulated and identified by (C, H, N) elemental microanalysis (Ft-IR),(U.v–vis), mass spectroscopy and H-NMR techniques. The (L-as am) ligand complexes were obtained by the reaction of (L-as-am) with [M(II) = Co,Ni,Cu, and Zn] metal ions. The synthesized complexes are characterized by Uv–Visible (Ft –IR), mass spectroscopy molar ratio, molar conductivity, and Magnetic susceptibility techniques. (
... Show MoreIn regression testing, Test case prioritization (TCP) is a technique to arrange all the available test cases. TCP techniques can improve fault detection performance which is measured by the average percentage of fault detection (APFD). History-based TCP is one of the TCP techniques that consider the history of past data to prioritize test cases. The issue of equal priority allocation to test cases is a common problem for most TCP techniques. However, this problem has not been explored in history-based TCP techniques. To solve this problem in regression testing, most of the researchers resort to random sorting of test cases. This study aims to investigate equal priority in history-based TCP techniques. The first objective is to implement
... Show MoreCzerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show MoreIn this paper two ranking functions are employed to treat the fuzzy multiple objective (FMO) programming model, then using two kinds of membership function, the first one is trapezoidal fuzzy (TF) ordinary membership function, the second one is trapezoidal fuzzy weighted membership function. When the objective function is fuzzy, then should transform and shrinkage the fuzzy model to traditional model, finally solving these models to know which one is better
six specimens of the Hg0.5Pb0.5Ba2Ca2Cu3-y
Most recognition system of human facial emotions are assessed solely on accuracy, even if other performance criteria are also thought to be important in the evaluation process such as sensitivity, precision, F-measure, and G-mean. Moreover, the most common problem that must be resolved in face emotion recognition systems is the feature extraction methods, which is comparable to traditional manual feature extraction methods. This traditional method is not able to extract features efficiently. In other words, there are redundant amount of features which are considered not significant, which affect the classification performance. In this work, a new system to recognize human facial emotions from images is proposed. The HOG (Histograms of Or
... Show MoreThe security of message information has drawn more attention nowadays, so; cryptography has been used extensively. This research aims to generate secured cipher keys from retina information to increase the level of security. The proposed technique utilizes cryptography based on retina information. The main contribution is the original procedure used to generate three types of keys in one system from the retina vessel's end position and improve the technique of three systems, each with one key. The distances between the center of the diagonals of the retina image and the retina vessel's end (diagonal center-end (DCE)) represent the first key. The distances between the center of the radius of the retina and the retina vessel's end (ra
... Show More