检索结果-内蒙古大学图书馆

THEORETICAL computer science 2025年 1032卷

作者： Gadouleau, Maximilien Mertzios, George B. Zamaraev, Viktor Univ Durham Dept Comp Sci Durham England Univ Liverpool Dept Comp Sci Liverpool England

In this paper we introduce a new operation for Linear programming (LP), called LP complementation, which resembles many properties of LP duality. Given a maximisation (resp. minimisation) LP P, we define its complement Q as a specific minimisation (resp. maximisation) LP which has the same objective function as P. Our central result is the LP complementation theorem, that relates the optimal value OPT(P) of P and the optimal value OPT(Q) of its complement by OPT(P) + 1 1 OPT(Q) = 1. The LP complementation operation can be applied if and only if P has an optimum value greater than 1. To illustrate this, we first apply LP complementation to hypergraphs. For any hypergraph H, we review the four classical LPs, namely covering x(H), packing P(H), matching M(H), and transversal T (H). For every hypergraph H = (V, E), we call H = (V, {V \ e : e E E}) the complement of H. For each of the above four LPs, we relate the optimal values of the LP for the dual hypergraph H* to that of the complement hypergraph H (e.g. 1 1 OPT(x(H*)) + = 1). OPT(x(H)) We then apply LP complementation to fractional graph theory. We prove that the LP for the fractional in-dominating number of a digraph D is the complement of the LP for the fractional total out-dominating number of the digraph complement D of D. Furthermore we apply the hypergraph complementation theorem to matroids. We establish that the fractional matching number of a matroid coincide with its edge toughness. As our last application of LP complementation, we introduce the natural problem VERTEX COVER WITH BUDGET (VCB): for a graph G = (V, E) and a positive integer b, what is the maximum number tb of vertex covers S1, ... , Stb of G, such that every vertex v E V appears in at most b vertex covers? The integer b can be viewed as a "budget" that we can spend on each vertex and, given this budget, we aim to cover all edges for as long as possible. We relate VCB with the LP QG for the fractional chromatic number xf of a graph G. More sp

关键词： Linear programming Duality Hypergraph Fractional vertex cover Fractional dominating number

来源：评论

学校读者我要写书评

暂无评论

Course Scheduling Made Easier: A User-Friendly Web-Based Timetabling Tool Using PyGLPK 21st

Course Scheduling Made Easier: A User-Friendly Web-Based Tim...

引用

21st International Conference on Cooperative Design, Visualization, and Engineering (CDVE)

作者： Anthony, Barbara M. Mueller, Mark Southwestern Univ Dept Math & Comp Sci 1001 E Univ Ave Georgetown TX 78626 USA

ISBN: (纸本)9783031713149;9783031713156

Course scheduling is a necessary but often challenging task, requiring consideration of university requirements, practical limitations, departmental needs, and faculty preferences. Furthermore, it can be difficult to determine if a proposed schedule satisfies all of the requirements, especially as changes may be made within the process. Clearly articulated schedule requirements can be translated into an integer linear program by operations researchers, and those with domain-specific knowledge can then use linear programming solvers like PyGLPK. However, few faculty members in a university are likely to have that experience, so we developed a web-based tool, including the underlying Python code, that allows for entry of information about courses and the faculty teaching them and creates a schedule consistent with the requirements. More than simply a scheduler, a user can propose changes such as swapping two courses or placing a course at a specific time;the website will either do so, or report that such a change is infeasible. In addition, a user can share the website and file with colleagues, allowing them to better appreciate what is and is not possible for the overall schedule. Recognizing that the precise set of scheduling requirements is often unique to a given university, the source code is made available in a public GitHub repository, providing opportunities for other universities to create a version customized to their needs and structure.

关键词： Integer linear programming University timetabling User interface

来源：评论

学校读者我要写书评

暂无评论

QoE-Based Assignment of EVs to Charging Stations in Metropolitan Environments

IEEE Transactions on Intelligent Vehicles

引用

IEEE Transactions on Intelligent Vehicles 2024年 1-16页

