In recent years, social media has been increasing widely and obviously as a media for users expressing their emotions and feelings through thousands of posts and comments related to tourism companies. As a consequence, it became difficult for tourists to read all the comments to determine whether these opinions are positive or negative to assess the success of a tourism company. In this paper, a modest model is proposed to assess e-tourism companies using Iraqi dialect reviews collected from Facebook. The reviews are analyzed using text mining techniques for sentiment classification. The generated sentiment words are classified into positive, negative and neutral comments by utilizing Rough Set Theory, Naïve Bayes and K-Nearest Neighbor

The density-based spatial clustering for applications with noise (DBSCAN) is one of the most popular applications of clustering in data mining, and it is used to identify useful patterns and interesting distributions in the underlying data. Aggregation methods for classifying nonlinear aggregated data. In particular, DNA methylations, gene expression. That show the differentially skewed by distance sites and grouped nonlinearly by cancer daisies and the change Situations for gene excretion on it. Under these conditions, DBSCAN is expected to have a desirable clustering feature i that can be used to show the results of the changes. This research reviews the DBSCAN and compares its performance with other algorithms, such as the tradit

Was expanded display high reflectivity of the spectral remote infrared (m j 14-8) adoption order Alcolmtin ????????? thickness optical northeastern quarter wavelength and compared with results of previous studies based Aldrashalhalah on Ndharah matrix distinctive amended and fall of light close to the vertical arrangement multilayer materials buffer and in thin films homogeneous and uniform properties deposited on germanium basis results showed that the best choice for governments and their kills to expand bandwidth high reflectivity is much easier for the infrared than the area visible in addition to the order of these stacks is the cornerstone of the filters other visual...

The High Modulus Asphalt Concrete Mixture (HMACM) or (EME) (Enrobes a Module Eleve) developed in France, since, 1980 by Laboratories Central des Ponts et Chaussees (LCPC). Due to the increasing in traffic intensity and axle loading this type of mixing were suitable for pavement subjected to heavy duty. Experiments showed that EME mixtures have an excellent moisture damage resistance permanent deformation, fatigue cracking and reducing costs of maintenance and a significant reduction in thickness of pavement. Because of the high stiffness of EME mixes, the stresses transformed to the bottom laid layer by repeated traffic wheel loads were reduced effectively. This study intend to focus the light into the possibility of producing asphalt mixtu

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app