Digital Commons Network^™

Model Generation And Modification For Dynamic Systems From Geometric Data, Christoph M. Hoffmann, John E. Hopcroft

Department of Computer Science Technical Reports

No abstract provided.

Yet Another Application Of A Binomial Recurrence, Wojciech Szpankowski, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

Supporting Objects In A Conventional Operating System, Prasun Dewan

Department of Computer Science Technical Reports

No abstract provided.

An Approach To Support Automatic Generation Of User Interfaces, Prasun Dewan, Marvin Solomon

Department of Computer Science Technical Reports

No abstract provided.

Integrating Editing In A Monolingual Environment, Prasun Dewan

Department of Computer Science Technical Reports

No abstract provided.

On The Analysis Of Request-Response Communication In A Token Passing Ring, Dan Cristian Marinescu

Department of Computer Science Technical Reports

No abstract provided.

An Optimal Parallel Algorithm For The Visibility Of A Simple Polygon From A Point, Mikhail J. Atallah, Danny Z. Chen, Hubert Wagner

Department of Computer Science Technical Reports

No abstract provided.

Towards Implementing Robust Visual Motion Computations: Generate And Test Approach, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

Micro Database Management System Language, Karen Yingling Tam, George Winston Zobrist

Computer Science Technical Reports

There are two approaches to solve computational problems in a microcomputer environment:

1. Non-database approach: uses a high level programming language with non-database files as input and/or output files.
2. Database approach: uses the programming language embedded in the micro Data Base Management System(DBMS), with the database defined by the integrated database definition language as input and/or output files.

Adopting the appropriate approach in any single application may save cost and time. This paper compares the two different approaches while solving the same Control Section (CSECT) Interaction Hierarchy problem and suggests which to use when.

Parallel Simulated Annealing, Roger D. Chamberlain, Mark N. Edelman, Mark A. Franklin, Ellen E. Witte

All Computer Science and Engineering Research

Since the paper by Kirkpatrick, Gelatt and Vecchi in 1983, the use of Simulated Annealing (SA) in solving combinatoric optimization problems has increased substantially. The SA algorithm has been applied to difficult problems in the difficult problems in the digital design automation such as cell placement and wire routing. While these studies have yielded good or near optimum solutions, they have required very long computer execution times (hours and days). These long times, coupled with the recent availability of the number of commercial parallel processors, has prompted the search for parallel implementations of the SA algorithm. The goal ahs been …

Performance Models For Noahnet, Gurudatta M. Parulkar, Adarshpal S. Sethi, David J. Farber

All Computer Science and Engineering Research

Noahnet is an experimental flood local area network with features such as high reliability and high performance. Noahnet uses a randomly connected graph topology with four to five interconnections per node and a flooding protocol to route messages. In Noahnet flooding, the routing of a message from a source to the destination node is a two step process: flooding-growth and flooding-contraction. During the growth of flooding, the message propagates to every node which is not occupied with a message and is reachable from the source node. During the contraction of flooding, the nodes that became occupied during the growth of …

Implementation Of Raid, Bharat Bhargava, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

Reconstruction Of A Real Object Using Stereo Vision, Ignatios E. Vakalis

Masters Theses

The problem of reconstructing a three dimensional object from its two dimensional image is the most critical problem which any powerful visual system must solve. The human visual system is known to solve this problem with impressive range and resolution. Computer solutions have fallen far short of human performance mainly because the solution process is poorly understood.

The reconstruction problem is solved using stereo vision. The distance of points on the object from the viewing device and the orientation of specific patches of the visual surface with respect to the viewing device are computed. Discontinuities in distance and orientation are …

Algorithms For Planar Geometric Models, Chanderjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.

Potential Evaluation Directions For Ellpack, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Exploiting Parallelism Across Program Execution: A Unification Technique And Its Analysis, Vernon J. Rego, Aditya P. Mathur

Department of Computer Science Technical Reports

No abstract provided.

On The Effects Of Synchronization In Parallel Computing, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Sequences And Digital Trees: A Symbiosis, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Motion Estimation Of A Rigid Planar Patch: A Robust Computational Technique, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

Deduction Of A Functional Dependency From A Set Of Functional Dependencies, James M. Richardson, Daniel C. St. Clair

Computer Science Technical Reports

