Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

Dartmouth College

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1081 - 1102 of 1102

Full-Text Articles in Computer Sciences

A Practical, Distributed Environment For Macintosh Software Development, Mark Sherman, Ann Marks, Rob Collins, Heather Anderson, Jerry Godes, Denis Devlin, Leonid Spector, Vivian Sewelson Jan 1986

A Practical, Distributed Environment For Macintosh Software Development, Mark Sherman, Ann Marks, Rob Collins, Heather Anderson, Jerry Godes, Denis Devlin, Leonid Spector, Vivian Sewelson

Computer Science Technical Reports

We describe a development environment we created for prototyping software for the Macintosh. The programs are developed and executed on a large time-shared computer but can use the full facilities of the Macintosh. By using this system, we combine the advantages of the large system, such as large amounts of disk storage and automatic file backups, with the advantages of the Macintosh, such as advanced graphics, mouse control and sound synthesis. We also describe several projects that used the distributed development system. We conclude with a description of our future plans for this environment.

Go to article

A Distributed Strategy For Resource Allocation, Ann Kratzer Jan 1986

A Distributed Strategy For Resource Allocation, Ann Kratzer

Computer Science Technical Reports

In this paper, we present a decentralized algorithm for determining how resources should be allocated to sites. This algorithm is general in the sense that it can be used for allocating different kinds of resources. This algorithm can be applied either statically, used on a quiescent system, or used dynamically as the system runs. Throughout, we consider only systems in which a resource has a fixed cost associated with it regardless of where it may be located (i.e. the system is homogeneous).

Go to article

Task Queues: A General Model For The Implementation Of Communications Protocols, Ann Kratzer Jan 1986

Task Queues: A General Model For The Implementation Of Communications Protocols, Ann Kratzer

Computer Science Technical Reports

When any computer communications network is built, its communications protocol must always be implemented. The protocol is implementetd on the switching nodes of the network. The node software must respond in real time to events generated external to the switching node. Thus, the software running on a switching node constitutes a concurrent program; this complicates the design, implementation and testing of the switching node software. The task queue model presented in this paper defines a structure for this software that facilitates the design, implementation and testing of communications protocols.

Go to article

Havoc V.85 Software, David Cohn, Stephen Madancy Jan 1986

Havoc V.85 Software, David Cohn, Stephen Madancy

Computer Science Technical Reports

This disk contains alpha release 85 of the HAVOC system, with examples. It is written in C and 68000 assembler.

Go to article

View 3: A Programming Environment For Distributed Programming, Ann Kratzer Jan 1986

View 3: A Programming Environment For Distributed Programming, Ann Kratzer

Computer Science Technical Reports

View 3 is an experimental programming environment to support the development and use of distributed programs. It builds upon three major concepts. First, distributed programs and distributed processes are basic objects. Second, the port mechanism allows a process to exchange information with another process, a file or an I/O device without concern for the type of the object on the other end of the port. Third, test and use of distributed programs are facilitated by the user interface program screen format that allows the user to control both the format and contents of the physical terminal.

Go to article

Digital Logic Simulator, John W. Scott Jan 1986

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).

Go to article

Parallel Accessible Memory, Shinji Nakamura Jan 1986

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.

Go to article

Binary Trees (V. 2.1 -- September 25, 1985), John Glenn Jan 1986

Binary Trees (V. 2.1 -- September 25, 1985), John Glenn

Computer Science Technical Reports

Binary Tree is a program that uses animation to illustrate insertion, deletion and searching of nodes in a binary search tree. Pre-order, in-order, and post-order tree walks are supported. Binary Tree can also perform a recursive descent parse of arithmetic expressions and show the resulting abstract syntax tree. Lisa Pascal source and application available on a single-sided, MFS format microdisk.

Go to article

Using Low-Cost Workstations To Investigate Computer Networks And Distributed Systems, Mark Sherman, Ann Marks Jan 1986

Using Low-Cost Workstations To Investigate Computer Networks And Distributed Systems, Mark Sherman, Ann Marks

Computer Science Technical Reports

A quality education in contemporary computer science requires that students gain experience with realistic systems. Many efforts at bringing empirical computer science to undergraduates focus on rather old technologies, for example, building a compiler or simulating a disk scheduler. Although efforts are being made to use some newer technologies, the efforts are concentrating on teaching traditional material in a new medium. However, the medium itself -- networked workstations in a server environment -- is worthy of exploration by undergraduate students in a laboratory setting. At Dartmouth, we developed a Computer Network Laboratory to let students experiment with computer networks, protocols …

Go to article

A Network Package For The Macintosh Using The Dod Internet Protocols, Mark Sherman Jan 1986

A Network Package For The Macintosh Using The Dod Internet Protocols, Mark Sherman

Computer Science Technical Reports

This memo describes the design, implementation and use of the MacIP libraries and programs for running DoD Internet Protocols on the Macintosh over Apple Talk. It is preliminary documentation and out of date, but it is all that exists.

Go to article

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

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.

Go to article

An Algorithm For Resource Allocation Requiring Low Overhead Communication, Ann Marks Jan 1986

An Algorithm For Resource Allocation Requiring Low Overhead Communication, Ann Marks

Computer Science Technical Reports

A heuristic algorithm for allocating resource units to sites in a distributed system is presented. Starting with a given allocation of sites, the algorithm performs a series of optimizations involving pairs of sites in an attempt to improve the worst pair-wise imbalance present in the system; termination occurs when no further improvement is possible. After outlining the general form of the algorithm, which effectively defines an entire family of algorithms, we present theoretical results that speak to the performance of the algorithm as measured in the number of optimizations that can be done, the amount of control communication required and …

Go to article