作者： Aljaidi, Mohammad Aslam, Nauman Kaiwartya, Omprakash Chen, Xiaomin Sadiq, Ali Safaa Kumar, Sushil Alsarhan, Ayoub Department of Computer Science Zarqa University Zarqa Jordan Department of Computer and Information Sciences Northumbria University Newcastle upon Tyne U.K Department of Computer Science Nottingham Trent University U.K Jawaharlal Nehru University New Delhi India Department of Information Technology Faculty of Prince Al-Hussein Bin Abdallah II for Information Technology The Hashemite University Zarqa Jordan

With the recent advances in battery technology enabling fast charging, public Charging Stations (CSs) are becoming a viable choice for Electric Vehicles (EVs). However, the distribution of EVs relies on strategic assignment of EVs to CSs. EVs drivers' Quality of Experience (QoE) is an significant impact factor that should be considered to find the optimal assignment of EVs to CSs. In this context, a novel framework to find the optimal assignment of EVs to CSs has been proposed based on optimization of QoE. Our proposed approach considers the travel time of EVs towards CSs taking into account the distance between EVs and CSs, the impact of congestion level on the roads resulted from the Internal Combustion Engine Vehicles (ICEVs) and EVs, queuing time at the CSs, and the time required to fully charge the EVs battery when connected to any charging slot at a CSs. The adjacency between the different zones in a city environment is also considered in order to minimize the potential number of CSs for each EVs. Specifically, the assignment problem is formulated as Mixed Integer Nonlinear programming (MINLP), and a heuristic solution is developed using the Genetic Algorithm (GA) technique. The performance evaluation in realistic metropolitan environment attests the benefits of the proposed CSs assignment framework considering range of charging metrics. IEEE

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on the Construction of Knowledge Graph Oriented to programming Methodology Course 24

Research on the Construction of Knowledge Graph Oriented to ...

引用

16th International Conference on Education Technology and computers

作者： Ye, Feng Jin, Zishuo Zhai, Mengfan Nedjah, Nadia Zhang, Xuejie Yang, Zihao Hohai Univ Coll Comp & Software Engn Nanjing Jiangsu Peoples R China Univ Estado Rio De Janeiro Dept Elect Engn & Telecommun Engn Fac Rio De Janeiro RJ Brazil

ISBN: (纸本)9798400717819

The course on programming methodology is integral to computer science and software engineering education. Knowledge graph has been an interesting topic in recent decades, and knowledge graph has propelled its use in systematically organizing, thoroughly analyzing, and fully leveraging knowledge to become a focal point in teaching research and application, yielding significant progress. Therefore, this paper proposes a method for constructing a knowledge graph tailored to the curriculum. Furthermore, it establishes a comprehensive course knowledge graph, a student capability knowledge graph, and a course resource knowledge graph. Upon this foundation, by leveraging the multi-model database ArangoDB and the visualization framework GraphVIS, a visualized system for a curriculum knowledge graph has been realized. This study aims to offer a reference for the construction and pedagogical approaches of the course, and preliminary applications of the system have received positive feedback.

关键词： Knowledge graph programming Methodology Visualization Pedagogical approach

来源：评论

学校读者我要写书评

暂无评论

A Systematic Evaluation of Code-generating Chatbots for Use in Undergraduate computer science Education 54

A Systematic Evaluation of Code-generating Chatbots for Use ...

引用

54th IEEE Frontiers in Education Conference, FIE 2024

作者： Torek, Adam Sorensen, Elijah Hahle, Natalie Kennington, Casey Boise State University United States

ISBN: (纸本)9798350351507

This research paper focuses on evaluating code-generating chatbots. Chatbots like ChatGPT released in the past three years have proven capable of a wide variety of tasks within a conversational interaction, including writing code and answering code-related questions. With these recent advances, chatbots have many potential uses in education, including computer science education. However, before these chatbots are used in CS curricula, their capabilities and limitations must be systematically tested and understood. In this work, we evaluate the capabilities and limitations of four known, open-source, code-based chatbots in programming tasks by performing a standardized study in which different chatbots are tasked with providing answers for a variety of assignments from Boise State University's computer science program. We found that while all of the chatbots can write code and provide explanations, some do better than others, and each of them work differently in conversations. Moreover, all of them suffered similar and important limitations, which has implications for adoption in curriculum. As a second experiment, we used the Llama chatbot to perform a human evaluation by enabling student novice and experienced programmers to use it as a coding assistant to complete specific tasks in a common software development environment. We found that the coding assistant can help novice programmers accomplish simple tasks in comparable time and code efficacy as more experienced programmers. Given these experiments, and given feedback from participants in our studies, we see a clear picture emerge: new programmers should learn important concepts about programming without the help of code assistants so students can (1) demonstrate their understanding of important concepts and (2) have enough experience to assess code assistant output as useful or erroneous. Then, once intermediate skills are mastered (e.g., object oriented programming and data structures), it seems appropriate t

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Analysis of programming Performance Based on 2-grams of Keystrokes and Mouse Operations 21

