In this paper, an efficient method for compressing color image is presented. It allows progressive transmission and zooming of the image without need to extra storage. The proposed method is going to be accomplished using cubic Bezier surface (CBI) representation on wide area of images in order to prune the image component that shows large scale variation. Then, the produced cubic Bezier surface is subtracted from the image signal to get the residue component. Then, bi-orthogonal wavelet transform is applied to decompose the residue component. Both scalar quantization and quad tree coding steps are applied on the produced wavelet sub bands. Finally, adaptive shift coding is applied to handle the remaining statistical redundancy and attain e

In the present work, we use the Adomian Decomposition method to find the approximate solution for some cases of the Newell whitehead segel nonlinear differential equation which was solved previously with exact solution by the Homotopy perturbation and the Iteration methods, then we compared the results.

Embedding an identifying data into digital media such as video, audio or image is known as digital watermarking. In this paper, a non-blind watermarking algorithm based on Berkeley Wavelet Transform is proposed. Firstly, the embedded image is scrambled by using Arnold transform for higher security, and then the embedding process is applied in transform domain of the host image. The experimental results show that this algorithm is invisible and has good robustness for some common image processing operations.

     Let  be any connected graph with vertices set  and edges set .  For any two distinct vertices  and , the detour distance between  and  which is denoted by  is a longest path between  and  in a graph . The detour polynomial of a connected graph  is denoted by ;  and is defined by . In this paper, the detour polynomial of the theta graph and the uniform theta graph will be computed.

Nowadays, the rapid development of multi-media technology and digital images transmission by the Internet leads the digital images to be exposed to several attacks in the transmission process. Therefore, protection of digital images become increasingly important.

 To this end, an image encryption method that adopts Rivest Cipher (RC4) and Deoxyribonucleic Acid (DNA) encoding to increase the secrecy and randomness of the image without affecting its quality is proposed. The Means Square Error (MSE), Peak Signal-to-Noise Ratio (PSNR), Coefficient Correlation (CC) and histogram analysis are used as an evaluation metrics to evaluate the performance of the proposed method. The results indicate that the proposed method is secure ag

Maplesoft is a technical computation forms which is a heart of problem solving in mathematics especially in graph theory. Maplesoft has established itself as the computer algebra system for researchers. Maplesoft has more mathematical algorithms which is covering a wide range of applications. A new family ( ) of 6-bridge graph still not completely solved for chromatic number, chromatic polynomial and chromaticity. In this paper we apply maplesoft on a kind of 6-bridge graph ( ) to obtain chromatic number, chromatic polynomial and chromaticity. The computations are shown that graph contents 3 different colours for all vertices, 112410 different ways to colour a graph such that any two adjacent vertices have different colour by using 3 dif

The objective of this work is to design and implement a cryptography system that enables the sender to send message through any channel (even if this channel is insecure) and the receiver to decrypt the received message without allowing any intruder to break the system and extracting the secret information. In this work, we implement an interaction between the feedforward neural network and the stream cipher, so the secret message will be encrypted by unsupervised neural network method in addition to the first encryption process which is performed by the stream cipher method. The security of any cipher system depends on the security of the related keys (that are used by the encryption and the decryption processes) and their corresponding le

            Human Interactive Proofs (HIPs) are automatic inverse Turing tests, which are intended to differentiate between people and malicious computer programs. The mission of making good HIP system is a challenging issue, since the resultant HIP must be secure against attacks and in the same time it must be practical for humans. Text-based HIPs is one of the most popular HIPs types. It exploits the capability of humans to recite text images more than Optical Character Recognition (OCR), but the current text-based HIPs are not well-matched with rapid development of computer vision techniques, since they are either vey simply passed or very hard to resolve, thus this motivate that

Load balancing in computer networks is one of the most subjects that has got researcher's attention in the last decade. Load balancing will lead to reduce processing time and memory usage that are the most two concerns of the network companies in now days, and they are the most two factors that determine if the approach is worthy applicable or not. There are two kinds of load balancing, distributing jobs among other servers before processing starts and stays at that server to the end of the process is called static load balancing, and moving jobs during processing is called dynamic load balancing. In this research, two algorithms are designed and implemented, the History Usage (HU) algorithm that statically balances the load of a Loaded