Preferred Language
Articles
/
HxYNBYcBVTCNdQwCFi6j
Speech Enhancement Algorithm Based on Super-Gaussian Modeling and Orthogonal Polynomials

Scopus Clarivate Crossref
View Publication
Publication Date
Sun Jan 01 2017
Journal Name
Proceeding Of Second Thermal And Fluids Engineering Conference
Solidification Enhancement in Triplex-Tube Latent Thermal Energy Storage System Using a Combination of Nanoparticles and Fins

View Publication
Crossref (1)
Crossref
Publication Date
Mon Aug 01 2011
Journal Name
Journal Of Engineering
DAMAGE DETECTION AND LOCATION FOR IN AND OUT-OFPLANE CURVED BEAMS USING FUZZY LOGIC BASED ON FREQUENCY DIFFERENCE

In this study, structures damage identification method based on changes in the dynamic characteristics
(frequencies) of the structure are examined, stiffness as well as mass matrices of the curved
(in and out-of-plane vibration) beam elements is formulated using Hamilton's principle. Each node
of both of them possesses seven degrees of freedom including the warping degree of freedom. The
curved beam element had been derived based on the Kang and Yoo’s thin-walled curved beam theory
in 1994. A computer program was developing to carry out free vibration analyses of the curved
beam as well as straight beam. Comparing with the frequencies for other researchers using the general
purpose program MATLAB. Fuzzy logic syste

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Tue Nov 30 2021
Journal Name
Iraqi Journal Of Science
ESJF Algorithm to Improve Cloud Environment: Cloud computing

Nowadays, after the technological development in societies, cloud computing has become one of the most important technologies. It provides users with software, hardware, and platform as remote services over the Internet. The increasing number of cloud users has caused a critical problem in how the clients receive cloud services when the cloud is in a state of instability, as it cannot provide required services and, thus, a delay occurs. Therefore, an algorithm was proposed to provide high efficiency and stability to work, because all existing tasks must operate without delay. The proposed system is an enhancement shortest job first algorithm (ESJF) using a time slice, which works by taking a task in the shortest time first and then the l

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Crossref
Publication Date
Mon Oct 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Nurse Scheduling Problem Using Hybrid Simulated Annealing Algorithm

Nurse scheduling problem is one of combinatorial optimization problems and it is one of NP-Hard problems which is difficult to be solved as optimal solution. In this paper, we had created an proposed algorithm which it is hybrid simulated annealing algorithm to solve nurse scheduling problem, developed the simulated annealing algorithm and Genetic algorithm. We can note that the proposed algorithm (Hybrid simulated Annealing Algorithm(GS-h)) is the best method among other methods which it is used in this paper because it satisfied minimum average of the total cost and maximum number of Solved , Best and Optimal problems. So we can note that the ratios of the optimal solution are 77% for the proposed algorithm(GS-h), 28.75% for Si

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Jul 01 2021
Journal Name
Iraqi Journal Of Science
Meerkat Clan Algorithm for Solving N-Queen Problems

The swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environm

... Show More
View Publication Preview PDF
Scopus (2)
Scopus Crossref
Publication Date
Fri Apr 20 2012
Journal Name
International Journal Of Computer And Information Engineering
An Optimal Algorithm for HTML Page Building Process

An Optimal Algorithm for HTML Page Building Process

View Publication Preview PDF
Publication Date
Mon Apr 24 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Adaptive Canny Algorithm Using Fast Otsu Multithresholding Method

   In this research, an adaptive Canny algorithm using fast Otsu multithresholding method is presented, in which fast Otsu multithresholding method is used to calculate the optimum maximum and minimum hysteresis values and used as automatic thresholding for the fourth stage of the Canny algorithm.      The new adaptive Canny algorithm and the standard Canny algorithm (manual hysteresis value) was tested on standard image (Lena) and satellite image. The results approved the validity and accuracy of the new algorithm to find the images edges for personal and satellite images as pre-step for image segmentation.  
 

View Publication Preview PDF
Publication Date
Mon Feb 01 2021
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Features of genetic algorithm for plain text encryption

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

... Show More
View Publication
Scopus (14)
Crossref (4)
Scopus Crossref
Publication Date
Thu Dec 01 2011
Journal Name
2011 Developments In E-systems Engineering
Enhanced Computation Time for Fast Block Matching Algorithm

View Publication
Scopus (1)
Scopus Crossref
Publication Date
Thu Sep 26 2019
Journal Name
Processes
Fine-Tuning Meta-Heuristic Algorithm for Global Optimization

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

... Show More
View Publication Preview PDF
Scopus (24)
Crossref (19)
Scopus Clarivate Crossref