Digital Commons Network^™

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

Ua35/11 Student Honors Research Bulletin, Wku Honors Program

WKU Administration Documents

The WKU Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers are representative of work done by students from throughout the university.

• Padilla, Anne. First and Second Language Acquisition: A Comparison
• Scott, Angela. Salted and Unsalted Snacks: Taste Preferences of Second Grade Students in a Rural Area School
• Fuqua, Nancy. Acceptance by High School Students of Muffins Containing Supplemental Soy Polysaccharides
• Mans, Glee. Preference Levels of High School Freshmen for Four Cheese Food Products
• Denney, Pam. Consumer Acceptance of UHT Choclate Lowfat Milk
• Harris, Carla. Jacques-Louis David: Raphael of the Sansculottes
• Vaughn, James. Corporate Reorganization …

Automatic Ordering Of Program Units For Execution, Ronald D. Williams

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

A program written in today's sequential programming languages must be written according to a rule which states that source instructions must be written in their exact order of execution. A better rule would be to let the programmer write the instructions in any order he wants- - then let a program figure out the proper order of execution. Such a system applies not only to individual instructions in a procedure or program, but to procedures in a program and to programs in a job stream.

This paper and its associated automatic ordering program introduce a method by which instructions can …

Prolog., Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

A Description is Given of Prolog, a Contraction of Programming in Logic, Which Uses the Formalism of Mathematical Logic as its Primary Design Principle. the Structure of Prolog is Examined, and a Database Program is Described to Illustrate its application. an Application to an Artificial Intelligence Problem, the Towers of Hanoi, is Also Given.

Alphabetic Minimax Trees Of Degree At Most T*, D. Coppersmith, Maria M. Klawe, Nicholas Pippenger

All HMC Faculty Publications and Research

Problems in circuit fan-out reduction motivate the study of constructing various types of weighted trees that are optimal with respect to maximum weighted path length. An upper bound on the maximum weighted path length and an efficient construction algorithm will be presented for trees of degree at most t, along with their implications for circuit fan-out reduction.

Maze Game For The Macintosh, Mark Sherman

Computer Science Technical Reports

Maze is a multiperson game using a broadcast protocol on the Macintosh. This disk contains the sources (in TML Pascal) for a Maze game.

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.

Qdt (Quickdraw Terminal) Disks, Mark Sherman

Computer Science Technical Reports

This disk set consists of one disk containing a running version of QDT over a serial line, one disk containing a running version of QDT over Apple Talk (using KSP), and one disk containing the Lisa Pascal sources for creating QDT (either version).

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

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

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.

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.

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.

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

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.

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.

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 …

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.

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.

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 …

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 …

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 …