2020-06-01T07:54:02Z
https://csmj.mosuljournals.com/?_action=export&rf=summon&issue=419
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
New low storage VM-algorithm for constrained optimization
Abbas
Al-Bayati
Hamsa
Chilmerane
In this paper a new low-storage VM-algorithm for constrained optimization is investigated both theoretically and experimentally. The new algorithm is based on both the well-known Fletcher's low storage algorithm which generates columns Z spanned on the gradient vectors g1, g2, ... gn and the idea of both Buckley and LeNir of combined variable storage-conjugate gradient method. The well-known SUMT algorithm is adapted to implement the new idea. The new algorithm is very robust compared with the standard low-storage Fletcher algorithm and the standard SUMT algorithm which was designed for solving constrained problems, of the <em> </em> numerical results of application very promising.
constrained
low storage
SUMT
2009
09
01
11
19
https://csmj.mosuljournals.com/article_163817_6a13c0a173b9ebcf371f9ca07b814280.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization
Abbas
Al-Bayati
Huda
Ahmed
Conjugate gradient methods are wildly used for unconstrained optimization especially when the dimension is large. In this paper we propose a new kind of nonlinear conjugate gradient methods which on the study of Dai and Liao (2001), the new idea is how to use the pair conjugate gradient method with this study (new cojugacy condition) which consider an inexact line search scheme but reduce to the old one if the line search is exact. Convergence analysis for this new method is provided. Our numerical results show that this new methods is very efficient for the given ten test function compared with other methods.
unconstrained optimization
Conjugate gradient methods
2009
09
01
21
35
https://csmj.mosuljournals.com/article_163818_abe37be5528312a4ccb98eab5d28ecef.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
A New Binary Mathematical Programming Problem Model for Mobile Communication
Abdul-Rahim
Alharithi
Dana
Mahmood
The aim of this study is to determine the number of base slatlons and capacity of each base station to satisfy the increased traffic demand and serving all traffic demand areas with a sufficient number of base stations, which is using a minimum number of base stations in order to minimize the total cost.
The problem is formulated as a binary linear program ming problem, and is solved by a specific algorithm. For this reason, we have built a specific algorithm to solve the model, with programming this algorithm by using Microsoft Access using Visual Basic applications, which has ability to have a decision about any changes and fluctuations.
Advantages of the algorithm can obtain best (optimum) solution with least steps.
Computational results show that the proposed model is highly effective and it is applicable, as well.
For (30) candidate base stations and (15) TDAs, we have applied the model with low costs differ by (10 unit $) with satisfying the required demand for all TDAs.
Programming Problem
Mobile Communication
2009
09
01
37
47
https://csmj.mosuljournals.com/article_163819_2fdfdb07ceea6585e1cc0317d0edd840.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
On Idempotent Elements
Nazar
Shuker
Alaa
Hammodat
In this paper we study idempotent elements, we give some new properties of idempotent elements and provide some exam we also study central idempotent elements and orthogonal idempotent elements and give some new properties of such idempotent.
Finally we study special ring which satisfies the property
for all x in R and n is a positive integer, we represent such ring in termes of idempotent and nilpotent elements.
Rings
idempotent elements
nilpotent elements
2009
09
01
49
56
https://csmj.mosuljournals.com/article_163820_c267ab881f000ed8a0fd2c626d80bb61.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
On GP- Ideals
Raida
Mahmood
Shahla
Khalil
In this work we give some new properties of GP- ideals as well as the relation between GP- ideals, - π regular and simple ring. Also we consider rings with every principal ideal are GP- ideals and establish relation between such rings with strongly regular and local rings.
pure ideals
GP-ideals
strongly regular
local rings
2009
09
01
57
63
https://csmj.mosuljournals.com/article_163821_263bcecb364d341800d2c5d785e62116.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Solving Multi-Objective Complementary Programming Problem (MOCPP) by using Optimal Average
Najmaddin
Sulaiman
Abdul-Qader
Hamadamin
In this paper, we suggested an approach to solve Multi-Objective Complementary Programming Problem (MOCPP) by using optimal average (O<sub>AV</sub>). The computer application of algorithm also has been demonstrated by flow-chart and solving a numerical examples by using MATHLABR2006a, and shown results in tables.
Solving (MOCPP) by using Optimal Average (OAV)
2009
09
01
65
79
https://csmj.mosuljournals.com/article_163823_74f90e30913e53d7f668e369f05f20f1.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Real Dynamics and Bifurcation of the Family
Salma
Faris
The purpose of this work is to study the dynamics of the family of nonlinear functions ={<sub> </sub>It is shown that the bifurcation in the dynamics of <sub> </sub> occurs at the critical parameter value
Dynamics
bifurcation
real nonlinear functions
2009
09
01
81
91
https://csmj.mosuljournals.com/article_163824_cebaa14abb4ce8e193eff7fe60ff826d.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Using Predictor-Corrector Methods for Numerical Solution of System of Non-linear Volterra Integral Equations of Second Kind
Borhan
Jumaa
Abbas
Taqi
The aim of this paper is solving system of non-linear Volterra integral equations of the second kind (<strong>NSVIEK2</strong>) numerically using Predictor-Corrector methods (<strong>P-CM</strong>). Two multistep methods (Adams-Bashforth, Adams-Moulton). Convergence and stability of the methods are proved and some examples are presented to illustrate the methods. Programs are written in matlab program version 7.0.
Adams-Bashforth method
Adams-Moulton method
Runge-Kutta method
system of non-linear Volterra integral equation
2009
09
01
93
109
https://csmj.mosuljournals.com/article_163825_589ee1e79735795d87f91ce21070868a.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Enhancing Cost and Security of Arabic SMS Messages over Mobile Phone Network
Abdullah
Abdullah
This paper investigates a novel algorithm for compressing and encrypting Arabic short text messages (SMS messages). Short text messages are used in cellular networks. Compression is required for saving the transmission energy or to use bandwidth in an efficient manner in addition to save the user money while the end-to-end effective encryption is required for security providence. This work succeeded to overcome small size limitation of the SMS message by changing Arabic characters coding from Unicode to Base64 coding scheme and developing a runt version of lossless Huffman coding scheme. Examples are shown where the application of the text compressor for short message services offering more than three times the capacity compared to a standard message.
SMS compression
Huffman coding
Transposition key
2009
09
01
111
127
https://csmj.mosuljournals.com/article_163826_d4b09a0ba302e67e68f3024ab7cb2439.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
The n-Wiener Polynomials of Straight Hexagonal Chains and Kt×Cr
Ali
Ali
Haveen
Ahmed
The n-Wiener polynomials of straight hexagonal chains and the Cartesian product of a complete graph K<sub>r</sub> and a cycle C<sub>r</sub> are obtained in this paper. The n-diameter and the n-Wiener index of each such graphs are also determined.
n-distance
n-diameter
n-Wiener index
n-Wiener Polynomials
hexagonal chains
2009
09
01
129
139
https://csmj.mosuljournals.com/article_163827_5ce66bb50c78d80196bd6f3acb5f3aae.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Stability Conditions for Flow Rate of Liquid Between Two Vessels
Thair
Thanoon
Nagham
Hana
In this paper we obtain the conditions under which the trivial solution is stable for the following perturbed differential system :
<strong> </strong>
<strong> </strong>
<strong> </strong>
<strong> </strong>
<strong> </strong>
where _ constants.
which described the flow rate of liquid or gases between two vessels, we transform this differential system to auxiliary system which gives the stability conditions of solution by Perron principle, these conditions represent stability conditions for required differential system.
stability
Perron principle
2009
09
01
141
150
https://csmj.mosuljournals.com/article_163828_b714e3c0c338e9077c7a356c9c706b0c.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Image compression using Modified Fuzzy Adaptive Resonance Theory
Ielaf
abdl-majjed
This research developed a software which can be used for image compression. This research proposes two methods: the first uses Joint Photographic Experts Group (JPEG), while the second uses artificial neural network (Modified Fuzzy Adaptive Resonance Theory (MFART)) algorithm. This software is applied on two types of images (jpeg and tiff). Several parameters in compression methods are tested, the results reveal that the MFART is better than the JPEG metod. The Root Mean Square Error (ERMS) for MFART method on jpeg image is equal 3.7 but it is equal to 26.09 when JPEG method implement on to the same image. MATLAB has been used in the implementation of this software.
image compression
Modified Fuzzy Adaptive Resonance Theory
2009
09
01
151
160
https://csmj.mosuljournals.com/article_163829_05cd879092aa76cdac74105306630271.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Stability Analysis of Unified Chaotic System
Saad
AL-Azzawi
The aim of this paper is to find the stability of unified chaotic system through studying different systems. The unified chaotic system is divided into three systems by depending on the values of , when , the unified chaotic system becomes Lorenz system; when; it becomes L system, when ; the unified chaotic system becomes Chen system. Investigations the stability analysis of these systems leads to the stability of the unified chaotic system.
unified chaotic system
Lorenz family
stability
Routh-Hurwitz
2009
09
01
161
171
https://csmj.mosuljournals.com/article_163830_9b8f6ceb2f78074db645bc16c7344eff.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
On The Basis Number Of Semi-Strong Product Of With Some Special Graphs
Ghassan
Marougi
The basis number, <em>b(G</em>) ,of a graph <em>G</em> is defined to be the smallest positive integer <em>k</em> such that <em>G</em> has a <em>k</em>-fold basis for its cycle space. We investigate the basis number of semi-strong product of with a path, a cycle, a star, a wheel and a complete graph.
Basis number
Cycle space
2009
09
01
173
181
https://csmj.mosuljournals.com/article_163831_06146030f89fe1b0cda4709f997eaf5c.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Comparison between the Heun's and Haar Wavelet Methods for solution Differential-Algebraic Equations (DAEs)
Abdulghafor
Al-Rozbayani
Ahmed
Qasem
In this paper, We solved the system of differential-algebraic equation (DAEs) of index one numerically with Heun's method and operational matrices of Haar wavelet method, When we compared the results of the two methods with the exact solution, show that the operational matrices of Haar wavelet method is more efficiency and it's numerical results near to the exact solution more than the Heun's method, and the solution accuracy of this method is increasing and the error decreases when the number of mesh points and size of matrices increase.
Differential-Algebraic Equation
Heun's method
Haar wavelet method
2009
09
01
183
196
https://csmj.mosuljournals.com/article_163832_13d189fc4807c59e522c5141a3bf7a69.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
An Algorithm for the Best Way Connection among Cell-Phone Towers Using Feedforward Neural Network
Kais
Ibraheem
Thamir
Jarjis
Yahya
Ibrahim
A new approach for mobile radio towers is presented in this paper. The use of feed-forward artificial neural network makes it possible to overcome some important disadvantages of previous random distribution of the towers.
Our sample implementation is based upon the coordinates of a virtual cell phone towers distributed in Mosul city. The results show that the proposed algorithm is sufficiently accurate for use in planning mobile towers distribution system.
Artificial Neural Network
Mobile radio towers
2009
09
01
197
209
https://csmj.mosuljournals.com/article_163833_b3dee4a22c3eb7bc5f709bc961f477fa.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Off-line Recognition of Unconstrained Handwritten Numerals Using Fuzzy Hough Transform
Mohammed
Khedher
Ghayda
Al-Talib
Shayma
Al mashhadany
A fuzzy system for handwritten numerals recognition using a fuzzy Hough transform technique is presented. The system is an off-line system since the data processed was written before the time of recognition. A data base of 480 patterns of unconstrained (free) handwritten numerals was used in the proposed system. Membership values are determined as fuzzy sets which are defined on the standard Hough transform vector.
Manhattan distance measurement has been used to measure the similarity of an input feature vector to a number of numeral pattern classes. The overall recognition accuracy of the system for the ten numerals is 95%.
Character Recognition
fuzz logic
Hough Transform
2009
09
01
211
226
https://csmj.mosuljournals.com/article_163834_fb7610d8f21544f56dd233a469c508e2.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
New Hybrid Quasi-Newton Algorithms for Large Scale Optimization
Abbas
Al-Bayati
Sawsan
Ismail
Two new hybrid algorithms have been suggested in this paper, the first one utilizes four formula of self-scaling update matrix was used. The matrix is selected according to Buckley method in each step. The new algorithm has been compared with BFGS standard algorithm by means of (10) multi-dimensional standard functions.
As for the second new hybrid algorithm, a new method is used to test the conjugate coefficient (β) which consists of Hestenes Stiefel (HS) and Dai and yuan (DY). Then it is compared with BFGS and PCG algorithms, which uses BFGS update, by means of (10) multi-dimesional standard functions.
Numerical results in general indicates the efficiency of the algorithms proposed in this paper by using this number of non-linear functions in this domain.
Large Scale Optimization
Quasi-Newton Algorithms
self-scaling update matrix
2009
09
01
11
24
https://csmj.mosuljournals.com/article_163835_539378eadc2c5072890ebe2a6b82b2b7.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Stability Analysis for Steady State Solutions of Burger Equation
Saad
Manna
Badran
Salem
The Stability Analysis of Steady State Solution of Burger equation by using Fourier mode Stability analysis in two cases has been considered , the first one when the amplitude is constant and the second one when the amplitude is variable .
In the first case the steady state solution is always stable and the second case is conditionally stable . In the second case the comparison between the analytical solution and numerical solution of Galerkin technique are the same.
Stability Analysis
Burger Equation
Galerkin Technique
2009
09
01
25
36
https://csmj.mosuljournals.com/article_163836_a1a84800360a14f27fa560f5efb31fc3.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
w-Wiener polynomials of Width Distance for Cartesian Product K2 with Cycle and Wheel
Ali
Ali
Asma
Aziz
The w-Wiener polynomials of the cartesian product of K<sub>2</sub> with a cycle C<sub>t </sub> and with a wheel W<sub>t</sub> are obtained in this paper , in which w does not exceed the connectivity of the product graph . The diameter and Wiener index with respect to the width distance -w for K<sub>2</sub>×C<sub>t </sub>and K<sub>2</sub>×W<sub>t</sub> are also obtained .
w-Wiener polynomials
cycle
wheel
Width Distance
2009
09
01
37
55
https://csmj.mosuljournals.com/article_163837_e31f9d9ca4608ee42ce26b0867366298.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Enhance Fingerprint Image by Using Genetic Algorithms
Ban
Mitras
Daliya
Abdullah
In this paper, an algorithm is proposed to enhance fingerprint image which includes in one of its steps a smoothing process in which the suggested genetic algorithms by Mitras and Anwar in 2007 which used image smooth filters in both spatial and frequency domain will be employed to know their efficiency in enhancing and regaining the damaged sides of the fingerprint image to remove two types of noise, first one deals with noise added to the image, and the second one the noise already found in the image. Then histogram technique is used to enhance the fingerprint image.<br />
Genetic algorithm
image processing
2009
09
01
57
73
https://csmj.mosuljournals.com/article_163838_68fa19062ab21ff695de3b0809eed13e.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Image Compression Based on Artificial Intelligent Techniques
Shahbaa
Khaleel
Baydaa
Khaleel
Alaa
khaleel
This research present four methods to compress digital images using clustering based on artificial intelligent techniques that include neural network, fuzzy logic and hybrid between them. To enhance the performance of the compression system, the first method was developed in two types <em>(k-means 1 dimension run length encoding km1D, k-means 2 dimension run length encoding km2D)</em> by applying traditional clustering algorithm k-means on color and gray level images and then apply compression algorithm RLE in one and two dimension by zigzag scanning to obtain compressed image. The second method <em>(fuzzy c-mean 1dimension run length encoding fcm1D, fuzzy c-mean 2dimension run length encoding fcm2D)</em> used fuzzy c-mean to apply clustering operation and then compression. The third method <em>(kohonen 1 dimension run length encoding Koh1D, kohonen 2dimension run length encoding Koh2D)</em> used kohonen neural network for clustering image and then used RLE. The fourth developed method <em>(fuzzy kohonen 1dimension run length encoding fKoh1D, fuzzy kohonen 2dimension run length encoding fKoh2D)</em> based on hybrid kohonen neural network and fuzzy logic i.e fuzzy kohonen network which is recognized as the best method among the four methods. The four compression methods that are implemented in this research are efficient when applied on gray level and color images.
Artificial Intelligent techniques
image compression
2009
09
01
75
109
https://csmj.mosuljournals.com/article_163839_db9207fccf7c26ec22471fbd1fa85155.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Stream Cipher Using Genetic Algorithm
Melad
saeed
The research tackles newly suggested method in generating the random key used in stream cipher, by generating the key randomly using rand function and then applying randomness conditions if the produced key satisfy the conditions then its accepted key other wise,Genetic Algorithm (GA) are used to produce the key stream.
The proposed method used new structure style to hide the encrypted key withen the text. In addition simple hash function is used to check the integrity of the empeded encrypted key.
stream
genetic
Encryption
random
2009
09
01
111
126
https://csmj.mosuljournals.com/article_163840_90c40bf2301377bed5a960d5259da02c.pdf
AL-Rafidain Journal of Computer Sciences and Mathematics
AL-Rafidain Journal of Computer Sciences and Mathematics
1815-4816
1815-4816
2009
6
3
Evaluation of Electrons Energy Distribution Function by Fuzzy Logic
Nabhan
Hamdon
Evaluation of a maxwellian Electrons Energy Distribution Function (EEDF) in plasma glow discharge in air has been done. It includes the design of computerized system which depends on one of the intelligent techniques (Fuzzy logic). Their input and output consists of linguistic variables which describe the fundamental parameters (Energy, Pressure, Discharge current) of glow discharge process in different glow discharge regions (Cathode fall region, positive column region)<strong>. </strong>It is suggested in this study that three different types of Gaussian membership function in different forms for each variable. The results seem to be compatible with other published researches, making use of the MATLAB scientific software version (R2006a).
fuzzy logic
EEDF
If-then rules
Glow discharge
2009
09
01
127
144
https://csmj.mosuljournals.com/article_163841_3e49555a79194d936acbc2dcc43c664a.pdf