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 Sep 15 2021
Journal Name
2021 International Conference On Computing And Communications Applications And Technologies (i3cat)
Parallel Hybrid String Matching Algorithm Using CUDA API Function
...Show More Authors

View Publication
Crossref
Publication Date
Sun Jan 01 2017
Journal Name
International Journal Of Advanced Computer Science And Applications
Fast Hybrid String Matching Algorithm based on the Quick-Skip and Tuned Boyer-Moore Algorithms
...Show More Authors

View Publication
Crossref
Publication Date
Wed Oct 12 2022
Journal Name
Axioms
Razy: A String Matching Algorithm for Automatic Analysis of Pathological Reports
...Show More Authors

Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable

... Show More
View Publication
Scopus (2)
Scopus Clarivate Crossref
Publication Date
Wed Sep 12 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Solving Capacitated Vehicle Routing Problem (CVRP) Using Tabu Search Algorithm (TSA)
...Show More Authors

This paper investigates the capacitated vehicle routing problem (CVRP) as it is one of the numerous issues that have no impeccable solutions yet. Numerous scientists in the recent couple of decades have set up various explores and utilized numerous strategies with various methods to deal with it. However, for all researches, finding the least cost is exceptionally complicated. In any case, they have figured out how to think of rough solutions that vary in efficiencies relying upon the search space. Furthermore, tabu search (TS) is utilized to resolve this issue as it is fit for solving numerous complicated issues. The algorithm has been adjusted to resolve the exploration issue, where its methodology is not quite the same as the normal a

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Mon Apr 17 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Energy Methods For Initial –Boundary String Problem
...Show More Authors

  We study one example of hyperbolic problems it's Initial-boundary string problem with two ends. In fact we look for the solution in weak sense in some sobolev spaces. Also we use energy technic with Galerkin's method to study some properties for our problem as existence and uniqueness

View Publication Preview PDF
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
A Parallel Adaptive Genetic Algorithm for Job Shop Scheduling Problem
...Show More Authors

Publication Date
Mon Jan 01 2007
Journal Name
Iraqi Journal Of Science
Adaptive methods for matching problem
...Show More Authors

In this paper, we deal with the problem of general matching of two images one of them has experienced geometrical transformations, to find the correspondence between two images. We develop the invariant moments for traditional techniques (moments of inertia) with new approach to enhance the performance for these methods. We test various projections directional moments, to extract the difference between Block Distance Moment (BDM) and evaluate their reliability. Three adaptive strategies are shown for projections directional moments, that are raster (vertical and horizontal) projection, Fan-Bean projection and new projection procedure that is the square projection method. Our paper started with the description of a new algorithm that is low

... Show More
Publication Date
Mon Apr 30 2018
Journal Name
Journal Of Theoretical And Applied Information Technology
An efficient artificial fish swarm algorithm with harmony search for scheduling in flexible job-shop problem
...Show More Authors

Flexible job-shop scheduling problem (FJSP) is one of the instances in flexible manufacturing systems. It is considered as a very complex to control. Hence generating a control system for this problem domain is difficult. FJSP inherits the job-shop scheduling problem characteristics. It has an additional decision level to the sequencing one which allows the operations to be processed on any machine among a set of available machines at a facility. In this article, we present Artificial Fish Swarm Algorithm with Harmony Search for solving the flexible job shop scheduling problem. It is based on the new harmony improvised from results obtained by artificial fish swarm algorithm. This improvised solution is sent to comparison to an overall best

... Show More
View Publication Preview PDF
Scopus (3)
Scopus
Publication Date
Mon Jan 01 2018
Journal Name
International Journal Of Data Mining, Modelling And Management
Association rules mining using cuckoo search algorithm
...Show More Authors

Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.

View Publication Preview PDF
Scopus (7)
Crossref (3)
Scopus Crossref
Publication Date
Fri Oct 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Solving Quadratic Assignment Problem by Using Meta-heuristic Search Method
...Show More Authors

While analytical solutions to Quadratic Assignment Problems (QAP) have indeed been since a long time, the expanding use of Evolutionary Algorithms (EAs) for similar issues gives a framework for dealing with QAP with an extraordinarily broad scope. The study's key contribution is that it normalizes all of the criteria into a single scale, regardless of their measurement systems or the requirements of minimum or maximum, relieving the researchers of the exhaustively quantifying the quality criteria. A tabu search algorithm for quadratic assignment problems (TSQAP) is proposed, which combines the limitations of tabu search with a discrete assignment problem. The effectiveness of the proposed technique has been compared to well-established a

... Show More
View Publication Preview PDF
Crossref