Hiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.

This paper demonstrates the design of an algorithm to represent the design stages of fixturing system that serve in increasing the flexibility and automation of fixturing system planning for uniform polyhedral part. This system requires building a manufacturing feature recognition algorithm to present or describe inputs such as (configuration of workpiece) and built database system to represents (production plan and fixturing system exiting) to this algorithm. Also knowledge – base system was building or developed to find the best fixturing analysis (workpiece setup, constraints of workpiece and arrangement the contact on this workpiece) to workpiece.

Text Clustering consists of grouping objects of similar categories. The initial centroids influence operation of the system with the potential to become trapped in local optima. The second issue pertains to the impact of a huge number of features on the determination of optimal initial centroids. The problem of dimensionality may be reduced by feature selection. Therefore, Wind Driven Optimization (WDO) was employed as Feature Selection to reduce the unimportant words from the text. In addition, the current study has integrated a novel clustering optimization technique called the WDO (Wasp Swarm Optimization) to effectively determine the most suitable initial centroids. The result showed the new meta-heuristic which is WDO was employed as t

        The set of all (n×n) non-singular matrices over the field F. And this set forms a group under the operation of matrix multiplication. This group is called the general linear group of dimension  over the field F, denoted by . The determinant of these matrices is a homomorphism from  into F* and the kernel of this homomorphism was the special linear group and denoted by  Thus  is the subgroup of  which contains all matrices of determinant one.

The rationally valued characters of the rational representations are written as a linear combination of the induced characters for the groups discussed in this paper. We find the Artin indicator for this group after studying the rationally valued characters of the rational

In this research, a group of gray texture images of the Brodatz database was studied by building the features database of the images using the gray level co-occurrence matrix (GLCM), where the distance between the pixels was one unit and for four angles (0, 45, 90, 135). The k-means classifier was used to classify the images into a group of classes, starting from two to eight classes, and for all angles used in the co-occurrence matrix. The distribution of the images on the classes was compared by comparing every two methods (projection of one class onto another where the distribution of images was uneven, with one category being the dominant one. The classification results were studied for all cases using the confusion matrix between every

In this research, a group of gray texture images of the Brodatz database was studied by building the features database of the images using the gray level co-occurrence matrix (GLCM), where the distance between the pixels was one unit and for four angles (0, 45, 90, 135). The k-means classifier was used to classify the images into a group of classes, starting from two to eight classes, and for all angles used in the co-occurrence matrix. The distribution of the images on the classes was compared by comparing every two methods (projection of one class onto another where the distribution of images was uneven, with one category being the dominant one. The classification results were studied for all cases using the confusion matrix between ev