Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121691
L. Salas-Morera, L. García-Hernández, A. Arauzo-Azofra
A genetic algorithm (GA) for designing plant layouts in industries with unequal area facilities taking into consideration material handling costs, logical relations between spaces and the shape of each area is presented. The GA utilizes a new encoding representation for these problems. Specific software has been developed to allow users to introduce data and graphically represent proposed solutions in a simple and user-friendly manner. The algorithm has been tested and the obtained results have been compared with those reported in the bibliography.
{"title":"An evolutionary algorithm for the unequal area facility layout problem","authors":"L. Salas-Morera, L. García-Hernández, A. Arauzo-Azofra","doi":"10.1109/ISDA.2011.6121691","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121691","url":null,"abstract":"A genetic algorithm (GA) for designing plant layouts in industries with unequal area facilities taking into consideration material handling costs, logical relations between spaces and the shape of each area is presented. The GA utilizes a new encoding representation for these problems. Specific software has been developed to allow users to introduce data and graphically represent proposed solutions in a simple and user-friendly manner. The algorithm has been tested and the obtained results have been compared with those reported in the bibliography.","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":"131704542","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}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121792
Pablo Menendez, Carmen Campomanes, Krzysztof Trawiński, J. M. Alonso
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.
{"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}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121781
J. Colmenar, M. Abánades, Fernando Poza, Diego Martín, Alfredo Cuesta-Infante, Alberto Herrán, J. Hidalgo
This paper presents a Named Entity Recognition (NER) system based on Hidden Markov Models. The system design is language independent, and the target language and scope of the NER is determined by the training corpus. The NER is formed by two subsystems that detect and label the entities independently. Each subsystem implements a different approach of that statistical theory, showing that each component may complement the results of the other one. Unlike most of the previous works, two labels are returned when the components provide different results. This redundancy is an advantage when human supervision is mandatory at the end of the process such as in intelligence environments.
{"title":"On a generalized name entity recognizer based on Hidden Markov Models","authors":"J. Colmenar, M. Abánades, Fernando Poza, Diego Martín, Alfredo Cuesta-Infante, Alberto Herrán, J. Hidalgo","doi":"10.1109/ISDA.2011.6121781","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121781","url":null,"abstract":"This paper presents a Named Entity Recognition (NER) system based on Hidden Markov Models. The system design is language independent, and the target language and scope of the NER is determined by the training corpus. The NER is formed by two subsystems that detect and label the entities independently. Each subsystem implements a different approach of that statistical theory, showing that each component may complement the results of the other one. Unlike most of the previous works, two labels are returned when the components provide different results. This redundancy is an advantage when human supervision is mandatory at the end of the process such as in intelligence environments.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"69 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":"133791039","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}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121705
J. Platoš, P. Krömer
Data compression algorithms were usually designed for data processing symbol by symbol. The input symbols of these algorithms are usually taken from the ASCII table, i.e. the size of the input alphabet is 256 symbols which are representable by 8-bit numbers. Several other techniques were developed-syllable-based compression, which uses the syllable as a basic compression symbol, and word-based compression, which uses words as basic symbols. These three approaches are strictly bounded and no overlap is allowed. This may be a problem because it may be helpful to have an overlap between them and use a character-based approach with a few symbols as a sequence of characters. This paper describes an algorithm that looks for the optimal alphabet for different text files. The alphabet may contain characters and 2-grams.
{"title":"Optimizing alphabet using genetic algorithms","authors":"J. Platoš, P. Krömer","doi":"10.1109/ISDA.2011.6121705","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121705","url":null,"abstract":"Data compression algorithms were usually designed for data processing symbol by symbol. The input symbols of these algorithms are usually taken from the ASCII table, i.e. the size of the input alphabet is 256 symbols which are representable by 8-bit numbers. Several other techniques were developed-syllable-based compression, which uses the syllable as a basic compression symbol, and word-based compression, which uses words as basic symbols. These three approaches are strictly bounded and no overlap is allowed. This may be a problem because it may be helpful to have an overlap between them and use a character-based approach with a few symbols as a sequence of characters. This paper describes an algorithm that looks for the optimal alphabet for different text files. The alphabet may contain characters and 2-grams.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"33 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":"132885318","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}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121823
A. Masegosa, Federico Rutolo, D. Pelta
Developing predictive models is one of the key issues in Systems Biology. A critical problems that arises when these models are built is the parameter estimation. The calibration of these nonlinear dynamic models is stated as a nonlinear programming problems (NLP) and its resolution is usually complex due to the frequent ill-conditioning and multimodality of the majority of these problems. For that reason, the use of hybrid stochastic optimization methods has received an increasing interest in recent years. In this work we present a new hybrid method for parameter estimation in Systems Biology. This proposal consists on a set of DE algorithms that cooperate among them through a centralised scheme in which a coordinator controls their behavior by means of a rule system. The comparison with state-of-the-art methods shows the better performance of this cooperative strategy when the complexity of the instances is increased.
{"title":"A cooperative strategy for parameter estimation problems in Systems Biology: Preliminary results","authors":"A. Masegosa, Federico Rutolo, D. Pelta","doi":"10.1109/ISDA.2011.6121823","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121823","url":null,"abstract":"Developing predictive models is one of the key issues in Systems Biology. A critical problems that arises when these models are built is the parameter estimation. The calibration of these nonlinear dynamic models is stated as a nonlinear programming problems (NLP) and its resolution is usually complex due to the frequent ill-conditioning and multimodality of the majority of these problems. For that reason, the use of hybrid stochastic optimization methods has received an increasing interest in recent years. In this work we present a new hybrid method for parameter estimation in Systems Biology. This proposal consists on a set of DE algorithms that cooperate among them through a centralised scheme in which a coordinator controls their behavior by means of a rule system. The comparison with state-of-the-art methods shows the better performance of this cooperative strategy when the complexity of the instances is increased.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"52 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":"116123202","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}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121712
Rodrigo C. Barros, A. Carvalho, M. Basgalupp, M. G. Quiles
Decision tree induction algorithms are well known techniques for assigning objects to predefined categories in a transparent fashion. Most decision tree induction algorithms rely on a greedy top-down recursive strategy for growing the tree, and pruning techniques to avoid overfitting. Even though such a strategy has been quite successful in many problems, it falls short in several others. For instance, there are cases in which the hyper-rectangular surfaces generated by these algorithms can only map the problem description after several sub-sequential partitions, which results in a large and incomprehensible tree. Hence, we propose a new decision tree induction algorithm based on clustering which seeks to provide more accurate models and/or shorter descriptions more comprehensible for the end-user. We do not base our performance analysis solely on the straightforward comparison of our proposed algorithm to baseline methods. Instead, we propose a data-dependent analysis in order to look for evidences which may explain in which situations our algorithm outperforms a well-known decision tree induction algorithm.
{"title":"A clustering-based decision tree induction algorithm","authors":"Rodrigo C. Barros, A. Carvalho, M. Basgalupp, M. G. Quiles","doi":"10.1109/ISDA.2011.6121712","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121712","url":null,"abstract":"Decision tree induction algorithms are well known techniques for assigning objects to predefined categories in a transparent fashion. Most decision tree induction algorithms rely on a greedy top-down recursive strategy for growing the tree, and pruning techniques to avoid overfitting. Even though such a strategy has been quite successful in many problems, it falls short in several others. For instance, there are cases in which the hyper-rectangular surfaces generated by these algorithms can only map the problem description after several sub-sequential partitions, which results in a large and incomprehensible tree. Hence, we propose a new decision tree induction algorithm based on clustering which seeks to provide more accurate models and/or shorter descriptions more comprehensible for the end-user. We do not base our performance analysis solely on the straightforward comparison of our proposed algorithm to baseline methods. Instead, we propose a data-dependent analysis in order to look for evidences which may explain in which situations our algorithm outperforms a well-known decision tree induction algorithm.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"24 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":"116985205","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}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121690
Luis Fernandez, J. Balsera, F. Rodriguez, José Manuel Mesa Fernández
Welding plays an important role in the metallurgic process, being a critical part of continuous processes. The early detection of welding defects is a key aspect to guarantee productivity. There are factories in which the welding testing is performed visually by an operator. In this scenario, the physiological and psychological aspects of the operator can determine the productivity due to unnecessary repetitions of welds. This paper proposes an on-line intelligent system for operator support. The goal is to reduce the unnecessary repetitions of welds. The proposed method uses data mining and machine learning techniques fed by the information extracted from the process data and from the data obtained by an infrared camera, creating an objective model that estimates the weld reliability. Flexibility and adaptability are two key concepts in the proposed design.
{"title":"Reduction of rejections in cold rolled strip welding by intelligent analysis of image and process data","authors":"Luis Fernandez, J. Balsera, F. Rodriguez, José Manuel Mesa Fernández","doi":"10.1109/ISDA.2011.6121690","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121690","url":null,"abstract":"Welding plays an important role in the metallurgic process, being a critical part of continuous processes. The early detection of welding defects is a key aspect to guarantee productivity. There are factories in which the welding testing is performed visually by an operator. In this scenario, the physiological and psychological aspects of the operator can determine the productivity due to unnecessary repetitions of welds. This paper proposes an on-line intelligent system for operator support. The goal is to reduce the unnecessary repetitions of welds. The proposed method uses data mining and machine learning techniques fed by the information extracted from the process data and from the data obtained by an infrared camera, creating an objective model that estimates the weld reliability. Flexibility and adaptability are two key concepts in the proposed design.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"81 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":"116008220","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}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121703
F. Mohamed, Mohd Nordin Abd Rahman, M. Abdullah
Multimedia data management is an important application in multimedia system domain. The application scopes are to retrieve, collect, store and preserve multimedia data in a distributed environment. A reliable or appropriate format of record structure in multimedia data management is required in order to trace information validation. Hence, the concept of temporal database can be applied to overcome this situation. The paper presents the development of temporal based multimedia data management model. Two elements of time are incorporated into the model; transaction time and valid time. This time elements will monitor the changes (event) and transaction that happened to the data in database. The use of time elements provides a new schema to query multimedia data based on past, current and future time. The designed model is implemented under web services based environment by utilizing J2EE platform.
{"title":"The development of temporal-based multimedia data management application using web services","authors":"F. Mohamed, Mohd Nordin Abd Rahman, M. Abdullah","doi":"10.1109/ISDA.2011.6121703","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121703","url":null,"abstract":"Multimedia data management is an important application in multimedia system domain. The application scopes are to retrieve, collect, store and preserve multimedia data in a distributed environment. A reliable or appropriate format of record structure in multimedia data management is required in order to trace information validation. Hence, the concept of temporal database can be applied to overcome this situation. The paper presents the development of temporal based multimedia data management model. Two elements of time are incorporated into the model; transaction time and valid time. This time elements will monitor the changes (event) and transaction that happened to the data in database. The use of time elements provides a new schema to query multimedia data based on past, current and future time. The designed model is implemented under web services based environment by utilizing J2EE platform.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"120 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":"115037816","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}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121709
Danilo Horta, R. Campello
The features describing a data set may often be arranged in meaningful subsets, each of which corresponds to a different aspect of the data. An unsupervised algorithm (SCAD) that performs fuzzy clustering and aspects weighting simultaneously was recently proposed. However, there are several situations where the data set is represented by proximity matrices only (relational data), which renders several clustering approaches, including SCAD, inappropriate. To handle this kind of data, the relational clustering algorithm CARD, based on the SCAD algorithm, has been recently developed. However, CARD may fail and halt given certain conditions. To fix this problem, its steps are modified and then reordered to also reduce the number of parameters required. The improved CARD is assessed over hundreds of real and artificial data sets.
{"title":"Automatic aspect discrimination in relational data clustering","authors":"Danilo Horta, R. Campello","doi":"10.1109/ISDA.2011.6121709","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121709","url":null,"abstract":"The features describing a data set may often be arranged in meaningful subsets, each of which corresponds to a different aspect of the data. An unsupervised algorithm (SCAD) that performs fuzzy clustering and aspects weighting simultaneously was recently proposed. However, there are several situations where the data set is represented by proximity matrices only (relational data), which renders several clustering approaches, including SCAD, inappropriate. To handle this kind of data, the relational clustering algorithm CARD, based on the SCAD algorithm, has been recently developed. However, CARD may fail and halt given certain conditions. To fix this problem, its steps are modified and then reordered to also reduce the number of parameters required. The improved CARD is assessed over hundreds of real and artificial data sets.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"171 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":"121176094","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}
Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121739
I. Satoh
This paper presents a intelligent management framework for cooperative logistics, which enables multiple shippers to share a few trucks, for improving the efficiency of the trucks' operations. It is necessary to reduce fossil fuel consumption and carbon dioxide emissions resulting from transport on account of environmental protection. Cooperative logistics has been one of the most effective and popular solutions to this problem, but it makes it be complicated to implement in a logistics management system. We propose a language for specifying the routes of trucks and an order relation between the requirements of routes and the possible routes of trucks. The former is formulated as process calculus and the latter selects suitable trucks according to their routes. Our language and selection mechanism were implemented as a web service.
{"title":"Intelligent management for cooperative logistics","authors":"I. Satoh","doi":"10.1109/ISDA.2011.6121739","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121739","url":null,"abstract":"This paper presents a intelligent management framework for cooperative logistics, which enables multiple shippers to share a few trucks, for improving the efficiency of the trucks' operations. It is necessary to reduce fossil fuel consumption and carbon dioxide emissions resulting from transport on account of environmental protection. Cooperative logistics has been one of the most effective and popular solutions to this problem, but it makes it be complicated to implement in a logistics management system. We propose a language for specifying the routes of trucks and an order relation between the requirements of routes and the possible routes of trucks. The former is formulated as process calculus and the latter selects suitable trucks according to their routes. Our language and selection mechanism were implemented as a web service.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"16 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":"121314009","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：