This paper describes an algorithm called the Deduction Tracing Algorithm (DTA) which utilizes basic properties of functional dependencies from database systems and a modification of a tree search algorithm from artificial intelligence. The algorithm takes a set of functional dependencies, F, along with a specific functional dependency L → R as input and produces a list of functional dependencies from F that can be used to deduce L → R. The resulting algorithm is easily automated to provide relational database users with a tool for organizing their queries.

Intensity Blending Of Computer Image Generation-Based Displays, Elizabeth Scheppler Reidelberger, Daniel C. St. Clair

Computer Science Technical Reports

State-of-the-art combat simulators require a 360 degree field of view, allowing the pilot and radar intercept officer to have the same visibility in the simulator that they would experience in the aircraft. The sky/earth display must be computer - generated and displayed with a minimum of two channels to provide the most realistic display possible. The two channels of display come together in the dome, forming an equator, that must be as indiscernible to the aircrew as possible. To accomplish this, an algorithm has been developed for controlling the video output which makes the two separate channel displays appear as …

A Lexical Extension Of Montague Semantics, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

Montague's linguistic theory provides a completely formalized account of language in general and natural language in particular. It would appear to be especially applicable to the problem of natural language understanding by computer systems. However the theory does not deal with meaning at the lexical level. As a result, deduction in a system based on Montague semantics is severely restricted. This paper considers lexical extension of Montague semantics as a way to remove this restriction. Representation of lexical semantics by a logic program or semantic net is complex. An alternative representation, called a semantic space, is described. This alternative lacks …

Hierarchical Discrete-Event Simulation On Hypercube Architecture, Roger D. Chamberlain, Mark A. Franklin

All Computer Science and Engineering Research

This paper presents model of hierarchical discrete-event simulation algorithm running on a hypercube architecture. We assume a static allocation of system components to processors in the hypercube. We also assume a global clock algorithm, with an event-based time increment. Following development of the performance model, we describe an application of the model in the area of digital systems simulation. Hierarchical levels included are gate level (NAND, NOR, and NOT gates) and MSI level (multiplexors, shift registers, etc.). Example values (gathered from simulations running on standard von Neumann architectures) are provided at the model inputs to show the effect of different …

A Schwarz Splitting Variant Of Cubic Spline Collocation Methods For Elliptic Pdes, Elias N. Houstis, John R. Rice, E.A. Vavalis

Department of Computer Science Technical Reports

No abstract provided.

Efficient Interprocess Communication Using Shared Memory, Douglas E. Comer, Steven B. Munson

Department of Computer Science Technical Reports

No abstract provided.

A Note On Two Simulation Benchmarks, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

A Tool For Integrating Conceptual Schemas And User Views, Amit P. Sheth, James A. Larson, Aloysius Cornelio, Shamkant B. Navathe

Kno.e.sis Publications

An interactive tool has been developed to assist database designers and administrators (DDA) in integrating schemas. It collects the information required for integration from a DDA, performs essential bookkeeping, and integrates schemas according to the semantics provided. The authors present the capabilities of this tool by discussing the integration methodology and the user interface of the tool.

Lsim2 User's Manual, Roger D. Chamberlain, Mark N. Edelman

All Computer Science and Engineering Research

Lsim2 is gate/switch-level digital logic simulator. It enables users to model digital circuits both at the gate and switch level and incorporates features the support investigation of the simulation task itself. Lsim2 is an augmented version of the original lsim* with the addition of several new MSI-type components models. This user's manual describes procedures for specifying a circuit in lsim2, mechanisms for controlling the simulation, and approaches to modeling systems.

Automatic Interface Generations From Grammar Specifications, Steve B. Cousins

All Computer Science and Engineering Research

This paper presents a method for automatically generating user interfaces to programs. All possible legal strings of input to a moderately interactive program, taken together, specify the input language of that program. A grammar for such a language is fundamentally knowledge about the language, and that knowledge can be used to assist the program's user in constructing legal program input. The set of words which can appear next in an input sentence, the 'Next set', is defined and a technique for calculating it with a modified version of Prologs's Definite Clause Grammar parser is given. One type of interface this …

An Inherently Parallel Large Grained Data Flow Environment, Roger E. Eggen, John R. Metzner

Computer Science Faculty Research & Creative Works

A parallel programming environment based on data flow is described. Programming in the environment involves use with an interactive graphic editor which facilitates the construction of a program graph consisting of modules, ports, paths and triggers. Parallelism is inherent since data presence allows many modules to execute concurrently. The graph is executed directly without transformation to traditional representations. The environment supports programming at a very high level as opposed to parallelism at the individual instruction level.