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

The structure of this paper includes an introduction to the definition of the nano topological space, which was defined by M. L. Thivagar, who defined the lower approximation of G and the upper approximation of G, as well as defined the boundary region of G and some other important definitions that were mentioned in this paper with giving some theories on this subject. Some examples of defining nano perfect mappings are presented along with some basic theories. Also, some basic definitions were presented that form the focus of this paper, including the definition of nano  pseudometrizable space, the definition of nano compactly generated space, and the definition of completely nano para-compact. In this paper, we presented images of nan

In this research we will present the signature as a key to the biometric authentication technique. I shall use moment invariants as a tool to make a decision about any signature which is belonging to the certain person or not. Eighteen voluntaries give 108 signatures as a sample to test the proposed system, six samples belong to each person were taken. Moment invariants are used to build a feature vector stored in this system. Euclidean distance measure used to compute the distance between the specific signatures of persons saved in this system and with new sample acquired to same persons for making decision about the new signature. Each signature is acquired by scanner in jpg format with 300DPI. Matlab used to implement this system.

Systems on Chips (SoCs) architecture complexity is result of integrating a large numbers of cores in a single chip. The approaches should address the systems particular challenges such as reliability, performance, and power constraints. Monitoring became a necessary part for testing, debugging and performance evaluations of SoCs at run time, as On-chip monitoring is employed to provide environmental information, such as temperature, voltage, and error data. Real-time system validation is done by exploiting the monitoring to determine the proper operation of a system within the designed parameters. The paper explains the common monitoring operations in SoCs, showing the functionality of thermal, voltage and soft error monitors. The different

   In this paper, we introduce a new type of functions in bitopological spaces, namely, (1,2)*-proper functions. Also, we study the basic properties and characterizations of these functions . One of the most important of equivalent definitions to the (1,2)*-proper functions is given by using (1,2)*-cluster points of filters . Moreover we define and study (1,2)*-perfect functions and (1,2)*-compact functions in bitopological spaces and we study the relation between (1,2)*-proper functions and each of (1,2)*-closed functions , (1,2)*-perfect functions and (1,2)*-compact functions and we give an example when the converse may not be true .
 

Watermarking operation can be defined as a process of embedding special wanted and reversible information in important secure files to protect the ownership or information of the wanted cover file based on the proposed singular value decomposition (SVD) watermark. The proposed method for digital watermark has very huge domain for constructing final number and this mean protecting watermark from conflict. The cover file is the important image need to be protected. A hidden watermark is a unique number extracted from the cover file by performing proposed related and successive operations, starting by dividing the original image into four various parts with unequal size. Each part of these four treated as a separate matrix and applying SVD