arXiv subjects

Debajyoti Mukhopadhyay

Publications and source records attributed to Debajyoti Mukhopadhyay.

54 records · Page 3Linked to original sources

arXiv2012

Query Optimization Over Web Services Using A Mixed Approach

A Web Service Management System (WSMS) can be well-thought-out as a consistent and a secure way of managing the web services. Web Service has become a quintessential part of the web world, managing and sharing the resources of the business it is associated with. In this paper, we focus on the query optimization aspect of handling the "natural language" query, queried to the WSMS. The map-select-composite operations are piloted to select specific web services. The main aftermath of our research is ensued in an algorithm which uses cost-based as well as heuristic based approach for query optimization. Query plan is formed after cost-based evaluation and using Greedy algorithm. The heuristic based approach further optimizes the evaluation plan. This scheme not only guarantees an optimal solution, which has a minimum diversion from the ideal solution, but also saves time which is otherwise utilized in generating various query plans using many mathematical models and then evaluating each one.

cs.DB↗

arXiv2012

Identify Web-page Content meaning using Knowledge based System for Dual Meaning Words

Meaning of Web-page content plays a big role while produced a search result from a search engine. Most of the cases Web-page meaning stored in title or meta-tag area but those meanings do not always match with Web-page content. To overcome this situation we need to go through the Web-page content to identify the Web-page meaning. In such cases, where Webpage content holds dual meaning words that time it is really difficult to identify the meaning of the Web-page. In this paper, we are introducing a new design and development mechanism of identifying the Web-page content meaning which holds dual meaning words in their Web-page content.

cs.IR↗

arXiv2012

NAAS: Negotiation Automation Architecture with Buyer's Behavior Pattern Prediction Component

In this era of "Services" everywhere, with the explosive growth of E-Commerce and B2B transactions, there is a pressing need for the development of intelligent negotiation systems which consists of feasible architecture, a reliable framework and flexible multi agent based protocols developed in specialized negotiation languages with complete semantics and support for message passing between the buyers and sellers. This is possible using web services on the internet. The key issue is negotiation and its automation. In this paper we review the classical negotiation methods and some of the existing architectures and frameworks. We are proposing here a new combinatory framework and architecture, NAAS. The key feature in this framework is a component for prediction or probabilistic behavior pattern recognition of a buyer, along with the other classical approaches of negotiation frameworks and architectures. Negotiation is practically very complex activity to automate without human intervention so in the future we also intend to develop a new protocol which will facilitate automation of all the types of negotiation strategies like bargaining, bidding, auctions, under our NAAS framework.

cs.MA↗

arXiv2012

MAINWAVE: Multi Agents and Issues Negotiation for Web using Alliance Virtual Engine

This paper showcases an improved architecture for a complete negotiation system that permits multi party multi issue negotiation. The concepts of multithreading and concurrency has been utilized to perform parallel execution. The negotiation history has been implemented that stores all the records of the messages exchanged for every successful and rejected negotiation process and implements the concepts of artificial intelligence in determination of proper weights for a valid negotiation mechanism. The issues are arranged in a hierarchical pattern so as to simplify the representation and priorities are assigned to each issue, which amounts to its relative importance. There is refinement of utilities by consideration of the non-functional attributes. So as to avoid overloading of the system, a maximum number of parties are allowed to participate in the entire mechanism and if more parties arrive, they're put into a waiting queue in accordance to certain criteria such as the first come first serve or the relative priorities. This helps in fault tolerance. It also supports the formation of alliances among the various parties while carrying out a negotiation.

cs.MA↗

arXiv2012

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.

cs.IR↗

arXiv2012

Web-page Prediction for Domain Specific Web-search using Boolean Bit Mask

Search Engine is a Web-page retrieval tool. Nowadays Web searchers utilize their time using an efficient search engine. To improve the performance of the search engine, we are introducing a unique mechanism which will give Web searchers more prominent search results. In this paper, we are going to discuss a domain specific Web search prototype which will generate the predicted Web-page list for user given search string using Boolean bit mask.

cs.IR↗

arXiv2011

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.

cs.IR↗

arXiv2011

An Approach for Message Hiding using Substitution Techniques and Audio Hiding in Steganography

A crypto system can be used to encrypt messages sent between two communicating parties so that an eavesdropper who overhears the encrypted messages will not be able to decode them. The paper mainly concentrates on the method in which the substitution technique of steganography can been used to hide data in a 24-bit bitmap file. Popular audio hiding techniques based on methods of steganography is also discussed here.

cs.CR↗

arXiv2011

Offering A Product Recommendation System in E-commerce

This paper proposes a number of explicit and implicit ratings in 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 is close to that of a user who asks for a recommendation. The system is based on weighted cosine similarity measure to find out the closest user profile among the profiles of all users in database. It also implements Association rule mining rule in recommending the products. Also, this product recommendation system takes into consideration the time of transaction of purchasing the items, thus eliminating sequence recognition problem. Experimental result shows for implicit rating, the proposed method gives acceptable performance in recommending the products. It also shows introduction of association rule improves the performance measure of recommendation system.

cs.IR↗

arXiv2011

Introducing a New Mechanism for Construction of an Efficient Search Model

Search engine has become an inevitable tool for retrieving information from the WWW. Web researchers introduce lots of algorithms to modify search engine based on different features. Sometimes those algorithms are domain related, sometimes they are Web page ranking related, and sometimes they are efficiency related and so on. We are introducing such a type of algorithm which is multiple domains as well as efficiency related. In this paper, we are providing multilevel indexing on top of Index Based Acyclic Graph (IBAG) which support multiple Ontologies as well as reduce search time. IBAG contains only domains related pages and are constructed from Relevant Page Graph (RPaG). We have also provided a comparative study of time complexity for the various models.

