Learn More
A block graph is a graph in which every block is a complete graph. Let G be a block graph and let A be the adjacency matrix of G. We first obtain a formula for the determinant of A over reals. It is shown that A is nonsingular over IF2 if and only if the removal of any vertex from G produces a graph with exactly one odd component. A formula for the inverse(More)
A rapid growth in E-Commerce market is seen in recent time throughout the world. With ever increasing popularity of online shopping, Debit or Credit card fraud and personal information security are major concerns for customers, merchants and banks specifically in the case of CNP (Card Not Present). This paper presents a new approach for providing limited(More)
We present an efficient and novel numerical algorithm for inversion of transforms arising in imaging modalities such as ultrasound imaging, thermoacoustic and photoacoustic tomography, intravascular imaging, non-destructive testing, and radar imaging with circular acquisition geometry. Our algorithm is based on recently discovered explicit inversion(More)
The article presents an efficient image reconstruction algorithm for single scattering optical tomography (SSOT) in circular geometry of data acquisition. This novel medical imaging modality uses photons of light that scatter once in the body to recover its interior features. The mathematical model of SSOT is based on the broken ray (or V-line Radon)(More)
Steganography is method of data hiding behind multimedia file such as text, image, audio and video. For enhancing the security of data hiding and transmission over network, this paper proposed system which uses genetic algorithm along with Visual Cryptography. Plain text is converted into cipher text by using any cipher then it is hidden in LSB of image.(More)
We consider implementation of a deterministic allocation rule using transfers in quasi-linear private values environments. We show that in multidimensional single peaked type spaces, an allocation rule is implementable if and only if it satisfies a familiar and simple condition called 2-cycle monotonicity. * We are grateful to an editor and two anonymous(More)
We consider the problem of choosing a partition of a set of objects by a set of agents. The private information of each agent is a strict ordering over the set of partitions of the objects. A social choice function chooses a partition given the reported preferences of the agents. We impose a natural restriction on the allowable set of strict orderings over(More)