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

作者： Maji, Nabanita Virginia Tech | University

A Theory of algorithms course is essential to any Computer Science curriculum at both the undergraduate and graduate levels. It is also considered to be difficult material to teach or to learn. In particular the topics of Computational Complexity Theory, reductions, and the NP-Complete class of problems are considered difficult by students. Numerous algorithm visualizations (AVs) have been developed over the years to portray the dynamic nature of known algorithms commonly taught in undergraduate classes. However, to the best of our knowledge, the instructional material available for NP-Completeness is mostly static and textual, which does little to alleviate the complexity of the topic. Our aim is to improve the pedagogy of NP-Completeness by providing intuitive, interactive, and easy-to-understand visualizations for standard NP Complete problems, reductions, and proofs. In this thesis, we present a set of visualizations that we developed using the OpenDSA framework for certain NP-Complete problems. Our paradigm is a three step process. We first use an AV to illustrate a particular NP-Complete problem. Then we present an exercise to provide a first-hand experience with attempting to solve a problem instance. Finally, we present a visualization of a reduction as a part of the proof for NP-Completeness. Our work has been delivered as a collection of modules in OpenDSA, an interactive eTextbook system developed at Virginia Tech. The tutorial has been introduced as a teaching supplement in both a senior undergraduate and a graduate class. We present an analysis of the system use based on records of online interactions by students who used the tutorial. We also present results from a survey of the students.

关键词： NP Completeness Complexity Theory Reductions algorithm visualization Computer Science Education Automated Assessment Thesis

来源：评论

学校读者我要写书评

暂无评论

Vizualizace algoritmů pro vyhledávání v textech

Vizualizace algoritmů pro vyhledávání v textech

引用

作者： Remiš, Daniel Charles University of Prague

The work deals with design and implementation of the program, which is used to clarify the operation of algorithms for searching through text using a graphical view of their structures. The work also includes some ana... 详细信息

关键词： algorithm visualization e-learning text retrieval

来源：评论

学校读者我要写书评

暂无评论

Iteratively Intervening with the "Most Difficult" Topics of an algorithms and Complexity Course

引用

ACM TRANSACTIONS ON COMPUTING EDUCATION 2017年第1期17卷 4-4页

作者： Enstrom, Emma Kann, Viggo KTH Royal Inst Technol Sch Comp Sci & Commun Dept Theoret Comp Sci Stockholm Sweden

When compared to earlier programming and data structure experiences that our students might have, the perspective changes on computers and programming when introducing theoretical computer science into the picture. Underlying computational models need to be addressed, and mathematical tools employed, to understand the quality criteria of theoretical computer science. Focus shifts from doing to proving. Over several years, we have tried to make this perspective transition smoother for the students of a third-year mandatory algorithms, data structures, and computational complexity course. The concepts receiving extra attention in this work are NP-completeness, one of the most central concepts in computer science, and dynamic programming, an algorithm construction method that is powerful but somewhat unintuitive for some students. The major difficulties that we attribute to NP-completeness are that the tasks look similar but have a different purpose than in algorithm construction exercises. Students do not immediately see the usefulness of the concept, and hence motivation could be one issue. One line of attacking NP-completeness has been to emphasize its algorithmic aspects using typical tools for teaching algorithms. Some potential difficulties associated with dynamic programming are that the method is based on a known difficult concept-recursion-and that there are many ingredients in a dynamic programming solution to a problem. For both dynamic programming and NP-completeness, we have invented several new activities and structured the teaching differently, forcing students to think and adopt a standpoint, and practice the concepts in programming assignments. Student surveys show that these activities are appreciated by the students, and our evaluations indicate that they have positive effects on learning. We believe that these activities could be useful in any similar course. The approach to improving the course is action research, and the evaluation has been done u

关键词： algorithm visualization assessment dynamic programming NP-completeness pattern-oriented instruction proofs self-efficacy

来源：评论

学校读者我要写书评

暂无评论

