Middle school students often enter computerscience (CS) classes without previous CS or Computational Thinking (CT) instruction. This study evaluated how ***'s block-based programming curriculum affects middle sch...
详细信息
Middle school students often enter computerscience (CS) classes without previous CS or Computational Thinking (CT) instruction. This study evaluated how ***'s block-based programming curriculum affects middle school students' CT skills and attitudes toward CT and CS. Sixteen students participated in the study. This was a mixed methods action research study that used pre- and post-tests, surveys, artifacts, and interviews as data sources. Descriptive statistics, paired samples t-tests, and inductive thematic analysis were administered. Findings showed a statistically significant increase in participants' algorithmic thinking, debugging, and pattern recognition skills but not in abstraction skills. Attitudes toward CT and CS improved but the difference was not statistically significant. Qualitative themes revealed benefits of game-based learning to promote CT skills, collaboration to promote successful error debugging, and enjoyment of programming resulting from a balance between structured guidance and creative freedom. Findings emphasize the importance of low-threshold and engaging strategies to introduce novice learners to CT and CS.
Thales aims to develop a virtual assistant to support pilots during flights, with a central component being the knowledge base. This knowledge base is built using a knowledge representation (KR) and reasoning system, ...
详细信息
ISBN:
(纸本)9783031789540;9783031789557
Thales aims to develop a virtual assistant to support pilots during flights, with a central component being the knowledge base. This knowledge base is built using a knowledge representation (KR) and reasoning system, encompassing various knowledge types including static and dynamic. However, existing KR systems present some limitations which include expressiveness and reasoning performance. The problem of expressiveness can be addressed by integrating two distinct KR concepts: Rules and Ontologies. Ontologies offers a framework for formalizing concepts, properties, and relationships, whereas rules express knowledge through IF-Then constructs. Integrating these approaches enriches knowledge representation and reasoning systems in many ways and helps to achieve completeness. However, this integration poses challenges, such as the difficulty of aligning their semantics and addressing issues of decidability. This thesis focuses on defining a methodology to combine rules and ontologies to overcome these challenges and build an optimized reasoner to execute the reasoning tasks of the virtual assistant ensuring good performance.
We present CYBATHLON @school, which aims to foster interest in STEM subjects among primary school students and promote empathy for people with disabilities. The initiative, in collaboration with various educational in...
详细信息
ISBN:
(纸本)9798400706035
We present CYBATHLON @school, which aims to foster interest in STEM subjects among primary school students and promote empathy for people with disabilities. The initiative, in collaboration with various educational institutions, has developed three scalable modules that allow students to engage in interactive experiences, such as an interactive video, experimenting with prosthetic devices, and programming a mini wheelchair under the guidance of ETH students and ambassadors with a disability. The effectiveness is being assessed through an RCT, with preliminary results showing high levels of student, teacher and parent satisfaction.
A new theory for computerscience based on an axiomatic approach is created in this paper. We take it as a postulate that an accelerator and a program executting on it can be regarded as a general printer. From it, we...
详细信息
Advancements in computation and machine learning have revolutionized science, enabling researchers to address once insurmountable challenges. Bioinformatics, a field that heavily relies on computer-driven analysis of ...
详细信息
Introductory programming courses at university level often face the challenge of having to initiate learning to large student groups with a wide range of prior knowledge. We present a teaching concept that supports in...
详细信息
ISBN:
(纸本)9798400701399
Introductory programming courses at university level often face the challenge of having to initiate learning to large student groups with a wide range of prior knowledge. We present a teaching concept that supports individual students' self-learning through online tutorials and programming project work with automated tests on one hand and regular face-to-face project discussion meetings with teaching assistants (TAs) on the other hand. In our teaching approach, TAs take on a new central role with more responsibility by coaching students individually and providing personal feedback. By individualizing and decentralizing the courses with one-to-one tutoring by TAs, they seem to be better adapted to the different needs of individual learners.
Let M = (m(ij)) be a symmetric matrix of order n whose elements lie in an arbitrary field F, and let G be the graph with vertex set {1,& mldr;, n} such that distinct vertices i and j are adjacent if and only if m(...
详细信息
Let M = (m(ij)) be a symmetric matrix of order n whose elements lie in an arbitrary field F, and let G be the graph with vertex set {1,& mldr;, n} such that distinct vertices i and j are adjacent if and only if m(ij) not equal 0. We introduce a dynamic programming algorithm that finds a diagonal matrix that is congruent to M. If G is given with a tree decomposition T of width k, then this can be done in time O(k|T| + k(2)n), where |T| denotes the number of nodes in T. Among other things, this allows the computation of the determinant, the rank and the inertia of a symmetric matrix in time O(k|T| + k(2)n).
GUI (Graphical User Interface) programming is the process of developing (coding) a graphical interface application. GUI-based application, which replaces TUI (Textual User Interface), allows users to interact with a p...
详细信息
Peer grading is widely used in high education as effective active learning but still faces challenges. We present the peer grading approach for Open-ended programming Projects based on the binary and Swiss systems. Fi...
详细信息
ISBN:
(纸本)9798400704239
Peer grading is widely used in high education as effective active learning but still faces challenges. We present the peer grading approach for Open-ended programming Projects based on the binary and Swiss systems. First, we design a grading specification to improve the accuracy of scoring. Second, to make grading easier for inexperienced students, we utilize a pairwise comparison system based on the binary system. Third, we propose a score calculation algorithm based on Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) to improve grading accuracy. We developed an online peer review tool called Peer Review Studio (PRS) based on the approach. We carry out the method in the undergraduate programming course of 2023. We collect and analyze the learning data between 2022 and 2023. When measured by Krippendorff's alpha, the inter-rater reliability between instructor and peer grading is in good agreement. When measured by Kruskal-Wallis, students' project performance and learning engagement significantly improve in the first year of peer grading. The course questionnaire 2023 reveals that most students hold a positive attitude toward peer grading and have benefited significantly from this approach.
Lexicographic Ranking SuperMartingale (LexRSM) is a probabilistic extension of Lexicographic Ranking Function (LexRF), which is a widely accepted technique for verifying program termination. In this paper, we are the ...
详细信息
ISBN:
(纸本)9783031656323;9783031656330
Lexicographic Ranking SuperMartingale (LexRSM) is a probabilistic extension of Lexicographic Ranking Function (LexRF), which is a widely accepted technique for verifying program termination. In this paper, we are the first to propose sound probabilistic extensions of LexRF with a weaker non-negativity condition, called single-component (SC) non-negativity. It is known that such an extension, if it exists, will be nontrivial due to the intricacies of the probabilistic circumstances. Toward the goal, we first devise the notion of fixability, which offers a systematic approach for analyzing the soundness of possibly negative LexRSM. This notion yields a desired extension of LexRF that is sound for general stochastic processes. We next propose another extension, called Lazy LexRSM, toward the application to automated verification;it is sound over probabilistic programs with linear arithmetics, while its subclass is amenable to automated synthesis via linear programming. We finally propose a LexRSM synthesis algorithm for this subclass, and perform experiments.
暂无评论