Maria Gisela Dorzán, Edilma Olinda Gagliardi, G. Leguizamón, Gregorio Hernández-Peñalver
{"title":"Using ACO Metaheuristic for MWT Problem","authors":"Maria Gisela Dorzán, Edilma Olinda Gagliardi, G. Leguizamón, Gregorio Hernández-Peñalver","doi":"10.1109/SCCC.2011.30","DOIUrl":"https://doi.org/10.1109/SCCC.2011.30","url":null,"abstract":"Globally optimal triangulations are difficult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Triangulation (MWT) problem of a given set of n points in the plane. This paper shows how the Ant Colony Optimization (ACO) metaheuristic can be used to find high quality triangulations. For the experimental study we have created a set of instances for MWT problem since no reference to benchmarks for these problems were found in the literature. Through the experimental evaluation, we assess the applicability of the ACO metaheuristic for MWT problem.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"46 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":"130817393","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":"Bounded Predictability for Faulty Discrete Event Systems","authors":"Laura Brandan Briones, A. Madalinski","doi":"10.1109/SCCC.2011.19","DOIUrl":"https://doi.org/10.1109/SCCC.2011.19","url":null,"abstract":"A discrete event system that is predictable can anticipate faults and act accordingly. However, bare predictability (as found in the literature) has some drawbacks. One does not know exactly when a fault occurs (it could be immediately or long after it is predicted). We propose lower and upper bound refinements of predictability, called (Ib, ub)-predictability. A lower bound guarantees a fault to occur after certain execution steps, whereas an upper bound guarantees a fault to occur, in the future, but before some steps. This information can be exploited by the system to adopt the best contingency plan. We formally define the notions of lb-predictability and ub-predictability, present a decision algorithm to verify it on arbitrary systems, and illustrate them with examples.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"108 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":"116488953","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":"Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem","authors":"Mauro Henrique Mulati, A. A. Constantino","doi":"10.1109/SCCC.2011.34","DOIUrl":"https://doi.org/10.1109/SCCC.2011.34","url":null,"abstract":"This paper proposes the algorithm based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Line, which uses the line-oriented approach for the set covering problem, that is an innovative and emerging approach in the context, beyond the use of a local search. The algorithm is compared with other ACO-based approaches. The results obtained are promising and have reached good quality of solution and running time.","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":"126723888","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":"An Automatic Approach for Duplicate Bibliographic Metadata Identification Using Classification","authors":"E. N. Borges, K. Becker, C. Heuser, R. Galante","doi":"10.1109/SCCC.2011.8","DOIUrl":"https://doi.org/10.1109/SCCC.2011.8","url":null,"abstract":"References are the main descriptive metadata used by digital libraries of scientific articles. These references can be represented by several formats and styles. Although considerable content variations can also occur in some metadata fields such as title, author names and publication venue. Duplicate records influence the quality of digital library services once they need to be appropriately identified and treated. This paper presents an approach to identifying duplicated bibliographic metadata. We extend our previous work so that instead of setting thresholds based on the scores returned by similarity functions, we use the scores to train classification algorithms which automatically identify duplicated references. The experiments show that the classifiers increases up to 11% the quality of results when compared to our unsupervised heuristic-based approach.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"26 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":"130452409","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}
P. Igounet, Pablo Alfaro, M. Pedemonte, P. Ezzatti
{"title":"A GPU Implementation of the SIP Method","authors":"P. Igounet, Pablo Alfaro, M. Pedemonte, P. Ezzatti","doi":"10.1109/SCCC.2011.26","DOIUrl":"https://doi.org/10.1109/SCCC.2011.26","url":null,"abstract":"This article presents the implementation of the Strongly Implicit Procedure (SIP) to resolve penta-diagonal linear systems on a GPU in order to improve its computational efficiency. In particular, two different implementations of the SIP method on a GPU are presented and discussed. The experimental evaluation of the proposed methods demonstrates that a significant reduction on the runtime can be attained (acceleration values up to 4x ) when compared with both serial and parallel CPU implementations.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"70 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":"116278621","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}
Jobson L. Massollar, Rafael de Mello, G. Travassos
{"title":"Investigating the Feasibility of a Specification and Quality Assessment Approach Suitable for Web Functional Requirements","authors":"Jobson L. Massollar, Rafael de Mello, G. Travassos","doi":"10.1109/SCCC.2011.15","DOIUrl":"https://doi.org/10.1109/SCCC.2011.15","url":null,"abstract":"Despite the importance of assure quality of Web applications for their use by the contemporary society, just a few Web development methods offer mechanisms to support such quality in the final product. Besides, when quality concern is present, it is usually concerned with the design models and implementation issues. With some risk, all of them assume the requirements specification is ready and good enough to effectively support the design models generation and consequent implementation. However, the quality of the requirements can affect software design and implementation. Therefore, this paper investigates an approach to support the specification and quality assurance of functional requirements concerned with Web applications. This approach makes use of stereotyped UML activity diagrams to support functional requirements specification. A use case tool and a checklist based inspection technique complement it. The results of two experimental studies indicated its feasibility on supporting the specification of requirements for real web applications. It has been observed through the reduction of the specification time and number of defects in activity diagrams (and their corresponding use cases) specified for an industrial large scale Web-based information system when compared with ad-hoc specification approaches.","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":"130977906","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":"The Power of Collective Action: How Agents Get Rid of Useless Concepts without Even Noticing Their Futility","authors":"Sergio E. Chaigneau, E. Canessa","doi":"10.1109/SCCC.2011.35","DOIUrl":"https://doi.org/10.1109/SCCC.2011.35","url":null,"abstract":"We report an ABM that simulates agents that communicate and experience agreement with other agents. \"Observer\" agents carry in their minds one of several versions of the same concept, and observe the behavior of \"actor\" agents. When an actor provides evidence consistent with an observer's conceptual content, then the latter agent feels agreement. Concepts that promote agreement are useful for communication and are strengthened in agents' minds, while concepts that do not promote agreement are not useful and are weakened. Blind to individual agents, agreement may be of two kinds. True agreement (labeled p(a1)) means that actor and observer really share versions of the same concept. Illusory agreement (labeled p(a2)) means that actor and observer have different concepts and that apparent agreement occurs only due to the probabilistic nature of how conceptual content is distributed among agents. This ABM exhibits an interesting dynamical behavior for which we have developed mathematical formulations which turn out to be consistent with the system's outcomes. Several interesting conclusions were drawn from the models. Particularly, individual agents are blind to whether concepts promote true or illusory agreement among them, but even so, as a collective, the multiagent system is able to keep the concepts that generate true agreement and weed out those that promote illusory agreement. We believe that this characteristic of the ABM is an emergent property of it and its study may shed light on similar cognitive processes that occur in social groups and their results may be useful in the development of better GUI's for search engines and multiagent communication frameworks.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"40 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":"115041687","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 Genetic Algorithm for Discovery of Association Rules","authors":"Wilson Soto, Amparo Olaya-Benavides","doi":"10.1109/SCCC.2011.37","DOIUrl":"https://doi.org/10.1109/SCCC.2011.37","url":null,"abstract":"A genetic algorithm is proposed in this article for discovery of association rules. The main characteristics of the algorithm are: (1) The individual is represented as a set of rules (2) The fitness function is a criteria combination to evaluate the rule's quality - high precision prediction, comprehensibility and interestingness -- (3) Subset Size-Oriented Common feature Crossover Operator (SSOCF) is used in the crossover stage (4) mutation is calculated through non-symmetric probability and selection strategy through tournament and (5) the algorithm was implemented using the library lambdaj. Finally, the genetic algorithm effectiveness and the quality of the rule in the experimental results are shown.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"33 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":"114339679","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":"How to Apply Context-Awareness in an Adaptive e-Learning Environment to Improve Personalization Capabilities?","authors":"Isabela Gasparini, M. Pimenta, J. Oliveira","doi":"10.1109/SCCC.2011.22","DOIUrl":"https://doi.org/10.1109/SCCC.2011.22","url":null,"abstract":"An e-learning environment is normally used by different types of users, with different needs, profiles and cultures, however, usually it is created and maintained without taking into account these user's features. In times when web-based system needs to provide support for an ever increasing amount of material and make it available for local-language populations across the world, the introduction of the culture concept in web-based systems (especially e-learning environments) is becoming a necessity, a challenge, and a timely and relevant issue. Indeed, in attempting to disentangle this diversity, culture has received increasing attention in Human Computer Interaction (HCI) community, particularly in adaptive system field. This paper details a new approach to user modeling in e-learning, taking into account contextual aspects such as technological, educational, personal and especially cultural context to improve personalization capabilities, making use of a set of ontologies for representing explicitly this rich context as an extension of traditional student modeling, and their incorporation in a actual e-learning system called AdaptWeb (an e-learning system used in some Brazilians universities nowadays).","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"45 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":"124586439","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":"Compatibility Evaluation of Components Specified in UML","authors":"N. S. Teixeira, R. Silva","doi":"10.1109/SCCC.2011.13","DOIUrl":"https://doi.org/10.1109/SCCC.2011.13","url":null,"abstract":"When developing component-based software, the compatibility analysis is a necessary step to ensure the interoperability of the connected components. It allows early identification of problems caused by incompatible components. This paper presents the automated process of structural and behavioral compatibility analysis deployed in the SEA environment. From the specification of component-based software, made entirely with UML diagrams, tools are triggered to automatically perform the compatibility analysis. The structural analysis considers component, deployment and class diagrams. The behavioral analysis also treats the state machine diagram, which is transparently converted to a Petri net, that is, the user only handles UML diagrams. Behavioral problems are identified by interpreting Petri net properties for the context of components.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"24 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":"134106178","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}