Table of content

Journal of Kufa for Mathematics and Computer

مجلة الكوفة للرياضيات والحاسوب

ISSN: 11712076
Publisher: University of Kufa
Faculty: Mathematics and Computer Science
Language: Arabic and English

This journal is Open Access

About

Description of The Journal
The Journal is one of the major contribution to the Scientific Research Programmes at University of Kufa. It is published by Faulty of Mathematics and Computer Sciences at the University of Kufa.
The Journal is mainly concern with publications of a high quality researches that meet the publication conditions in a specialist of Mathematics and Computing. It is quarterly journal, to include two numbers during a year (paper and electronic).
The journal release its first issue successfully in April 2010, followed by four other numbers that contain several papers submitted for publication, of which many papers presented and accepted by our first scientific conference held by our faculty, entitled “Recent Trends in Information Technology and Mathematics for the period 13-14 April 2011 .
The last number V is dedicated to papers presented and accepted at our second scientific research conference, entitled “The First International Scientific Conference for Information Technology , Telecommunications and E-learning for the period 24 – 25 April 2012. The Conference is held by our faculty in co-operation with College of Education for Girls and College for Education, and Research Centre for Information Rehabilitation.

Loading...
Contact info

الهاتف الخاص بالمجلة/07601504330
magazine.csm@uokufa.edu.iq البريد الالكتروني

Table of content: 2016 volume:3 issue:2

Article
The Rational Valued Characters Table of the group Q2p×D4 when p is aPrime Number

Loading...
Loading...
Abstract

