A
Abdelkader Senouci
Researcher at Northumbria University
Publications - 24
Citations - 206
Abdelkader Senouci is an academic researcher from Northumbria University. The author has contributed to research in topics: Computer science & Encryption. The author has an hindex of 7, co-authored 18 publications receiving 146 citations. Previous affiliations of Abdelkader Senouci include École Normale Supérieure.
Papers
More filters
Journal ArticleDOI
Original Articles: Predictive control and synchronization of chaotic and hyperchaotic systems based on a T-S fuzzy model
TL;DR: This paper presents fuzzy model-based design for control and synchronization of chaotic systems based on a Takagi-Sugeno (T-S) fuzzy model based on which some new and useful criteria are derived.
Journal ArticleDOI
FPGA based hardware and device-independent implementation of chaotic generators
TL;DR: A rapid prototyping method of digital chaos generators on FPGAs that is of great use for a seamless study, simulation and implementation of those systems in one environment will be presented.
Proceedings ArticleDOI
A Rectified RRT* with Efficient Obstacles Avoidance Method for UAV in 3D Environment
TL;DR: An obstacle avoidance method which allows an efficient free-path collision generation in a complex 3D operating state space and a rectified rapidly exploring random tree (RRT*) algorithm where a method is proposed for smoothing and rectifying the final path generated by RRT in order to reduce the energy consumption during the flight.
Journal ArticleDOI
Robust Finite-Time Trajectory Tracking Control of Quadrotor Aircraft via Terminal Sliding Mode-Based Active Antidisturbance Approach: A PIL Experiment
TL;DR: An accurate solution of finite-time Cartesian trajectory tracking control problem of a quadrotor system by designing and implementing a novel robust flight-control algorithm and Lyapunov theorem is used to provide a rigorous stability proof for the feedback control system.
Journal ArticleDOI
An efficient and secure certificateless searchable encryption scheme against keyword guessing attacks
TL;DR: In this paper, the authors proposed an efficient and secure certificateless searchable encryption scheme that is proven to be resistant against different keyword guessing attacks under both, the hardness of solving the discrete logarithm (DL) and the computational Diffie-Hellman (CDH) problems in the random oracle model.