Volume 3, Issue 1, Spring 2011, Page 1-16


MODIFIED MID-POINTMETHOD METHOD FOR SOLVING LINEAR FREDHOLM INTEGRAL EQUATIONS OF THE SECOND KIND

Salam J. Majeed; Huda H. Omran; Ahlam J. Kaleel

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

In this paper we use the Modified mid-pointmethod for solving the linear Fredholm integral equations of the second kind. In numerical examples we showed the effectiveness of this method, in comparison with other numerical methods such as, midpoint, trapezoidal, Simpson’s and Modified trapezoidal methods

All the Public Services by a Single Point in Electronic GovernmentGovernment Portal in Iraq

Husam Abraheim Al-saadi; Hayder H. safi Al-jebory

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 3, Issue 1, Pages 1-13

E-government reflects the ultimate visions for public administration to undergo a huge modernization and re-organization .the project that aims at developing an integrated platform for realizing online one-stop Government ,a global access point to enter different governmental services and information at distinct levels of public administration and with different devices ,the development of one-stop government process models implemented in local service repositories and a governmental markup language as an open standard for data exchange and communication within the platform

Feebly Generalized Closed Mappings

Dalal Ibraheem Resan

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

The main purpose of this paper is to study feebly generalized closed mappings , we proved several results about that by using some concepts of topological as fg-closed sets,gf-closed sets, feebly closed sets , feebly open sets , g-closed sets, feebly regular and feebly normal .

Wavelet Transformation For Scanned Image Enhancement

Hedhab Khalid Al- Jobory

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

After scanning, a document is typically blurred, and some noise is introduced. Therefore, the enhancement process of a scanned document requires a denoising and deblurring step. Typically, these steps are performed using techniques originated in the wavelet-domain processing. Wavelet enable us to represent signals with high degree of sparsely. This is the principle behind a non- liner wavelet based signal estimation technique known as wavelet denoising. One main reason for the success of wavelet is that wavelets adapt automatically to smooth and non-smooth parts in an image due to the link between wavelets and sophisticated smoothness spaces.

On Solution Of Cylindrical Equation By New Assumption

Nada Zuhier Abd Al-sada; Nada Zuhier Abd Al-sada

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

This research presents the use of a new extension assumption for finding the complete (c.s) and general(g.s) solution of partial differential equation which have the general form

where arbitrary constant and is function of .

Using Perceptron Neural Network and Genetic Algorithm for Image Compression and Decompression

Dalya Abdullah Anwar; Mohammed Mustafa Siddeq

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

This paper introduces an idea for image compression by using Genetic Algorithm and Arithmetic Coding. First stage is by using perceptron neural network to compress each three-pixels into single value, this value is called Compression value. In this paper the neural network did not need weights for training at compression part, the weights used in this paper are of one dimensional array containing floating point values. The total of weights values equal one. In the decompression part we use Genetic Algorithm for return the pixels, by using Crossover operation and the Fitness Value. The fitness value represented the error between Compression value and Desired output for each generated string by GA to get approximately original three-pixels. The second stage is Arithmetic coding algorithm uses to convert vector of compression values into a single floating point number. Our approach tested with color image, also in this paper the performance of the algorithm is computed and compared wit PNG and TIFF algorithm.

ON JACKSON'S THEOREM

Eman Samir Abed-Ali

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 3, Issue 1, Pages 1-5

We prove that for a function and n,r in N , we have

where the roots of Legendre polynomial, and , is the Ditzian-Totik mth modulus of smoothness of g in .

Wireless Telecommunications uprising though 4G Long Term Evolution (LTE)

Ali Abdul Hussien Abdul Wahed

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 3, Issue 1, Pages 1-13

Due to the high importance of the scientific research in Iraq and its subject’s modernity which must involve the newest technologies in the research process, this research presenting the Long Term Evolution (LTE) which is the latest and most up-to-date wireless technology from the fourth wireless telecommunications generation (4G) in wide world. The major advantage of this technology is providing in one hand a very secure, reliable and competitive/cheap telecommunications prices with many multi-media features and variant services to the end user and in other hand less establishing cost for the operator and wider coverage. In order to demonstrate LTE standers key features; an overview of telecommunications generations evolution along the last decade will presented with definition for 4G aspects in addition to list its most important goal and its performance target, then the light will be spotted on the LTE technical specifications and their advantages.

The Sufficient and Necessary Conditions on Group G So that U is Locally Finite and Finitely Generated

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

Let G be a group and A be a ring . Let U be the units group in the group ring A[G]. Many recent studies in algebra deal with the structure of the group U knowing the structure of the group G and vice versa. In this paper we tried to prove the following problems :
1. What are the necessary and sufficient conditions on G so that U is locally finite?
2. What are the necessary and sufficient conditions on G so that U is finitely generated ?

