Physical Sciences and Mathematics Commons^™

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 …

Expressive Power In First Order Topology, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

A first order representation (f.o.r.) in topology is an assignment of finitary relational structures of the same type to topological spaces in such a way that homeomorphic spaces get sent to isomorphic structures. We first define the notions "one f.o.r. is at least as expressive as another relative to a class of spaces" and "one class of spaces is definable in another relative to an f.o.r.", and prove some general statements. Following this we compare some well-known classes of spaces and first order representations. A principal result is that if X and Y are two Tichonov spaces whose posets of …

Modeling A Token Ring With Non-Exhaustive Service, André B. Bondi

Department of Computer Science Technical Reports

No abstract provided.

Modeling The Effect Of Local Area Network Contention On The Performance Of Host Computers, André B. Bondi

Department of Computer Science Technical Reports

No abstract provided.

Towards A Distributed File System, Walter F. Tichy, Zuwang Ruan

Department of Computer Science Technical Reports

No abstract provided.

Vector C—A Vector Processing Language, Kuo-Cheng Li, Herb Schwetman

Department of Computer Science Technical Reports

No abstract provided.

The Optimal Trajectory Modelling Of Robot Manipulators, Mary Claire Miller, Chung You Ho, Arlan R. Dekock

Computer Science Technical Reports

Greater robot capability can be achieved through the use of robot manipulator control systems. Crucial to the success of these control systems is the optimal trajectory modelling of the path traced by the end- effector. To create this optimal path the utilization of B-Spline curve functions will be investigated, and compared to Cubic Spline curve functions.

An Experimental Study Of The Effects Of Modularity On Resource Consumption In Software Development, Alan D. Christiansen, Arlan R. Dekock, John Bruce Prater

Computer Science Technical Reports

Many authors have encouraged the use of modular programming techniques in software development. In fact, there is almost total agreement within industrial and academic circles that modularity is a desirable feature of any software package. Unfortunately, the desirability of modular design is almost always voiced without support from experimental evidence.

This paper consists of an experiment comparing the resource consumption of programmers based on the modularity practices employed during the design and programming phases of software development. The experiment tests the effectiveness of modularity in reducing psychological complexity of software.

The results of the research show that in some cases …

Data Structures For On-Line Updating Of Minimum Spanning Trees, With Applications, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

Performance Bounds For Multiclass Models, Teemu Kerola, Herbert D. Schwetman

Department of Computer Science Technical Reports

No abstract provided.

The Bluff Machine (Single Module Version), John T. Korb

Department of Computer Science Technical Reports

No abstract provided.

Learning Computer Logic Architectures On Apple Ii System, Falah Reda Al-Saffar

Masters Theses

For this thesis seven computer-assisted instruction packages have been designed to illustrate the design of electronic circuits of gates , the logic of combinational and sequential circuits, and integrated and magnetic core memories.

The programs in these packages have been written in the Pascal computer language on an Apple II microcomputer and stored on a double-sided floppy disk.

An Improvement In The Performance Of A Learning System For Finite State Machines, Lea F. Fuller

Masters Theses

A learning system is examined which is capable of learning a finite state machine from a class of finite state machines based on the observed behavior of the machine. The size of the search space becomes very large as the number of states in the machine increases. The size of the search space quickly becomes the limiting factor in the size of the class of machines which may be learned. An investigation is made of methods to improve the performance of the learning system. The application of a depth first approach to the development of the search space is shown …

A Computer Aided Instructional System And Its Application Towards A Course On Snobol4 Programming Language, Abtin Edelji

Masters Theses

Computers are rapidly replacing humans in many tasks. Computer Aided Instructional System is an application of the computer in the teaching of a subject. Currently, a large number of educational Institutes use Computer Aided Instructional Systems.

The objectives of this thesis is to review some techniques in implementing such systems and to present a Computer Aided Instructional System called TEACH. The emphasis of this thesis is on the type of the directory used to minimize the search time for the TEACH System.

A Query-Processing Optimization Strategy For Generalized File Structures, Donna Marie Kaminski

Masters Theses

In processing a Boolean query against a non-inverted file, a subset of the query's keys must be selected. Only the records satisfying these keys need to be retrieved from the file. A dynamic programming algorithm, the Dual-to-minDF, is developed here for arriving at the optimum set of keys, i.e., the minimum number of external record retrievals. Previously suggested greedy methods yield feasible solutions which may or may not be optimal. This algorithm has exponential time complexity. However, it is useful for applications involving relatively short queries with duplication of keys within different conjuncts, and in cases where the files have …

On Symmetry Detection, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

The Importance Of Scaling For The Hermite Bicubic Collocation Equations, Wayne R. Dyksen, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Rcs: A System For Version Control, Walter F. Tichy

Department of Computer Science Technical Reports

No abstract provided.

The Composite Bound Method (Cbm) For Computing Throughput Bounds In Multiple Class Environments, Teemu Kerola

Department of Computer Science Technical Reports

No abstract provided.

Computer Revolution: Another Human Extension, Russell W. Maatman

Pro Rege

No abstract provided.

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.

On Terminal Assignments That Minimize The Density, Mikhail J. Atallah, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

Rediflow Multiprocessing, Robert M. Keller, Frank C. H. Lin, Jiro Tanaka

All HMC Faculty Publications and Research

We discuss the concepts underlying Rediflow, a multiprocessing system being designed to support concurrent programming through a hybrid model of reduction, dataflow, and von Neumann processes. The techniques of automatic load-balancing in Rediflow are described in some detail.

Simple On The Chip, D. Gannon, J. Panetta

Department of Computer Science Technical Reports

No abstract provided.

Fortran Extensions For Parallel And Vector Computation, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Optimal Rotation Problems In Channel Routing, Mikhail J. Atallah, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

An Improved Algorithm For Generating Minimal Perfect Hash Functions, Thomas J. Sager

Computer Science Technical Reports

A minimal perfect hash function (MPHF) is a function from a set of M objects to the first M non-negative integers. MPHF's are useful for the compact storage and fast retrieval of frequently used objects such as reserved words in a programming language or commonly employed words in a natural language. In this paper we improve on an earlier result and present an algorithm for generating MPHF's with an expected time complexity proportional to M⁴. We also give a MPHF for the 256 most frequently used words in the English language.

Parallelism In The Language, Natural, Thomas J. Sager

Computer Science Technical Reports

Natural is a language designed to provide a vehicle for the expression of abstract programming concepts clearly and precisely in a natural and mathematical form. The concept of parallelism can be expressed both explicitly and implicitly in the language, Natural. Due to relative freedom from side-effects and the use of a special value, undef, subexpressions can often be evaluated in parallel. The for and do statements both allow for a parallel mode of execution. A builtin functional, prlleval, creates functions which can evaluate their arguements in a parallel mode. In addition, the concept of module allows for the definition of …

A New Method For Generating Minimal Perfect Hash Functions, Thomas J. Sager

Computer Science Technical Reports

A perfect hash function, PHF, is an injection, F, from a set, W, of M objects into the set consisting of the first N non-negative integers where N>=M. If N=M then F is a minimal perfect hash function, MPHF. PHFs are useful for the compact storage and fast retrieval of frequently used objects such as reserved words in a programming language or commonly employed words in a natural language.

The mincycle algorithm for finding PHFs executes with an expected time complexity proportional to M⁴ and has been used successfully on sets of cardinality up to 256. The mincycle …

Hierarchical Representation Of Optically Scanned Documents, George Nagy, Sharad C. Seth

CSE Conference and Workshop Papers

The objective of the research to be pursued is to develop a schema for representing raster-digitized (scanned) documents, The representation is to retain not only the spatial structure of a printed document, but should also facilitate automatic labeling of various components, such as text, figures, subtitles, and figure captions, and allow the extraction of important relationships (such as reading order) among them. Intended applications include (1) data compression for document transmission and archival, and (2) document entry, with out rekeying, into editing, formatting, and information retrieval systems.