Finding Largest Empty Circles With Location Constraints, L Paul Chew, Robert L. Scot Drysdale Jan 1986

Finding Largest Empty Circles With Location Constraints, L Paul Chew, Robert L. Scot Drysdale

Computer Science Technical Reports

Let S be a set of n points in the plane and let CH(S) represent the convex hull of S. The Largest Empty Circle (LEC) problem is the problem of finding the largest circle centered with CH(S) such that no point of S lies within the circle. Shamos and Hoey (SH75) outlined an algorithm for solving this problem in time O(n log n) by first computing the Voronoi diagram, V(S), in time O(n log n), then using V(S) and CH(S) to compute the largest empty circle in time O(n). In a recent paper [Tou83], Toussaint pointed out some problems with …

Go to article

Producing Software Using Tools In A Workstation Environment, Mark Sherman, Robert L. Scot Drysdale Jan 1986

Producing Software Using Tools In A Workstation Environment, Mark Sherman, Robert L. Scot Drysdale

Computer Science Technical Reports

We discuss how we taught students to build and use translation, interpretive, editing and monitoring tools in an undergraduate software engineering course. Students used the tools on low-cost workstations (Macintoshes) to build large, group projects. The students' projects used all available features of workstation environments, including graphics, windows, fonts, mice, networks, and sound generators. We found that 1) the use of tools increased student productivity, 2) a shift in a data structure and algorithm topics is needed to cover material relevant for workstation environments, 3) new topics in system design are required for a workstation environment, 4) traditional material can …

Go to article

The Pairwise Intersection Problem For Monotone Polygons, David B. Levine Jan 1986

The Pairwise Intersection Problem For Monotone Polygons, David B. Levine

Computer Science Technical Reports

Geometric intersection problems arise in a number of areas of computer science including graphics and VLSI design rule checking. Previous work has concentrated on solving the pairwise intersection problem for line segments and iso-oriented rectangles. This thesis extends that work by presenting efficient algorithms to solve the pairwise intersection problem for monotone polygons. For general segments, the problem has been solved in O(N+I)*logN) time using a sweeping line technique, where N is the number of segments and I is the number of intersections reported. We combine this technique with approaches taken to solve the iso-oriented rectangle problem to yield an …

Go to article

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

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.

Go to article

Macip Sources And Applications, Mark Sherman, Tim Maroney Jan 1986

Macip Sources And Applications, Mark Sherman, Tim Maroney

Computer Science Technical Reports

The MacIP set consists of three disks, all single-sided, MFS formatted. Two disks contain the Lisa Pascal/Lisa Assembler sources for the network libraries and application programs; the third disk contains the runnable applications along with an AppleTalk configured system. The current version by Tim Maroney fixes all reported bugs mentioned in the MacIP Technical Report and includes the TCP library and Telnet program.

Go to article

Bruce: A Graphics System With Hidden Line And Hidden Surface Algorithms, Keith Vetter, Christopher Roche May 1985

Bruce: A Graphics System With Hidden Line And Hidden Surface Algorithms, Keith Vetter, Christopher Roche

Computer Science Technical Reports

Accurately representing the physical world by computer is a topic which has direct benefits to fields like chemistry and architecture, and is a source of much research in computer science. This paper examines the steps necessary to develop and implement a graphical system that will allow for the modeling of physical world objects. In particular, this is a description of BRUCE: a graphical system that will describe a world of three dimensional polyhedra, implementing algorithms for hidden line and hidden surface removal. This paper also deals with the problems incurred along the way and suggestions for further improvement of BRUCE.

Go to article

Creating Havoc: Havoc Development Program, David Cohn, Stephen Madancy Jan 1985

Creating Havoc: Havoc Development Program, David Cohn, Stephen Madancy

Dartmouth College Undergraduate Theses

One area where use of the computer is essential is in the modern scientific laboratory. High speed computation, data storage and data analysis enable scientists to perform experiments that would otherwise be impractical. A problem inherent to the effective use of special purpose laboratory computers, however, is the fact that this equipment has generally been developed for highly specific uses, and has either tried to cope with existing high-level languages or has abandoned the attempt and required the user to program in a low-level assembly or machine language. Our idea was to design, develop and implement a programming language that …

Go to article

Dartmouth-Smalltalk: An Exercise In Implementation, Joon Sup Lee Jun 1984

Dartmouth-Smalltalk: An Exercise In Implementation, Joon Sup Lee

Computer Science Technical Reports

This report discusses a preliminary implementation of the Smalltalk-80 virtual machine for Vax/Unix.

Go to article

An Image Processing Software Package For The Laser Scanning Phase Modulation Microscope, William J. Murray Jun 1984

An Image Processing Software Package For The Laser Scanning Phase Modulation Microscope, William J. Murray

Computer Science Technical Reports

This thesis documents the most recent effort to develop a user-friendly image processing software package for the Laser Scanning Phase Modulation Microscope (LSPMM). The LSPMM is composed of three integrated subsystems, the Laser Scanning (LS) system, the Phase Modulation (PM) system, and Digital Image Acquisition (DIA) system. Under the control of the image processing software, the DIA system can receive and store the digital image data, display the image on a monochrome monitor, and process the image to provide the microscopist with quantitative information regarding the image. The implementation of this image processing software package required the specification of a …

Go to article

View-3 And Ada: Tools For Building Systems With Many Tasks, Ann Kratzer, Mark Sherman Mar 1984

View-3 And Ada: Tools For Building Systems With Many Tasks, Ann Kratzer, Mark Sherman

Dartmouth Scholarship

This paper discusses some useful features for tools that are intended to be used for developing systems with multiple tasks. We include a description of one tool that has been built, View-3. We also describe some problems that might be encountered when trying to fit this kind of tool into an APSE system.

Go to article

First Prev