Volume 8, Issue 1, Spring 2016, Page 1-153


On a Completion of Fuzzy Measure

Noori F. Al- Mayahi; Bassam S. Hashem

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 1-4

In this paper, we introduce some properties in completeness of fuzzy measure and we get some relations between them.

On Coc- Dimension Theory

Raad Aziz Hussain; Wrood Hasan Hweidee

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 5-13

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.

On training Neural Network To Solve Some Class of Boundary Value Problems

Alaa Kamel Jaber

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 14-24

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.

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

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 25-42

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.

Coc-b-connected spaces

Raad Aziz Hussain; Ghadeer khudhair obayes

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 43-49

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.

On coc-coercive function

Saied A. Johnny; Hashmiya I. Naser

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 50-53

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.

Strongly Goldie Extending Modules

Tha; ar Younis Ghawi

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 54-66

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.

Solving Singular Perturbed Boundary Value Problems By using Semi-Analytic Method

Khalid. Mindeel. M. Al-Abrahemee

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 67-77

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.

Topological study via σ-algebra

Yiezi kadham Al-talkany; Ameer A.J. AL-Swidi; Ali Younis Shaker

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 78-82

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 .

On Soft Generalized Continuous mappings

Sattar Hameed Hamzah; Samer Adnan jubair

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 83-92

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.

Applications of the B-SPLINE Surfaces

Evan Madhi Hamzh

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 93-106

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

Fuzzy RED to Reduce Packet Loss in Computer network

Khulood. A. Nassar; Ammar. A. Abdullah

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 107-114

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

Assessing Attributes to Software Resources for minimize the Development Life Cycle

Rafid Nabil Jaffar

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 115-124

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.

VHDL & FPGA Implementation of Max Membership Principle Based on Defuzzifier Unit

Ahmed Chalak Shakir

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 125-136

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.

Utilizing Parametric and Non-Parametric methods in Black-Scholes Process with Application to Finance

Muhannad F. Al-Saadony

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 145-153

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.

Image Steganography by Using Exploiting Modification Direction and Knight Tour Algorithm

ZEYAD SAFAA YOUNUS ALSAFFAWI

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 1-11

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.

Estimation of Multivariate Linear Regression Parameters Using Robust Methods (Comparison Study)

Jubran A. Khuttar; Gorgeas Shaheed Mohammad; Mohammad Salim Ismail

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 12-21

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.

The Technique of Robust – Loess in Regression Analysis

ZAINB HASSAN RADHY

Journal of Al-Qadisiyah for Computer Science and Mathematics, Volume 8, Issue 1, Pages 22-27

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.