CHEF: A versatile portable text editor

CHEF is an interactive text editor for use with both printing and display terminals. Its prime field of application is computer source program editing but it has some word processing capabilities that make it useful for documentation and general text editing work. There is a comprehensive set of whole-line operations, including block moves and the insertion of text from external files, together with substring replacement and line segmentation based on a flexible pattern-matching algorithm. There is a set of one-line buffers for temporary storage of lines or command strings and complex command sequences can be built up by macro substitution. Considerable effort has been made to design a command syntax that is flexible and consistent and, at the same time, minimizes effort during the editing process. CHEF copies the user's file into an internal work-space so that the original is not disturbed until the user is satisfied with the results of the editing session. A virtual memory technique is used to provide a work-space that can be almost any desired size, with random access to any part and efficient editing operations. CHEF is written in BCPL and has already been implemented on four different machines.     

A straightforward GINO-F line-map editor

A straightforward interactive system for editing a digitized line-map is described here. The map is represented by a pair of forward-pointer linked-lists, the first containing the digitized point-strings, the second an index. Program control commands are supplied via the screen cursor, and allow control of the display, context-based identification of particular digitized points, and basic editing facilities such as point movement, insertion, omission, etc.     

A design for a text editor

This paper describes a program for editing text on the Titan (prototype ICL Atlas II) computer at Cambridge University The program is an essential part of the multiple-access system that is in operation on that computer, although it is also used non-interactively through the more conventional job-shop system. The program, EDIT, has also been implemented on an IBM 1130 and an IBM 360/65 Among the facilities provided by this program are the basic operations of text replacement, insertion and deletion Editing operations may be specified either by line number or by reference to a particular context The program is a compromise between a low cost, high-speed system and the flexible multi-function editor that is demanded by users from all departments of the University.     

Concurrent Manipulation of Expanded AVL Trees

The concurrent manipulation of an expanded AVL tree(EAVL tree)s considered in this paper.The presented system can support any number of concurrent processes which perform searching,insertion and deletion on the tree.Simulation results indicate the high performance of the system.Elaborate techniques are used to achieve such a system unavailable based on any known algorithms.Methods developed in this paper may provide new insights into other problems in the area of concurrent search structure manipulation.     

Editors: Two for the price of one

Text editors designed for interactive use on visual display units offer significant advantages, particularly in simplicity of use, but non-visual editors can provide facilities which are difficult to incorporate into a VDU editor without undermining these advantages. This paper describes a text editing system which offers both a visual and non-visual mode of use, via two user interfaces to a common set of editing primitives, and allows the user to switch freely between modes during the course of an edit. The visual editing interface consists of a set of single-key control functions which require no unusual VDU characteristics, while non-visual editing is provided by a set of context editing commands which both duplicate these control functions and offer extra facilities, particularly for repetitive editing.     

Parallel line analysis: multifunctional software for the biomedical sciences

An easy to use, interactive FORTRAN program for analyzing the results of parallel line assays is described. The program is menu driven and consists of five major components: data entry, data editing, manual analysis, manual plotting, and automatic analysis and plotting. Data can be entered from the terminal or from previously created data files. The data editing portion of the program is used to inspect and modify data and to statistically identify outliers. The manual analysis component is used to test the assumptions necessary for parallel line assays using analysis of covariance techniques and to determine potency ratios with confidence limits. The manual plotting component provides a graphic display of the data on the terminal screen or on a standard line printer. The automatic portion runs through multiple analyses without operator input. Data may be saved in a special file to expedite input at a future time.     

Learning text editing tasks from examples: a procedural approach

Reformatting blocks of semi-structured information is a common editing task that typically involves highly repetitive action sequences, but ones where exceptional cases arise constantly and must be dealt with as they arise. This paper describes a procedural programming-by-example approach to repetitive text editing which allows users to construct programs within a standard editing interface and extend them incrementally. Following a brief practice period during which they settle on an editing strategy for the task at hand, users commence editing in the normal way. Once the first block of text has been edited, they inform the learning system which constructs a generalized procedure from the actions that have been recorded. The system then attempts to apply the procedure to the next block of text, by predicting editing actions and displaying them for confirmation. If the user accepts a prediction, the action is carried out (and the program may be generalized accordingly); otherwise the user is asked to intervene and supply additional information, in effect debugging the program on the fly. A pilot implementation is described that operates in a simple interactive point-and-click editor (Macintosh MINI-EDIT), along with its performance on three sample tasks. In one case the procedure was learned correctly from the actions on the first text block, while in the others minor debugging was needed on subsequent text blocks. In each case a much smaller number of both keystrokes and mouse-clicks was required than with normal editing, without the system making any prior assumptions about the stucture of the text except for some general knowledge about lexical patterns. Although a smooth interactive interface has not yet been constructed, the results obtained serve to indicate the potential of this approach for semi-structured editing tasks.     

Learning text editing tasks from examples: a procedural approach

Abstract

Reformatting blocks of semi-structured information is a common editing task that typically involves highly repetitive action sequences, but ones where exceptional cases arise constantly and must be dealt with as they arise. This paper describes a procedural programming-by-example approach to repetitive text editing which allows users to construct programs within a standard editing interface and extend them incrementally. Following a brief practice period during which they settle on an editing strategy for the task at hand, users commence editing in the normal way. Once the first block of text has been edited, they inform the learning system which constructs a generalized procedure from the actions that have been recorded. The system then attempts to apply the procedure to the next block of text, by predicting editing actions and displaying them for confirmation. If the user accepts a prediction, the action is carried out (and the program may be generalized accordingly); otherwise the user is asked to intervene and supply additional information, in effect debugging the program on the fly. A pilot implementation is described that operates in a simple interactive point-and-click editor (Macintosh MINI-EDIT), along with its performance on three sample tasks. In one case the procedure was learned correctly from the actions on the first text block, while in the others minor debugging was needed on subsequent text blocks. In each case a much smaller number of both keystrokes and mouse-clicks was required than with normal editing, without the system making any prior assumptions about the stucture of the text except for some general knowledge about lexical patterns. Although a smooth interactive interface has not yet been constructed, the results obtained serve to indicate the potential of this approach for semi-structured editing tasks.     

Random binary search tree with equal elements

We consider random binary search trees when the input consists of a multiset, i.e. a set with multiple occurrences of equal elements, and prove that the randomized insertion and deletion algorithms given by Martínez and Roura (1998) [4] produce random search trees regardless of multiplicities; even if all the elements are equal during the tree updates, a search tree will maintain its randomness. Thus, equal elements do not degenerate a random search tree and they need not to be handled in any special way. We consider also stability of a search tree with respect to its inorder traversal and prove that the algorithms used produce stable trees. This implies an implicit indexing of equal elements giving another proof that multiplicities do not pose problems when maintaining random binary search trees.     

The architecture of TrueViz: a groundTRUth/metadata editing and VIsualiZing ToolKit

