Digital Commons Network^™

Relational Completeness Of Show And Tell Visual Programming Language, Takayuki Dan Kimura

All Computer Science and Engineering Research

In this paper we present the database applications of the Show and Tell Language (STL) and demonstrate the relational completeness of the language. STL is a visual programming language designed for novice computer users who are not familiar with keyboarding. A program can be constructed by using only a pointing device, except for textual data entry. A program can be constructed by using only a pointing device, except for textual data entry. Various programming concepts such as subroutine, iteration, recursion, concurrency, exception, and so forth are represented by two-dimensional graphic patterns and icons. The language is used to test the …

Efficient Algorithms For Hybrid Data/Voice Transmissions, Andrzej Kusiuk, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

A Graph Browser With Zoom And Roam For Allegro Common Lisp, Steve B. Cousins, J. Andrew Fingerhut

All Computer Science and Engineering Research

This report describes an object-oriented tool that has been developed for viewing graphs on a Macintosh II computer using Allegro Common Lisp. The tool is useful for visualizing data which can be represented in tree or graph form. The graphs can be viewed for far away to get a global view, and from close up so that the labels on the vertices can be discerned. Scrolling can be performed at a nearly infinite number of resolutions, and a search feature makes it easy to find any node rapidly. Although the 'information space' on which the graph is logically plotted is …

A Parallel Distributed Approach To Parsing Natural Language Deterministically, Stan C. Kwasny

All Computer Science and Engineering Research

The Determinism Hypothesis (Marcus, 1980) has given rise to much debate. The hypothesis makes explicit the idea that Natural Language interpretation need not depend in any fundamental way on the use of pseudo-parallelism or backtracking. We are exploring the consequences of this hypothesis in attempting to develop approaches to parsing which integrates current work in parallel distributed adaptive networks. We follow the basic approach of "Wait-and-See" parsing (WASP) which has shown the Natural Language interpretation of all but some varieties of "garden-path" sentences can be deterministically performed using a stack, a buffer for sentence constituents, and partitioned packets of rules. …

Experimenal Evaluation Of Concurrent Checkpointing And Rollback-Recovery Algorithms, Bharat Bhargava, Pei-Jyun Leu, Shy-Renn Lian

Department of Computer Science Technical Reports

No abstract provided.

An Aeration Duct Design Model For Flat Grain Storage, Thomas C. Bridges, Douglas G. Overhults, Samuel G. Mcneill, G. M. White

Biosystems and Agricultural Engineering Faculty Publications

Traditionally most grain is stored in circular type bins which provide a convenient means for handling and management. With the excess grain production and government loan programs of the past few years, some producers have used rectangular structures and covered piles to complement their round storages. The recommended management practices used with round bins are still required in those alternative storages and may be more critical in obtaining a quality end product.

One such recommended practice used with round bins is aeration. This practice is used to maintain a uniform temperature in the grain mass, preventing condensation and "hot" spots …

Atamm Multicomputer System Design, William Robert Tymchyshyn

Electrical & Computer Engineering Theses & Dissertations

The Algorithm To Architecture Mapping Model, or ATAMM, is a graph theoretic design methodology that has been created to resolve design and performance issues involved with concurrent processing. Petri-net marked graphs are used to represent the computational environment.

This thesis describes the development of a multicomputer system which will operate within the bounds specified by the ATAMM model. The system is first designed and implemented using the framework of standard multicomputer design theory. A validation is then performed by the comparison of the system's computational performance to results predicted by ATAMM. This validation is shown to be successful for three …

Dc-Free Coset Codes, Robert H. Deng, M. A. Herro

Research Collection School Of Computing and Information Systems

An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2l) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF(128). Also, a union upper bound on the BEP of a linear cyclic code with either hard- or soft-decision ML decoding is developed, as well as the corresponding bounds for the extended code of a linear cyclic code. Using these bounds, which are tight at low bit error rate, the performance advantage of soft-decision (SD) ML and HD ML over bounded-distance (BD) …

Computer Use In The Warren County Riii School District: A Proposal For The Implementation Of A Computer Lab Program In The Elementary School, Debbie Reese

Theses

