In modern times face recognition is one of the vital sides for computer vision. This is due to many reasons involving availability and accessibility of technologies and commercial applications. Face recognition in a brief statement is robotically recognizing a person from an image or video frame. In this paper, an efficient face recognition algorithm is proposed based on the benefit of wavelet decomposition to extract the most important and distractive features for the face and Eigen face method to classify faces according to the minimum distance with feature vectors. Faces94 data base is used to test the method. An excellent recognition with minimum computation time is obtained with accuracy reaches to 100% and recognition time decrease

          Sentiment analysis refers to the task of identifying polarity of positive and negative for particular text that yield an opinion. Arabic language has been expanded dramatically in the last decade especially with the emergence of social websites (e.g. Twitter, Facebook, etc.). Several studies addressed sentiment analysis for Arabic language using various techniques. The most efficient techniques according to the literature were the machine learning due to their capabilities to build a training model. Yet, there is still issues facing the Arabic sentiment analysis using machine learning techniques. Such issues are related to employing robust features that have the ability to discrimina

The application of the test case prioritization method is a key part of system testing intended to think it through and sort out the issues early in the development stage. Traditional prioritization techniques frequently fail to take into account the complexities of big-scale test suites, growing systems and time constraints, therefore cannot fully fix this problem. The proposed study here will deal with a meta-heuristic hybrid method that focuses on addressing the challenges of the modern time. The strategy utilizes genetic algorithms alongside a black hole as a means to create a smooth tradeoff between exploring numerous possibilities and exploiting the best one. The proposed hybrid algorithm of genetic black hole (HGBH) uses the

With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as  and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu  is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied  to some special graphs.

     This paper introduced a hybrid technique for lossless image compression of natural and medical images; it is based on integrating the bit plane slicing and Wavelet transform along with a mixed polynomial of linear and non linear base. The experiments showed high compression performance with fully grunted reconstruction.

Liquid membrane electrodes for the determination iron(III) were constructed based on chloramphenicol sodium succinate and iron(III) CPSS-Fe(III) as ion pair complex, with four plasticizers Di-butyl phosphate (DBP); Di-butyl phthalate (DBPH); Di-octyl phthalate (DOP); Tri-butyl phosphate (TBP); in PVC matrix . These electrodes give Nernstian and sub-Nernstian slopes (19.79, 24.60, 16.01 and 13.82mV/decade) and linear ranges from (1x10-5-1x10-2 M, 1x10-5-1x10-2 M, 1x10-6-1x10-2 M and 1x10-5-1x10-2 M) respectively. The best electrode was based on DBP plasticizer which gave a slope 19.79 mV/decade, correlation coefficient 0.9999, detection limit of 9×10-6 M, lifetime 37 day displayed good stability and reproducibility and used to determine

     In this paper a design of new robust and dynamic cryptosystem using stream key generator with good random statistical properties is introduced. The results of the statistical tests, initialization and the components of the proposed generator of the suggested cryptosystem are detailed in [1]. The proposed cryptosystem called Robust and Efficient Dynamic Stream Cipher Cryptosystem (RDSCC). The dynamic here means the generator of RDSCC has unfixed construction; the design will be changed as the seed (initial) key changed. The generator will construct itself by barrows number of Linear Feedback Shift Registers (LFSR’s), randomly, stored in protected bank file. The RDSCC is constructed to be flexibl