Preferred Language
Articles
/
2hatUocBVTCNdQwCDkSU
Community detection model for dynamic networks based on hidden Markov model and evolutionary algorithm
...Show More Authors

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over time. Here, we adopt a new perspective towards detecting the evolution of community structures. The proposed method realizes the decomposition of the problem into three essential components; searching in: intra-community connections, inter-community connections, and community evolution. A multi-objective optimization problem is defined to account for the different intra and inter community structures. Further, we formulate the community evolution problem as a Hidden Markov Model in an attempt to dexterously track the most likely sequence of communities. Then the new model, called Hidden Markov Model-based Multi-Objective evolutionary algorithm for Dynamic Community Detection (HMM-MODCD), uses a multi-objective evolutionary algorithm and Viterbi algorithm for formulating objective functions and providing temporal smoothness over time for clustering dynamic networks. The performance of the proposed algorithm is evaluated on synthetic and real-world dynamic networks and compared against several state-of-the-art algorithms. The results clearly demonstrate the effectiveness of the proposed algorithm to outperform other algorithms.

Scopus Clarivate Crossref
View Publication
Publication Date
Fri Jan 01 2021
Journal Name
Ieee Access
Fast Shot Boundary Detection Based on Separable Moments and Support Vector Machine
...Show More Authors

View Publication
Scopus (31)
Crossref (31)
Scopus Clarivate Crossref
Publication Date
Thu Dec 15 2022
Journal Name
Journal Of Petroleum Research And Studies
Selection of an Optimum Drilling Fluid Model to Enhance Mud Hydraulic System Using Neural Networks in Iraqi Oil Field
...Show More Authors

In drilling processes, the rheological properties pointed to the nature of the run-off and the composition of the drilling mud. Drilling mud performance can be assessed for solving the problems of the hole cleaning, fluid management, and hydraulics controls. The rheology factors are typically termed through the following parameters: Yield Point (Yp) and Plastic Viscosity (μp). The relation of (YP/ μp) is used for measuring of levelling for flow. High YP/ μp percentages are responsible for well cuttings transportation through laminar flow. The adequate values of (YP/ μp) are between 0 to 1 for the rheological models which used in drilling. This is what appeared in most of the models that were used in this study. The pressure loss

... Show More
View Publication
Crossref (2)
Crossref
Publication Date
Sun Apr 01 2018
Journal Name
2018 9th International Conference On Information And Communication Systems (icics)
An intersection-based segment aware algorithm for geographic routing in VANETs
...Show More Authors

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

... Show More
View Publication
Scopus (5)
Crossref (5)
Scopus Crossref
Publication Date
Tue Aug 27 2024
Journal Name
Algorithms
Multithreading-Based Algorithm for High-Performance Tchebichef Polynomials with Higher Orders
...Show More Authors

Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm us

... Show More
View Publication
Scopus (3)
Crossref (3)
Scopus Crossref
Publication Date
Sat Feb 25 2017
Journal Name
International Journal On Advanced Science, Engineering And Information Technology
A Novel DNA Sequence Approach for Network Intrusion Detection System Based on Cryptography Encoding Method
...Show More Authors

A novel method for Network Intrusion Detection System (NIDS) has been proposed, based on the concept of how DNA sequence detects disease as both domains have similar conceptual method of detection. Three important steps have been proposed to apply DNA sequence for NIDS: convert the network traffic data into a form of DNA sequence using Cryptography encoding method; discover patterns of Short Tandem Repeats (STR) sequence for each network traffic attack using Teiresias algorithm; and conduct classification process depends upon STR sequence based on Horspool algorithm. 10% KDD Cup 1999 data set is used for training phase. Correct KDD Cup 1999 data set is used for testing phase to evaluate the proposed method. The current experiment results sh

... Show More
View Publication
Scopus (9)
Crossref (6)
Scopus Crossref
Publication Date
Sat Dec 01 2018
Journal Name
Al-khwarizmi Engineering Journal
Applying A* Path Planning Algorithm Based on Modified C-Space Analysis
...Show More Authors

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

... Show More
View Publication Preview PDF
Crossref (6)
Crossref
Publication Date
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
Facial Emotion Images Recognition Based On Binarized Genetic Algorithm-Random Forest
...Show More Authors

Most recognition system of human facial emotions are assessed solely on accuracy, even if other performance criteria are also thought to be important in the evaluation process such as sensitivity, precision, F-measure, and G-mean. Moreover, the most common problem that must be resolved in face emotion recognition systems is the feature extraction methods, which is comparable to traditional manual feature extraction methods. This traditional method is not able to extract features efficiently. In other words, there are redundant amount of features which are considered not significant, which affect the classification performance. In this work, a new system to recognize human facial emotions from images is proposed. The HOG (Histograms of Or

... Show More
View Publication Preview PDF
Scopus (16)
Crossref (14)
Scopus Crossref
Publication Date
Mon Dec 01 2014
Journal Name
Advances In Engineering Software
System identification and control of robot manipulator based on fuzzy adaptive differential evolution algorithm
...Show More Authors

View Publication
Scopus (53)
Crossref (46)
Scopus Clarivate Crossref
Publication Date
Tue Sep 01 2020
Journal Name
Al-khwarizmi Engineering Journal
Pre-Processing and Surface Reconstruction of Points Cloud Based on Chord Angle Algorithm Technique
...Show More Authors

Abstract

Although the rapid development in reverse engineering techniques, 3D laser scanners can be considered the modern technology used to digitize the 3D objects, but some troubles may be associate this process due to the environmental noises and limitation of the used scanners. So, in the present paper a data pre-processing algorithm has been proposed to obtain the necessary geometric features and mathematical representation of scanned object from its point cloud which obtained using 3D laser scanner (Matter and Form) through isolating the noised points. The proposed algorithm based on continuous calculations of chord angle between each adjacent pair of points in point cloud. A MATLAB program has been built t

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Tue Dec 01 2015
Journal Name
Journal Of Engineering
Data Aggregation in Wireless Sensor Networks Using Modified Voronoi Fuzzy Clustering Algorithm
...Show More Authors

Data 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
View Publication Preview PDF