Renzo Angles, Rodrigo Paredes, F. Meza, Marcos Gutierrez, Felipe Valdebenito, Danilo Yanez
{"title":"Web-Based Refining of Machine Translations","authors":"Renzo Angles, Rodrigo Paredes, F. Meza, Marcos Gutierrez, Felipe Valdebenito, Danilo Yanez","doi":"10.1109/SCCC.2011.7","DOIUrl":"https://doi.org/10.1109/SCCC.2011.7","url":null,"abstract":"In this article we describe the architecture of our Web-based platform for refining machine translations. The main idea is to use the Web as a database of phrases, and use this information in order to improve the quality of translations. The platform considers three modules, namely: crawling, indexing, and refining. This is an ongoing work, and currently we are capable to take an English phrase and produce its refined Spanish translation.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115849020","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. N. Lintzmayer, Mauro Henrique Mulati, A. F. Silva
{"title":"Toward Better Performance of ColorAnt ACO Algorithm","authors":"C. N. Lintzmayer, Mauro Henrique Mulati, A. F. Silva","doi":"10.1109/SCCC.2011.33","DOIUrl":"https://doi.org/10.1109/SCCC.2011.33","url":null,"abstract":"This paper presents the Color Ant-RT algorithm version 3, an algorithm for graph coloring problems which is based on the Ant Colony Optimization metaheuristic and uses Tabu Search as local search. The experiments demonstrated that ColorAnt3-RT is a promising option in finding good approximations to the best known results for geometric random, geometric standard and le450 graphs of DIMACS benchmark in an acceptable runtime, also, it is good in minimizing the amount of conflicts, the main problem of graph coloring with a fixed number of colors.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121613817","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 Particle Swarm Optimization Algorithm for Topology Control in Wireless Sensor Networks","authors":"Robert Cristian Abreu, J. Arroyo","doi":"10.1109/SCCC.2011.2","DOIUrl":"https://doi.org/10.1109/SCCC.2011.2","url":null,"abstract":"This paper addresses the minimum energy network connectivity (MENC) problem. This problem consists of minimizing the transmission power of each sensor in a wireless network, which results in minimizing the energy consumption of the network, while keeping its global connectivity at the same time. The MENC problem is NP-hard in the strong sense. The NP-hardness of the problem motivates us to develop a heuristic algorithm based on the Particle Swarm Optimization to obtain near-optimal solutions. The proposed heuristic is tested on a set of 50 instances of the problem. The computational results show that our approach is a promising heuristic and it performs better than the classical minimum spanning tree (MST) heuristic.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130064031","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}
Herbert Chuctaya, Christian E. Portugal-Zambrano, C. B. Castañón, J. Gutiérrez, C. L. D. Alamo, Yván Túpac
{"title":"M-CBIR: A Medical Content-Based Image Retrieval System Using Metric Data-Structures","authors":"Herbert Chuctaya, Christian E. Portugal-Zambrano, C. B. Castañón, J. Gutiérrez, C. L. D. Alamo, Yván Túpac","doi":"10.1109/SCCC.2011.18","DOIUrl":"https://doi.org/10.1109/SCCC.2011.18","url":null,"abstract":"This work is focused on the modeling and development of a CBIR (Content-based image retrieval) system applied to the recovery of digital medical images of a human body, denominated M-CBIR. This model is composed on two methodologies: features extraction techniques and metric data structures. When this set of techniques is applied to the search of different human body regions, it can retrieve the most relevant similar images to a query image. A real database of medical images composed of 772 medical studies was used to compare the robustness of the extraction techniques and evaluate the performance of the system, through four different extractors. The objective of this work will result in a digital atlas of human body for medical radiological center. Finally, analysis and conclusions are also discussed.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114742915","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 Study on the Implementation of Tridiagonal Systems Solvers Using a GPU","authors":"Pablo Alfaro, P. Igounet, P. Ezzatti","doi":"10.1109/SCCC.2011.29","DOIUrl":"https://doi.org/10.1109/SCCC.2011.29","url":null,"abstract":"In recent years the use of secondary hardware to accelerate computation of general-purpose problems has emerged as an alternative to traditional high performance computing (HPC) hardware. Specially, the use of graphics processors (GPUs) in the field of HPC has grown given their inherent parallel architecture and low cost. In a previous work, we have studied a preliminary implementation of the cyclic reduction method to tackle tridiagonal linear systems. In this article, we improve our previous implementation in order to accelerate the tridiagonal solvers on GPU using efficient memory techniques, such as pinned memory and coalesced access. The article also presents the implementation of parallel cyclic reduction method on GPU. We analyze and implement several methods for solving tridiagonal systems on GPUs. These implementations were evaluated on different hardware platforms, obtaining significant accelerations, allowing speedups of 3× on a NVIDIA C1060 GPU. The obtained results demonstrate that this new proposal can achieve significant speedup values when compared to an implementation of Thomas method on CPU and our previous GPU implementation.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121933376","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 Case-Control Study of Non-parametric Approaches for Detecting SNP-SNP Interactions","authors":"F. R. B. Araujo, E. Gusmão, K. Guimaraes","doi":"10.1109/SCCC.2011.4","DOIUrl":"https://doi.org/10.1109/SCCC.2011.4","url":null,"abstract":"The massive volume of SNP data available requires the use of adequate computational strategies to properly handle it. Identify the SNP-SNP and SNP-environment combinations that better explain the propensity for a certain disease. We introduce a website (https://jaqueira.cin.ufpe.br/pit/faces/index.jsp) where three previously reported and a new method for SNP-SNP interaction are implemented, and can be executed individually or all together for the same dataset. We also present the results of a case-control study of those methods, based on 70 epistatic models, varying rates for heritability and for minor allele frequency. The experiments also consider different numbers of SNPs and sizes of case-control sets. We observe that for a small number of SNPs, the four methods are statistically equal, but when the number of SNPs grow, they have different behavior, except for ESNP2 and our method. Although the methods are exhaustive, in general, in our analysis ESNP2 runs much faster and achieves better accuracy. Nonetheless, the performance of ESNP2 can be disturbed in a scenario where a single gene can explain most of the epistatic effects. In those cases, considering the interaction effects of all SNPs, instead of only the most significant, can deliver more accurate results. A proposed method, called Multi-Approach SNP-SNP Interaction Analysis (MASS), although statistically equal to ESNP2, achieves better results than ESNP2 in that situation. Our experiments show that specific epistatic models lead to particularly better or worse performance. While a small value for minor allele frequency can negatively impact the accuracy, small heritability rates if the single variation studied that has the strongest negative impact on the accuracy.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122805335","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":"Evaluating Memory Schemas in a Memetic Algorithm for the Quadratic Assignment Problem","authors":"Hugo Meneses, Mario Inostroza-Ponta","doi":"10.1109/SCCC.2011.3","DOIUrl":"https://doi.org/10.1109/SCCC.2011.3","url":null,"abstract":"The use of memory schemas in metaheuristics has been an important technique to improve the performance of the algorithms in order to perform a better search in the solution space of a given problem. There are some techniques that are inherent to the structure used, like population in population-based metaheuristics, or the tabu list in Tabu Search. It is common that these techniques are used alone or combined, towards the construction of a better algorithm. In this work, we present the inclusion of several memory schemas in a Memetic Algorithm for the Quadratic Assignment Problem. The original MA algorithm already has good performance when compared with two other state of the art population-based metaheuristic algorithms. As a result of the memory schemas used, we were able to improve the quality of the solution generated by the Memetic Algorithm. The results are compared using the quality of the solutions and the success rate using the Copeland index.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128673795","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}
Martin Garriga, A. Flores, A. Cechich, Alejandro Zunino
{"title":"Testing-Based Process for Service-Oriented Applications","authors":"Martin Garriga, A. Flores, A. Cechich, Alejandro Zunino","doi":"10.1109/SCCC.2011.10","DOIUrl":"https://doi.org/10.1109/SCCC.2011.10","url":null,"abstract":"Service-Oriented Computing allows building applications by reusing web-accessible services. However, current approaches still involve a large effort both at discovery of services and their successful integration. This paper presents a novel approach to assist developers at discovery, selection and integration of services. In particular, the paper focuses on the selection method that involves two main evaluations on candidate services to achieve a concrete decision upon the most appropriate service. Initially, a syntactic Interface Compatibiliy assessment characterizes the list of candidate services according to a calculated syntactic distance to then proceed with a Behavior Compatibility evaluation that is based on a blackbox testing framework. The usefulness of the selection method is highlighted through a series of case studies.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127673398","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}
Daniel Lichtnow, Ronnie Alves, J. Oliveira, A. M. Levin, Ó. Pastor, Ignacio Medina, J. Dopazo
{"title":"Using Papers Citations for Selecting the Best Genomic Databases","authors":"Daniel Lichtnow, Ronnie Alves, J. Oliveira, A. M. Levin, Ó. Pastor, Ignacio Medina, J. Dopazo","doi":"10.1109/SCCC.2011.6","DOIUrl":"https://doi.org/10.1109/SCCC.2011.6","url":null,"abstract":"Selecting the right data is an essential activity in Genomic-related Information Systems. This work aims to analyze if it is possible to select the best genomic databases from a catalog using information about papers citations related to these genomic databases. The motivation for using information about citations has to do with the fact that it is not easy to obtain proper metadata with respect to these databases. Thus, in this work, information related to papers citations is used for measuring three distinct data quality dimensions: believability, timeliness, and relevancy. Believability is evaluated through the inspection of the number of citations. The variation of the number of citations over time is useful for determining the recency of a database and it is related to the timeliness dimension. Regarding to relevancy, the keywords of papers are useful to indicate the main context of application of these databases.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132706880","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":"Proposal for a Framework Focus on Sustainability","authors":"J. Ferri, R. Barros, J. Brancher","doi":"10.1109/SCCC.2011.17","DOIUrl":"https://doi.org/10.1109/SCCC.2011.17","url":null,"abstract":"The environmental problem is a world-wide and has increased in recent decades due to increasing technology. Despite the lack of information about the concept of Sustainable Development by IT companies, as well as in the field of micro \"Sustainability in Organizations\", society is showing an increasing attention on the preservation of natural resources for future generations. Following this premise, and merging the Information Technology and Governance, created a policy framework for sustainable planning and execution software for manufacturers who are willing to insert the concept of sustainability in their structures.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129228187","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}