An Approximate Solution of Non-Linear System of Volterra Integral Equation
Burhan
Al-Salehi
University of Kirkuk, Iraq
author
text
article
2008
eng
A Taylor series expansion is developed and applied to evaluate an approximate solution of the non-linear system of Volterra integral equation of the second kind for both Urysohn and Hammerstein types. The solution is based on substituting for the unknown function after differentiating both sides of the integral equation. Program associated with above methods is written in Matlab, finally, by using various examples, the accuracy of this method will be shown.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
11
19
https://csmj.mosuljournals.com/article_163945_e8a74c325cf51561447d9aa5d4dea4e6.pdf
dx.doi.org/10.33899/csmj.2008.163945
Maximal Generalization of Pure Ideals
Raida
Mahmood
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
author
Awreng
Mahmood
College of Computer science
and Mathematics,
University of Mosul
author
text
article
2008
eng
The purpose of this paper is to study the class of the rings for which every maximal right ideal is left GP-ideal. Such rings are called MGP-rings and give some of their basic properties as well as the relation between
MGP-rings, strongly regular ring, weakly regular ring and kasch ring.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
21
27
https://csmj.mosuljournals.com/article_163946_868e0624d09553d5eefe3288b14a68d8.pdf
dx.doi.org/10.33899/csmj.2008.163946
A New Numerical Procedure to Compute the Residues of a Complex Functions
Abbas
Al-Bayati
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
author
Sasan
Al-Shwani
College of Science
University of Kirkuk
author
text
article
2008
eng
In this paper, we are going to deal with computations of Residues and Poles for the complex functions . We are also going to investigate a new numerical procedure theoretically and its implementation numerically to compute the residue of complex analytic functions with high order poles. The paper needs the knowledge of computing the complex improper integrations.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
29
46
https://csmj.mosuljournals.com/article_163947_682d65be6a39149da44ab23020b08000.pdf
dx.doi.org/10.33899/csmj.2008.163947
On Centrally Prime and Centrally Semiprime Rings
Adil
Jabbar
Mathematics Department
College of Science
University of Sulaimani
author
Abdularahman
Majeed
Mathematics Department
College of Science
University of Baghdad
author
text
article
2008
eng
In this paper, centrally prime and centrally semiprime rings are defined and the relations between these two rings and prime (resp. semiprime) rings are studied.Among the results of the paper some conditions are given under which prime (resp. semiprime) rings become centrally prime (resp.centrally semiprime) as in:1-A nonzero prime (resp. semiprime) ring which has no proper zero divisors is centrally prime (resp.centrally semiprime).Also we gave some other conditions which make prime (resp. semiprime) rings and centrally prime (resp.centrally semiprime) rings equivalent, as in :2-A ring which satisfies the-for multiplicative systems is prime (resp. semiprime) if and only if it is centrally prime (resp.centrally semiprime).3-A ring with identity in which every nonzero element of its center is a unit is prime (resp. semiprime) if and only if it is centrally prime (resp.centrally semiprime).
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
47
56
https://csmj.mosuljournals.com/article_163948_b0980cd2bbe2c7669161c17155f0432c.pdf
dx.doi.org/10.33899/csmj.2008.163948
Application of Polyalphabetic Substitution Cipher using Genetic Algorithm
Ghusoon
Basheer
College of Computer sciences and Mathematics
University of Mosul, Iraq
author
text
article
2008
eng
Several Genetic Algorithms have been developed for applications of cryptography problem; the primary distinction among all of them being the G.A. used for decryption problem and obtains the plain text. In this paper a new approach is proposed using Genetic Algorithm with cryptography. G.A. is used to obtain a best secret key in polyalphabetic substitution cipher. This key will be used then for encryption and decryption with a high level of security. The program is written in Matlab language (6.5).
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
57
68
https://csmj.mosuljournals.com/article_163949_7f2f0a7fae04031cdc1da69b5d578a4f.pdf
dx.doi.org/10.33899/csmj.2008.163949
A New Family of Spectral CG-Algorithm
Abbas
Al-Bayati
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
author
Runak
Abdullah
College of Sciences University of Suleimani
author
text
article
2008
eng
A new family of CG –algorithms for large-scale unconstrained optimization is introduced in this paper using the spectral scaling for the search directions, which is a generalization of the spectral gradient method proposed by Raydan [14].
Two modifications of the method are presented, one using Barzilai line search, and the others take at each iteration (where is step- size). In both cases tested for the Wolfe conditions, eleven test problems with different dimensions are used to compare these algorithms against the well-known Fletcher –Revees CG-method, with obtaining a robust numerical results.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
69
80
https://csmj.mosuljournals.com/article_163950_10891c62d9b652a9d1b83eeede6f129d.pdf
dx.doi.org/10.33899/csmj.2008.163950
Limit Cycles of Lorenz System with Hopf Bifurcation
Azad
Amen
College of Basic Education
University of Salahaddin
author
Rizgar
Salih
College of science
University of Sulaimani
author
text
article
2008
eng
We prove that near the bifurcation point unstable limit cycle arises from the Lorenz system. In the analysis, we use the method of local bifurcation theory, especially the center manifold and the normal form theorem. A computer algebra system using Maple to derive all the formulas and verify the results presented in this paper.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
81
99
https://csmj.mosuljournals.com/article_163951_1d90dd7accb190de4aa5ef95b0d89f70.pdf
dx.doi.org/10.33899/csmj.2008.163951
Convergence Analysis of the Finite Difference Solution for the Nonlinear Klein-Gordon Equation
Ekhlass
Al-Rawi
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
author
text
article
2008
eng
This paper is devoted to drive the matrix algebraic equation for the one-dimensional nonlinear Klein-Gordon equation which is obtained from using the implicit finite difference method. The convergence analysis of the solution is discussed. Numerical computations are conducted and the solutions are stable and convergent when the sine function is used as an initial condition.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
101
113
https://csmj.mosuljournals.com/article_163952_6bbcc3b6ef3352d1c5195cee44c4046a.pdf
dx.doi.org/10.33899/csmj.2008.163952
Hosoya Polynomials of Steiner Distance of Complete m-partite Graphs and Straight Hexagonal Chains(*)
Ali
Ali
Academic Professor
University of Mosul, Mosul, Iraq
author
Herish
Abdullah
College of Sciences
University of Salahaddin
author
text
article
2008
eng
The Hosoya polynomials of Steiner distance of complete m-partite graphs and Straight hexagonal chains are obtained in this paper. The Steiner n-diameter and Wiener index of Steiner n-distance of and are also obtained.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
115
126
https://csmj.mosuljournals.com/article_163953_1effe09e94ac574e089722c6c11fc66e.pdf
dx.doi.org/10.33899/csmj.2008.163953
Stability Conditions of Zero Solution for Third Order Differential Equation in Critical Case
Thair
Thanoon
Department of Mathematics, College of Computer Sciences and Mathematics, University of Mosul, Mosul, Iraq
author
Saad
AL-Azzawi
Department of Mathematics,
College of Computer Sciences and Mathematics,
University of Mosul, Mosul, Iraq
author
text
article
2008
eng
In this paper, we study the conditions under which the zero solution is stable in the semi- liner case for certain third order differential equation of the form :
Where
, s = 1,2,3 , ,
,
The characteristic equation of the above differential equation has complex roots of the form :
and the other root has the following , . property
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
127
138
https://csmj.mosuljournals.com/article_163955_7918a18e4781a12be23543fe3df34a3c.pdf
dx.doi.org/10.33899/csmj.2008.163955
Priority Dispatching Rules for Virtual Manufacturing Using Genetic Algorithm
Akela
Al-Atroshi
Technical Institution
author
Abdulsatar
Khudur
Technical Institution
author
Sama
Azez Al-Aubaidy
College of Computer sciences and Mathematics
University of Mosul, Iraq
author
text
article
2008
eng
The current research concentrates on designing and applying an intelligent information system by the use of (Oracle) language based Multi- Agents manufacturing process to produce a new product. Every agent (user) has its own roles and privileges. The research focuses on determining the delivery date through using genetic algorithms to simulate Shop floor and specify priorities for dispatching orders according to specific rules which determine the lead time of the product. The importance of the research stems from designing software in c++ to simulate manufacturing processes in the genetic algorithm to realize the following :
Attain the best sequences in implementing jobs according to the required rules.
Decreasing the queuing time for products and their components in the production processes.
Perfect utilization of the available resources.
The results of the designed system application have revealed that the operations planning by the use of the GA philosophy will perform a great role in calculating the product's lead time at the manufacturing operations' stages. This role supports the VM philosophy in calculating the industrial part of the products lead time quickly. Also the application results have confirmed that the designed GA software efficiency depends upon the number of jobs available at the time of execution; whenever the number of jobs is bigger, the software execution efficiency is better.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
139
164
https://csmj.mosuljournals.com/article_163956_98eee7b962a303b7d957930a711955ca.pdf
dx.doi.org/10.33899/csmj.2008.163956
Nonstandard Treatment of Two Dimensional Taylor Series with Reminder Formulas
Ibrahim
Hamad
College of Science
University of Salahaddin
author
text
article
2008
eng
The aim of this paper is to establish some new two dimensional Taylor series formulas using some concepts of nonstandard analysis given by Robinson and axiomatized by Nelson
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
165
176
https://csmj.mosuljournals.com/article_163957_3e2166cfceb9d5608d1098f90cd92e41.pdf
dx.doi.org/10.33899/csmj.2008.163957
Numerical Solution for Linear Parabolic Reaction-Double Diffusivity System using the Operational Matrices of the Haar Wavelets Method
Ahmed
Qasem
College of Computer sciences and Mathematics
University of Mosul, Iraq
author
text
article
2008
eng
We are using the operational matrices of the Haar wavelets method for solving linear parabolic reaction-diffusion system with double diffusivity. A numerical method based on the Haar wavelets approach which has the property , we compared this result with the exact solution for reaction-diffusion system, we found that high accuracy of the results in this method in the solution double diffusivity system even in the case of a small number of grid points is used. However, the computation is simple because consists of the matrices which can be programmed by Matlab language, thes matrices which we got of the numerical solution are representing all time steps while the finite difference method and finite elements method need the iteration to get the needed time step, they are complicated and time-consuming.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
177
195
https://csmj.mosuljournals.com/article_163958_2200e793cbd9d3368f05f675e6747845.pdf
dx.doi.org/10.33899/csmj.2008.163958
w-Wiener Polynomials of the Width Distance of the Square of a Path and a Cycle and a m-Cubic
Ali
Ali
College of Computer Science and Mathematics
University of Mosul, Iraq
author
Asma
Aziz
College of Computer Science and Mathematics
University of Mosul, Iraq
author
text
article
2008
eng
Let G be a k0-connected graph ,and let , ,be the w- width distance between the two vertices u,v in G. The w-Wiener polynomial of the width distance of G is defined by:
The w-Wiener polynomials of the square of a path , the square of a cycle ,and of an m-cube are obtained in this paper . The diameter with respect to the width distance –w ,and the Wiener index for each such graphs are also obtained .
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
11
32
https://csmj.mosuljournals.com/article_163959_3c24eef36f713a99d020bd3ff5dbf108.pdf
dx.doi.org/10.33899/csmj.2008.163959
Vertical Flow in Viscous Thin Films
Khidr
Khidr
College of Computer Science and Mathematics
University of Mosul, Iraq
author
Hikmat
Mustafa
College of Education
University of Mosul, Iraq
author
text
article
2008
eng
The aim of this paper is to investigate the vertical flow in thin films of an incompressible liquids with no inertia force. Continuity equation and Navier-Stokes equations are used to obtain the equation that governs this type of flow, this equation is solved by using numerical methods to find the thickness of film.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
33
41
https://csmj.mosuljournals.com/article_163960_440da2055201496681fce685580ef57d.pdf
dx.doi.org/10.33899/csmj.2008.163960
Hybrid Algorithm for Image Denoising
Hanan
Ali
College of Computer Science and Mathematics
University of Mosul, Mosul, Iraq
author
text
article
2008
eng
The development in life has made the need for using images very important in many fields like space, engineering and medicine. Due to the fact that such images are affected by various noises from different resources they require some kind of filtering. The new algorithm applied in this research is obtained from merging two available methods. The first method adopts the conservative smoothing filter while the second one uses the median filter. The result of each method is compared with the new result outcome from the application of the new hybrid algorithm.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
43
60
https://csmj.mosuljournals.com/article_163961_68a6057f21d837dc4e973fd227a5f9c4.pdf
dx.doi.org/10.33899/csmj.2008.163961
Reduction of the Accompanying Noise when Hidding in an Audio File
Radwan
Al-Jawadi
Technical College
Foundation of Technical Education/Mosul/Iraq
author
Adel
Issa
Technical College
Foundation of Technical Education/Mosul/Iraq
author
text
article
2008
eng
The stereography which used to hide certain information using a host file is a science and an art. Such practice is usually done to keep away any thought in the presence of a hidden message in the host. Hiding is often done using sound, image or video files. The problem is that such hiding may cause some detectable changes in the host file .This study focuses on hiding in WAVE type sound file. Sound files are either one-byte sample or two- byte sample .The hiding idea involves the replacement of the original data by another data from a text file. The first four bits from each byte are used in wave file as a hiding domain.
Accordingly, a hiding system was designed for the reduction of the accompanying noise. In this research, it was depended on the human herring for group of people to calculate the reduction in the noise of the host file .It was also shown that hiding in 8-bit sample (1 byte) results in a clearly detectable noise. This jumping 10 bytes in each replacement process led to eliminate the noise .It was also concluded, that when using first and second bit from each byte the noise was completely eliminated by jumping 30 byte. On the other hand, hiding in 16-bit sample (2byte) has led to complete disappearance of the noise when jumping 10 byte at each data replacement process.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
61
79
https://csmj.mosuljournals.com/article_163962_9a11554d5d9b735fc882b2d938af64e6.pdf
dx.doi.org/10.33899/csmj.2008.163962
Numerical Solution to the Fluid Flow in a Bend Duct Equation
Badran
Salem
College of Basic Education
University of Mosul, Iraq
author
text
article
2008
eng
The Fluid Flow in a bend Duct equation had been solved numerically by using two methods. The first is ADE (Alternating Direction Explicit) method and the second is ADI (Alternating Direction Implicit) method. A comparison had been made between these two methods with the exact solution, and we find that the ADI method is the best and most accurate than the ADE method, the numerical solution is alternant and identical. This means that the solution is itself in every period. Therefore, we need lesser accounts and then to a short time.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
81
94
https://csmj.mosuljournals.com/article_163963_252da77cc8504c20cd96b1153e0e9cb3.pdf
dx.doi.org/10.33899/csmj.2008.163963
Comparison on Color Quantization Techniques
Alyaa
taqi
college of computer sciences and mathmatics/university of mosul
author
text
article
2008
eng
Due to the fast and high development in computer technology and the reflection of this development on digital images ,many image processing algorithms became in need to initialization steps for the image before starting the actual operations of the algorithms and the program. Image quantization is one of the important operations in image processing field and it is the first step in many digital image applications.
This technique is based on taking the best colors from the original image and produce a new image with a new quality with less colors and with small error ratio. There are many image quantization methods ,but this research focuses on studying three different methods of image quantization and compares them. These methods are:
Quantization by mask
Uniform Quantization
Half toning Quantization
After programming the methods we could reach a high degree of clarity in image after reducing its color. The research was applied on different types of images to find the best method for each image with small error ratio and that depends on the contents and on color distributions in the image .(Matlab7) was used for programming these methods.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
95
115
https://csmj.mosuljournals.com/article_163965_74c156d70b8e7d08254a3eaed217f8eb.pdf
dx.doi.org/10.33899/csmj.2008.163965
Using the Genetic Algorithm in Images Matching
Nidal
Al-Asadi
College of Computer Science and Mathematics
University of Mosul, Iraq
author
Ghosson
Bashir
College of Computer Science and Mathematics
University of Mosul, Iraq
author
text
article
2008
eng
The proposes of the present work is to suggest the use of a purely Genetic Algorithm(GA) as a search technique for the global optimum estimates of the transformation parameters. Because Genetic Algorithms search optimal solutions from the entire solution space, they often can obtain reasonable solutions in all situations. The program is written in Matlab language.
AL-Rafidain Journal of Computer Sciences and Mathematics
Mosul University
1815-4816
5
v.
1
no.
2008
117
128
https://csmj.mosuljournals.com/article_163966_bdc4e88cda37c9250235a6724a15ad64.pdf
dx.doi.org/10.33899/csmj.2008.163966