Debajyoti Mukhopadhyay

A Survey on Web Service Discovery Approaches

Web services are playing an important role in e-business and e-commerce applications. As web service applications are interoperable and can work on any platform, large scale distributed systems can be developed easily using web services. Finding most suitable web service from vast collection of web services is very crucial for successful execution of applications. Traditional web service discovery approach is a keyword based search using UDDI. Various other approaches for discovering web services are also available. Some of the discovery approaches are syntax based while other are semantic based. Having system for service discovery which can work automatically is also the concern of service discovery approaches. As these approaches are different, one solution may be better than another depending on requirements. Selecting a specific service discovery system is a hard task. In this paper, we give an overview of different approaches for web service discovery described in literature. We present a survey of how these approaches differ from each other.

A New Approach to Design Graph Based Search Engine for Multiple Domains Using Different Ontologies

Search engine has become a major tool for searching any information from the World Wide Web (WWW). While searching the huge digital library available in the WWW, every effort is made to retrieve the most relevant results. But in WWW majority of the Web pages are in HTML format and there are no such tags, which tells the crawler to find any specific domain. To find more relevant result we use Ontology for that particular domain. If we are working with multiple domains then we use multiple ontologies. Now in order to design a domain specific search engine for multiple domains, crawler must crawl through the domain specific Web pages in the WWW according to the predefined ontologies.

Generation of SMACA and its application in web services

Web Search Engine uses forward indexing and inverted indexing as a part of its functional design. This indexing mechanism helps retrieving data from the database based on user query. In this paper, an efficient solution to handle the indexing problem is proposed with the introduction of Nonlinear Single Cycle Multiple Attractor Cellular Automata (SMACA). This work simultaneously shows generation of SMACA by using specific rule sequence. Searching mechanism is done with linear time complexity.

Agent Based Negotiation Using Cloud – An Approach in E-Commerce

’Cloud computing’ allows subscription based access to computing. It also allows storage services over Internet. Automated Negotiation is becoming an emerging, and important area in the field of Multi-Agent Systems in E-Commerce. Multi-Agent based negotiation system is necessary to increase the efficiency of E-negotiation process. Cloud computing provides security and privacy to the user data and low maintenance costs. We propose a Negotiation system using cloud. In this system, all product information and multiple agent details are stored on cloud. Both parties select their agents through cloud for negotiation. Agent acts as a negotiator. Agents have user’s details and their requirements for a particular product. Using user’s requirement, agents negotiate on some issues such as price, volume, duration, quality and so on. After completing negotiation process, agents give feedback to the user about whether negotiation is successful or not. This negotiation system is dynamic in nature and increases the agents with the increase in participating user.

A Product Recommendation System Using Vector Space Model and Association Rule

This paper presents an alternative product recommendation system for Business-to-customer e-commerce purposes. The system recommends the products to a new user. It depends on the purchase pattern of previous users whose purchase pattern are close to that of new user. The system is based on vector space model to find out the closest user profile among the profiles of all users in database. It also implements Association rule mining based recommendation system, taking into consideration the order of purchase, in recommending more than one product. To make the association rule memory-efficient, cellular automata is used.

Analyzing web application log files to find hit count through the utilization of Hadoop MapReduce in cloud computing environment

MapReduce has been widely applied in various fields of data and compute intensive applications and also it is important programming model for cloud computing. Hadoop is an open-source implementation of MapReduce which operates on terabytes of data using commodity hardware. We have applied this Hadoop MapReduce programming model for analyzing web log files so that we could get hit count of specific web application. This system uses Hadoop file system to store log file and results are evaluated using Map and Reduce function. Experimental results show hit count for each field in log file. Also due to MapReduce runtime parallelization response time is reduced.

Introducing dynamic ranking on web pages based on multiple ontology supported domains

Search Engine ensures efficient Web-page ranking and retrieving. Page ranking is typically used for displaying the Web-pages at client-side. We are going to introduce a data structural model for retrieval of the searched Web-pages. We propose two algorithms in this paper. The first algorithm constructs the Index Based Acyclic Graph generated by multiple ontologies supported crawling and the second algorithm is for calculation of ranking of the selected Web-pages from Index Based Acyclic Graph.

Design of SMACA: synthesis and its analysis through rule vector graph for web based application

Web search engine uses indexing for management of web-pages in a mannered way. Web-pages are well distributed within the database of server. Both forward and inverted indexing is employed to tackle web-pages as a part of its functional design. This indexing mechanism helps in retrieving data from the database based on user query. In this paper, an efficient solution to handle the indexing problem is proposed with the introduction of non-linear single cycle multiple attractor cellular automata (SMACA). This paper also reports an analysis on SMACA using rule vector graph (RVG). This work simultaneously shows generation of SMACA by using specific rule sequence. Searching mechanism is done with O(n) complexity. SMACA provides an implicit memory to store the patterns. Search operation to identify the class of a pattern out of several classes boils down to running a cellular automata (CA) for one time step. This demands storage of the CA rule vector (RV) and the seed values. SMACA is based on sound theoretical foundation of CA technology.

Process Planner: An Approach to Conceptualize Business Practices in Private Cloud

The expansion of business is majorly driven by client and quality oriented architecture. Every commercial setup has its own business pattern and process of implementation. Large numbers of alternatives are supporting trade in terms of business formation, business development, and business expansion also, sometimes in each of its incremental stage. For business development, flexible technology is required, that can be a part of an existing technology and that would help to model business based on business rules. Business concepts need to be well organized and predefined for collaboration to ensure complete client satisfaction. This paper proposes an architecture that is light weight in terms of resource requirements that is modeled on the concept-building approach which can further embedded into private or public cloud to support service oriented architecture. Inputs related to application are taken from a collaborating client, which is then forwarded to the planner for matching. The discovered web services (belonging to other clients) are then chosen for further collaboration. The planner relies on a concept-based approach, rather than using complex database schema. Concept of Artificial Intelligence (AI), a Hierarchical Task Network (HTN) play an important role in forming and analyzing the concept built. Each of the tasks is decomposed till depth (primary node), on the base of filter parameters mentioned by client. Medi-Care scenario is considered to show applicability of the approach. Approach solves and formulates the problem while using client criteria of search to map required output.

Efficient Fuzzy Search Engine with B -Tree Search Mechanism

Search engines play a vital role in day to day life on internet. People use search engines to find content on internet. Cloud computing is the computing concept in which data is stored and accessed with the help of a third party server called as cloud. Data is not stored locally on our machines and the softwares and information are provided to user if user demands for it. Search queries are the most important part in searching data on internet. A search query consists of one or more than one keywords. A search query is searched from the database for exact match, and the traditional searchable schemes do not tolerate minor typos and format inconsistencies, which happen quite frequently. This drawback makes the existing techniques unsuitable and they offer very low efficiency. In this paper, i will for the first time formulate the problem of effective fuzzy search by introducing tree search methodologies. I will explore the benefits of B trees in search mechanism and use them to have an efficient keyword search. I have taken into consideration the security analysis strictly so as to get a secure and privacy-preserving system.