Preferred Language
Articles
/
joe-195
An Adaptive Multi-Objective Particle Swarm Optimization Algorithm for Multi-Robot Path Planning
...Show More Authors

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In order to evaluate the proposed algorithm in term of finding the best solution, six benchmark test functions are used to make a comparison between AMOPSO and the standard MOPSO. The results show that the AMOPSO has a better ability to get away from local optimums with a quickest convergence than the MOPSO. The simulation results using Matlab 2014a, indicate that this methodology is extremely valuable for every robot in multi-robot framework to discover its own particular proper pa‌th from the start to the destination position with minimum distance and time.

 

 

View Publication Preview PDF
Quick Preview PDF
Publication Date
Thu Aug 01 2019
Journal Name
مجلة العلوم الاقتصادية والإدارية
Improving" Jackknife Instrumental Variable Estimation method" using A class of immun algorithm with practical application
...Show More Authors

Improving" Jackknife Instrumental Variable Estimation method" using A class of immun algorithm with practical application

Publication Date
Thu Nov 30 2023
Journal Name
Iraqi Journal Of Science
Developing the Complexity and Security of the Twofish Algorithm Through a New Key Scheduling Design
...Show More Authors

     The Twofish cipher is a very powerful algorithm with a fairly complex structure that permeates most data parsing and switching and can be easily implemented. The keys of the Twofish algorithm are of variable length (128, 192, or 256 bits), and the key schedule is generated once and repeated in encrypting all message blocks, whatever their number, and this reduces the confidentiality of encryption. This article discusses the process of generating cipher keys for each block. This concept is new and unknown in all common block cipher algorithms. It is based on the permanent generation of sub keys for all blocks and the key generation process, each according to its work. The Geffe's Generator is used to generate subkeys to make eac

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Jun 26 2014
Journal Name
Engineering Optimization
A new modified differential evolution algorithm scheme-based linear frequency modulation radar signal de-noising
...Show More Authors

The main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. As the standard DE algorithm is a fixed length optimizer, it is not suitable for solving signal de-noising problems that call for variability. A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. The measurement results demonstrate a highly efficient capability for target detection in terms of frequency response and peak forming that was isola

... Show More
View Publication
Scopus (7)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Wed Apr 25 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Counting Functions to Generate The Primes in the RSA Algorithm and Diffie-Hellman Key Exchange
...Show More Authors

        The Rivest–Shamir–Adleman (RSA) and the Diffie-Hellman (DH) key exchange are famous methods for encryption. These methods  depended on selecting the primes p and q in order  to be secure enough . This paper shows that the named methods used the primes which are found by some arithmetical function .In the other sense, no need to think about getting primes p and q and how they are secure enough, since the arithmetical function enable to build the primes in such complicated way to be secure. Moreover, this article   gives  new construction  of the  RSA  algorithm and DH key  exchange using the

primes p,qfrom areal number x.

View Publication Preview PDF
Crossref
Publication Date
Fri Apr 12 2019
Journal Name
Journal Of Economics And Administrative Sciences
Split and Merge Regions of Satellite Images using the Non-Hierarchical Algorithm of Cluster Analysis
...Show More Authors

يعد التقطيع الصوري من الاهداف الرئيسة والضرورية في المعالجات الصورية للصور الرقمية، فهو يسعى الى تجزئة الصور المدروسة الى مناطق متعددة اكثر نفعاً تلخص فيها المناطق ذات الافادة لصور الاقمار الصناعية، وهي صور متعددة الاطياف ومجهزة من الاقمار الصناعية باستخدام مبدأ الاستشعار عن بعد والذي اصبح من المفاهيم المهمة التي تُعتمد تطبيقاته في اغلب ضروريات الحياة اليومية، وخاصة بعد التطورات المتسارعة التي شهد

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed May 01 2019
Journal Name
Iraqi Journal Of Science
White Blood Cells Nuclei Localization Using Modified K-means Clustering Algorithm and Seed Filling Technique
...Show More Authors

