Hiding information on grayscale images has been drawing much attention in recent years. In pervious techniques, many schemes like Zhang and Wang’s method or Sudoku method use magic matrix as a plane reference to modify the LSBs of cover images.To further improve the hiding capacity and visual quality, we propose the so-called magic cube based (MCB) information hiding scheme. MCB is an early att...

Steganography is the technique of hiding a private message within a file in such a manner that third party cannot know the existence of matter or the hidden information. The purpose of Steganography is to create secrete communication between the sender and the receiver by replacing the least significant bits (LSB)of the cover image with the data bits. And in this paper we have shown that how im...

<p><span lang="EN-US">Information security is one of the most important branches concerned with maintaining confidentiality and reliability data medium for which it transmitted. Digital watermarking common techniques in this field developing greatly rapidly due to great importance represents security. Most modern systems, however, use self-organization map (SOM), safer than other al...

There are various methods for obtaining the preference vector of pair-wise comparison matrix factors. These methods can be employed when the elements of pair-wise comparison matrix are crisp while they are inefficient for fuzzy elements of pair-wise comparison matrix. In this paper, a method is proposed by which the preference vector of pair-wise comparison matrix elements can be obtained even ...

Perkembangan teknologi pada era digital dibidang informasi dan komunikasi telah mengubah prilaku masyarakat secara global, serta menyebabkan dunia tanpa batas berkembang cepat. Transformasi data jejaring global menjadi kebutuhan untuk memberikan yang akurat. pribadi akan memungkinkan menjadikan ancaman bagi pemilik atas perbuatan pihak lain tidak bertanggungjawab tujuan tertentu. Perlindungan p...

A graph G with at least 2m + 2 edges is said to be distance d m-extendable if for any matching M in G with m edges in which the edges lie pair-wise distance at least d, there exists a perfect matching in G containing M . In a previous paper, Aldred and Plummer proved that every 5-connected triangulation of the plane or the projective plane of even order is distance 5 m-extendable for any m. In ...

A graph G with at least 2m+2 edges is said to be distance d m-extendable if for any matching M of G with m edges in which the edges lie pair-wise distance at least d, there exists a perfect matching of G containing M . In [J. Graph Theory 67 (2011), no. 1, 38-46], Aldred and Plummer proved that every 5-connected triangulation on the plane or the projective plane with an even order is distance 5...