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.
Traditional laboratory activities for students trying to develop a deep understanding of state space search methods involves them working at programming implementations of search methods. This study aimed to determine...
详细信息
ISBN:
(纸本)9781581132717
Traditional laboratory activities for students trying to develop a deep understanding of state space search methods involves them working at programming implementations of search methods. This study aimed to determine if interactive algorithm animations of search methods would make a suitable alternative laboratory *** specific hypotheses investigated were: (i) the animation group would develop at least as good an overall understanding of state space search methods; (ii) the animation group would develop a deeper understanding of state space search concepts pertaining to qualitative characteristics of search methods and the relationship between search *** basic experimental method adopted was a classical emperical quantitative evaluation involving 30 participants divided into one control group and one experimental group. All participants attended the same lecture presentations on state space search methods, but were split into distinct groups for undertaking the laboratory *** provided good evidence that the animation laboratory activity was at least as effective as traditional programming activities in aiding understanding of state space search methods, and that the animation group students developed a deeper understanding of one aspect of state space search methods.
OOGRAVIS, the Object-Oriented GRaphics algorithm and VIsualization System allows a programmer to develop a computer graphics rendering program (like a ray tracer, scan-line converter, etc.) with built in support For v...
详细信息
OOGRAVIS, the Object-Oriented GRaphics algorithm and VIsualization System allows a programmer to develop a computer graphics rendering program (like a ray tracer, scan-line converter, etc.) with built in support For visualizing the execution of the algorithm. OOGRAVIS includes a library of C++ classes that is useful for building rendering algorithms. These classes have hidden facilities for displaying internal aspects of the algorithm as it is executing. The programmer only needs to be concerned with developing the rendering algorithm using the OOGRAVIS classes-the visualization is implicit and automatic. This frees the programmer from the need to know about algorithm visualization techniques. (C) 1998 Elsevier Science Ltd. All rights reserved.
This paper investigates the visualization of geometric algorithms. We discuss how limiting the domain makes it possible to create a system that enables others to use it easily. Knowledge about the domain can be very h...
详细信息
This paper investigates the visualization of geometric algorithms. We discuss how limiting the domain makes it possible to create a system that enables others to use it easily. Knowledge about the domain can be very helpful in building a system which automates large parts of the user's task. A system can be designed to isolate the user from any concern about how graphics is done. The application need only specify ''what'' happens and need not be concerned with ''how'' to make it happen on the screen. We develop a conceptual model and a framework for experimenting with it. We also present a system, GASP, which implements this model. GASP allows quick generation of three-dimensional geometric algorithm visualizations, even for highly complex algorithms. It also provides a visual debugging facility for geometric computing. We show the utility of GASP by presenting a variety of examples.
Helping students to understand difficult pieces of code remains a challenge in Computer Science education. By providing a view of the code on a higher level of abstraction, algorithm Visualization (AV) aims at making ...
详细信息
Helping students to understand difficult pieces of code remains a challenge in Computer Science education. By providing a view of the code on a higher level of abstraction, algorithm Visualization (AV) aims at making the code more understandable. However, teachers consider producing AVs with the existing tools to require too much time and effort to be worthwhile. One way to lower this effort is to allow data exchange between AV systems. This paper continues the work of the ITiCSE Working Group (WG) "Development of XML-based Tools to Support User Interaction with algorithm Visualization". The WG aimed at specifying a common language for AV systems. We analyzed a number of existing AV languages and came up with requirements for a common language. Based on these requirements and the previous work by the WG, this paper defines a new AV language. Furthermore, this study describes a set of tools that allow data exchange between some of the existing AV systems. This data exchange gives teachers more choices and ready-made examples to be used in teaching.
We present an algorithm animation system, Xaa, which is tailored for string algorithms, and, in general, to algorithms that have as input one or two dimensional sequences of symbols. This system provides data generati...
详细信息
We present an algorithm animation system, Xaa, which is tailored for string algorithms, and, in general, to algorithms that have as input one or two dimensional sequences of symbols. This system provides data generation tools and statistics of the algorithm's behavior.
The CADAPPLETS Project provides Web-based animations (implemented as applets) of very large scale integration (VLSI) computer-aided design (CAD) algorithms as a learning resource for electrical and computer engineerin...
详细信息
The CADAPPLETS Project provides Web-based animations (implemented as applets) of very large scale integration (VLSI) computer-aided design (CAD) algorithms as a learning resource for electrical and computer engineering students, designers, and CAD tool developers. Concepts from software algorithm animation are adapted to illustrate the problem formulation and the operation of physical design algorithms for placement and routing. This paper surveys these animations and describes how they have been used in the classroom at Lafayette College, Easton, PA, by users over the Internet, and in courses at other universities worldwide.
In this paper, we describe an interactive visualization tool for representing the dynamics of graph algorithms. To reach this goal, we designed a web-based framework which illustrates the dynamics as time-to-space map...
详细信息
In this paper, we describe an interactive visualization tool for representing the dynamics of graph algorithms. To reach this goal, we designed a web-based framework which illustrates the dynamics as time-to-space mappings of dynamic graphs. Such static diagrams of dynamic data have the benefit of being able to display longer time spans in one view, hence supporting the observer with comparison tasks which is challenging or even impossible for graph algorithm animations. Our tool can show details about how an algorithm traverses a graph step-by-step in a static and animated fashion, for graph algorithm exploration as well as educational purposes. The animation together with the time-to-space mapping hence forms an overview-and-detail approach. We also allow changing of speed, replaying, stopping, storing intermediate stages with parameter configurations, as well as measuring and monitoring performance and memory consumption to eventually identify bottlenecks in a graph algorithm. By using flight carrier data from the United States Department of Transportation and a network of autonomous systems we demonstrate how we used the tool to explore two standard graph-theoretic algorithms. Finally, we discuss scalability issues and limitations.
This paper investigates the visualization of geometric computing in heterogeneous distributed environments. We show how focusing in a well-defined domain makes it possible to develop a compact system that is accessibl...
详细信息
This paper investigates the visualization of geometric computing in heterogeneous distributed environments. We show how focusing in a well-defined domain makes it possible to develop a compact system that is accessible to even naive users. We present a conceptual model and a system, GASP-II, that realizes this model in the geometric domain. The system allows the presentation and interactive exploration of three-dimensional geometric algorithms over the network. (C) 2000 Academic Press.
This paper investigates the visualization of distributed algorithms. We present a conceptual model and a system, VADE, that realizes this model. Since in asynchronous distributed systems there is no way of knowing (le...
详细信息
This paper investigates the visualization of distributed algorithms. We present a conceptual model and a system, VADE, that realizes this model. Since in asynchronous distributed systems there is no way of knowing (let alone, visualizing) the "real" execution, we show how to generate a visualization which is consistent with the execution of the distributed algorithm. We also present the design and implementation of our system. VADE is designed so that the algorithm runs on the server's machines while the visualization is executed on a web page on the client's machine. Programmers can write animations quickly and easily with the assistance of VADE's libraries. End-users can experiment with the animation and change its visual properties. (C) 2003 Elsevier Ltd. All rights reserved.
暂无评论