The presence of White Blood Cells (WBCs) in the body of human has a great role in the protection of the body against many pathogens. The recognition of the WBC is the first important step to diagnose some particular diseases. The pathologists usually use an optical microscope to recognize WBCs, but, this process is a quite tedious, time-consuming, error prone, very slow, and expensive. In addition, it needs experts with long practice in this field. For these reasons, a computer assisted diagnostic system that helps pathologists in the process of diagnosis can be effective, easy and safe. This research is devoted to develop a system based on digital image processing methods to localize WBCs nuclei. The proposed system involved a collectio

... Show More
View Publication Preview PDF
Publication Date
Mon Jan 01 2024
Journal Name
International Journal Of Research In Science And Technology
Encryption of Medical Image Based on Cascaded Design of AES Block Algorithm and Chaotic Map
...Show More Authors

Security concerns in the transfer of medical images have drawn a lot of attention to the topic of medical picture encryption as of late. Furthermore, recent events have brought attention to the fact that medical photographs are constantly being produced and circulated online, necessitating safeguards against their inappropriate use. To improve the design of the AES algorithm standard for medical picture encryption, this research presents several new criteria. It was created so that needs for higher levels of safety and higher levels of performance could be met. First, the pixels in the image are diffused to randomly mix them up and disperse them all over the screen. Rather than using rounds, the suggested technique utilizes a cascad

... Show More
View Publication
Crossref
Publication Date
Sun Jul 31 2022
Journal Name
Iraqi Journal Of Science
Deep Learning and Machine Learning via a Genetic Algorithm to Classify Breast Cancer DNA Data
...Show More Authors

       This paper uses Artificial Intelligence (AI) based algorithm analysis to classify breast cancer Deoxyribonucleic (DNA). Main idea is to focus on application of machine and deep learning techniques. Furthermore, a genetic algorithm is used to diagnose gene expression to reduce the number of misclassified cancers. After patients' genetic data are entered, processing operations that require filling the missing values using different techniques are used. The best data for the classification process are chosen by combining each technique using the genetic algorithm and comparing them  in terms of accuracy.

View Publication Preview PDF
Scopus (13)
Crossref (4)
Scopus Crossref
Publication Date
Sun Sep 01 2019
Journal Name
Baghdad Science Journal
Common Fixed Point of a Finite-step Iteration Algorithm Under Total Asymptotically Quasi-nonexpansive Maps
...Show More Authors

      Throughout this paper, a generic iteration algorithm for a finite family of total asymptotically quasi-nonexpansive maps in uniformly convex Banach space is suggested. As well as weak / strong convergence theorems of this algorithm to a common fixed point are established. Finally, illustrative numerical example by using Matlab is presented.

View Publication Preview PDF
Scopus (13)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Thu Sep 01 2016
Journal Name
Chem Istry & Chem Ical Technology
SYN TH ESIS, CH ARACTERIZATION AN D AN TIM ICROBIAL ACTIVITY OF N EW N UCLEOSIDE AN ALOGUES FROM BEN ZOTRIAZOLE
...Show More Authors

Novel derivatives of 1-(´1, ´3, ´4, ´6-tetra benzoyl-β-D-fructofuranosyl)-1H- benzotriazole and 1-(´1, ´3, ´4, ´6-tetra benzoyl-β-D-fructofuranosyl)-1H- benzotriazole carrying Schiff bases moiety were synthesised and fully characterised. The protection of D- fructose using benzoyl chloride was synthesized, followed by nucleophilic addition/elimination between benzotria- zole and chloroacetyl chloride to give 1-(1- chloroacetyl)- 1H-benzotriazole. The next step was condensation reaction of protected fructose and 1-(1-chloroacetyl)-1H- benzotriazole producing a new nucleoside analogue. The novel nucleoside analogues underwent a second conden- sation reaction with different aromatic and aliphatic amines to provide new Schiff b

... Show More