computational learning
Recently Published Documents


TOTAL DOCUMENTS

144
(FIVE YEARS 35)

H-INDEX

15
(FIVE YEARS 2)

2021 ◽  
Vol 21 (4) ◽  
pp. 1-33
Author(s):  
Ian Arawjo ◽  
Ariam Mogos

Even in the turn toward justice-oriented pedagogy, computing education tends to overlook the quality of intergroup relationships, which risks entrenching division. In this article, we establish an intercultural approach to computing education, informed by intercultural and peace education, prejudice reduction, and the sociology of racism and ethnicity. We outline three major concerns of intercultural computing: shifting from content toward relationships, from cultural responsiveness to cultural reflexivity, and from identity to identification. For the last, we complicate discourses of race and identity widespread in U.S. education. Drawing from studies of youth programming classes in East Africa and U.S. contexts, we then reflect on our attempts to address the first shift of fostering relationships across difference. We highlight three promising design tactics: intergroup pairing, interdependent programming, and making relational goals explicit. Overall, we find that computing can indeed be a site of intergroup bonding across difference, but that bonding can carry complications and tensions with other equity goals and tactics. Rather than framing justice-oriented CS primarily as changes to the aims of computational learning, we argue that future work should explore making relational goals explicit and teach students how to attend to friction.


2021 ◽  
Vol 5 (2) ◽  
pp. 41-47
Author(s):  
Sumathi C B ◽  
Jothilakshmi R

This paper discusses about the noise reduction of images using the convolution matrix. The convolution kernel matrix filters generate new features of the input images with good quality.The noise reduction methods based on convolution kernel is achieved by deep learning theory along with the difference equations. The random variation of the colour and brightness are taken as authenticated coefficients of the images. Convolution techniques along withrecurrent neuralnetwork are applied into theinput image. This input image is divided into the matrix of pixel values. The optimal enhanced image is arrived through convolution kernel using computational learning of autonomous difference equations.


Author(s):  
Anna Keune

AbstractFiber crafts, such as weaving and sewing, occupy a tension-filled space within computing. While associated with domestic practices, fiber crafts have been recognized as a precursor of the earliest computers and continue to present sources of computational inspiration. The connections between fiber crafts and computing have the potential to uncover possibilities for computing to become more diversified in terms of materials, cultural practices, and ultimately people. To explore the promises of fiber crafts for STEM education, this qualitative dissertation built on constructionist and posthumanist perspectives to examine two fiber crafts (i.e., weaving and fabric manipulation) as contexts for computer science learning. Collectively, the dissertation effectively aligned fiber crafts with computational concepts and showed their potential as a promising context for computer science learning. The work further showed that materials used for STEM learning are non-neutral. Materials matter in what can be learned computationally. Lastly, guided by posthumanist perspectives, the dissertation uncovered computational learning as the process of producing physical expansions and highlighted learning as the process of how computational concepts physically change. The work has implications for theorizing learning, designing for learning, and educational practice. For example, the dissertation presents the utility of posthumanist perspectives as an additional theoretical approach to the study of learning that can surface and help address ongoing relational deficit orientations.


2021 ◽  
Vol 8 ◽  
Author(s):  
Craig Vear

This article discusses the creative and technical approaches in a performative robot project called “Embodied Musicking Robots” (2018–present). The core approach of this project is human-centered AI (HC-AI) which focuses on the design, development, and deployment of intelligent systems that cooperate with humans in real time in a “deep and meaningful way.”1 This project applies this goal as a central philosophy from which the concepts of creative AI and experiential learning are developed. At the center of this discussion is the articulation of a shift in thinking of what constitutes creative AI and new HC-AI forms of computational learning from inside the flow of the shared experience between robots and humans. The central case study (EMRv1) investigates the technical solutions and artistic potential of AI-driven robots co-creating with an improvising human musician (the author) in real time. This project is ongoing, currently at v4, with limited conclusions; other than this, the approach can be felt to be cooperative but requires further investigation.


2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Abdulaziz Albahr ◽  
Marwan Albahar ◽  
Mohammed Thanoon ◽  
Muhammad Binsawad

Heart diseases are characterized as heterogeneous diseases comprising multiple subtypes. Early diagnosis and prognosis of heart disease are essential to facilitate the clinical management of patients. In this research, a new computational model for predicting early heart disease is proposed. The predictive model is embedded in a new regularization based on decaying the weights according to the weight matrices’ standard deviation and comparing the results against its parents (RSD-ANN). The performance of RSD-ANN is far better than that of the existing methods. Based on our experiments, the average validation accuracy computed was 96.30% using either the tenfold cross-validation or holdout method.


2021 ◽  
Vol 5 (OOPSLA) ◽  
pp. 1-28
Author(s):  
Ruyi Ji ◽  
Jingtao Xia ◽  
Yingfei Xiong ◽  
Zhenjiang Hu

The generalizability of PBE solvers is the key to the empirical synthesis performance. Despite the importance of generalizability, related studies on PBE solvers are still limited. In theory, few existing solvers provide theoretical guarantees on generalizability, and in practice, there is a lack of PBE solvers with satisfactory generalizability on important domains such as conditional linear integer arithmetic (CLIA). In this paper, we adopt a concept from the computational learning theory, Occam learning, and perform a comprehensive study on the framework of synthesis through unification (STUN), a state-of-the-art framework for synthesizing programs with nested if-then-else operators. We prove that Eusolver, a state-of-the-art STUN solver, does not satisfy the condition of Occam learning, and then we design a novel STUN solver, PolyGen, of which the generalizability is theoretically guaranteed by Occam learning. We evaluate PolyGen on the domains of CLIA and demonstrate that PolyGen significantly outperforms two state-of-the-art PBE solvers on CLIA, Eusolver and Euphony, on both generalizability and efficiency.


Author(s):  
Ines P. Mariño ◽  
Manuel A. Vázquez ◽  
Oleg Blyuss ◽  
Andy Ryan ◽  
Aleksandra Gentry-Maharaj ◽  
...  

Author(s):  
Felix Ball ◽  
Inga Spuerck ◽  
Toemme Noesselt

AbstractWhile temporal expectations (TE) generally improve reactions to temporally predictable events, it remains unknown how the learning of temporal regularities (one time point more likely than another time point) and explicit knowledge about temporal regularities contribute to performance improvements; and whether any contributions generalise across modalities. Here, participants discriminated the frequency of diverging auditory, visual or audio-visual targets embedded in auditory, visual or audio-visual distractor sequences. Temporal regularities were manipulated run-wise (early vs. late target within sequence). Behavioural performance (accuracy, RT) plus measures from a computational learning model all suggest that learning of temporal regularities occurred but did not generalise across modalities, and that dynamics of learning (size of TE effect across runs) and explicit knowledge have little to no effect on the strength of TE. Remarkably, explicit knowledge affects performance—if at all—in a context-dependent manner: Only under complex task regimes (here, unknown target modality) might it partially help to resolve response conflict while it is lowering performance in less complex environments.


Sign in / Sign up

Export Citation Format

Share Document