A problem faced by many schools in the 1980s is how to approach computer ir1struction in the elementary grades. Schools have moved into a new technological realm with the advent of the modern microcomputer. The focus of this project was to investigate current trends in computer education in the elementary grades in respect to computer placement within the schools and content of computer education programs. The paper addresses, specifically, the lack of a computer program in the Warren County RIII School District and the rationale for developing a computer lab in the elementary school. An interim plan is also proposed, …

A Generic Algorithm For Transaction Processing During Network Partitioning, Bharat Bhargava, Shirley Browne

Department of Computer Science Technical Reports

No abstract provided.

Engineering The Object-Relation Database Model In O-Raid, Bharat Bhargava, Prasun Dewan, Stephen Leung

Department of Computer Science Technical Reports

No abstract provided.

Seth: A Quorum-Based Replicated Database System For Experimentation With Failures, Bharat Bhargava, Abdelsalam Helal, Jagannathan Srinivasan

Department of Computer Science Technical Reports

No abstract provided.

Three Experiments In Reliable Transaction Processing In Raid, Bharat Bhargava, Fady Lamaa, Pei-Jyun Leu, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

Using The Bat: A Six Dimensional Mouse For Object Placement, Colin Ware, Danny R. Jessome

Center for Coastal and Ocean Mapping

Placement in space is inherently six dimensional. An object can be translated in x, y and z cartesian coordinates, and it can be rotated about three axes to change its orientation. A six dimensional sensor I\I(/S conj/gured as a one button six dimensional mouse (which we call a bat) and interfaced with an IRIS workstation thus creating an environment for investigating the problems of object placement. A sojiware workbench was built which allows the manipulation of hierarchical scenes displayed on a monitor. The features of the workbench are described together with experiences using the bat in a variety of interaction …

Automated Circuit Diagnosis Using First Order Logic Tools, Barbara Smith, Ralph W. Wilkerson, Gerald E. Peterson, Mcdonnell Douglas

Computer Science Faculty Research & Creative Works

While Numerous Diagnostic Expert Systems Have Been Successfully Developed in Recent Years, They Are Almost Uniformly based on Heuristic Reasoning Techniques (I.e., Shallow Knowledge) in the Form of Rules. This Paper Reports on an Automated Circuit Diagnostic Tool based on Reiter's Theory of Diagnosis. in Particular, this is a Theory of Diagnosis based on Deep Knowledge (I.e., Knowledge based on Certain Design Information) and using First Order Logic as the Representation Language. the Inference Mechanism Which is Incorporated as Part of the Diagnostic Tool is a Refutation based Theorem Prover using Rewriting Systems for Boolean Algebra Developed by Hsiang. Consequently, …

Implementing Ray Tracing Algorithm In Parallel Environment, Tjah Jadi

Dissertations and Theses

Ray tracing is a very popular rendering algorithm in the field of computer graphics because it can generate highly-realistic images from three-dimensional models. Unfortunately, the computational cost is very expensive. To speed up the rendering process we present both static and dynamic scheduling (balancing) strategies for a multiprocessor system. Hence, the load balancing among the processors is the most important problem in parallel processing. The implementation of the algorithm is based on a modified octree structure.

Dynamics Of Knowledge Processing In Parallel Systems, Abhijit Chaundhury, Dan C. Marinescu, Andrew Whinston

Department of Computer Science Technical Reports

No abstract provided.

Machine Learning: A Critique Of Research Efforts And Suggested Research Strategy, William S. Davis, David B. Murrell

Department of Computer Science Technical Reports

No abstract provided.

Applying Algebraic Geometry To Surface Intersection Evaluation, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Locating Distributed Information, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

Service Execution In A Distributed Environment (Thesis), Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

Using A Partial Order And A Metric To Analyze A Recursive Trace Set Equation, Jan Tijmen Udding, Tom Verhoeff

All Computer Science and Engineering Research

In Trace Theory the notion of a process is defined in terms of a set of finite-length traces over an alphabet. These processes are used as the semantics for a program notation. The program text for a recursive component naturally gives rise to an equation over trace sets. This paper takes two approaches at the analysis of that equation. The first approach is based on a partial order and it concentrates on the projection operator for processes. This yields a condition under which the greatest solution of that equation can be approximated by iteration. The second approach introduces a metric …

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.

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.

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 …

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.