In this paper, a simple fast lossless image compression method is introduced for compressing medical images, it is based on integrates multiresolution coding along with polynomial approximation of linear based to decompose image signal followed by efficient coding. The test results indicate that the suggested method can lead to promising performance due to flexibility in overcoming the limitations or restrictions of the model order length and extra overhead information required compared to traditional predictive coding techniques.

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

Objective: The objectives of the present study were to evaluate the effectiveness of the instructional intervention
about medical and health knowledge of patients with diabetes mellitus type II.
Methodology: A Quasi- experimental study was carried out in National Center for Diabetes Mellitus/ Almustansria
University, started from 4th January 2012, to 1st April 2012. Non-probability (purposive sample) of (50) diabetes
mellitus type II, who visit National Center for Diabetes Mellitus/ Almustansria University. The study sample is
divided equally into (25) study and (25) control groups. The study group received the instructional intervention.
While the control not exposed to the instructional intervention. The data are coll

Moderately, advanced national election technologies have improved political systems. As electronic voting (e-voting) systems advance, security threats like impersonation, ballot tampering, and result manipulation increase. These challenges are addressed through a review covering biometric authentication, watermarking, and blockchain technologies, each of which plays a crucial role in improving the security of e-voting systems. More precisely, the biometric authentication is being examined due to its ability in identify the voters and reducing the risks of impersonation. The study also explores the blockchain technology to decentralize the elections, enhance the transparency and ensure the prevention of any unauthorized alteration or

Protecting information sent through insecure internet channels is a significant challenge facing researchers. In this paper, we present a novel method for image data encryption that combines chaotic maps with linear feedback shift registers in two stages. In the first stage, the image is divided into two parts. Then, the locations of the pixels of each part are redistributed through the random numbers key, which is generated using linear feedback shift registers. The second stage includes segmenting the image into the three primary colors red, green, and blue (RGB); then, the data for each color is encrypted through one of three keys that are generated using three-dimensional chaotic maps. Many statistical tests (entropy, peak signa

This paper proposes a new encryption method. It combines two cipher algorithms, i.e., DES and AES, to generate hybrid keys. This combination strengthens the proposed W-method by generating high randomized keys. Two points can represent the reliability of any encryption technique. Firstly, is the key generation; therefore, our approach merges 64 bits of DES with 64 bits of AES to produce 128 bits as a root key for all remaining keys that are 15. This complexity increases the level of the ciphering process. Moreover, it shifts the operation one bit only to the right. Secondly is the nature of the encryption process. It includes two keys and mixes one round of DES with one round of AES to reduce the performance time. The W-method deals with

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over