Offline Arabic handwritten recognition lies in a major field of challenge due to the changing styles of writing from one individual to another. It is difficult to recognize the Arabic handwritten because of the same appearance of the different characters.  In this paper a proposed method for Offline Arabic handwritten recognition. The   proposed method for recognition hand-written Arabic word without segmentation to sub letters based on feature extraction scale invariant feature transform (SIFT) and   support vector machines (SVMs) to enhance the recognition accuracy. The proposed method  experimented using (AHDB) database. The experiment result  show  (99.08) recognition  rate.

The multi-focus image fusion method can fuse more than one focused image to generate a single image with more accurate description. The purpose of image fusion is to generate one image by combining information from many source images of the same scene. In this paper, a multi-focus image fusion method is proposed with a hybrid pixel level obtained in the spatial and transform domains. The proposed method is implemented on multi-focus source images in YCbCr color space. As the first step two-level stationary wavelet transform was applied on the Y channel of two source images. The fused Y channel is implemented by using many fusion rule techniques. The Cb and Cr channels of the source images are fused using principal component analysis (PCA).

A new features extraction approach is presented based on mathematical form the modify soil ratio (MSR) and skewness for numerous environmental studies. This approach is involved the investigate on the separation of features using frequency band combination by ratio to estimate the quantity of these features, and it is exhibited a particular aspect to determine the shape of features according to the position of brightness values in a digital scenes, especially when the utilizing the skewness. In this research, the marginal probability density function G(MSR) derivation for the MSR index is corrected, that mentioned in several sources including the source (Aim et al.). This index can be used on original input features space for three diffe

Improving in assembling technology has provided machines of higher evaluation with better resistances and managed behavior. This machinery led to remarkably higher dynamic forces and therefore higher stresses. In this paper, a dynamic investigation of rectangular machine diesel and gas engines foundation at the top surface of one-layer dry sand with various states (i.e., loose, medium and dense) was carried out. The dynamic investigation is performed numerically by utilizing limited component programming, PLAXIS 3D. The soil is accepted as flexible totally plastic material submits to Mohr-Coulomb yield basis. A harmonic load is applied at the foundation with amplitude of 10 kPa at a frequency of (10, 15 and 20) HZ and se

It is commonly known that Euler-Bernoulli’s thin beam theorem is not applicable whenever a nonlinear distribution of strain/stress occurs, such as in deep beams, or the stress distribution is discontinuous. In order to design the members experiencing such distorted stress regions, the Strut-and-Tie Model (STM) could be utilized. In this paper, experimental investigation of STM technique for three identical small-scale deep beams was conducted. The beams were simply supported and loaded statically with a concentrated load at the mid span of the beams. These deep beams had two symmetrical openings near the application point of loading. Both the deep beam, where the stress distribution cannot be assumed linear, and the ex

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith