Issue 1


On Self-Scaling Variable-Metric Algorithms

Abbas Y. Al-Bayati; Mardin Sh. Taher

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 11-18
DOI: 10.33899/csmj.2007.163992

In this paper, we have developed a new self-scaling VM-method for solving unconstrained nonlinear optimization problems. The numerical and theoretical results demonstrate the general effectiveness of the new self-scaling VM-method when compared with  PHUA  &  ZENG  algorithm ; we have tested these algorithms on several high-dimension test functions with promising numerical results.
 

Stability Study of Stationary Solutions of the Viscous Burgers Equation

Mohammad Sabawi

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 19-40
DOI: 10.33899/csmj.2007.163993

Stability study of stationary solutions of the viscous Burgers equation using Fourier mode stability analysis for the stationary solutions , where  is constant and , in two cases is analyzed. Firstly when the wave amplitude  is constant and secondly when the wave amplitude  is variable. In the case of constant amplitude, the results found to be: The solution  is always stable while the solution  is conditionally stable. In the case of variable amplitude, it has been found that the solutions  and  are conditionally stable.
 

On α-strongly θ-continuity, αθ-openness and (α, θ)-closed graphs in Topological Spaces

Abdullah M. Abdul-Jabbar

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 41-56
DOI: 10.33899/csmj.2007.163994

Chae  et. al. (1995) have studied the concept of  a-strongly q-continuous functions and (a, q)-closed graph. The aim of this paper is to investigate several new characterizations and properties of  a-strongly q-continuous functions and   (a, q)-closed graph. Also, we define a new type of functions called  aq-open functions, which is stronger than quasi a-open and hence strongly  a-open, and  we obtain some characterizations and properties for  it. It is shown that the graph of f, G ( f ) is (a, q)-closed graph if and only if for each filter base Y in X   q-converging to some p in X such that f (Y)  a-converges to some q in Y holds,  f ( p) = q.
 

On Rings whose Maximal Essential Ideals are Pure

Raida D. Mahmood; Awreng B. Mahmood

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 57-62
DOI: 10.33899/csmj.2007.163995

This paper introduces the notion of a right MEP-ring (a ring in which every maximal essential right ideal is left pure) with some of their basic properties; we also give necessary and sufficient conditions for MEP – rings to be strongly regular rings and weakly regular rings.
           

On the Wiener Polynomials of Some Trees

Ali Aziz Ali; Ahmed M. Ali

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 69-83
DOI: 10.33899/csmj.2007.163997

The Wiener index is a graphical invariant which has found many applications in chemistry. The Wiener Polynomial of a connected graph G is the generating function of the sequence (C(G,k)) whose derivative at x=1 is the Wiener index W(G) of G, in which C(G,k) is the number of pairs of vertices distance k apart. The Wiener Polynomials of star-like trees and other special trees are found in this paper; and hence a formula of the Wiener index for each such trees is obtained . 
 

Connectable Internet Address Object Point using the Active Accessibility

Mohammed Zaki Hasan; Manar Y. Ahmed

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 85-94
DOI: 10.33899/csmj.2007.163998

This paper focuses on how building application components using Visual Basics that are accessible to people or computer users from client with disabilities. The main purpose of it is to perform a job by the server that can't be used by some with a disability essentially denies that otherwise qualified person job. An application was designed through connection point by the COM+ programming. The application performs a security for both the client and server computers and have the ability of disable option to prevent the user from making trouble in the computer.
 

The Prime Spectra of Regular Rings

Nazar H. Shuker; Abdul Aali J. Mohammad; Huda Y. Khalil

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 95-106
DOI: 10.33899/csmj.2007.163999

In this work, we study the prime spectrum of regular rings. Also we study some topological concepts as quasi-compact, compact, totally disconnected, and irreducible topological space in order to prove some new results on the prime spectrum of regular ring.
 

Using Mask Technique and Center Detection for Congenital Dislocation of the Hip (CDH) Diagnosis

Nidal H. AL-Assady; Mafaz Mohsin Khalil Alanezi; Shahla H. Ahmad

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 107-122
DOI: 10.33899/csmj.2007.164000

