{"title":"Multiple face recognition in real-time using cloud computing, Emgu CV and Windows Azure","authors":"Diego von Sohsten, S. Murilo","doi":"10.1109/ISDA.2013.6920723","DOIUrl":"https://doi.org/10.1109/ISDA.2013.6920723","url":null,"abstract":"Multiple face recognition has several applications, such as in the areas of security and robotics. Recognition and classification techniques have been developed in recent years, through different programming languages and approaches. However, the level of detailing often requires a high processing power. This article proposes the use of cloud computing - more specifically, Windows Azure platform - to identify possible performance gains while testing EmguCV framework.","PeriodicalId":135313,"journal":{"name":"2013 13th International Conference on Intellient Systems Design and Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133938675","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}
Sanjiban Sekhar Roy, S. Charaborty, Swapnil Sourav, A. Abraham
{"title":"Rough set theory approach for filtering spams from boundary messages in a chat system","authors":"Sanjiban Sekhar Roy, S. Charaborty, Swapnil Sourav, A. Abraham","doi":"10.1109/ISDA.2013.6920763","DOIUrl":"https://doi.org/10.1109/ISDA.2013.6920763","url":null,"abstract":"This paper purports a refreshing spam discovery technology for chat system based on rough set theory. Nowadays, spam is very much allied with a huge chunk of data transferred through internet involving all disturbing and unsolicited contents received via different web-services such as chat systems, e-mail, forums and web logs. In this paper, we have reviewed various past research works of filtering SPAM and propose a novel filtering technique for SPAM especially for chat system with the support of classical rough set theory. Simulation results clearly indicate that our proposed method, can achieve higher accuracy in spam detection as compared to the existing strategies.","PeriodicalId":135313,"journal":{"name":"2013 13th International Conference on Intellient Systems Design and Applications","volume":"561 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116869968","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":"Text2MARK: A text mining tool in the aid of knowledge representation","authors":"Clay Palmeira da Silva, J. Morais, D. Monteiro","doi":"10.1109/ISDA.2013.6920741","DOIUrl":"https://doi.org/10.1109/ISDA.2013.6920741","url":null,"abstract":"Representing knowledge in the beginning of the 21st century has become a challenge due to the large volume of information to which we are submitted. Associate intelligent techniques have become a relevant method in this context, however studies are still lacking with the aim of making the process simpler for the user. Considering the current state of the art of NLP text labelers, this proposal is based on texting efficiently and without complexity through the use of free texts. We evaluated this proposal using concept maps to represent knowledge of entity relationships and compared the maps with the approach of the conceptual model. This proposal was able to satisfy the representation with a correct percentage rate of over 90%.","PeriodicalId":135313,"journal":{"name":"2013 13th International Conference on Intellient Systems Design and Applications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123592115","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":"Fault identification by incomplete, asynchronous and partially unforeseen events","authors":"L. Troiano, M. Vitelli","doi":"10.1109/ISDA.2013.6920704","DOIUrl":"https://doi.org/10.1109/ISDA.2013.6920704","url":null,"abstract":"Fault identification represents the preliminary step in solving or preventing a failure in reliable systems. The identification passes through the recording and analysis of events used as probes of underlying fault. Sometimes those events are incomplete, they can have in any order and novel in part. In this paper we propose a model based on Bayesian reasoning as means to isolate compatible faults.","PeriodicalId":135313,"journal":{"name":"2013 13th International Conference on Intellient Systems Design and Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123603795","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":"Extracting workflow structures through Bayesian learning and provenance data","authors":"Mahsa Naseri, S. Ludwig","doi":"10.1109/ISDA.2013.6920756","DOIUrl":"https://doi.org/10.1109/ISDA.2013.6920756","url":null,"abstract":"Mining workflow models has been a problem of interest for the past few years. Event logs have been the main source of data for the mining process. Previous workflow mining approaches mostly focused on mining control flows that were based on data mining methods, as well as exploited time constraints of events to discover the workflow models. In this work, we present a mining approach which not only takes the behaviourial aspect of workflows into account, but also takes advantage of their informational perspective. Provenance information is a source of reasoning, learning, and analysis since it provides information regarding the service inputs, outputs and quality of service values. Therefore, provenance information along with Bayesian structure-learning methods are exploited for this purpose. Two constraint-based Bayesian structure-learning algorithms are investigated and modified in order to make use of additional provenance information. We will show that this leads to better mining results based on three common mining scenarios.","PeriodicalId":135313,"journal":{"name":"2013 13th International Conference on Intellient Systems Design and Applications","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124039072","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":"Modeling expert preference using the qualitative belief function framework","authors":"A. Ennaceur, Zied Elouedi, E. Lefevre","doi":"10.1109/ISDA.2013.6920715","DOIUrl":"https://doi.org/10.1109/ISDA.2013.6920715","url":null,"abstract":"This paper investigates the problem of preference modeling under multi-criteria decision making methods in which some assessments cannot be provided in the pair-wise comparison process. Therefore, we introduce a new method that will be able to elicitate preferences in an uncertain environment, where the expert may express incomplete and incomparable ones. Indeed, we suggest to transform these qualitative assessments into quantitative information based on belief function framework. Then, in order to illustrate our approach, we propose to compare our method to the existing approaches.","PeriodicalId":135313,"journal":{"name":"2013 13th International Conference on Intellient Systems Design and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128619794","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}
Ali Pesaranghader, N. Mustapha, Ahmad Pesaranghader
{"title":"Applying semantic similarity measures to enhance topic-specific web crawling","authors":"Ali Pesaranghader, N. Mustapha, Ahmad Pesaranghader","doi":"10.1109/ISDA.2013.6920736","DOIUrl":"https://doi.org/10.1109/ISDA.2013.6920736","url":null,"abstract":"As the Internet grows rapidly, finding desirable information becomes a tedious and time consuming task. Topic-specific web crawlers, as utopian solutions, tackle this issue through traversing the Web and collecting information related to the topic of interest. In this regard, various methods are proposed. Nevertheless, they hardly consider desired sense of the given topic which would certainly play an important role to find relevant web pages. In this paper, we attempt to improve topic-specific web crawling by disambiguating the sense of the topic. This would avoid crawling irrelevant links interlaced with other senses of the topic. For this purpose, by considering links hypertext semantic, we employ Lin semantic similarity measure in our crawler, named LinCrawler, to distinguish topic sense-related links from the others. Moreover, we compare LinCrawler against TFCrawler which only considers frequency of terms in hypertexts. Experimental results show LinCrawler outperforms TFCrawler to collect more relevant web pages.","PeriodicalId":135313,"journal":{"name":"2013 13th International Conference on Intellient Systems Design and Applications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116932898","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":"Agents of Things (AoT): An intelligent operational concept of the Internet of Things (IoT)","authors":"Anas M. Mzahm, M. S. Ahmad, Alicia Y. C. Tang","doi":"10.1109/ISDA.2013.6920728","DOIUrl":"https://doi.org/10.1109/ISDA.2013.6920728","url":null,"abstract":"In this conceptual paper, we review the definitions, characteristics, and architecture of the Internet of Things (IoT) concept. We then identify the deficiencies of the IoT concept, analyze them, and discover the issue of lack of reasoning and intelligence in the IoT concept. We propose a solution to augment the IoT with intelligent software agents resulting in a new concept called the Agents of Things (AoT). The paper presents the AoT architecture and a scenario for one application of the proposed concept. Finally, it discusses the benefits of implementing AoT concept to solve real world issues and the future work.","PeriodicalId":135313,"journal":{"name":"2013 13th International Conference on Intellient Systems Design and Applications","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133119108","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":"Solving Asymmetric Traveling Salesman Problems using a generic Bee Colony Optimization framework with insertion local search","authors":"L. Wong, A. Khader, M. Al-Betar, T. Tan","doi":"10.1109/ISDA.2013.6920757","DOIUrl":"https://doi.org/10.1109/ISDA.2013.6920757","url":null,"abstract":"The Asymmetric Traveling Salesman Problem (ATSP) is one of the Combinatorial Optimization Problems that has been intensively studied in computer science and operations research. Solving ATSP is NP-hard and it is harder if the problem is with large scale data. This paper intends to address the ATSP using an hybrid approach which integrates the generic Bee Colony Optimization (BCO) framework and an insertion-based local search procedure. The generic BCO framework computationally realizes the bee foraging behaviour in a typical bee colony where bees travel across different locations to discover new food sources and perform waggle dances to recruit more bees towards newly discovered food sources. Besides the bee foraging behaviour, the generic BCO framework is enriched with an initialization engine, a fragmented solution construction mechanism, a local search and a pruning strategy. When the proposed algorithm is tested on a set of 27 ATSP benchmark problem instances, 37% of the benchmark instances are constantly solved to optimum. 89% of the problem instances are optimally solved for at least once. On average, the proposed BCO algorithm is able to obtain 0.140% deviation from known optimum for all the 27 instances. In terms of the average computational time, the proposed algorithm requires 48.955s (<; 1 minutes) to obtain the best tour length for each instance.","PeriodicalId":135313,"journal":{"name":"2013 13th International Conference on Intellient Systems Design and Applications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115098401","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":"High quality text-to-speech synthesis system with efficient duration models developed using coding schemes based on vowel production characteristics","authors":"V. R. Reddy, K. S. Rao","doi":"10.1109/ISDA.2013.6920727","DOIUrl":"https://doi.org/10.1109/ISDA.2013.6920727","url":null,"abstract":"This paper explores encoding schemes based on production characteristics of vowels. The performance of coding schemes is analyzed for accurate prediction of durations of syllables using neural network models. Linguistic and production constraints represented by positional, contextual, phonological and articulatory (PCPA) features are used for predicting the durations of syllables. These features are coded with distinct numerical values before feeding to the neural network for building models. The evaluation of coding schemes is carried out by means of objective and subjective measures. The quality of text-to-speech synthesis system is observed to be better by incorporating the duration model with vowels coded based on lip roundness.","PeriodicalId":135313,"journal":{"name":"2013 13th International Conference on Intellient Systems Design and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129352867","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}