M. Brown. Algorithm Animation. MIT Press, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... based on spatial relations, and a novel presentation interface that supports reverse execution and dynamic mark up and modification 1 Introduction Algorithm visualization (AV) software supports the construction and interactive exploration of visual representations of computer algorithms, e.g. [1 5]. Traditionally, computer science instructors have used the software to construct visualizations that are later used either as visual aids in lectures, e.g. 6] or as the basis for interactive labs, e.g. 3] More recently, computer science educators have advocated using AV software as the ....

....cutout touching football for 1 sec flash cutout right of cutout touching football for 1 sec We can now proceed with our presentation without having to recompile the script, and without even having to start the script over from the beginning. 7 Related work Beginning with Brown s BALSA system [1], a legacy of interactive AV systems have been developed to help teach and learn algorithms, e.g. 2 5] SALSA and ALVIS differ from these systems in two fundamental ways. First, the visualization construction technique pioneered by ALVIS and SALSA differs from those supported by existing ....

[Article contains additional citation context not shown here]

M. H. Brown, Algorithm animation. Cambridge, MA: The MIT Press, 1988.

....that, by making these building blocks more concrete, graphical representations would help one to better understand how they work. Visualization software emerged in the late 1980 s for the purpose of creating and interactively exploring graphical representations of computer science concepts [8, 54]. Our recent surveys of computer science educators suggest a widespread belief that visualization technology positively impacts learning. However, experimental studies designed to substantiate the educational effectiveness of such visualization technology simply do not bear this out [28] On top ....

....Section 6 concludes by discussing the future of this framework: studies we are planning, and opportunities for interested computer science educators to collaborate with us. 2 Background Interactive visualization has been employed in computer science education since the 1980s (see, for example, [8, 10]) During that time, a set of best practices has evolved through instructors experiences with the technology. We summarize the most important of these in Section 2.1. To determine current practice and instructors attitudes toward the efficacy and impact of these practices, we recently ....

[Article contains additional citation context not shown here]

Brown, M. H. Algorithm Animation. MIT Press, Cambridge, Massachussets, 1988.

....is only a small number of fundamental work in the field. Marc H. Brown developed several algorithm animation systems, like BALSA, ZEUS, CAT, etc. These systems are frameworks, in which algorithms can be animated by annotations ( interesting events ) and by definitions of graphical views ( 2] [3], 4] 5] and [6] John T. Stasko conceived the path transition paradigm and implemented it in the systems TANGO, XTANGO, SAMBA, etc. see [18] 19] and [20] Also these systems use the concept of interesting events . All newer versions of the above systems are complete environments, which ....

M. H. Brown. Algorithm Animation. MIT Press, 1987.

....Interviews with students and an informal, unpublished experiment make clear that the film communicates both the substance of the algorithms and the concept of their relative efficiency. The film was also instrumental in stimulating further work in algorithm animation, most notably by Marc Brown [4], who together with Sorting Out Sorting has inspired much of the work in the field. The project also taught us many lessons about algorithm animation, including: Significant insights into algorithm behavior can be gained only by viewing the data if the illustrations and the timing are ....

Brown, M.H. Algorithm Animation. MIT Press, Cambridge, Mass., 1988.

....for about twenty years. A very influential piece of work in this field is Sorting out Sorting [Baecker and Sherman, 1981] which aims to visualise sorting algorithms for educational purposes. More general purpose vi sualisation frameworks have been introduced over the years (see, for example, [Brown, 1988] and [Stasko, 1990] 1.4 GA visualisation literature The field of visualising genetic algorithms is a bit younger, and has recently been summarised in [Collins, 1998] Collins distinguishes seven characteristics that are potentially useful for understanding a GA s search behaviour. Five of ....

M. Brown. Algorithm Animation. MIT Press, 1988.

....visualization usually shows a partial aspect of a program, so it provides a more abstract view than raw source code. Visualizations and animations do not only provide nice features, but they are also useful for programming tasks, for instance for debugging. Many animation systems, such as Balsa [1], XTango [8] or GAIGS [5] have been or are being used in education (e.g. see the reviews in [6, 10] However, the main pragmatic problem today for using visualizations or animations is the technical difficulty of producing them. Programs are typically annotated to produce the animation; ....

....n : l) For readability, the expression e 1 : e 2 : e n : nil is represented by the list notation [e 1 ,e 2 , e n ] This definition can be used to evaluate functional expressions involving the insertion function. A visualization of a step by step evaluation follows: insert (4, [1, 2, 5, 9]) list (num) if 4 1 then [4, 1, 2, 5, 9] if false then [4, 1, 2, 5, 9] 1 : insert (4, 2, 5, 9] then [4, 2, 5, 9] 1, 2, 4, 5, 9] list (num) We can summarize the facilities that WinHIPE offers: Graphical user interface. It includes the typical components in ....

