Volume 7, Issue 1, Spring 2015, Page 1-172


On 3-semiprime Ideal With Respect To An element Of A near ring

Showq M.Ibrahem - Intissar Abd AL- Hur Kadum

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

In this paper ,we introduce the notions 3-semiprime ideal with respect to an element x denoted
by (x-3-S-P-I ) of a near ring and the 3-semiprime ideal near ring with respect to an element x
denoted by (x-3-S-P-I near ring ),and we studied the image and inverse image of x-3-S-P-I under
epimomorphism and the direct product of x-3-S-P-I of near ring and we extension to fuzzify this
notions and give some properties and examples about this .

Asymptotic behavior of second order non-linear neutral differential

Hussain Ali Mohamad; Intidhar Zamil Mushtt

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 7, Issue 1, Pages 15-27

In this paper, we have given some necessary and sufficient conditions for all nonoscillatory solutions to the nonlinear neutral differential equation
So that converge to zero as . Some examples are given to illustrate the obtained
results.

Computing the shortest route amongmultiple points without revealing theirgeographical locations

Ayad Ibrahim Abdulsada Ali Hussein Rason Ali A. Yassin

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 7, Issue 1, Pages 28-40

Travelling salesman problem (TSP) represents a classical optimization problem.
Its main goal is to find the shortest route when visiting multiple points.
However, the state of the art methods are generally assumed that the
geographical locations are not private. This reduces the utilization of these
methods to work within public environments. Essentially, this assumption limits
more practical applications, e.g., the shortest route among military bases, where
the geographical locations of such bases are confidential. This paper presents a
method for privately computing the shortest route among multiple points on the
Earth without compromising the privacy of their locations.

Countability Axioms in Smooth Fuzzy Topological Spaces

Munir Abdul khalik Alkhafaji - Amer Himza Almyaly

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 7, Issue 1, Pages 41-52

The aim of this paper is to introduce the countability axioms in smooth fuzzy
topological spaces (smooth fuzzy first countable, smooth fuzzy second countable and
smooth fuzzy separable axiom) and try to find relations between them. Such that we
will prove the following: smooth fuzzy first countable axiom ↛ ⃖ smooth fuzzy second
countable axiom ↚ smooth fuzzy separable axiom. Also, we prove or disprove those
concepts are hereditary or topological.

On MKC-spaces , MLC-spaces and MH-spaces

Reyadh Delfi Ali; Adam Abdulla Abker

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 7, Issue 1, Pages 72-84

The purpose of this paper is deal with the study of
MKC
-spaces( spaces whose
minimal
 KC
spaces) and
spaces MLC 
( spaces whose minimal
spaces LC 
)also we
studied the relationships between minimal
 KC
spaces, minimal
spaces LC 
and minimal
Hausdroff spaces.

O-C TOPOLOGY AND SIERPINSKI SPACE

Ali Karim Lelo

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 7, Issue 1, Pages 85-89

In this paper we choose a different approach and propose a generalization of Sierpinski
space by defining a topology analogous to Sierpinski topology with the general
collection which is form a topology on a non empty set  ,and the definition of K.
Khan [5] will be only special case , so the ( O-C topology) is introduced . We
investigate some of the general topological characterization of it , and this has a very
interesting applications especially the Sierpinskispace whichisresult from the finite set
which containing only two points .

New Class of Meromorphic Univalent Functions

Waggas Galib Atshan and Faiz Jawad Abdulkadhim

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 7, Issue 1, Pages 106-118

In this paper We define a new class of meromorphic univalent functions in the
punctured unit disk. We obtain coefficient inequalities, Closure Theorem, convex
companion , distortion bound , Partial sums and neighborhood property, and Hadamard
product. Atshan[9], Cho et al.[6], Atshan and Kulkarni[3], Seoudy and Aouf [7] studied the
meromorphic univalent functions for another classes.

ENHANCEMENT IN E-LEARNING & M-LEARNING USING 3D

MUSTAFA ABDALRASSUAL JASSIM

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 7, Issue 1, Pages 119-130

3D technology is getting much popularity in the recent era of technology this is the
technology in which we can see the image from different angles. TVs and iPhones are available
in 3D, 3D technology is used in different application and it is increasing day by day. Now a days
3D cameras, 3D webcams, 3D movies available. In 3D seeing images come alive. 3D projection
has been seemed a technology long on potential but short on practicality. New prototype
appeared a trade shows year after year, and while they were drool-worthy, manufacturers just
couldn’t pull 3D into the production stage. These days 3D are used in different sectors like,
corporate enterprise training, health industries and in teaching learning process. Present study
discusses that we can Enhance E-learning and M-Learning with help of 3D

Recognize some of Arabic phonemes by using Mamdani NeuroFuzzy Network

Saba Abdul-Wahed S

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 7, Issue 1, Pages 131-145

Modified mamdani neurofuzzy network scheme has been proposed and presented in this
paper to recognize some of Arabic phonemes. The number of connecting is reduced to be
equal to the number of member ship function plus one. to training this network ,we used some
of sound segments which contain from two or three phonemes and recorded from more than
one person in different age and both sexes in the same environment by used the same
recorded programming (sound forge 5.0) . The proposed technique has been testing by using
different group from sound segments which recorded in the same environment and recorded
program. The percentage of recognition reaches to 87% to all recorded phonemes

Contourlet Transform based Method for Medical Image Denoising

Abbas Hanon Hassin AlAsadi

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 7, Issue 1, Pages 146-159

