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.
Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.
The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs and , for some special graphs . The dominant metric dimension of is denoted by and the dominant metric dimension of corona product graph G and H is denoted by .
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 MoreThere is a mutual relationship between the form of a text and its meaning so as separating these two or devaluating the role of one of them leads to the absence of the value therein. Thus, a translation is important as to how it relates the details of a text. That is, the text has special features which go beyond form, and these set out its distinctiveness. Here, we tackle Saleh al-Jafari's Arabic translation of "Rubbayat al-Khayyam" of Naysapour descriptively and analytically by depending on extracts from the original text. This translation is evaluated on the basis of Spanish critic Maria Carmen Valero Garces. Herein, we discuss the effectiveness of this theory in the criticism of literary texts. It has been concluded that al-Jaf
... 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 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 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 MoreThe transportation problem (TP) is employed in many different situations, such as scheduling, performance, spending, plant placement, inventory control, and employee scheduling. When all variables, including supply, demand, and unit transportation costs (TC), are precisely known, effective solutions to the transportation problem can be provided. However, understanding how to investigate the transportation problem in an uncertain environment is essential. Additionally, businesses and organizations should seek the most economical and environmentally friendly forms of transportation, considering the significance of environmental issues and strict environmental legislation. This research employs a novel ranking function to solve the transpor
... Show More