scholarly journals Multi-Agent Planning for Automatic Geospatial Web Service Composition in Geoportals

2018 ◽  
Vol 7 (10) ◽  
pp. 404 ◽  
Author(s):  
Mahdi Farnaghi ◽  
Ali Mansourian
Keyword(s):  
Web Services ◽  
Web Service ◽  
Spatial Data ◽  
Execution Time ◽  
Search Space ◽  
Planning Problem ◽  
Ai Planning ◽  
Simulation Environment ◽  
Multi Agent ◽  
Open Geospatial Consortium

Automatic composition of geospatial web services increases the possibility of taking full advantage of spatial data and processing capabilities that have been published over the internet. In this paper, a multi-agent artificial intelligence (AI) planning solution was proposed, which works within the geoportal architecture and enables the geoportal to compose semantically annotated Open Geospatial Consortium (OGC) Web Services based on users’ requirements. In this solution, the registered Catalogue Service for Web (CSW) services in the geoportal along with a composition coordinator component interact together to synthesize Open Geospatial Consortium Web Services (OWSs) and generate the composition workflow. A prototype geoportal was developed, a case study of evacuation sheltering was implemented to illustrate the functionality of the algorithm, and a simulation environment, including one hundred simulated OWSs and five CSW services, was used to test the performance of the solution in a more complex circumstance. The prototype geoportal was able to generate the composite web service, based on the requested goals of the user. Additionally, in the simulation environment, while the execution time of the composition with two CSW service nodes was 20 s, the addition of new CSW nodes reduced the composition time exponentially, so that with five CSW nodes the execution time reduced to 0.3 s. Results showed that due to the utilization of the computational power of CSW services, the solution was fast, horizontally scalable, and less vulnerable to the exponential growth in the search space of the AI planning problem.

scholarly journals PROPOSAL FOR A WEB ENCODING SERVICE (WES) FOR SPATIAL DATA TRANSACTIO

2015 ◽  
Vol II-2/W2 ◽  
pp. 63-67
Author(s):  
C. B. Siew ◽  
S. Peters ◽  
A. A. Rahman
Keyword(s):  
Web Services ◽  
Web Service ◽  
Spatial Data ◽  
Data Delivery ◽  
Markup Language ◽  
Data Infrastructure ◽  
Web 3D ◽  
Open Geospatial Consortium ◽  
3D City Modelling ◽  
Processing Service

Web services utilizations in Spatial Data Infrastructure (SDI) have been well established and standardized by Open Geospatial Consortium (OGC). Similar web services for 3D SDI are also being established in recent years, with extended capabilities to handle 3D spatial data. The increasing popularity of using <i>City Geographic Markup Language</i> (CityGML) for 3D city modelling applications leads to the needs for large spatial data handling for data delivery. This paper revisits the available web services in OGC Web Services (OWS), and propose the background concepts and requirements for encoding spatial data via Web Encoding Service (WES). Furthermore, the paper discusses the data flow of the encoder within web service, e.g. possible integration with Web Processing Service (WPS) or Web 3D Services (W3DS). The integration with available web service could be extended to other available web services for efficient handling of spatial data, especially 3D spatial data.

Discovering Homogenous Service Framework Based on Matching Mechanism and Clustering

2011 ◽  
Vol 341-342 ◽  
pp. 462-466
Author(s):  
Meng Wang ◽  
Shu Yu Li
Keyword(s):  
Web Services ◽  
Web Service ◽  
Search Engine ◽  
Search Space ◽  
Research Direction ◽  
The Internet ◽  
Ongoing Research ◽  
Service Community ◽  
Matching Mechanism ◽  
Service Framework

How to efficiently select Web services that can best meet the requirements of consumers is an ongoing research direction in Web service community. However, current discovery systems support either WSDL or OWL-S Web services but not both.Through the automatically collected WSDL files and the OWL-S web service related matching mechanism, the idea of transforming various existing web services on the Internet into a service cluster of similar homogeneous , then we can create a service search engine successfully and at the same time the search space can be reduced. By means of providing a mechanism for matching the characteristics properties of relevant web services, we can put them all together into a group which can be found and applied.

Multi-Agent Architecture for Developing Cooperative E-Business Applications

2010 ◽  
pp. 377-396
Author(s):  
Mahmoud Brahimi ◽  
Lionel Seinturier ◽  
Mahmoud Boufaida
Keyword(s):  
Web Services ◽  
Web Service ◽  
External World ◽  
Cooperative Work ◽  
Service Ontology ◽  
Business Applications ◽  
Multi Agent ◽  
New Vision ◽  
A Company ◽  
Different Parts

This article describes a multi-agent approach that provides solutions to the problems raised during the development of cooperative e-business applications. This approach is organized in the form of cooperative application groups representing the different parts of a company. Agent coordinators orchestrate the cooperative work of these groups. The most requested functionalities inside the company and those offered to the external world can be exported as Web Services. These Web Services are described with DAML-based Web Service ontology (OWL-S) and managed with an intermediate agent called Web Service Finder Agent. The proposed solution provides a new vision of the cooperation context where the companies and their partners share knowledge and offer functionalities as agents and Web Services.

