Implementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.

A Multiple System Biometric System Based on ECG Data

This work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of

Catalase (EC 1.11.1.6) is a well known enzyme which exists in almost all living creatures exposing to oxygen (such as plants, bacteria, and animals). It is a very necessary enzyme to protect the cell from oxidative detriment by reactive oxygen species (ROS). The aim of this study is the partial purification and characterization of Catalase enzyme from Banana peels. In this study, fresh banana peels are treated with 70 % ethanol ,further separated with chloroform ,water and ethyl acetate respectively .The supernatant of the enzymatic sample which is treated with chloroform is loaded into gel filtration column with Sephadex G-100 (1.0 x 90 cm) equilibrated with pH7 buffer media (phosphate buffer 0.1 M). Kinetic studies of the purified en

planning is among the most significant in the field of robotics research.  As it is linked to finding a safe and efficient route in a cluttered environment for wheeled mobile robots and is considered a significant prerequisite for any such mobile robot project to be a success. This paper proposes the optimal path planning of the wheeled mobile robot with collision avoidance by using an algorithm called grey wolf optimization (GWO) as a method for finding the shortest and safe. The research goals in this study for identify the best path while taking into account the effect of the number of obstacles and design parameters on performance for the algorithm to find the best path. The simulations are run in the MATLAB environment to test the