Physical limitations in processor design have made computer industry shift from improving the speed of a single processor to increasing the number of processing core units. But the design of software to exploit parallel processing power in a correct and cost-effective way is a challenging task requiring a high degree of expertise. In 2017, Pérez and Yovineproposed a platform-agnostic parallel programming pattern called PCR, that eases writing parallel code. In this thesis, we formalize the PCR pattern in terms of TLA+ —a formal specification language for concurrent systems that is being used at places suchas Intel, Amazon and Microsoft. We seek to provide a formal framework mainly for (1) expressing high level PCR designs and prove their functional correctness in the sense that their parallel computation computes a given mathematical function, and (2) being able to formally relate different PCR designs. In this way, we contribute to the state of the art in formal verification of parallel programs by leveraging TLA+-related tools to proving properties about high-level PCR-based algorithms such as their functional correctness and refinement.
{"title":"On the specification and verification of the PCR parallel programming pattern in TLA+","authors":"Jos'e E. Solsona","doi":"10.19153/cleiej.26.1.6","DOIUrl":"https://doi.org/10.19153/cleiej.26.1.6","url":null,"abstract":"Physical limitations in processor design have made computer industry shift from improving the speed of a single processor to increasing the number of processing core units. But the design of software to exploit parallel processing power in a correct and cost-effective way is a challenging task requiring a high degree of expertise. In 2017, Pérez and Yovineproposed a platform-agnostic parallel programming pattern called PCR, that eases writing parallel code. In this thesis, we formalize the PCR pattern in terms of TLA+ —a formal specification language for concurrent systems that is being used at places suchas Intel, Amazon and Microsoft. We seek to provide a formal framework mainly for (1) expressing high level PCR designs and prove their functional correctness in the sense that their parallel computation computes a given mathematical function, and (2) being able to formally relate different PCR designs. In this way, we contribute to the state of the art in formal verification of parallel programs by leveraging TLA+-related tools to proving properties about high-level PCR-based algorithms such as their functional correctness and refinement.","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134506058","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}
Juan Vicente Bogado Machuca, Diego Herbin Stalder Díaz, Christian Emilio Schaerer Serra
Public health problems such as dengue fever need accurate forecasts so governments can take effective preventive measures. Deep learning (DL) and machine learning have become increasingly popular as the volume of data increases continuously. Nevertheless, performing accurate predictions in areas with fewer cases can be challenging. When we apply DL models using long short-term memory (LSTM) in different cities considering weekly dengue incidence and climate, some models may present heterogeneous behaviours and poor accuracy because of the need for more data. To mitigate this problem, clustering analysis across time series is performed based on scores to measure the clustering quality in 217 Paraguayan cities. First, we compare the raw and feature-based clustering techniques considering several metrics.Our results indicate that hierarchical clustering combined with Spearman correlation is the most appropriate approach. Finally, several LSTM models built using clustering results were compared. The main contribution of this work is a technique that can improve the performance of time series models that combine information from similar time series and weather data.
{"title":"Cluster-based LSTM models to improve Dengue cases forecast","authors":"Juan Vicente Bogado Machuca, Diego Herbin Stalder Díaz, Christian Emilio Schaerer Serra","doi":"10.19153/cleiej.26.1.4","DOIUrl":"https://doi.org/10.19153/cleiej.26.1.4","url":null,"abstract":"Public health problems such as dengue fever need accurate forecasts so governments can take effective preventive measures. Deep learning (DL) and machine learning have become increasingly popular as the volume of data increases continuously. Nevertheless, performing accurate predictions in areas with fewer cases can be challenging. When we apply DL models using long short-term memory (LSTM) in different cities considering weekly dengue incidence and climate, some models may present heterogeneous behaviours and poor accuracy because of the need for more data. To mitigate this problem, clustering analysis across time series is performed based on scores to measure the clustering quality in 217 Paraguayan cities. First, we compare the raw and feature-based clustering techniques considering several metrics.Our results indicate that hierarchical clustering combined with Spearman correlation is the most appropriate approach. Finally, several LSTM models built using clustering results were compared. The main contribution of this work is a technique that can improve the performance of time series models that combine information from similar time series and weather data.","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114384959","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}
Wildfires are a problem of great interest in the world because of the damage they cause every year to forest, wild fauna and flora, an also threatening human lives, among others. There are some computational models for numerical simulations to address this phenomena, and a few of them have an open-source implementation. The goal of this work is to extend a CPU Python’s implementation of wildfire open-source framework developed in NumPy, to a GPU improved version using CuPy. The algorithm used is based on a numerical discretization of a wildfire spreading mathematical model described by a system of partial differential equations. Computational and mathematical components, numerical simulations and applications are described in details in the document. In addition, this work includes includes a brief performance comparison between both implementations, pointing out that we can achieve good execution times using the CuPy GPU implementation without spending enough programming effort.
{"title":"2D Simplified Wildfire Spreading Model in Python: From NumPy to CuPy","authors":"Daniel San Martín, Claudio Torres","doi":"10.19153/cleiej.26.1.5","DOIUrl":"https://doi.org/10.19153/cleiej.26.1.5","url":null,"abstract":"Wildfires are a problem of great interest in the world because of the damage they cause every year to forest, wild fauna and flora, an also threatening human lives, among others. There are some computational models for numerical simulations to address this phenomena, and a few of them have an open-source implementation. The goal of this work is to extend a CPU Python’s implementation of wildfire open-source framework developed in NumPy, to a GPU improved version using CuPy. The algorithm used is based on a numerical discretization of a wildfire spreading mathematical model described by a system of partial differential equations. Computational and mathematical components, numerical simulations and applications are described in details in the document. In addition, this work includes includes a brief performance comparison between both implementations, pointing out that we can achieve good execution times using the CuPy GPU implementation without spending enough programming effort.","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131114839","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}
This preface opens the special issue on invited papers related to the 2023 edition of the MSc. and PhD. thesis contests organized by CLEI, the Latin American Center for Computing Studies. One of the main objectives of CLEI is furthering the scientific development of all Computing areas in Latin America. To recognize such developments, as well as the achievements of the graduate programs in the region, and promote the development of new programs, CLEI organizes yearly since 1993 the LatinAmerican Master Thesis Contest (CLTM), and since 2016 the Doctoral Thesis Contest (CLTD). Both events take place jointly with the Latin American Computing Conference (also known as CLEI conference) . In the 2022 edition, the conference took place in Armenia, Quindio, Colombia; both the MSc. and PhD. contests received a number of high quality submissions, leading to very interesting presentations during the conference and to excellent prizes. After the conference, the authors of the best works (receiving prizes as well as runner-ups) were invited to submit original works, not already published, to the CLEIej journal. These submissions were evaluated by independent reviewers, following the usual review process of the journal. As a result of this selection process, we are proud to present the current Special Issue.
{"title":"Preface to the CLTM-CLTD 2022 Special Issue","authors":"H. Cancela","doi":"10.19153/cleiej.26.1.1","DOIUrl":"https://doi.org/10.19153/cleiej.26.1.1","url":null,"abstract":"This preface opens the special issue on invited papers related to the 2023 edition of the MSc. and PhD. thesis contests organized by CLEI, the Latin American Center for Computing Studies. \u0000One of the main objectives of CLEI is furthering the scientific development of all Computing areas in Latin America. To recognize such developments, as well as the achievements of the graduate programs in the region, and promote the development of new programs, CLEI organizes yearly since 1993 the LatinAmerican Master Thesis Contest (CLTM), and since 2016 the Doctoral Thesis Contest (CLTD). Both events take place jointly with the Latin American Computing Conference (also known as CLEI conference) . \u0000In the 2022 edition, the conference took place in Armenia, Quindio, Colombia; both the MSc. and PhD. contests received a number of high quality submissions, leading to very interesting presentations during the conference and to excellent prizes. \u0000After the conference, the authors of the best works (receiving prizes as well as runner-ups) were invited to submit original works, not already published, to the CLEIej journal. These submissions were evaluated by independent reviewers, following the usual review process of the journal. As a result of this selection process, we are proud to present the current Special Issue. \u0000 ","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131194053","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}
A key component of the Internet of things (IoT) ecosystem is wide-area network connectivity, for which cellular network technologies are a promising option through their support of massive machine-type communications (mMTC). However, numerous devices transmitting sporadically small data packets in a highly synchronized way can generate overload on the radio access network. This situation leads to a shortage of resources, especially those associated with the random access procedure for contention, control, and data transmission, causing preamble collision, control message blocking, and data collision. As a result, mMTC traffic can jeopardize the provisioning of quality of service (QoS) to end-devices, decrease the network efficiency, and increase access latency and device energy consumption. This paper proposes medium access control (MAC) techniques for addressing problems related to the support of mMTC in cellularnetworks. First, a solution for allocating control resources with QoS provisioning and access differentiation is provided, including a resource management model, a scheduling algorithm, and a message prioritization policy. Second, a mechanism for reducing data collisions is also proposed. This solution comprises a protocol in which every device with scheduled retransmission uses a probabilistic policy to decide whether to retransmit, a novel method at the device to estimate the number of nodes trying random access, and two different retransmission policies employing this estimation. Results show that the proposals support QoS, decrease access latency, decrease the device energy consumption, and increase resource utilization under massive random access.
{"title":"Medium Access Control Techniques for Massive Machine-Type Communications in Cellular IoT Networks","authors":"Carlos Alberto Astudillo Trujillo, N. Fonseca","doi":"10.19153/cleiej.26.1.2","DOIUrl":"https://doi.org/10.19153/cleiej.26.1.2","url":null,"abstract":"A key component of the Internet of things (IoT) ecosystem is wide-area network connectivity, for which cellular network technologies are a promising option through their support of massive machine-type communications (mMTC). However, numerous devices transmitting sporadically small data packets in a highly synchronized way can generate overload on the radio access network. This situation leads to a shortage of resources, especially those associated with the random access procedure for contention, control, and data transmission, causing preamble collision, control message blocking, and data collision. As a result, mMTC traffic can jeopardize the provisioning of quality of service (QoS) to end-devices, decrease the network efficiency, and increase access latency and device energy consumption. This paper proposes medium access control (MAC) techniques for addressing problems related to the support of mMTC in cellularnetworks. First, a solution for allocating control resources with QoS provisioning and access differentiation is provided, including a resource management model, a scheduling algorithm, and a message prioritization policy. Second, a mechanism for reducing data collisions is also proposed. This solution comprises a protocol in which every device with scheduled retransmission uses a probabilistic policy to decide whether to retransmit, a novel method at the device to estimate the number of nodes trying random access, and two different retransmission policies employing this estimation. Results show that the proposals support QoS, decrease access latency, decrease the device energy consumption, and increase resource utilization under massive random access. \u0000 ","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126754540","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}
Blockchain is one of the most recent disrupting technologies. Since Bitcoin emerged as its initial application, many blockchain projects arose offering different features for general and domain specific scenarios. In turn, Blockchain platforms work as isolated environments and they do not support interaction (i.e. interoperability) between each other.During the last years, some academic and industry efforts were performed in order to achieve interoperability between blockchain platforms. However, these efforts solve specific use cases and do not provide a general interoperability solution. In order to organize existing work in the area, this paper provides a feature-based classification framework based on 16 key interoperability features, that enabled the classification of 65 academic papers in three categories and six subcategories.The results show that nowadays research is focused on public interoperability, while private and public-to-private interoperability are still on their first steps. Based on these results, this work also discusses nowadays blockchain interoperability landscape, identifies challenges, and suggests future research directions.
{"title":"Blockchain Interoperability: a Feature-based Classification Framework and Challenges Ahead","authors":"Guzmán Llambías, Laura González, R. Ruggia","doi":"10.19153/cleiej.25.3.4","DOIUrl":"https://doi.org/10.19153/cleiej.25.3.4","url":null,"abstract":"Blockchain is one of the most recent disrupting technologies. Since Bitcoin emerged as its initial application, many blockchain projects arose offering different features for general and domain specific scenarios. In turn, Blockchain platforms work as isolated environments and they do not support interaction (i.e. interoperability) between each other.During the last years, some academic and industry efforts were performed in order to achieve interoperability between blockchain platforms. However, these efforts solve specific use cases and do not provide a general interoperability solution. In order to organize existing work in the area, this paper provides a feature-based classification framework based on 16 key interoperability features, that enabled the classification of 65 academic papers in three categories and six subcategories.The results show that nowadays research is focused on public interoperability, while private and public-to-private interoperability are still on their first steps. Based on these results, this work also discusses nowadays blockchain interoperability landscape, identifies challenges, and suggests future research directions.","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131207555","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}
Due to their asynchronous interactions, testing reactive systems is a laborious activity present in any software development project. In this setting, the finite memory formalism of Labeled Transition Systems has been used to generate test suites that can be applied to check ioco conformance of implementations to a given specification. In this work we turn to a more complex scenario where a stronger formalism is considered, the Visibly Pushdown Labeled Transition System (VPTS), which allows access to a potentially infinite pushdown memory. We study an extension of the ioco conformance relation to VPTS models and develop polynomial time algorithms to verify conformance for VPTS models in a white-box testing scenario.
{"title":"Conformance Checking and Pushdown Reactive Systems","authors":"A. Bonifácio, A. Moura","doi":"10.19153/cleiej.25.3.2","DOIUrl":"https://doi.org/10.19153/cleiej.25.3.2","url":null,"abstract":"Due to their asynchronous interactions, testing reactive systems is a laborious activity present in any software development project. \u0000In this setting, the finite memory formalism of Labeled Transition Systems has been used to generate test suites that can be applied to check ioco conformance of implementations to a given specification. \u0000In this work we turn to a more complex scenario where a stronger formalism is considered, the Visibly Pushdown Labeled Transition System (VPTS), which allows access to a potentially infinite pushdown memory. \u0000We study an extension of the ioco conformance relation to VPTS models and develop polynomial time algorithms to verify conformance for VPTS models in a white-box testing scenario.","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132578031","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}
Cassio Andrade Furukawa, M. S. Soares, Maria Istela Cagnin, D. M. B. Paiva
Due to difficulties faced by people with disabilities, it is necessary to provide all citizens with mechanisms to guarantee the accessibility of information and services offered through the internet. This study aims to identify which models and tools support developers in the software coding phase in order to meet accessibility requirements. The data obtained were extracted from the literature and were evaluated with professionals working with information technology. It was possible to conclude that taking accessibility into account throughout the software development cycle from the early stages, as well as having models and tools that help during the software coding process are essential to succeed in creating accessible products.
{"title":"Support for Accessible Software Coding: Results of a Rapid Literature Review","authors":"Cassio Andrade Furukawa, M. S. Soares, Maria Istela Cagnin, D. M. B. Paiva","doi":"10.19153/cleiej.25.3.1","DOIUrl":"https://doi.org/10.19153/cleiej.25.3.1","url":null,"abstract":"Due to difficulties faced by people with disabilities, it is necessary to provide all citizens with mechanisms to guarantee the accessibility of information and services offered through the internet. This study aims to identify which models and tools support developers in the software coding phase in order to meet accessibility requirements. The data obtained were extracted from the literature and were evaluated with professionals working with information technology. It was possible to conclude that taking accessibility into account throughout the software development cycle from the early stages, as well as having models and tools that help during the software coding process are essential to succeed in creating accessible products.","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127683773","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}
The problem of conceptual comparison of names plays an important role in the field of natural language processing. In this task, the goal is to choose, among a set of names, which one refers to the same concept or object as a given input name. In this paper, we propose an algorithm for comparing names of products and services in Portuguese that takes account of the semantic information contained in the names. The semantic similarity between two names is calculated using information from Onto.PT, the largest public lexical ontology for the Portuguese language. Experiments were conducted on a dataset composed of 5,000 pairs of names of products and services in Portuguese. Our experimental results show that the algorithm based on Onto.PT is more effective than other well-known algorithms for name comparison, producing the highest recall and precision. Moreover, results also provide interesting insights into the advantages and disadvantages of using Onto.PT for assessing the semantic similarity of names and other kinds of short texts.
{"title":"Semantic Similarity of Product and Service Names in Portuguese: An Approach Based on Onto.PT","authors":"E. Gonçalves","doi":"10.19153/cleiej.25.3.3","DOIUrl":"https://doi.org/10.19153/cleiej.25.3.3","url":null,"abstract":"The problem of conceptual comparison of names plays an important role in the field of natural language processing. In this task, the goal is to choose, among a set of names, which one refers to the same concept or object as a given input name. In this paper, we propose an algorithm for comparing names of products and services in Portuguese that takes account of the semantic information contained in the names. The semantic similarity between two names is calculated using information from Onto.PT, the largest public lexical ontology for the Portuguese language. Experiments were conducted on a dataset composed of 5,000 pairs of names of products and services in Portuguese. Our experimental results show that the algorithm based on Onto.PT is more effective than other well-known algorithms for name comparison, producing the highest recall and precision. Moreover, results also provide interesting insights into the advantages and disadvantages of using Onto.PT for assessing the semantic similarity of names and other kinds of short texts.","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"29 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125628428","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}
Michael Barquero, Gabriela Marín-Raventós, Gustavo López
Electronic commerce, as a new way of commercialization, is not only a business decision, since not all companies, nor all consumers in a region, are technologically prepared to adopt electronic commerce. To implement this type of trade, companies should carry out a diagnostic study, both to know if the technological resources are available internally, and to determine if the potential clients are also ready and willing to use the channel. From this perspective, this work seeks to design an instrument that allows diagnosing the e-Commerce readiness of micro and small businesses, and their potential consumers in rural areas. An iterative process to create the diagnosis instruments was used. It involved iterations of design and evaluation stages. Academic experts with extensive experience in instrument design carried out the first evaluation; the second iteration was evaluated in a pilot field study where 6 companies and 10 consumers from similar regions participated. Finally, in a case study in the canton of Río Cuarto de Alajuela, 29 companies and 261 consumers from the region participated in this study. The diagnosis highlights that most of these companies express that they are not technologically prepared to implement e-commerce, while most of the participating consumers indicated that they do feel technologically prepared to use these platforms.
{"title":"Designing a Diagnosis Instrument to Determine e-Commerce Readiness for Micro and Small Enterprises in Rural Areas","authors":"Michael Barquero, Gabriela Marín-Raventós, Gustavo López","doi":"10.19153/cleiej.25.2.11","DOIUrl":"https://doi.org/10.19153/cleiej.25.2.11","url":null,"abstract":"Electronic commerce, as a new way of commercialization, is not only a business decision, since not all companies, nor all consumers in a region, are technologically prepared to adopt electronic commerce. To implement this type of trade, companies should carry out a diagnostic study, both to know if the technological resources are available internally, and to determine if the potential clients are also ready and willing to use the channel. \u0000From this perspective, this work seeks to design an instrument that allows diagnosing the e-Commerce readiness of micro and small businesses, and their potential consumers in rural areas. An iterative process to create the diagnosis instruments was used. It involved iterations of design and evaluation stages. Academic experts with extensive experience in instrument design carried out the first evaluation; the second iteration was evaluated in a pilot field study where 6 companies and 10 consumers from similar regions participated. Finally, in a case study in the canton of Río Cuarto de Alajuela, 29 companies and 261 consumers from the region participated in this study. The diagnosis highlights that most of these companies express that they are not technologically prepared to implement e-commerce, while most of the participating consumers indicated that they do feel technologically prepared to use these platforms.","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116318331","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
扫码关注我们
求助内容：
应助结果提醒方式：