2011 11th International Conference on Intelligent Systems Design and Applications最新文献

筛选
英文 中文
Topology-based indoor localization by means of WiFi fingerprinting with a computational intelligent classifier 基于WiFi指纹和计算智能分类器的室内拓扑定位
2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121792
Pablo Menendez, Carmen Campomanes, Krzysztof Trawiński, J. M. Alonso
{"title":"Topology-based indoor localization by means of WiFi fingerprinting with a computational intelligent classifier","authors":"Pablo Menendez, Carmen Campomanes, Krzysztof Trawiński, J. M. Alonso","doi":"10.1109/ISDA.2011.6121792","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121792","url":null,"abstract":"This paper introduces a new system for people localization in indoor environments. It is mainly based on an intelligent classifier able to distinguish among a set of predefined and well identified topological locations. We adopt a WiFi signal strength fingerprint approach where most effort is done during the training phase, while online execution is fast and effective. Our proposal has been tested in a real environment with data collected in five different experimental sessions. Achieved results are encouraging since they overcome those ones provided by the well-known nearest neighbour fingerprint matching algorithm, that is usually considered as baseline for WiFi localization.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134376298","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}
引用次数: 6
Behavior-based decentralized approach for cooperative control of a multiple small scale unmanned helicopter 基于行为的多架小型无人直升机分散协同控制方法
2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121654
V. K. Kaliappan, Hanmaro Yong, D. Min, A. Budiyono
{"title":"Behavior-based decentralized approach for cooperative control of a multiple small scale unmanned helicopter","authors":"V. K. Kaliappan, Hanmaro Yong, D. Min, A. Budiyono","doi":"10.1109/ISDA.2011.6121654","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121654","url":null,"abstract":"RUAV (Rotorcraft based Unmanned Aerial Vehicle) have been exploited in various fields such as surveillance, reconnaissance and search. Most of the study in this area is focused on single RUAV; however using multiple unmanned vehicles is big advantage to accomplish the mission in a short time and effective way. Moreover little amount of research has been undertaken in the development of multiple RUAV control systems. This paper proposes a behavior-based decentralized approach that allows an RUAV to carry out its own mission of flying to a specified region while the distances between RUAVs are maintained constantly to avoid collision. The main goal of the proposed controller is to make the RUAV cooperate among each other to achieve the defined task. In this research Reynold's flocking model based behavior approach has been utilized. Along with this the testing environment for multiple RUAV is developed to validate proposed control algorithm. Complete setup is implemented and run under QNX RTOS, based on PC104 embedded board. The multiple RUAV is tested and evaluated using HILS (Hardware-In-the-Loop Simulation). To validate the proposed approach, simulation is performed to achieve the waypoint with multiple RUAVs.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133080262","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}
引用次数: 6
A Grouping Harmony Search approach for the Citywide WiFi deployment problem 针对全市WiFi部署问题的分组和谐搜索方法
2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121793
I. Landa-Torres, S. Gil-Lopez, J. Ser, S. Salcedo-Sanz, D. Manjarrés, J. A. Portilla-Figueras
{"title":"A Grouping Harmony Search approach for the Citywide WiFi deployment problem","authors":"I. Landa-Torres, S. Gil-Lopez, J. Ser, S. Salcedo-Sanz, D. Manjarrés, J. A. Portilla-Figueras","doi":"10.1109/ISDA.2011.6121793","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121793","url":null,"abstract":"This paper presents a novel Grouping Harmony Search (GHS) algorithm for the Citywide Ubiquitous WiFi Network Design problem (WIFIDP). The WIFIDP is a NP-hard problem where private customers owning wireless access points connected to Internet share bandwidth with third parties. Aspects such as allocated budget and router capacities (coverage radius, capacity, price, etc) are taken into account in order to obtain the optimal network deployment (in terms of cost-effectiveness) when applying the GHS algorithm. The approach to tackle the aforementioned WIFIDP problem consists of a hybrid Grouping Harmony Search (GHS) algorithm with a local search method and a technique for repairing unfeasible solutions. Furthermore, the presented GHS algorithm is differential, since each proposed harmony is produced (improvised) based on the same harmony in the previous iteration. This differential scheme employs the grouping concept based on the connectivity between nomadic users and routers, which increases significantly its searching capability. Preliminary Monte Carlo simulations show that this proposed technique statistically outperforms genetically-inspired algorithms previously presented for the WIFIDP, with an emphasis in scenarios with stringent capacity and budget constraints. This first approach paves the way for future research aimed at applying the proposed algorithm to real scenarios.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121446788","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
Learning Bayesian Network structures using Multiple Offspring Sampling 使用多子代抽样学习贝叶斯网络结构
2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121682
E. B. D. Santos, N. Ebecken, Estevam Hruschka
{"title":"Learning Bayesian Network structures using Multiple Offspring Sampling","authors":"E. B. D. Santos, N. Ebecken, Estevam Hruschka","doi":"10.1109/ISDA.2011.6121682","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121682","url":null,"abstract":"Variable Ordering (VO) plays an important role when inducing Bayesian Networks (BNs). Previous works in the literature suggest that it is worth pursuing the use of evolutionary strategies for identifying a suitable VO, when learning a Bayesian Network structure from data. This paper proposes a hybrid adaptive algorithm named VOMOS (Variable Ordering Multiple Offspring Sampling) where the new individuals are created using a set of recombination operators (crossover and mutation operators). Experiments performed in datasets revealed that the VOMOS approach is promising and tends to generate consistent and representative BNs.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129278036","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
A shared context approach for supporting experts in data ETL (Extraction, Transformation and Loading) processes 一种共享上下文方法,用于支持数据ETL(提取、转换和加载)过程中的专家
2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121741
H. Tahir, P. Brézillon
{"title":"A shared context approach for supporting experts in data ETL (Extraction, Transformation and Loading) processes","authors":"H. Tahir, P. Brézillon","doi":"10.1109/ISDA.2011.6121741","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121741","url":null,"abstract":"Many experts in data integration often use standard procedures to accomplish the process of extracting data from the existing source systems in order to be transformed and loaded into new target systems such as a data warehouse or ERP (Enterprise Resource Planning) applications. The process is called ETL (Extraction, Transformation and Loading) process. There are different ways of applying such a process by different actors because they do not have the same viewpoints in the contexts in which the process occurs. To create an effective strategy and minimize risks, actors need to devote their efforts to develop new practices to meet the current business and IT needs, and mainly use past expert experience. The paper presents how to contextualize ETL processes based on different expert viewpoints. We show how making shared context explicit can help to improve the ETL process and, thus, avoid conflicts between experts having different viewpoints. We illustrate our proposal by using a software tool called Contextual Graphs (CxGs). The paper is intended to provide the basis for the development of an experience base that will be used by a support system for data migration experts.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129247884","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
An architecture for web information agents web信息代理的体系结构
2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121624
Hassan A. Sleiman, R. Corchuelo
{"title":"An architecture for web information agents","authors":"Hassan A. Sleiman, R. Corchuelo","doi":"10.1109/ISDA.2011.6121624","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121624","url":null,"abstract":"Many authors are researching on information extraction techniques to transform the semi-structured information in typical web pages into structured information. When a researcher devises a new technique, he or she has to validate it, which requires implementing it, experimenting, gathering precision and recall results, comparing it to others, and drawing conclusions. This involves an array of details that are specific to this technique, but many others that are actually shared with other proposals. Unfortunately, the literature does not provide a single up-to-date platform to guide software engineers and researches in the design and implementation of information extractors. In this paper, we present a platform to design and implement learners of information extraction rules. Due to space constraints, we focus on the class of learners that learn hierarchical transducers. We have implemented our platform, and we have validated it by means of three case studies.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117174573","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
Towards the analysis of co-authorship networks by iterative spectral partitioning 基于迭代谱划分的合作网络分析
2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121635
V. Snás̃el, P. Krömer, J. Platoš
{"title":"Towards the analysis of co-authorship networks by iterative spectral partitioning","authors":"V. Snás̃el, P. Krömer, J. Platoš","doi":"10.1109/ISDA.2011.6121635","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121635","url":null,"abstract":"Spectral partitioning is a well known method in the area of graph and matrix analysis. Several approaches based on spectral partitioning and spectral clustering were used to detect structures and mine data from real world networks. In this paper, we use a simple spectral decomposition to analyze a co-authorship network. We use a straightforward approach based on algebraic connectivity and characteristic valuation and show that even this simple form of spectral partitioning is useful for the analysis of relations and communities in a co-authorship networks.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114595140","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
A multi-objective genetic algorithm for the Protein Structure Prediction 蛋白质结构预测的多目标遗传算法
2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121803
Alfonso E. Márquez Chamorro, F. Divina, J. Aguilar-Ruiz, G. Asencio-Cortés
{"title":"A multi-objective genetic algorithm for the Protein Structure Prediction","authors":"Alfonso E. Márquez Chamorro, F. Divina, J. Aguilar-Ruiz, G. Asencio-Cortés","doi":"10.1109/ISDA.2011.6121803","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121803","url":null,"abstract":"The Protein Structure Prediction (PSP) problem consists of predicting the structure of a protein from its amino acids sequence, and have received much attention lately. In fact, being able to predict the structure of a protein, would allow to know the function of the protein. In this paper, we propose a multi-objective evolutionary algorithm for the PSP problem. The prediction model consists of a set of rules that determine possible contacts between amino acids. Such rules are based on four specific amino acid properties, which are involved in the folding process: hydrophobicity, polarity, net charge and residue size. In order to increase the interpretability of the results, rules are organized in a 20x20 matrix where each cell contains the specific rules for a possible pair of residues. The high accuracy values obtained confirm the validity of our proposal.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116189704","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
Analyzing belief function networks with conditional beliefs 分析具有条件信念的信念函数网络
2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121782
I. Boukhris, Zied Elouedi, S. Benferhat
{"title":"Analyzing belief function networks with conditional beliefs","authors":"I. Boukhris, Zied Elouedi, S. Benferhat","doi":"10.1109/ISDA.2011.6121782","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121782","url":null,"abstract":"The success of Bayesian networks is due to their capability to simply represent (in)dependence and to be a compact representation of a full joint distribution of the set of random variables involved in the studied system. Since belief function theory is known as a general framework to reason under uncertainty, it is expected that belief function networks with conditional beliefs are a generalization of Bayesian networks. This paper studies different forms of belief function networks. We discuss the ones defined with one conditional for all parents and the ones defined per single parent. In particular, we discuss the case when beliefs are Bayesian situations where a belief function network fails to collapse into a Bayesian network.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114619822","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}
引用次数: 6
Non-blocking tag scanning for passive RFID localization 无源RFID定位的非阻塞标签扫描
2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121812
Keyvan Kashkouli Nejad, Xiaohong Jiang, M. Kameyama
{"title":"Non-blocking tag scanning for passive RFID localization","authors":"Keyvan Kashkouli Nejad, Xiaohong Jiang, M. Kameyama","doi":"10.1109/ISDA.2011.6121812","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121812","url":null,"abstract":"The simple and cheap passive RFID tag systems have recently been used for efficient localization of indoor mobile robots, where each RFID tag stores its own absolute position and the mobile robot carrying an RFID reader scans the RFID tags to localize itself. The available localization schemes using passive RFID systems do not consider the scanning delay which may cause location estimation error especially when the robot moves with a high speed. In this paper, a new Non-Blocking scanning (reading) scheme is proposed to avoid collisions such that the scanning delay and consequently the localization error can be reduced. This scheme avoids collision among tags replies by assigning tags IDs based on the FCA coloring scheme. Theoretical and simulation studies indicate that the new Non-Blocking scheme combined with the new tag arrangement pattern can achieve a good RFID localization performance in terms of both estimation error and scanning delay.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114688942","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
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学术文献互助群
群 号:604180095
Book学术官方微信