Volume 2, Issue 2, Autumn 2010, Page 1-14


Partial Encryption Of Color Image By Edge Detection

Ali A.Yassin

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 2, Issue 2, Pages 1-19

The research is aim to use some of image features which represent in edge detection method, color image analyses for main components (Red, Green and Blue) and then collected this features with main principles of partial encryption for obtain to modern algorithm can get exact results , high processing speed, in addition we use one bit from each byte that located in edge of each layer(Red, Green and Blue) of color image instead use all bits of byte, the operation of selected bit called "Bit-Plane" . The algorithm rely on two images , the first is representing the image that we want encryption it and the second key image is deriving from it. The high performing is very active of algorithm when we deal with pixels parts of both images , these parts are calling edge pixels that calculate in canny method. At last we are performed encryption operation by using "XOR" for each layers in input and key images for producing encrypted image. The strong of algorithm in expected difficult of key image and then discovered plane of bit for both images.

Combinatorial Realizability Of The New Exact Sequence

Dheia G.S.Al-Khafaji

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 2, Issue 2, Pages 1-18

In this work we introduce and study the generalization of
combinatorial realizability of J.H.C.Whitehead and a new notion
analogous of Jm-complex , which we call Jm,q-complex .
Consider the following sequence

The Effect Of Number Of Training Samples For Feed Forward Neural Network

Luma. N. M.Tawfiq; Alaa K. J. AL-Mosawi

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 2, Issue 2, Pages 1-9

In this paper we study the effect of the number of training samples for feed forward neural networks (FFNN) which is necessary for training process of feed forward neural network. Also we design 5 FFNN's and train 41 FFNN's which illustrate how good the training samples represent the actual function for FFNN

Digital Signature For Text File

Ayad Ibrahim Abdulsada

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 2, Issue 2, Pages 1-10

Digital signatures are used to detect unauthorized modifications to data and to authenticate the identity of the signatory. In addition, the recipient of signed data can use a digital signature as evidence in demonstrating to a third party that the signature was, in fact, generated by the claimed signatory. This is known as non-repudiation, since the signatory cannot easily repudiate the signature at a later time. In this paper, an algorithm for signing text file has been presented. The famous RSA public key algorithm and SHA-l(Secure Hash Algorithm) hash function are used to generate the digital signature of a text file. Our algorithm consist of two parts: signature generation and signature verification. Many experiments tested to examine the security of the presented work.

Analysis of Nested Repeated Measures Model with applications

Abdul - Hussein S . Al - Mouel; Ban M . Batto

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 2, Issue 2, Pages 1-11

In this paper we study the balanced 4 – way mixed effects model that has one random effect interacting with one fixed effects and this interaction interacts with each of other two fixed effects as a nested repeated measures model .

As studies of water in the present time of the basic necessities, which must be carried out, the fact that the quality of water has become specific agricultural production, both quantitatively and qualitatively, in addition, the use of the kinds of poor water is reflected not only damage to crop productivity but may lie in the land itself so that result, over the years to a deterioration in the overall qualities good soil and the emergence of the problems of salinization and alkalinity and toxin crops planted.

From here we discussed the application of data on agricultural the experience of the study as well as types or levels of different fertilization to reduce existing salinity in the waters of subterranean wells for three sites in the Zubayr region and the impact on the production rate recipes growth)the level of higher plant) a crop also targeted the experience in the same time creating overlap between the quality of water used, as well as chemical fertilization and their impact on production quantity and quality through the application of the model of repeated measurements.

Design and Implementation of an Iris Recognition System

Zakaria Ahmed Uraibi; Hameed Abdul-Kareem Younis

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 2, Issue 2, Pages 1-14

Hough transform is still the most commonly used method in many Iris Recognition Systems (IRSs) used in large companies and airports around all over the world. However, studies implemented demonstrated that Hough transform is a time consuming method. Moreover, the algorithm should be repeated twice (adding further time consuming); one for the isolation of the iris region and the other for the pupil region through the detection of the radius and the centre of both regions.
In this paper, a new technique to isolate the iris and the pupil regions for an IRS has been proposed. This technique, by considering the centre of the iris is exactly that of the pupil, applies two new algorithms, one to find the radius and the centre of the pupil and the other to find the radius of the iris. These algorithms make use of the intensity values of the pupil and the iris areas through setting different thresholds for their isolation. The new technique is programmed using MATLAB 6.5.
The results of this study have shown that the time required to isolate the iris region and the pupil region can be reduced rapidly using this new technique. Where it requires only (3) seconds to isolate both the iris and the pupil regions on a Pentium IV PC (1.7 GHz) using this new technique. This new applied technique to isolate the iris region and the pupil region has been tested on a 100 images database, all reporting a zero failure rate.

Sets In Topological Spaces

Raad Aziz Hussain Al-Abdulla; Sema Kadhim Gaber

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 2, Issue 2, Pages 1-16

This work consist of two sections. In section one we recall the definition of connected sets. We also introduce similar definition using sets and study the property of this definition. In ]5[ ]1[ and are studied respectively. In section two we introduce similar definition using sets. In particular we will prove that in MI-space the and are equivalent.

r-convergence in metric space

Salah. M. Ali

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 2, Issue 2, Pages 1-6

In this paper, firstly we introduce some fundamental concepts are included relating to r-convergence of sequences in a metric space and give some examples. Secondly we consider some differentiations between conventional convergence sequences and r-convergence sequences.

On Studying Hessian Matrix with Applications

Adel Mohammed Hassan Rizak

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 2, Issue 2, Pages 1-8

To study the properties of definite and Hessian matrices and using it in finding the critical points of quadratic forms .
On the other hand, the applications of Hessian matrix are introduced in static springs system problem

An Equations Related to θ-Centralizers on Lie Ideals

Abdulrahman H. Majeed; Mushreq I. Meften

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 2, Issue 2, Pages 1-10

Abstract : The purpose of this paper is to prove the following result :
Let R be a 2-torsion free prime ring , U a square closed Lie ideal, and T,: RR are additive mappings, such that 3T(xyx) = T(x)θ(yx) + θ(x)T(y)θ(x) + θ(xy)T(x) and θ(x)T(xy+yx)θ(x) = θ(x)T(y)θ(x2) + θ(x2)T(y)θ(x) holds for all pairs x, y  U , if θ is a surjective endomorphism on U, and T(u) U, for all uU, then T(xy)= T(x)θ(y) = θ(x)T(y) for all x,yU.

A NEW EXACT SEQUENCE A generalization of J.H.C.Whiteheads " Certain exact sequence

Dheia G.S.Al-Khafaji; Raymond N. Shekoury

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 2, Issue 2, Pages 1-8

In this work we introduce and study a new notion in algebraic topology , which we call " a new exact sequence " which is a generalization of " a certain exact sequence " of J.H.C.Whitehead .
Consider the following sequence :

denote

The sequence

defined in a natural manner , Where we call " a new exact sequence " which is denoted by NES .
We obtain some results from NES , which are ;
The our NES it is really exact , the class of all NES,s and
the homomorphisms between these sequences forms a category
.