cs.IR↗

arXiv2011

Architecture of A Scalable Dynamic Parallel WebCrawler with High Speed Downloadable Capability for a Web Search Engine

Today World Wide Web (WWW) has become a huge ocean of information and it is growing in size everyday. Downloading even a fraction of this mammoth data is like sailing through a huge ocean and it is a challenging task indeed. In order to download a large portion of data from WWW, it has become absolutely essential to make the crawling process parallel. In this paper we offer the architecture of a dynamic parallel Web crawler, christened as "WEB-SAILOR," which presents a scalable approach based on Client-Server model to speed up the download process on behalf of a Web Search Engine in a distributed Domain-set specific environment. WEB-SAILOR removes the possibility of overlapping of downloaded documents by multiple crawlers without even incurring the cost of communication overhead among several parallel "client" crawling processes.

cs.IR↗

arXiv2011

A Dynamic Web Page Prediction Model Based on Access Patterns to Offer Better User Latency

The growth of the World Wide Web has emphasized the need for improvement in user latency. One of the techniques that are used for improving user latency is Caching and another is Web Prefetching. Approaches that bank solely on caching offer limited performance improvement because it is difficult for caching to handle the large number of increasingly diverse files. Studies have been conducted on prefetching models based on decision trees, Markov chains, and path analysis. However, the increased uses of dynamic pages, frequent changes in site structure and user access patterns have limited the efficacy of these static techniques. In this paper, we have proposed a methodology to cluster related pages into different categories based on the access patterns. Additionally we use page ranking to build up our prediction model at the initial stages when users haven't already started sending requests. This way we have tried to overcome the problems of maintaining huge databases which is needed in case of log based techniques.

cs.NI↗

arXiv2011

A Syntactic Classification based Web Page Ranking Algorithm

The existing search engines sometimes give unsatisfactory search result for lack of any categorization of search result. If there is some means to know the preference of user about the search result and rank pages according to that preference, the result will be more useful and accurate to the user. In the present paper a web page ranking algorithm is being proposed based on syntactic classification of web pages. Syntactic Classification does not bother about the meaning of the content of a web page. The proposed approach mainly consists of three steps: select some properties of web pages based on user's demand, measure them, and give different weightage to each property during ranking for different types of pages. The existence of syntactic classification is supported by running fuzzy c-means algorithm and neural network classification on a set of web pages. The change in ranking for difference in type of pages but for same query string is also being demonstrated.

cs.IR↗

arXiv2011

A Domain Specific Ontology Based Semantic Web Search Engine

Since its emergence in the 1990s the World Wide Web (WWW) has rapidly evolved into a huge mine of global information and it is growing in size everyday. The presence of huge amount of resources on the Web thus poses a serious problem of accurate search. This is mainly because today's Web is a human-readable Web where information cannot be easily processed by machine. Highly sophisticated, efficient keyword based search engines that have evolved today have not been able to bridge this gap. So comes up the concept of the Semantic Web which is envisioned by Tim Berners-Lee as the Web of machine interpretable information to make a machine processable form for expressing information. Based on the semantic Web technologies we present in this paper the design methodology and development of a semantic Web search engine which provides exact search results for a domain specific search. This search engine is developed for an agricultural Website which hosts agricultural information about the state of West Bengal.

cs.IR↗

arXiv2011

Strategic Issues For A Successful E-Commerce

E-commerce is an emerging technology. Impact of this new technology is getting clearer with time and results are tangible to the user community. In this paper we have tried to focus some of its issues like paradigms, infrastructure integration, and security, which is considered to be the most important issue in E-Commerce. At first we have elaborated the paradigms of E-Commerce (Business-to-Business and Business-to-Consumer). Then comes the necessity of infrastructure integration with the legacy system. Security concerns comes next. Rest of the part contains conclusion and references.

cs.CY↗

arXiv2011

A New Semantic Web Approach for Constructing, Searching and Modifying Ontology Dynamically

Semantic web is the next generation web, which concerns the meaning of web documents It has the immense power to pull out the most relevant information from the web pages, which is also meaningful to any user, using software agents. In today's world, agent communication is not possible if concerned ontology is changed a little. We have pointed out this very problem and developed an Ontology Purification System to help agent communication. In our system you can send queries and view the search results. If it can't meet the criteria then it finds out the mismatched elements. Modification is done within a second and you can see the difference. That's why we emphasis on the word dynamic. When Administrator is updating the system, at the same time that updation is visible to the user.

cs.IR↗

arXiv2011

Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved Approach

Dictionary lookup methods are popular in dealing with ambiguous letters which were not recognized by Optical Character Readers. However, a robust dictionary lookup method can be complex as apriori probability calculation or a large dictionary size increases the overhead and the cost of searching. In this context, Levenshtein distance is a simple metric which can be an effective string approximation tool. After observing the effectiveness of this method, an improvement has been made to this method by grouping some similar looking alphabets and reducing the weighted difference among members of the same group. The results showed marked improvement over the traditional Levenshtein distance technique.

cs.IT↗

arXiv2010

A Study on Recent Approaches in Handling DDoS Attacks

In this paper, we present a study on the recent approaches in handling Distributed Denial of Service (DDoS) attacks. DDoS attack is a fairly new type of attack to cripple the availability of Internet services and resources. A DDos attack can originate from anywhere in the network and typically overwhelms the victim server by sending a huge number of packets. Several remedial measures have been proposed by various researchers. This paper attempts to discuss the recent offerings to handle the DDoS attacks.

cs.CR↗