[Article contains additional citation context not shown here]

Brown, M., Algorithm Animation, MIT Press, 1987

....MAVIS, that realizes the model, and demonstrates its use on case studies. Keywords: Algorithm visualization, algorithm animation, distance learning, collaboration. 1 Introduction Algorithm visualization refers to the use of graphics and motion to explain algorithmic ideas and data structures [3, 4, 5, 6, 7, 11, 15, 16]. It has a great potential to assist in the design of algorithms, in the debug process, and for teaching algorithms to students and colleagues. Distance learning refers to a learning process in which the instructor resides in a different geographical location than the students, thus communication ....

....the benefit of flexibility. New types of messages can be easily added. Moreover, external systems can be connected by defining special channels for them, while the system automatically handles the messages. Our algorithm visualization model is based on the classical model of interesting events [3], indicating algorithm events that are of interest when the program runs. An interesting event can be either simple or compound. A simple event represents a change made to a single object. A compound event is composed of several simple events, which are animated concurrently. The main deviation of ....

M.H. Brown. Algorithm animation. MIT Press, 1988.

....visualization, there has been significant work in visualizing data, program execution and software. Data visualization is, perhaps, the most active field where scientific and engineering data are viewed from multiple perspectives, in 2D and 3D, using a wide variety of icons and color range. Brown [38] discusses methods for visualizing the execution of programs in terms of input output. Shu [39] specifies a dichotomy where we have visual environments, referring to program and data visualization, versus visual language, referring to the actual creation of software using visual methods. Early ....

Marc H. Brown. Algorithm Animation. MIT Press, 1987.

....provides an ideal foundation for what we see as the algorithms classroom of the future: the interactive algorithms studio. 3 1. Introduction Algorithm visualization (AV) software supports the construction and interactive exploration of visual representations of computer algorithms, e.g. [1 5]. Traditionally, computer science instructors have used the software to construct visualizations that are later used either as visual aids in lectures, e.g. 6] or as the basis for interactive labs, e.g. 3] Despite the enthusiasm and high expectations of AV software developers, a review of 21 ....

....their target al..gorithms in C . Next, they wrote general animator classes whose methods were capable of drawing and updating the visualization display (using Samba routines) for any input data set. Third, they annotated algorithm source code with these methods at points of interesting events [1]. For example, in a sorting algorithm, points at which data items are compared and exchanged might be considered interesting. Finally, they engaged in an iterative process of refining and debugging their visualizations. This process involved (a) compiling and executing their algorithms; b) noting ....

[Article contains additional citation context not shown here]

M. H. Brown (1988) Algorithm animation The MIT Press, Cambridge, MA.

....see example in Fig. 6. These annotations can be compared to in2 In the WAM stack frames are called environments and a special optimization called environment trimming decreases the number of stack cells of an environment during its live span. teresting events in some algorithm animation systems [3]. A very general and useful annotation is a runtime comment, see example in Fig. 7. It produces a textual output which is shown in a console window. Using runtime comments the output in the console window can be used as a trace of the execution of the abstract machine, see Fig. 8. 6. The ....

M.H. Brown, Algorithm Animation, MIT Press, Cambridge, MA, 1987.

....INTRODUCTION Algorithm visualization software graphically depicts how computer algorithms work. Traditionally, computer science instructors have used the software to construct visualizations that are later used either as visual aids in lectures, or as the basis for interactive labs (e.g. [1]) More recently, some computer science educators have advocated using algorithm visualization software as the basis for visualization assignments, in which students construct their own visualizations of the algorithms under study [5] Inspired by social learning theory [4] we have explored a ....

Brown, M.H. Algorithm animation. Cambridge: The MIT Press, 1988.

....algorithms work. Since its advent in the late 1970s, AV technology has evolved from batch oriented software that enable instructors to construct animated films [1] to highly interactive systems that enable students to explore dynamically configurable animations of algorithms on their own (e.g. [2, 3]) to interactive programming environments that enable students to quickly construct their own visualizations (e.g. 4, 5] Over the past two decades, this evolution of software has endeavored to enhance computer science education in a variety of capacities. For example, AV software has been ....

