Preferred Language
Articles
/
ijs-2746
Improvement of Chacha20 Algorithm based on Tent and Chebyshev Chaotic Maps
...Show More Authors

Chacha 20 is a stream cypher that is used as lightweight on many CPUs that ‎do not have dedicated AES instructions. As stated by Google, that is the reason why they use it on many ‎devices, such as mobile devices, for authentication in TLS protocol. This paper ‎proposes an improvement of chaha20 stream cypher algorithm based on tent and ‎Chebyshev functions (IChacha20). The main objectives of the proposed IChacha20 ‎algorithm are increasing security layer, designing a robust structure of the IChacha20 ‎to be enabled to resist various types of attacks, implementing the proposed ‎algorithm for encryption of colour images, and transiting it in a secure manner. The ‎ test results proved that the MSE, PSNR, UQI and NCC metrics of ‎IChacha20 are better than those of the original Chacha20. Also, the proposed method has ‎a faster execution time (01:26:4 sec) compared with the original algorithm (02:07:1 sec).

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Dec 01 2002
Journal Name
Iraqi Journal Of Physics
An edge detection algorithm matching visual contour perception
...Show More Authors

For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.

View Publication Preview PDF
Publication Date
Mon Oct 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Nurse Scheduling Problem Using Hybrid Simulated Annealing Algorithm
...Show More Authors

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
...Show More Authors

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
Thu Sep 26 2019
Journal Name
Processes
Fine-Tuning Meta-Heuristic Algorithm for Global Optimization
...Show More Authors

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 (23)
Crossref (19)
Scopus Clarivate Crossref
Publication Date
Thu Dec 01 2011
Journal Name
2011 Developments In E-systems Engineering
Enhanced Computation Time for Fast Block Matching Algorithm
...Show More Authors

View Publication
Scopus (1)
Scopus Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Symmetry
Fast Overlapping Block Processing Algorithm for Feature Extraction
...Show More Authors

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

... Show More
View Publication
Scopus (15)
Crossref (16)
Scopus Clarivate 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
...Show More Authors

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 (2)
Crossref
Publication Date
Fri Nov 09 2018
Journal Name
Iraqi National Journal Of Nursing Specialties
Evaluation of Organization Structure as Component of Quality Improvement for Maternal and Child Health Promotion in Baghdad City’s Primary Health Care Centers
...Show More Authors

A descriptive evaluation study is conducted on primary health care centers in Baghdad City in order to
evaluate the organization structure as component of quality improvement of maternal and child health promotion
from April 10th 2012 to May20th 2013. A total of (22) primary health care centers. Study instrument was
comprised of three questionnaires and overall items included in these questionnaire were (65) items. Data are
collected through the utilization of the developed questionnaire and the interview technique as means of data
collection. Data are analyzed through the application of descriptive statistical data analysis methods which
includes the measurement of the frequencies, percentages, and computation of mean

... Show More
View Publication Preview PDF
Publication Date
Tue Feb 01 2022
Journal Name
Baghdad Science Journal
An Efficient Algorithm for Fuzzy Linear Fractional Programming Problems via Ranking Function
...Show More Authors

In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an

... Show More
View Publication Preview PDF
Scopus (5)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Fri May 21 2021
Journal Name
International Journal Of Pavement Research And Technology
Developing Resilient Modulus Prediction Models Based on Experimental Results of Crushed Hornfels Mixes with Different Gradations and Plasticity
...Show More Authors

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