Digital Commons Network^™

Optimal Cost Parallel Algorithms For Lexicographical Ordering, Costas S. Iliopoulos

Department of Computer Science Technical Reports

No abstract provided.

Stability Conditions For Multidimensional Queueing Systems And Applications To Analysis Of Computer Systems, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Convergence Of O(H**4) Cubic Spline Collocation Methods For Elliptic Partial Differential Equations, Elias N. Houstis, E. A. Vavalis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Some Remarks On Uniformly Bounded Markov Chains: Stability Analysis, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Quadratic-Spline Collocation Methods For Two Point Boundary Value Problems, Elias N. Houstis, C. C. Christara, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Application Of Modified Predicate Transition Nets To Modeling And Simulation Of Communication Protocols, Chuang Lin, Dana Cristian Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Generation Of Configuration Spaces Iii: The Case Of Moving Algebraic Curves, Changerjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.

Analytic Modelling Of Cyclic Service Systems And Their Application To Token-Passing Local Networks, Vernon J. Rego, Lionel M. Ni

Department of Computer Science Technical Reports

No abstract provided.

Data Structure For The Use Of Patterns In The Perceptual Ordering Of The Game Of Chess, Russ L. Hanna, Arlan R. Dekock

Computer Science Technical Reports

It is well known that the way one perceives a problem can influence the difficulty of solving the problem in a profound way. In the case of computer chess playing programs, one finds that most programs perceive the game in much the same way. They are all based on Shannon's original proposal for chess playing programs. His approach was to generate all of the possible combinations of moves up to a certain number of plays and then a subset of all combinations to a deeper level thereafter. Each of these moves would then be evaluated as to its relative worth. …

A Semantic Basis For Parallel Algorithm Design, Roger E. Eggen, John R. Metzner

Computer Science Technical Reports

As computing demands increase, emphasis is being placed on parallel architectures- To efficiently use parallel machines, software must be designed to take advantage of these machines. This research concentrates on an abstraction of algorithm design to permit the expression of parallel programs. The abstraction emphasizes thought about algorithms at a high level as opposed to algorithm implementation at a statement level. A model based on data flow allows algorithm expression using flow diagrams. The model specifies operating system requirements that support parallel programming at a module level. Paths are used to carry data between modules. Data enter modules through ports. …

Generic Specifications In Lil And In Ada Via Analogies, George Chester Harrison

Computer Science Theses & Dissertations

We address the problem of .making verifiable specifications in generic program units in the Ada Programming Language*. We illustrate the methodologies of LIL proposed by Joseph Goguen and Justify the use of such a specification languages using analogy programming originally proposed by Nachum Dershowitz. The work in these areas is new and noticeably incomplete. We address our concern about the reusability of Ada software in a programming environment that includes a specification language like LIL. * Ada is a registered trademark of the U.S. Government (Ada Joint Program Office)

Direct Simulation From A Model Specification Language, Richard Pimentel

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The purpose of this thesis was to develop a program that would accept, as input, a finite set of algebraic equations and simple if-then conditional expressions that model a natural system, and then produce a continuous computer simulation with graphics and tabular output. The equations and conditionals can be in any order and key elements can be missing. The program can be used to run existing models or as a development tool to produce immediate prototypic computer simulations through synergistic man-machine interactions.

The theoretical aspects of automatic program generation were discussed, as well as the architectural design of the system. …

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.

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.

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

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 …

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.