Analysis of Programming Performance Based on 2-grams of Keys...

引用

21st IEEE/ACIS International Conference on Software Engineering Research, Management and Applications, SERA 2023

作者： Matsumoto, Kazuki Nishiura, Kinari Sasakura, Mariko Monden, Akito Okayama University Graduate School of Natural Science and Technology Okayama Japan

ISBN: (纸本)9798350345889

Individual differences in programming performance are very large. For objectivity in programming performance, there is a strong need to quantitatively evaluate programming performance of individual developer. In this study, we conduct an experiment to measure programmers' behaviors including keystrokes and mouse operations of fourteen subjects, and analyze correlations between them and programming performance. The experimental results show that those who check a lot of program operation and those who use shortcut keys frequently had higher programming performance. In addition, subjects who spent a lot of time searching on the web, compiled a lot, and rewrote a lot of code had lower programming performance. © 2023 IEEE.

关键词： 2-gram analysis keystroke mouse click programming performance

来源：评论

学校读者我要写书评

暂无评论

Understanding Quantum Parallelism through programming

Understanding Quantum Parallelism through Programming

引用

International Conference on Computational science and Computational Intelligence (CSCI)

作者： Sang, Janche Yu, Chansu Cleveland State Univ Dept Comp Sci Cleveland OH 44115 USA Cleveland State Univ Dept Elect & Comp Engn Cleveland OH USA

ISBN: (纸本)9798350361513;9798350372304

Quantum parallelism arises from the ability of quantum qubits to exist in multiple states simultaneously due to superposition. It enables quantum computers to explore a vast number of possibilities in parallel, potentially solving complex problems exponentially faster than classical computers. Recently, there has been an increasing demand for skilled professionals with expertise in quantum computing and programming This paper presents a practical approach to teaching quantum computing to Electrical Engineering & computer science (EECS) students through dedicated hands-on programming labs. The labs cover a diverse range of topics, encompassing fundamental elements, such as quantum gales and circuits, as well as quantum algorithms. As educators, we aim to share our teaching insights and resources with fellow instructors in the field. This article elucidates the rationale behind the design of each experiment, enabling a deeper understanding of quantum computing.

关键词： Quantum Parallelism Quantum Computing Education Quantum programming Hands-On Laboratory Qiskit

来源：评论

学校读者我要写书评

暂无评论

Why Is Recursion Hard to Comprehend? An Experiment with Experienced Programmers in Python 29

Why Is Recursion Hard to Comprehend? An Experiment with Expe...

引用

29th Annual Conference on Innovation and Technology in computer science Education (ITiCSE)

作者： Baron, Aviad Feitelson, Dror G. Hebrew Univ Jerusalem Jerusalem Israel

ISBN: (纸本)9798400706004

Recursion has the reputation of being hard to teach and understand. Our goal is to identify precisely what it is about recursion that makes it hard, and use this to devise a systematic teaching plan. We first make a distinction between regular recursion and tail recursion - the special case where the recursive call is the last command that is executed by the function. Tail recursion is the preferred form used in functional programming, because it simplifies memory management, and we hypothesize that it is also easier to understand. We conducted a controlled experiment with 139 participants, in which they were asked to understand different recursive functions. This revealed that tail recursion, when it is natural to use, is indeed easier to understand than the more general form of recursion where significant processing is performed after the recursive call. But it also showed that using tail recursion may come with a price, as when achieving the tail form requires a transformation of the code that obfuscates the underlying recursive algorithm. We conclude that having significant processing after the recursive call, or distorting the code so as to remove such processing, are major factors that make recursion hard. We therefore suggest to start teaching recursion with a basic form of tail recursion, and then progress to more complicated cases with processing after the recursive call. Transformations to tail form should be taught last, if at all.