Build a Spam Filter at the E-mail on the Server Side

Ahmed Abdulrudah abbas

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 3, Issue 1, Pages 1-104

The spam has now become a significant security issue and a massive drain on financial resources. In this paper, We present a spam filter, which works at the server level. The proposed filter is a combination of antispam solution. The task of proposed filter is to minimize the ability of the spammers to distract the network by the spams. That is done by blocking the spam message at the server level. A server based solution is normally more advantageous than protecting e-mail users individually. Such a solution gives more control to administrators

Regular Proper Mappings

Habeeb Kareem Abdullah

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

The main goal of this work is to create a general type of proper mappings namely, regular proper mappings and we introduce the definition of a new type of compact and coercive mappings and give some properties and some equivalent statements of these concepts as well as explain the relationship among them

Strongly Regular Proper Mappings

Habeeb Kareem Abdullah; Fadhila Kadhum Radhy

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 3, Issue 1, Pages 1-20

The main goal of this work is to create a special type of proper mappings namely, strongly regular proper mappings and we introduce the definition of a new type of compact and coercive mappings and give some properties and some equivalent statements of these concepts , as well as explain the relationship among them .

Using Perceptron Neural Network and Genetic Algorithm for Image Compression and Decompression

Mohammed Mustafa Siddeq; Dalya Abdullah Anwar

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

This paper introduces an idea for image compression by using Genetic Algorithm and Arithmetic Coding. First stage is by using perceptron neural network to compress each three-pixels into single value, this value is called Compression value. In this paper the neural network did not need weights for training at compression part, the weights used in this paper are of one dimensional array containing floating point values. The total of weights values equal one. In the decompression part we use Genetic Algorithm for return the pixels, by using Crossover operation and the Fitness Value. The fitness value represented the error between Compression value and Desired output for each generated string by GA to get approximately original three-pixels. The second stage is Arithmetic coding algorithm uses to convert vector of compression values into a single floating point number. Our approach tested with color image, also in this paper the performance of the algorithm is computed and compared wit PNG and TIFF algorithm.

Solvability of Linear Perturbed Sylvester Dynamical System in Infinite Dimensional Space Using Perturbed Composite Semigroup Approach

Radhi Ali .Zboon; Jehad Ramadhan.Kider; Samir Kasim .Hassan

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 3, Issue 1, Pages 1-20

The perturbed linear dynamical system of Sylvester type in infinite dimensional space has been considered . The solvability of this class of equations by using the perturbed composite semigroup of bounded linear operator is presented and developed . The necessary dynamical properties have also been presented and proved.

Enhancement an Algorithm to Hide a Text into a Digital Image as a Steganography Technique

Salman Abd Kadum; Tameem Hameed Abaidah

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

In this paper we enhance an algorithm to hide a text into a digital image as steganography technique. This algorithm consists of two major parts, the first, is procedure to hide a text into a digital image, and the second, is procedure to get a hide text from it, further than this algorithm consists of many parts or procedures to enhance this algorithm to complete this process. We use the Least Significant Bit method to hide the message or text, in order to keep the features and characteristics of the original image. By experiment and implement of this algorithm by visual basic 6.0, the algorithm seems work in a butter case by hiding and getting text from a digital image which is used as a carrier of this text, it means that we use two stages in this paper to accomplish it: 1) detecting that steganography has been used, and then 2) by reading the embedded message.

Approximation of Scale Parameter of Inverted Gamma Distribution by TOM Modified

Jubran Abdul Ameer Kuttar

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

The purpose of this research is to find an approximation to the scale parameter of inverted gamma distribution, where other parameter (shape parameter) is known, and compare it with several methods, where we found the preference of TOM by using Mean Square Error (MSE) to specify the best approximate to scale parameter in different samples size.

compactness on bitopological spaces

Rasha Naser Majeed

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

In this paper we define a new kind of open sets in bitopological space which we called semi open sets, which we lead to define a new type of compactness on bitopological spaces called " compactness" and we study the properties of this spaces, also we define the continuous functions between these spaces.

IMAGE COMPRESSION BY USING ENHANCED FRACTAL METHODS

Zena Hussain Khalil; Tawfiq A. Al-Assadi

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