Vizualizace algoritmů pro vyhledávání v textech

Vizualizace algoritmů pro vyhledávání v textech

引用

作者： Remiš, Daniel Charles University of Prague

The work deals with design and implementation of the program, which can be used to clarify text retrieval algorithms using a graphical view of their structures. The work includes analyzis of already existing, visualiz... 详细信息

关键词： algorithm visualization e-learning text retrieval

来源：评论

学校读者我要写书评

暂无评论

ProjectionPathExplorer: Exploring Visual Patterns in Projected Decision-making Paths

引用

ACM TRANSACTIONS ON INTERACTIVE INTELLIGENT SYSTEMS 2021年第3-4期11卷 22-22页

作者： Hinterreiter, Andreas Steinparz, Christian Schoefl, Moritz Stitz, Holger Streit, Marc Johannes Kepler Univ Linz Altenberger Str 69 A-4040 Linz Austria Imperial Coll London South Kensington Campus London SW7 2AZ England Datavisyn GmbH Altenberger Str 69 A-4040 Linz Austria

In problem-solving, a path towards a solutions can be viewed as a sequence of decisions. The decisions, made by humans or computers, describe a trajectory through a high-dimensional representation space of the problem. By means of dimensionality reduction, these trajectories can be visualized in lower-dimensional space. Such embedded trajectories have previously been applied to a wide variety of data, but analysis has focused almost exclusively on the self-similarity of single trajectories. In contrast, we describe patterns emerging from drawing many trajectories-for different initial conditions, end states, and solution strategies-in the same embedding space. We argue that general statements about the problem-solving tasks and solving strategies can bemade by interpreting these patterns. We explore and characterize such patterns in trajectories resulting from human and machine-made decisions in a variety of application domains: logic puzzles (Rubik's cube), strategy games (chess), and optimization problems (neural network training). We also discuss the importance of suitably chosen representation spaces and similarity metrics for the embedding.

关键词： algorithm visualization game visualization dimensionality reduction trajectories multivariate time series

来源：评论

学校读者我要写书评

暂无评论

Computer Graphics algorithm Demonstration System

引用

Procedia Computer Science 2023年 228卷 736-744页

作者： Fang Wang Kan Yu Lei Yang Faculty of Information Science and Technology Wenhua College Wuhan 430074 Hubei China

With the rapid development of computer technology. Many scholars pay close attention to computer graphics algorithms, which makes computer graphics widely used in various fields and enters a new revolutionary era. The purpose of this paper is to study the evaluation of computer graphics algorithm demonstration systems. Combining theory with practice, on the basis of careful analysis of the principle of graphics algorithm, a new idea of synchronization of graphics production process and a specific algorithm for realizing graphics are proposed, and most graphics in computer graphics are visualized. It breaks the limitation that only two-dimensional graphic simulation effects can be realized, and increases the interactive user control system. The algorithm complexity is significantly reduced, the graphics creation speed is increased, and the simulation effect is more realistic. After the introduction of this visual teaching demonstration system, these abstract principles can be explained intuitively, which can significantly improve the teaching quality.

关键词： Computer Graphics Presentation System System Evaluation algorithm visualization

来源：评论

学校读者我要写书评

暂无评论

The Role of visualization in Computer Science Education

引用

COMPUTERS IN THE SCHOOLS 2012年第1-2期29卷 95-117页

作者： Fouh, Eric Akbar, Monika Shaffer, Clifford A. Virginia Tech Blacksburg VA USA

Computer science core instruction attempts to provide a detailed understanding of dynamic processes such as the working of an algorithm or the flow of information between computing entities. Such dynamic processes are not well explained by static media such as text and images, and are difficult to convey in lecture. The authors survey the history of visualization in computer science education, focusing on artifacts that have a documented positive educational assessment. Changes in how computing technology has affected the development and uptake of such visualization artifacts in computer science education, and how recent technology changes are leading to progress in developing online hypertextbooks are then discussed.

关键词： algorithm visualization data structure visualization program visualization eTextbooks hypertextbooks

来源：评论

学校读者我要写书评

暂无评论

CodeVisions: Static Code Analysis for Creating Education-Oriented Applications 2023

CodeVisions: Static Code Analysis for Creating Education-Ori...

引用

Proceedings of the 54th ACM Technical Symposium on Computer Science Education V. 2

作者： Grace Zeyad Ahmed Mostafa Mohammed Assiut University Asyut Egypt

ISBN: (纸本)9781450394338

Simplifying programming for novices and students is a goal for many computer science instructors over the world and an essential concern for computer science education in general. In this paper we introduce CodeVisions, a static code analyzer and interpreter that provides testing and assessment mechanisms and generates a detailed trace of code execution. It's intended to be used to facilitate creating programming tutoring or coding assessing applications (Such as visualizers and auto-graders) through a variety of supported programming languages and flexibility of restricting code inputs. CodeVisions has a testing mechanism that allows users to write their own tests to validate the dump to their rules instead of manually parse the dump themselves resulting a test report *** and CSE researchers who are interested in creating educational applications like visualizers and auto-graders may find such applications complicated in terms of implementation. These projects require implementing compilers, interpreters, and virtual machines for processing the code snippets that can be student answer or a task which makes further development a big burden to the developer.

关键词： algorithm visualization static code analysis educational applications assessment

来源：评论

学校读者我要写书评

暂无评论

A kinesthetic-based collaborative learning system for distributed algorithms

A kinesthetic-based collaborative learning system for distri...

引用

2010 2nd International Conference on Education Technology and Computer(第二届IEEE教育技术与计算机国际会议 ICETC 2010)

作者： Hirotsugu Kakugawa Toshimitsu Masuzawa Hiroyuki Nagataki Taichi Fujii Yukiko Yamauchi Center for Faculty Development Okayama University Okayama Japan Graduate School of Information Science and Technology Osaka University Osaka Japan Graduate School of Information Science Nara Institute of Science and Technology Nara Japan

ISBN: (纸本)9781424463671;9781424463688;9781424463701

In this paper, we present a learning support system DASE-E to help students understand fundamental concepts of distributed algorithms in computer science. DASE-E is a collaborative learning system, in which the task of students is to devise a distributed algorithm. DASE-E offers a set of small wireless terminals with accelerometers. Each student plays the role of a process with a terminal, according to the algorithm that students devised. Each terminal enables a student to take physical actions that control the behavior of a process in the simulator. After the role playing simulation is finished, students discuss their activity played back on a *** implemented the system for learning distributed leader election algorithms, had a trial exercise in our research group, and we confirmed that it is effective to learn the critical part of distributed systems and algorithms.

关键词： computer science education distributed algorithm collaborative learning kinesthetic learning activity algorithm visualization

来源：评论

学校读者我要写书评

暂无评论

OpenDSA: using an active eTextbook to teach data structures and algorithms (abstract only) 13

OpenDSA: using an active eTextbook to teach data structures ...

引用

Proceeding of the 44th ACM technical symposium on Computer science education

作者： Eric Fouh Daniel Breakiron Mai Elshehaly T. Simin Hall Ville Karavirta Clifford A. Shaffer Virginia Tech Blacksburg VA USA Aalto University Helsinki Finland

ISBN: (纸本)9781450318686

We present a study to evaluate OpenDSA, an open source, online system combining textbook-quality content with algorithm visualizations and interactive exercises for data structures and algorithms courses. We hypothesize that answering many questions and exercises with immediate feedback allows students to know whether they are on track with their learning. In a quasi-experimental study, a control group received lecture and textbook for three weeks. The treatment section spent class time working through equivalent content and exercises in OpenDSA. A post-test compared the two. An opinion survey examined students' perception and opinions about the experience. Detailed interaction logs were used to analyze student use of the tutorials and exercises to understand how they used the system.

关键词： automated assessment etextbooks algorithm visualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：