The main purpose of this paper is to findthe 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={xhyk, 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,3انهذف انزئيسي نهذا انبحث هى ايجاد جذول انشىاخض انىسبي نهزمزة Q2p×D4 عىذما p عذد اوني ووزمز نه بانزمز ≡*(Q2p×D4) , عىذما Q2p هي انزمزة انزباعيت مه انزتبت 4p نكم عذد طحيح p , نها مىنذيه x , y وتحقق Q2p={xhyk, 0 , k=0,1} وتمتهك انخىاص انتانيت {x2p=y4=I,yxry-1=x-r} وانزمزة D4 مه انزتبت 8 تتىنذ بىاسطت دوران r مه انزتبت 4 و اوعكاس s مه انزتبت 2 نها 8 عىاطز تكتب {I*,r,r2, r3,s,sr,sr2,sr3}

Keywords

Character --- rational --- group --- Q2p --- D4.


Article
Some Combinatorial Results on the Factor Group K ( )

Authors: Ahmed Abed Ali Omran --- --- Manal Najy Yaqoob
Pages: 11-17
Loading...
Loading...
Abstract

Let ( ) ( ) ̅( ) be the factor group of all Z-valued class functions module the group of Z-valued generalized characters for elementary abelian group , where is a finite abelian group of type ( ), where is a prime number. Depending on finding the rational valued character 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 . Keywords: factor group, character table, rational valued character matrix.


Article
An Efficient Algorithm for Initializing Centroids in K-means Clustering

Loading...
Loading...
Abstract

Clustering 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 clustering technique, 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ذ صًم انع قُدج حٔدج ي أكصس خ إزشيياخ اسرخلاص ان عًسفح في ذق يُاخ انر قُية ع انثيا اَخ. ان طًُ ان سٓيي طًَٔ انرجصئح أنرقسيى يْ الأكصس شي عٕا في رْا ان جًال. نٔكم ي آًُ ايجاتياذ سٔهثياذ أٔ دْاف .ّ ذ صًم خ إزشييح k-mean الأكصس شي عٕا في ذق يُاخ انرجصئح أنرقسيى. نٔك آُ ذعا يَ ي قَطري ضعف اًْ ذعقيد ان قٕد حٔساسيح انخ إزشييح ذجا ان سًاكص الاتردائيح. يقدو انع مً في رْا انثحس ي جُٓيح يقرسحح نرحديد ان سًاكص الاتردائيح نهع اُقيد ) k ( ي خلال شلاز ع هًياخ يْ ذحديد انكصافح ) density based ( انرطثيع ) normalization ( أنر عُيى ) smoothing (. ك اً ا انخ إزشييح ان قًرسحح ذاخ أساض زياضياذي زصي .ٍ ذى اخرثاز ان جًُٓيح ان قًرسحح ي خلال اسرخداو انثيا اَخ ان رً فٕسج عهى الا رَس يَد تٔ إقع ) 02222 قيد أ سجم(. ذٔشيس ان رُائج ان سًرخهصح ي انثحس إنىأ ان جًُٓيح ان قًرسحح ذاخ ذعقيد قٔد أفضم ذٔض ذقازب انخ إزشييح نه صٕ لٕ إنى انحم.


Article
Enabling a Secure Match over Private Image Collections

Loading...
Loading...
Abstract

Image matching techniques play an essential role in many real world applications such as content based image retrieval (CBIR), computer vision, and near duplicate images. The state of the art methods are generally assumed that the content of images is not private. This reduces the utilization of these methods to work within only environments where images are publicly access. Essentially, this assumption limits more practical applications, e.g., image matching between two security agencies, where images are confidential. This paper addresses the problem of privacy-preserving image matching between two parties where images should not be revealed to each other. The descriptor set of the queried party needs to be generated and encrypted properly using a secret key at the queried party side before being transferred to the other party. We have developed a secure scheme to measure the cosine similarity between two descriptor sets without decryption. Several experiments are conducted to investigate the performance of the proposed scheme.تلعب تقنيات مطابقة الصور دورا أساسيا في العديد من التطبيقات اليومية كاسترجاع الصور المعتمد على المحتوى, رؤية الحاسوب, واكتشاف تكرار الصور القريبة. تفترض الطرق التقليدية أن محتوى الصور يكون غير خاص. وهذا ما يقلل من مدى الاستفادة من تلك الطرق ليكون ملائما فقط للعمل للبيئات التي تكون فيها الصور عامة الوصول. بصورة أساسية, هذا الافتراض يحدد الكثير من التطبيقات العملية, مثلا مطابقة الصور بين وكالتي امن حيث تكون الصور سرية. في هذا البحث قمنا بالأخذ بعين الاعتبار مسالة التطابق الحافظ للخصوصية للصور بين طرفين بحيث لا تكشف الصور للطرف الأخر. في البداية قمنا باستخلاص مجموعة الواصفات لكل صورة. يتم تشفير مجموعة واصفات الصورة المدخلة قبل كشفها إلى الطرف الآخر. قمنا بتطوير أسلوب امن لقياس التشابه ألجيبي بين مجاميع الواصفات بدون الحاجة إلى فك الشفرة. قمنا بإجراء عدة تجارب لتقييم انجازيه الأسلوب المقترح .


Article
He's Variational iteration Method to Approximate Time Fractional Wave non Linear Like Equation with Variable Coefficient

Authors: Abeer Majeed Jasim
Pages: 37-47
Loading...
Loading...
Abstract

In this paper, we will consider variation alliteration method (VIM) for solving time fractional non-linear wave like with variable coefficient. In this method we use an approximate value for time fractional derivative when find Lagrange multiplier. Three examples show the efficiency and the importance of the method.في هذا البحث سوف نطبق طزيقت أسلوب التغايز التكزاري لحل معادلت الحزارة الموخت الخاصت اللاخطيت الكسزيت الزمن, وفي هذه الطزيقت وضع قيمت تقزيبيت للمشتقت الكسزيت الزمنيت عنذ استخزاج مضزوب لاكزانح . أمثلت تبزهن كفاءة وأهميت هذه الطزيقت


Article
A Robust Approach for Mixed Technique of Data Encryption Between DES and RC4 Algorithm

Authors: Dhafar Hamed Abd --- Tameem Hameed Obaida
Pages: 48-54
Loading...
Loading...
Abstract

In 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.حى ف هذا انبذث اسخعزاض خىارسي اٍث انخشف زٍ ان عًزوفت ف أ ظَ تً انخشف زٍ وه اً خىارسي خًٍ DES & RC4 وب اٍ سهب اٍث وا جٌاب اٍث كم خىارسي تٍ ، ثى حى ديج انخىارسي خٍٍٍ بخىارسي تٍ وادذة نهذصىل عهى خىارسي تٍ أكثز كفاءة ي خلال س اٌدة سَبت انخعم ذٍ نهخىارسي تٍ انجذ ذٌة ان اُحجت )أي ع هً تٍ كسز انشفزة سخكى اعمذ بكث زٍ ي اً نى حى اسخخذاو كم خىارسي تٍ عهى دذ (ِ وبفزق له مٍ )يه مً( ف انىلج ان سًخغزق ف ع هً تٍ انخشف زٍ. بعذ حطب كٍ انخىارسي تٍ انجذ ذٌة واخخبارها ع هً اٍ حى انذصىل عهى ان خُ جٍت انخان تٍ :- ع ذُ حشف زٍ بهىن وادذ باسخخذاو خىارسي تٍ ان DES ) س كٍى انىلج ان سًخغزق نهخشف زٍ هى) 0.0000.0 يه ثا تٍَ إيا ع ذُ اسخخذاو انخىارسي تٍ ،) انجذ ذٌة نخشف زٍ فَس انبهىن سىف كٌى انىلج ان سًخغزق بانخشف زٍ هى ) 0.000000 ونخشف زٍ 4000 بهىن باسخخذاو خىارسي تٍ ان DES سىف حسخغزق ولج يمذار ) 0.0000 ( إيا باسخخذاو انخىارسي تٍ انجذ ذٌة س كٍى انىلج ان سًخغزق نهخشف زٍ هى ) 0.0.4 ( . وهذا عٌط س اٌدة له هٍت جذا ف انىلج يمار تَ يع س اٌدة سَبت انخعم ذٍ انخ حى انذصىل عه هٍا، د ثٍ إ انخىارسي تٍ انجذ ذٌة ان اُحجت ي ديج انخىارسي خٍ انسابمخ حخ خٍ ن اُ حشف زٍ كم بهىن ب فًخاح خٌخهف ع انبهىن الأخز )أي كم بهىن شٌشفز ب فًخاح يخخهف خٌى حىن ذٍ بااععخ اًد عهى انبهىن انسابك( عٌ ععىبت كب زٍة ف كسز انشفزة وهذا مٌىد اَ إنى س اٌدة ف الأي تٍُ ود اً تٌ ان عًهىياث ي ااعخخزاق.


Article
Formal model and Policy specification for software defined networks

Authors: Dawood salman jasim al-farttoosi
Pages: 55-62
Loading...
Loading...
Abstract

Software-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 Flog.تكتسب الشبكات المعرفة بالبرمجيات زيادة عالية ، وذلك من قبل شركات معروفة جدا غنية عن التعريف أمثال جوجل ومايكروسوفت لذا تبرز في الوقت الحالي مشكمتان اساسيتان هما : - الموثوقية - الامان هاتان المشكمتان تعيقان النمو السريع ل (SDN) ان هذا العمل يهدف الى المساهمة في هذا المجال الحديث لمبحث وذلك من خلال استكشاف القضايا الامنية في الشبكات المعرفة بالبرمجيات (SDN) يقترح البحث نهجا جديدا وذلك من خلال الاستفادة من نموذج التحكم بالوصول (Usage Control) وكذلك (flog policylanguagefor SDNS)

Table of content: volume:3 issue:2