Distributed Geospatial Processing Services

2011 ◽  
pp. 1186-1193 ◽  
Author(s):  
Carlos Granell ◽  
Laura Díaz ◽  
Michael Gould
Keyword(s):  
Web Services ◽  
Web Service ◽  
Spatial Data ◽  
Geospatial Data ◽  
Service Description ◽  
Service Oriented Architectures ◽  
Data Infrastructure ◽  
Loosely Coupled ◽  
Tightly Coupled ◽  
Geospatial Services

The development of geographic information systems (GISs) has been highly influenced by the overall progress of information technology (IT). These systems evolved from monolithic systems to become personal desktop GISs, with all or most data held locally, and then evolved to the Internet GIS paradigm in the form of Web services (Peng & Tsou, 2001). The highly distributed Web services model is such that geospatial data are loosely coupled with the underlying systems used to create and handle them, and geospatial processing functionalities are made available as remote, interoperable, discoverable geospatial services. In recent years the software industry has moved from tightly coupled application architectures such as CORBA (Common Object Request Broker Architecture?Vinoski, 1997) toward service-oriented architectures (SOAs) based on a network of interoperable, well-described services accessible via Web protocols. This has led to de facto standards for delivery of services such as Web Service Description Language (WSDL) to describe the functionality of a service, Simple Object Access Protocol (SOAP) to encapsulate Web service messages, and Universal Description, Discovery, and Integration (UDDI) to register and provide access to service offerings. Adoption of this Web services technology as an option to monolithic GISs is an emerging trend to provide distributed geospatial access, visualization, and processing. The GIS approach to SOA-based applications is perhaps best represented by the spatial data infrastructure (SDI) paradigm, in which standardized interfaces are the key to allowing geographic services to communicate with each other in an interoperable manner. This article focuses on standard interfaces and also on current implementations of geospatial data processing over the Web, commonly used in SDI environments. We also mention several challenges yet to be met, such as those concerned with semantics, discovery, and chaining of geospatial processing services and also with the extension of geospatial processing capabilities to the SOA world.

WSBen

2011 ◽  
pp. 739-758 ◽  
Author(s):  
Seog-Chan Oh ◽  
Dongwon Lee
Keyword(s):  
Statistical Analysis ◽  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Network Models ◽  
Web Service Composition ◽  
Ai Planning ◽  
Underlying Network ◽  
Test Sets ◽  
Diverse Data

In this article, a novel benchmark toolkit, WSBen, for testing web services discovery and composition algorithms is presented. The WSBen includes: (1) a collection of synthetically generated web services files in WSDL format with diverse data and model characteristics; (2) queries for testing discovery and composition algorithms; (3) auxiliary files to do statistical analysis on the WSDL test sets; (4) converted WSDL test sets that conventional AI planners can read; and (5) a graphical interface to control all these behaviors. Users can finetune the generated WSDL test files by varying underlying network models. To illustrate the application of the WSBen, in addition, we present case studies from three domains: (1) web service composition; (2) AI planning; and (3) the laws of networks in Physics community. It is our hope that WSBen will provide useful insights in evaluating the performance of web services discovery and composition algorithms. The WSBen toolkit is available at: http://pike.psu.edu/sw/wsben/.

Accelerating Web Service Workflow Execution via Intelligent Allocation of Services to Servers

2010 ◽  
Vol 21 (4) ◽  
pp. 60-90 ◽  
Author(s):  
Konstantinos Stamkopoulos ◽  
Evaggelia Pitoura ◽  
Panos Vassiliadis ◽  
Apostolos Zarras
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Provider ◽  
Execution Time ◽  
Load Distribution ◽  
Greedy Algorithms ◽  
Critical Role ◽  
Service Operations ◽  
Workflow Execution ◽  
Provision Of Services

The appropriate deployment of web service operations at the service provider site plays a critical role in the efficient provision of services to clients. In this paper, the authors assume that a service provider has several servers over which web service operations can be deployed. Given a workflow of web services and the topology of the servers, the most efficient mapping of operations to servers must then be discovered. Efficiency is measured in terms of two cost functions that concern the execution time of the workflow and the fairness of the load distribution among the servers. The authors study different topologies for the workflow structure and the server connectivity and propose a suite of greedy algorithms for each combination.

Multi-Agent Architecture for Developing Cooperative E-Business Applications

2009 ◽  
Vol 2 (4) ◽  
pp. 43-62 ◽  
Author(s):  
Mahmoud Brahimi ◽  
Lionel Seinturier ◽  
Mahmoud Boufaida
Keyword(s):  
Web Services ◽  
Web Service ◽  
External World ◽  
Agent Architecture ◽  
Service Ontology ◽  
Business Applications ◽  
Multi Agent ◽  
New Vision ◽  
A Company ◽  
Different Parts

