Physical Sciences and Mathematics Commons^™

Automatic Rational Parameterization Of Curves And Surfaces I: Conics And Conicoids, Shreeram S. Abhyankar, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Some Results On V-Ary Asymmetric Tries, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Show And Tell User's Manual, Peter Mclain, Takayuki Dan Kimura

All Computer Science and Engineering Research

The purpose of this report is to introduce essential features of the Show and Tell Language system to those computer users who are already familiar with some high-level programming language such as FORTRAN, BASIC or PASCAL. This manual is not intended for school children. Some familiarity with the Macintosh user interface and the MacPaint application program is assumed. It is also assumed that the Show and Tell application program disk and the Sample program are available to the reader. The basic programming concepts in Show and Tell are introduced in Chapter Three. The reader may find it easer to start …

Early Cypress Performance Experiments, Douglas E. Comer, Gregory H. Smith

Department of Computer Science Technical Reports

No abstract provided.

A Systolic Parsing Algorithm For A Visual Programming Language, Adam W. Bojanczyk, Takayuki Dan Kimura

All Computer Science and Engineering Research

In this paper we consider a problem of parsing a two-dimensional visual programming language Show and Tell on a two-dimensional array of processors. A program in Show and Tell is a bit-mapped, two-dimensional pattern satisfying a certain set of grammatical rules. The pattern consists of partially ordered set of rectilinear boxes and arrows distributed over the space of nxn pixel area. The corresponding directed graph, the box graph, where boxes are nodes and arrows are directed edges, may not have a cycle in a Show and Tell program. The cycle detection is the most computationally intensive stage of the parsing …

The Design Of An Adaptable Distributed System, Bharat Bhargava, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

Sight - A Tool For Building Multi-Media Structured-Document Interactive Editing And Formatting Applications, Robert F. Gordon Ph.D., George B. Leeman Jr, Christian L. Cesar, Mark A. Martin

Faculty Works: MCS (1984-2023)

SIGHT is a tool for building applications that edit and format multi-media structured documents. The media supported include text, line graphics, handwriting, images and audio. These information media are maintained in a single integrated hierarchical database. The document architecture models documents as trees in which nodes can be shared, i.e., as directed acyclic graphs. For each document there is a logical (or abstract) represention tree and one or more physical (or layout) representation trees. A physical representation is the result of applying the formatter to a logical representation. Both trees are separate but share document content data. The physical representation …

Two-Layer Channel Routing With Vertical Unit-Length Overlap, Shaodi Gao, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

Instability Conditions Arising In Analysis Of Some Multiaccess Protocols, Wojciech Szpankowski, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

Lexical Analysis Using Table Look-Up, Brian Keith Smith, Dominic Soda, George Winston Zobrist

Engineering Management and Systems Engineering Faculty Research & Creative Works

No abstract provided.

Computing The Largest Empty Rectangle, B. Chazelle, R. L. Drysdale, D. T. Lee

Dartmouth Scholarship

We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel to those of the original rectangle which contains none of the given points. If the rectangle is a piece of fabric or sheet metal and the points are flaws, this problem is finding the largest-area rectangular piece which can be salvaged. A previously known result [13] takes $O(N^2 )$ worst-case and $O(N\log ^2 N)$ expected time. This paper presents an $O(N\log ^3 N)$ time, $O(N\log N)$ space algorithm to solve this problem. It uses a divide-and-conquer approach similar to the ones …

Performance Evaluation Modeling For Distributed Computing, Catherine E. Houstis, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

An Architecture For A Local Network Providing Multiple Supercomputer Access, Dan Cristian Marinescu, Vernon J. Rego, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

The Cypress Multifunction Packet Switch, Douglas E. Comer, Thomas Narten

Department of Computer Science Technical Reports

No abstract provided.

Cypress Network Project Status Report, Douglas E. Comer, Thomas Narten

Department of Computer Science Technical Reports

No abstract provided.