The aim of this study, is the diagnosis of Congenital Dislocation of the Hip (CDH) from routine X-Ray Image by measuring the retardation of the growth center of the head of femur bone in the abnormal joint in comparison with the normal side in cases of unilateral CDH using  Mask Technique and algorithm of Center Detection and measurement. What is new about this study in comparison with the previous methods about diagnosis of CDH (which used artificial technique images matching subject to detect the diseased image only by compare the diseased images with normal image without giving any percent of disease) can be summarized by:
1.Going into the details of the X-Ray and cutting out the necessary parts ( head of femur ) for both the diseased and normal sides in cases of unilateral CDH, to make comparison between them instead of using the complete image.
2.Using Mask Technique and algorithm of Center Detection to extract the features (Center, Intensity value of the center, and Diameter ) from the two captured images. Then we do a comparison for both sides for these features using Euclidean Distance to know the diseased side from the normal one.
We applied this system in computer using Matlab 7.0 programming Langue.
 

Enriched Algorithms for Large Scale Unconstrained Optimization

Abbas Y. Al-Bayati; Omar B. Mohammad

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 11-37
DOI: 10.33899/csmj.2007.164001

A new method for solving Large-Scale problems in the unconstrained optimization has been proposed in this research depending on the BFGS method.
The limited memory is used in the BFGS method by multiplying the BFGS matrix by a vector to obtain vectors instead of matrices and only two vectors can be stored, by modifying the algorithm given by Nocedal J (1999).
The purpose of this algorithm is to enable us to solving the Large-Scale Problems, as it is obvious to everyone that the computer can store millions of vectors, whereas its ability in storing matrices is limited.
The present method in this research is applied on seven nonlinear functions in order to evaluate the method efficiency in the numbers of iterations (NOI), number of functions (NOF) and function value and comparing it with the standard BFGS method after updating.
This method has been applied on functions with variables till 1000000 and more than that.
From comparing the results, we fined that this algorithm
was the best.
 

Numerical Solution and Stability Analysis of the Sine-Gordon Equation

Saad Abdullah Manna; Norjan Hasan Juma

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 39-56
DOI: 10.33899/csmj.2007.164002

The Sine – Gordon equation has been solved numerically by using two finite differences methods: The first is the explicit scheme and the second is the Crank – Nicholson scheme. A comparison between the two schemes has been made and the results were found to be : the first scheme is simpler and has faster convergence while the second scheme is more accurate . Also , the stability analysis of the two methods by the use of Fourier (Von Neumann) method has been done and the results were found to be : The explicit scheme is conditionally stable if  and the Crank–Nicholson is unconditionally stable .
 

Speech Files Compression Based on Signal Feature

Khalil Alsaif; Saja J. Mohammed

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 57-79
DOI: 10.33899/csmj.2007.164003

In this research a new algorithm was suggested for compressing speech files added a new style for storing signals, The suggested idea of compression begins with recording the speech via the microphone, then starting the proposed processing steps as follows :

Removing silent period.
Select the number of resulted signal samples.
Segmenting the resulting signal to number of frames.
Applying one of the curves fitting algorithms and obtaining the coefficients for the mathematical representation.
Storing the results in a new file format with .ssc (Speech Signal Compression) extension.

While the decompression process consisted of the reversal compression process steps, the signal is reconstructed using curve fitting coefficients which were stored in the new file, followed by returning the selected sample, then returning the silent period to their original location and finally listening to the retrieved speech signal. When the proposed algorithm had been applied on the files with different speech contents, the compression ratio was approximately (16.283%), and the ratio of SEGSNR was approximately (25.195dB).
 

Using genetic Algorithm in Task scheduling for Multiprocessing System

Asmaa Yaseen Hammo; Ghosun S. Basheer; Muna M.T. Jawhar

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 81-98
DOI: 10.33899/csmj.2007.164004

In this work we use Genetic Algorithm for best section to implement many independent tasks on multiprocessor systems. The chromosome represented by numbers of integer value, every value represents one of the processors in the system, we use the simple crossover to generate the next population, and we us the mutation of type  partial gen for mutation  which has a good role to improve results of scheduling, the program written by matlab (6.5).The results, after a small number of iterations, were very good .
 

Examination Committee Work Management System

Abdul Aziz Suleiman; Turfa Y. Hamed; Nadia T. Saleh

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 99-118
DOI: 10.33899/csmj.2007.164005

