发布求助
文献互助 智能选刊 最新文献

Web Intell. Agent Syst.最新文献

筛选
英文 中文
Spatial pattern growth and emergent animat segregation 空间格局生长与突发性动物分离
Web Intell. Agent Syst. Pub Date : 2010-04-01 DOI: 10.3233/WIA-2010-0185
K. Hawick, C. Scogings
{"title":"Spatial pattern growth and emergent animat segregation","authors":"K. Hawick, C. Scogings","doi":"10.3233/WIA-2010-0185","DOIUrl":"https://doi.org/10.3233/WIA-2010-0185","url":null,"abstract":"Spatial agent models can be used to explore self-organizing effects such as pattern growth and segregation. An approximate time line of key animat ideas and agent systems is presented and discussed. These ideas have led to a unique animat simulation model for studying emergence effects in artificial life systems and this predator-prey model is employed to study emergent behaviours in systems of up to around one million individual animat agents. The patterns, structures and emergent properties of the model are compared with the spatial patterns formed in non-intelligence based models that are governed only by statistical mechanics. An emergent species separation effect is found amongst the prey animats when a simple genetic marker is employed to track animats and introduce a microscopic breeding preference. Results are presented using quantitative metrics such as the animal spatial density and the pair-wise density-density correlation function. Ways in which these metrics can be used to categorize different self-organizational model regimes are discussed.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"25 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":"122149643","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}
引用次数: 7
Meta-agency and individual power 元机构和个人权力
Web Intell. Agent Syst. Pub Date : 2009-12-01 DOI: 10.3233/WIA-2009-0172
F. Coelho, H. Coelho
{"title":"Meta-agency and individual power","authors":"F. Coelho, H. Coelho","doi":"10.3233/WIA-2009-0172","DOIUrl":"https://doi.org/10.3233/WIA-2009-0172","url":null,"abstract":"The state of the art in the agent field is at the frontier of deploying real intelligent agents, able to build their own understanding of the world and of associated processes. Maybe that goal can be achieved through individual power: a framing concept for the agent's inner capabilities to achieve dominant goals. The research on individual power started from the BDI model and led to the distinction between external and internal factors in the agent's behaviour: while the former depends on the relation the agent has with its environment (including peers) and ties in with social power, the latter links up to the agent control and is rather less understood. In the individual power study, the focus is set on the integration of the agent's will, commitment and control structure. Such integration can be interpreted as an extension of the classic belief-desire-intention trilogy. \u0000 \u0000This paper describes an experiment about the integration of will and commitment management in the agent's control structure. The experiment consists of two teams of agents, competing for resource gathering. While one team features reactive control, the other team uses new ideas exploring meta-agency for agent control and will for behaviour design. This experiment illustrates the integration and a virtual application of previous work on these subjects. The meta-agent and mental states based control is proven able to define flexible and effective behaviours. The agent's will, by centralising the management of commitments, simplifies the implementation, debugging and interpretation of such behaviours.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125133261","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}
引用次数: 0
FICA: A novel intelligent crawling algorithm based on reinforcement learning 一种新的基于强化学习的智能爬行算法
Web Intell. Agent Syst. Pub Date : 2009-12-01 DOI: 10.3233/WIA-2009-0174
Ali Mohammad Zareh Bidoki, N. Yazdani, Pedram Ghodsnia
{"title":"FICA: A novel intelligent crawling algorithm based on reinforcement learning","authors":"Ali Mohammad Zareh Bidoki, N. Yazdani, Pedram Ghodsnia","doi":"10.3233/WIA-2009-0174","DOIUrl":"https://doi.org/10.3233/WIA-2009-0174","url":null,"abstract":"The web is a huge and highly dynamic environment which is growing exponentially in content and developing fast in structure. No search engine can cover the whole web, thus it has to focus on the most valuable pages for crawling. So an efficient crawling algorithm for retrieving the most important pages remains a challenging issue. Several algorithms like PageRank and OPIC have been proposed. Unfortunately, they have high time complexity and low throughput. In this paper, an intelligent crawling algorithm based on reinforcement learning, called FICA is proposed that models a random surfing user. The priority for crawling pages is based on a concept we call logarithmic distance. FICA is easy to implement and its time complexity is O(E*logV) where V and E are the number of nodes and edges in the web graph respectively. Comparison of FICA with other proposed algorithms shows that FICA outperforms them in discovering highly important pages. Furthermore, FICA computes the importance (ranking) of each page during the crawling process. Thus, we can also use FICA as a ranking method for computation of page importance. A nice property of FICA is its adaptability to the web in that it adjusts dynamically with changes in the web graph. We have used UK's web graph to evaluate our approach.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129447438","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}
引用次数: 8
Utility based Q-learning to facilitate cooperation in Prisoner's Dilemma games 基于效用的q学习促进囚徒困境博弈中的合作
Web Intell. Agent Syst. Pub Date : 2009-08-01 DOI: 10.3233/WIA-2009-0165
K. Moriyama
{"title":"Utility based Q-learning to facilitate cooperation in Prisoner's Dilemma games","authors":"K. Moriyama","doi":"10.3233/WIA-2009-0165","DOIUrl":"https://doi.org/10.3233/WIA-2009-0165","url":null,"abstract":"This work deals with Q-learning in a multiagent environment. There are many multiagent Q-learning methods, and most of them aim to converge to a Nash equilibrium, which is not desirable in games like the Prisoner's Dilemma (PD). However, normal Q-learning agents that use a stochastic method in choosing actions to avoid local optima may yield mutual cooperation in a PD game. Although such mutual cooperation usually occurs singly, it can be facilitated if the Q-function of cooperation becomes larger than that of defection after the cooperation. This work derives a theorem on how many consecutive repetitions of mutual cooperation are needed to make the Q-function of cooperation larger than that of defection. In addition, from the perspective of the author's previous works that discriminate utilities from rewards and use utilities for learning in PD games, this work also derives a corollary on how much utility is necessary to make the Q-function larger by one-shot mutual cooperation.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127939253","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}
引用次数: 20
Layered RDF: An object-oriented approach to web information representation 分层RDF:一种面向对象的web信息表示方法
Web Intell. Agent Syst. Pub Date : 2009-08-01 DOI: 10.3233/WIA-2009-0169
Torunn Vølstad, Fei Liu, S. Guan
{"title":"Layered RDF: An object-oriented approach to web information representation","authors":"Torunn Vølstad, Fei Liu, S. Guan","doi":"10.3233/WIA-2009-0169","DOIUrl":"https://doi.org/10.3233/WIA-2009-0169","url":null,"abstract":"Based on XML, RDF(S) has been recommended as the basic layer of the Semantic Web, providing a foundation for the higher layers of ontology, logic and trust. Although RDF(S) enables specification and identification of data and relationships between data, it has some limitations as a foundational language of the Semantic Web. Firstly, the unconstrained framework of the RDF Schema makes it hard to share information from different sources. Furthermore, RDF(S) has limited expres-siveness as a vocabulary description language, which is partly due to insufficient object-oriented features. Finally, the unclear semantics of RDF(S), caused by language constructs with dual roles, impede any approach to provide reasoning support for the language. To overcome some of the limitations, this paper presents Layered RDF, a web information representation language based on RDF(S). Layered RDF distinguishes schema information from instance information by having separated layers. Furthermore, Layered RDF provides more powerful schema mechanisms than does RDF Schema, by incorporating object-oriented features such as inheritance and polymorphism.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126946010","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}
引用次数: 1
Acquisition of a concession strategy in multi-issue negotiation 多议题谈判中让步策略的获取
Web Intell. Agent Syst. Pub Date : 2009-04-01 DOI: 10.3233/WIA-2009-0160
Y. Yasumura, Takahiko Kamiryo, Shohei Yoshikawa, K. Uehara
{"title":"Acquisition of a concession strategy in multi-issue negotiation","authors":"Y. Yasumura, Takahiko Kamiryo, Shohei Yoshikawa, K. Uehara","doi":"10.3233/WIA-2009-0160","DOIUrl":"https://doi.org/10.3233/WIA-2009-0160","url":null,"abstract":"This paper presents a method for acquiring a concession strategy of an agent in multi-issue negotiation. This method learns how to make a concession to an opponent for realizing win-win negotiation. To learn the concession strategy, we adopt reinforcement learning. First, an agent receives a proposal from an opponent. The agent recognizes a negotiation state using the difference between their proposals and the difference between their concessions. According to the state, the agent makes a proposal by reinforcement learning. A reward of the learning is a profit of an agreement and a punishment of negotiation breakdown. The experimental results showed that the agents could acquire the negotiation strategy that avoids negotiation breakdown and increases profits of an agreement. As a result, agents can acquire the action policy that strikes a balance between cooperation and competition.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114622266","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}
引用次数: 5
Privacy-conscious P2P data sharing scheme with bogus profile distribution 具有伪造配置文件分发的具有隐私意识的P2P数据共享方案
Web Intell. Agent Syst. Pub Date : 2009-04-01 DOI: 10.3233/WIA-2009-0163
M. Iguchi, Shigeki Goto
{"title":"Privacy-conscious P2P data sharing scheme with bogus profile distribution","authors":"M. Iguchi, Shigeki Goto","doi":"10.3233/WIA-2009-0163","DOIUrl":"https://doi.org/10.3233/WIA-2009-0163","url":null,"abstract":"With the increasing use of P2P (peer-to-peer) network technology in everyday services, the issue of privacy protection has gained considerable importance. This paper describes a method to realize an anonymity-conscious P2P data sharing network. The proposed network allows users to extract data possessed by other users who have similar profiles, thereby providing them with a collaborative filtering-based data recommendation. In the proposed P2P network protocol, bogus user profiles are distributed intentionally throughout the network to protect users' anonymity without harming the overall effectiveness of the data exchange. We conduct a series of simulations to prove that our proposed method protects the profile's privacy and performs efficient data exchange.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128621712","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}
引用次数: 0
Using interaction models to detect and resolve inconsistencies in evolving service compositions 使用交互模型来检测和解决不断发展的服务组合中的不一致性
Web Intell. Agent Syst. Pub Date : 2009-04-01 DOI: 10.3233/WIA-2009-0159
Renée Elio, Eleni Stroulia, Warren Blanchet
{"title":"Using interaction models to detect and resolve inconsistencies in evolving service compositions","authors":"Renée Elio, Eleni Stroulia, Warren Blanchet","doi":"10.3233/WIA-2009-0159","DOIUrl":"https://doi.org/10.3233/WIA-2009-0159","url":null,"abstract":"Service-oriented architecture is emerging as a compelling paradigm for developing web-based software applications. According to this architectural style, the functional components of the system are implemented in various programming languages as network-accessible “services” declaratively specified (in WSDL) and hierarchically composed in complex processes (using BPEL4WS). Despite this fundamentally distributed conceptualization of software architecture, most current BPEL4WS execution engines assume that the specification of the process composition is interpreted at run time by a central middleware node. This implies inflexible composition evolution: each time a partner process must be updated, all compositions to which it participates must also be updated to avoid potential failures at run time. This paper presents the WRABBIT project, which associates web services with agents capable of communication and reflective process execution. Through their reflective process execution, agents recognize run-time “conversation” errors, i.e., errors that occur due to changes in the rules of how the partner process should be composed. The agents consult declarative policy specifications to resolve such conversation failures, and they recover when these policies themselves are missing or incongruent. The ability to recover from these types of interaction errors requires an investment in a general web agent architecture that operates on a consistently modeled set of declarative specifications. The benefits and challenges of this approach for distributed services are discussed.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128942289","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}
引用次数: 4
Itinerary determination of imprecise mobile agents with firm deadline 具有确定截止日期的不精确移动代理的行程确定
Web Intell. Agent Syst. Pub Date : 2008-12-01 DOI: 10.3233/WIA-2008-0149
Luciana Rech, C. Montez, R. S. Oliveira
{"title":"Itinerary determination of imprecise mobile agents with firm deadline","authors":"Luciana Rech, C. Montez, R. S. Oliveira","doi":"10.3233/WIA-2008-0149","DOIUrl":"https://doi.org/10.3233/WIA-2008-0149","url":null,"abstract":"In some applications, as part of a mobile agent mission, there may be the necessity of meeting a firm end-to-end deadline, although with some itinerary flexibility due to optional resources. This paper proposes an execution model based on the concept of imprecise mobile agents with timing constraints. In this paper it is considered an execution model where agents do not previously know their itineraries. The imprecise mobile agent may choose among alternative and/or optional resources. The objective is to propose and to evaluate heuristics to be used individually or in pairs by imprecise mobile agents that must accomplish a mission within a firm deadline.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129414531","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}
引用次数: 4
A unified framework for multiple criteria auction mechanisms 多准则拍卖机制统一框架
Web Intell. Agent Syst. Pub Date : 2008-12-01 DOI: 10.3233/WIA-2008-0148
M. Bellosta, S. Kornman, D. Vanderpooten
{"title":"A unified framework for multiple criteria auction mechanisms","authors":"M. Bellosta, S. Kornman, D. Vanderpooten","doi":"10.3233/WIA-2008-0148","DOIUrl":"https://doi.org/10.3233/WIA-2008-0148","url":null,"abstract":"Multi-attribute auctions allow negotiations over multiple attributes besides price. Multiple criteria English reverse auction mechanisms differ regarding the aggregation model used to represent the buyer's preferences and the feedback information provided to bidders during the auction. In this paper, we present a unified framework, called MERA in order to integrate existing mechanisms and guide the design of new ones. Framework MERA both provides an automated buyer agent that manages auctions and a formal model that describes an auction mechanism. This model includes a class of preference relations used to express the buyer's preference relation, a class of request relations used to formulate the feedback, and a class of constraints used to express the initial requirements on the purchased item. We study efficiency for multiple criteria English reverse auction processes, and we show that any process derived from framework MERA is efficient.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127734685","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}
引用次数: 22
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信