The Ellpack Performance Evaluation System, John P. Bonomo, Wayne R. Dyksen, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Analysis Of A Class Of Real-Time Control Systems, Dan Cristian Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Scheduling Protocols Based Upon Limited Contention Multiple Access, Dan Cristian Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Evaluating Storage Management Schemes For Block Structured Languages, Thomas P. Murtagh

Department of Computer Science Technical Reports

No abstract provided.

Limitations To Algorithm Solvability: Galois Methods And Models Of Computation, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Principles Of Information Systems Analysis And Design, Harlan D. Mills, Richard C. Linger, Alan R. Hevner

The Harlan D. Mills Collection

No abstract provided.

An Exact Analysis For Efficient Computation Of Random-Pattern Testability In Combinational Circuits, Sharad C. Seth, Bhargab B. Bhattacharya, Vishwani Agrawal

CSE Conference and Workshop Papers

Experimental evidence shows that low testability in a typical circuit is much more likely due to poor observability than poor controllability. Thus, from theoretical and practical standpoints, it is important to develop an accurate model for observability computation. One such model, in terms of supergates, is proposed in the first part of this paper thus complimenting our earlier work. It is now possible to obtain exact random-pattern testability for each line in a circuit.

The second part of the paper analyzes the supegate structure of a circuit from a graph theoretic viewpoint. Finding a supergate is related to determining the …

Stack Package Implementing Tasks And Coroutines For Tml Pascal On The Macintosh, Mark Sherman

Computer Science Technical Reports

This disk contains the necessary TML Pascal and MDS Assembler files for implementing tasking and coroutines in TML Pascal Programs. Two example programs and brief documentation are provided. MDS format disk.

Music Editor, Ed Grosz

Computer Science Technical Reports

This disk contains a simple music editor that creates resources that can be used directly by the Macintosh Sound Driver. The MFS formatted disk contains both the runnable program and the Lisa Object Pascal/MacApp Sources.

A Collection Of Mds Example Programs, Joe Bergin, Robert L. Scot Drysdale, Jerry Keough, Larry Gallagher, Vivian Sewelson, Mark Sherman

Computer Science Technical Reports

This MFS formatted disk contains a collection of example programs written for teaching machine architecture concepts using the Macintosh Development System. Sample programs illustrate how instructions can be treated as data, computer arithmetic, looping features, interrupt handling, coroutines, recursive subprograms and stack frames, traps and direct manipulation of the screen. In addition, a supervisor program is provided that implements basic, line-oriented input and output facilities for the 68000 assembly language programs on the Macintosh.

Digital Logic Simulator, John W. Scott

Computer Science Technical Reports

Logic is a Macintosh program that simulates discrete, digital logic circuits. The two disks contain an executable version of the program, MacApp sources and brief documentation (which is also available separately in hardcopy).

Instructions For Using Logic, John W. Scott

Computer Science Technical Reports

This document provides instructions on the use of "Logic", a digital logic simulator for the Macintosh written for Dartmouth students in the Machine Architecture and Digital Electronics courses.

Uses Of Generics In Ada, Mark Sherman

Computer Science Technical Reports

This paper discusses how Ada generic procedures and packages can be used in novel ways to provide general initialization of records, expressions using discriminants, record field hiding and explicit control of parameter binding.

Algorithms For Iterative Array Multiplication, Shinji Nakamura

Computer Science Technical Reports

Algorithms for the parallel multiplication of two n bit binary numbers by an iterative array of logic cells are discussed. The regular interconnection structures of the multiplier array cell elements, which are ideal for VLSI implementation, are described. The speed and hardware complexity of two new iterative array algorithms, both of which require n cell delays for one n by n bit multiplication, are compared with a straight-forward iterative array algorithm having a 2n cell delay and its higher radix version having an n cell delay.

Parallel Accessible Memory, Shinji Nakamura

Computer Science Technical Reports

A new design of a memory device which allows simultaneous access to more than one location is proposed. The unique feature of this multiple accessibility of the memory is realized by applying a binomial concentrator, a type of sparse crossbar interconnection network, to content-addressable memory. The organization of the memory system and the concentration network structure as well as the network characteristics are described along with a distributive control algorithm. Applications of the memory system to parallel processing environments are also included.