The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time.   Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 900 to 2700 step 900 directions. Then, we systematized each code word depending on its angle  to involve four types of binary code books (i.e. Pour when , Flat when  , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding procedure, with very small distortion per block, by designing s

  In this work, we construct and classify the projectively distinct (k,3)-arcs in PG(2,9), where k ≥ 5, and prove that the complete (k,3)-arcs do not exist, where 5 ≤ k ≤ 13. We found that the maximum complete (k,3)-arc in PG(2,q) is the (16,3)-arc and the minimum complete (k,3)-arc in PG(2,q) is the (14,3)-arc. Moreover, we found the complete (k,3)-arcs between them.

  The purpose of this work is to study the classification and construction of (k,3)-arcs in the projective plane PG(2,7). We found that there are two (5,3)-arcs, four (6,3)-arcs, six (7,3)arcs, six (8,3)-arcs, seven (9,3)-arcs, six (10,3)-arcs and six (11,3)-arcs.         All of these arcs are incomplete.         The number of distinct (12,3)-arcs are six, two of them are complete.         There are four distinct (13,3)-arcs, two of them are complete and one (14,3)-arc which is incomplete.         There exists one complete (15,3)-arc.
 

Since the Internet has been more widely used and more people have access to multimedia content, copyright hacking, and piracy have risen. By the use of watermarking techniques, security, asset protection, and authentication have all been made possible. In this paper, a comparison between fragile and robust watermarking techniques has been presented to benefit them in recent studies to increase the level of security of critical media. A new technique has been suggested when adding an embedded value (129) to each pixel of the cover image and representing it as a key to thwart the attacker, increase security, rise imperceptibility, and make the system faster in detecting the tamper from unauthorized users. Using the two watermarking ty

The 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

This paper is mainly concerned with the study of the moral aspects that prompts William Shakespeare to attempt a romance in which he has embedded the epitome of his thought, experience, and philosophy concerning certain significant aspects of human life whose absence or negligence may threaten human existence, peace, and stability. From the beginning of history man realizes the importance of prosperity on the many and various levels that touch and address his needs and desires—natural, material, and spiritual. The Tempest, due to the dramatist's awareness of the aforementioned values, reflects the dramatist's duty as to projecting and unfolding these important aspects, reconciliation and forgiveness, that promote prosperity which is th

         This paper is mainly concerned with the study of the moral aspects that prompts William Shakespeare to attempt a romance in which he has embedded the epitome of his thought, experience, and philosophy concerning certain significant aspects of human life whose absence or negligence may threaten human existence, peace, and stability. From the beginning of history man realizes the importance of prosperity on the many and various levels that touch and address his needs and desires—natural, material,  and spiritual. The Tempest, due to the dramatist's awareness of the aforementioned values, reflects the dramatist's duty as to projecting and unfolding these important aspects, rec

Czerwi’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 K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi