2022-08-11T14:09:48Z
https://csm.iraqjournals.com/?_action=export&rf=summon&issue=6856
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
On a Completion of Fuzzy Measure
Noori
F. Al- Mayahi
Bassam
S. Hashem
In this paper, we introduce some properties in completeness of fuzzy measure and we get some relations between them.
Fuzzy measure
null set
countably weakly null
additive fuzzy measure
2016
06
01
1
4
https://csm.iraqjournals.com/article_112444_8c4d7c2041e2dc9cedba43aefa07b996.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
On Coc- Dimension Theory
Raad
Aziz Hussain
Wrood
Hasan Hweidee
In this paper we introduce and define a new type on coc-dimension theory. The concept of indX,IndX,dimX, for a topological space X have been studied. In this work, these concepts will be extended by using coc-open sets.
coc
open
ind X
Ind X
and coc
dim
2016
06
01
5
13
https://csm.iraqjournals.com/article_112445_6779ea816db4163e59d3f21820c3db1e.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
On training Neural Network To Solve Some Class of Boundary Value Problems
Alaa
Kamel Jaber
The aim of this paper is to train feed forward neural network for solving some class of boundary value problems for ordinary differential equations. Using backpropagation training algorithm, where the Levenberg – Marquardt training algorithm is used to train the network .The existence of the proposed solution was proved. The suggested networks have been studied intensively for a few decades and have provided an option for modeling complex systems. Therefore this option was utilized to reduce the computation of solution, and finally the method is demonstrated through illustrative examples.
differential equations
Boundary Value Problems
Feed Forward Neural Network
2016
06
01
14
24
https://csm.iraqjournals.com/article_112674_4f402fc7a24b9d6d913d966e584ef6de.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
The Cyclic decomposition and the Artin characters table of the group (Q2m Cp) when m=2h , h ∈ Z+ and p is prime number
Rajaa
Hassan Abass
The main purpose of this paper, is determination of the cyclic decomposition of the abelian factor group AC(G) = (G)/T(G) where G = Q2m×Cp when m=2h , h ∈ Z+ and p is prime number (the group of all Z-valued characters of G over the group of induced unit characters from all cyclic subgroups of G).
We have found that the cyclic decomposition AC(Q2m×Cp) depends on the elementary divisor of m as follows.
if m = 2 , h any positive integer and p is prime number, then:
AC( Q2m×Cp) =
We have also found the general form of Artin's characters table of Ar(Q2m×Cp) when m=2h , h ∈ Z+ and p is prime
number.
2016
06
01
25
42
https://csm.iraqjournals.com/article_112675_41643746ba08cedcb9e3289744c3c8a1.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
Coc-b-connected spaces
Raad
Aziz Hussain
Ghadeer
khudhair obayes
We introduce and study the recall the notion of coc-b-connected space. And we prove many of the proposition and remarks which are related to it. And we discuss the definition of coc-b-locally connected, remarks and proposition about this concept . This study presents the definition of hyper connected by coc-b-open set. Also we give some proposition and remarks about this subject and give some important generalizations on this concept and we prove some results on the concept.
2016
06
01
43
49
https://csm.iraqjournals.com/article_112676_b5b61d3ba0cc0079c8a9b0f8edce5918.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
On coc-coercive function
Saied
A. Johnny
Hashmiya
I. Naser
In this paper , we use the concept of coc-closed and coc-compact sets to construct a new type of functions which is coc-coercive function and investigate the properties of this concept.
coc
open
closed
compact space
Hausdorff
cluster point
continuous function
compact function and ccoc
coercive function
2016
06
01
50
53
https://csm.iraqjournals.com/article_112677_6e9bf2cec236973d56be3c9ea15c4240.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
Strongly Goldie Extending Modules
Tha
ar
Younis Ghawi
A submodule N of a right R-module M is said to be strongly large in case for any m∈M, s∈R with ms≠0, there exists an r∈R such that mr∈N and mrs≠0. In this paper, we introduce strongly G-extending modules which are particular G-extending modules, and investigate their properties and characterizations. An R-module M is called strongly G-extending if for each submodule X of M there exists a direct summand D of M such that X∩D is strongly large in both X and D. Some sufficient conditions for a direct sum of strongly G-extending modules to be strongly G-extending are obtained. Examples to illustrate this concept are given.
Strongly large submodules
closed submodules
Strongly extending modules
extending modules
Strongly G
2016
06
01
54
66
https://csm.iraqjournals.com/article_112678_b08fec5965bd7feb8f536233b185127f.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
Solving Singular Perturbed Boundary Value Problems By using Semi-Analytic Method
Khalid.
Mindeel. M. Al-Abrahemee
In this paper, we suggest sufficied a method for solving a class of singularly perturbed boundary value problems (SPPBVP). The method is proposed the semi analytic, modest problem preparation and ready computer implementation. That is, we concerned with constructing polynomial solutions to two point second order of singularly perturbed problems of ordinary differential equation. A semi-analytic technique using two-point osculatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0,1]. Numerical linear and non linear examples are given to illustrate the method. It is observed that the present method converges to the exact solution very well.
Singular perturbation problems
Two
point boundary
value problems
Osculatory interpolation
2016
06
01
67
77
https://csm.iraqjournals.com/article_112679_d8fa60f3a57d984ac14bc7eecc890495.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
Topological study via σ-algebra
Yiezi
kadham Al-talkany
Ameer
A.J. AL-Swidi
Ali
Younis Shaker
in this research we want to study some of theTopological definitions and theorems by using the concept of σ -algebra. In this paper we define the continuity and separation axioms with respect to this concept .
algebra
supra topology
supra continuous function
continuous
2016
06
01
78
82
https://csm.iraqjournals.com/article_112680_4cc2c747ab898d51ed27db30a4afb3b5.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
On Soft Generalized Continuous mappings
Sattar
Hameed Hamzah
Samer
Adnan jubair
In this work ,we study the soft generalized continuous mapping in soft topological spaces and investigate the properties of the restriction , composition and product of this mappings. Also ,we define and investigate the properties of soft strongly generalized continuous and soft generalized irresolute mappings and explain a relationships among these mappings.
soft set
soft topological spaces
soft generalized closed set
soft continuous mapping
soft strongly mapping
soft irresolute mapping
2016
06
01
83
92
https://csm.iraqjournals.com/article_112681_edc4239689ca711402054405a252bdbe.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
Applications of the B-SPLINE Surfaces
Evan
Madhi Hamzh
The paper describes the fundamental notions cognate to the Spline and B-Spline curves and surfaces for the purport of their utilization in applications of obnubilated signs perception. By utilizing B-spline surfaces, one can establish identification algorithms of the obnubilated sources, by designates of their application together with kenned field techniques. Furthermore, these are largely utilized in computerized graphics for modelling and design, as they have many geometrical and calculable properties
2016
06
01
93
106
https://csm.iraqjournals.com/article_112682_0108be767b1163b55188346d045ef61e.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
Fuzzy RED to Reduce Packet Loss in Computer network
Khulood.
A. Nassar
Ammar.
A. Abdullah
Congestion is the most important and greatest challenge that facing the transmission of data packets process. There are many sites, it is possible that the network congestion occurs as network devices (e.g. routers and switches, etc...) as well as transmission medium between network devices. There are a numerous of mechanisms to control congestion in routers. Random early detection algorithm (RED) is one of the most known mechanisms of control on the routers queues in order to reduce the proportion of the loss of packets. Random Early Detection algorithm is considered one of the active queue management. This paper uses random early detection algorithm to control the queues routers where the queues has been controlled by one of intelligent methods (fuzzy logic). The proposed method has used four parameters, which are the length of the queue rate, the rate of change in the queue and the rate of delay as inputs for fuzzy system and the dropping probability as output. The practical part has been done using object-oriented programming
Active Queue Management
Congestion Control
Fuzzy Logic Control
RED algorithm
Fuzzy RED
2016
06
01
107
114
https://csm.iraqjournals.com/article_112683_8965da4d7ca1f9e1a6b86f7d4a41faa2.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
Assessing Attributes to Software Resources for minimize the Development Life Cycle
Rafid
Nabil Jaffar
The Component-Based Software Engineering (CBSE), approach emphasize on acquisition and integration of components to accomplish complex and large-scale software solutions. The benefits from using a CBSE approach include, system quality improvement, shorter time-to-market, and improved management of complexity of software. However, the focus of development move to issues like selection, integration, evaluation and evolution of components in the system. Underestimating the technical risks associated with selection, evaluation, and integration of software components can result in long schedule delays and high development/maintenance cost.
This paper introduces basic concepts of CBSE and Commercial-Off-The-Shelf, COTS, components. Driving factors for the use of COTS components are presented together with potential benefits and key issues to consider in order to successfully adapt to a CBSE approach. The intent is also to point out possible risks that are typically not present when developing traditional, and not use CBSE for software systems. Specifically the basic CBSE issues of system reliability, development process, and real-time system development are presented.
Reuse Software
COTs
Component Based Software Engineering
Reliability of Reuse
Real
Time Systems
2016
06
01
115
124
https://csm.iraqjournals.com/article_112684_cc34c1ec5e67e1e8f2ecace6e2938b99.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
VHDL & FPGA Implementation of Max Membership Principle Based on Defuzzifier Unit
Ahmed
Chalak Shakir
the fuzzy data that obtained from the fuzzification process is not appropriate for the real time applications and have to be converted into crisp form. The conversion of data from fuzzy form to crisp form is known as the defuzzification, also called as "rounding off". This paper proposes VLSI architecture of a Max Membership Principle (MMP) defuzzification method. The MMP of defuzzification is simple and is being generally used in comparison to more complex weighted average defuzzification method. The proposed architecture has been modeled in VHDL and implemented in XILINX and Spartan - 3 field programmable gate arrays (FPGA). It is more efficient in the area and the speed of operation in comparison to a more complex architecture used for the weighted average method. The functional analysis has revealed that the proposed architecture is implementing MMP based defuzzifier efficiently and accurately.
Defuzzification
Fuzzy processor
Max Membership Principle
low power
VLSI design
2016
06
01
125
136
https://csm.iraqjournals.com/article_112685_c9bd86598d137f7a36f3947eec5cc386.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
Derivation of bayesian risk approximation to selecting the odd median
Kawther
Fawzi Hamza
We introduce in this paper, approximation functional for stopping risk by Bayesian procedure(prior and posterior) distribution for selecting odd median multi- category multinomial distribution using functional analysis
approximate
ranking and selection approach
prior and posterior dis
nomial dis
2016
06
01
137
144
https://csm.iraqjournals.com/article_112686_afdd3b8ec1395e7bc3a9d5f6dc35568d.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
Utilizing Parametric and Non-Parametric methods in Black-Scholes Process with Application to Finance
Muhannad
F. Al-Saadony
In this article, we present that Black-Scholes process is a famous formula in financial mathematics. Our aim is to study the behavior of stochastic parameters in that model with application to Financial Time Stock Exchange FTSE100 Index. We use some parametric (Maximum likelihood, and Unbiased and Efficient) and nonparametric (Penalized least Squares, with different functions for the drift and diffusion coefficients and generally the Black-Scholes process) methods. Moreover, we study the change-point estimation for FTSE100 Index in order to determine these changes, and effects on the behavior of the Black-Scholes process.
Black
Scholes Process
Parametric method
non
parametric method
Change
point estimation
FTSE
2016
06
01
145
153
https://csm.iraqjournals.com/article_112687_8e555b7509162cee109d800686f88277.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
Image Steganography by Using Exploiting Modification Direction and Knight Tour Algorithm
ZEYAD
SAFAA YOUNUS ALSAFFAWI
In this study, a new technique for information hiding have been proposed by using Exploiting Modification Direction (EMD) technique and enhanced it by using Knight Tour algorithm for embedded the information within the image and by using LZW for encrypt and compress the secret message. In this technique, LZW have been used for the purpose of encrypted, compressed and transformed the characters of secret message into stream of bits for the purpose of protect and reduce the size of the message. In the next step, the EMD technique and Knight tour algorithm have been used to embed the secret digits where the cover image is segmented into groups. Each group have 4 pixels. Afterward, the image is segmented into blocks size (4*4) group for each block. The (2n+1)-ary notational system is used to represent the secret digits for the message that embedded within image. To increase the robustness and the security for the proposed method the Knight tour algorithm is used to select which group can be used to hide the secret digit. Where, one secret digit is embedded by modifying one gray-scale value for the particular pixel inside the group by using EMD technique. Afterward, the statistical attacks by using x2 method is applied on the stego image to assess the robustness of the proposed method against the attacks. The experimental results have depicted that the PSNR and the Payload of proposed method is better than the previous methods that used in Steganography.
LZW
2016
06
01
1
11
https://csm.iraqjournals.com/article_112688_6dafabbc0867a569bd29964e8d4202ba.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
Estimation of Multivariate Linear Regression Parameters Using Robust Methods (Comparison Study)
Jubran
A. Khuttar
Gorgeas
Shaheed Mohammad
Mohammad
Salim Ismail
In this paper In this Thesis has been use several robust methods – less sensitivity with outliers values – to estimate parameters matrix. These were compared by using criterion mean square random error by relying on simulation to get the data. Data mimic the reality and on which the comparison of methods is built. It was generated two kinds of variables: non-contaminated natural variables, contaminated natural variables from two sides. It was reached through the comparison between the results of the three methods. That data in the case of non-polluting match the results of the three robust methods. As in the case of polluting data, the suggested method - which has been assumed a constant cutoff value suggested for it - often give best results of two way methods: Estimate of minimum covariance determinate (MCD) & (MCD) re-Weight.
2016
06
01
12
21
https://csm.iraqjournals.com/article_112689_cd14b68ef3af671e70c32e150dece28d.pdf
Journal of Al-Qadisiyah for Computer Science and Mathematics
2074-0204
2074-0204
2016
8
1
The Technique of Robust – Loess in Regression Analysis
ZAINB
HASSAN RADHY
In this paper the robust-loess method is used to estimate the nonparametric regression function. The Loess is non-robust method and used in case of outliers where it bases on the less squares in regression which affects by presence of outliers. In this paper, the robust-loess has been implemented through applying the last absolute residuals and bi-square techniques which enhanced robustness to the weighted least squares in loess.
2016
06
01
22
27
https://csm.iraqjournals.com/article_112690_5e997f5f8e553a791324b8a9c08640ab.pdf