The growing interest in the use of chaotic techniques for enabling secure communication in recent years has been motivated by the emergence of a number of wireless services which require the service provider to provide low bit error rates (BER) along with information security. This paper investigates the feasibility of using chaotic communications over Multiple-Input-Multiple-Output (MIMO) channels. While the use of Chaotic maps can enhance security, it is seen that the overall BER performance gets degraded when compared to conventional communication schemes. In order to overcome this limitation, we have proposed the use of a combination of Chaotic modulation and Alamouti Space Time Block Code. The performance of Chaos Shift Keying (CSK) wi

The choice of binary Pseudonoise (PN) sequences with specific properties, having long period high complexity, randomness, minimum cross and auto- correlation which are essential for some communication systems. In this research a nonlinear PN generator is introduced . It consists of a combination of basic components like Linear Feedback Shift Register (LFSR), ?-element which is a type of RxR crossbar switches. The period and complexity of a sequence which are generated by the proposed generator are computed and the randomness properties of these sequences are measured by well-known randomness tests.

Early detection of brain tumors is critical for enhancing treatment options and extending patient survival. Magnetic resonance imaging (MRI) scanning gives more detailed information, such as greater contrast and clarity than any other scanning method. Manually dividing brain tumors from many MRI images collected in clinical practice for cancer diagnosis is a tough and time-consuming task. Tumors and MRI scans of the brain can be discovered using algorithms and machine learning technologies, making the process easier for doctors because MRI images can appear healthy when the person may have a tumor or be malignant. Recently, deep learning techniques based on deep convolutional neural networks have been used to analyze med

The most important function of a prosthetic hand is their ability to perform tasks in a manner similar to a natural hand, so it is necessary to perform kinematic analysis to determine the performance and the ability of the prosthetic human finger design to work normally and smoothly when it's drive by two sets of links that embedded in its structure and pulled by a servomotor, so the Denvit-Hartenberg method was used to analyse the forward kinematics for the prosthetic finger joints to deduction the trajectory of the fingertip and the velocity of the joints was computed by using the Jacobian matrix. The prosthetic finger was modelled by the Solidwork - 2018 program and the results of kinematics were verified using MATLAB. The analys

The zeolite's textural properties have a significant effect on zeolite's effectiveness in the different industrial processes. This research aimed to study the textual properties of the NaX and FeX zeolites using the nitrogen adsorption-desorption technique at a constant low temperature. According to the International Union of Pure and Applied Chemistry, the adsorption-desorption isotherm showed that the studied materials were mixed kinds I/II isotherms and H3 type hysteresis. The Brunauer-Emmett-Teller isotherm was the best model to describe the nitrogen adsorption-desorption better than the Langmuir and Freundlich isotherms. The obtained adsorption capacity and Brunauer-Emmett-Teller surface area values for NaX were greater than FeX. Ac

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 ord