关键词： Recursion Code comprehension computer science education

来源：评论

学校读者我要写书评

暂无评论

Learning Deterministic Surrogates for Robust Convex QCQPs 1

引用

21st International Conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Persak, Egon Anjos, Miguel F. Univ Edinburgh Edinburgh Midlothian Scotland

ISBN: (数字)9783031605994

ISBN: (纸本)9783031606014;9783031605994

Decision-focused learning is a promising development for contextual optimisation. It enables us to train prediction models that reflect the conditional sensitivity and uncertainty structure of the problem. However, there have been limited attempts to extend this paradigm to robust optimisation. We propose a double implicit layer model for training prediction models with respect to robust decision loss in uncertain convex quadratically constrained quadratic programs (QCQP). The first layer solves a deterministic version of the problem, the second layer evaluates the worst case realisation for an uncertainty set centred on the observation given the decisions obtained from the first layer. This enables us to learn model parameterisations that lead to robust decisions while only solving a simpler deterministic problem at test time. Additionally, instead of having to solve a robust counterpart we solve two smaller and potentially easier problems in training. The second layer (worst case problem) can be seen as a regularisation approach for predictand-optimise by fitting to a neighbourhood of problems instead of just a point observation. We motivate a reformulation of the worst-case problem for a case of uncertainty sets that would otherwise lead to trust region problems. Both layers are typically strictly convex in this problem setting and thus have meaningful gradients almost everywhere. We demonstrate an application of this model on simulated experiments. The method is an effective regularisation tool for decision-focused learning for uncertain convex QCQPs.

关键词： Differentiable Optimisation Quadratic programming Robust Optimisation Robust Predict-and-Optimise

来源：评论

学校读者我要写书评

暂无评论

Can Small Language Models With Retrieval-Augmented Generation Replace Large Language Models When Learning computer science? 29

Can Small Language Models With Retrieval-Augmented Generatio...

引用

29th Annual Conference on Innovation and Technology in computer science Education (ITiCSE)

作者： Liu, Suqing Yu, Zezhu Huang, Feiran Bulbulia, Yousef Bergen, Andreas Liut, Michael Univ Toronto Mississauga Mississauga ON Canada

ISBN: (纸本)9798400706004

Leveraging Large Language Models (LLMs) for personalized learning and support is becoming a promising tool in computing education. AI Assistants can help students with programming, problem-solving, converse with them to clarify course content, explain error messages to help with debugging, and much more. However, using cloud-based LLMs poses risks around data security, privacy, but also control of the overarching system. To address these concerns, we created a locally-stored Small Language Model (SLM) that leverages different Retrieval-Augmented Generation (RAG) methods to support computing students' learning. We compare one SLM (neural-chat-7b-v3 - fine-tuned version of Mistral-7B-v0.1) against two popular LLMs (gpt-3.5-turbo and gpt-4-32k) to see the viability for computing educators to use in their course(s). We use conversations from a CS1 course (N = 1, 260), providing students with an AI Assistant (using gpt-3.5-turbo) to help them learn content and support problem-solving while completing their Python programming assignment. In total, we had 269 students use the AI Assistant, with a total of 1, 988 questions asked. Using this real conversational data, we re-ran student questions using our novel SLM (neural-chat-7b-v3 testing nine different RAG methods) and gpt-4-32k, then compared those results against the original gpt-3.5-turbo responses. Our findings indicate that using an SLM with RAG can perform similarly, if not better, than LLMs. This shows that it is possible for computing educators to use SLMs (with RAG) in their course(s) as a tool for scalable learning, supporting content understanding and problem-solving needs, while employing their own policies on data privacy and security.

关键词： Small Language Models Retrieval Augmented Generation Large Language Models Intelligence Concentration Conversational Agent Personalized AI Agent Locally Deployable AI Intelligent Tutoring System Intelligent Teaching Assistant CS1 Computing Education

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：