Preferred Language
Articles
/
TxeEYI0BVTCNdQwCBBRw
Parallel Particle Swarm Optimization Algorithm for Identifying Complex Communities in Biological Networks
...Show More Authors

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed to detect complex biological communities with high quality. Secondly, the variability in the capability of PSO to extract community structure in biological networks is studied when different types of crossover operators are used. Finally, to reduce the computational time needed to solve this problem, especially when detecting complex communities in large-scale biological networks, we have implemented parallel computing to execute the algorithm. The performance of the proposed algorithm was tested and evaluated on two real biological networks. The experimental results showed the effective performance of the proposed algorithm when using single-point crossover operator, and its superiority over other counterpart algorithms. Moreover, the use of parallel computing in the proposed algorithm representation has greatly reduced the computational time required for its execution.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Thu Apr 30 2020
Journal Name
Journal Of Economics And Administrative Sciences
Comparison Branch and Bound Algorithm with Penalty Function Method for solving Non-linear Bi-level programming with application
...Show More Authors

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

View Publication
Crossref
Publication Date
Thu Jan 29 2026
Journal Name
Journal Of Interdisciplinary Mathematics
Efficient design of neural network based on modified LM training algorithm for solving nonlinear 4th order 3D-PDEs 
...Show More Authors

Authors in this work design efficient neural networks, which are based on the modified Levenberg - Marquardt (LM) training algorithms to solve non-linear fourth - order three -dimensional partial differential equations in the two kinds in the periodic and in the non-periodic - Periodic. Software reliability growth models are essential tools for monitoring and evaluating the evolution of software reliability. Software defect detection events that occur during testing and operation are often treated as counting processes in many current models. However, when working with large software systems, the error detection process should be viewed as a random process with a continuous state space, since the number of faults found during testin

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Tue Apr 02 2019
Journal Name
Artificial Intelligence Research
A three-stage learning algorithm for deep multilayer perceptron with effective weight initialisation based on sparse auto-encoder
...Show More Authors

A three-stage learning algorithm for deep multilayer perceptron (DMLP) with effective weight initialisation based on sparse auto-encoder is proposed in this paper, which aims to overcome difficulties in training deep neural networks with limited training data in high-dimensional feature space. At the first stage, unsupervised learning is adopted using sparse auto-encoder to obtain the initial weights of the feature extraction layers of the DMLP. At the second stage, error back-propagation is used to train the DMLP by fixing the weights obtained at the first stage for its feature extraction layers. At the third stage, all the weights of the DMLP obtained at the second stage are refined by error back-propagation. Network structures an

... Show More
View Publication
Crossref (2)
Crossref
Publication Date
Mon Jan 01 2018
Journal Name
International Journal Of Advanced Computer Science And Applications
Proposed an Adaptive Bitrate Algorithm based on Measuring Bandwidth and Video Buffer Occupancy for Providing Smoothly Video Streaming
...Show More Authors

View Publication
Scopus (7)
Crossref (2)
Scopus Crossref
Publication Date
Wed Dec 13 2017
Journal Name
Al-khwarizmi Engineering Journal
Design of a Kinematic Neural Controller for Mobile Robots based on Enhanced Hybrid Firefly-Artificial Bee Colony Algorithm
...Show More Authors

The paper present design of a control structure that enables integration of a Kinematic neural controller for trajectory tracking of a nonholonomic differential two wheeled mobile robot, then  proposes a Kinematic neural controller to direct a National Instrument mobile robot (NI Mobile Robot). The controller is to make the actual velocity of the wheeled mobile robot close the required velocity by guarantees that the trajectory tracking mean squire error converges at minimum tracking error. The proposed tracking control system consists of two layers; The first layer is a multi-layer perceptron neural network system that controls the mobile robot to track the required path , The second layer is an optimization layer ,which is impleme

... Show More
View Publication Preview PDF
Publication Date
Tue Dec 01 2009
Journal Name
2009 7th International Conference On Information, Communications And Signal Processing (icics)
The effect of traffic load on using XCAST based routing protocol in wireless ad hoc networks
...Show More Authors

View Publication
Scopus (1)
Crossref (2)
Scopus Crossref
Publication Date
Thu May 18 2023
Journal Name
Journal Of Engineering
A Comparative Study of Single-Constraint Routing in Wireless Mesh Networks Using Different Dynamic Programming Algorithms
...Show More Authors

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Jun 01 2015
Journal Name
Journal Of Engineering
Artificial Neural Networks Modeling of Total Dissolved Solid in the Selected Locations on Tigris River, Iraq
...Show More Authors

The study aims to predict Total Dissolved Solids (TDS) as a water quality indicator parameter at spatial and temporal distribution of the Tigris River, Iraq by using Artificial Neural Network (ANN) model. This study was conducted on this river between Mosul and Amarah in Iraq on five positions stretching along the river for the period from 2001to 2011. In the ANNs model calibration, a computer program of multiple linear regressions is used to obtain a set of coefficient for a linear model. The input parameters of the ANNs model were the discharge of the Tigris River, the year, the month and the distance of the sampling stations from upstream of the river. The sensitivity analysis indicated that the distance and discharge

... Show More
View Publication Preview PDF
Publication Date
Mon May 15 2017
Journal Name
Journal Of Theoretical And Applied Information Technology
Anomaly detection in text data that represented as a graph using dbscan algorithm
...Show More Authors

Anomaly detection is still a difficult task. To address this problem, we propose to strengthen DBSCAN algorithm for the data by converting all data to the graph concept frame (CFG). As is well known that the work DBSCAN method used to compile the data set belong to the same species in a while it will be considered in the external behavior of the cluster as a noise or anomalies. It can detect anomalies by DBSCAN algorithm can detect abnormal points that are far from certain set threshold (extremism). However, the abnormalities are not those cases, abnormal and unusual or far from a specific group, There is a type of data that is do not happen repeatedly, but are considered abnormal for the group of known. The analysis showed DBSCAN using the

... Show More
Preview PDF
Scopus (4)
Scopus
Publication Date
Wed May 31 2023
Journal Name
Iraqi Geological Journal
A Survey of Infill Well Location Optimization Techniques
...Show More Authors

The maximization of the net present value of the investment in oil field improvements is greatly aided by the optimization of well location, which plays a significant role in the production of oil. However, using of optimization methods in well placement developments is exceedingly difficult since the well placement optimization scenario involves a large number of choice variables, objective functions, and restrictions. In addition, a wide variety of computational approaches, both traditional and unconventional, have been applied in order to maximize the efficiency of well installation operations. This research demonstrates how optimization approaches used in well placement have progressed since the last time they were examined. Fol

... Show More
View Publication Preview PDF
Scopus (5)
Crossref (3)
Scopus Crossref