The World Wide Web (WWW) has become one of the largest and most readily accessible repositories of human knowledge. The traditional search engines index only surface Web whose pages are easily found. The focus has now been moved to invisible Web or hidden Web, which consists of large warehouse of useful data such as images, sounds, presentations and many other types of media. To utilize such data, there is a need for specialized program to locate those sites as we do with search engines. This paper discusses about an effective design of a hidden Web crawler that can autonomously discover pages from the hidden Web by employing multi-agent Web mining system. A theoretical framework is suggested to investigate the resource discovery problem and the empirical results suggest substantial improvement in the crawling strategy and harvest rate.
{"title":"An Architectural Framework of a Crawler for Locating Deep Web Repositories Using Learning Multi-agent Systems","authors":"Akilandeswari Jeyapal, N. Gopalan","doi":"10.1109/ICIW.2008.94","DOIUrl":"https://doi.org/10.1109/ICIW.2008.94","url":null,"abstract":"The World Wide Web (WWW) has become one of the largest and most readily accessible repositories of human knowledge. The traditional search engines index only surface Web whose pages are easily found. The focus has now been moved to invisible Web or hidden Web, which consists of large warehouse of useful data such as images, sounds, presentations and many other types of media. To utilize such data, there is a need for specialized program to locate those sites as we do with search engines. This paper discusses about an effective design of a hidden Web crawler that can autonomously discover pages from the hidden Web by employing multi-agent Web mining system. A theoretical framework is suggested to investigate the resource discovery problem and the empirical results suggest substantial improvement in the crawling strategy and harvest rate.","PeriodicalId":139145,"journal":{"name":"2008 Third International Conference on Internet and Web Applications and Services","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126507292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In an organizational/corporative environment, each user can perform different roles throughout the time. Dynamic user profiles can be used to accomplish this variation specification. A user profile is a set of information about a given user in a given context and on a specific period of time. The concept of dynamic profiling simply means that the relevant information about the user can vary in time. User profiling is usually related to web advertisement of goods and services for a user in a Web site, by means of gathering information of the user's interests and then harvesting the web over these interests. The profile discussed in this paper is service related, directly depending from the user's condition in an organization.
{"title":"User Profiles in Corporate Scenarios","authors":"C. Teixeira, J. S. Pinto, J. A. Martins","doi":"10.1109/ICIW.2008.60","DOIUrl":"https://doi.org/10.1109/ICIW.2008.60","url":null,"abstract":"In an organizational/corporative environment, each user can perform different roles throughout the time. Dynamic user profiles can be used to accomplish this variation specification. A user profile is a set of information about a given user in a given context and on a specific period of time. The concept of dynamic profiling simply means that the relevant information about the user can vary in time. User profiling is usually related to web advertisement of goods and services for a user in a Web site, by means of gathering information of the user's interests and then harvesting the web over these interests. The profile discussed in this paper is service related, directly depending from the user's condition in an organization.","PeriodicalId":139145,"journal":{"name":"2008 Third International Conference on Internet and Web Applications and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125841583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Current approaches to transactional support of distributed processes in service-oriented environments are limited to scenarios where the participant initiating the process maintains a controlling position throughout the lifetime of the process. This constraint impedes support of complex processes where participants may only possess limited local views on the overall process. In this paper, we present a framework to extend WS-BusinessActivity that strengthens the role of the coordinator. We develop a set of rules for deciding on the confirmation or cancellation of participants' work and introduce protocol extensions for monitoring the progress of a process, allowing coordinators to initiate the completion of processes largely autonomously. We discuss motivating examples as well as existing approaches and evaluate our rule set against various service interaction patterns.
{"title":"Providing Decision Capabilities to Coordinators in Distributed Processes","authors":"Michael Von Riegen, M. Husemann, N. Ritter","doi":"10.1109/ICIW.2008.18","DOIUrl":"https://doi.org/10.1109/ICIW.2008.18","url":null,"abstract":"Current approaches to transactional support of distributed processes in service-oriented environments are limited to scenarios where the participant initiating the process maintains a controlling position throughout the lifetime of the process. This constraint impedes support of complex processes where participants may only possess limited local views on the overall process. In this paper, we present a framework to extend WS-BusinessActivity that strengthens the role of the coordinator. We develop a set of rules for deciding on the confirmation or cancellation of participants' work and introduce protocol extensions for monitoring the progress of a process, allowing coordinators to initiate the completion of processes largely autonomously. We discuss motivating examples as well as existing approaches and evaluate our rule set against various service interaction patterns.","PeriodicalId":139145,"journal":{"name":"2008 Third International Conference on Internet and Web Applications and Services","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128165699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Scalability constitutes a key property in Peer-to-Peer environments. One way to foster this property is the introduction of super-peers, a concept which has gained widespread acceptance in recent years. We solve the problem of selecting super- peers in a distributed, scalable, self-organized way, supported by network coordinates. To this end, we present an exact optimization model and introduce a distributed algorithm that addresses the problem in a decentralized fashion. By means of simulation using actual Internet distance measurements, we demonstrate the savings in communication cost attainable by our super-peer topology construction and maintenance scheme.
{"title":"Super-Peer Selection in Peer-to-Peer Networks Using Network Coordinates","authors":"P. Merz, M. Priebe, S. Wolf","doi":"10.1109/ICIW.2008.17","DOIUrl":"https://doi.org/10.1109/ICIW.2008.17","url":null,"abstract":"Scalability constitutes a key property in Peer-to-Peer environments. One way to foster this property is the introduction of super-peers, a concept which has gained widespread acceptance in recent years. We solve the problem of selecting super- peers in a distributed, scalable, self-organized way, supported by network coordinates. To this end, we present an exact optimization model and introduce a distributed algorithm that addresses the problem in a decentralized fashion. By means of simulation using actual Internet distance measurements, we demonstrate the savings in communication cost attainable by our super-peer topology construction and maintenance scheme.","PeriodicalId":139145,"journal":{"name":"2008 Third International Conference on Internet and Web Applications and Services","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129356334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mashups are composite applications that combine views and data from two or more data sources. Mashups have grown to be popular for dynamic social networks on the web. The objective of this paper is to display that mashups are useful in enterprise settings as well, since mashups can be used to organize information presented to the user according to relevance priority, and personalized, if necessary, according to the user's choices. Mashups in enterprises have better interpretation value and lesser navigation cost to the user than an individual application that is not a mashup. This paper discusses these benefits of mashups through an implementation with the aid of Microsoft Popfly.
{"title":"Data Mashups & Their Applications in Enterprises","authors":"S. Makki, Jaina Sangtani","doi":"10.1109/ICIW.2008.98","DOIUrl":"https://doi.org/10.1109/ICIW.2008.98","url":null,"abstract":"Mashups are composite applications that combine views and data from two or more data sources. Mashups have grown to be popular for dynamic social networks on the web. The objective of this paper is to display that mashups are useful in enterprise settings as well, since mashups can be used to organize information presented to the user according to relevance priority, and personalized, if necessary, according to the user's choices. Mashups in enterprises have better interpretation value and lesser navigation cost to the user than an individual application that is not a mashup. This paper discusses these benefits of mashups through an implementation with the aid of Microsoft Popfly.","PeriodicalId":139145,"journal":{"name":"2008 Third International Conference on Internet and Web Applications and Services","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133641346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Many investigations have tried to depict the character of music file-sharing, identifying it with gift-giving, without explaining the connection but what kind of gift-giving procedure it is. It is believed that this identification is rather simplistic and in order to show the identity of both activities a comparison between them is reported, presenting a threefold categorization of differences in terms of product properties, procedure, and motives. It results that file-sharing is not gift-giving and that digital music has mostly the characteristics of a socially redistributed public good.
{"title":"File-Sharing versus Gift-Giving: A Theoretical Approach","authors":"Konstantina Zerva","doi":"10.1109/ICIW.2008.95","DOIUrl":"https://doi.org/10.1109/ICIW.2008.95","url":null,"abstract":"Many investigations have tried to depict the character of music file-sharing, identifying it with gift-giving, without explaining the connection but what kind of gift-giving procedure it is. It is believed that this identification is rather simplistic and in order to show the identity of both activities a comparison between them is reported, presenting a threefold categorization of differences in terms of product properties, procedure, and motives. It results that file-sharing is not gift-giving and that digital music has mostly the characteristics of a socially redistributed public good.","PeriodicalId":139145,"journal":{"name":"2008 Third International Conference on Internet and Web Applications and Services","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124459323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
User's behaviour in browsing sessions is a valuable source of information useful to analyze user interests and personalize the human-computer interaction during information seeking tasks. In this paper we present a simple way to machine-learn user profile and employ it to improve Web searches. Searchy is a personal agent, embedded in the Web browser, able to sense user's tastes, to assist her/him during query formulation phase and, finally, to filter and sort the results according to the user's needs. Searchy uses the DART P2P network to store user's profiles in order to enable collaborative recommendations.
{"title":"SEARCHY: An Agent to Personalize Search Results","authors":"Ivan Marcialis, E. Vita","doi":"10.1109/ICIW.2008.86","DOIUrl":"https://doi.org/10.1109/ICIW.2008.86","url":null,"abstract":"User's behaviour in browsing sessions is a valuable source of information useful to analyze user interests and personalize the human-computer interaction during information seeking tasks. In this paper we present a simple way to machine-learn user profile and employ it to improve Web searches. Searchy is a personal agent, embedded in the Web browser, able to sense user's tastes, to assist her/him during query formulation phase and, finally, to filter and sort the results according to the user's needs. Searchy uses the DART P2P network to store user's profiles in order to enable collaborative recommendations.","PeriodicalId":139145,"journal":{"name":"2008 Third International Conference on Internet and Web Applications and Services","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123680813","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The introduction of information and communication technologies (ICTs) in the field of public participation led to the emergence of electronic participation (eparticipation). The area of eparticipation is currently a rapidly evolving one. Although, a few eparticipation-related frameworks have been developed they actually aimed to address specific purposes. As a result, there is no work aiming to model the whole eparticipation domain. In this paper, a first attempt to model the domain of eparticipation is presented. For this purpose, we identify and describe the most significant aspects that characterize the eparticipation domain according to the relevant literature. In addition, we define a domain model in order to formally describe these aspects and the relationships between them. This model is illustrated using a set of Unified Modeling Language (UML) package and class diagrams.
{"title":"A Domain Model for eParticipation","authors":"E. Kalampokis, E. Tambouris, K. Tarabanis","doi":"10.1109/ICIW.2008.69","DOIUrl":"https://doi.org/10.1109/ICIW.2008.69","url":null,"abstract":"The introduction of information and communication technologies (ICTs) in the field of public participation led to the emergence of electronic participation (eparticipation). The area of eparticipation is currently a rapidly evolving one. Although, a few eparticipation-related frameworks have been developed they actually aimed to address specific purposes. As a result, there is no work aiming to model the whole eparticipation domain. In this paper, a first attempt to model the domain of eparticipation is presented. For this purpose, we identify and describe the most significant aspects that characterize the eparticipation domain according to the relevant literature. In addition, we define a domain model in order to formally describe these aspects and the relationships between them. This model is illustrated using a set of Unified Modeling Language (UML) package and class diagrams.","PeriodicalId":139145,"journal":{"name":"2008 Third International Conference on Internet and Web Applications and Services","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122778742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper investigates to what extent traditional methods for usability evaluation can reveal problems and issues in pervasive games. The questions of importance for the study could be summarized as: what kind of problems in pervasive games can usability evaluation methods reveal? Which of these problems are general/traditional usability problems, which problems can be related to general problems in computer games and most importantly: which problems are unique for the genre of pervasive games? In order to approach these questions, a pervasive game prototype called "SupaFly", have been evaluated with 58 participants and by use of three standard usability evaluation methods; qualitative questionnaires, system logs and focus group interviews. The problems identified in the evaluation are analyzed and compared to categories and heuristics of previously known usability problems and problems identified in computer games (playability problems) in order to outline the problems unique for pervasive games. Of a total number of 16 issues, six issues were at least partly not covered by traditional usability and playability. Of these six issues, three problematic issues were completely unique for pervasive games: the connection between the platforms of the game (unclear relation between game platforms), the role and meaning of player positioning (unclear role of player positioning (location)) and the level of social interaction (levels of interaction not aligned with social needs).
{"title":"Investigating the Applicability of Usability and Playability Heuristics for Evaluation of Pervasive Games","authors":"Kalle Jegers","doi":"10.1109/ICIW.2008.54","DOIUrl":"https://doi.org/10.1109/ICIW.2008.54","url":null,"abstract":"This paper investigates to what extent traditional methods for usability evaluation can reveal problems and issues in pervasive games. The questions of importance for the study could be summarized as: what kind of problems in pervasive games can usability evaluation methods reveal? Which of these problems are general/traditional usability problems, which problems can be related to general problems in computer games and most importantly: which problems are unique for the genre of pervasive games? In order to approach these questions, a pervasive game prototype called \"SupaFly\", have been evaluated with 58 participants and by use of three standard usability evaluation methods; qualitative questionnaires, system logs and focus group interviews. The problems identified in the evaluation are analyzed and compared to categories and heuristics of previously known usability problems and problems identified in computer games (playability problems) in order to outline the problems unique for pervasive games. Of a total number of 16 issues, six issues were at least partly not covered by traditional usability and playability. Of these six issues, three problematic issues were completely unique for pervasive games: the connection between the platforms of the game (unclear relation between game platforms), the role and meaning of player positioning (unclear role of player positioning (location)) and the level of social interaction (levels of interaction not aligned with social needs).","PeriodicalId":139145,"journal":{"name":"2008 Third International Conference on Internet and Web Applications and Services","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121396284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose a novel approach for Web search based on the statistical information of local setting data of web browsers in a community. The members of the community share their local setting data of browsers and this enables them to take advantage of the peer community members's opinions in their Web search. Then we develop a new scheme that combines PageRank's link-based ranking scores with our proposed community based popularity scores for web sites. This hybrid scheme provides a rank- ordering method for search query results that integrates the content consumers' opinions with the content producers' opinions in a balanced manner. The users' opinions of web sites provide a solid starting point of trust for combatting web spam and improving the quality of Web search.
{"title":"A Novel Approach of Web Search Based on Community Wisdom","authors":"Weiliang Zhao, V. Varadharajan","doi":"10.1109/ICIW.2008.66","DOIUrl":"https://doi.org/10.1109/ICIW.2008.66","url":null,"abstract":"In this paper, we propose a novel approach for Web search based on the statistical information of local setting data of web browsers in a community. The members of the community share their local setting data of browsers and this enables them to take advantage of the peer community members's opinions in their Web search. Then we develop a new scheme that combines PageRank's link-based ranking scores with our proposed community based popularity scores for web sites. This hybrid scheme provides a rank- ordering method for search query results that integrates the content consumers' opinions with the content producers' opinions in a balanced manner. The users' opinions of web sites provide a solid starting point of trust for combatting web spam and improving the quality of Web search.","PeriodicalId":139145,"journal":{"name":"2008 Third International Conference on Internet and Web Applications and Services","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121590321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：