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
Sun Jan 22 2023
Journal Name
Mesopotamian Journal Of Big Data
Parallel Machine Learning Algorithms
...Show More Authors

 To expedite the learning process, a group of algorithms known as parallel machine learning algorithmscan be executed simultaneously on several computers or processors. As data grows in both size andcomplexity, and as businesses seek efficient ways to mine that data for insights, algorithms like thesewill become increasingly crucial. Data parallelism, model parallelism, and hybrid techniques are justsome of the methods described in this article for speeding up machine learning algorithms. We alsocover the benefits and threats associated with parallel machine learning, such as data splitting,communication, and scalability. We compare how well various methods perform on a variety ofmachine learning tasks and datasets, and we talk abo

... Show More
View Publication
Scopus (23)
Crossref (15)
Scopus Crossref
Publication Date
Sat Dec 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Comparison of the method of partial least squares and the algorithm of singular values decomposion to estimate the parameters of the logistic regression model in the case of the problem of linear multiplicity by using the simulation
...Show More Authors

The logistic regression model is an important statistical model showing the relationship between the binary variable and the explanatory variables.                                                        The large number of explanations that are usually used to illustrate the response led to the emergence of the problem of linear multiplicity between the explanatory variables that make estimating the parameters of the model not accurate.    

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Jan 01 2012
Journal Name
International Journal Of Computer Science Issues (ijcsi)
Near Rough and Near Exact Subgraphs in Gm-Closure spaces
...Show More Authors

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

Preview PDF
Publication Date
Sat Oct 20 2018
Journal Name
Journal Of Economics And Administrative Sciences
Solve the problem of assignment by using multi-Objective programming
...Show More Authors

he assignment model represents a mathematical model that aims at expressing an important problem facing enterprises and companies in the public and private sectors, which are characterized by ensuring their activities, in order to take the appropriate decision to get the best allocation of tasks for machines or jobs or workers on the machines that he owns in order to increase profits or reduce costs and time As this model is called multi-objective assignment because it takes into account the factors of time and cost together and hence we have two goals for the assignment problem, so it is not possible to solve by the usual methods and has been resorted to the use of multiple programming The objectives were to solve the problem of

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Aug 01 2014
Journal Name
Int. J. Mod. Eng. Res
Exact solutions for MHD flow of a viscoelastic fluid with the fractional Burgers’ model in an annular pipe
...Show More Authors

This paper presents an analytical study for the magnetohydrodynamic (MHD) flow of a generalized Burgers’ fluid in an annular pipe. Closed from solutions for velocity is obtained by using finite Hankel transform and discrete Laplace transform of the sequential fractional derivatives. Finally, the figures are plotted to show the effects of different parameters on the velocity profile.

View Publication
Publication Date
Mon Jul 20 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Exact Solutions for Minimizing cost Function with Five Criteria and Release Dates on Single Machine
...Show More Authors

     In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm).  And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restr

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Aug 01 2016
Journal Name
Journal Of Economics And Administrative Sciences
Quick Response Manufacturing (QRM) and Impacts on the Scheduling Operations Applied Research in the general company for vegetable oil product/ Al-Farab factory
...Show More Authors

 

He research specifies subjects which may contribute in improve productivity of the General Company for vegetable oil product/ Al-Farab factory and aims to release the relationship between system Quick Response Manufacturing (QRM) and scheduling operations.

The Implementation was in the general company for vegetable oil product (Al-Farab factory), Universe Factory It suffers from a failure to follow Scheduling in its operations And not taking into account the lead times And delays in product delivery dates, Here are drawing the attention of the administration in the factory to use Quick Response Manufacturing (QRM) to control the energy and inventory, machin

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Apr 01 2021
Journal Name
Telkomnika (telecommunication Computing Electronics And Control)
Automatic human ear detection approach using modified adaptive search window technique
...Show More Authors

View Publication
Scopus (4)
Crossref (2)
Scopus Crossref
Publication Date
Tue Mar 30 2021
Journal Name
Journal Of Economics And Administrative Sciences
Using Iterative Reweighting Algorithm and Genetic Algorithm to Calculate The Estimation of The Parameters Of The Maximum Likelihood of The Skew Normal Distribution
...Show More Authors

Excessive skewness which occurs sometimes in the data is represented as an obstacle against normal distribution. So, recent studies have witnessed activity in studying the skew-normal distribution (SND) that matches the skewness data which is regarded as a special case of the normal distribution with additional skewness parameter (α), which gives more flexibility to the normal distribution. When estimating the parameters of (SND), we face the problem of the non-linear equation and by using the method of Maximum Likelihood estimation (ML) their solutions will be inaccurate and unreliable. To solve this problem, two methods can be used that are: the genetic algorithm (GA) and the iterative reweighting algorithm (IR) based on the M

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Oct 01 2019
Journal Name
2019 International Conference On Electrical Engineering And Computer Science (icecos)
An Evolutionary Algorithm for Community Detection Using an Improved Mutation Operator
...Show More Authors

View Publication
Scopus (5)
Crossref (2)
Scopus Clarivate Crossref