{"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}
{"title":"Object detection in non-stationary video surveillance for an autonomous vehicle","authors":"Néstor Morales, J. Toledo, L. Acosta","doi":"10.1109/ISDA.2011.6121736","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121736","url":null,"abstract":"In this paper, a new method for the automated video surveillance of wide areas is described. Using the images obtained from a set of cameras installed on an autonomous vehicle, a video surveillance tool has been developed, based on the comparison between images that have been taken in the same place but at different times. The vehicle drives around the watched area, looking for intruders. The method described in this paper is the image comparison system used for this task, and it is based on image registration and change detection techniques. The system has been fully tested, obtaining promising results. The validation process shows the good performance of the methods selected to develop the application. It is also able to be executed in real time with good detection rates.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"61 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":"123459887","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":"Finding promoter profiles with multiobjective identification of cis-regulatory modules based on constraints","authors":"R. Romero-Záliz, J. Arnedo-Fdez, I. Zwir, C. Val","doi":"10.1109/ISDA.2011.6121826","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121826","url":null,"abstract":"Gene expression regulation is an intricate, dynamic phenomenon essential for all biological functions. The necessary instructions for gene expression are encoded in cis-regulatory elements that work together and interact with the RNA polymerase to confer spatial and temporal patterns of transcription. Therefore, the identification of these elements is currently an active area of research in computational analysis of regulatory sequences. However, the problem is difficult since the combinatorial interactions between the regulating factors can be very complex. Here we present a web server that identifies cis-regulatory modules given a set of transcription factor binding sites and, additionally, also RNA polymerase sites for a group of genes.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"11 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":"125171754","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":"A sequantial distributed approach for the joint scheduling of jobs and maintenance operations in the flowshop sequencing problem","authors":"S. Khelifati, F. Benbouzid-Sitayeb","doi":"10.1109/ISDA.2011.6121692","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121692","url":null,"abstract":"Many works refer to the scheduling problem of both preventive maintenance and production activities. Few works concern the dynamic scheduling problem of these two activities. This aspect is mainly concerned by corrective maintenance activities (equipment failure). In this regard, we propose a distributed approach using multi-agent paradigm for scheduling independent jobs and maintenance operations in the flowshop sequencing problem. The proposed multi-agent system introduces a dialogue between two communities of agents (production and maintenance) based on a two-step sequential strategy: first scheduling the production jobs then inserting the preventive maintenance operations, taking the production schedule as a mandatory constraint, to generate a joint production and maintenance schedule. The objective is then to optimize a bi-objective function which takes into account both maintenance and production criterion. It also provides a framework in order to react to the disturbances occurring in the workshop. The main point is to show how the proposed multi-agent system provides a better compromise between the satisfactions of respective objectives of the two functions.","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":"129683713","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":"Multi-constrained route optimization for Electric Vehicles (EVs) using Particle Swarm Optimization (PSO)","authors":"U. F. Siddiqi, Y. Shiraishi, S. M. Sait","doi":"10.1109/ISDA.2011.6121687","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121687","url":null,"abstract":"Route optimization (RO) is an important feature of the Electric Vehicles (EVs) which is responsible for finding optimized paths between any source and destination nodes in the road network. In this paper, the RO problem of EVs is solved by using the Multi Constrained Optimal Path (MCOP) approach. The proposed MCOP problem aims to minimize the length of the path and meets constraints on total travelling time, total time delay due to signals, total recharging time, and total recharging cost. The Penalty Function method is used to transform the MCOP problem into unconstrained optimization problem. The unconstrained optimization is performed by using a Particle Swarm Optimization (PSO) based algorithm. The proposed algorithm has innovative methods for finding the velocity of the particles and updating their positions. The performance of the proposed algorithm is compared with two previous heuristics: H_MCOP and Genetic Algorithm (GA). The time of optimization is varied between 1 second (s) and 5s. The proposed algorithm has obtained the minimum value of the objective function in at-least 9.375% more test instances than the GA and H_MCOP","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":"129531200","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}
Rodrigo C. Barros, R. Cerri, P. Jaskowiak, A. Carvalho
{"title":"A bottom-up oblique decision tree induction algorithm","authors":"Rodrigo C. Barros, R. Cerri, P. Jaskowiak, A. Carvalho","doi":"10.1109/ISDA.2011.6121697","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121697","url":null,"abstract":"Decision tree induction algorithms are widely used in knowledge discovery and data mining, specially in scenarios where model comprehensibility is desired. A variation of the traditional univariate approach is the so-called oblique decision tree, which allows multivariate tests in its non-terminal nodes. Oblique decision trees can model decision boundaries that are oblique to the attribute axes, whereas univariate trees can only perform axis-parallel splits. The majority of the oblique and univariate decision tree induction algorithms perform a top-down strategy for growing the tree, relying on an impurity-based measure for splitting nodes. In this paper, we propose a novel bottom-up algorithm for inducing oblique trees named BUTIA. It does not require an impurity-measure for dividing nodes, since we know a priori the data resulting from each split. For generating the splitting hyperplanes, our algorithm implements a support vector machine solution, and a clustering algorithm is used for generating the initial leaves. We compare BUTIA to traditional univariate and oblique decision tree algorithms, C4.5, CART, OC1 and FT, as well as to a standard SVM implementation, using real gene expression benchmark data. Experimental results show the effectiveness of the proposed approach in several cases.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"5 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":"131442245","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}
C. López-Molina, H. Bustince, E. Tartas, A. Jurio, B. Baets
{"title":"Multiscale edge detection based on the Sobel method","authors":"C. López-Molina, H. Bustince, E. Tartas, A. Jurio, B. Baets","doi":"10.1109/ISDA.2011.6121732","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121732","url":null,"abstract":"The multiscale techniques for edge detection represent an effort to combine the spatial accuracy of small-scale methods with the ability to deal with spurious responses inherent to the large scale ones. In this work we introduce a multiscale extension of the Sobel method for edge detection based on Gaussian smoothing and fine-to-coarse edge tracking. We include examples illustrating the procedure and its results, as well as some quantitative measurements of the improvement obtained with the multiscale approach with respect to the original one.","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":"127679147","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}
Luis Fernandez, J. Balsera, F. Rodriguez, José Manuel Mesa Fernández
{"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}
{"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}
{"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}