Digital Commons Network^™

A Unifying Framework For Systolic Designs, Concettina Guerra

Department of Computer Science Technical Reports

No abstract provided.

Omicron: Events => Action, Balachander Krishnamurthy, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

Command Execution In A Heterogeneous Environment, John T. Korb, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

Automatic Rational Parameterization Of Curves And Surfaces Ii: Cubics And Cubicoids, Shreeram S. Abhyankar, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Deterministic Linear Predictors For Bit Rate Improvement, Dhanvant H. Goradia

Electrical & Computer Engineering Theses & Dissertations

This thesis addresses the application of deterministic linear predictor s for telemetry based systems. Deterministic linear predictors are considered as a viable alternative to block transform coding in order to achieve bit rate reduction. A method of calculating the predictor coefficients of a deterministic linear predictor is presented. The system model is developed parametrically with respect to the bandwidth, polynomial order, signal class and predictor length. Two classes of signals, deterministic and random are analyzed and bounds on the performance of the deterministic linear predictor are established. A family of six pole Butterworth filters are used as presample filters in …

A Model Of Syntax-Directed Transduction Of Unrestricted Grammars Using 2pda With Multisymbol Matching Production Rules, Steven William Cooke

Masters Theses

Syntax-directed transduction of unrestricted grammars is modeled by 2PDA automata with multisymbol matching production rules. Syntax-directed transduction normal form grammars (SDT) are constructed for unrestricted grammars. Transduction of sequences of derivation directives to sequences of derivation steps is defined for SDT grammars. E2PDA, a superset of 2PDA with input, output, and multi-symbol matching production rules, is formalized. The class of languages generated by unrestricted grammars. E2PDA syntax-directed transducers are conducted for SDT grammars.

Syntactic Representation And Analysis Of The Cognitive Structures Underlying Ritual Acts, Robert G. Hardin

Masters Theses

A formal grammar was proposed by Lawson and McCauley (1980) to model the cognitive structures underlying an informant's representation of religious ritual acts. This study classifies the language generated by that grammar as context-sensitive, presents an LR(1) parser for the language, and specifies a computer program to implement that model. The system functions as an Intelligent assistant using techniques involving rule-based systems, non-monotonic logic, and multiple levels of abstraction. Knowledge is represented in a parse tree, rules stored as patterns, and the inference engine uses a pattern matcher. The consequences of an act change over time and can change previous …

A Query Optimization Method For Use In A Generalized Database, Caroline D. Mautz

Masters Theses

Currently proposed methods for retrieval of records from a generalized file organization are not optimal, causing more I\0 retrievals than are necessary. This paper proposes another technique that has near optimal results and has a polynomial order of complexity.

The technique takes as input a query in disjunctive form, sorts the keys in the query in ascending order according to the number of records associated with them, then using a table much like a prime implicant table, systematically searches for a complete cover of the query conjuncts with a minimum total number of records associated with the keys that are …

Fast Algorithms For Shortest Paths In Planar Graphs, With Applications, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

Interactive Ellpack, Wayne R. Dyksen, Calvin J. Ribbens

Department of Computer Science Technical Reports

No abstract provided.

Parallel Methods For Pdes, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

On Correspondence, Motion, Scale And Structure Of Two Views Of A Scene, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

The Costs And Benefits Of A Teaching Laboratory For The Operating Systems Course, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.

Functions Returning Values Of Dynamic Size, Mark Sherman, Andy Hisgen, Jonathan Rosenberg, David Alex Lamb

Computer Science Technical Reports

Modern programming languages, such as Ada (Ichbiah 80), permit the definition of functions that return values whose size can not be determined until the function returns. This paper discusses five implementation techniques that can be used to implement this capability. Comparisons of the techniques are provided and guidelines for selecting a particular technique for a compiler are given.

Ellpack Project Status Report, John R. Rice, Wayne R. Dyksen, Elias N. Houstis, Calvin J. Ribbens

Department of Computer Science Technical Reports

No abstract provided.

Generation Of Configuration Space Obstacles Ii: The Case Of Moving Algebraic Surfaces, Chanderjit Bqajajj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.

Methods Of Factoring Large Integers, Samuel S. Wagstaff Jr, J. W. Smith

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.

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.

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.

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

Department of Computer Science Technical Reports

No abstract provided.

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

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.

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

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.