2014 IEEE 26th International Conference on Tools with Artificial Intelligence最新文献

筛选
英文 中文
A Syntactic Approach to Revising Epistemic States with Uncertain Inputs 不确定输入下认知状态修正的句法方法
Kim Bauters, Weiru Liu, Jun Hong, L. Godo, C. Sierra
{"title":"A Syntactic Approach to Revising Epistemic States with Uncertain Inputs","authors":"Kim Bauters, Weiru Liu, Jun Hong, L. Godo, C. Sierra","doi":"10.1109/ICTAI.2014.32","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.32","url":null,"abstract":"Revising its beliefs when receiving new information is an important ability of any intelligent system. However, in realistic settings the new input is not always certain. A compelling way of dealing with uncertain input in an agent-based setting is to treat it as unreliable input, which may strengthen or weaken the beliefs of the agent. Recent work focused on the postulates associated with this form of belief change and on finding semantical operators that satisfy these postulates. In this paper we propose a new syntactic approach for this form of belief change and show that it agrees with the semantical definition. This makes it feasible to develop complex agent systems capable of efficiently dealing with unreliable input in a semantically meaningful way. Additionally, we show that imposing restrictions on the input and the beliefs that are entailed allows us to devise a tractable approach suitable for resource-bounded agents or agents where reactive ness is of paramount importance.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116115458","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
Text Summarization Based on Sentence Selection with Semantic Representation 基于语义表示的句子选择的文本摘要
Chi Zhang, Lei Zhang, Chong-Jun Wang, Junyuan Xie
{"title":"Text Summarization Based on Sentence Selection with Semantic Representation","authors":"Chi Zhang, Lei Zhang, Chong-Jun Wang, Junyuan Xie","doi":"10.1109/ICTAI.2014.93","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.93","url":null,"abstract":"Text summarization is of great importance to solve information overload. Salience and coverage are two most important issues for summaries. Most existing models extract summaries by selecting the top sentences with highest scores without using the relationships between sentences, and usually represent the sentences simply basing on lexical or statistical features. As a result, those models can not achieve salience or coverage very well. In this paper, we propose a novel summarization model called Sentence Selection with Semantic Representation (SSSR). SSSR ensures both salience and coverage by learning semantic representations for sentences and applying a well-designed selection strategy to select summary sentences. The selection strategy used in SSSR is to select sentences that can reconstruct the original document with least distortion by means of linear combination. Besides, we improve our selection strategy by reducing redundant information. Then we learn two semantic representations for sentences: (1) weighted mean of word embeddings, (2) deep coding. Both of them are semantic and compact, and can capture similarities between sentences. Extensive experiments on datasets DUC2006 and DUC2007 validate our model.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121117880","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
Building Portfolios for Parallel Constraint Solving by Varying the Local Consistency Applied 基于局部一致性的并行约束求解组合
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.112
M. Dasygenis, Kostas Stergiou
{"title":"Building Portfolios for Parallel Constraint Solving by Varying the Local Consistency Applied","authors":"M. Dasygenis, Kostas Stergiou","doi":"10.1109/ICTAI.2014.112","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.112","url":null,"abstract":"Portfolio based approaches to constraint solving aim at exploiting the variability in performance displayed by different solvers or different parameter settings of a single solver. Such approaches have been quite successful in both a sequential and a parallel processing mode. Given the increasingly larger number of available processors for parallel processing, an important challenge when designing portfolios is to identify solver parameters that offer diversity in the exploration of the search space and to generate different solver configurations by automatically tuning these parameters. In this paper we propose, for the first time, a way to build porfolios for parallel solving by parameter zing the local consistency property applied during search. To achieve this we exploit heuristics for adaptive propagation proposed in stergiou08. We show how this approach can result in the easy automatic generation of portfolios that display large performance variability. We make an experimental comparison against a standard sequential solver as well as portfolio based methods that use randomization of the variable ordering heuristic as the source of diversity. Results demonstrate that our method constantly outperforms the sequential solver and in most cases it is more efficient than the other portfolio approaches.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116453664","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}
引用次数: 3
Knowledge Transfer for Reducing Calibration Time in Brain-Computer Interfacing 减少脑机接口校准时间的知识转移
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.100
Sami Dalhoumi, G. Dray, J. Montmain
{"title":"Knowledge Transfer for Reducing Calibration Time in Brain-Computer Interfacing","authors":"Sami Dalhoumi, G. Dray, J. Montmain","doi":"10.1109/ICTAI.2014.100","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.100","url":null,"abstract":"Reducing calibration time while maintaining good classification accuracy has been one of the most challenging problems in electroencephalography (EEG) -based brain-computer interfaces (BCIs) research during the last years. Most of machine learning approaches that have been attempted to address this issue are based on knowledge transfer between different BCIs users. Assuming that there is a common underlying data generating process, they try to learn a subject-independent classification model from multiple users in order to classify data of future users. In this paper, we propose a novel approach that allows inter-subjects classification of EEG signals without relying on the strong assumptions considered in previous work. It consists of learning a prediction model of a new BCI user through an ensemble of classifiers where base classifiers are trained on data from other users separately and weighted according to the performance of the ensemble on few labeled data of the new user. Evaluation on real EEG data showed that our approach allows achieving good classification accuracy when the size of calibration set is small.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127959952","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
An Application of Adapted A* Decentralized Approach for On Demand Transportation Problem 适应A*分散方法在随需应变交通问题中的应用
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.141
Mohamad El Falou, A. Malas, M. Itmi, S. E. Falou, A. Cardon
{"title":"An Application of Adapted A* Decentralized Approach for On Demand Transportation Problem","authors":"Mohamad El Falou, A. Malas, M. Itmi, S. E. Falou, A. Cardon","doi":"10.1109/ICTAI.2014.141","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.141","url":null,"abstract":"In recent years, the \"on demand transport-ODT\" systems are increasingly popular in many cities around the world. An ODT system is defined by three components: the infrastructure of the city, the vehicles and the client's requests. Clients formulate requests for transportation between a pickup and a drop off places. These requests must be served on time by satisfying a set of constraints. We propose a new approach to resolve ODT problem as a multi-agent distributed planning problem. Our model reduces the exponential complexity of the problem, when solved by a decentralized approach based on A algorithm, to be polynomial. The experimental results confirm the effectiveness of our approach to have a real-time scale up system. Our mutli-agent model is a strong first step to have a realistic ODT system taking into account environment and transport infrastructure conditions.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133566501","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
Tri-Rank: An Authority Ranking Framework in Heterogeneous Academic Networks by Mutual Reinforce 三阶:异质学术网络中相互强化的权威排序框架
Zhirun Liu, Heyan Huang, Xiaochi Wei, Xian-Ling Mao
{"title":"Tri-Rank: An Authority Ranking Framework in Heterogeneous Academic Networks by Mutual Reinforce","authors":"Zhirun Liu, Heyan Huang, Xiaochi Wei, Xian-Ling Mao","doi":"10.1109/ICTAI.2014.80","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.80","url":null,"abstract":"Recently, authority ranking has received increasing interests in both academia and industry, and it is applicable to many problems such as discovering influential nodes and building recommendation systems. Various graph-based ranking approaches like PageRank have been used to rank authors and papers separately in homogeneous networks. In this paper, we take venue information into consideration and propose a novel graph-based ranking framework, Tri-Rank, to co-rank authors, papers and venues simultaneously in heterogeneous networks. This approach is a flexible framework and it ranks authors, papers and venues iteratively in a mutually reinforcing way to achieve a more synthetic, fair ranking result. We conduct extensive experiments using the data collected from ACM Digital Library. The experimental results show that Tri-Rank is more effective and efficient than the state-of-the-art baselines including PageRank, HITS and Co-Rank in ranking authors. The papers and venues ranked by Tri-Rank also demonstrate that Tri-Rank is rational.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116791352","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}
引用次数: 26
SAT-Based Approaches to Treewidth Computation: An Evaluation 基于sat的树宽计算方法:评价
J. Berg, M. Järvisalo
{"title":"SAT-Based Approaches to Treewidth Computation: An Evaluation","authors":"J. Berg, M. Järvisalo","doi":"10.1109/ICTAI.2014.57","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.57","url":null,"abstract":"Tree width is an important structural property of graphs, tightly connected to computational tractability in eg various constraint satisfaction formalisms such as constraint programming, Boolean satisfiability, and answer set programming, as well as probabilistic inference, for instance. An obstacle to harnessing tree width as a way to efficiently solving bounded tree width instances of NP-hard problems is that deciding tree width, and hence computing an optimal tree-decomposition, is in itself an NP-complete problem. In this paper, we study the applicability of Boolean satisfiability (SAT) based approaches to determining the tree widths of graphs, and at the same time obtaining an associated optimal tree-decomposition. Extending earlier studies, we evaluate various SAT and Max SAT based strategies for tree width computation, and compare these approaches to practical dedicated exact algorithms for the problem.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117211412","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}
引用次数: 33
Intelligent Management of Brain Markers for Early Prognosis of the Spatiotemporal Growth of Gliomas 脑标记物智能管理对胶质瘤时空生长的早期预后的影响
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.102
Petros Toumpaniaris, D. Verganelakis, N. Spanoudakis, M. Zervakis
{"title":"Intelligent Management of Brain Markers for Early Prognosis of the Spatiotemporal Growth of Gliomas","authors":"Petros Toumpaniaris, D. Verganelakis, N. Spanoudakis, M. Zervakis","doi":"10.1109/ICTAI.2014.102","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.102","url":null,"abstract":"The diagnosis and treatment of brain gliomas has still many weaknesses and is followed by a high mortality rate and very low life expectancy. Facing towards the tendency for a personalized diagnosis and therapy, any effort should be focused to the spatiotemporal growth of the tumor for the early prognosis and treatment of the gliomas. In the above context, this study aims to analyze the brain markers choline (Cho) and fractional anisotropy (FA) in order to determine whether they are reliable indices of glioma presence in a brain region, before this region is damaged to such an extent that will be visible in the classic magnetic resonance imaging. This study is based on the experimental analysis of Cho from the spectrum of metabolites and FA from the diffusion tensor image, aiming ultimately to the improvement of the diagnosis and thus the therapy and the life expectancy rate of the patients suffering from glioma.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130999108","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
Agent Division and Fusion for Task Execution in Undependable Multiagent Systems 非可靠多智能体系统中任务执行的智能体划分与融合
Yifeng Zhou, Yichuan Jiang
{"title":"Agent Division and Fusion for Task Execution in Undependable Multiagent Systems","authors":"Yifeng Zhou, Yichuan Jiang","doi":"10.1109/ICTAI.2014.66","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.66","url":null,"abstract":"In multiagent systems, agents with limited capacity often cooperate in order to accomplish various types of tasks. Due to the openness of multiagent systems, agents may run the risk of their cooperations to accomplish tasks because of some involved undependable agents. The state of the art for handling this problem concentrates on the phase of task allocation, which aims to allocate tasks to more dependable agents (task allocation-oriented). In fact, accomplishing a task in a multiagent system requires two phases: i) task allocation, and ii) task execution. Hence, this paper, on the contrary, focuses on managing the phase of task execution to guarantee the performance of task accomplishment (task execution-oriented). To reduce the performance loss caused by undependable agents, the proposed agent division and fusion mechanism enables agents to autonomously divide themselves into sub-agents for executing tasks with different risks (more resources will be assigned to the sub-agent with lower risk in task execution), then the sub-agents can also fuse together and make a re-division to fit the current task environments. This work is also expected to be able to complement the existing state of the art (task allocation-oriented) for guaranteeing the performance of task accomplishment in undependable multiagent systems from task execution-oriented perspective.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"26 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134281032","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
Asynchronous Computing of a Discrete Voronoi Diagram on a Cellular Automaton Using 1-Norm: Application to Roadmap Extraction 元胞自动机上离散Voronoi图的1-范数异步计算:在路线图提取中的应用
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.130
Nassim Kaldé, Olivier Simonin, F. Charpillet
{"title":"Asynchronous Computing of a Discrete Voronoi Diagram on a Cellular Automaton Using 1-Norm: Application to Roadmap Extraction","authors":"Nassim Kaldé, Olivier Simonin, F. Charpillet","doi":"10.1109/ICTAI.2014.130","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.130","url":null,"abstract":"This article addresses the problem of computing a Voronoi diagram in a distributed fashion without any synchronization heuristic. To our knowledge, no previous work asynchronously solves this problem. We investigate a simple case of a synchronism and tackle this challenge in a decentralized fashion on a grid of communicating cells with a von Neumann neighborhood. We describe algorithms for extracting single site, area and pseudo line Voronoi diagrams. These algorithms are implemented and executed on maps in which we consider different kinds of sites defined as simple polygonal shapes to extract roadmaps.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"93 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133071927","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}
引用次数: 2
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学术官方微信