{"title":"Emotion Sensitive News Agent (ESNA): A system for user centric emotion sensing from the news","authors":"S. Masum, H. Prendinger, M. Ishizuka","doi":"10.3233/WIA-2010-0198","DOIUrl":"https://doi.org/10.3233/WIA-2010-0198","url":null,"abstract":"News is an interesting application domain for “emotion sensing”, since readers often have a personal attitude or subjective opinion regarding certain events or entities reported about. Hence the ability to determine user-centric emotion on a given topic or entity is of critical interest. This paper describes a system called Emotion Sensitive News Agent (ESNA). By employing several RSS news feeds chosen by the user, ESNA has been developed as a news aggregator to fetch news, and to categorize the themes of the collected news into eight emotional affinities, thereby taking into consideration of the user's preference profile. A user study has been conducted, which indicates that the system is conceived as intelligent and interesting as an affective interface. ESNA exemplifies a recent research agenda that aims at recognizing affective information conveyed through texts. Different approaches have already been employed to “sense” emotion from text. The novelty of the approach mentioned here is threefold: affective information conveyed through text is analyzed (1) by using a rule based approach to assign a numerical valence (i.e., a positive or negative value to indicate positive or negative sentiment of the input) instead of a machine learning approach, (2) by considering the cognitive and appraisal structure of emotions, and (3) by taking into account user preferences.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130881272","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}
T. Sugawara, K. Fukuda, Toshio Hirotsu, Shin-ya Sato, Osamu Akashi, S. Kurihara
{"title":"Fluctuated peer selection policy and its performance in large-scale multi-agent systems","authors":"T. Sugawara, K. Fukuda, Toshio Hirotsu, Shin-ya Sato, Osamu Akashi, S. Kurihara","doi":"10.3233/WIA-2010-0190","DOIUrl":"https://doi.org/10.3233/WIA-2010-0190","url":null,"abstract":"This paper describes how, in large-scale multi-agent systems, each agent's adaptive selection of peer agents for collaborative tasks affects the overall performance and how this performance varies with the workload of the system and with fluctuations in the agents' peer selection policies (PSP). An intelligent agent in a multi-agent system (MAS) often has to select appropriate agents to assign tasks that cannot be executed locally. These collaborating agents are usually chosen according to their skills. However, if multiple candidate peer agents still remain a more efficient agent is preferable. Of course, its efficiency is affected by the agent' workload and CPU performance and the available communication bandwidth. Unfortunately, as no agent in an open environment such as the Internet can obtain such data from any other agent, this selection must be done according to the available local information about the other known agents. However, this information is limited, usually uncertain and often obsolete. Agents' states may also change over time, so the PSP must be adaptive to some extent. We investigated how the overall performance of MAS would change under adaptive policies in which agents selects peer agents using statistical/reinforcement learning. We particularly focused on mutual interference for selection under different workloads, that is, underloaded, near-critical, and overloaded situations. This paper presents simulation results and shows that the overall performance of MAS highly depends on the workload. It is shown that when agents' workloads are near the limit of theoretical total capability, a greedy PSP degrades the overall performance, even after a sufficient learning time, but that a PSP with a little fluctuation, called fluctuated PSP, can considerably improve it. \u0000 \u0000This paper is the revised and extended version of our conference papers [21] and [22].","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114597154","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}
{"title":"A knowledge-based model using ontologies for personalized web information gathering","authors":"Xiaohui Tao, Yuefeng Li, N. Zhong","doi":"10.3233/WIA-2010-0189","DOIUrl":"https://doi.org/10.3233/WIA-2010-0189","url":null,"abstract":"Nowadays, how to gather useful and meaningful information from the Web has become challenging to all users because of the explosion in the amount of Web information. However, the mainstream of Web information gathering techniques has many drawbacks, as they are mostly keyword-based. It is argued that the performance of Web information gathering systems can be significantly improved if user background knowledge is discovered and a knowledge-based methodology is used. In this paper, a knowledge-based model is proposed for Web information gathering. The model uses a world knowledge base and user local instance repositories for user profile acquisition and the capture of user information needs. The knowledge-based model was successfully evaluated by comparing a manually implemented user concept model. The proposed knowledge-based model contributes to better designs of knowledge-based and personalized Web information gathering systems.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"39 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115859410","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}
F. Amigoni, Stefano Gualandi, D. Menotti, G. Sangiovanni
{"title":"A multiagent architecture for controlling the Palamede satellite","authors":"F. Amigoni, Stefano Gualandi, D. Menotti, G. Sangiovanni","doi":"10.3233/WIA-2010-0191","DOIUrl":"https://doi.org/10.3233/WIA-2010-0191","url":null,"abstract":"The fundamental role of autonomous agents in managing activities of space systems has emerged some years ago with the NASA's Remote Agent Experiment. However, the possible advantages of employing multiple agents to manage activities on a single space system are largely unexplored. This paper gives a contribution in this direction by presenting the design and the experimental validation of a multiagent architecture intended to run onboard a space satellite. Each agent is associated to a subsystem of the satellite and manages its activities. Each agent is organized in three modules, or layers: a planner, a scheduler, and an executor. Taken together across the agents, these layers form a distributed planner, a distributed scheduler, and a distributed executor, respectively. With a multiagent architecture, a number of benefits, including robustness, easy reuse of agents, and the possibility for the designer to focus on a small portion of the problem at a time, can be exploited. We experimentally validated our system in the scenario provided by Palamede, a low Earth orbit satellite under development at the Department of Aerospace Engineering of the Politecnico di Milano.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134317624","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}
{"title":"Model identification in interactive influence diagrams using mutual information","authors":"Yifeng Zeng, Prashant Doshi","doi":"10.3233/WIA-2010-0194","DOIUrl":"https://doi.org/10.3233/WIA-2010-0194","url":null,"abstract":"Interactive influence diagrams (I-IDs) offer a transparent and intuitive representation for the decision-making problem in multiagent settings. They ascribe procedural models such as influence diagrams and I-IDs to model the behavior of other agents. Procedural models offer the benefit of understanding how others arrive at their behaviors. Accurate behavioral models of others facilitate optimal decision-making in multiagent settings. However, identifying the true models of other agents is a challenging task. Given the assumption that the true model of the other agent lies within the set of models that we consider, we may utilize standard Bayesian learning to update the likelihood of each model given the observation histories of others' actions. However, as model spaces are often bounded, the true models of others may not be present in the model space. We then seek to identify models that are relevant to the observed behaviors of others and show how the agent may learn to identify these models. We evaluate the performance of our method on three repeated games and provide theoretical and empirical results in support.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125866658","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}
Bui Quang Hung, Masanori Otsubo, Y. Hijikata, S. Nishida
{"title":"HITS algorithm improvement using semantic text portion","authors":"Bui Quang Hung, Masanori Otsubo, Y. Hijikata, S. Nishida","doi":"10.3233/WIA-2010-0184","DOIUrl":"https://doi.org/10.3233/WIA-2010-0184","url":null,"abstract":"Kleinberg's Hypertext-Induced Topic Selection (HITS) algorithm is a popular and effective algorithm to rank web pages. One of its problems is the topic drift problem. Previous researches have tried to solve this problem using anchor-related text. In this paper, we investigate the effectiveness of using Semantic Text Portion for improving the HITS algorithm. In detail, we examine the degree to which we can improve the HITS algorithm. We also compare STPs with other kinds of anchor-related text from the viewpoint of improving the HITS algorithm. The experimental results demonstrate that the use of STPs is best for improving the HITS algorithm.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114591041","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}
{"title":"Anonymity services for multi-agent systems","authors":"M. Warnier, F. Brazier","doi":"10.3233/WIA-2010-0188","DOIUrl":"https://doi.org/10.3233/WIA-2010-0188","url":null,"abstract":"Anonymity can be of great importance in distributed agent applications such as e-commerce & auctions. This paper proposes and analyzes a new approach for anonymous communication of agents based on the use of handles as pseudonyms. A novel naming scheme is presented that can be used by agent platforms to provide automatic anonymity of communication for all agents on its platform, or, alternatively, to provide anonymity on demand. The paper furthermore introduces new approaches that provide authentication and anonymous payment schemes for agents. Performance measures for an anonymity service implemented for the AgentScape platform provides some insight in the overhead involved. \u0000 \u0000This paper is an extension and revision of a paper previously presented at the Third International Symposium on Information Assurance and Security [30].","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121321006","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}
{"title":"Application of rough ensemble classifier to web services categorization and focused crawling","authors":"S. Saha, C. A. Murthy, S. Pal","doi":"10.3233/WIA-2010-0186","DOIUrl":"https://doi.org/10.3233/WIA-2010-0186","url":null,"abstract":"This paper discusses the applications of rough ensemble classifier [27] in two emerging problems of web mining, the categorization of web services and the topic specific web crawling. Both applications, discussed here, consist of two major steps: (1) split of feature space based on internal tag structure of web services and hypertext to represent in a tensor space model, and (2) combining classifications obtained on different tensor components using rough ensemble classifier. In the first application we have discussed the classification of web services. Two step improvement on the existing classification results of web services has been shown here. In the first step we achieve better classification results over existing, by using tensor space model. In the second step further improvement of the results has been obtained by using Rough set based ensemble classifier. In the second application we have discussed the focused crawling using rough ensemble prediction. Our experiment regarding this application has provided better Harvest rate and better Target recall for focused crawling.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126341062","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}
Björn-Oliver Hartmann, Klemens Böhm, Andranik Khachatryan, Stephan Schosser, B. Vogt
{"title":"Incentivizing connectivity in structured Peer-to-Peer systems","authors":"Björn-Oliver Hartmann, Klemens Böhm, Andranik Khachatryan, Stephan Schosser, B. Vogt","doi":"10.3233/WIA-2010-0183","DOIUrl":"https://doi.org/10.3233/WIA-2010-0183","url":null,"abstract":"Peer-to-Peer systems (P2P systems) have received much attention both in research and in practice. P2P systems consist of autonomous entities, as peers are software artifacts chosen and controlled by humans, or they may be humans themselves, as in social networks. Thus, a peer can choose (a) its action-selection strategy, i.e., how it deals with queries on behalf of others, and (b) its link-selection strategy. In so-called structured P2P systems, a peer typically does not interact directly with another one on the application level, but forwards its queries via intermediate peers. Peers in P2P systems expect some benefit from participating. In particular, they benefit if the system is efficient, i.e., if the payoff of all participants is maximal. Since maintaining contacts incurs costs, having only few contacts is attractive. Consequently, we expect some peers to be deliberately poorly connected (dpc): They hardly have any contacts and hence low maintenance costs. Still, a dpc peer benefits from the network structure, since other peers forward its queries via their contacts. In other words, dpc is a new kind of free riding behavior, namely on the contact level (as opposed to free riding on the action level). Since, from a global perspective, a lower degree of connectivity and a higher forwarding load than necessary result, dpc reduces efficiency. In this article we introduce a formal model to show that in many situations dpc indeed leads to a higher payoff than having many links, i.e., cooperation. Further, we show by means of an economic experiment that humans actually do resort to dpc in network-formation situations. To deal with this situation, we propose an incentive mechanism against dpc. The idea is that participants are more cooperative against peers which obviously are not dpc, compared to other peers. We show the effectiveness of our mechanism with a formal analysis.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121147977","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}
{"title":"Information security underlying transparent computing: Impacts, visions and challenges","authors":"Yaoxue Zhang, L. Yang, Yuezhi Zhou, Wenyuan Kuang","doi":"10.3233/WIA-2010-0187","DOIUrl":"https://doi.org/10.3233/WIA-2010-0187","url":null,"abstract":"The rapid development of computer network technologies and social informationalization has brought many new opportunities and challenges in information security. With improved information and service sharing enjoyed by more and more people, how to strengthen the information security has become an increasingly critical issue. In this paper, we propose a new network security mechanism based on a novel computing paradigm, i.e., transparent computing, which is based on the extended von Neumann architecture. This paradigm separates the program storage and execution, which is implemented in the network environment. It is realized by a new generation server and client BIOS, namely EFI BIOS, and coordinated with the MetaOS management platform and related switching and input/ouput devices of transparent computing. Through the interface between hardware and software, it conducts effective control, monitoring and management of data and instructions in a block-streaming way for the operating system and the application programs above it. At the same time, it adopts a security protection mechanism to prevent and remove prevalent malicious software such as worm and Trojan horse. Several demonstrated examples are described in detail to illustrate the attractive and promising security features and advantages.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129179228","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}