Erika Yunuen Morales Mateos, Mary Arely López Garrido, José Alberto Hernández Aguilar, Carlos A. Ochoa-Ortíz, Oscar-Alberto González-González, Arturo Corona Ferreira
The objective of this work is to express patterns of data behavior related to the psychological connection of the university students with their studies, this through the association rules, likewise these rules are presented in an interactive visual way, which facilitates the review of these to select those that are considered of interest. For this study, students of four careers in technologies from a university in southern Mexico were considered. To measure the psychological engagement with the studies, the Utretch Work Engagement Scale for Students instrument (UWES-S) was used, other elements were included to know opinions related to careers. The learning algorithm of association rules A priori was used. For the generation and interactive visualization of the association rules, the Apriori algorithm was used in the R language. It is concluded that the interactive visual display is an important support for the selection of the rules that are considered relevant.
{"title":"Visual Association Rules on the Psychological Connection of University Students with their Studies","authors":"Erika Yunuen Morales Mateos, Mary Arely López Garrido, José Alberto Hernández Aguilar, Carlos A. Ochoa-Ortíz, Oscar-Alberto González-González, Arturo Corona Ferreira","doi":"10.13053/rcs-148-6-20","DOIUrl":"https://doi.org/10.13053/rcs-148-6-20","url":null,"abstract":"The objective of this work is to express patterns of data behavior related to the psychological connection of the university students with their studies, this through the association rules, likewise these rules are presented in an interactive visual way, which facilitates the review of these to select those that are considered of interest. For this study, students of four careers in technologies from a university in southern Mexico were considered. To measure the psychological engagement with the studies, the Utretch Work Engagement Scale for Students instrument (UWES-S) was used, other elements were included to know opinions related to careers. The learning algorithm of association rules A priori was used. For the generation and interactive visualization of the association rules, the Apriori algorithm was used in the R language. It is concluded that the interactive visual display is an important support for the selection of the rules that are considered relevant.","PeriodicalId":220522,"journal":{"name":"Res. Comput. Sci.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116313472","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}
Uncertain graphs are getting more and more important. They allow to tackle fuzzy situations in numerous frameworks. This paper investigates the issue of generating random graphs based on uncertain proximity relationships between vertices and the goal is to construct the most likely graph. The Constraint Programming paradigm was used to provide a systematic way to release uncertain graphs while maximizing and minimizing the paths that separate certain vertex pairs. The proposed approach allowed to generate uncertain graphs at a reasonable time. This is confirmed by experimental results obtained from a series of tests on several instances. Our solution lays the basis for further real world applications in different fields, such as analytical chemistry, telecommunication networks, and civil engineering.
{"title":"On Generating Random Graphs Based on Fuzzy Proximity Relationships between Vertices","authors":"Mohamed Amine Omrani, Wady Naanaa","doi":"10.13053/rcs-148-8-38","DOIUrl":"https://doi.org/10.13053/rcs-148-8-38","url":null,"abstract":"Uncertain graphs are getting more and more important. They allow to tackle fuzzy situations in numerous frameworks. This paper investigates the issue of generating random graphs based on uncertain proximity relationships between vertices and the goal is to construct the most likely graph. The Constraint Programming paradigm was used to provide a systematic way to release uncertain graphs while maximizing and minimizing the paths that separate certain vertex pairs. The proposed approach allowed to generate uncertain graphs at a reasonable time. This is confirmed by experimental results obtained from a series of tests on several instances. Our solution lays the basis for further real world applications in different fields, such as analytical chemistry, telecommunication networks, and civil engineering.","PeriodicalId":220522,"journal":{"name":"Res. Comput. Sci.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132259563","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}
Claudia Vasconcellos-Gaete, Vincent Barichard, F. Lardeux
Constraint Satisfaction Problems (CSP) and Propositional Satisfiability Problems (SAT) are two paradigms intended to deal with constraint-based problems. In CSP modeling, it results natural to differentiate between decision and auxiliary variables. In SAT, instances do not contain any information about the nature of variables; solvers use the Variable Selection heuristic to determine the next decision to make. This article studies the effect of transfer semantic information from a CSP model to its corresponding SAT instance, in order to guide the branching only to variables directly related to the CSP model. The results obtained suggest that this modification can speed up the resolution for some instances.
{"title":"On the Use of CSP Semantic Information in SAT Models","authors":"Claudia Vasconcellos-Gaete, Vincent Barichard, F. Lardeux","doi":"10.13053/rcs-148-11-10","DOIUrl":"https://doi.org/10.13053/rcs-148-11-10","url":null,"abstract":"Constraint Satisfaction Problems (CSP) and Propositional Satisfiability Problems (SAT) are two paradigms intended to deal with constraint-based problems. In CSP modeling, it results natural to differentiate between decision and auxiliary variables. In SAT, instances do not contain any information about the nature of variables; solvers use the Variable Selection heuristic to determine the next decision to make. This article studies the effect of transfer semantic information from a CSP model to its corresponding SAT instance, in order to guide the branching only to variables directly related to the CSP model. The results obtained suggest that this modification can speed up the resolution for some instances.","PeriodicalId":220522,"journal":{"name":"Res. Comput. Sci.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133974079","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}
H. Villarreal, M. Lizarraga, A. Díaz-Ramírez, Verónica Quintero Rosas, Juan Pablo García-Vázquez
Dementia is a health problem that a ects millions of persons around the world. This disease, which is one of the main death causes
痴呆症是一个影响全世界数百万人的健康问题。这种疾病是导致死亡的主要原因之一
{"title":"Componente del Internet de las cosas para detectar patrones de deambulaje en pacientes con demencia","authors":"H. Villarreal, M. Lizarraga, A. Díaz-Ramírez, Verónica Quintero Rosas, Juan Pablo García-Vázquez","doi":"10.13053/rcs-148-2-10","DOIUrl":"https://doi.org/10.13053/rcs-148-2-10","url":null,"abstract":"Dementia is a health problem that a ects millions of persons around the world. This disease, which is one of the main death causes","PeriodicalId":220522,"journal":{"name":"Res. Comput. Sci.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116174084","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}
Iván Gallegos Miranda, J. A. Martínez, E. Gutiérrez, J. F. Mejía
{"title":"Control de la distancia inter electrodos en un proceso de micro maquinado electroquímico por pulsos (PECMM)","authors":"Iván Gallegos Miranda, J. A. Martínez, E. Gutiérrez, J. F. Mejía","doi":"10.13053/rcs-148-8-16","DOIUrl":"https://doi.org/10.13053/rcs-148-8-16","url":null,"abstract":"","PeriodicalId":220522,"journal":{"name":"Res. Comput. Sci.","volume":"93 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126030668","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}
Benjamín Gutiérrez-Serafín, Humberto Pérez Espinosa, J. Martínez-Miranda, I. Espinosa-Curiel
Barking has been a controversial topic that has been studied from different points of view. While some authors argue that dog barking is a noncommunicative vocalization, others believe that barking plays a significant role in the human-dog interaction. Among the studies that take the last perspective, one of the most recent methods is to implement machine learning algorithms to classify single barks in different behavioral context by evaluating low-level descriptors. However, these research works do not incorporate the analysis of temporal structure or other dog vocalizations. In the present study, we proposed a broader approach by taking into account these relevant features that are currently not considered in the analysis of single barks for the classification of the context. By implementing an automatic process that segments long recordings of dog vocalizations and extracts both low-level and high-level descriptors, promising results were obtained for the barks’ context classification from long recordings, where the highest value of F-measure was 0.71.
{"title":"Classification of Barking Context of Domestic Dog using High-Level Descriptors","authors":"Benjamín Gutiérrez-Serafín, Humberto Pérez Espinosa, J. Martínez-Miranda, I. Espinosa-Curiel","doi":"10.13053/rcs-148-3-2","DOIUrl":"https://doi.org/10.13053/rcs-148-3-2","url":null,"abstract":"Barking has been a controversial topic that has been studied from different points of view. While some authors argue that dog barking is a noncommunicative vocalization, others believe that barking plays a significant role in the human-dog interaction. Among the studies that take the last perspective, one of the most recent methods is to implement machine learning algorithms to classify single barks in different behavioral context by evaluating low-level descriptors. However, these research works do not incorporate the analysis of temporal structure or other dog vocalizations. In the present study, we proposed a broader approach by taking into account these relevant features that are currently not considered in the analysis of single barks for the classification of the context. By implementing an automatic process that segments long recordings of dog vocalizations and extracts both low-level and high-level descriptors, promising results were obtained for the barks’ context classification from long recordings, where the highest value of F-measure was 0.71.","PeriodicalId":220522,"journal":{"name":"Res. Comput. Sci.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123642011","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}
Jessica G. Urrea Guerrero, Xiomara P. Zaldivar-Colado, Rolando Menchaca-Méndez
The graph coloring problem belongs to the problem class NP-Hard, so unless the problem class P is equal to the class NP , there is no polynomial algorithm to solve it . Despite its high complexity, the development of algorithms for these types of problems are of the utmost importance due to the fact that the problems NP-Hard appear in almost all areas of computer science as machine learning , computer networks, operating systems, information systems, among others. In this paper, we propose a parallel implementation, based on CUDA, of a set of variants of a hybrid evolutionary algorithm for the problem of coloring graphs. This
{"title":"Algoritmos híbridos paralelos para el problema de coloreado de grafos","authors":"Jessica G. Urrea Guerrero, Xiomara P. Zaldivar-Colado, Rolando Menchaca-Méndez","doi":"10.13053/rcs-148-10-2","DOIUrl":"https://doi.org/10.13053/rcs-148-10-2","url":null,"abstract":"The graph coloring problem belongs to the problem class NP-Hard, so unless the problem class P is equal to the class NP , there is no polynomial algorithm to solve it . Despite its high complexity, the development of algorithms for these types of problems are of the utmost importance due to the fact that the problems NP-Hard appear in almost all areas of computer science as machine learning , computer networks, operating systems, information systems, among others. In this paper, we propose a parallel implementation, based on CUDA, of a set of variants of a hybrid evolutionary algorithm for the problem of coloring graphs. This","PeriodicalId":220522,"journal":{"name":"Res. Comput. Sci.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123826477","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}
Hiram David Cortés Díaz, O. Ramirez, A. Argüelles-Cruz, C. Solórzano
This paper presents a mobile application (app) using Augmented Reality (AR) with the support of game play mechanics in a non-game application, oriented to help 12 to 15 year’s old students to learn several math subjects. We associate concepts such as gamification and Problem-Based Learning (PBL) within the app, making the subjects much more interesting to the students and encouraging them to be fearless of math by taking advantage of the human’s psychological predisposition to engage in gaming. With the collected information from the research and the help of a predictive algorithm, we try to show how much the technology can help in education.
{"title":"Ramath: Mobile Application for Math Learning using Augmented Reality","authors":"Hiram David Cortés Díaz, O. Ramirez, A. Argüelles-Cruz, C. Solórzano","doi":"10.13053/rcs-148-10-22","DOIUrl":"https://doi.org/10.13053/rcs-148-10-22","url":null,"abstract":"This paper presents a mobile application (app) using Augmented Reality (AR) with the support of game play mechanics in a non-game application, oriented to help 12 to 15 year’s old students to learn several math subjects. We associate concepts such as gamification and Problem-Based Learning (PBL) within the app, making the subjects much more interesting to the students and encouraging them to be fearless of math by taking advantage of the human’s psychological predisposition to engage in gaming. With the collected information from the research and the help of a predictive algorithm, we try to show how much the technology can help in education.","PeriodicalId":220522,"journal":{"name":"Res. Comput. Sci.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124787019","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}
Jaime Moreno, O. M. Matamoros, L. Chanona-Hernández, Ricardo Tejeida Padilla, P. Flores, Víctor Calderón
The recent proliferation of sensors technology applications in therapies to children disabilities to promote positive behavior among such children has produced optimistic results in developing a variety of skills and abilities in them. Dolphin-Assisted Therapy (DAT) has also become a topic of public and research interest for these disorders intervention and treatment. This work exposes the development of a system that controls brain-computer interaction when a patient with different abilities takes a DAT. The study was carried out at Definiti Ixtapa facilities and shows that brain activity increases by 376% during a DAT. A TAGM1 sensor was used to develop the system, which is connected to the Bluetooth 4.0 communication protocol, which is isolated from environmental conditions, which is brackish and humid. In this way, we explore the behavior of Obsessive Compulsive Disorder and neurotypic children using Fast Fourier Transform (FFT) from Electroencephalogram (EEG).
{"title":"Design of a Brain-Computer System to Measure Brain Activity during a Dolphin-Assisted Therapy using the TGAM1 EEG Sensor","authors":"Jaime Moreno, O. M. Matamoros, L. Chanona-Hernández, Ricardo Tejeida Padilla, P. Flores, Víctor Calderón","doi":"10.13053/rcs-148-11-11","DOIUrl":"https://doi.org/10.13053/rcs-148-11-11","url":null,"abstract":"The recent proliferation of sensors technology applications in therapies to children disabilities to promote positive behavior among such children has produced optimistic results in developing a variety of skills and abilities in them. Dolphin-Assisted Therapy (DAT) has also become a topic of public and research interest for these disorders intervention and treatment. This work exposes the development of a system that controls brain-computer interaction when a patient with different abilities takes a DAT. The study was carried out at Definiti Ixtapa facilities and shows that brain activity increases by 376% during a DAT. A TAGM1 sensor was used to develop the system, which is connected to the Bluetooth 4.0 communication protocol, which is isolated from environmental conditions, which is brackish and humid. In this way, we explore the behavior of Obsessive Compulsive Disorder and neurotypic children using Fast Fourier Transform (FFT) from Electroencephalogram (EEG).","PeriodicalId":220522,"journal":{"name":"Res. Comput. Sci.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124792533","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}
Eduardo Del Ángel-Martínez, H. HéctorJ.Fraire, Carlos Soto, Nelson Rangel-Valdez, Laura Cruz Reyes, Claudia Gómez Santillán
In this paper we approach the exact solution of the vertex bisection problem. It is a NP-hard problem which ocurrs in the context of
本文研究了顶点对分问题的精确解。这是一个np困难问题，发生在
{"title":"Un nuevo algoritmo de ramificación y acotamiento para el problema de la bisección de vértices","authors":"Eduardo Del Ángel-Martínez, H. HéctorJ.Fraire, Carlos Soto, Nelson Rangel-Valdez, Laura Cruz Reyes, Claudia Gómez Santillán","doi":"10.13053/rcs-148-8-25","DOIUrl":"https://doi.org/10.13053/rcs-148-8-25","url":null,"abstract":"In this paper we approach the exact solution of the vertex bisection problem. It is a NP-hard problem which ocurrs in the context of","PeriodicalId":220522,"journal":{"name":"Res. Comput. Sci.","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127944519","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
扫码关注我们
求助内容：
应助结果提醒方式：