Pub Date : 2011-11-01DOI: 10.1109/ISDA.2011.6121634
Danilo R. B. Araújo, C. J. A. B. Filho, E. Barboza, D. Chaves, J. Martins-Filho
In this paper we propose efficient operators for a well known multi-objective evolutionary optimizer, called NSGA II, applied to design all-optical networks regarding the network topology and the device specifications in order to both minimize the capital expenditure to build the network and to maximize the overall network performance. From the experiments, we perceived that it is better to use an uniform crossover, to include preferences a priori and to initialize the individuals emphasizing the network topology.
{"title":"An efficient multi-objective evolutionary optimizer to design all-optical networks considering physical impairments and CAPEX","authors":"Danilo R. B. Araújo, C. J. A. B. Filho, E. Barboza, D. Chaves, J. Martins-Filho","doi":"10.1109/ISDA.2011.6121634","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121634","url":null,"abstract":"In this paper we propose efficient operators for a well known multi-objective evolutionary optimizer, called NSGA II, applied to design all-optical networks regarding the network topology and the device specifications in order to both minimize the capital expenditure to build the network and to maximize the overall network performance. From the experiments, we perceived that it is better to use an uniform crossover, to include preferences a priori and to initialize the individuals emphasizing the network topology.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"50 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":"114114879","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.6121821
J. A. Morente-Molinera, J. M. Martin, C. Cano, M. C. Celorrio, A. Blanco
Massive sequencing technologies are producing an increasing amount of whole genome data, which need to be explored and analyzed. New computational tools are thus required to deal with the dimensionality and complexity of these data. Single Nucleotide Polymorphisms (SNPs) are the most common human genome variation and can be involved in disease conditions. Identifying SNPs and annotating its functional and clinical role in whole human genomes is a challenging task, which requires expert curation. There are several software tools that assist researchers in the SNP calling and SNP annotation processes. However, these tools do not focus on the association of SNPs to regulatory regions such as Transcription Factor Binding Sites (TFBSs). This paper proposes a methodology to assist the annotation of SNPs in whole genome sequences, including not only genes but also known TFBSs. Our main contribution is that we use an intuitionistic-based similarity measure (SCintuit [1]), based on fuzzy technology and intuitionistic sets, to perform accurate comparisons between DNA sequences and identify TFBSs affected by a SNP.
{"title":"SNP annotation from next generation sequencing data","authors":"J. A. Morente-Molinera, J. M. Martin, C. Cano, M. C. Celorrio, A. Blanco","doi":"10.1109/ISDA.2011.6121821","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121821","url":null,"abstract":"Massive sequencing technologies are producing an increasing amount of whole genome data, which need to be explored and analyzed. New computational tools are thus required to deal with the dimensionality and complexity of these data. Single Nucleotide Polymorphisms (SNPs) are the most common human genome variation and can be involved in disease conditions. Identifying SNPs and annotating its functional and clinical role in whole human genomes is a challenging task, which requires expert curation. There are several software tools that assist researchers in the SNP calling and SNP annotation processes. However, these tools do not focus on the association of SNPs to regulatory regions such as Transcription Factor Binding Sites (TFBSs). This paper proposes a methodology to assist the annotation of SNPs in whole genome sequences, including not only genes but also known TFBSs. Our main contribution is that we use an intuitionistic-based similarity measure (SCintuit [1]), based on fuzzy technology and intuitionistic sets, to perform accurate comparisons between DNA sequences and identify TFBSs affected by a SNP.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"46 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":"116419600","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.6121668
A. Al-Mohammed, M. Abido, M. Mansour
This paper investigates the application of differential evolution (DE) algorithm for the problem of optimal placement of phasor measurement units (PMUs) in an electric power network. The problem is to determine the minimum number of PMUs and their respective locations to make the system observable. In order to cope with the continuous changes in the power system's topology, the optimization problem is formulated considering not only the new PMUs to be installed but also the existing ones to be retained or relocated. Additionally, the new formulation takes into account the locations, if any, at which PMUs shall or shall not be placed. The effectiveness of the proposed method is verified via IEEE 14-bus, 30-bus, 39-bus and 57-bus standard systems.
{"title":"Optimal PMU placement for power system observability using differential evolution","authors":"A. Al-Mohammed, M. Abido, M. Mansour","doi":"10.1109/ISDA.2011.6121668","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121668","url":null,"abstract":"This paper investigates the application of differential evolution (DE) algorithm for the problem of optimal placement of phasor measurement units (PMUs) in an electric power network. The problem is to determine the minimum number of PMUs and their respective locations to make the system observable. In order to cope with the continuous changes in the power system's topology, the optimization problem is formulated considering not only the new PMUs to be installed but also the existing ones to be retained or relocated. Additionally, the new formulation takes into account the locations, if any, at which PMUs shall or shall not be placed. The effectiveness of the proposed method is verified via IEEE 14-bus, 30-bus, 39-bus and 57-bus standard systems.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"27 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":"116636384","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.6121848
Raffaele Cannone, C. Castiello, A. Fanelli, Corrado Mencar
When approaching real-world problems with intelligent systems, an interaction with user is often expected. However, data-driven models are usually evaluated only in terms of accuracy, thus not involving users. In literature several works have been proposed for defining measures for interpretability assessment, however, such measures are mostly based on a structural evaluation. For this reason, we investigated a new methodology for assessing interpretability based on semantic cointension. The objective of this work is to provide empirical evidence about the usefulness of semantic cointension in facing a medical problem, namely the prediction of prognosis in Immunoglobulin A Nephropathy. An experimental session has been conducted, where fuzzy rule-based classifiers have been modeled, which are highly interpretable from the structural viewpoint. Results show that through the notion of semantic cointension it is possible to perform a semantic-driven assessment of interpretability, which also takes into account the overall fuzzy inference schema.
{"title":"Assessment of semantic cointension of fuzzy rule-based classifiers in a medical context","authors":"Raffaele Cannone, C. Castiello, A. Fanelli, Corrado Mencar","doi":"10.1109/ISDA.2011.6121848","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121848","url":null,"abstract":"When approaching real-world problems with intelligent systems, an interaction with user is often expected. However, data-driven models are usually evaluated only in terms of accuracy, thus not involving users. In literature several works have been proposed for defining measures for interpretability assessment, however, such measures are mostly based on a structural evaluation. For this reason, we investigated a new methodology for assessing interpretability based on semantic cointension. The objective of this work is to provide empirical evidence about the usefulness of semantic cointension in facing a medical problem, namely the prediction of prognosis in Immunoglobulin A Nephropathy. An experimental session has been conducted, where fuzzy rule-based classifiers have been modeled, which are highly interpretable from the structural viewpoint. Results show that through the notion of semantic cointension it is possible to perform a semantic-driven assessment of interpretability, which also takes into account the overall fuzzy inference schema.","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":"114773647","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.6121672
F. Bulnes, R. Usamentiaga, D. García, J. Molleda
The detection of periodical defects is of primary importance in the manufacturing of many long flat products. As an example, a thick steel block is rolled (passed through several pairs of rolls) to obtain a long steel strip. When a roll has a flaw, it provokes a periodical defect on the strip. If the defect is not detected promptly, a large number of manufactured strips will be marked with the periodical defect. The economic losses incurred when roll flaws are not detected are very high, because the strips can not be sold to the customers and all the resources consumed in their manufacturing are wasted. This paper presents an algorithm for detecting periodical defects by analyzing the single defects detected by an inspection system based on computer vision. Because these defects form a periodical pattern, pattern matching techniques can be used for their detection. The paper also contains an analysis of the metrics used to characterize the performance of the algorithm and the experimental methodology used to find the optimal values for its configuration parameters. The optimal configuration must maximize true detections, and also minimize false detections. False detections can shut the manufacturing line down unnecessarily to search for non-existent roll flaws. Finally, the results obtained are compared with those provided by the most widely used system in this field. In most cases, the results provided by the algorithm proposed were better.
{"title":"Detection of periodical patterns in the defects identified by computer vision systems","authors":"F. Bulnes, R. Usamentiaga, D. García, J. Molleda","doi":"10.1109/ISDA.2011.6121672","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121672","url":null,"abstract":"The detection of periodical defects is of primary importance in the manufacturing of many long flat products. As an example, a thick steel block is rolled (passed through several pairs of rolls) to obtain a long steel strip. When a roll has a flaw, it provokes a periodical defect on the strip. If the defect is not detected promptly, a large number of manufactured strips will be marked with the periodical defect. The economic losses incurred when roll flaws are not detected are very high, because the strips can not be sold to the customers and all the resources consumed in their manufacturing are wasted. This paper presents an algorithm for detecting periodical defects by analyzing the single defects detected by an inspection system based on computer vision. Because these defects form a periodical pattern, pattern matching techniques can be used for their detection. The paper also contains an analysis of the metrics used to characterize the performance of the algorithm and the experimental methodology used to find the optimal values for its configuration parameters. The optimal configuration must maximize true detections, and also minimize false detections. False detections can shut the manufacturing line down unnecessarily to search for non-existent roll flaws. Finally, the results obtained are compared with those provided by the most widely used system in this field. In most cases, the results provided by the algorithm proposed were better.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"98 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":"134577079","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.6121726
J. R. Cózar, Pablo Nieto, José María González-Linares, Nicolás Guil Mata, Y. Hernandez-Heredia
This paper presents a novel framework for logo detection in low quality videos. Our method assumes the logo template is unknown in advance and exploits the property that logotype pixels appearance through several consecutive frames has a lower variance than the others. Segmentation is difficult to accomplish if logo continuity is broken. In this work we propose the use of both edge and appearance continuity to carry out the segmentation. By checking edge continuity, the video is split into sequences with stable content. Later, sequences with similar static content are merged in order to build a longer sequence. Next a Gaussian mixture is used to model the variance of the pixels values in the merged sequences. Finally, a threshold that allows identification of the logo pixels is calculated. The new method is compared with a state-of-the-art method, obtaining better results in both accuracy and false logo rejection.
{"title":"Detection of logos in low quality videos","authors":"J. R. Cózar, Pablo Nieto, José María González-Linares, Nicolás Guil Mata, Y. Hernandez-Heredia","doi":"10.1109/ISDA.2011.6121726","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121726","url":null,"abstract":"This paper presents a novel framework for logo detection in low quality videos. Our method assumes the logo template is unknown in advance and exploits the property that logotype pixels appearance through several consecutive frames has a lower variance than the others. Segmentation is difficult to accomplish if logo continuity is broken. In this work we propose the use of both edge and appearance continuity to carry out the segmentation. By checking edge continuity, the video is split into sequences with stable content. Later, sequences with similar static content are merged in order to build a longer sequence. Next a Gaussian mixture is used to model the variance of the pixels values in the merged sequences. Finally, a threshold that allows identification of the logo pixels is calculated. The new method is compared with a state-of-the-art method, obtaining better results in both accuracy and false logo rejection.","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":"134405067","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.6121776
M. Tucci, Marco Raugi
In this work a modified spectral clustering algorithm for time-series data is introduced. The presented modification is to replace the distance measure for static data with an appropriate one for time series. The performed analysis considers several distance measures for time series, and it includes the use of different similarity graphs and graph Laplacians. We consider the discrimination of time-series generated using different linear ARMA models, and we also investigated the clustering of nonlinear time series generated using autoregressive conditional heteroskedasticity (ARCH) models. The Hubert-Arabie adjusted Rand's index is used as an external criterion for evaluating the partitions obtained with modified spectral clustering and various linkage algorithms. Guidelines are discussed, in particular the use of cepstral coefficients proves to be efficient both for linear and nonlinear data.
{"title":"Analysis of spectral clustering algorithms for linear and nonlinear time series","authors":"M. Tucci, Marco Raugi","doi":"10.1109/ISDA.2011.6121776","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121776","url":null,"abstract":"In this work a modified spectral clustering algorithm for time-series data is introduced. The presented modification is to replace the distance measure for static data with an appropriate one for time series. The performed analysis considers several distance measures for time series, and it includes the use of different similarity graphs and graph Laplacians. We consider the discrimination of time-series generated using different linear ARMA models, and we also investigated the clustering of nonlinear time series generated using autoregressive conditional heteroskedasticity (ARCH) models. The Hubert-Arabie adjusted Rand's index is used as an external criterion for evaluating the partitions obtained with modified spectral clustering and various linkage algorithms. Guidelines are discussed, in particular the use of cepstral coefficients proves to be efficient both for linear and nonlinear data.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"114 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":"122005408","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.6121765
Clara Calvo, C. Ivorra, V. Liern
We present an algorithm for analyzing the geometry of the efficient frontier of the portfolio selection problem with semicontinuous variable and cardinality constraints, and use it as a basis to solve a fuzzy version of the problem, designed to obtain efficient portfolios, in the Markowitz's sense, for which the trade-off between expected return and assumed risk fits better the investor's subjective criteria. We illustrate our proposal with an example solved with LINGO and Mathematica.
{"title":"Fuzzy portfolio selection based on the analysis of efficient frontiers","authors":"Clara Calvo, C. Ivorra, V. Liern","doi":"10.1109/ISDA.2011.6121765","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121765","url":null,"abstract":"We present an algorithm for analyzing the geometry of the efficient frontier of the portfolio selection problem with semicontinuous variable and cardinality constraints, and use it as a basis to solve a fuzzy version of the problem, designed to obtain efficient portfolios, in the Markowitz's sense, for which the trade-off between expected return and assumed risk fits better the investor's subjective criteria. We illustrate our proposal with an example solved with LINGO and Mathematica.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"39 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":"124771843","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.6121626
I. García-Magariño
The FIPA Methodology Technical Committee has proposed a method engineering approach for multi-agent systems development. This approach consists on defining method fragments from agent-oriented software engineering methodologies. Developers combine fragments to define a customized development process. In this line of research, the contribution of this paper is a set of method fragments that are assisted by model transformations, in order to allow engineers to better develop multi-agent systems in an automated way. This set of method fragments is grounded on the experience the development process of two multi-agent systems. This paper presents the formalization of the fragments and an example of the automation of a fragment with a model transformation.
{"title":"A set of method fragments for developing multi-agent systems assisted with model transformations","authors":"I. García-Magariño","doi":"10.1109/ISDA.2011.6121626","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121626","url":null,"abstract":"The FIPA Methodology Technical Committee has proposed a method engineering approach for multi-agent systems development. This approach consists on defining method fragments from agent-oriented software engineering methodologies. Developers combine fragments to define a customized development process. In this line of research, the contribution of this paper is a set of method fragments that are assisted by model transformations, in order to allow engineers to better develop multi-agent systems in an automated way. This set of method fragments is grounded on the experience the development process of two multi-agent systems. This paper presents the formalization of the fragments and an example of the automation of a fragment with a model transformation.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"30 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":"125092490","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.6121665
Karel Osorio, Gabriel Luque, E. Alba
In this work we use mathematical models, based on the study of the dynamics of the distributed evolutionary algorithms (dEA), to design self adaptive migration schedule for dEAs. We test our technique on two different problems: MAXSAT (a variant of the satisfiability problem), and a large scale problem, namely the radio network design problem. Its results are compared against the best results produced by distributed configurations with traditional tuning (constant preset migration schedules). Our experiments show that the technique produces results close to the best results obtained with fixed schedules while reducing the heavy cost of the parameter tuning.
{"title":"Distributed evolutionary algorithms with adaptive migration period","authors":"Karel Osorio, Gabriel Luque, E. Alba","doi":"10.1109/ISDA.2011.6121665","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121665","url":null,"abstract":"In this work we use mathematical models, based on the study of the dynamics of the distributed evolutionary algorithms (dEA), to design self adaptive migration schedule for dEAs. We test our technique on two different problems: MAXSAT (a variant of the satisfiability problem), and a large scale problem, namely the radio network design problem. Its results are compared against the best results produced by distributed configurations with traditional tuning (constant preset migration schedules). Our experiments show that the technique produces results close to the best results obtained with fixed schedules while reducing the heavy cost of the parameter tuning.","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":"130266726","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
扫码关注我们
求助内容：
应助结果提醒方式：