مجال
التميز
|
تميز دراسي وبحثي
|
|
|
البحوث المنشورة
|
|
البحث (1):
|
|
عنوان البحث:
|
Comparison
between cloud and grid computing: review paper
|
رابط إلى البحث:
|
Click here
|
تاريخ النشر:
|
1st August 2012
|
موجز عن البحث:
|
Cloud computing is the most
recent announced technology that has been launched on the network world.
Clouds are considered as a new generation of Grid computing. Clouds consist
of data centres which are owned by the same institute. The homogeneity within
each data centre in the infrastructure is the main feature for the cloud
computing compared to grid computing. This paper provides a definition for
the cloud, it discusses many aspects of Cloud Computing, and describes
architectures for the cloud (by looking at Amazon’s application (GrepTheWeb))
and how its cost definition differs from that of Grid computing. This paper
focuses on comparing Cloud Computing to previous generations such as Grid
Computing, by reviewing some Security and Policy Issues in Cloud and Grid
Computing. At the end, this paper describes the similarities and differences
between the Grid and Cloud approaches.
|
|
|
البحث (2):
|
|
عنوان البحث:
|
An
extended stable marriage problem algorithm for clone detection
|
رابط إلى البحث:
|
click here
|
تاريخ النشر:
|
15/07/2014
|
موجز عن البحث:
|
Code cloning negatively affects industrial software and threatens
intellectual property. This paper presents a novel approach to detecting
cloned software by using a bijective matching technique. The proposed approach
focuses on increasing the range of similarity measures and thus enhancing the
precision of the detection. This is achieved by extending a well-known
stable-marriage problem (SMP) and demonstrating how matches between code
fragments of different files can be expressed. A prototype of the proposed approach
is provided using a proper scenario, which shows a noticeable improvement in
several features of clone detection such as scalability and accuracy.
|
البحث (3):
|
|
عنوان البحث:
|
SMP-Based
Approach for Intelligent Service Interaction
|
رابط إلى البحث:
|
click
here
|
تاريخ النشر:
|
15/11/2014
|
موجز عن البحث:
|
Service-oriented
computing is establishing itself as a new computing paradigm in which
services advertise their capabilities within a network, and then are used,
composed and orchestrated by other services and end-users. Whilst many
approaches to matching service providers with consumers of their services
have been developed in the past, the proposed approach in this paper takes a
different view of the problem in that it does not look for the fittest
individual utility, but views it as a constrained optimisation problem that
matches between a set of services and a set of service requests. Our approach
addresses this problem using an adaptation of the well-known stable-marriage
problem and demonstrates how matching between services and requests to a
certain threshold can be expressed. This will contribute a fair assignment
between services and requests based on their preferences. As the current
state of the service selection process considers only the view of requests,
the proposed approach can ensure several features to the services such as
service protection and service quality, e.g. it can ensure the preservation
of service availability by redirecting a coming request to a similar service
if the current service is busy.
|
المؤتمرات العلمية:
|
|
المؤتمر (1):
|
|
عنوان المؤتمر:
|
7th
Saudi Students Conference-UK
|
تاريخ الإنعقاد:
|
1-2/02/2014
|
مكان
الإنعقاد:
|
Edinburgh, UK
|
طبيعة المشاركة:
|
Paper presentation
|
عنوان المشاركة:
|
SMP-based
Dual Proposed Matching Scheme for Service Selection.
|
ملخص المشاركة:
|
Nowadays there are plenty of Web Services
available on the Internet. The continuously increased services lead to the
necessity of service oriented workflow management to define, manage, and
execute workflows through the service selection and composition. This
research focuses on an accurate and effective mechanism for service
selection, in which an ideal matching process needs to be performed. A novel
matching scheme is proposed to derive a quality satisfaction in service
selection. The scheme is based on the well-known Stable Marriage Problem
(SMP) algorithm. A competitive matching process (Dual-Propose-SMP) is defined
and supported by a new strategy called Choosy Strategy to make it suitable
for service selection. Through the proposed approach, optimal candidates can
be matched based on the preferences, which is the key step of service
oriented workflow management.
|
المؤتمر (2):
|
|
عنوان المؤتمر:
|
7th
Saudi Students Conference-UK
|
تاريخ الإنعقاد:
|
1-2/02/2014
|
مكان
الإنعقاد:
|
Edinburgh, UK
|
طبيعة المشاركة:
|
Poster presentation
|
عنوان المشاركة:
|
Matching based software
engineering
|
ملخص المشاركة:
|
Matching processes are the corner stones of
the widely spread software applications, in which the software approaches can
be judged as perfect (fulfil the standard requirement) or poor. Current
software areas such as clone detection and service selection need to increase
the capability of its match process to accomplish the intelligence assignment
between its candidates. SMP algorithm is one of the well-known mathematical
matching algorithms, which used for multi purposes and several criteria with
different derived versions. Therefore, with slight amendments (e.g. dual
propose and multi propose) to this algorithm in order to take place and
replace the current match process of such software applications, the
intelligent is achieved. The matching process performance is challenging in
several aspects of criteria for instance speed, accuracy and
intelligence (satisfied matched candidates). Our approach is SMP-based and
new strategy (choosy strategy) is proposed to accommodate the extended SMP
algorithms to wide range of software matching processes. Two case studies are
carried out on both program analysis and data analysis to proof the
improvements of the proposed matching approach showing that the current
state of the original SMP algorithm is lack to gain the satisfaction of both
matched candidates and increase the fairness of the matching process. Also,
shows that the new extended algorithm affects positively wide range of software
engineering disciplines. Clone detection plays the role of the program
analysis, in which the matching scheme (detection process) needs to find the
similar fragments of code for several purposes such as removal repeated
portions as maintenance part of legacy system. However, ontology alignments
reflect the data analysis, in which matching process identifies the synonyms.
Also, service selection is encountered, representing both program and data analysis.
|
المؤتمر (3):
|
|
عنوان المؤتمر:
|
Science and Information Conference
|
تاريخ الإنعقاد:
|
27/08/2014
|
مكان
الإنعقاد:
|
London, UK
|
طبيعة المشاركة:
|
Paper presentation
|
عنوان المشاركة:
|
SMP-Based service matching
|
ملخص المشاركة:
|
Service-oriented computing is
establishing itself as a new computing paradigm in which services advertise
their capabilities within a network.
These services are then used, composed and orchestrated by other
services and end-users. Whilst many
approaches to matching service providers with consumers of their services
have been developed in the past, our approach takes a different view of the
problem in that it does not look for the highest individual utility, but
views it as a constrained optimisation problem that matches between a set of
service providers and a set of service consumers. Our approach addresses this problem using
an adaptation of the well-known stable-marriage problem and demonstrates how
matching between service providers and consumers can be expressed in similar
terms. We contribute a fair assignment process and show how the final
engagement between service providers and consumers is based on their
preferences.
|
المؤتمر (4):
|
|
عنوان المؤتمر:
|
Second International Conference
on Software Engineering
|
تاريخ الإنعقاد:
|
01/06/2014
|
مكان
الإنعقاد:
|
Switzerland, Zurich
|
طبيعة المشاركة:
|
Paper presentation
|
ملخص المشاركة:
|
Code cloning is a severe problem that
negatively affects industrial software and threatens intellectual property.
This paper presents a novel approach to detecting cloned software by using a
bijection matching technique. The proposed approach focuses on increasing the
range of similarity measures and thus enhancing the recall and precision of
the detection. This is achieved by extending a well-known stable-marriage
problem (SMP) and demonstrating how matches between code fragments of
different files can be expressed. a prototype of our approach is provided
using a proper scenario, which shows a noticeable improvement in several
features such as scalability and accuracy.
|