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 ...
详细信息
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).
programming education is increasingly seen as an important curricular component of non-computerscience (CS) disciplines at the undergraduate level. While existing research has studied non-CS majors' experiences i...
详细信息
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...
详细信息
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.
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.
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...
详细信息
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.
The aim of this explanatory study is to identify the causes of intrinsic cognitive load in programming process. For this purpose, a method based on two dimensions;programming knowledge types (syntactic, semantic, and ...
详细信息
The aim of this explanatory study is to identify the causes of intrinsic cognitive load in programming process. For this purpose, a method based on two dimensions;programming knowledge types (syntactic, semantic, and strategic) and programming constructs was proposed. The proposed method was tested with high school students enrolled in computerscience course dealing with Python programming language. The results suggested that the difficulties determined by the proposed method were considerably useful to estimate the cognitive load experienced by the students. The results also confirmed that when the errors and the difficulties encountered in the programming process increased, the element interactivity in programming tasks increased in terms of syntactic, semantic and strategic knowledge as well. We hope that this study will contribute to the efforts for decreasing the cognitive load to facilitate programming learning process.
The automated design of analog circuits presents a significant challenge due to the complexity of circuit topology and parameter selection. Traditional evolutionary algorithms, such as Genetic programming (GP), have s...
详细信息
暂无评论