Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. To reduce the number of generated sub-graphs, overlap ratio metric is utilized for this purpose. After encoding the final selected sub-graphs, binary classification is then applied to classify the emotion of the queried input facial image using six levels of classification. Binary cat swarm intelligence is applied within each level of classification to select proper sub-graphs that give the highest accuracy in that level. Different experiments have been conducted using Surrey Audio-Visual Expressed Emotion (SAVEE) database and the final system accuracy was 90.00%. The results show significant accuracy improvements (about 2%) by the proposed system in comparison to current published works in SAVEE database.
Knowledge of the distribution of the rock mechanical properties along the depth of the wells is an important task for many applications related to reservoir geomechanics. Such these applications are wellbore stability analysis, hydraulic fracturing, reservoir compaction and subsidence, sand production, and fault reactivation. A major challenge with determining the rock mechanical properties is that they are not directly measured at the wellbore. They can be only sampled at well location using rock testing. Furthermore, the core analysis provides discrete data measurements for specific depth as well as it is often available only for a few wells in a field of interest. This study presents a methodology to generate synthetic-geomechani
... Show MoreDeep learning techniques are used across a wide range of fields for several applications. In recent years, deep learning-based object detection from aerial or terrestrial photos has gained popularity as a study topic. The goal of object detection in computer vision is to anticipate the presence of one or more objects, along with their classes and bounding boxes. The YOLO (You Only Look Once) modern object detector can detect things in real-time with accuracy and speed. A neural network from the YOLO family of computer vision models makes one-time predictions about the locations of bounding rectangles andclassification probabilities for an image. In layman's terms, it is a technique for instantly identifying and rec
... Show MoreThe basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.
Many objective optimizations (MaOO) algorithms that intends to solve problems with many objectives (MaOP) (i.e., the problem with more than three objectives) are widely used in various areas such as industrial manufacturing, transportation, sustainability, and even in the medical sector. Various approaches of MaOO algorithms are available and employed to handle different MaOP cases. In contrast, the performance of the MaOO algorithms assesses based on the balance between the convergence and diversity of the non-dominated solutions measured using different evaluation criteria of the quality performance indicators. Although many evaluation criteria are available, yet most of the evaluation and benchmarking of the MaOO with state-of-art a
... Show MoreThe objective of the study is developing a procedure for production and characterization of rice husk ash (RHA). The effects of rice husk (RH) amount, burning/cooling conditions combined with stirring on producing of RHA with amorphous silica, highest SiO2, lowest loss on ignition (LOI), uniform particle shape distribution and nano structured size have been studied. It is concluded that the best amount is 20 g RH in 125 ml evaporating dish Porcelain with burning for 2 h at temperature 700 °C combined with cooling three times during burning to produce RHA with amorphous silica, SiO2 90.78% and LOI 1.73%. On the other hand, cooling and stirring times affect the variation of nano structured size and particle shape dis
... Show MoreAbstract
The aim of this paper is to model and optimize the fatigue life and hardness of medium carbon steel CK35 subjected to dynamic buckling. Different ranges of shot peening time (STP) and critical points of slenderness ratio which is between the long and intermediate columns, as input factors, were used to obtain their influences on the fatigue life and hardness, as main responses. Experimental measurements of shot peening time and buckling were taken and analyzed using (DESIGN EXPERT 8) experimental design software which was used for modeling and optimization purposes. Mathematical models of responses were obtained and analyzed by ANOVA variance to verify the adequacy of the models. The resul
... Show MoreThis work presents the simulation of a Low density Parity Check (LDPC) coding scheme with
multiuserMulti-Carrier Code Division Multiple Access (MC-CDMA) system over Additive White
Gaussian Noise (AWGN) channel and multipath fading channels. The decoding technique used in
the simulation was iterative decoding since it gives maximum efficiency with ten iterations.
Modulation schemes that used are Phase Shift Keying (BPSK, QPSK and 16 PSK), along with the
Orthogonal Frequency Division Multiplexing (OFDM). A 12 pilot carrier were used in the estimator
to compensate channel effect. The channel model used is Long Term Evolution (LTE) channel with
Technical Specification TS 25.101v2.10 and 5 MHz bandwidth including the chan
Cloud Computing is a mass platform to serve high volume data from multi-devices and numerous technologies. Cloud tenants have a high demand to access their data faster without any disruptions. Therefore, cloud providers are struggling to ensure every individual data is secured and always accessible. Hence, an appropriate replication strategy capable of selecting essential data is required in cloud replication environments as the solution. This paper proposed a Crucial File Selection Strategy (CFSS) to address poor response time in a cloud replication environment. A cloud simulator called CloudSim is used to conduct the necessary experiments, and results are presented to evidence the enhancement on replication performance. The obtained an
... Show MoreEnhancing quality image fusion was proposed using new algorithms in auto-focus image fusion. The first algorithm is based on determining the standard deviation to combine two images. The second algorithm concentrates on the contrast at edge points and correlation method as the criteria parameter for the resulted image quality. This algorithm considers three blocks with different sizes at the homogenous region and moves it 10 pixels within the same homogenous region. These blocks examine the statistical properties of the block and decide automatically the next step. The resulted combined image is better in the contras
... Show MoreData centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le
... Show More