Preferred Language
Articles
/
vhcNPo8BVTCNdQwC0WSe
Improved Rijndael Algorithm by Encryption S-Box Using NTRU Algorithm
...Show More Authors

With the wide developments of computer applications and networks, the security of information has high attention in our common fields of life. The most important issues is how to control and prevent unauthorized access to secure information, therefore this paper presents a combination of two efficient encryption algorithms to satisfy the purpose of information security by adding a new level of encryption in Rijndael-AES algorithm. This paper presents a proposed Rijndael encryption and decryption process with NTRU algorithm, Rijndael algorithm is widely accepted due to its strong encryption, and complex processing as well as its resistance to brute force attack. The proposed modifications are implemented by encryption and decryption Rijndael S-Box using NTRU algorithm. These modifications enhance the degree of complexity, increase key search space, and make the ciphered message difficult to be cracked by the attacker.

Publication Date
Wed Jun 16 2021
Journal Name
Cognitive Computation
Deep Transfer Learning for Improved Detection of Keratoconus using Corneal Topographic Maps
...Show More Authors
Abstract <p>Clinical keratoconus (KCN) detection is a challenging and time-consuming task. In the diagnosis process, ophthalmologists must revise demographic and clinical ophthalmic examinations. The latter include slit-lamb, corneal topographic maps, and Pentacam indices (PI). We propose an Ensemble of Deep Transfer Learning (EDTL) based on corneal topographic maps. We consider four pretrained networks, SqueezeNet (SqN), AlexNet (AN), ShuffleNet (SfN), and MobileNet-v2 (MN), and fine-tune them on a dataset of KCN and normal cases, each including four topographic maps. We also consider a PI classifier. Then, our EDTL method combines the output probabilities of each of the five classifiers to obtain a decision b</p> ... Show More
View Publication
Scopus (42)
Crossref (33)
Scopus Clarivate 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
Tue Jan 01 2019
Journal Name
International Journal Of Electrochemical Science
Effect of Electrolysis Parameters on the Specific Surface Area of Nickel Powder: Optimization using Box-Behnken Design
...Show More Authors

View Publication
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Thu Apr 01 2021
Journal Name
Journal Of Engineering Science And Technology
Applying box-behnken design with statistical optimization for removal vat orange dye from aqueous solution using kaolin
...Show More Authors

Scopus (4)
Scopus
Publication Date
Thu Mar 01 2007
Journal Name
Journal Of Economics And Administrative Sciences
PART 2 An Experiment on the Box plot
...Show More Authors

Abstract

These experiments seek to investigate the effects of the fixed variations to the basic box plot on subjects' judgments of the box lengths. The study consists of two experiments, were constructed as an extension to the experiments carried out previously by Hussin, M.M. (1989, 2006).  Subjects were asked to judge what percentage the shorter represented of the longer length in pairs of box lengths and give an estimate of percentage, one being a standard plot and the other being of a different box length and also varying with respect to other elements such as, box width or whisker length. When he (1989) suggested in the future research points (1, 2), the changing length of the st

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Jul 31 2025
Journal Name
Computers, Materials &amp; Continua
A Secure Audio Encryption Method Using Tent-Controlled Permutation and Logistic Map-Based Key Generation
...Show More Authors

The exponential growth of audio data shared over the internet and communication channels has raised significant concerns about the security and privacy of transmitted information. Due to high processing requirements, traditional encryption algorithms demand considerable computational effort for real-time audio encryption. To address these challenges, this paper presents a permutation for secure audio encryption using a combination of Tent and 1D logistic maps. The audio data is first shuffled using Tent map for the random permutation. The high random secret key with a length equal to the size of the audio data is then generated using a 1D logistic map. Finally, the Exclusive OR (XOR) operation is applied between the generated key and the sh

... Show More
View Publication
Scopus Clarivate Crossref
Publication Date
Thu Apr 30 2020
Journal Name
Journal Of Economics And Administrative Sciences
Comparison Branch and Bound Algorithm with Penalty Function Method for solving Non-linear Bi-level programming with application
...Show More Authors

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

View Publication
Crossref
Publication Date
Sun Dec 30 2018
Journal Name
Journal Of Engineering
A Cognition Path Planning with a Nonlinear Controller Design for Wheeled Mobile Robot Based on an Intelligent Algorithm
...Show More Authors

This paper presents a cognition path planning with control algorithm design for a nonholonomic wheeled mobile robot based on Particle Swarm Optimization (PSO) algorithm. The aim of this work is to propose the circular roadmap (CRM) method to plan and generate optimal path with free navigation as well as to propose a nonlinear MIMO-PID-MENN controller in order to track the wheeled mobile robot on the reference path. The PSO is used to find an online tune the control parameters of the proposed controller to get the best torques actions for the wheeled mobile robot. The numerical simulation results based on the Matlab package show that the proposed structure has a precise and highly accurate distance of the generated refere

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Mon Jan 01 2018
Journal Name
International Journal Of Advanced Computer Science And Applications
Proposed an Adaptive Bitrate Algorithm based on Measuring Bandwidth and Video Buffer Occupancy for Providing Smoothly Video Streaming
...Show More Authors

View Publication
Scopus (7)
Crossref (2)
Scopus Crossref
Publication Date
Tue Apr 02 2019
Journal Name
Artificial Intelligence Research
A three-stage learning algorithm for deep multilayer perceptron with effective weight initialisation based on sparse auto-encoder
...Show More Authors

A three-stage learning algorithm for deep multilayer perceptron (DMLP) with effective weight initialisation based on sparse auto-encoder is proposed in this paper, which aims to overcome difficulties in training deep neural networks with limited training data in high-dimensional feature space. At the first stage, unsupervised learning is adopted using sparse auto-encoder to obtain the initial weights of the feature extraction layers of the DMLP. At the second stage, error back-propagation is used to train the DMLP by fixing the weights obtained at the first stage for its feature extraction layers. At the third stage, all the weights of the DMLP obtained at the second stage are refined by error back-propagation. Network structures an

... Show More
View Publication
Crossref (1)
Crossref