The aim of this paper is to design a software for examination committee work management using Visual FoxPro programming language, which is considered as one of the most popular and useful visual programming languages that supports Database Management System (DBMS).
            This software is designed to facilitate the management of examination committee work to assist the documentation for the important data like card files and records and to retrieve examination information.
            The software has the ability to display the students’ marks after data insertion. These data are gained from Microsoft Excel tables. In addition, the software could compute the annual total marks, the final marks, the average, and the estimation. Besides it could search the database for a specified student name. The students’ marks, the final results, and the sequence and estimation for passed students could be organized as a printing material. Also the software gives printed reports for first semester, midyear, second semester, and annual total marks, for all studied subjects of a specified stage and according to that stage classes. In addition to the capability of statistical computing for the pass ratio, total number of students and the number of passed students according to the stage, with printed capabilities.
 

Numerical Analysis of the Burger Equation using Finite Differences

Saad A. Manna; Badran J. Salem

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 119-132
DOI: 10.33899/csmj.2007.164006

The Burger equation had been solved numerically by using two finite differences methods. The first is explicit scheme method and the second is Crank–Nicholson method. A comparison had been made between the two and we find that the Crank–Nicholson method is the best and most accurate than the explicit scheme method, as it is shown in (Table 1). Also the numerical stability for both methods has been made, the explicit scheme method is conditionally stable and the condition is , while Crank–Nicholson method is unconditionally stable.
 

Using Computer in Primary Education

Shaima M. Al-Mashhadani

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 133-147
DOI: 10.33899/csmj.2007.164007

This research develops a new program to teach (reading, mathematics, and sciences for the first primary class in Iraq and with simple and interactive techniques where the computer is considered as one of the most popular electronics innovations that convey humanity into vast fields.
Accordingly, numerous life fields have been affected with the revolutionary effectiveness related to it, and hence, it becomes a significant device, which cannot be neglected at all.
     Having a quick look at the computer and its educational utilizations, one could recognize that theComputer Assisted learning system is nowadays the most common educational contribution in the learning process.
 

Flow in Inclined Thin Liquid Films with no Inertia Force

Joseph Gh. Abdel-Ahd; Hikmat Mustafa; Khidr M.S. Khidr

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 149-159
DOI: 10.33899/csmj.2007.164008

In this paper we have investigated viscous flow in symmetric thin liquid films which are inclined by an inclination angle  to the horizontal for an incompressible liquids in two dimensions with no inertia force. We use the (Navier-Stocks) equations and we obtain equations that govern such flow and we solved these equations by numerical methods to obtain the thickness of the film.
 

Steganographic Algorithm in Spatial Domain

Dujan B. Taha; Ghada Mohammad Tahir Qasim

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 160-176
DOI: 10.33899/csmj.2007.164009

This research deals with design and implementation of a new steganographic algorithm to hide secret messages inside digital images. To achieve security to the transmitted messages, a secret key is used to prevent unauthorized persons from extracting these messages.
Embedding has been achieved using grey and color images as a cover. Matlab is used to implement the algorithm due to the facilities it provides for dealing with digital images and matrices as well as GUI.
Finally, experimental results demonstrate the effieciency of the algorithm in hiding information in imperceptible manner.
 

Using Digital Image Processing for Studying Hydrological Behavior of Tigirs River at Mosul City

Muhammad F. Omar; Khattab Faten A. Mustafa

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 177-192
DOI: 10.33899/csmj.2007.164010

Recently, the applications of the remote sensing increased in hydrology studies and waters management especially that concerned with rivers basins. This research includes using digital image processing applications on Mosul images for studying hydrological behavior of Tigirs river at mosul city. By the application of a set of operations that belong to digital    image process, which include preprocessing and enhancement images.
The result of these applications showed a perfect image covering all river  in the study area, with high contrast ratio equal (2.455) and with a small error equals (0.099). as well as getting four segments for Tigers river which represent the changes in the state and capacity of the river. 
 

Development Hyper Algorithm for Encryption Arabic Text using Mors Code

Najla Dabagh; Melad jader saeed; Subhi Hamadi

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 193-209
DOI: 10.33899/csmj.2007.164011

Morse code is considered as one of the codes that are used to transfer information among long distant areas.
            The research concentrates on Morse code applications, transmissions to overcome  weakpoints, a necessary mixture between coding and cryptography to get benefits from the properties of each one of them to increase the secrecy of morse code  transmission.
            Anew algorithm was put in use for encryption and decryption which passes through multistage process, each stage has special properties that make the transmission more confident and safer than the stage before.
            In addition to the ability of using password as a key, which is at the same time passed through the same encryption processes which make it hard to break.
            This work is applied on integrated programming environoment which is (MATHCAD).