Fractal image compression give some advantage in compression ratio, resolution independence and fast decompression but it still suffer from encoding time, In this paper an enhanced to traditional algorithm based on using zero-mean method is applied, where a mean of range block is used instead of offset parameter which simplify and speeding up encoding time, also a domain pool is reduction by filtration a domain pool from those block with high entropy value. In addition to discard domain blocks which have some distance ratio from matching process ,An another speeding up technique where proposed in this paper based on suggest simple symmetry predictor to reduce isometric trails from 8 to 1 trail. In this project the RGB image is transformed to YIQ color space and then the I&Q band have been down sampled in order to get effective compression, after that the encoding algorithm is applied separately on each band.

On Some Relationships Between Spectral Sequences And The New Exact Sequences

Dheia Gaze Salih Al-Khafajy

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

In this paper I introduce and study relationships between spectral
sequences and the new exact sequences . I will show that the new exact sequence is the second derived exact couple .
Let




be an exact couple , we derive to get the second exact couple which is the new exact sequence . the process of derivation can
be iterated indefinitely, yielding an infinite sequence of exact couples .
I establish some results ,for examples ;
The class of all exact couples and morphisms between these couples formed a category . There is a functor from the category of into .
If
.
If be any , then
, and .

On Smarandache M-Semigroup

Hassan Rashed Yassein; Mazen Omran Karim

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

In this research, we defined the term a smarandache M – semigroup (S-M-semigroup) and studied some basic properties.
Also defined smarandache fuzzy M-semigroup and some elementary properties about this concepts are discussed .

Adomian Decomposition Method with different polynomials for nonlinear Klein Gordon equation and a system of nonlinear partial differential equations

Mohanad Riyadh Saad

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

In this paper the Adomian Decomposition Method (ADM) with modified polynomial [1] is applied for nonlinear models, first we apply it for solving nonlinear partial differential equation (Klein Gordon equation with a quadratic non-linear term), then we discussed the solution of system of nonlinear partial differential equations with this modification. The numerical results obtained by this polynomial have been compared with numerical results in [2] and [3] to show the efficiency in applications.

Right Closed Multiplication sets in Prime Near-Ring -Derivation

G. H. Mousa and; Ameer Mohammad Husain

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

In this paper , we extended the concept given in [1] which they used a semi group ideal to get the result has been given in [2] . We introduce a new body which is call it a right closed multiplicative set with zero . This structure give use similar results , and any semi group ideal satisfy the conditions of right closed multiplicative set . We prove that for any prime near-ring and a multiplicative set , if , is abelian , then is abelian . These results depends on many papers for example [3] , [4] , [5] , [6] , [7] , [8] .

ON JORDAN*- CENTRALIZERS ON GAMMA RINGS WITH INVOLUTION

Rajaa C .Shaheen

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

Let M be a 2-torsion free -ring with involution satisfies the condition x y z=x y z for all x,y,z M and , .an additive mapping *: M→Mis called Involution if and only if (a b)*=b* a*and (a*)*=a . In section one of this paper ,we prove if M be a completely prime -ring and T:M→M an additive mapping such that T(a a)=T(a) a* (resp., T(a a)=a* T(a ))holds for all a M, .Then T is an anti- left *centralizer or M is commutative (res.,an anti- right* centralizer or M is commutative) and so every Jordan* centralizer on completely prime -ring M is an anti- *centralizer or M is commutative. In section two we prove that every Jordan* left centralizer (resp., every Jordan* right centralizer) on -ring has a commutator right non-zero divisor(resp., on -ring has a commutator left non-zero divisor)is an anti- left *centralizer(resp., is an anti- right *centralizer) and so we prove that every Jordan* centralizer on -ring has a commutator non –zero divisor is an anti-* centralizer .

Advanced Steganography Method for Digital Images Using Eight-sided Side Match

Salah Mahdi Saleh

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

In this paper, we present an advanced steganography method by using the side information of the eight neighboring pixels. It aims to provide a secure steganography system and to minimize the distortion of the stego-image. The method exploits the correlation between neighboring pixels to estimate the degree of smoothness or contrast of pixels to determine the amount of payload in each embedding position. If the pixel is located in edge area, then it tolerates larger changes than those in smooth areas. The eight-sided side match method is used in our scheme. It attempts to share all the surrounded pixels in determining the capacity of each embedding position. The experimental results show that our method provides a high quality image without making noticeable distortion. Another important thing in our advanced method is that the embedded data can be extracted from the stego-image without referencing the original image. This means that the stego-image will depend on itself in extracting embedded information without using any external factor or key.

Approximation of Scale Parameter of Inverted Gamma Distribution by TOM Modified

Jubran Abdul Ameer Kuttar

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

The purpose of this research is to find an approximation to the scale parameter of inverted gamma distribution, where other parameter (shape parameter) is known, and compare it with several methods, where we found the preference of TOM by using Mean Square Error (MSE) to specify the best approximate to scale parameter in different samples size.