Preferred Language
Articles
/
NRfrQ48BVTCNdQwC6Wju
Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP
...Show More Authors

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-core based environment. Experimental outcomes reveal that the overall performance of the mentioned string matching algorithm has been improved, and the improvement in the execution time which has been obtained is considerable enough to recommend the multi-core environment as the suitable platform for parallelizing the Quick Search string matching algorithm.

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Wed Jan 01 2020
Journal Name
Periodicals Of Engineering And Natural Sciences
Comparing traditional estimators and the estimators of (PSO) algorithm for some growth models of gross domestic product in Iraq
...Show More Authors

View Publication
Scopus
Publication Date
Wed May 01 2019
Journal Name
Iraqi Journal Of Science
The Minimum Cost for the Vascular Network Using Linear Programming Based Its Path Graph
...Show More Authors

As of late, humankind has experienced radiation issues either computerized tomography (CT) or X-rays. In this investigation, we endeavor to limit the effect of examination hardware. To do this the medical image is cropping (cut and zoom) then represented the vascular network as a graph such that each contraction as the vertices and the vessel represented as an edges, the area of the coagulation was processed already, in the current search the shortest distance to reach to the place of the blood vessel clot is computed

View Publication Preview PDF
Publication Date
Thu Dec 01 2022
Journal Name
Baghdad Science Journal
Distributed Heuristic Algorithm for Migration and Replication of Self-organized Services in Future Networks
...Show More Authors

Nowadays, the mobile communication networks have become a consistent part of our everyday life by transforming huge amount of data through communicating devices, that leads to new challenges. According to the Cisco Networking Index, more than 29.3 billion networked devices will be connected to the network during the year 2023. It is obvious that the existing infrastructures in current networks will not be able to support all the generated data due to the bandwidth limits, processing and transmission overhead. To cope with these issues, future mobile communication networks must achieve high requirements to reduce the amount of transferred data, decrease latency and computation costs. One of the essential challenging tasks in this subject

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Wed Sep 05 2007
Journal Name
Neural Network World
A canonical generic algorithm for likelihood estimator of first order moving average model parameter
...Show More Authors

The increasing availability of computing power in the past two decades has been use to develop new techniques for optimizing solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled development of new generation of intelligent computing techniques, such as our interest algorithm, this paper presents one of new class of stochastic search algorithm (known as Canonical Genetic' Algorithm ‘CGA’) for optimizing the maximum likelihood function strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of are compared with those of moment method. Based on MSE value obtained from bot

... Show More
Scopus (3)
Scopus
Publication Date
Thu Oct 31 2019
Journal Name
Journal Of Theoretical And Applied Information Technology
AN ENHANCED EVOLUTIONARY ALGORITHM WITH LOCAL HEURISTIC APPROACH FOR DETECTING COMMUNITY IN COMPLEX NETWORKS
...Show More Authors

Preview PDF
Scopus (5)
Scopus
Publication Date
Sun Jun 05 2016
Journal Name
Baghdad Science Journal
Developing an Immune Negative Selection Algorithm for Intrusion Detection in NSL-KDD data Set
...Show More Authors

With the development of communication technologies for mobile devices and electronic communications, and went to the world of e-government, e-commerce and e-banking. It became necessary to control these activities from exposure to intrusion or misuse and to provide protection to them, so it's important to design powerful and efficient systems-do-this-purpose. It this paper it has been used several varieties of algorithm selection passive immune algorithm selection passive with real values, algorithm selection with passive detectors with a radius fixed, algorithm selection with passive detectors, variable- sized intrusion detection network type misuse where the algorithm generates a set of detectors to distinguish the self-samples. Practica

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Fri Jan 01 2021
Journal Name
Ieee Access
Microwave Nondestructive Testing for Defect Detection in Composites Based on K-Means Clustering Algorithm
...Show More Authors

View Publication
Scopus (51)
Crossref (46)
Scopus Clarivate Crossref
Publication Date
Thu Feb 09 2023
Journal Name
Artificial Intelligence Review
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

... Show More
View Publication
Scopus (5)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Wed Jun 01 2022
Journal Name
Baghdad Science Journal
WOAIP: Wireless Optimization Algorithm for Indoor Placement Based on Binary Particle Swarm Optimization (BPSO)
...Show More Authors

Optimizing the Access Point (AP) deployment has a great role in wireless applications due to the need for providing an efficient communication with low deployment costs. Quality of Service (QoS), is a major significant parameter and objective to be considered along with AP placement as well the overall deployment cost. This study proposes and investigates a multi-level optimization algorithm called Wireless Optimization Algorithm for Indoor Placement (WOAIP) based on Binary Particle Swarm Optimization (BPSO). WOAIP aims to obtain the optimum AP multi-floor placement with effective coverage that makes it more capable of supporting QoS and cost-effectiveness. Five pairs (coverage, AP deployment) of weights, signal thresholds and received s

... Show More
View Publication Preview PDF
Scopus (5)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Fri Jul 19 2024
Journal Name
An International Journal Of Optimization And Control: Theories & Applications (ijocta)
Design optimal neural network based on new LM training algorithm for solving 3D - PDEs
...Show More Authors

In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.

View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref