Search

An improvement to a Steganography method for hiding data using Gray Level Images is proposed in this paper. The method is an improvement over earlier method named Least Significant Bit (LSB). This method uses the 5th, and 6th bits of pixel value for insertion and retrieval of message by using the same bits of pixel value. The idea here, deals with images in different sizes and extensions (BMP, JPG, PNG) for obtaining better results and more efficient than its original one (LSB). The selection of pixel locations is done by using the pseudo random number generator, Which is uses the same key for insertion as well as retrieval of process. The experiments show the Superiority of the new idea through using the performance measures (PSNR, BER, NC).

Among the various forms of malware, Botnets are emerging as the most serious threat, Botnets, remotely controlled by the attackers, and whose members are located in homes, schools, businesses, and governments around the world. This paper is a survey about Botnet and how Botnet is detected. The survey clarifies Botnet history, Botnet lifecycle, Botnet detection techniques, and proposed software has ability to detect (koobface) Botnet which attacks facebook website.

In the distributed real time systems, tasks must meet their deadline even in the presence of hardware/software faults. Fault tolerance in distributed real time systems refers to the ability of the system to meet the tasks deadline and to detect their failure and recover them. In this paper, we considered the problem of fault tolerance and developed a fault tolerance protocol called DRT-FTIP (Distributed Real Time – Fault Tolerance Integrity Protocol).This protocol increases the integrity of the scheduling in distributed real time systems.

This paper deals with PageRanks which are used in the analysis of web links. It displays an introduction for the concept PageRanks and also some basic theoretical aspects related to it. It exposures three common methods for the purpose of calculating PageRanks: the direct method, the Markovian method and the power method. In order of fortification, these methods are applied on Internet sites being considered for the centers of the University of Mosul. Because the lack of realistic data, we dealt with hypothetical data for modeling and analysis of the links between sites centers affiliated to the University of Mosul. It is clear from the practical application of the three methods that they give consistent results.

With the development of means of communication, computer science and information exchange via electronic information networks an urgent need emerged to find ways to save exchanged information. Encryption had a prominent role in this area. However, with the development of intrusion hackers become able to access to information and change it. This showed the need to adopt more sophisticated technology and more confidentiality in order to preserve the information. So, it become famous to use the system of coverage in which the sent the information being invisible to anyone, through hiding it inside the sent media, such as audio, image, text, and video. This paper aims to apply the idea to hide image message, using the least significant bit algorithm inside an image and encrypt it in a new way for encryption using a genetic algorithm. For the purpose of increasing security of the access of the letter it is being encrypted to hide the message before using the genetic algorithm to generate random numbers employed in the process of concealment, for the highest extent of randomness. This in turn increases the strength of encryption and concealment. The study has been able to achieve this by adopting the recommended approach in such cases

In this paper we used non parametric density estimator (Kernel Estimator) to estimate probability density function for Image data of Hand Gesture and warping Hand Gesture and we see the curve for Kernel Estimator and combine the curve between Kernel Estimator and normal Distribution. Programs written using the language Matlab (R2009a) .

This paper presents a new method for fingerprint recognition depending on various sizes of fingerprint images. The proposed algorithm applied on more than 30 fingerprint samples, the results was good. The proposed algorithm begins with apply enhancement operations on the fingerprint image to eliminate unwanted noise around the fingerprint by using median filter. Then apply thinning operation on the enhanced image and compute co-occurrence matrices for produced image. Next, the properties of the co-occurrence matrices used as inputs of the neural network for recognition process. To speed the recognition process back propagation network used. The ratio of recognition about 100%.

This paper presents a medical application based on digital image processing and Artificial Neural Network (ANN), which can recognize three types of Hereditary Hemolytic Anemia (HHA) that affect the Red Blood Cells (RBCs) and change their shape. Three Feed Forward Back Propagation Learning (FFBBL) Neural Networks are used in hierarchical approach to achieve this goal. The essence of this research is to segment each Red Blood Cell in a separate image and then extract some interesting features from each image in order to present them to the neural networks. The latter will, in turn, take the decision whether the RBC is infected or not. The results showed a recognition rate 92.38 %.

The objective of this paper is to speed the solution of linear Boundary Value Problem (LPVPs) by parallel Programming by using cs_tools where the solution methods is the linear superposition Algorithm.

The world is tend now a lot of development in communication field specially in internet , therefore it is very important to find security methods for files that is send from one place to another. One of these security approaches is steganography which have characteristic of transfer massages within transmission media (files) without notice from any obtrusive. This paper provide anew suggested method for hiding text in audio file (wav file), first the text file will be read to extract the massage which is hidden, for more security this massage will be encrypted (or coded ) before hiding it inside sound media (in time domain) . This algorithm was applied on more than one example and good results were obtained without missing the text massage or notice any noise in the cover file.

The main objective of speech coding is to allow the transmission of speech over digital channel of the highest speech quality and least possible bit rate, beside the security purpose. In this paper, the speech was coded by transforming it applying (which is often single dimension) into a two dimensional array to be suitable for transferring the countourlet transformation. Applied EZC (Embedded Zero tree Contourlet) algorithm, then is applied to the Huffman coding on the results of EZC, and used RLE (Run Length Encoding). The above idea gave the ability for coding, compression with retrieved information of high accuracy, using some measurements for quality measured of reconstructed signal, and found results show high similarity between the original and reconstructed signal.

The aim of this research is to use neural network in future forecasting field to show the of jumping competitions in international Olympics for (2016-2024). Expert system named (AAA) is designed by using neural network in future forecasting field for period chain of data from 1984 to 2012,which represents 8 years period. The data represent the first three winners in running competition for (100 m., 200 m., 400 m., 100 m. Hurdles, 400 m. Hurdles, 4×100 Relay, 4×400 Relay), The prepared programs for this research has been done C++. Then it forecast three future levels represented in (2016, 2020, 2024),where the Olympic Cycle take place each 4 years. Throughout the results it found that forecasting values are the best by using neural networks then other traditional methods used before. This paper is depended on the results of athletes who take Olympic medals in women jumping events (long, triple, high and pole-vault) in 8 Olympic cycles, since Tokyo cycle (1984) till the last Olympic cycle in (2012) . The cycle on (1984) was used as the beginning of study as it considered as the first Olympic cycle.

Software Quality still a vague and multifaceted concept, which means different things to different people, metrics for object oriented design focuses on measurements that are applied to the class and design characteristics. These measurements allow designers to access the software early in process, making changes that will reduce complexity and improve the continuing capability of the design. This paper focused on a set of object oriented metrics that can be used to measure the quality of an object oriented design. We study carefully Metrics for object oriented design and focus on MOOD model.

Semantic Web is an extension to the current web. It will convert the way we use World Wide Web (WWW) by giving the machine the capability to process and infer data in web. It starts as a vision and becomes a future trend in web. Due to the huge data that is scattered as web pages in web today, adding semantic meaning to data stored in these pages became necessary for the next age of information technology. The Semantic Web will bring structure to the meaningful content of Web pages, creating an environment where software agents roaming from page to page can readily carry out sophisticated tasks for users. Several tools and new technologies have been emerged to help bring this vision to reality. In this paper, Semantic Web is defined and described with its layering architecture and supporting technologies and tools. An example is given to show how to use these tools to semantically representing data model. At last, challenges and difficulties faced building this web and made it an extension to the current web has been discussed.

Data warehousing and on-line analytical processing (OLAP) are essential elements of decision support, which has increasingly become a focus of the database industry. A distributed OLAP system is designed which uses multi microcomputers based local area network. The introduction distributes technology into OLAP system that can disintegrate the complicated query and analysis into different servers. In this paper, there are a lot of theoretical concepts associated with data warehouse and OLAP systems, and distributed data will be the implementation of several measures such as design cubic data and distribution algorithm and division of the data warehouse and decision support system DSS is performed to answer the complicated query. Practical results show that the distribution of data to multiple servers with OLAP system is faster according to the algorithm that has been dealing with client-server architecture to distribute the data warehouse. Statistical analysis concepts are used from current work to get predictable results which can be used to get suitable result DSS.

Let and be any two distinct vertices in a connected graph . A container is a set of internally disjoint - paths. The width of is denoted by or is , and the length of is the length of the longest - path in . Then, for a given positive integer w, the width distance between any two distinct vertices u and v in a connected graph is define by: , where the minimum is taken over all containers of width w. In this paper, we find the Hosoya polynomials, and Wiener indices of the join of two special graphs such as bipartite complete graphs, paths, cycles, star graphs and wheel graphs with respect to the width distance.

For a wheel and a cycle the composite graphs ⊠ is constructed from the union of and and adding the edges and , where is an edge of and is an edge of . The n – diameter , the n – Hosoya polynomial and the n – Wiener index of ⊠ are obtained in this paper.

In this paper, we study the global convergence properties of the new class of preconditioned conjugate gradient descent algorithm, when applied to convex objective non-linear unconstrained optimization functions. We assume that a new inexact line search rule which is similar to the Armijo line-search rule is used. It's an estimation formula to choose a large step-size at each iteration and use the same formula to find the direction search. A new preconditioned conjugate gradient direction search is used to replace the conjugate gradient descent direction of ZIR-algorithm. Numerical results on twenty five well-know test functions with various dimensions show that the new inexact line-search and the new preconditioned conjugate gradient search directions are efficient for solving unconstrained nonlinear optimization problem in many situations.

In this paper, the approximate solution of a reaction-diffusion system with fast reversible reaction is obtained by using Adomian decomposition method (ADM) and variational iteration method (VIM) which are two powerful methods that were recently developed. The VIM requires the evaluation of the Lagrange multiplier, whereas ADM requires the evaluation of the Adomian polynomials. The behavior of the approximate solutions and the effects of different values of are shown graphically.

In this paper, the parabolic partial differential equations in three-dimensions are solved by two types of finite differences, such as, Alternating Direction Explicit (ADE) method and Alternating Direction Implicit (ADI) method. By the comparison of the numerical results for the previous two methods with the Exact solution, we observe that the results of Alternating Direction Implicit (ADI) method is better and nearest to the exact solution compared with the results of Alternating Direction Explicit (ADE) method. we also studied the numerical stability of both methods by Von-Neumann Method.

As a generalization of right weakly regular rings, we introduce the notion of right n-weakly regular rings, i.e. for all aN(R), aaRaR. In this paper, first give various properties of right n-weakly regular rings. Also, we study the relation between such rings and reduced rings by adding some types of rings, such as NCI, MC2 and SNF rings.

Trust concept is an important requirement for sustained interactions between peers, and to deal with malicious peers in P2P file sharing systems. Traditional security mechanisms and services are unable to protect against malicious behaviors, therefore trust and reputation management is considered an appropriate solution that can provide a protection against such threat. In this paper, we focused on the advantage of some existing trust models to formulate a new model that solves problems raised in the previous models. We also considered the partially decentralized (PD) peer-2-peer (P2P) architecture to execute the proposed model. Finally, we construct a C# based simulator to test proposed model on the partially decentralized P2P file sharing network. Simulation results show that the model is able to identify malicious peers effectively and isolate them from the system (sharing files), hence reducing the amount of inauthentic uploads and increasing peers’ satisfaction.

In this paper, we introduce a new class of open sets defined as follows: A subset A of a topological space is called iα-open set, if there exists a non-empty subset O of X, , such that. Also, we present the notion of iα-continuous mapping, iα-open mapping, iα-irresolute mapping, iα-totally continuous mapping, i-contra-continuous mapping, iα-contra-continuous mapping and we investigate some properties of these mappings. Furthermore, we introduce some iα-separation axioms and the mappings are related with iα-separation axioms.

This paper devoted to study the stability of periodic motion for physical application which is leads to differential equations of second order )Double and Spherical Pendulum( respectively by using the stability of equilibrium position given by Laypunov and Ghetagev's methods which depends on principle of energy conservation, also we will describe periodic motion and explain the phase plane )The trajectory of solutions( and state of the stability for double and spherical pendulum by using )Maple(.

Many real world problems involve the simultaneous optimization of various and often conflicting objectives. Evolutionary algorithms seem to be the most attractive approaches for this class of problems, because they are usually population based techniques that can find multiple compromise solution in a single run, and they do not require any hypotheses on the objective functions. Among other techniques, in the last decade a new paradigm based on the emulation of the immune system behavior has been proposed. Since the pioneer works, many different implementations have been proposed in literatures. This Paper presents a description of an intrusion detection approach modeled on the basis of three bio-inspired concepts namely, Negative selection, Positive selection and complement system. The Positive selection mechanism of the immune system can detect the attack patterns (nonself), while the Negative selection mechanism of the immune system can delete the Artificial lymphocyte (ALC) which interact with normal patterns (Self). The complement system is a kind of the effecter mechanism, which refers to a series of proteins circulating in the blood and bathing the fluids surrounding tissues. It establishes the idea that only those cells that recognize the antigens are selected to undergo two operators: cleave operator and bind operator are presented, cleave operator cleaves a complement cell into two sub-cells, while bind operator bindtwo cells together and forms a big cell. To obtain Complement detectors can recognize only the attack patterns from the NSL-KDD dataset.

In this research paper a system has been proposed to be used in data compression of digital image based on two hybrid intelligent Algorithms. In the first algorithm which is now as Meta Heuristic Genetic Compression Algorithm (MGCA) the characteristic and features of GA and local search are used to compress digital image. The second algorithm is the (HMGTCA) Hybrid Meta Genetic and Tabu Compression Algorithm. Hybrid operation has been done between Meta Heuristic Genetic and Tabu search algorithm. The proposed algorithm has been applied on four samples. Efficiencies measures has been performed pled to calculate the value of (PSNR, MSE, correlation coefficient, compression ration and calculate the performance time). The experiments showed that the proposed algorithm achieved high performance and produces PSNR= 34.

This paper proposes a new four-dimensional continuous autonomous hyperchaotic system based on the 3D Pan system by introducing a nonlinear state feedback controller. Dynamical behaviors of the new system are analyzed, both theoretically and numerically, including equilibrium points, Lyapunov exponents spectrum stability and bifurcation , finally, an illustrative example is given.

In this paper, the Discrete Wavelet Transform is studied in purifying the sound signal from noise because of the good capabilities in this scope, especially when it is merged with both types of the (Thresholding), the solid and the flexible. The aim of this research is making comparisons between the types of deferent Discrete Wavelet Transform for both the filters which are used (Harr, Daubechies) in deferent levels (2, 3, 4, 5) with the additive of two types of noise to these filters (Gaussian White Noise) and (Random Noise). The decibel value that added to these filters was in the (5dB,10dB,15dB) values. Good results of the purification process are achived after computing the (Signal to Noise Ratio (SNR)) and (Mean Sequre Error (MSE)).

In this paper, we use Romberg algorithm, to find an approximation solution for a system of nonlinear Fredholm integral equations of the second kind. A comparison between this approximations and exact solutions for four numerical examples are given, depending on the least-square error and running computer time. Our numerical results are obtained by MATLAB 7.0 program and for a system of rank 2×2, 3×3 on Personal Computer P4.

In this paper, we studied differential system like of three dimensional Lorenz system. Nonlinear characteristic and basic dynamic properties of three dimensional autonomous system are studied by means of nonlinear dynamics theory, including the stability and we found that the value is effected by the form of the roots.

The aim of this paper is to study the existence, uniqueness and other properties of solutions of certain Volterra-Fredholm integral and integro differential equations. The tools employed in the analysis are based on the applications of the Banach fixed point theorem coupled with Bielecki type norm and certain integral inequalities with explicit estimates.

This paper develops a special conjugate gradient algorithm for solving unconstrained minimized problems. This development can be regarded as some kind of convex combination of the MPR and MLS methods. Experimental results indicate that the new algorithm is more efficient than the Polak and Ribiere - algorithm.

In this paper, we will find the numerical solution of Gray-Scott model in two dimensions space, this method is a system of non-linear parabolic partial differential equations. Then transforming the original model (system of non-linear PPDEs), by using the method of lines to a system of ODEs. Therefore we used Runge-Kutta methods (Explicit RK method and Implicit RK method) to find the numerical solutions of the new systems, and we compared between these methods, we saw that the numerical results of IRK methods is more accurate than the numerical results of ERK method.

Due to the fact that most of the application on EZT algorithm were applied on wavelet transformation. In the last ten years, the contourlet transformation shows that its efficiency is higher than the wavelet transformation due to its ability to deal with multidirections instead of the vertical and horizontal directions which are covered by the wavelet transformation. In this paper, the contourlet coefficient is adopted as inputs to the EZT (which normally are a wavelet coefficient ). Arranging the contourlet coefficient to be studied as input to EZT, the result of adopting modified contourlet coefficient was studied on two parameters (the file size and threshold value ) and tested by evaluating two factors (correlation and MSE). Comparing the result which we get it with the wavelet technique shows that the contourlet gives a result closer, to the original one depending on the correlation factor plus the PSNR factor. So, the proposed technique can be achieved.

The detour distance between two distinct vertices and of a connected graph is the length of a longest path in. The detour index of is defined by, and the detour polynomial of is . The detour indices and detour polynomials of some ladder graphs are obtained in this paper.

The aim of this paper is to introduce and study a new class of topological groups called Pθ-topological group. By using some nonstandard techniques, we investigated some properties of Pθ-monads in Pθ-topological group.

The aim of this paper is to introduce a new type of ξ-open sets in topological spaces which is called ξ-open sets and we study some of their basic properties and characteristics.

In this work, a new method is implemented for removing noise from gray scale image that depends on two-dimensional discrete wavelet transform and Threshold stage (hard threshold). This paper represents the algorithm to remove the speckle noise by using logarithm operation. This operation changes the multiplicative noise to additive noise. So that, the removing operation becomes easier. The Matlab program is used to build the Algorithm and measure the PSNR and other measurement criteria as (NMV, NV, NSD, ENL and PSNR) to study the effect of removing noise from corrupted image. The PSNR reaches to 24dB which is very satisfactory result in the reconstructed image, while the maximum value of ENL is 2.23 * 106, and the minimum value of NMV, NV, NSD which is equal to 6.79, 2.67*10-5, 46* 10-4 respectively gives a smoother and cleaner image. The universal Threshold is applied in high frequency coefficient (i.e. the LH, HL, and HH-sub band of image) to remove the speckle noise and the low frequency coefficient (LL-sub band of image) is still without any change.

This paper deals with the numerical solution for Sine-Gordon system in two dimensions using two finite difference methods the (ADE) and (ADI) methods .A comparison between the two methods has been done and we have obtained that the (ADE) method is the easer while the (ADI) method is more accurate than the (ADE) method. We also studied the stability analysis for each method by using Fourier (Von Neumann) method and we have obtained that the (ADI) method is unconditionally stable while the (ADE) method is stable under the condition and where is the ratio of the waves speed u , w and .

The principle of hybrid information hiding represented by process of information hiding message (multimedia files) embedded inside another message which is depended on hiding a certain media in another media using different domains (special domain, frequency domain) to provide protection and security for transformed data, this paper suggest an algorithm by using two different files first one compressed binary image, the compression method is run-length and hided this file inside the hostage media by use frequency domain which is represented by Discrete cosine transform (DCT), the second is text ciphered by Caesar method which is depended one secret key by using spatial domain. The data has been retrieved with no error for both text and binary image after deciphering and decompress process completed; the value of normalization correlation factor for both of them is equal to one.