ISSN: 1815-4816

Volume 10, Issue 2

Volume 10, Issue 2, Spring 2013, Page 13-257


A Modified Augmented Lagrange Multiplier Method for Non-Linear Programming

Abbas Y. Al-Bayati; Eman T. Hamed

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 13-25
DOI: 10.33899/csmj.2013.163471

In this paper, we have investigated a new algorithm which employs an  Augmented Lagrangian Method (ALM). It overcomes many of the difficulties associated with the Penalty function method.  The new incorporate algorithm has been proved very effective with an efficient  convergence criterion.
 

On Completely YJ-injective Rings

Raida D. Mahammod; Husam Q. Mohammad

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 27-32
DOI: 10.33899/csmj.2013.163472

A ring R is called completely right YJ-injective (briefly, right CYJ injective ) if every homomorphic image of R is right YJ-injective. In this paper, we study completely right YJ-injective rings and their connection with Von Neumann regular rings. In addition, we also study regularity of rings whose ring homomorphic images are right YJ-injective as right R-modules
 

New Conjugacy Coefficient for Conjugate Gradient Method for Unconstrained Optimization

Hamsa TH. Chilmeran; Huda Y. Najm

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 33-46
DOI: 10.33899/csmj.2013.163473

In this paper, we derived a new conjugacy coefficient of conjugate gradient method which is based on non-linear function using inexact line searches. This method satisfied sufficient descent condition and the converges globally is provided. The numerical results indicate that the new approach yields very effective depending on number of iterations and number of functions evaluation .
 

The n-Hosoya Polynomials of the Composite of Some Special Graphs

Ahmed M. Ali

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 47-62
DOI: 10.33899/csmj.2013.163474

It is not easy to find the n-Hosoya polynomial of the compound graphs constructed in the form G1⊠G2 for any two disjoint connected graphs  and .Therefore, in this paper, we obtain n-Hosoya polynomial of G1⊠G2 when  is a complete graph and  is a special graph such as a complete graph, a bipartite complete, a wheel, or a cycle. The n-Wiener index of each such composite graph is also obtained in this paper.
 

A Series of Saddle - Node Bifurcation and Chaotic Behavior of a Family of a Semi - Triangular Maps

Salma M. Faris; Ammar A.M. Jameel

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 63-77
DOI: 10.33899/csmj.2013.163475

This paper studies the bifurcations in dynamics of a family of semi-triangular maps . We will prove that this family has a series of Saddle-node bifurcations and a period doubling bifurcation. Also, we show that for some value of the parameter the functions  will be chaotic.
 

Design and Implementation of Distributed Real-time Security System via Mobile Technology

Dhuha Basheer Abdullah; Wael W. Mahmood

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 79-99
DOI: 10.33899/csmj.2013.163476

In this paper, a distributed real time security system for monitoring and remote control on building and protecting it from unauthorized entering is designed and implemented. This system is based on the transfer of signal in real time when there is a breach and image of an unauthorized person to enter the building to the mobile phone of the person who is responsible for the security of the building.
            The real time system consists of three main parts, the first one is the computer with an electronic circuit connected via the serial port. The designed electronic circuit contains the Microcontroller for reading sensors connected to ports of the building (G1, G2, and G3) and processing the signals. Also, there is a monitoring camera to capture an image when registering a case of breach. The program in the computer receives signals from the three ports and uses a fixed real time algorithm for scheduling signals and gives them priorities according to the importance of ports, then sends signals to the second part of the system. The second part of the system consists of a server on the Internet which receives signal and image of the breach, stores it in a database system and then transferring it in real time to the third part. The third part consists of several mobile phones to achieve the principle of distribution for this system, each mobile phone will be responsible for a single port in the building, while there is one mobile phone responsible for all ports which belongs to the person who is responsible for the building security. Each mobile phone contains three programs, the first program would receive a signal of the breach and give the alarm, the second program displays picture, and the third program sends a control signal.
 

Applying the Intelligence of Ant and Tabu Search to Solve The 8-puzzle Problem

Ruqaya Z. Sha’ban

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 101-112
DOI: 10.33899/csmj.2013.163477

The research tackled artificial intelligent methods to solve one of the optimization problems by using artificial ant by applying ant colony optimization algorithm and also tabu search algorithm to find the solution of sliding tile 8-puzzel problem. In ant colony algorithm generated many possible solutions depending  on finding the difference tiles in initial state from the goal and moving accordingly in the current state of the problem. In Tabu search, many possible solutions have been generated according to the replacement relation between different tiles in initial state to find the optimal solution from many solutions. In this research, the experimental show is very speed to obtain the goal. The source code is written in MATLAB language to simulate these two algorithms.
 
 

Solution of Nonlinear 2nd Order Multi-Point BVP By Semi-Analytic Technique

Luma N.M. Tawfiq; Mariam M. Hilal

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 113-121
DOI: 10.33899/csmj.2013.163478

In this paper, we present new algorithm for the solution of the nonlinear second order multi-point boundary value problem with suitable multi boundary conditions. The algorithm is based on the semi-analytic technique and the solutions are calculated in the form of a rapid convergent series. It is observed that the method gives more realistic series of solutions that converge very rapidly in physical problems. Illustrative examples are provided to demonstrate the efficiency and simplicity of the proposed method in solving this type of multipoint boundary value problems.
 

Convergence Analysis of The Finite Difference Solution for Two Dimensions Coupled-Benjamin-Bona-Mahony System

Ekhlass S. Al-Rawi; Muhannad Shallal

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 129-141
DOI: 10.33899/csmj.2013.163480

This paper is devoted to drive the matrix algebraic equation for the two-dimensional nonlinear coupled-BBM system which is obtained from using the implicit finite difference method. The convergence analysis of the solution is proved.Numerical experiment is presented with initial conditions describing the generation and evolution.
 
 

Stability Analysis for Inclined Channel by an Angle 30◦ with The Presence of Magnetic Field

Ahmmed M. Juma'a; Ala'a A. Hammodat

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 143-152
DOI: 10.33899/csmj.2013.163481

In this research, we study the stability of a system  of partial differential equations which represents  fluid flow in an inclined channel  and under the influence of a magnetic field perpendicular to the plane of the channel and the presence of radiation coefficients and  when the channel has an inclination angle ø =30.
 
 

An Application of He's Variational Iteration Method for Solving Duffing - Van Der Pol Equation

Ann J. Al-Sawoor; Merna A. Samarchi

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 153-163
DOI: 10.33899/csmj.2013.163482

In this paper, we apply He's variational iteration method (VIM) and the Adomian decomposition method (ADM) to approximate the solution of Duffing-Van Der Pol equation (DVP). In VIM, a correction functional is constructed by a general Lagrange multiplier which can be identified via a variational theory. The VIM yields an approximate solution in the form of a quickly convergent series. Comparisons of the two series solutions with the classical Runge-Kutta order four RK45 method show that the VIM is a powerful method for the solution of nonlinear equations. The convergent of He's variational iteration method to this equation is also considered.
 

On Some Properties of Functions on Convex Galaxies

Tahir H. Ismail; Barah M. Sulaiman; Hind Y. Saleh

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 165-170
DOI: 10.33899/csmj.2013.163483

In this paper, we define and study extensively a new type of external sets in , we call it "convex galaxies". We show that these convex external sets may be classified in some definite types. More precisely, we obtain the following :
(1)Let  be a convex galaxy which is symmetric with respect to zero, then
(i)  is an  - galaxy (0) if and only if there exists an internal strictly increasing sequence of strictly positive real numbers  with  such that  and , for all , where,  is some limited real number such that .
(ii)  is a non-linear galaxy if and only if there exists an internal strictly increasing sequence of strictly positive real numbers  with   such that  is unlimited for all . 
(2)Let  be a convex galaxy which is symmetric with respect to zero, then
(i)  is an  - galaxy (0) iff there exists a real internal strictly increasing - function , such that , and  for all limited , where  is a positive real number.
(ii)  is a non-linear galaxy if and only if there exists a real internal strictly increasing - function , such that  and  is positive unlimited, for all appreciable .

Modifying Explicit Finite Difference Method by Using Radial Basis Function Neural Network

Omar S. Kasim

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 171-186
DOI: 10.33899/csmj.2013.163484

  In this research, we use artificial neural networks, specifically radial basis function neural network (RBFNN) to improve the performance and work of the explicit finite differences method (EFDM), where it was compared, the modified method with an explicit finite differences method through solving the Murray equation and showing by comparing results with the exact solution that the improved method by using  (RBFNN) is the best and most accurate by giving less error rate through root mean square error (RMSE) from the classical method (EFDM).
 

Study Conditions of Center of Gravity for Trivial Solution to Semi Linear Differantial Equation of Third Order in The One Critical Cases

Thair Younis Thanoon; Zena Talal Yaseen

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 13-23
DOI: 10.33899/csmj.2013.163469

In this paper we study the conditions under which the zero solution iscenter of Gravity in the semi-liner case for certain third order differential equation of the form:
 
We have:
 
 
The characteristic equation of the above differential equation has complex roots of the form :
  ,
and the other root has the following property .
 

Designing a Monitoring Tool for Mosul University Network to Detect Worm Infected Computers

Asmaa Yaseen Hamoo; Sundus Abdulmuttalib Muhamed

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 43-60
DOI: 10.33899/csmj.2013.163485

In order to make use of the web services, it has recently become inevitable to connect computers to the internet. This connection, however, make the computers prone to the challenges of intrusion and hacking.
The present study tackles the problem of computers' vulnerability to malware such as worm: a self-replicate computer program that spontaneously copies itself to the vulnerable systems and spreads through the web exploiting security gaps and posing a great danger to the web community.
The study resorts to the design and implementation of a fast scanning worm detection tool. The tool depends on counting failed connection attempts after study of the indicators of failed connection.
The tool performance is examined offline by using the real traffic for inbound and outbound packets of the network of the university of Mosul. After examining the net, we used the core switch to monitor the university's inbound and outbound traffic, where the collecting process  of data took place on different periods to show the public  layout of the net. The study comes up to the conclusion that the monitoring tool was capable of detecting the infected computers which performs anomalous behavior and allocating worm propagation periods (the growth phase of worm) accurately.
The tool is implemented by using the sixth version of java. It is applied under the Microsoft windows operating system environment and the protocol suites known as TCP/IP.
 

Designing an Eelectronic Transmission System Using the Information and Communication Technology Infrastructure "A Proposed Model for the Intranet at the University of Mosul"

Raed A. Al-Dabbagh; Mustafa Z. Al-Dabbagh

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 61-80
DOI: 10.33899/csmj.2013.163486

The aim of the current study is to employing ICT in a way that supports management by establishing an electronic transmission system characterized with some features different from the previous ones through depending on open source programs which give the ability of continuous development without any costs. In addition, this system also has additional features such as operating under different operating systems.
This proposed model consists of two programs. The first one is an e-mail server provides a number of features and characteristics. The second program enables the user to apply some of the features for mailing data with big size, with high speed and secured depending on the internal mailing system (intranet) of Mosul University.
The system provides a special account with a password for each user on the services network and can also provide some features represented in stopping the undesired e-mails, checking the inbox and making sure that it is empty of viruses, resend some received e-mails for unlimited number of users on the same network, in addition to doing its normal tasks of sending and receiving e-mails; such as (writing a letters, editing and deleting). These programs can be downloaded from the internet for free and without any cost.
 

Scansion Text Written in English language and Recognized Printed English Character using Bidirectional Associative Memory Network

Aseel W. Ali

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 81-94
DOI: 10.33899/csmj.2013.163487

The fact that English language is a universal language, so it is necessary to propose  a computerized  ways to recognize the texts written in English language, which will simplifies the reading  of any text, treat it, and deal with it in a least possible time.
            The BAM (Bidirectional Associative Memory) network was used to recognize the printed English letters, because it process the small size images of letters in an easy way, also BAM is working in two ways (forward and backward) and store the weights without any amendment, therefore BAM is considered as one of the networks of education controller (Supervised learning).
The recognition of the printed English text was done using the network BAM, while the printed English text was entered to the computer using the scanner, also BAM network used to recognize the letters that have some noise and after training; it gives successful results of recognition about 84.6%.
  The aim of this research is to segment and recognize the printed English text, wither it is clear or it have some noise, Matlab R2008a language is used to accomplish this work.
 

Classification of Web Pages by Using Particle Swarm Optimization Algorithm

Muhammad Hamid Abdulraheem; Ghayda A.A. Al-Talib

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 95-112
DOI: 10.33899/csmj.2013.163488

As the amount of information available on the internet grows so does the need for more effective data analysis methods. This paper utilizes the particle swarm optimization (PSO) algorithm in the field of web content classification, and used part of speech tagging algorithm to reduce the large numbers of attributes associated with web content mining. The proposed algorithm gave a good classification accuracy, which comparable to the accuracy of Ant-miner algorithm and acquire less training time.
 

Hiding Information using Replacement in Silent Mutation of DNA Sequences

Sadoon H. Abdullah; Ahmed S. Nori

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 113-134
DOI: 10.33899/csmj.2013.163489

The present study included an application of new method of steganography using DNA sequence as a media for hiding. This method is considered a secret cover for the secret message (text, image), avoid attention of unauthorized person in addition to be inextricable since it needs high effort, long time and well background in biology.
Hiding secret message in a known DNA sequence belongs to prokaryotic organism was conducted. The DNA sequence obtained from EBI location (European Bioinformatics Institute). Among the DNA molecule characters, one of the mutant ability types, that is the silent mutant, was choose to hide a secret message within the sequence. Then the sequence with the hidden message was sent to receiver via many methods.
            For more precaution the DNA sequence with the message was hide as a colored image with different dimensions and extension (BMP, PNG). However, image quality remain unchanged. Results of study revealed high hiding ratio.
 

Compress Digital Image based on Genetic Meta-Heuristic algorithm

Fawziya Mahmood Ramo; Yaser Noor Al Deen

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 135-143
DOI: 10.33899/csmj.2013.163490

In this research a propose method has be used to compression Data of digital image  based on one of Meta Heuristic Algorithm. Genetic Meta Heuristic has been applied to obtain effective data and then performed compression operation using Vector Quantization.
The proposed algorithm has been applied (we called it GMH) on sample of images.Efficince measures has been performed to calculate the value of (PSNR,MSE and correlation coefficient and compression ration). The experiments show that the proposed algorithm achives high performance and produces 87% compression rate.
 
 

Application of the Genetic Algorithm in the Network Intrusion Detection System Using NSL-KDD Data

Naglaa B. Ibrahim; Hana M. Usman

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 145-158
DOI: 10.33899/csmj.2013.163491

With the development of the Internet, technological innovation and the availability of information emerged new computer security threats. The researchers are developing new systems known as Intrusion Detection Systems IDSs for detecting the known and unknown attacks.  IDS have  two approaches depending on the detecting theories: Misuse Detection and Anomaly Detection.
This paper aims to design and implement  a misuse  network intrusion detection system based on Genetic Algorithm. The efficiency of using GA for building IDS based on NSL-KDD is verified. For rules generation NSL-KDD Data Set is used which include, KDDTrain and KDDTest, 125973 and 22544 records respectively, each record  consists of 41 features and one class attribute for specifying   normal and abnormal connection (complete train and test data are used), In order to get rid of redundancy and inappropriate features Principal  Component Analysis (PCA) is used for selecting (5)  features.
Number of experiments have been done. The experimental results show that the proposed system based on GA and using PCA (for selecting five features)  on NSL-KDD able to speed up the process of intrusion detection and to minimize the CPU time cost and reducing time for training and testing, that the detection rate: 91.6%  and false alarm is: 0% and classification rate  (DoS 93.48 %), (Normal 99.52%) , (Probe 81.16%), (R2L 69.47%), (U2R 32.84%). C# programming language is used for system implementation.
 

Face Detection in a Video File Based on Matching Face Template

Maha A. Hasso; Shahad A. Hasso

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 159-172
DOI: 10.33899/csmj.2013.163492

The research aim is apply algorithm for finding the number of regions to determine the largest number of faces of candidates in the video or detection, which appear in the video depending on the color techniques in the video and to fragment the skin and reject the largest number of regions that are non skin, and reduce the false faces.
The algorithm depends on the usage of technique to detect human face and select it in the video after segment it to set of color images, the technique includes two steps for image processing The first is for building a model for skin color, and an outline of the distribution of color and isolate areas of skin and non skin within the image, then identify areas of the skin. The second step includes the template matching.
The results proved high accuracy by nearly 85% in the discrimination of the faces in the video and enclosed in geometric and stored in a new video, the algorithms is programmed in MATLAB 7.10.0 (2010) programming language which has many efficient functions in image processing.
 

Representation of a Distributed Database System for the Medical Purposes Using Oracle

Basam A. Mustafa; Ahmed A. Al-Saman

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 173-187
DOI: 10.33899/csmj.2013.163493

This research concerned with the designing and implementation of a distributed database system for the medical purposes. The system has been applied on dental clinic unit and statistics department at Al-Khansaa Educational Hospital at Mosul, and dental clinic unit at Woman Health Care Center at Mosul as a case study.
Client/server model has been used to implement the proposed system's architecture. The computers have been connected together through a local area network (LAN). Horizontal fragmentation technique has been used to distribute the database which achieved a good level of local autonomy. Oracle software were used and utilized to implement the system. It played a dramatic role in protecting data using combination of passwords and user roles hierarchies in addition to achieving transparency and data integrity concepts in the system. The proposed system simplified saving and retrieving data of dental clinics. It also provides dental clinics units  and statistics department with necessary reports and statistics. The proposed system has the ability to automatically perform daily backup for the database in addition to the manual options for database backup and recovery.
 

Programming Mobile Applications

Nada N. Saleem; Mohammad Abdalraheem Hamdy

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 189-202
DOI: 10.33899/csmj.2013.163494

Mobile and wireless devices become widespread devices in the past few years, These devices made substantial progress in the important field of wireless applications which used in all areas of human life. This research develops two applications which execute on mobile and computer. The first application is electronic library which make the user search in the library electronically on computer throw Bluetooth wireless technology, The second application is mouse controlling throw Bluetooth.
These applications are programmed with J2ME language on mobiles, covered MIDP 2.0 with CLDC 1.0 executed on mobiles with versions Nokia 6600, Nokia 7610, N72 and executed on computers with the following operating systems Windows 7, Windows XP and Linux Mandriva 2010 .
 

Genetic Linear Averaging Algorithm for Zooming Digital Images

Baydaa Sulaiman Bahnam

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 203-218
DOI: 10.33899/csmj.2013.163495

In this paper, the hypernation of linear averaging algorithm for zooming images is achieved with genetic algorithm. It's applied on a number of samples of images that lack the indistinction of the outline and providing accurate images. The equation of linear averaging is utilized as an objective function in genetic algorithm using several types of crossovers and mutations. A compression among these types is accomplished using two measures (RMSE & PSNR) for evaluating the proposed algorithm. The ratio for zooming is twice as the original images. The accuracy and the efficiency of those images are RMSE = 6.6541 and PSNR = 31.6470 db. A MATLAB 7.10.0(R2010a) environment is used for the programming of proposed algorithm will all applied types of crossovers and mutations.
 

Measurement of the Efficiency of Parallel Genetic Algorithm for Compress and Decompression of Fractal Imaging Using Multiple Computers

Shahla A. Abdul Qadir

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 219-232
DOI: 10.33899/csmj.2013.163496

Efficient technologies have  been recently used in Fractal Image Coding (FIC) to reduce the complexity of searching for matching between Range block and Domain block. The research aims at using the Parallel Genetic Algorithm (PGA) by the technology of the (Manager/Worker) in parallel computers to obtain  best and quickest compress for images by  coding the site of the searching domain block with a Gray code and a fitness function that minimizes the space  between the matching of the current range block with the searching  domain block  in order  to choose  a protection strategy and compress of high accuracy of  images . Results showed that PGA is  quicker than standard algorithm in FIC  and  is more flexible and efficient in reaching the optimum solution in higher speed and efficiency through using the Gray code. The searching method used for the parallel algorithm for compression and decompression , the method of choosing GA's coefficients, (selection, crossover  and mutation) were of a  significant role in improving the image compression ratio and quality for images in high speed that has reached 15s , compression ratio has reached  91.68% , while the image quality was improved after decompression  and has  reached  roughly 34.81  compared to traditional method of  fractal image coding (FIC) where the compression ratio has reached 83.87% and image quality 31.79 with algorithm implementation speed reached 28s.
 
 

Stability Analysis of the Flow of Blood in the Branching and Stenoted Arteries

Rotaiyna J. Essa; Shaimaa M. Younis

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 233-242
DOI: 10.33899/csmj.2013.163497

This research is devoted to the stability analysis of the system of equations that describes the flow of blood in the branching and stenoted arteries. This branch takes the form of the character Y, By using the Navier -Stoke of equations in Polar coordinates,when the amplitude is constant and we found that the system is stable under the condition
 

Chaotic Watermarking for Authentication

Melad Jader Saeed

AL-Rafidain Journal of Computer Sciences and Mathematics, Volume 10, Issue 2, Pages 243-257
DOI: 10.33899/csmj.2013.163498

This research concerns with generating and hiding invisible chaotic watermarking, in a manner different from that used in the rest of the known watermarks, has been presented.
The work has two phases in each of which the chaotic function has been used twice. In the first phase it is used to generate the watermark from the same cover picture then embedding it in another level of the cover depending on the chaotic positions in order to increase authenticity and fortification against attacks. As for the second phase, the chaotic function has been used to generate and retrieve the watermark and compare them to ensure authenticity. Through the practical results that were obtained using the measurements of Correlation, PSNR, and MSE the quality of this algorithm has been shown. Some of the image processing procedures have been used to measure the robustness of this algorithm through calculating the correlation coefficient.