Noise is an important factor of the medical image quality, because the high noise of medical
imaging will not give us the useful information of the medical diagnosis. Basically, medical
diagnosis is based on normal or abnormal information provided diagnose conclusion. In this paper,
we proposed a denoising algorithm based on Contourlet transform for medical images. Contourlet
transform is an extension of the wavelet transform in two dimensions using the multiscale and
directional filter banks. The Contourlet transform has the advantages of multiscale and timefrequency-localization properties of wavelets, but also provides a high degree of directionality. For
verifying the denoising performance of the Contourlet transform, two kinds of noise are added into
our samples; Gaussian noise and Speckle noise. Soft thresholding value for the Contourlet
coefficients of noisy image is computed. Finally, the experimental results of proposed algorithm are
compared with the results of wavelet transform. We found that the proposed algorithm has achieved
acceptable results compared with those achieved by wavelet transform.

Boundaries Object Detection for Skin Cancer Image using Gray-Level Co-Occurrence Matrix (GLCM) and features minutiae points

Hind Rostom Mohamed

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 7, Issue 1, Pages 160-172

In the present paper, Boundaries Object Detection for Skin Cancer Image using Connected
Components is proposed. We propose Connected Components algorithm which that capable of
Segment with Extraction of connected boundaries for Skin Cancer Image Segmentation . The
algorithm is proposed to create a color label image using the local features minutiae points in skin
cancer as objects image . The performance of object Detection with Connected Components which
are surround influence . The proposed scheme can serve as a low cost preprocessing step for high
level tasks such shape based recognition and image retrieval. The experimental results confirm the
effectiveness of the proposed algorithm.

Evaluation of Triple Integrals with Continuous Integrands Numerically by Using Method RM(RMM)

Safaa Mahdi Muosa AL-Gasas

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

The main aim of this paper is to evaluate triple integrals with continuous integrands
numerically by using extension resulting from best methods that find the approximate values of
single integral Romberg acceleration with Mid-point rule (RM) on the exterior dimension Z with
one of methods that find the approximate values for the double integral and it Romberg acceleration
with Mid-point rule on both dimensions of interior X and middle Y, (RMM) when the number of
divisions on the interior dimension is equal to the number divisions on the middle dimension , but
both is not equal to the number divisions on the exterior dimension and we shall call this method
by RM(RMM), where we got high accuracy in the results by few subintervals relatively and few
time.

Comparative Study the Effect of Similarity Measures on K-Means Algorithm in Clustering Arabic Texts based on Keywords

Suhad muhajer kareem

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

يعيمجت دع )ةدقنع( صوصنلا أ ىلإ صوصنلا عيمجت فدهي ثيح ، صوصنلا بيقنت يف ةلاعفلاو ةماهلا لئاسولا دح
اهنيب اميف هباشتت تانايك ىلع يوتحت )ديقانع(تاعمجت ىعدت ةريغص عيماجم ىلإ صوصنلل ةريبكلا عيماجملا ميسقت
وصنلا عيمجتل ةقيرط لمعلا اذه يف انمدق .ىرخلأا تاعمجتلا يف تانايكلا نع ةفلتخم نوكتو ىدحإ مادختساب ةيبرعلا ص
ةيمزراوخب ةلثمتملاو ةروهشملا عيمجتلا تاينقت k-means ىلإ هتئيهتل ةيلوأ ةوطخك صنلا ليلحت ةقيرطلا تنمضت .
ىلع تقبط يتلا ةدقنعلا ةيمزراوخ 011 ، مئارج ، نف ، ةضاير( تلمش ةفلتخم فانصأ عبرأب يبرع صن ةيبط ، )
ةدعاق دامتعاب ةقيرطلا انروط ثيح نم لادب عيمجتلا زكارم رايتخلا لاجم لكب ةصاخلا ةيحاتفملا تاملكلا نم تانايب
م( امه هباشتلل نيسايقم انمدختسا مث يئاوشع لكشب اهرايتخا سايقمو ةيديلقلاا ةفاسملا سايق بييجت ةيوازلا باسحل )
عيمجتلا زكرم نيب تافاسملا تلا سيياقم ريثات انميق . ديقانعلا ءانبل تادنتسملاو )ةيوازلا بييجت ،ةيديلقلاا ةفاسملا( هباش
ةيمزراوخ جئاتن ىلع k-means مييقتلا سايقم مادختساب F-Measure هيزاجنا نيب ةنراقم نع ةرابع جئاتنلا تناكو
لا هباشت سايقم مادختساب ةيمزراوخ ةيديلقلاا ةفاسملا سايقمو بييجت ةيوازلا تاعمجتلا ددع اهنم لماوعلا نم ددع ىلعو
ددعو فانصلأا . هيزاجنا ناب انضحلا اريخأو ةيمزراوخ k-means نم لضفا وه ةيوازلا بييجت سايقم مادختساب
مادختساب اهتيزاجنا .ةيديلقلاا ةفاسملا

Using Ant colony optimization for solving 0-1 Knapsack problem

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 7, Issue 1, Pages 55-68

The (0-1)Knapsack problem of the difficult problem which does not possess
the algorithm in parametric approximation as the complexity of this matter
belongs to the problems of the type (NP-hard), the research using the
algorithm of ant colony optimization (ACO) to solving the problem, and
also generate a set of problems to determine the efficiency of the algorithm
and compared with other methods of numerical results have proven the
efficiency of the algorithm in comparison with other methods and also the
time used to solving problem was standard compared to the other methods