Preferred Language
Articles
/
9RalVooBVTCNdQwCN5v5
Community Detection in Modular Complex Networks Using an Improved Particle Swarm Optimization Algorithm
...Show More Authors

     Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a local improvement operator to effectively discover community structure in the modular complex networks when employing the modularity density metric as a single-objective function. The framework of the proposed algorithm consists of three main steps: an initialization strategy, a movement strategy based on perturbation genetic operators, and an improvement operator. The key idea behind the improvement operator is to determine and reassign the complex network nodes that are located in the wrong communities if the majority of their topological links do not belong to their current communities, making it appear that these nodes belong to another community. The performance of the proposed algorithm has been tested and evaluated when applied to publicly-available modular complex networks generated using a flexible and simple benchmark generator. The experimental results showed the effectiveness of the suggested method in discovering community structure over modular networks of different complexities and sizes.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Thu Jan 20 2022
Journal Name
Webology
Red Monkey Optimization and Genetic Algorithm to Solving Berth Allocation Problems
...Show More Authors

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Wed May 10 2023
Journal Name
Journal Of Engineering
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
...Show More Authors

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Sat Jul 31 2021
Journal Name
Iraqi Journal Of Science
A Decision Tree-Aware Genetic Algorithm for Botnet Detection
...Show More Authors

     In this paper, the botnet detection problem is defined as a feature selection problem and the genetic algorithm (GA) is used to search for the best significant combination of features from the entire search space of set of features. Furthermore, the Decision Tree (DT) classifier is used as an objective function to direct the ability of the proposed GA to locate the combination of features that can correctly classify the activities into normal traffics and botnet attacks. Two datasets  namely the UNSW-NB15 and the Canadian Institute for Cybersecurity Intrusion Detection System 2017 (CICIDS2017), are used as evaluation datasets. The results reveal that the proposed DT-aware GA can effectively find the relevant features from

... Show More
Scopus (6)
Crossref (2)
Scopus Crossref
Publication Date
Sun Sep 07 2014
Journal Name
Baghdad Science Journal
An Algorithm for nth Order Intgro-Differential Equations by Using Hermite Wavelets Functions
...Show More Authors

In this paper, the construction of Hermite wavelets functions and their operational matrix of integration is presented. The Hermite wavelets method is applied to solve nth order Volterra integro diferential equations (VIDE) by expanding the unknown functions, as series in terms of Hermite wavelets with unknown coefficients. Finally, two examples are given

View Publication Preview PDF
Crossref
Publication Date
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
Efficient Task Scheduling Approach in Edge-Cloud Continuum based on Flower Pollination and Improved Shuffled Frog Leaping Algorithm
...Show More Authors

The rise of edge-cloud continuum computing is a result of the growing significance of edge computing, which has become a complementary or substitute option for traditional cloud services. The convergence of networking and computers presents a notable challenge due to their distinct historical development. Task scheduling is a major challenge in the context of edge-cloud continuum computing. The selection of the execution location of tasks, is crucial in meeting the quality-of-service (QoS) requirements of applications. An efficient scheduling strategy for distributing workloads among virtual machines in the edge-cloud continuum data center is mandatory to ensure the fulfilment of QoS requirements for both customer and service provider. E

... Show More
View Publication Preview PDF
Scopus (5)
Crossref (2)
Scopus Crossref
Publication Date
Thu Nov 01 2012
Journal Name
2012 International Conference On Advanced Computer Science Applications And Technologies (acsat)
Data Missing Solution Using Rough Set theory and Swarm Intelligence
...Show More Authors

This paper presents a hybrid approach for solving null values problem; it hybridizes rough set theory with intelligent swarm algorithm. The proposed approach is a supervised learning model. A large set of complete data called learning data is used to find the decision rule sets that then have been used in solving the incomplete data problem. The intelligent swarm algorithm is used for feature selection which represents bees algorithm as heuristic search algorithm combined with rough set theory as evaluation function. Also another feature selection algorithm called ID3 is presented, it works as statistical algorithm instead of intelligent algorithm. A comparison between those two approaches is made in their performance for null values estima

... Show More
View Publication Preview PDF
Scopus (7)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Sun Jun 05 2022
Journal Name
Network
A Computationally Efficient Gradient Algorithm for Downlink Training Sequence Optimization in FDD Massive MIMO Systems
...Show More Authors

Future wireless networks will require advance physical-layer techniques to meet the requirements of Internet of Everything (IoE) applications and massive communication systems. To this end, a massive MIMO (m-MIMO) system is to date considered one of the key technologies for future wireless networks. This is due to the capability of m-MIMO to bring a significant improvement in the spectral efficiency and energy efficiency. However, designing an efficient downlink (DL) training sequence for fast channel state information (CSI) estimation, i.e., with limited coherence time, in a frequency division duplex (FDD) m-MIMO system when users exhibit different correlation patterns, i.e., span distinct channel covariance matrices, is to date ve

... Show More
View Publication
Scopus (3)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Tue Dec 01 2015
Journal Name
Journal Of Economics And Administrative Sciences
Ant Colony Optimization Algorithm for Design of Distribution System with Practical Application
...Show More Authors

The Ant System Algorithm (ASA) is a member of the ant colony algorithms family in swarm intelligence methods (part of the Artificial Intelligence field), which is based on the behavior of ants seeking a path and a source of food in their colonies. The aim of This algorithm is to search for an optimal solution for Combinational Optimization Problems (COP) for which is extremely difficult to find solution using the classical methods like linear and non-linear programming methods. 

The Ant System Algorithm was used in the management of water resources field in Iraq, specifically for Haditha dam which is one of the most important dams in Iraq. The target is to find out an efficient management system for

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Jan 01 2023
Journal Name
Computers, Materials & Continua
An Optimal Algorithm for Resource Allocation in D2D Communication
...Show More Authors

View Publication
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Tue Mar 14 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Uni and Multivariate Optimization for the Spectrophotometric Determination of Cimetidine Drug via Charge-Transfer Complex Formation
...Show More Authors

  Charge transfer complex formation method has been applied for the spectrophotometric determination of cimetidine, in bulk sample and dosage form. The method was accurate, simple, rapid, inexpensive and sensitive depending on the formed charge- transfer complex between cited drug and, 2,3-Dichloro-5,6-dicyano-p- benzoquinone (DDQ) as a chromogenic reagent. The formed complex shows absorbance maxima at 587 nm against reagent blank. The calibration graph is linear in the ranges of (5.0 - 50.0) µg.mL-1 with detection limit of 0.268µg.mL-1. The results show the absence of interferences from the excipients on the determination of the drug. Therefore the proposed method has been successfully applied for the determination of cimetid

... Show More
View Publication Preview PDF