Abstract Digital water marking has been undergoing rapid improvements in technology enhancement. We in this work have proposed an algorithm that can help digital watermarking of health system images. We have also applied it with a signal processor and practiced in real-time system. In the experimentation we have found that it has produced better transparency and immune to a larger number... Digital water marking has been undergoing rapid improvements in technology enhancement. We in this work have proposed an algorithm that can help digital watermarking of health system images. We have also applied it with a signal processor and practiced in real-time system. In the experimentation we have found that it has produced better transparency and immune to a larger number of cyber-attacks. We have performed the trails on the base of evaluation of mean-squared error and signal to noise ratio of the reconstructed images. Read More Read Less

Abstract In this work we have introduced a new watermarking algorithm for securing video images. We have decomposed the bit planes where the monochrome watermark is given the video frame colour channels. We further inserted a CB-SVD algorithm with a reduced cyclic scheme and used to insert the watermark. Reduced insertion scheme reduces the level of degradation of video while simultaneously... In this work we have introduced a new watermarking algorithm for securing video images. We have decomposed the bit planes where the monochrome watermark is given the video frame colour channels. We further inserted a CB-SVD algorithm with a reduced cyclic scheme and used to insert the watermark. Reduced insertion scheme reduces the level of degradation of video while simultaneously extracting a high quality watermark. The proposed RCB-SVD algorithm has no deficiency for detection of a false watermark, as is the case with standard SVD algorithms. The builtin redundancy of the reduced cyclical insertion scheme increases the resistance to “frame-dropping” attacks. When we compared with earlier outcome, the repair of the extracted watermark was achieved by a good margin. Read More Read Less

Abstract We in this paper deal with Bent functions which are essential for cryptographic binary functions. These functions make very small subset of the total number of bent functions, especially for large number of variables. We do not find any formal method for construction of bent functions. Hence the methods for construction of bent functions are obtained by using the discovery... We in this paper deal with Bent functions which are essential for cryptographic binary functions. These functions make very small subset of the total number of bent functions, especially for large number of variables. We do not find any formal method for construction of bent functions. Hence the methods for construction of bent functions are obtained by using the discovery of bent functions within a group of functions. For experimenting the bentness across a group of functions, even for small numbers of variables, requires a lot of processing time. We in this work introduced an efficient method for bentness testing of binary functions using statistical analysis of binary functions. The standard method for bentness testing is based on the usage of the fast Walsh transform calculations. This method uses conditional testing of the initial set of particular Walsh coefficients. In the current work, the selection of coefficients for conditional testing is determined using statistical analysis of binary functions. Read More Read Less

Abstract Recently it is found that the new NoSQL databases have better features and capabilities where the older ones do not have. In this work, we present the NoSQL graph databases, and propose a graph data model that corresponds to a generic traditional relational database model found within the majority of today’s 112C e-Commerce applications. The act of mapping relational databases... Recently it is found that the new NoSQL databases have better features and capabilities where the older ones do not have. In this work, we present the NoSQL graph databases, and propose a graph data model that corresponds to a generic traditional relational database model found within the majority of today’s 112C e-Commerce applications. The act of mapping relational databases to graph databases provides a solid basis for carrying out profound analyses of the implicit relationships among entity types’ instances and gaining significant insights that cannot be incurred otherwise. Read More Read Less