Tools for visualizing and creating groundtruth and metadata are crucial for document image analysis research. In this paper we describe TrueViz (TRUEVIZ User's Manual, August 2000; Proceedings of the SPIE Conference on Document Recognition and Retrieval, San Jose, CA, 2001, pp. 1-12), which is a tool for visualizing and editing groundtruth/metadata. We first describe the groundtruthing task and the requirements for any interactive groundtruthing tool. Next we describe the system design of TrueViz and discuss how a user can use it to create groundtruth. TrueViz is implemented in the Java programming language and works on various platforms including Windows and Unix. TrueViz reads and stores groundtruth/metadata in XML format, and reads a corresponding image stored in TIFF image file format. Multilingual text editing, display, and search modules based on the Unicode representation for text are also provided. This software is being made available free of charge to researchers.     

Kernel for a responsive and graphical user interface

A kernel that facilitates building graphical and responsive user interfaces for application programs has been constructed. A display tree representing the structure of the 2-dimen-sional screen image is defined. Each node contains an input procedure, an output procedure and links to their arguments. This display tree is the only interface between the user and the application program. For viewing purposes, the display tree can be ‘painted’ onto any viewport. The output routines attached to the nodes are invoked to produce the image. The arguments found in the ancestor nodes can be thought of as shared graphical attributes. Upon each input event, the display tree is traversed to determine which node is touched by the cursor. The input procedure attached to that node is then invoked. The use of a library with standard attached procedures (e.g. for screen editing and error checking) leads to a system that behaves uniformly across applications. Some demonstration programs, based on this kernel, show the very dynamic screen communication that can be achieved.     

A visual debugger for pure Prolog

This work involves the design and coding of an interpreter for pure Prolog and building a visual debugger for it. Most of the available Prolog interpreters contain some tracing facilities. They do not incorporate, however, a comprehensive visual debugger. The interpreter performs the operations of parsing, unification, resolution, and search in a state-space representation of the Prolog program. The visual debugger incorporates the graphical visualization and the manipulation of the SLD resolution tree. The user visualizes the execution of a pure Prolog program and interacts with the program inside a windowing environment. The program execution may be viewed without interruption or the execution can be stopped at any moment in time. At this point the “snapshot” can be scrutinized with the help of break-points and data displays. This software aims itself to those who wish to observe the actual process of predicate unification, substitution, resolution and goal matching in a Prolog program and to visually interact with the interpreter using a highly friendly and pleasing user interface. An advanced feature, referred to as debugging on the tree, provides the user with the ability to insert break-points directly on the SLD tree, to choose the path of execution, and change the search mode. The resultant search algorithm can be a mixture of depth-first and breadth-first search, avoiding infinite search paths.     

多分辨率BSP树的生成及应用

CAD和科学可视化应用要求能够让用户对复杂场景进行交互式显示或者处理,因此,多细节层次技术被广泛应用于图形系统中以提高处理效率.通过构造一种新的BSP(binaryspacepartitioningtree)树形式来加速多细节层次模型的绘制,这种技术已成功地应用于所开发的多分辨率模型编辑系统.同时,详细描述了新的BSP树结构的构造和绘制过程.     

Interactive computer methods for design optimization

Two interactive methods for design optimization are discussed in this paper. The first method is implemented by the computer program GDOPT and is an essentially manual search procedure based on graphical searches of the design space within user-defined planes. In contrast, the computer program ADOPT consists of the more effective nonlinear programming techniques available and the search is mostly under computer control. The user observes progress on a graphical display and is able to modify the search procedure as desired. These two interactive methods make an extensive use of computer graphics to display search results in the form of graphs, contour plots, sensitivity curves, and search trajectories. The designer interacts with the programs through these displays and is an active participant in the decision making process. It is believed that this integrated approach to design optimization can result in an enhanced understanding of the design problem and an effective convergence to the optimum design. An example is presented which illustrates the effectiveness of this interactive technique.     

A fast DNA sequence handling program for Apple II computer in BASIC and 6502 assembler

A fast general purpose DNA handling program has been developed in BASIC and machine language. The program runs on the Apple II plus or on the Apple IIe microcomputer, without additional hardware except for disk drives and printer. The program allows file insertion and editing, translation into protein sequence, reverse translation, search for small strings and restriction enzyme sites. The homology may be shown either as a comparison of two sequences or through a matrix on screen. Two additional features are: (i) drawing restriction site maps on the printer; and (ii) simulating a gel electrophoresis of restriction fragments both on screen and on paper. All the operations are very fast. The more common tasks are carried out almost instantly; only more complex routines, like finding homology between large sequences or searching and sorting all the restriction sites in a long sequence require longer, but still quite acceptable, times (generally under 30 s).     

Some methods of controlling the tree search in chess programs

This paper describes several tree search methods that have been implemented in our chess playing program (KAISSA) and some perspectives on this domain. The most general and most flexible method of program organization is exhaustive search with cut-offs. Therefore our program is based on searching exhaustively to a given depth, and permitting wide usage of cut-offs at any level of the search tree. Besides the program includes analysis of all exchanges up to their end. Experience with earlier programs has shown that disregard of exchanges would lead to gross errors.     

The tree system as a teaching aid in statistics,modeling and business courses

The TREE (Toronto Research and Education Environment) system is an interactive computer system developed at the Faculty of Management Studies at the University of Toronto as a teaching and research aid for M.B.A. students. The system makes the computer available with a small amount of learning time to the students in a wide variety of courses. The user uses simple commands to select modules from a model bank which provides facilities for statistical analysis, econometrics, forecasting, modeling, financial analysis and matrix algebra. All of these operations can be performed on data stored in the form of an array. Extensive data checks and on-line helps are provided.     

An interactive computer graphics approach to the design of marching band routines

The availability of inexpensive minicomputers and low cost digital/analog conversion equipment enables one to use interactive graphics in situations where such techniques were previously infeasible. The University of Tulsa is presently developing an interactive graphics package entitled BANDMARCH to assist the choreography of marching band drills. The graphics hardward consist of a 32K Interdata Model 70 minicomputer, a 5MB Diablo Disc system, a Tektronix 603 monitor with 256 × 256 point display provided by a pair of Detel 8 bit D/A converters. The program enables a band director who is most likely not computer oriented to prepare a routine in an existing language (About Face, Left Flank) and view the result of his ‘design’ in real time. The obvious interactive features of editing, cataloguing and accessing standard functions must be provided in a way that can be easily understood.

T.U.'s BANDMARCH (not an acromym) provides such features. Common data structures in a relatively novel environment are a demonstration of the soundness of these techniques to an interactive graphics situation.