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 this work, we study several features of the non-zero divisor graphs (ℵZD- graph) for the ring Zn of integer modulo n. For instance, the clique number, radius, girth, domination number, and the local clustering coefficient are determined. Furthermore, we present an algorithm that calculates the clique number and draws the non-zero divisor for the ring Zn.

S Khalifa E, N Adil A, S Husam Ali, H Nibras A…, 2009

KE Sharquie, AA Noaimi, HA Salman, NA Hindy, Iraqi Postgraduate Medical Journal, 2009 - Cited by 1

Background & objective: Difficult intubation remains a risk for patients undergoing general anesthesia (GA) or mechanical ventilation in an intensive care unit (ICU). Macroglossia is a known factor for difficult intubation. But it is not routine to assess the tongue size to predict difficult intubation. Studies are found deficient in comparing usefulness of measuring thyromental distance and the tongue thickness (TT) measured by ultrasonography to estimate difficult intubation. We compared tongue thickness measured by ultrasonography and thyromental distance as a means to anticipate difficult intubation. Methodology: A convenient sample of 60 patients; 32 males and 28 females, who were undergoing elective surgery with GA were i

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

<p>There is an Increasing demand for the education in the field of E-learning specially the higher education, and to keep contiuity between the user and the course director in any place and time. This research presents a proposed and simulation multimedia network design for distance learning utilizing ATM technique. The propsed framework determines the principle of ATM technology and shows how multimedia can be integrated within E- learning conteext. The first part of this research presents a theoretical design for the Electricity Department, university of technology. The purpose is to illustrate the usage of the ATM and Multimedia in distance learning process. In addition, this research composes two entities: Software entity

Viruses have not previously been reported to act as chemotactic/chemoattractive agents. Rather, viruses as extracellular entities are generally viewed as non-metabolically active spore-like agents that await further infection events upon collision with appropriate host cells. That a virus might actively contribute to its fate via chemotaxis and change the behavior of an organism independent of infection is unprecedented.