Introduction:

        Many business owners suffer major financial problems during periods of financial stagnation, the decline of markets and businesses, or under the impact of financial shocks for certain reasons that result in large debts and the consequent financial and legal obligations. This is the beginning of a long and endless path of suffering and the search for a safe exit. It is even worse for financial institutions to facilitate financial solutions that rely on lending as a solution to their financial problem. Debt and its consequences increase, and the problem deepens and becomes complicated until things become entangled and the escape or declaration of bank

Data hiding is the process of encoding extra information in an image by making small modification to its pixels. To be practical, the hidden data must be perceptually invisible yet robust to common signal processing operations. This paper introduces a scheme for hiding a signature image that could be as much as 25% of the host image data and hence could be used both in digital watermarking as well as image/data hiding. The proposed algorithm uses orthogonal discrete wavelet transforms with two zero moments and with improved time localization called discrete slantlet transform for both host and signature image. A scaling factor ? in frequency domain control the quality of the watermarked images. Experimental results of signature image

We presented here a 65years old lady with an unusual presentation of a large epigastric hernia of twenty years duration .The swelling was occupying all the right hypochondrial region .The diagnosis was made on r^E^a-operative identification of the defect in the linea alba which wassutured after removal of the hernial sac and its contents .The postoperative course was uneventful and the patient remained with no complications or recurrence for more than two years follow up.

A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc