Pub Date : 2019-09-01DOI: 10.1109/CLEI47609.2019.235086
Cristian Orellana, Mónica M. Villegas, H. Astudillo
Large software systems are designed to satisfy or accommodate many requirements; architectural patterns are a well-known technique to reuse design knowledge. However, requested quality attributes (QA) may be inconsistent at times; e.g., high security typically hampers performance and scalability. Thus, a key concern of systems architects is understanding trade-offs among alternative solutions; e.g., a pattern may favor performance at the expense of scalability or security, another may privilege scalability, and yet another may push security. This article argues that the usual organization of individual patterns in topic-related pattern languages is not too helpful to identify trade-offs, and proposes to borrow a taxonomic principle of architectural tactics, organizing the patterns for each QA into “moments”. This enables architects to use simple tradeoff highlighting techniques to understand trade-offs in complex systems. The approach was used in the systematic design of a SCADA-to-ERP secure bridge, where moment-oriented pattern taxonomies for availability, confidentiality, and performance were used. This approach offers the promise of enabling the trade-offenabled, pattern-driven design of large systems by supporting the systematic exploration of trade-offs among patterns for specific QA’s.
{"title":"Assessing Architectural Patterns Trade-offs using Moment-based Pattern Taxonomies","authors":"Cristian Orellana, Mónica M. Villegas, H. Astudillo","doi":"10.1109/CLEI47609.2019.235086","DOIUrl":"https://doi.org/10.1109/CLEI47609.2019.235086","url":null,"abstract":"Large software systems are designed to satisfy or accommodate many requirements; architectural patterns are a well-known technique to reuse design knowledge. However, requested quality attributes (QA) may be inconsistent at times; e.g., high security typically hampers performance and scalability. Thus, a key concern of systems architects is understanding trade-offs among alternative solutions; e.g., a pattern may favor performance at the expense of scalability or security, another may privilege scalability, and yet another may push security. This article argues that the usual organization of individual patterns in topic-related pattern languages is not too helpful to identify trade-offs, and proposes to borrow a taxonomic principle of architectural tactics, organizing the patterns for each QA into “moments”. This enables architects to use simple tradeoff highlighting techniques to understand trade-offs in complex systems. The approach was used in the systematic design of a SCADA-to-ERP secure bridge, where moment-oriented pattern taxonomies for availability, confidentiality, and performance were used. This approach offers the promise of enabling the trade-offenabled, pattern-driven design of large systems by supporting the systematic exploration of trade-offs among patterns for specific QA’s.","PeriodicalId":216193,"journal":{"name":"2019 XLV Latin American Computing Conference (CLEI)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122388494","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 : 2019-09-01DOI: 10.1109/CLEI47609.2019.235096
Carlos Saavedra, Víctor Andrés Bucheli Guerrero
Complex networks are a strategy to study different real systems through graph-based representation, which allows their observation with different graph measures, such as degree distribution, clustering coefficient, among others. However, these measures are based on the whole of the network, thus, it hides the macro-structures that composes the network.To study the macro-structures in the networks, an approach is the application of the Multifractal Analysis (MFA), which consists in the measure of fractal dimensions in different scales of the network, allowing the observation of different structures into the network. Nevertheless, by using MFA, the observation of the dynamics of the network is unable when it loses nodes or arcs due to a perturbation. On the other hand, the Robustness Analysis (RA) provides a useful tool to study the network dynamics because It gives measures of the network when it loses nodes or arcs.For the above, the combination of the MFA and RA (MFA-RA) can be a strategy to study the dynamics of the macro-structures into the networks. Our experiments applying MFA and RA in different scale-free networks, small-world networks and random networks presented evidence that the measure applying MFA-RA can be used to categorize different types of networks. We can conclude that the study of the dynamic of macro-structures into the networks can provide a most-completed measure to categorize them.
{"title":"Analysis of the relationship between multifractality and robustness in complex networks","authors":"Carlos Saavedra, Víctor Andrés Bucheli Guerrero","doi":"10.1109/CLEI47609.2019.235096","DOIUrl":"https://doi.org/10.1109/CLEI47609.2019.235096","url":null,"abstract":"Complex networks are a strategy to study different real systems through graph-based representation, which allows their observation with different graph measures, such as degree distribution, clustering coefficient, among others. However, these measures are based on the whole of the network, thus, it hides the macro-structures that composes the network.To study the macro-structures in the networks, an approach is the application of the Multifractal Analysis (MFA), which consists in the measure of fractal dimensions in different scales of the network, allowing the observation of different structures into the network. Nevertheless, by using MFA, the observation of the dynamics of the network is unable when it loses nodes or arcs due to a perturbation. On the other hand, the Robustness Analysis (RA) provides a useful tool to study the network dynamics because It gives measures of the network when it loses nodes or arcs.For the above, the combination of the MFA and RA (MFA-RA) can be a strategy to study the dynamics of the macro-structures into the networks. Our experiments applying MFA and RA in different scale-free networks, small-world networks and random networks presented evidence that the measure applying MFA-RA can be used to categorize different types of networks. We can conclude that the study of the dynamic of macro-structures into the networks can provide a most-completed measure to categorize them.","PeriodicalId":216193,"journal":{"name":"2019 XLV Latin American Computing Conference (CLEI)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124360535","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 : 2019-09-01DOI: 10.1109/CLEI47609.2019.235083
Esteban Rodríguez Betancourt, Pablo Sauma Chacón, Edgar Casasola Murillo
Two deep neural network models were compared in the task of polarity classification in Spanish text retrieved from social networks. For each model accuracy, precision, recall and F1 was calculated over a particular corpus. Also, the effect of adding gaussian noise on the inputs over the classifier results was evaluated.
{"title":"Deep Neural Network Comparison for Spanish Tweets Polarity Classification","authors":"Esteban Rodríguez Betancourt, Pablo Sauma Chacón, Edgar Casasola Murillo","doi":"10.1109/CLEI47609.2019.235083","DOIUrl":"https://doi.org/10.1109/CLEI47609.2019.235083","url":null,"abstract":"Two deep neural network models were compared in the task of polarity classification in Spanish text retrieved from social networks. For each model accuracy, precision, recall and F1 was calculated over a particular corpus. Also, the effect of adding gaussian noise on the inputs over the classifier results was evaluated.","PeriodicalId":216193,"journal":{"name":"2019 XLV Latin American Computing Conference (CLEI)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133254779","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 : 2019-09-01DOI: 10.1109/CLEI47609.2019.235093
Francisco Quiñónez, A. Benítez, M. E. García-Díaz, Diego Pinto, Y. J. Meza
TapeYty is a tool developed to calculate optimal paths for urban garbage collection vehicles in the Asuncióon city. This tool generates benefits mainly in the economic and environmental aspects of the city where a large number of people brings a high generation of waste. This makes the complexity of garbage management even greater. The routing problem is treated as the open rural postman problem which seeks to minimize the distance to be traveled by the collection vehicles. To achieve the objective TapeYty is based on mathematical programming techniques and Geographical Informatiom System (GIS) tool which allows the management of the route network, being able able to update the road way and their state of blocked or nonblocked. This implies that when changes of state of the streets TapeYty modifies the graph that represents the road network and re-calculates the solutions providing new optimal routes to each vehicle of collection. The tool has provided solutions that save on average 20% of distance traveled compared to current tour.
{"title":"TapeYty - Software for routing management of urban waste collection using GIS modelling","authors":"Francisco Quiñónez, A. Benítez, M. E. García-Díaz, Diego Pinto, Y. J. Meza","doi":"10.1109/CLEI47609.2019.235093","DOIUrl":"https://doi.org/10.1109/CLEI47609.2019.235093","url":null,"abstract":"TapeYty is a tool developed to calculate optimal paths for urban garbage collection vehicles in the Asuncióon city. This tool generates benefits mainly in the economic and environmental aspects of the city where a large number of people brings a high generation of waste. This makes the complexity of garbage management even greater. The routing problem is treated as the open rural postman problem which seeks to minimize the distance to be traveled by the collection vehicles. To achieve the objective TapeYty is based on mathematical programming techniques and Geographical Informatiom System (GIS) tool which allows the management of the route network, being able able to update the road way and their state of blocked or nonblocked. This implies that when changes of state of the streets TapeYty modifies the graph that represents the road network and re-calculates the solutions providing new optimal routes to each vehicle of collection. The tool has provided solutions that save on average 20% of distance traveled compared to current tour.","PeriodicalId":216193,"journal":{"name":"2019 XLV Latin American Computing Conference (CLEI)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134298073","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 : 2019-09-01DOI: 10.1109/CLEI47609.2019.235075
José Segarra, José Ortiz, R. Gualán, Víctor Saquicela
We present a study of research trends for the area of Computer Sciences in Ecuador in recent years. This analysis was performed through a new method that leverages on semantic web technologies and external knowledge bases (i.e. DBpedia and UNESCO nomenclature) for identifying research topics within articles’ metadata. This information takes into account the documents’ publication date in order to construct time series which are analyzed and interpreted looking for trends. Concretely, we focused our study on the REDI (Semantic Repository of Ecuadorian Researchers) knowledge base which compiles most of the scholarly assets produced in Ecuador and more specifically on the Computer Science subset of publications. This study found that most of the research topics have shown an steady growth in the volume of publications over time, whereas the Semantic Web and E-Government research topics had a great impact initially and now have been slightly reducing its share in favor of new topics such as Information Integration, Machine Learning and Data Mining.
{"title":"Discovering Research Trends in the Computer Science Area of Ecuador: an approach using semantic knowledge bases","authors":"José Segarra, José Ortiz, R. Gualán, Víctor Saquicela","doi":"10.1109/CLEI47609.2019.235075","DOIUrl":"https://doi.org/10.1109/CLEI47609.2019.235075","url":null,"abstract":"We present a study of research trends for the area of Computer Sciences in Ecuador in recent years. This analysis was performed through a new method that leverages on semantic web technologies and external knowledge bases (i.e. DBpedia and UNESCO nomenclature) for identifying research topics within articles’ metadata. This information takes into account the documents’ publication date in order to construct time series which are analyzed and interpreted looking for trends. Concretely, we focused our study on the REDI (Semantic Repository of Ecuadorian Researchers) knowledge base which compiles most of the scholarly assets produced in Ecuador and more specifically on the Computer Science subset of publications. This study found that most of the research topics have shown an steady growth in the volume of publications over time, whereas the Semantic Web and E-Government research topics had a great impact initially and now have been slightly reducing its share in favor of new topics such as Information Integration, Machine Learning and Data Mining.","PeriodicalId":216193,"journal":{"name":"2019 XLV Latin American Computing Conference (CLEI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124650313","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 : 2019-09-01DOI: 10.1109/CLEI47609.2019.235092
Gabriela Vázquez, M. Allegretti, M. E. García-Díaz, D. Pinto-Roa, Angélica Samudio, Diego Figueredo
This paper proposes a solution to the problem of automated management of Acute Lymphoblastic Leukemia (ALL) in children that are being treated at the Hospital de Clínicas (HC) which belongs to the Faculty of Medical Sciences of the National University of Asunción (FCM-UNA). For this purpose, we are proposing the design and implementation of a computer application called Pediatric Hemato-Oncological Protocols Automation (APHOPe), which facilitates obtaining information and managing the implementation of the procedure protocols and hematological and oncological treatment used in the Pediatric Hemato-Oncology Department (HOPe). APHOPe can provide statistical data and applied treatments so the effectiveness-efficiency relation of the global and particular protocols for each patient can be analyzed. In this context, APHOPe allows the generation of various Ad Hoc protocols depending on the treatment needs of the medical personnel. In this stage the system provides the 2008 Protocol LLA which is a variant of the Berlin-Frankfurt-Munster Protocol. The usability and acceptability tests indicate that the proposed system is an effective and flexible tool for the automated management of the hemato-oncological protocols.
{"title":"APHOPe: Automation of Pediatric Hemato-Oncological Protocols of the Hospital de Clínicas","authors":"Gabriela Vázquez, M. Allegretti, M. E. García-Díaz, D. Pinto-Roa, Angélica Samudio, Diego Figueredo","doi":"10.1109/CLEI47609.2019.235092","DOIUrl":"https://doi.org/10.1109/CLEI47609.2019.235092","url":null,"abstract":"This paper proposes a solution to the problem of automated management of Acute Lymphoblastic Leukemia (ALL) in children that are being treated at the Hospital de Clínicas (HC) which belongs to the Faculty of Medical Sciences of the National University of Asunción (FCM-UNA). For this purpose, we are proposing the design and implementation of a computer application called Pediatric Hemato-Oncological Protocols Automation (APHOPe), which facilitates obtaining information and managing the implementation of the procedure protocols and hematological and oncological treatment used in the Pediatric Hemato-Oncology Department (HOPe). APHOPe can provide statistical data and applied treatments so the effectiveness-efficiency relation of the global and particular protocols for each patient can be analyzed. In this context, APHOPe allows the generation of various Ad Hoc protocols depending on the treatment needs of the medical personnel. In this stage the system provides the 2008 Protocol LLA which is a variant of the Berlin-Frankfurt-Munster Protocol. The usability and acceptability tests indicate that the proposed system is an effective and flexible tool for the automated management of the hemato-oncological protocols.","PeriodicalId":216193,"journal":{"name":"2019 XLV Latin American Computing Conference (CLEI)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128410858","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 : 2019-09-01DOI: 10.1109/CLEI47609.2019.235104
J. Aguilar, J. Altamiranda, Francisco Díaz, J. G. D. Mesa, Ángel Pinto
A serious emerging games engine (SEGE) must make explicit the possibility of emergence in a serious game (SG), from the coordinated handling of game plot, adapted to the specific educational context where it is being developed. In previous articles a SEGE based on the ant colony optimization algorithm (ACO) has been proposed, which allows the initial emergence of a SG. In the present work the adaptive plot system (APS) is specified, which allows the emergence of plot in a serious game emerging (SGE), and is based on an ACO that changes the plot in the game, according to the theme that is being given in a smart classroom SaCI (Salón de Clase Inteligente, for its acronym in Spanish),). The APS performs the management of a set of game plot that may be of interest in a context-educational domain, in such a way to adapt the SGE initially conceived to the subject taught in the SaCI, in order to make the appropriate SGE emerge Pedagogical process in progress. Additionally, this paper analyzes the behavior of APS in a case study, showing very encouraging results as SEGE.
一个严肃的新兴游戏引擎(SEGE)必须明确在严肃游戏(SG)中出现的可能性，从游戏情节的协调处理，适应特定的教育环境。在之前的文章中，已经提出了基于蚁群优化算法(ACO)的SEGE，该算法允许初始出现SG。在目前的工作中，指定了自适应情节系统(APS)，它允许在严肃游戏新兴(SGE)中出现情节，并且基于ACO，根据智能教室SaCI (Salón de Clase Inteligente，西班牙语首字母缩略词)中给出的主题改变游戏中的情节。APS对一组游戏情节进行管理，这些情节可能会在情境教育领域引起兴趣，以这种方式使最初构想的SGE适应SaCI中教授的主题，以便使适当的SGE出现在教学过程中。此外，本文还以一个案例分析了APS的行为，得出了非常令人鼓舞的结果。
{"title":"Adaptive Plot System for Serious Emerging Games based on the Ant Colony Optimization Algorithm","authors":"J. Aguilar, J. Altamiranda, Francisco Díaz, J. G. D. Mesa, Ángel Pinto","doi":"10.1109/CLEI47609.2019.235104","DOIUrl":"https://doi.org/10.1109/CLEI47609.2019.235104","url":null,"abstract":"A serious emerging games engine (SEGE) must make explicit the possibility of emergence in a serious game (SG), from the coordinated handling of game plot, adapted to the specific educational context where it is being developed. In previous articles a SEGE based on the ant colony optimization algorithm (ACO) has been proposed, which allows the initial emergence of a SG. In the present work the adaptive plot system (APS) is specified, which allows the emergence of plot in a serious game emerging (SGE), and is based on an ACO that changes the plot in the game, according to the theme that is being given in a smart classroom SaCI (Salón de Clase Inteligente, for its acronym in Spanish),). The APS performs the management of a set of game plot that may be of interest in a context-educational domain, in such a way to adapt the SGE initially conceived to the subject taught in the SaCI, in order to make the appropriate SGE emerge Pedagogical process in progress. Additionally, this paper analyzes the behavior of APS in a case study, showing very encouraging results as SEGE.","PeriodicalId":216193,"journal":{"name":"2019 XLV Latin American Computing Conference (CLEI)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129819689","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 : 2019-09-01DOI: 10.1109/CLEI47609.2019.235102
Alejandra Márquez Herrera, A. Cuadros-Vargas, H. Pedrini
A neural network is a mathematical model that is able to perform a task automatically or semi-automatically after learning the human knowledge that we provided. Moreover, a Convolutional Neural Network (CNN) is a type of neural network that has shown to efficiently learn tasks related to the area of image analysis, such as image segmentation, whose main purpose is to find regions or separable objects within an image. A more specific type of segmentation, called semantic segmentation, guarantees that each region has a semantic meaning by giving it a label or class. Since CNNs can automate the task of image semantic segmentation, they have been very useful for the medical area, applying them to the segmentation of organs or abnormalities (tumors). This work aims to improve the task of binary semantic segmentation of volumetric medical images acquired by Magnetic Resonance Imaging (MRI) using a preexisting Three-Dimensional Convolutional Neural Network (3D CNN) architecture. We propose a formulation of a loss function for training this 3D CNN, for improving pixel-wise segmentation results. This loss function is formulated based on the idea of adapting a similarity coefficient, used for measuring the spatial overlap between the prediction and ground truth, and then using it to train the network. As contribution, the developed approach achieved good performance in a context where the pixel classes are imbalanced. We show how the choice of the loss function for training can affect the final quality of the segmentation. We validate our proposal over two medical image semantic segmentation datasets and show comparisons in performance between the proposed loss function and other pre-existing loss functions used for binary semantic segmentation.
{"title":"Improving Semantic Segmentation of 3D Medical Images on 3D Convolutional Neural Networks","authors":"Alejandra Márquez Herrera, A. Cuadros-Vargas, H. Pedrini","doi":"10.1109/CLEI47609.2019.235102","DOIUrl":"https://doi.org/10.1109/CLEI47609.2019.235102","url":null,"abstract":"A neural network is a mathematical model that is able to perform a task automatically or semi-automatically after learning the human knowledge that we provided. Moreover, a Convolutional Neural Network (CNN) is a type of neural network that has shown to efficiently learn tasks related to the area of image analysis, such as image segmentation, whose main purpose is to find regions or separable objects within an image. A more specific type of segmentation, called semantic segmentation, guarantees that each region has a semantic meaning by giving it a label or class. Since CNNs can automate the task of image semantic segmentation, they have been very useful for the medical area, applying them to the segmentation of organs or abnormalities (tumors). This work aims to improve the task of binary semantic segmentation of volumetric medical images acquired by Magnetic Resonance Imaging (MRI) using a preexisting Three-Dimensional Convolutional Neural Network (3D CNN) architecture. We propose a formulation of a loss function for training this 3D CNN, for improving pixel-wise segmentation results. This loss function is formulated based on the idea of adapting a similarity coefficient, used for measuring the spatial overlap between the prediction and ground truth, and then using it to train the network. As contribution, the developed approach achieved good performance in a context where the pixel classes are imbalanced. We show how the choice of the loss function for training can affect the final quality of the segmentation. We validate our proposal over two medical image semantic segmentation datasets and show comparisons in performance between the proposed loss function and other pre-existing loss functions used for binary semantic segmentation.","PeriodicalId":216193,"journal":{"name":"2019 XLV Latin American Computing Conference (CLEI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131090603","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 : 2019-09-01DOI: 10.1109/CLEI47609.2019.235068
Valéria Farinazzo Martins Salvador, B. Rodrigues, Everton Knihs
For many years, teachers and experts connected to Education have studied and proposed new teaching-learning methodologies e new teaching tools, making changes to the pedagogical projects of the courses, creating projects that promote multidisciplinary, among other initiatives, with the aim of improving the process of transforming skills and abilities into knowledge, in addition to motivating students. One of these initiatives in the Computing area has been the use of games in course subjects. This article brings an experience report using the game development approach to teaching programming in an introductory course. The steps developed in the methodology, as well as the results are discussed in this work.
{"title":"Use of Games for Teaching Programming: Experience Report","authors":"Valéria Farinazzo Martins Salvador, B. Rodrigues, Everton Knihs","doi":"10.1109/CLEI47609.2019.235068","DOIUrl":"https://doi.org/10.1109/CLEI47609.2019.235068","url":null,"abstract":"For many years, teachers and experts connected to Education have studied and proposed new teaching-learning methodologies e new teaching tools, making changes to the pedagogical projects of the courses, creating projects that promote multidisciplinary, among other initiatives, with the aim of improving the process of transforming skills and abilities into knowledge, in addition to motivating students. One of these initiatives in the Computing area has been the use of games in course subjects. This article brings an experience report using the game development approach to teaching programming in an introductory course. The steps developed in the methodology, as well as the results are discussed in this work.","PeriodicalId":216193,"journal":{"name":"2019 XLV Latin American Computing Conference (CLEI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129244337","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 : 2019-09-01DOI: 10.1109/CLEI47609.2019.235108
Rodrigo Leite, P. Solís
Hyperconverged infrastructures use distributed file systems to store and replicate data between multiple servers while using the processing capabilities of those same servers to host virtual machines and containers. In this work, the distributed file system GlusterFS and the VMware ESXi hypervisor are used to build a hyperconverged system to host Docker containers in order to evaluate the performance of this system compared to a traditional approach in which data is stored directly on local disks of the servers. The performance of container persistent data storage is assessed using FIO (Flexible I/O Tester) storage benchmark tool with different workloads from Microsoft data centers and with multiple disk configurations in the hyperconverged system. The experimental results show that with a greater amount of writing operations and that handle large files, the performance in the hyperconverged architecture is better than in local storage, which presents an economically viable option in the implementation of storage for datacenters.
{"title":"Performance Analysis of Data Storage in a Hyperconverged Infrastructure Using Docker and GlusterFS","authors":"Rodrigo Leite, P. Solís","doi":"10.1109/CLEI47609.2019.235108","DOIUrl":"https://doi.org/10.1109/CLEI47609.2019.235108","url":null,"abstract":"Hyperconverged infrastructures use distributed file systems to store and replicate data between multiple servers while using the processing capabilities of those same servers to host virtual machines and containers. In this work, the distributed file system GlusterFS and the VMware ESXi hypervisor are used to build a hyperconverged system to host Docker containers in order to evaluate the performance of this system compared to a traditional approach in which data is stored directly on local disks of the servers. The performance of container persistent data storage is assessed using FIO (Flexible I/O Tester) storage benchmark tool with different workloads from Microsoft data centers and with multiple disk configurations in the hyperconverged system. The experimental results show that with a greater amount of writing operations and that handle large files, the performance in the hyperconverged architecture is better than in local storage, which presents an economically viable option in the implementation of storage for datacenters.","PeriodicalId":216193,"journal":{"name":"2019 XLV Latin American Computing Conference (CLEI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127345128","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
扫码关注我们
求助内容：
应助结果提醒方式：