Pub Date : 2013-11-21DOI: 10.1109/CLEI.2013.6670609
M. E. Villapol, Zenaida Castillo, A. E. Acosta, Marco Gómez, A. Bottini, R. Carmona, H. Juhasz, Carlos Acosta
The Central University of Venezuela, as part of its efforts for adapting its academic offer to national and international needs, is conducting a project to review, evaluate and modify the Computer Science program, in order to form the professional required by the country. In this paper we present the results of the first stage of the project: an assessment of the Computer Science program based on the use of various data collection instruments used to determine the professor and student perception of the program as well as deficiencies and potential of our graduates, according to the companies and organizations that hire them. The results show that there exist a gap between the perception of our professors about the program and the opinion of the employers. We also present information about student performance during the last decade, which is an input to the next stage of the program redesign.
{"title":"Analysis and diagnosis of the Computer Science program at the Central University of Venezuela: Towards a competency-based curriculum design","authors":"M. E. Villapol, Zenaida Castillo, A. E. Acosta, Marco Gómez, A. Bottini, R. Carmona, H. Juhasz, Carlos Acosta","doi":"10.1109/CLEI.2013.6670609","DOIUrl":"https://doi.org/10.1109/CLEI.2013.6670609","url":null,"abstract":"The Central University of Venezuela, as part of its efforts for adapting its academic offer to national and international needs, is conducting a project to review, evaluate and modify the Computer Science program, in order to form the professional required by the country. In this paper we present the results of the first stage of the project: an assessment of the Computer Science program based on the use of various data collection instruments used to determine the professor and student perception of the program as well as deficiencies and potential of our graduates, according to the companies and organizations that hire them. The results show that there exist a gap between the perception of our professors about the program and the opinion of the employers. We also present information about student performance during the last decade, which is an input to the next stage of the program redesign.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121072207","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 : 2013-11-21DOI: 10.1109/CLEI.2013.6670610
F. Sans, Eric Gamess
The central pool of IPv4 addresses managed by IANA was depleted in February 2011. A similar situation will soon happen at the level of LACNIC, the local RIR for South America. Therefore, it is necessary to deploy the new version of the Internet Protocol (IPv6) which dramatically expands the address space. However, this deployment must be done gradually and consequently. Many transition technics have been proposed, with different operational theory and availability according to the network environment. For this reason, it is important to evaluate the performance of these transition technics to help network administrators and researchers in their selection. In this paper, we present a performance comparison of some tunneling mechanisms such as ISATAP, 6to4, 6rd, and Teredo in real testbeds. The RTT and the throughput for UDP and TCP are measured for every mechanism for both Ethernet and Fast Ethernet technologies. From this research, we can conclude that ISATAP presents the best performance and Teredo can be seen as a last resort solution since it has a high overhead.
{"title":"Analytical performance evaluation of native IPv6 and several tunneling technics using benchmarking tools","authors":"F. Sans, Eric Gamess","doi":"10.1109/CLEI.2013.6670610","DOIUrl":"https://doi.org/10.1109/CLEI.2013.6670610","url":null,"abstract":"The central pool of IPv4 addresses managed by IANA was depleted in February 2011. A similar situation will soon happen at the level of LACNIC, the local RIR for South America. Therefore, it is necessary to deploy the new version of the Internet Protocol (IPv6) which dramatically expands the address space. However, this deployment must be done gradually and consequently. Many transition technics have been proposed, with different operational theory and availability according to the network environment. For this reason, it is important to evaluate the performance of these transition technics to help network administrators and researchers in their selection. In this paper, we present a performance comparison of some tunneling mechanisms such as ISATAP, 6to4, 6rd, and Teredo in real testbeds. The RTT and the throughput for UDP and TCP are measured for every mechanism for both Ethernet and Fast Ethernet technologies. From this research, we can conclude that ISATAP presents the best performance and Teredo can be seen as a last resort solution since it has a high overhead.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129668947","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 : 2013-11-21DOI: 10.1109/CLEI.2013.6670618
J. Altamiranda, J. Aguilar, C. Delamarche
Motifs are useful in biology to highlight the nucleotides/amino-acids that are involved in structure, function, regulation and evolution, or to infer homology between genes/proteins. PROSITE is a strategy to model protein motifs as Regular Expressions and Position Frequency Matrices. Multiple tools have been proposed to discover biological motifs, but not for the case of the motifs comparison problem, which is NP-Complete due to flexibility and independence at each position. In this paper we present a formal model to compare two protein motifs based on the Genetic Programming to generate the population of sequences derived from every regular expression under comparison and on a Neural Network Backpropagation to calculate a motif similarity score as fitness function. Additionally, we present a fusion formal method for two similar motifs based on the Ant Colony Optimization technique. The comparison and fusion method was tested using amyloid protein motifs.
{"title":"Comparison and fusion model in protein motifs","authors":"J. Altamiranda, J. Aguilar, C. Delamarche","doi":"10.1109/CLEI.2013.6670618","DOIUrl":"https://doi.org/10.1109/CLEI.2013.6670618","url":null,"abstract":"Motifs are useful in biology to highlight the nucleotides/amino-acids that are involved in structure, function, regulation and evolution, or to infer homology between genes/proteins. PROSITE is a strategy to model protein motifs as Regular Expressions and Position Frequency Matrices. Multiple tools have been proposed to discover biological motifs, but not for the case of the motifs comparison problem, which is NP-Complete due to flexibility and independence at each position. In this paper we present a formal model to compare two protein motifs based on the Genetic Programming to generate the population of sequences derived from every regular expression under comparison and on a Neural Network Backpropagation to calculate a motif similarity score as fitness function. Additionally, we present a fusion formal method for two similar motifs based on the Ant Colony Optimization technique. The comparison and fusion method was tested using amyloid protein motifs.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124246534","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 : 2013-11-21DOI: 10.1109/CLEI.2013.6670611
Gastón Scilingo, María Marta Novaira, Renzo Degiovanni, Nazareno Aguirre
We study the use of an off-the-shelf formal verification tool, namely the explicit-state model checker SPIN, for various analyses related to SCR (Software Cost Reduction) formal requirements specifications. Unlike other studies, where model checking is used for a specific purpose in the context of SCR analysis (e.g., test generation or invariant verification), we use the model checker as the only analysis tool, for consistency checking, completeness analysis, property verification, etc. Moreover, to assess our characterization of the various analyses in terms of model checking, we develop a case study (a pacemaker specification), more complex than those typically found in the SCR literature.
{"title":"Analyzing formal requirements specifications using an off-the-shelf model checker","authors":"Gastón Scilingo, María Marta Novaira, Renzo Degiovanni, Nazareno Aguirre","doi":"10.1109/CLEI.2013.6670611","DOIUrl":"https://doi.org/10.1109/CLEI.2013.6670611","url":null,"abstract":"We study the use of an off-the-shelf formal verification tool, namely the explicit-state model checker SPIN, for various analyses related to SCR (Software Cost Reduction) formal requirements specifications. Unlike other studies, where model checking is used for a specific purpose in the context of SCR analysis (e.g., test generation or invariant verification), we use the model checker as the only analysis tool, for consistency checking, completeness analysis, property verification, etc. Moreover, to assess our characterization of the various analyses in terms of model checking, we develop a case study (a pacemaker specification), more complex than those typically found in the SCR literature.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114357990","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 : 2013-11-21DOI: 10.1109/CLEI.2013.6670671
Fabio Lopez Pires, Elias Melgarejo, B. Barán
The process of selecting which virtual machines will be placed (i.e. executed) in the physical machines available in a Datacenter is known as virtual machine placement problem. This work proposes for the first time a formulation of the problem, with a multi-objective approach, of the main objective functions studied so far as mono-objective in the state of the art. Also it is proposed a multi-objective memetic algorithm for solving the proposed problem. The validity of the proposed formulation is checked by comparing experimental results of the proposed algorithm with a brute force algorithm. Finally it is experimentally verified the scalability of the used meta-heuristic.
{"title":"Virtual machine placement. A multi-objective approach","authors":"Fabio Lopez Pires, Elias Melgarejo, B. Barán","doi":"10.1109/CLEI.2013.6670671","DOIUrl":"https://doi.org/10.1109/CLEI.2013.6670671","url":null,"abstract":"The process of selecting which virtual machines will be placed (i.e. executed) in the physical machines available in a Datacenter is known as virtual machine placement problem. This work proposes for the first time a formulation of the problem, with a multi-objective approach, of the main objective functions studied so far as mono-objective in the state of the art. Also it is proposed a multi-objective memetic algorithm for solving the proposed problem. The validity of the proposed formulation is checked by comparing experimental results of the proposed algorithm with a brute force algorithm. Finally it is experimentally verified the scalability of the used meta-heuristic.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"358 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121639046","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 : 2013-11-21DOI: 10.1109/CLEI.2013.6670661
Clarice Santos, Rosiane de Freitas, Mário Salvatierra
The problem of estimating the full three-dimensional structure of a molecule, determining the position in space of all the atoms that compose it, is called Molecular Distance Geometry Problem (MDGP). To do this from an incomplete set of distances is NP-hard computational problem, where to get a feasible solution in a reasonable execution time presenting interesting mathematical and computational challenges. In this work, continuous and discrete mathematical approaches to solve MDGP is revised, based on the analysis of two types of calculating of sphere intersection: solving nonlinear systems from interatomic Euclidean distance equations, or solving internal coordinate systems using matrix multiplication techniques. We adapted the Branch-and-Prune (BP) method considering four spheres intersection. Computational experiments using instances from PDB benchmark are performed, determining the 3D structure based on our theoretical assumptions in a competitive computational processing time.
{"title":"Sphere intersection algorithms for Molecular Distance Geometry Problem","authors":"Clarice Santos, Rosiane de Freitas, Mário Salvatierra","doi":"10.1109/CLEI.2013.6670661","DOIUrl":"https://doi.org/10.1109/CLEI.2013.6670661","url":null,"abstract":"The problem of estimating the full three-dimensional structure of a molecule, determining the position in space of all the atoms that compose it, is called Molecular Distance Geometry Problem (MDGP). To do this from an incomplete set of distances is NP-hard computational problem, where to get a feasible solution in a reasonable execution time presenting interesting mathematical and computational challenges. In this work, continuous and discrete mathematical approaches to solve MDGP is revised, based on the analysis of two types of calculating of sphere intersection: solving nonlinear systems from interatomic Euclidean distance equations, or solving internal coordinate systems using matrix multiplication techniques. We adapted the Branch-and-Prune (BP) method considering four spheres intersection. Computational experiments using instances from PDB benchmark are performed, determining the 3D structure based on our theoretical assumptions in a competitive computational processing time.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131766003","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 : 2013-11-21DOI: 10.1109/CLEI.2013.6670638
A. Quesada, F. Mata
We study in this work innovation in several Costa Rican software development companies, in order to associate to each of them a model of innovation management, according to the literature. This is done with the purpose of finding differences in innovation practices in such companies, and relate them with the type of innovations obtained in these companies.
{"title":"Innovation management in software: Case studies from the Costa Rican software development industryi","authors":"A. Quesada, F. Mata","doi":"10.1109/CLEI.2013.6670638","DOIUrl":"https://doi.org/10.1109/CLEI.2013.6670638","url":null,"abstract":"We study in this work innovation in several Costa Rican software development companies, in order to associate to each of them a model of innovation management, according to the literature. This is done with the purpose of finding differences in innovation practices in such companies, and relate them with the type of innovations obtained in these companies.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133661093","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 : 2013-11-21DOI: 10.1109/CLEI.2013.6670655
R. Cristaldo, Cynthia Villalba, Ellen Méndez, G. González
A univocal way to identify persons is a need in Hospital Information Systems, to the point of being an essential requirement for Electronic Health Record (EHR) Systems. In Paraguay, a country with a significant rate of people without identity documents, and particularly in the Hospital de Clínicas (HC), which in general provides medical care to low-income people, this requirement must be carefully attended. This article analyzes the consequences of this fact in the management of the HC and proposes the use of an Automated Fingerprint Identification System (AFIS). In this context, we evaluate AFIS options with free software license and open source code, go into details about SourceAFIS and show experimental results. At the end, we present some future works aimed to put in practice this proposal in the HC.
{"title":"Patient identification using biometric systems at the Hospital de Clínicas","authors":"R. Cristaldo, Cynthia Villalba, Ellen Méndez, G. González","doi":"10.1109/CLEI.2013.6670655","DOIUrl":"https://doi.org/10.1109/CLEI.2013.6670655","url":null,"abstract":"A univocal way to identify persons is a need in Hospital Information Systems, to the point of being an essential requirement for Electronic Health Record (EHR) Systems. In Paraguay, a country with a significant rate of people without identity documents, and particularly in the Hospital de Clínicas (HC), which in general provides medical care to low-income people, this requirement must be carefully attended. This article analyzes the consequences of this fact in the management of the HC and proposes the use of an Automated Fingerprint Identification System (AFIS). In this context, we evaluate AFIS options with free software license and open source code, go into details about SourceAFIS and show experimental results. At the end, we present some future works aimed to put in practice this proposal in the HC.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115547664","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 : 2013-11-21DOI: 10.1109/CLEI.2013.6670624
Gonzalo Bonigo, L. B. Briones
Complex systems often exhibit unexpected faults that are difficult to handle. It is desirable that such systems are diagnosable, i.e. faults are automatically detected as they occur (or shortly afterwards), enabling the system to handle the fault or recover. Formally, a system is diagnosable if it is possible to detect every fault, in a finite time after they occurred, by only observing available information from the system. Complex systems are usually built from simpler subsystems running concurrently. In order to model different communication and synchronization methods, the interactions between subsystems may be specified in various ways. In this work we present an analysis of the di-agnosability problem in concurrent systems under such different interaction strategies, with arbitrary faults occurring freely in subsystems. We rigorously define diagnosability in this setting, and formally prove in which cases diagnosability is preserved under composition. We illustrate our approach with several examples, and present a tool that implements our analysis.
{"title":"Diagnosability Behaviour over faulty concurrent systems","authors":"Gonzalo Bonigo, L. B. Briones","doi":"10.1109/CLEI.2013.6670624","DOIUrl":"https://doi.org/10.1109/CLEI.2013.6670624","url":null,"abstract":"Complex systems often exhibit unexpected faults that are difficult to handle. It is desirable that such systems are diagnosable, i.e. faults are automatically detected as they occur (or shortly afterwards), enabling the system to handle the fault or recover. Formally, a system is diagnosable if it is possible to detect every fault, in a finite time after they occurred, by only observing available information from the system. Complex systems are usually built from simpler subsystems running concurrently. In order to model different communication and synchronization methods, the interactions between subsystems may be specified in various ways. In this work we present an analysis of the di-agnosability problem in concurrent systems under such different interaction strategies, with arbitrary faults occurring freely in subsystems. We rigorously define diagnosability in this setting, and formally prove in which cases diagnosability is preserved under composition. We illustrate our approach with several examples, and present a tool that implements our analysis.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126156998","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 : 2013-11-21DOI: 10.1109/CLEI.2013.6670647
M. Pabón, G. Montoya, M. Millán
Data integration aims to provide users with a unified, integrated and global view of the data stored in diverse, heterogeneous and autonomous sources. In the medical domain it is common to have information scattered in different sources such as medical images medical images, diagnostic reports and medical records. The integration of this information is important to support processes of diagnosis, treatment planning and monitoring, education and research. In this paper an integration architecture based on mediation is presented. The mediator uses a graph model to represent the structure of data contained in the sources. This is a conceptual model of the application domain and is formed by a set of subgraphs. Each subgraph represents the data of each data source. The sources have a metadata repository associated with data annotations, which are also used to access the data.
{"title":"Mediation and graph data models for medical data integration","authors":"M. Pabón, G. Montoya, M. Millán","doi":"10.1109/CLEI.2013.6670647","DOIUrl":"https://doi.org/10.1109/CLEI.2013.6670647","url":null,"abstract":"Data integration aims to provide users with a unified, integrated and global view of the data stored in diverse, heterogeneous and autonomous sources. In the medical domain it is common to have information scattered in different sources such as medical images medical images, diagnostic reports and medical records. The integration of this information is important to support processes of diagnosis, treatment planning and monitoring, education and research. In this paper an integration architecture based on mediation is presented. The mediator uses a graph model to represent the structure of data contained in the sources. This is a conceptual model of the application domain and is formed by a set of subgraphs. Each subgraph represents the data of each data source. The sources have a metadata repository associated with data annotations, which are also used to access the data.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128206809","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
扫码关注我们
求助内容：
应助结果提醒方式：