We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Improved Grid Service Discovery with Rough sets

Published on May 2012 by S. S. Howal, G. A. Patil
journal_cover_thumbnail

National Conference on Recent Trends in Computing
Foundation of Computer Science USA
NCRTC - Number 5
May 2012
Authors: S. S. Howal, G. A. Patil
6bfc4aab-6b76-4d77-a657-c6a6b7d878cc

S. S. Howal, G. A. Patil . Improved Grid Service Discovery with Rough sets. National Conference on Recent Trends in Computing. NCRTC, 5 (May 2012), 5-7.

@article{
author = { S. S. Howal, G. A. Patil },
title = { Improved Grid Service Discovery with Rough sets },
journal = { National Conference on Recent Trends in Computing },
issue_date = { May 2012 },
volume = { NCRTC },
number = { 5 },
month = { May },
year = { 2012 },
issn = 0975-8887,
pages = { 5-7 },
numpages = 3,
url = { /proceedings/ncrtc/number5/6544-1034/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 National Conference on Recent Trends in Computing
%A S. S. Howal
%A G. A. Patil
%T Improved Grid Service Discovery with Rough sets
%J National Conference on Recent Trends in Computing
%@ 0975-8887
%V NCRTC
%N 5
%P 5-7
%D 2012
%I International Journal of Computer Applications
Abstract

In this paper our basic aim is to present the improved mechanism for the grid service discovery using rough sets with parallel execution of servers. ROSSE is a search engine for grid service discovery. Building on Rough sets theory, ROSSE is novel in its capability to deal with uncertainty of service properties when matching services. This is achieved by dynamically identifying and reducing dependent properties that may be uncertain properties when matching a service query. In this way, ROSSE increases the accuracy in service discovery. Finally, ROSSE is evaluated from the aspects of accuracy and efficiency in discovery of computing services. Improvement in ROSSE model is enhanced by providing the parallel execution of resource requests in order to enhance the Service Discovery.

References
  1. F. Curbera, M. Duftler, R. Khalaf, W. Nagy, N. Mukhi, and S. Weerawarana, "Unraveling the Web Services: An Introduction to SOAP, WSDL, and UDDI " IEEE Internet Computing, vol. 6, no. 2,pp. 86-93, 2002.
  2. Yuan-Shun Dai,Yi Pan and Xukai Zou "A Hierarchical Modeling and Analysis for Grid Service Reliability", IEEE transactions on Computers, Vol. 56, No. 5, pp. 681-691, 2007.
  3. Maozhen Li, Bin Yu, Omer Rana, and Zidong Wang," Grid Service Discovery with Rough Sets", IEEE Transaction on Knowledge and Data Engineering,vol. 20,No. 6 pp. 851-862,2008.
  4. Pawlak, Z, "Rough Sets", International Journal of Computer and Information Sciences, YRO. 11, QR. 1, SS. 341–356, 1982
  5. Jon Komorowski, Lech Polkowski, and Andrezej Skowron "Rough sets: A Tutorial".
  6. V. Tsetsos, C. Anagnostopoulos, and S. Hadjiefthymiades, "On the Evaluation of Semantic Web Service Matchmaking Systems", Proc. Fourth IEEE European Conf. Web Services (ECOWS '06), pp. 255-264, Dec. 2006.
  7. URL "http://www. ogf. org".
  8. M. Paolucci, T. Kawamura, T. Payne and K. Sycara, "Semantic Matching of Web Service Capabilities", Proc. First Int'l Semantic Web Conf. (ISWC '02), pp. 333-347, June 2002.
Index Terms

Computer Science
Information Sciences

Keywords

Rough Set Resource Manager Server Grid Service Discovery