http://journals.uokufa.edu.iq/index.php/jkmc/issue/feedمجلة الكوفة للرياضيات الحاسبات| Journal of Kufa for Mathematics and Computer2017-05-23T07:03:52+00:00Asst.Prof. Abdulhamza hamzaAbdulhamza.hamza@uokufa.edu.iqOpen Journal SystemsJournal of Kufa for Mathematics and Computer aims to publish original research papers and survey articles in all areas of Mathematics, Statistics and Computer Science.http://journals.uokufa.edu.iq/index.php/jkmc/article/view/5851The Rational Valued Characters Table of the group Q2p×D4 when p is a Prime Number2017-05-23T06:51:28+00:00Prof.Naseer Rasool Mahmoodalaa_alnajim@yahoo.comNaba Hasoon Jabiralaa_alnajim@yahoo.comThe main purpose of this paper is to find the rational valued characters table of the group Q2p×D4 when p is a prime number, which is denoted by ≡*(Q2p×D4), where Q2p is denoted to quaternion group of order 4p, such that for each positive integer p, there are two generators x and y for Q2p satisfies Q2p={xh yk, 0 , k=0,1}which has the properties x2p=y4=I, yxry-1=x-r and D4 is the dihedral group of order 8 is generate by a rotation r of order 4 and reflection s of order 2. The eight elements of D4 can be written as: {I*,r,r2,r3,s,sr,sr2,sr3}with properties srks = r-k, k = 0,1,2,32017-05-22T18:36:45+00:00Copyright (c) 2017 مجلة الكوفة للرياضيات الحاسبات| Journal of Kufa for Mathematics and Computerhttp://journals.uokufa.edu.iq/index.php/jkmc/article/view/5852Some Combinatorial Results on the Factor Group K (G)2017-05-23T06:51:28+00:00Manal Najy Yagoobalaa_alnajim@yahoo.comAhmed Abed Ali Omranalaa_alnajim@yahoo.comcharacter matrix ( ) from the character table of and finding the invariant factors of this matrix, the primary decomposition of the factor group where is determined. Also, we found the general form of this decomposition for p>=22017-05-22T18:36:45+00:00Copyright (c) 2017 مجلة الكوفة للرياضيات الحاسبات| Journal of Kufa for Mathematics and Computerhttp://journals.uokufa.edu.iq/index.php/jkmc/article/view/5854Formal model and Policy specification for software defined networks2017-05-23T06:51:28+00:00DAWOOD SALMAN JASIM AL-FARTTOOSIalaa_alnajim@yahoo.comSoftware-defined networking SDN is gaining a sharp increase in adoption by very well-known companies Like Google and Microsoft. Currently, the two stands out reliability and security are the most issues that hampering the SDN rapid growth. This paper aims to contribute to this growing area of research by exploring the SDN security issues. Novel approach will be proposed by utilizing the well-known access control approach called theusage control UCON model and also the Flog policy language of software defined networks SDNs. This work will be produced as a formal modelling via high-level abstract language like Flog2017-05-22T18:36:45+00:00Copyright (c) 2017 مجلة الكوفة للرياضيات الحاسبات| Journal of Kufa for Mathematics and Computerhttp://journals.uokufa.edu.iq/index.php/jkmc/article/view/5858Enabling a Secure Match over Private Image Collections2017-05-23T06:51:28+00:00Ayad Ibrahim Abdulsadaalaa_alnajim@yahoo.comHesham Saleh Ridhaalaa_alnajim@yahoo.comHameed Abdul-kareem Younisalaa_alnajim@yahoo.comImage matching, Secure Multiparty Computing (SMC), SURF descriptors, Homomorphic encryption2017-05-22T18:36:45+00:00Copyright (c) 2017 مجلة الكوفة للرياضيات الحاسبات| Journal of Kufa for Mathematics and Computerhttp://journals.uokufa.edu.iq/index.php/jkmc/article/view/5859An Efficient Algorithm for Initializing Centroids in K-means Clustering2017-05-23T06:51:28+00:00Dr. Ahmed Hussain Aliwyalaa_alnajim@yahoo.comDr. Kadhim B. S. Aljanabialaa_alnajim@yahoo.comClustering represents one of the most popular knowledge extraction algorithms in data mining techniques. Hierarchical and partitioning approaches are widely used in this field. Each has its own advantages, drawbacks and goals. K-means represents the most popular partitioning clusteringtechnique, however it suffers from two major drawbacks; time complexity and its sensitivity to the initial centroid values. The work in this paper presents an approach for estimating the starting initial centroids throughout three process including density based, normalization and smoothing ideas. The proposed algorithm has a strong mathematical foundation. The proposed approach was tested using a free standard data (20000 records). The results showed that the approach has better complexity and ensures the clustering convergence.2017-05-22T18:36:45+00:00Copyright (c) 2017 مجلة الكوفة للرياضيات الحاسبات| Journal of Kufa for Mathematics and Computerhttp://journals.uokufa.edu.iq/index.php/jkmc/article/view/5860A Robust Approach for Mixed Technique of Data Encryption Between DES and RC4 Algorithm2017-05-23T06:51:28+00:00Tameem Hameed Obaidaalaa_alnajim@yahoo.comDhafar Hamed Abdalaa_alnajim@yahoo.comIn this research, the well-known encryption algorithms in the encryption Systems, namely DES & RC4 and the advantages and disadvantages of each algorithm are reviewed and evaluated. These two algorithms are combined to produce of new algorithm which is more efficient unscrambling due to the increasing of the level of complexity that make it highly resistance to several attacks. The new algorithm is implemented to show its efficiency in term of time complexity, (i.e. Breaking the code will be much more complicated than if it would have been occurring through the use of each algorithm individually), this process can be achieved with a very small time difference (approximately neglected in the encryption process(. When this algorithm is applied and tested in practice the following result has been obtained: When a block is encrypted using the DES algorithm, the time spent may be (0.000034) milliseconds, but when using the new algorithm to encrypt the same block, the time taken will be about (0.000042) milliseconds. To encrypt 1024 blocks using the DES algorithm, it will take a time of (0.0406),while by using the new algorithm the time taken for encryption is only (0.051). This gives very little increase in time compared to increasing of complexity obtained. Since the new algorithm combining from the two previous, ones allows us to encrypt each block with a key differs from the other one (i.e. each block is encrypted with a different key depending on the preceding block), making it very difficult to break the code leading to an increase in security and information protection against decoding.2017-05-22T18:36:46+00:00Copyright (c) 2017 مجلة الكوفة للرياضيات الحاسبات| Journal of Kufa for Mathematics and Computerhttp://journals.uokufa.edu.iq/index.php/jkmc/article/view/5864He is variational iteration method to approximate time fractional wave non linear like equation with variable coefficient2017-05-23T07:03:52+00:00Abeer Majeed Jasimalaa_alnajim@yahoo.comIn this paper, we will consider variationaliteration method (VIM) for solvingtime fractional non linear wave like with variable coeffcient. In this method we usean approximate value for time fractional derivativewhen find Lagrange multiplier.Three examples show theefficiency and the importance of the method2017-05-23T07:03:10+00:00Copyright (c) 2017 مجلة الكوفة للرياضيات الحاسبات| Journal of Kufa for Mathematics and Computer