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: 2017 volume:4 issue:3

Article
NEGATIVE THEOREM FOR LP,0
مبرهنة عكسية للتقريب الرتيب للدوال في الفضاءت LP,0

Loading...
Loading...
Abstract

For a given nonnegative integer number n, we can find a monotone function f depending on n, defined on the interval I=[-1,1], and an absolute constant c>0, satisfying the following relationship: (2〖E_n (f ́ )〗_p)/(n+1)^3 ≤〖E_(n+1)^1 (f)〗_p≤c〖E_n (f ́ )〗_p, where 〖E_(n+1)^1 (f)〗_p is the degree of the best Lp monotone approximation of the function f by algebraic polynomial of degree not exceeding n+1. 〖E_n (f ́ )〗_p is the degree of the best Lp approximation of the function f ́ by algebraic polynomial of degree not exceeding n.لكل عدد طبيعي n يمكن ان نجد دالة رتيبة تعتمد عليه و معرفة على الففترة [-1,1] و كذلك يمكن ان نجد ثابت موجب c يحقق العلاقة (2〖E_n (f ́ )〗_p)/(n+1)^3 ≤〖E_(n+1)^1 (f)〗_p≤c〖E_n (f ́ )〗_p, حيث ان 〖E_(n+1)^1 (f)〗_p يمثل درجة التقريب الرتيب الأفضل للدالة f في الفضاء LP باستخدام متعددات الحدود الجبرية الرتيبة من الدرجة اقل او يساوي n+1 . اما 〖E_n (f ́ )〗_p يمثل درجة التقريب الأفضل للدالة f ́ في الفضاء LP باستخدام متعددات الحدود الجبرية من الدرجة اقل او يساوي n .


Article
Distributed Information Retrieval Based On Metaheuristic Search and Query Expansion

Loading...
Loading...
Abstract

Distributed information retrieval (DIR) is a model enables a user to access many searchable databases reside in different locations. DIR is more complex than the centralized information retrieval (IR). It requires addressing two significant additional problems that are the resource selection and the results merging. Many techniques for addressing the two problems have been published in the literature. However, they still have a negative impact on retrieving quality and response time. This paper aims to improve the DIR efficiency through using a meta-heuristic algorithm and improving the result quality through a query expansion. The algorithm has been strengthened using the nearest neighbor graph in order to improve the search performance. The performance in the proposed system outperforms the one in the traditional system in a rate from 6% to 9% while reduces the latency in an approximate rate from 0.047 to 0.134 second for each query. - استرجاع المعلومات الموزعة (DIR) هو نموذج يتيح للمستخدم الوصول إلى العديد من قواعد البيانات للبحث في مواقع مختلفة. DIR هو أكثر تعقيدا من استرجاع المعلومات المركزية (IR). فهو يتطلب معالجة مشكلتين إضافيتين هامتين هما اختيار الموارد ودمج النتائج. لقد نُشِرت العديد من التقنيات لمعالجة المشكلتين في الأدب. ومع ذلك، فإنها لا تزال لها تأثير سلبي على جودة الاسترجاع ووقت الاستجابة. تهدف هذه الورقة إلى تحسين كفاءة DIR من خلال استخدام خوارزمية ارشادية عليا معينة وتحسين جودة النتائج من خلال توسع الاستعلام. وقد تم تعزيز الخوارزمية باستخدام مخطط الجار الاقرب من أجل تحسين أداء البحث. أداء النظام المقترح يفوق الأداء في النظام التقليدي بمعدل من 6٪ إلى 9٪ في حين يقلل من التاخير بمعدل تقريبي من 0.047 إلى 0.134 ثانية لكل استعلام.


Article
Solution of Singular Fuzzy Fraction order Control Systems via Drazin inverse

Authors: Alaa Muhsien Abd
Pages: 12-20
Loading...
Loading...
Abstract

In this paper , we investigate solution for singular fuzzy fractional order control system , which in turn gives us two subsystem by drazin inverse . One of these subsystems contain fuzzy fractional order control system used fuzzy laplace transform as well as lower function and upper function in order to get the solution .


Article
A Hybrid Data Warehouse Model to Improve Mining Algorithms

Authors: Kadhim B.S.AlJanabi --- Rusul Kadhim
Pages: 21-30
Loading...
Loading...
Abstract

The performance of different Data Mining Algorithms including Classification, Clustering, Association, Prediction and others are highly related to the approaches used in Data Warehouse design and to the way the data is stored (lightly summarized, highly summarized and detailed).Detailed data is important to get detailed reports but as the amount of data is huge this represents a big challenge to the mining algorithms, on the other hand, the summarized data leads to better algorithms performance but the lack of the required knowledge may affect the overall mining process. Knowledge extraction and mining algorithms performance and complexities represent a big challenge in data analysis field, hence the work in this paper represents a proposed approach to improve the algorithms performance throughout well designed warehouse and data reduction technique.

Table of content: volume:4 issue:3