....their own visualizations (e.g. 4, 5] Over the past two decades, this evolution of software has endeavored to enhance computer science education in a variety of capacities. For example, AV software has been used . to help instructors illustrate algorithm operations in a lecture (e.g. [2]) to help students as they study and learn about fundamental algorithms in a computer science course(e.g. 6] to help instructors track down bugs in students linked list programs during office hours (e.g. 7] and . to help students learn about the basic operations of an abstract ....

[Article contains additional citation context not shown here]

M. H. Brown (1988) Algorithm animation The MIT Press, Cambridge, MA.

....and dynamic mark up and modification. 1. Introduction Computer science instructors have traditionally used algorithm visualization (AV) software to construct algorithm visualizations (AVs) that are later used either as visual aids in lectures, or as the basis for interactive labs, e.g. [1]. Building on [2] and inspired by social constructivist learning theory [3] we have explored a teaching approach in which students use simple art supplies to construct their own AVs, and then present those AVs to their instructor and peers for feedback and discussion [4,5] In this paper, we ....

M. H. Brown, Algorithm Animation. Cambridge, MA: The MIT Press, 1988.

....more concrete, graphical representations would help one to better understand how they work. This intuition inspired the development of algorithm visualization (AV) software, which supports the creation and interactive exploration of graphical representations of computer algorithms, e.g. [2, 13, 16]. Despite the enthusiasm and high expectations of AV software developers, a review of ten experiments ( 4] 2 and 3; 9] 11] ch. 4 9; 15] fails to substantiate the software s pedagogical benefits. Indeed, only six of those experiments ( 4] 2 and 3; 9] 11] ch. 6, 7, 9) showed that some ....

....may learn algorithms just as well as students who interact with visualizations developed by an instructor using conventional high fidelity AV technology. Additionally, the results of this experiment have practical implications for the design of AV technology. Most extant AV systems, e.g. [2, 13, 16], support experts in the construction of high fidelity visualizations, which work for general input, and which have the polished look of textbook figures. This experiment motivates the design of a different kind of AV technology: one that enables nonexperts to rapidly construct low fidelity ....

Brown, M. H. Algorithm animation. Cambridge, MA: The MIT Press, 1988.

....the code is not transformed, it is augmented) and code ignorance allowance: the person who is in charge of realizing the animation has to know the source code quite well in order to identify all the interesting points. A limited list of well known systems based on interesting events include Balsa [3], Zeus [5] Tango [17] XTango [18] Polka [19] CAT[6] ANIM[2] Polka. In this paper we will consider examples of visualizations based on interesting events realized with Polka. Polka is a system for visualizing programs written in C . The system has two main foci: allowing designers to create ....

M.H. Brown. Algorithm Animation. MIT Press, Cambridge, MA, 1988.

....example that yields sharp clues to the utility of heuristics for improving the practical performances of an algorithm for solving the maximum flow problem. Dozens of algorithm animation systems have been developed in the last two decades. The area was pioneered in the 80 s by the systems Balsa [6] and Zeus [7] Concerning other tools, we mention Tango [30] Polka [31] UWPI [18] ZStep95 [32] TPM [15] Pavane [28] Leonardo [12] Eliot [22] and Catai [8] Computing Environments. Among others, we cite LINK, a software system developed at the Center for Discrete Mathematics and Theoretical ....

M.H. Brown. Algorithm Animation. MIT Press, Cambridge, MA, 1988.

....manager of interesting events, like the entry into a function or the access of a particular data structure. The system was successfully used as a teaching aid in Computer Science classes at Brown for a number of years, until it was replaced by later versions. In 1988, Brown released Balsa II [4][5] which provided additional scripting facilities. In addition, it was in color and allowed the use of sound in addition to visual representations. 2.1.2 Zeus Zeus, also developed by Brown, is another descendant of BALSA [6] 7] Released as a prototype in 1991, Zeus provides the user of the ....

Brown, M. H. (1988a). Algorithm Animation. New York: MIT Press.

No context found.

M. Brown. Algorithm Animation. MIT Press, 1988.

No context found.

M.H. Brown. Algorithm Animation. MIT Press, Cambridge, MA, 1988.

No context found.

M. H. Brown, Algorithm Animation. MIT Press, 1987.

No context found.

M.H. Brown. Algorithm Animation. MIT Press, Cambridge, MA, 1988.

No context found.

Marc H. Brown. Algorithm Animation. PhD thesis, Brown University, 1987.

No context found.

M.H. Brown. Algorithm Animation. MIT Press, Cambridge, MA, 1988.

No context found.

Marc H. Brown, `Algorithm animation', Ph.D. Dissertation, Brown University, April 1987; published as Report CS-87-05.

No context found.

Brown M.H. (1988). Algorithm Animation. MIT Press.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC