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

 الأثر V بالنسبة إلى   sinshT و خواصه قد تم دراسته في هذا البحث حيث تم دراسة علاقة الأثر المخلص والاثر المنتهى التولد والاثر المنفصل وربطها بالمؤثرات المتباينة حيث تم بهنة العلاقات التالية ان الاثر اذا وفقط اذا مقاس في حالة كون المؤثر هو عديم القوة وكذلك في حالة كون المؤثر شامل فان الاثر هو منتهي التولد اي ان الغضاء هو منتهي التولد وايضا تم برهن ان الاثر مخلص لكل مؤثر مقيد وك\لك قد تم التحقق من انه لاي مؤثر مقي

This study delves into the properties of the associated act V over the monoid S of sinshT. It examines the relationship between faithful, finitely generated, and separated acts, as well as their connections to one-to-one and onto operators. Additionally, the correlation between acts over a monoid and modules over a ring is explored. Specifically, it is established that  functions as an act over S if and only if  functions as module, where T represents a nilpotent operator. Furthermore, it is proved that when T is onto operator and  is finitely generated, is guaranteed to be finite-dimensional. Prove that for any bounded operator the following,  is acting over S if and only if  is a module where T is a nilpotent operator, is a

The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs  and , for some special graphs  . The dominant metric dimension of  is denoted by  and the dominant metric dimension of corona product graph G and H is denoted by .

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.