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

The main purpose of this paper is to study feebly open and feebly closed mappings and we proved several results about that by using some concepts of topological feebly open and feebly closed sets , semi open (- closed ) set , gs-(sg-) closed set and composition of mappings.

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

Csaszar introduced the concept of generalized topological space and a new open set in a generalized topological space called -preopen in 2002 and 2005, respectively. Definitions of -preinterior and -preclosuer were given. Successively, several studies have appeared to give many generalizations for an open set. The object of our paper is to give a new type of generalization of an open set in a generalized topological space called -semi-p-open set. We present the definition of this set with its equivalent. We give definitions of -semi-p-interior and -semi-p-closure of a set and discuss their properties. Also the properties of -preinterior and -preclosuer are discussed. In addition, we give a new type of continuous function

The ultimate goal of any sale contract is to maximize the combined returns of the parties, knowing that these returns are not realized (in long-term contracts) except in the final stages of the contract. Therefore, this requires the parties to the contract to leave some elements open, including the price, because the adoption of a fixed price and inflexible will not be appropriate to meet their desires when contracting, especially with ignorance of matters beyond their will and may affect the market conditions, and the possibility of modifying the fixed price through The elimination is very limited, especially when the parties to the contract are equally in terms of economic strength. Hence, in order to respond to market uncertainties, the

The research explores the confessional aspect in Audre Lorde's poem" Who Said It Was Simple ". Lorde depicts her personality under the stress of race, sex and sexuality. She discloses her own bitter experience concerning racism, sexism and sexuality in her poem to revive the retrospective truth of the Afro-Americans' life in the USA. This publicly manifestation of her personality and tribulation throughthe language ofpoetry has been regarded as the hallmark of confessional poetry.