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

             In general, researchers and statisticians in particular have been usually used non-parametric regression models when the parametric methods failed to fulfillment their aim to analyze the models  precisely. In this case the parametic methods are useless so they turn to non-parametric methods for its easiness in programming. Non-parametric methods can also used to assume the parametric regression model for subsequent use. Moreover, as an advantage of using non-parametric methods is to solve the problem of Multi-Colinearity between explanatory variables combined with nonlinear data. This problem can be solved by using kernel ridge regression which depend o

    This research aims to review the importance of estimating the nonparametric regression function using so-called Canonical Kernel which depends on re-scale the smoothing parameter, which has a large and important role in Kernel  and give the sound amount of smoothing .

We has been shown the importance of this method through the application of these concepts on real data refer to international exchange rates to the U.S. dollar against the Japanese yen for the period from January 2007 to March 2010. The results demonstrated preference the nonparametric estimator with Gaussian on the other nonparametric and parametric regression estima

     Let  be any connected graph with vertices set  and edges set .  For any two distinct vertices  and , the detour distance between  and  which is denoted by  is a longest path between  and  in a graph . The detour polynomial of a connected graph  is denoted by ;  and is defined by . In this paper, the detour polynomial of the theta graph and the uniform theta graph will be computed.

Image pattern classification is considered a significant step for image and video processing.Although various image pattern algorithms have been proposed so far that achieved adequate classification,achieving higher accuracy while reducing the computation time remains challenging to date. A robust imagepattern classification method is essential to obtain the desired accuracy. This method can be accuratelyclassify image blocks into plain, edge, and texture (PET) using an efficient feature extraction mechanism.Moreover, to date, most of the existing studies are focused on evaluating their methods based on specificorthogonal moments, which limits the understanding of their potential application to various DiscreteOrthogonal Moments (DOMs). The

MCA has gained a reputation for being a very useful statistical method for determining the association between two or more categorical variables and their graphical description. For performance this method, we must calculate the singular vectors through (SVD). Which is an important primary tool that allows user to construct a low-dimensional space to describe the association between the variables categories. As an alternative procedure to use (SVD), we can use the (BMD) method, which involves using orthogonal polynomials to reflect the structure of ordered categorical responses. When the features of BMD are combined with SVD, the (HD) is formed. The aim of study is to use alternative method of (MCA) that is appropriate with order

Image pattern classification is considered a significant step for image and video processing. Although various image pattern algorithms have been proposed so far that achieved adequate classification, achieving higher accuracy while reducing the computation time remains challenging to date. A robust image pattern classification method is essential to obtain the desired accuracy. This method can be accurately classify image blocks into plain, edge, and texture (PET) using an efficient feature extraction mechanism. Moreover, to date, most of the existing studies are focused on evaluating their methods based on specific orthogonal moments, which limits the understanding of their potential application to various Discrete Orthogonal Moments (DOM

   Let M is a Г-ring. In this paper the concept of orthogonal symmetric higher bi-derivations on semiprime Г-ring is presented and studied and the relations of two symmetric higher bi-derivations on Г-ring are introduced.

An evaluation for the performance of model pile embedded in expansive soil was investigated. An extensive testing program was planned to achieve the purpose of this research. Therefore, special manufactured system was prepared for studying the behavior of model pile having different length to diameter ratios (L/D). Two types of piles were used in this research, straight shaft and under reamed piles. The effect of model pile type, L/D ratio and number of wetting drying cycles were studied. It is observed that significant reductions in pile movement when under   reamed piles were considered. A proposed design charts was presented for straight shaft and under reamed piles to estimate the length of both types of piles that is requi