This paper describes Obliq-3D, a high-level, fast-turnaround system for building 3D animations. Obliq-3D consists of an interpreted language that is embedded into a 3D animation library. This library is based on a few...
详细信息
This paper describes Obliq-3D, a high-level, fast-turnaround system for building 3D animations. Obliq-3D consists of an interpreted language that is embedded into a 3D animation library. This library is based on a few simple, yet powerful constructs that allow programmers to describe three-dimensional scenes and animations of such scenes. By virtue of its interpretive nature, Obliq-3D provides a fast-turnaround environment. The combination of simplicity and fast turnaround allows programmers to construct nontrivial animations quickly and easily. The paper is divided into three major parts. The first part introduces the basic concepts of Obliq-3D, using a series of graduated examples. The second part shows how the system can be used to implement Cone Trees. The third part develops a complete animation of Dijkstra's shortest-path algorithm.
Software visualization and algorithm animation have been tackled almost exclusively from the visual point of view;this means representation and control occur through the visual channel. This approach has its limitatio...
详细信息
Software visualization and algorithm animation have been tackled almost exclusively from the visual point of view;this means representation and control occur through the visual channel. This approach has its limitations. To achieve better comprehension, we deal with multimodal interfaces that include the extended facilities of interaction together with those of the standard systems for data visualization and algorithm animation. The notion of specific concept keyboards is introduced. As a consequence, modern information and learning systems for algorithm animation are enhanced in such a way that control and interaction take place through appropriate interfaces designed and semi-automatically generated for this special purpose. In this paper, we provide some examples and report on a thorough evaluation to show the relevance of this new approach. (C) 2007 Elsevier Ltd. All rights reserved.
Different high performance techniques, such as profiling, tracing, and instrumentation, have been used to tune and enhance the performance of parallel applications. However, these techniques do not show how to explore...
详细信息
Different high performance techniques, such as profiling, tracing, and instrumentation, have been used to tune and enhance the performance of parallel applications. However, these techniques do not show how to explore the potential of parallelism in a given application. Animating and visualizing the execution process of a sequential algorithm provide a thorough understanding of its usage and functionality. In this work, an interactive web-based educational animation tool was developed to assist users in analyzing sequential algorithms to detect parallel regions regardless of the used parallel programming model. The tool simplifies algorithms' learning, and helps students to analyze programs efficiently. Our statistical t-test study on a sample of students showed a significant improvement in their perception of the mechanism and parallelism of applications and an increase in their willingness to learn algorithms and parallel programming.
Visualization tools of different languages offer its users with a needed set of features allowing them to animate how programs of such languages work. Constraint Handling Rules (CHR) is currently used as a general pur...
详细信息
ISBN:
(纸本)9783319178226;9783319178219
Visualization tools of different languages offer its users with a needed set of features allowing them to animate how programs of such languages work. Constraint Handling Rules (CHR) is currently used as a general purpose language. This results in having complex programs with CHR. Nevertheless, CHR is still lacking on visualization tools. With Constraint Handling Rules (CHR) being a high-level rule-based language, animating CHR programs through animation tools demonstrates the power of the language. Such tools are useful for beginners to the language as well as programmers of sophisticated algorithms. This paper continues upon the efforts made to have a generic visualization platform for CHR using source-to-source transformation. It also provides a new visualization feature that enables viewing all the possible solutions of a CHR program instead of the don't care nondeterminism used in most CHR implementations.
The number and complexity of algorithms and data structures are expanding every day and it is becoming increasingly difficult to visualize the abstractions involved in implementing and applying data structures and alg...
详细信息
The number and complexity of algorithms and data structures are expanding every day and it is becoming increasingly difficult to visualize the abstractions involved in implementing and applying data structures and algorithms, which form the back-bone of almost all computer applications. Animated algorithms and data structrues enhance our understanding of abstract concepts, aid program debugging, increase programmer productivity and reduce analysis and design costs. animation of algorithms usually involves the display of various features in multiple dynamic windows, including an animated display of the text of the algorithm in one window and a dynamically changing graphical interpretation of the algorithm in execution in another. This paper concentrates on the development of a system for animated display of Pascal programs and the definition of rules to impregnate a given algorithm with code to animate it.
algorithm visualizations are widely viewed as having the potential for major impact on computer science education, but their quality is highly variable. We report on the software development practices used by creators...
详细信息
algorithm visualizations are widely viewed as having the potential for major impact on computer science education, but their quality is highly variable. We report on the software development practices used by creators of algorithm visualizations, based on data that can be inferred from a catalog of over 600 algorithm visualizations. Since nearly all are free for use and many provide source code, they might be construed as being open source software. Yet many AV developers do not appear to have used open source best practices. We discuss how such development practices might be employed by the algorithm visualization community, and how they might lead to improved algorithm visualizations in the future. We conclude with a discussion of OpenDSA, an open-source project that builds on earlier progress in the field of algorithm visualization and hopes to use open-source procedures to gain users and contributors. (C) 2014 Elsevier B.V. All rights reserved.
Data Structures and algorithms are a central part of Computer Science. Due to their abstract and dynamic nature, they are a difficult topic to learn for many students. To alleviate these learning difficulties, instruc...
详细信息
Data Structures and algorithms are a central part of Computer Science. Due to their abstract and dynamic nature, they are a difficult topic to learn for many students. To alleviate these learning difficulties, instructors have turned to algorithm visualizations (AV) and AV systems. Research has shown that especially engaging AVs can have an impact on student learning of DSA topics. Until recently, most AV systems were Java-based systems. But, the popularity of Java has declined and is being supplanted by HTML5 and JavaScript content online. In this paper, we present JSAV: the JavaScript AV development library. JSAV goes beyond traditional AV library support for displaying standard data structures components, to provide functionality to simplify creation of AVs on many engagement levels including interactive exercises. We describe the growing body of content created with JSAV and summarize our three years of experience and research results from using JSAV to build content that supports CS education.
This paper presents JAVENGA, which is an acronym for JAva-based Visualization Environment for Network and Graph algorithms. It is a new visualization software for educational purposes. It includes visualizations of ma...
详细信息
This paper presents JAVENGA, which is an acronym for JAva-based Visualization Environment for Network and Graph algorithms. It is a new visualization software for educational purposes. It includes visualizations of many well-known graph and network algorithms. However, besides simple algorithms the tool also illustrates a visualization of a quite complex one, such as the Network Simplex algorithm. The recommended tool includes a graph editor where directed and undirected graphs can be drawn, it allows users to give input to an algorithm and then see its visualization in a user-controlled way, and finally it incorporates a solution window where one can see the values of variables at each step of algorithm execution. JAVENGA, as its name states, has been implemented in Java language and it can be run either as an applet or as a Java application. Further, one can execute the program either locally or remotely via the Web. It can be used by instructors as auxiliary teaching material in the context of a graph theory or network optimization course. Besides, instructors can use the tool to grade students' assignments or exams. Students can also use the software in a self-learning approach. (C) 2009 Wiley Periodicals, Inc. Comput Appl Eng Educ 20: 255-268, 2012;View this article online at ***/journal/cae;DOI 10.1002/cae.20392
This paper describes JCAT, a Java-based system for building Web-based collaborative active textbooks on algorithms. JCAT augments the expressive power of Web pages for publishing passive multimedia information with a ...
详细信息
This paper describes JCAT, a Java-based system for building Web-based collaborative active textbooks on algorithms. JCAT augments the expressive power of Web pages for publishing passive multimedia information with a full-fledged interactive algorithm animation system. The system is built in such a way that views of a running program may reside on different machines, thereby making JCAT particularly well-suited for electronic classrooms. In such a setting, an instructor controls the animation, while students view the animation by painting their Web browsers at the appropriate page. (C) 1997 Elsevier Science B.V.
We discuss how to increase and simplify the understanding of the equivalence relations between machine models and/or language representations of formal languages by means of the animation tool SAGEMoLiC. Our new educa...
详细信息
We discuss how to increase and simplify the understanding of the equivalence relations between machine models and/or language representations of formal languages by means of the animation tool SAGEMoLiC. Our new educational tool permits the simulation of the execution of models of computation, as many other animation systems do, but its philosophy goes further than these of the usual systems since it allows for a true visualization of the key notions involved in the formal proofs of these equivalences. In contrast with the proposal of previous systems, our approach to visualize equivalence theorems is not a simple "step by step animation" of specific conversion algorithms between computational models and/or grammatical representations of formal languages, because we make emphasis on the key theoretical notions involved in the formal proofs of these equivalences. (C) 2002 Elsevier Science B.V. All rights reserved.
暂无评论