Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

In recent years, the performance of Spatial Data Infrastructures for governments and companies is a task that has gained ample attention. Different categories of geospatial data such as digital maps, coordinates, web maps, aerial and satellite images, etc., are required to realize the geospatial data components of Spatial Data Infrastructures. In general, there are two distinct types of geospatial data sources exist over the Internet: formal and informal data sources. Despite the growth of informal geospatial data sources, the integration between different free sources is not being achieved effectively. The adoption of this task can be considered the main advantage of this research. This article addresses the research question of how the

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

Face recognition is required in various applications, and major progress has been witnessed in this area. Many face recognition algorithms have been proposed thus far; however, achieving high recognition accuracy and low execution time remains a challenge. In this work, a new scheme for face recognition is presented using hybrid orthogonal polynomials to extract features. The embedded image kernel technique is used to decrease the complexity of feature extraction, then a support vector machine is adopted to classify these features. Moreover, a fast-overlapping block processing algorithm for feature extraction is used to reduce the computation time. Extensive evaluation of the proposed method was carried out on two different face ima

This paper presents a nonlinear finite element modeling and analysis of steel fiber reinforced concrete (SFRC) deep beams with and without openings in web subjected to two- point loading. In this study, the beams were modeled using ANSYS nonlinear finite element
software. The percentage of steel fiber was varied from 0 to 1.0%.The influence of fiber content in the concrete deep beams has been studied by measuring the deflection of the deep beams at mid- span and marking the cracking patterns, compute the failure loads for each deep beam, and also study the shearing and first principal stresses for the deep beams with and without openings and with different steel fiber ratios. The above study indicates that the location of openings an

tock markets changed up and down during time. Some companies’ affect others due to dependency on each other . In this work, the network model of the stock market is discribed as a complete weighted graph. This paper aims to investigate the Iraqi stock markets using graph theory tools. The vertices of this graph correspond to the Iraqi markets companies, and the weights of the edges are set ulrametric distance of minimum spanning tree.

Disease responses of eight wheat cultivars , Saber Beg. , Abu-Ghraib 3, Mexipak , Tamoz 2,Tamoz 3 , IPA 95 ,IPA 99 and Tahadi which were grown in four different sowing date , 25 th October , 19th September , 14th December and 8 January , to leaf rust disease caused by Puccinia recondita were investigated under natural infection conditions at the experimental farm , College of Agriculture , Abu-Ghraib, during the growing season of 1997-1998.Results of this study revealed that IPA 95, IPA 99 and Tahadi showed moderate resistant reaction, while Tamuz 3 was moderateley susceptable . Abu-Ghraib , Saber Beg, Tamuz 2 and Mexipak showed susceptible yeaction to the causal agent . The first sowing date was not suitable for disease progress in compars