The recent emergence of Large Language Model (LLM)-based tools such as OpenAI's ChatGPT and Google's Gemini has sparked excitement across the software development industry, and offered promises to transform th...
详细信息
Computing the edge expansion of a graph is a famously hard combinatorial problem for which there have been many approximation studies. We present two versions of an exact algorithm using semidefinite programming (SDP)...
详细信息
ISBN:
(纸本)9783031609237;9783031609244
Computing the edge expansion of a graph is a famously hard combinatorial problem for which there have been many approximation studies. We present two versions of an exact algorithm using semidefinite programming (SDP) to compute this constant for any graph. The SDP relaxation is used to first reduce the search space considerably. One version applies then an SDP-based branch-and-bound algorithm, along with heuristic search. The other version transforms the problem into an instance of a max-cut problem and solves this using a state-of-the-art solver. Numerical results demonstrate that we clearly outperform mixed-integer quadratic solvers as well as another SDP-based algorithm from the literature.
This article investigates the optimal cooperative tracking control problem for unknown nonlinear multiagent systems with a real dynamic leader and uncertainties. Its main difficulty lies in eliminating effect of the u...
详细信息
Cu–W nanocomposites had many engineering applications due to the unique characteristics including hardness, transverse rupture strength, electrical conductivity, thermal conductivity, and relative density. This study...
详细信息
Novices frequently learn to program using text-based programming, in languages such as Java. Programs can be constructed in a variety of different ways. Novices may write them sequentially, one line after another, or ...
详细信息
ISBN:
(纸本)9798400704239
Novices frequently learn to program using text-based programming, in languages such as Java. Programs can be constructed in a variety of different ways. Novices may write them sequentially, one line after another, or they may use top-down design to write outlines then fill them in. They may do a lot of trial and error: writing and deleting as they receive errors, or they may use a lot of copy-and-paste. This level of detail - higher than keystroke-level editing but below plan-composition analysis - has rarely been explored in programming education research, but it can provide insight into how novices tackle program construction, and offer hints as to how they wrestle with the challenges of constructing an error-free program. In this paper we used thematic analysis to create a reliable set of tags for Java program construction, and then used them to tag over 100 programming sessions lasting over 300 hours. We empirically find that novices rarely comment, rarely plan, and frequently program by copying code they already wrote in the project and pasting it then adjusting it - which we think indicates a way to transfer the knowledge of the code they just wrote to the next code they are constructing. We offer thoughts on the viability of this work and the difficulty of tagging higher-level behaviours such as responses to errors.
This study highlighted the assessed influence of self-efficacy in computerprogramming and grades in programming courses in C language as predictors for the object-oriented programming performance in Java of the (306)...
详细信息
Dependently typed languages allow us to state a program's expected properties and automatically check that they are satisfied at compile time. Yet the implementations of these languages are themselves just softwar...
详细信息
ISBN:
(纸本)9789819789429;9789819789436
Dependently typed languages allow us to state a program's expected properties and automatically check that they are satisfied at compile time. Yet the implementations of these languages are themselves just software, so can we really trust them? The goal of this paper is to develop a lightweight technique to improve their trustworthiness by giving a formal specification of the typing rules and intrinsically verifying the type checker with respect to these rules. Concretely, we apply this technique to a subset of Agda's internal language, implemented in Agda. Our development relies on erasure annotations to separate the specification from the runtime of the type checker. We provide guidelines for making design decisions for certified core type checkers and evaluate trade-offs.
This study focused on the impact of teaching a computerprogramming course using innovative pedagogy namely a combination of context-based learning and problem-based interspersed with live online tools (Google Classro...
详细信息
This study focused on the impact of teaching a computerprogramming course using innovative pedagogy namely a combination of context-based learning and problem-based interspersed with live online tools (Google Classroom and Google Meet) on university students in southeast, Nigeria. This study used a quasi-experimental research design and intact classes with a nonequivalent group. The population for the study comprised all 152 second-year computer education students in universities in Southeast Nigeria that offers computerprogramming. The sample consists of 60 males and 92 females in the three universities used. A computerprogramming achievement test was used to collect the data. The result showed that students worked collaboratively on the Google classroom and Google meet platforms, effectively enhancing collaboration learning among novice programmers as they chose when to learn, thus making the teaching and learning of programming less difficult. Findings further showed that student academic achievement significantly improved in programming skills, digital skills development, and self-efficacy in the treatment group more than in the control group. This improved performance was attributed to self-efficacy which was attributed to IP students were exposed to. It was suggested that computer lecturers should integrate innovative pedagogy using Google classroom and Google meet in their instructional delivery approaches.
Dynamic programming is one of the most challenging algorithm design techniques for computer programmers. Students frequently struggle with dynamic programming algorithms in Data Structures and Algorithms courses, and ...
详细信息
ISBN:
(纸本)9798350380170;9798350380163
Dynamic programming is one of the most challenging algorithm design techniques for computer programmers. Students frequently struggle with dynamic programming algorithms in Data Structures and Algorithms courses, and software developers often find it difficult to solve dynamic programming problems during job interviews. To address this issue, we have developed a new visualization technique to help students better understand, analyze, and design dynamic programming algorithms. Previous dynamic programming visualizations have primarily focused on illustrating the execution sequence of programs. Our visualizations are designed to help students recognize the common logical patterns shared by a diverse set of problems. Additionally, students can use these visualizations as visual aids to assist them in designing dynamic programming algorithms.
Background and Context. Increasing gender diversity in the field of computerscience (CS) benefits the economy as well as gender equality. However, several obstacles - including underdeveloped CS interests, lack of pr...
详细信息
ISBN:
(纸本)9781450399760
Background and Context. Increasing gender diversity in the field of computerscience (CS) benefits the economy as well as gender equality. However, several obstacles - including underdeveloped CS interests, lack of programming experience, and a misfit with the stereotypes of computer scientists - prevent women from entering the field. Although these barriers develop from an early age, research focused on children is limited. Furthermore, limited work is done within European countries. Objectives. In this study, we research the interest children aged 7 to 14 have in a CS career. Additionally, we look into whether children with different characteristics have a different interest in CS. As such our research question: How does children's interest in a CS career differ based on their a) age, b) gender, c) computer interests, d) programming experience, and e) stereotypical beliefs?. Method. We collected data from 200 children in a science museum located in the Netherlands. We gathered data on their gender, age, computer interests, programming experience, stereotypical beliefs and interest in becoming a programmer - as representative of a CS career. We used self-reported closed questions and reduced-length Child Implicit Association Tests. Findings. In general, the participating children are not interested in a CS career. We did find several characteristics related to a higher interest in a CS career: being a boy, having an interest in computers or video gaming, gaining programming experience at home or at an out-of-school activity, and the belief that programmers are social. Implications. To increase the participation of women in CS, we suggest motivating girls more to engage in computer and programming activities - especially out-of-school activities - while ensuring that these activities are gender inclusive.
暂无评论