This article describes a multi-agent approach that provides solutions to the problems raised during the development of cooperative e-business applications. This approach is organized in the form of cooperative application groups representing the different parts of a company. Agent coordinators orchestrate the cooperative work of these groups. The most requested functionalities inside the company and those offered to the external world can be exported as Web Services. These Web Services are described with DAML-based Web Service ontology (OWL-S) and managed with an intermediate agent called Web Service Finder Agent. The proposed solution provides a new vision of the cooperation context where the companies and their partners share knowledge and offer functionalities as agents and Web Services.

A semantic web services discovery approach based on a mobile agent using metadata

2017 ◽  
Vol 10 (1) ◽  
pp. 12-29 ◽  
Author(s):  
Nadia Ben Seghir ◽  
Okba Kazar ◽  
Khaled Rezeg ◽  
Samir Bourekkache
Keyword(s):  
Web Services ◽  
Semantic Web ◽  
Web Service ◽  
Mobile Agent ◽  
Service Providers ◽  
User Profile ◽  
Search Space ◽  
Semantic Web Services ◽  
Content Type ◽  
The Web

Purpose The success of web services involved the adoption of this technology by different service providers through the web, which increased the number of web services, as a result making their discovery a tedious task. The UDDI standard has been proposed for web service publication and discovery. However, it lacks sufficient semantic description in the content of web services, which makes it difficult to find and compose suitable web services during the analysis, search, and matching processes. In addition, few works on semantic web services discovery take into account the user’s profile. The purpose of this paper is to optimize the web services discovery by reducing the search space and increasing the number of relevant services. Design/methodology/approach The authors propose a new approach for the semantic web services discovery based on the mobile agent, user profile and metadata catalog. In the approach, each user can be described by a profile which is represented in two dimensions: personal dimension and preferences dimension. The description of web service is based on two levels: metadata catalog and WSDL. Findings First, the semantic web services discovery reduces the number of relevant services through the application of matching algorithm “semantic match”. The result of this first matching restricts the search space at the level of UDDI registry, which allows the users to have good results for the “functional match”. Second, the use of mobile agents as a communication entity reduces the traffic on the network and the quantity of exchanged information. Finally, the integration of user profile in the service discovery process facilitates the expression of the user needs and makes intelligible the selected service. Originality/value To the best knowledge of the authors, this is the first attempt at implementing the mobile agent technology with the semantic web service technology.

Context-Aware Web Service Clustering and Visualization

2020 ◽  
Vol 17 (4) ◽  
pp. 32-54
Author(s):  
Banage T. G. S. Kumara ◽  
Incheon Paik ◽  
Yuichi Yaguchi
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Discovery ◽  
Search Space ◽  
Context Aware ◽  
Specific Context ◽  
Web Service Discovery ◽  
Domain Specific ◽  
Clustering Approach ◽  
Service Clustering

With the large number of web services now available via the internet, web service discovery has become a challenging and time-consuming task. Organizing web services into similar clusters is a very efficient approach to reducing the search space. A principal issue for clustering is computing the semantic similarity between services. Current approaches do not consider the domain-specific context in measuring similarity and this has affected their clustering performance. This paper proposes a context-aware similarity (CAS) method that learns domain context by machine learning to produce models of context for terms retrieved from the web. To analyze visually the effect of domain context on the clustering results, the clustering approach applies a spherical associated-keyword-space algorithm. The CAS method analyzes the hidden semantics of services within a particular domain, and the awareness of service context helps to find cluster tensors that characterize the cluster elements. Experimental results show that the clustering approach works efficiently.

scholarly journals Reduce Artificial Intelligence Planning Effort by using Map-Reduce Paradigm

2021 ◽  
Vol 10 (7) ◽  
pp. 24-32
Author(s):  
Mohamed Elkawkagy* ◽  
Elbeh Heba
Keyword(s):  
Artificial Intelligence ◽  
Search Space ◽  
Processing Technique ◽  
Substantial Improvement ◽  
Domain Model ◽  
Map Reduce ◽  
Planning Problem ◽  
Ai Planning ◽  
Hierarchical Planning ◽  
Artificial Intelligence Planning

While several approaches have been developed to enhance the efficiency of hierarchical Artificial Intelligence planning (AI-planning), complex problems in AI-planning are challenging to overcome. To find a solution plan, the hierarchical planner produces a huge search space that may be infinite. A planner whose small search space is likely to be more efficient than a planner produces a large search space. In this paper, we will present a new approach to integrating hierarchical AI-planning with the map-reduce paradigm. In the mapping part, we will apply the proposed clustering technique to divide the hierarchical planning problem into smaller problems, so-called sub-problems. A pre-processing technique is conducted for each sub-problem to reduce a declarative hierarchical planning domain model and then find an individual solution for each so-called sub-problem sub-plan. In the reduction part, the conflict between sub-plans is resolved to provide a general solution plan to the given hierarchical AI-planning problem. Preprocessing phase helps the planner cut off the hierarchical planning search space for each sub-problem by removing the compulsory literal elements that help the hierarchical planner seek a solution. The proposed approach has been fully implemented successfully, and some experimental results findings will be provided as proof of our approach's substantial improvement inefficiency.

Sign in / Sign up

Export Citation Format

Share Document