ORIGINAL_ARTICLE
Using the Improvement of the Fixed Point Iterative Method in Solving Fredholm Integral Equations
In this paper an iterative method for the fixed point is used to obtain an approximation solution for the Fredholm integral equations of the second kind by using several problems with different accuracy .Also we have proposed a successful improvement for the iterative fixed point method. A number of different tests are solved and compared in order to study the effectiveness of the proposed technique.
https://csmj.mosuljournals.com/article_163792_d51a48192c754f4dcdb0de294d129d23.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
11
19
10.33899/csmj.2009.163792
fixed point method
Fredholm integral equations of the second kind
Abbas
Al-Bayati
profabbasalbayati@yahoo.com
true
1
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
AUTHOR
ORIGINAL_ARTICLE
On New Conjugate Pair Method
This paper involves the combination between the conjugate pair and hybrid conjugate gradient methods. The new combined algorithm is based on exact line search and it is examined by using different nonlinear test functions in various dimensions. Experimental results indicate that the updated algorithm is more effective than of the two original algorithms.
https://csmj.mosuljournals.com/article_163793_e758264fa430810d448889e5a7ef8072.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
21
29
10.33899/csmj.2009.163793
conjugate gradient method
Conjugate pair method
Abbas
Al-Bayati
profabbasalbayati@yahoo.com
true
1
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
AUTHOR
Nidhal
Al-Assady
true
2
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
AUTHOR
Ban
Mitras
dr.banah.mitras@gmail.com
true
3
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
AUTHOR
ORIGINAL_ARTICLE
PILP-rings and fuzzy ideals
In this paper, we study rings whose principal right ideals are left pure. Also we shall introduce the concept of a fuzzy bi-ideal in a ring, and give some properties of such fuzzy ideals. We also give a characterization of whose principal right ideal are left pure, fuzzy duo ring in terms of fuzzy deals.
https://csmj.mosuljournals.com/article_163794_3d660615ada37d1afaf47cc3aa045a40.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
31
37
10.33899/csmj.2009.163794
pure ideal
fuzzy ideal
Duo Ring
Raida
Mahmood
raida.1961@uomosul.edu.iq
true
1
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
AUTHOR
ORIGINAL_ARTICLE
A Generalized Curvature of a Generalized Envelope
In this paper we study one of the applications of a generalized curvature [3] on the generalized envelope of a family of lines given in [7], [8], using some concepts of nonstandard analysis given by Robinson, A. [5] and axiomatized by Nelson, E..
https://csmj.mosuljournals.com/article_163795_44e9b72f5c5a36dc5f825df1888b1ae6.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
39
47
10.33899/csmj.2009.163795
infinitesimals
monad
envelope
generalized curvature
Tahir
Ismail
tahir_hsis@uomosul.edu.iq
true
1
College of Computer Sciences and Mathematics
University of Mosul
College of Computer Sciences and Mathematics
University of Mosul
College of Computer Sciences and Mathematics
University of Mosul
AUTHOR
Ibrahim
Hamad
ibrahim.hamad@su.edu.krd
true
2
College of Science
University of Salahaddin
College of Science
University of Salahaddin
College of Science
University of Salahaddin
AUTHOR
ORIGINAL_ARTICLE
Dynamic Programming Algorithms for Solving Single Machine Scheduling Problems with a Fixed Complexity Time
We solvein this paper some machine scheduling problems with certain conditions; the solution had been made by using dynamic programming procedures with a fixed time for all the algorithms. Some of the algorithms described in the paper represent a modification to some mathematical programming algorithms and some of them are new or a generalization to others. The optimal solution of all these algorithms will be done with a fixed complexity time, which may lead us to solve them easier and faster.
https://csmj.mosuljournals.com/article_163796_cd298b8dc4e00b79f08e62e15286ec30.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
49
59
10.33899/csmj.2009.163796
scheduling
single machine
set-up times
Dynamic Programming
fixed complexity
Kawa
Al-Qazilchy
true
1
College of Sciences
University of Salahaddin
College of Sciences
University of Salahaddin
College of Sciences
University of Salahaddin
AUTHOR
ORIGINAL_ARTICLE
Numerical Solution and Stability Analysis for Burger's-Huxley Equation
The Burger’s-Huxley equation has been solved numerically by using two finite difference methods, the explicit scheme and the Crank-Nicholson scheme. A comparison between the two schemes has been made and it has been found that, the first scheme is simpler while the second scheme is more accurate and has faster convergent. Also, the stability analysis of the two methods by using Fourier (Von Neumann) method has been done and the results were that, the explicit scheme is stable under the condition and the Crank-Nicholson is unconditionally stable.
https://csmj.mosuljournals.com/article_163797_1898f72ec4f8efaa300d89931b797f98.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
61
75
10.33899/csmj.2009.163797
Stability Analysis
Explicit Scheme
Crank-Nicholson scheme
Burger's-Huxley Equation
Fourier (Von Neumann) method
Saad
Manaa
true
1
College of Education
University of Duhok
College of Education
University of Duhok
College of Education
University of Duhok
AUTHOR
Farhad
Saleem
true
2
College of Education
University of Duhok
College of Education
University of Duhok
College of Education
University of Duhok
AUTHOR
ORIGINAL_ARTICLE
On Representation Theorem for Algebras with Three Commuting Involutions
Algebras with three commuting involutions are represented as commutants of one-generated ¯ – £ – subalgebras of algebras of vector-space endomorphisms where ¯ – £ and are involutions of a prefixed type.
https://csmj.mosuljournals.com/article_163798_efadafa1dc2d45cfcd8428497d462f36.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
77
84
10.33899/csmj.2009.163798
Algebras
commuting involutions
Amir
Mohammed
amirabdulillah64@gmail.com
true
1
Department of Mathematics
College of Education
University of Mosul, Mosul, Iraq
Department of Mathematics
College of Education
University of Mosul, Mosul, Iraq
Department of Mathematics
College of Education
University of Mosul, Mosul, Iraq
AUTHOR
Baida
Abdullah
true
2
College of Education
University of Mosul, Iraq
College of Education
University of Mosul, Iraq
College of Education
University of Mosul, Iraq
AUTHOR
Nadwa
Younis
true
3
College of Education
University of Mosul, Iraq
College of Education
University of Mosul, Iraq
College of Education
University of Mosul, Iraq
AUTHOR
ORIGINAL_ARTICLE
Hosoya Polynomials of Steiner Distance of the Sequential Join of Graphs
The Hosoya polynomials of Steiner n-distance of the sequential join of graphs and are obtained and the Hosoya polynomials of Steiner 3-distance of the sequential join of m graphs are also obtained.
https://csmj.mosuljournals.com/article_163799_d2945eaa57b41d1fce65258600074152.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
85
95
10.33899/csmj.2009.163799
Steiner n-distance
Hosoya polynomial
Sequential Join
Herish
Abdullah
herish_omer@yahoo.com
true
1
College of Sciences
University of Salahaddin
College of Sciences
University of Salahaddin
College of Sciences
University of Salahaddin
AUTHOR
ORIGINAL_ARTICLE
Detection of Face Direction by Implementing Face Edge Patterns
In this paper, a method for detecting the direction of a human face is developed; regardless of its age or sex. The method involves creating a set of five face patterns representing the front, up, down, left, and right directions of a face. The face patterns are produced by applying Canny’s edge detection algorithm on some face files. The direction of the input face is found by first applying the above algorithm on the input file and comparing it with the five face patterns. The face pattern that gives minimum difference will represent the direction of the input face. Excellent results were reported when applied on images with relatively clear background and the head were centered at the image area.
https://csmj.mosuljournals.com/article_163800_e046d361d66a1582c5ead6f5f1b417ab.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
97
104
10.33899/csmj.2009.163800
Detection
Face Direction
Face Edge Patterns
Jarjees
Khidir
true
1
College of Science Education
University of Salahaddin
College of Science Education
University of Salahaddin
College of Science Education
University of Salahaddin
AUTHOR
ORIGINAL_ARTICLE
Iris Recognition System Based on Wavelet Transform
In order to provide accurate recognition of individuals, the most discriminating information present in an iris pattern must be extracted. Only the significant features of the iris must be encoded so that comparisons between templates can be made. Most iris recognition systems make use of a band pass decomposition of the iris image to create a biometric template. In this paper, the feature extraction techniques are improved and implemented. These techniques are using wavelet filters. The encoded data by wavelet filters are converted to binary code to represent the biometric template. The Hamming distance is used to classify the iris templates, and the False Accept Rate (FAR), False Reject Rate (FRR) and recognition rate (RR) are calculated [1].
The wavelet transform using DAUB12 filter proves that it is a good feature extraction technique. It gives equal FAR and FRR and a high recognition rate for the two used databases. When applying the DAUB12 filter to CASIA database, the FAR and FRR are equal to 1.053%, while the recognition rate is 97.89%. For Bath database the recognition rate when applying DAUB12 filter is 100%. CASIA and Bath databases are obtained through personal communication. These databases are used in this paper.
https://csmj.mosuljournals.com/article_163801_e507088d5a1eea7b14f1b9d7fcb72679.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
105
116
10.33899/csmj.2009.163801
Recognition
iris
wavelet transform
Maha
Hasso
true
1
College of Computer Sciences and Mathematics
College of Computer Sciences and Mathematics
College of Computer Sciences and Mathematics
AUTHOR
Bayez
Al-Sulaifanie
true
2
College of Electronic Eng.
University of Mosul
College of Electronic Eng.
University of Mosul
College of Electronic Eng.
University of Mosul
AUTHOR
Kaydar
Quboa
true
3
College of Electronic Eng.
University of Mosul
College of Electronic Eng.
University of Mosul
College of Electronic Eng.
University of Mosul
AUTHOR
ORIGINAL_ARTICLE
The n-Wiener Polynomials of the Cartesian Product of a Complete Graph with some Special Graphs
The n-Wiener polynomials of the Cartesian products of a complete graph Kt with another complete graph Kr, a star graph Sr, a complete bipartite graph Kr,s, a wheel Wr, and a path graph Pr are obtained in this paper. The n-diameters and the n-Wiener indices of Kt×Kr, Kt×Sr, Kt×Kr,s, Kt×Wr and Kt×Pr are also obtained.
https://csmj.mosuljournals.com/article_163802_7ccb6c74389e2c27c3f8fb85e920a1a9.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
117
128
10.33899/csmj.2009.163802
n-distance
n-diameter
n-index
n-Wiener polynomial
Ali
Ali
aliazizali1933@yahoo.com
true
1
Academic Professor
University of Mosul, Mosul, Iraq
Academic Professor
University of Mosul, Mosul, Iraq
Academic Professor
University of Mosul, Mosul, Iraq
AUTHOR
Haveen
Ahmed
haveenagali@gmail.com
true
2
College of Science
University of Dohuk
College of Science
University of Dohuk
College of Science
University of Dohuk
AUTHOR
ORIGINAL_ARTICLE
Joint Numerical Range of Matrix Polynomials
Some algebraic properties of the sharp points of the joint numerical range of a matrix polynomials are the main subject of this paper. We also consider isolated points of the joint numerical range of matrix polynomials.
https://csmj.mosuljournals.com/article_163803_a70683b5098f8f1306d0dab37c95f33a.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
129
136
10.33899/csmj.2009.163803
joint numerical range
matrix polynomial
sharp points
Ahmed
Sabir
true
1
College of Sciences
University of Salahaddin
College of Sciences
University of Salahaddin
College of Sciences
University of Salahaddin
AUTHOR
ORIGINAL_ARTICLE
Efficient Genetic Algorithms for Arabic Handwritten Characters Recognition
The main challenge in Arabic handwritten character recognition involves the development of a method that can generate descriptions of the handwritten objects in a short period of time high recognition rate. Due to its low computational requirement, genetic algorithm is probably the most efficient method available for character recognition. In this research we use objective of genetic algorithm where the minimization of the number of features and a validity index that measures the quality of clusters have been used to guide the search towards the more discriminate features and the best number of clusters, and use Hopfield Neural Network as recognizer.
In this research Arabic handwritten characters recognition is applied. Experiments show the efficiency and flexibility of the proposed system, and show that Genetic Algorithm (GA) and Hopfield neural network are applied here to improve the recognition accuracy and make the recognition operation faster.
https://csmj.mosuljournals.com/article_163804_3fc226996f9680e49f27f3f502a1da3b.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
137
157
10.33899/csmj.2009.163804
Arabic handwritten characters recognition
Genetic Algorithm (GA)
Feature Extracted
Feature Selection
Hopfield Neural Network
Laheeb
Ibrahim
true
1
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
AUTHOR
ORIGINAL_ARTICLE
A Hybrid Ant Colony Optimization Algorithm to Solve Assignment Problem by Hungarian Method
This research studied ant colony optimization with optimization problem as an assignment model problem by Hungarian method. The proposed heuristic algorithm simulate ant colony optimization algorithm with Hungarian method for Assignment problem. The ant colony optimization algorithm simulates the behavior of real ant colony, to find the shortest path between many paths for solving the problem. It dependent on the path from the nest (problem of research) to food (optimal solution) by deposited pheromone on the path they take between the nest and food, so that other ants can smell it.
The experiment in this research shows that the algorithm provides optimal solution. It has outperforms with computation and it is an effective approach and the algorithm performs significantly better than the classical method, to reduce the region of the space considered and computation as compared to the classical methods.
https://csmj.mosuljournals.com/article_163805_9cecd4dc5618fea166b710535fb67b57.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
159
175
10.33899/csmj.2009.163805
Ant Colony Algorithm
Assignment Problem
Ruqaya
Sha’ban
israalkallak19@gmail.com
true
1
Computer Unit
College of Medicine
University of Mosul, Mosul, Iraq
Computer Unit
College of Medicine
University of Mosul, Mosul, Iraq
Computer Unit
College of Medicine
University of Mosul, Mosul, Iraq
AUTHOR
ORIGINAL_ARTICLE
Linear Codes Arise From New Complete (n,r)-arcs in PG(2,29)
This paper presents the recently-discovered linear [n,3,d] codes over PG(2,29) that arises from a complete (n,r)-arcs which the paper[12] presented it for the first time. The aim of this paper is to formulate the recently discovered upper bounds and lower bound for (n,r)-arcs as bounds that will look familiar to coding theorists.New two lists in this paper appeared, the first list of 15 codes arranged from[164,3,156]-code up to [704,3,678]-code, the second list of 27 codes arranged from [28,3,25]-code up to [776,3,747]-code, they are appeared for the first time in this paper, all of these codes we can call them as complete codes as thier definition in this paper, they belong to the class of error-correcting codes (ECC).In this paper I made a computer programs to construct these new codes with Random Greedy Construction method (RGC) which is mentioned in [13].
https://csmj.mosuljournals.com/article_163806_a0451983a93473825aec694779145e54.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
177
184
10.33899/csmj.2009.163806
linear code
complete arc
finite field
Error-correcting codes
(n
r)-arcs
Shuaa
Aziz
true
1
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
AUTHOR
ORIGINAL_ARTICLE
Cryptanalysis Knapsack Cipher Using Artificial Immune System
In this work, the use of an artificial immune system (AIS ) in cryptanalysis is explored. This AIS uses the clonal selection principle for the cryptanalysis of knapsack cipher. Results showed that the proposed approach is good especially when the effect of the control parameters on the performance of the clonal selection is well taken into consideration. The program is written in Turbo C.
https://csmj.mosuljournals.com/article_163807_00116a456cffca0e3347339cbc245f79.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
185
195
10.33899/csmj.2009.163807
Artificial immune system (AIS)
Cryptanalysis
knapsack cipher
Turbo C
Eman
Al-Obaidy
true
1
Veterinary Medicine College
University of Mosul, Iraq
Veterinary Medicine College
University of Mosul, Iraq
Veterinary Medicine College
University of Mosul, Iraq
AUTHOR
ORIGINAL_ARTICLE
A Generalization of Von Neumann Regular Rings
In this paper, we introduce a new ring which is a generalization of Von Neumann regular rings and we call it a centrally regular ring. Several properties of this ring are proved and we have extended many properties of regular rings to centrally regular rings. Also we have determined some conditions under which regular and centrally regular rings are equivalent.
https://csmj.mosuljournals.com/article_163808_e7c4a493853404ce6b3f9ac88cbd3403.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
197
210
10.33899/csmj.2009.163808
regular rings
centrally regular rings
indecomposable
multiplicative system
Jacobson Radical
Adil
Jabbar
true
1
College of Sciences
University of Sulaimani
College of Sciences
University of Sulaimani
College of Sciences
University of Sulaimani
AUTHOR
ORIGINAL_ARTICLE
Face Recognition using Artificial Intelligent Techniques
Face recognition is considered one of the visual tasks which humans can do almost effortlessly while for computers it is a difficult and challenging task. This research deals with the problem of face recognition. A novel approach is presented for both face feature extraction and recognition, first, we introduce Principal Component Analysis (PCA) for face feature extraction, Generalized Regression Artificial Neural network for face recognition. The performance of the whole system was done after training with 120 color images (40 human faces with 3 poses) and testing using 40 color images. The images were taken from Collection of Facial Images: Faces95 by Computer Vision Science Research Projects. Experimental results for proposed human face recognition confirm that the proposed method lends itself to good extraction and classification accuracy relative to existing techniques.
https://csmj.mosuljournals.com/article_163809_1b0a30f125a61e20c8288edee3a9f674.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
211
227
10.33899/csmj.2009.163809
Face Recognition
Artificial Intelligent techniques
Laheeb
Ibrahim
true
1
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
AUTHOR
Ibrahim
Saleh
i.hadedi@gmail.com
true
2
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
AUTHOR
ORIGINAL_ARTICLE
Artificial Intelligent Techniques with Watermarking
This research presents three robust blind watermarking algorithms in the discrete wavelet transform and spatial domain based on neural network and fuzzy logic artificial intelligent techniques. To enhance the performance of the watermarking system the first algorithm is developed by combining Radial Basis Function (RBF) neural network with Discrete Wavelet Transform (DWT) using (DWT-RBFW) algorithm for embedding and extracting of watermark. The second developed (RBFW) algorithm used RBF neural network for embedding and extracting of watermark based on intensity of whole image. The third developed (FL-EXPW) watermarking method is based on fuzzy logic and expert system techniques and it’s the best algorithm among the three methods. The developed watermarking algorithms are robust against various attacks signal processing operations such as additive noise and jpeg compression, and geometric transformations.
https://csmj.mosuljournals.com/article_163810_ced1119fb67e9f722151ed7b0f0a40c1.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
229
266
10.33899/csmj.2009.163810
Watermarking system
Artificial Intelligent techniques
fuzzy logic
Artificial Neural Network
Nada
Saleem
nada_n_s@uomosul.edu.iq
true
1
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
AUTHOR
Baydaa
Khaleel
baydaaibraheem@uomosul.edu.iq
true
2
College of Computer Sciences and Mathematics
University of Mosul
College of Computer Sciences and Mathematics
University of Mosul
College of Computer Sciences and Mathematics
University of Mosul
AUTHOR
Shahbaa
Khaleel
shahbaaibrkh@uomosul.edu.iq
true
3
College of Computer Sciences and Mathematics
University of Mosul
College of Computer Sciences and Mathematics
University of Mosul
College of Computer Sciences and Mathematics
University of Mosul
AUTHOR
ORIGINAL_ARTICLE
Using the Update of Conditional BFGS in Constrained Optimization
In this paper, we have used one of the preconditioned conjugate gradient algorithm with the Quasi – Newton approximation; namely the BFGS preconditioned algorithm which was suggested by (AL-Bayati and Aref, 2001). In this paper we have suggested a new algorithm for constrained optimization with robust numerical results, for solving constrained optimization problems.
https://csmj.mosuljournals.com/article_163812_35e255c242f321b9c8a3a356273d4a6e.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
11
20
10.33899/csmj.2009.163812
constrained optimization
QN-Condition
BFGS Update
Abbas
Al-Bayati
profabbasalbayati@yahoo.com
true
1
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Mosul, Iraq
AUTHOR
Ban
Mitras
dr.banah.mitras@gmail.com
true
2
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
College of Computer Sciences and Mathematics
University of Mosul, Iraq
AUTHOR
ORIGINAL_ARTICLE
Stability Analysis of Convection & Diffusion equation
The Stability Analysis of Convection& Diffusion 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 solution is always stable and in the second case the solution is conditionally stable .
https://csmj.mosuljournals.com/article_163813_91b568d72479615321ea7f1b8515801e.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
21
31
10.33899/csmj.2009.163813
Stability Analysis
Convection& Diffusion equation
Saad
Manna
true
1
College of Computer Science
and Mathematics, University of Mosul
College of Computer Science
and Mathematics, University of Mosul
College of Computer Science
and Mathematics, University of Mosul
AUTHOR
Badran
Salem
true
2
College of Computer Science and Mathematics, University of Mosul
College of Computer Science and Mathematics, University of Mosul
College of Computer Science and Mathematics, University of Mosul
AUTHOR
ORIGINAL_ARTICLE
Discrimination Features by Wavelet Transformation
Recently, techniques and applications in space data processing it's and study characteristics in different areas and applications such as remote sensing study of land use, land cover and geological applications are increased.
The research contained study and application of technical wavelet transformation to highlight information packages statement space for Mosul Dam and extracting ground obvious manifestations of this region by applying the classification on the wave beam generated.
The results showed that the classification of images resulting from the wavelet transformation was accurate and of high amount (%96.715) compared to the results of the classification of non-original images using the improved wavelet transformation, with the accuracy of the classification (%92.652) and to obtain a clear picture parameters for the study of high quality. especially when discrimination features such as terrestrial lake, the body of dams and residential areas in addition to discrimination agricultural areas, the classification algorithm, which was used in this study, is an algorithm of Mahalanobis Distance.
https://csmj.mosuljournals.com/article_163814_92caa586877490935e0b0f7a3425610a.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
33
46
10.33899/csmj.2009.163814
Discrimination Features
Wavelet transformation
Algorithm of Mahalanobis Distance
Faten
Mustafa
true
1
Remote Sensitivity Center
Remote Sensitivity Center
Remote Sensitivity Center
AUTHOR
Turkan
Khalil
true
2
College of Engineering
University of Mosul
College of Engineering
University of Mosul
College of Engineering
University of Mosul
AUTHOR
Almas
Khalil
true
3
College of Basic Education
College of Basic Education
College of Basic Education
AUTHOR
ORIGINAL_ARTICLE
Remove Noise from Grayscale Digital Images by Traditional and Fuzzy Filters
Image denoising and enhancement is an important field and it is used very much in image processing, where images are corrupted by many kinds of noise, therefore, methods and techniques must be used to remove these noises. In this research seven traditional filters are used to remove noise from digital images corrupted with salt&pepper noise and Gaussian noise. And also adopting principle of fuzzy logic to hybrid between traditional filters and fuzzy logic using double bell shaped membership function and also hybrid with double adjusted sigmoid membership function to create seven fuzzy sigmoidal filters. After applying seven traditional methods, seven fuzzy bell methods and seven fuzzy sigmoidal methods , by using measures of restored image PSNR, MSE, MAE , shows the final methods i.e. seven fuzzy sigmoidal methods are better than other filters i.e. methods that are used in this research after comparing the results.
https://csmj.mosuljournals.com/article_163815_ea4e83d1261dbf4741589813875bd128.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
47
100
10.33899/csmj.2009.163815
image processing
Noise
fuzzy logic
sigmoid membership function
Baydaa
Khalil
true
1
College of Computer Science and Mathematics
University of Mosul, Iraq
College of Computer Science and Mathematics
University of Mosul, Iraq
College of Computer Science and Mathematics
University of Mosul, Iraq
AUTHOR
ORIGINAL_ARTICLE
Flow Stability Analysis of the Shallow Water Equations Model
This paper is devoted to analyze the stability of shallow water of a system of equations that was exposed to disturbancing. This analysis is done by finding the eigenvalues of the system which enables us to investigate the grow of disturbance after setting shallow water equations in linearization form. It is obtain from the results analysis that the equations are stable when the real part of wave velocity is negative ,and unstable when it is positive.
https://csmj.mosuljournals.com/article_163816_2298c90e450d4e5acffd5fc3ba6e6c10.pdf
2009-07-01T11:23:20
2020-06-01T11:23:20
101
118
10.33899/csmj.2009.163816
flow
Stability Analysis
shallow water equations model
Ashraf
Aboudi
true
1
College of Computer Science and Mathematics
University of Mosul, Iraq
College of Computer Science and Mathematics
University of Mosul, Iraq
College of Computer Science and Mathematics
University of Mosul, Iraq
AUTHOR