Digital Commons Network^™

An Approach For Minimizing Spurious Errors In Testing Ada Tasking Programs, N. Mansouri, Amrit L. Goel

Electrical Engineering and Computer Science - Technical Reports

We propose an approach for detecting deadlocks and race conditions in Ada tasking software. It is based on an extension to Petri net-based techniques, where a concurrent program is modeled as a Petri net and a reachability graph is then derived and analyzed for desired information. In this approach, Predicate-Action subnets representing Ada programming constructs are described, where predicates and actions are attached to transitions. Predicates are those found in decision statements. Actions involve updating the status of the variables that affect the tasking behavior of the program and updating the Read and Write sets of shared variables. The shared …

A Petri Net-Based Tool For Detecting Deadlocks And Race Conditions In Concurrent Programs, Amrit L. Goel, N. Mansouri

Electrical Engineering and Computer Science - Technical Reports

A static analysis tool for detecting deadlocks and potential race conditions on shared variables in concurrent programs is presented. It is based on Petri Net modeling and reachability analysis, where a concurrent program is modeled as an augmented Petri net and a reachability graph is then derived and analyzed for desired information. Place-Transition subnets representing programming language constructs are described. Transitions in these subnets are augmented with sets of shared variables that occur in sections of the program, called concurrency zones, related to the transitions. The tool consists of four modules. The modeling module employs the augmented subnets as building …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, September 1990, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Unification In Modal Theorem Proving, Xiaolin Zhang, Chilukuri K. Mohan

Electrical Engineering and Computer Science - Technical Reports

Modal formulas can be proved by translating them into a three-typed logic and then using unification and resolution, with axioms describing properties of the reachability relation among possible worlds. In this paper, we improve on the algorithms in [1], showing that "strong skolemisation" and occurrence checks are not needed for proving theorems of Q, T, Q4, and S4. We also extend the 'path logic' approach to S5, give the appropriate unification algorithm, and prove its correctness.

Surface Reasoning, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

Surface reasoning is defined to be deduction conducted in the surface language in terms of certain primitive logical relations. The surface language is a spoken or written natural language (in this paper, English), in contrast to a "base language" or “deep structure" sometimes hypothesized to explain natural language phenomena. The primitive logical relations are inclusion, exclusion and overlap between classes of entities. A calculus for surface reasoning is presented. Then a model for reasoning in this calculus is developed. The model is similar to but more general than syllogistic. In this model, reasoning is represented as construction of fragments (subposets) …

Studies In The Hybrid Deterministic Parsing, Stan C. Kwasny, Anne M. Johnstone, Barry L. Kalman

All Computer Science and Engineering Research

This report details research plans to extend work on hybrid deterministic parsing. The approach is hybrid in its combination of symbolic and sub-symbolic (connectionist) approaches. The research is investigating (1) new and more robust architectures for deterministic parsing which are hybrid mixtures of symbolic and sub-symbolic components, (2) combinations of syntax with lexical access and other components of natural language processing in order to determine how the distributed patterns of connectionism may enable better interfaces among these components, and (3) properties of the rules in the rule-based deterministic processing of natural language that make them most suitable for sub-symbolic training. …

Notions Of Relative Ubiquity For Invariant Sets Of Relational Structures, Paul Bankston, Wim Ruitenburg

Mathematics, Statistics and Computer Science Faculty Research and Publications

Given a finite lexicon L of relational symbols and equality, one may view the collection of all L-structures on the set of natural numbers w as a space in several different ways. We consider it as: (i) the space of outcomes of certain infinite two-person games; (ii) a compact metric space; and (iii) a probability measure space. For each of these viewpoints, we can give a notion of relative ubiquity, or largeness, for invariant sets of structures on w. For example, in every sense of relative ubiquity considered here, the set of dense linear orderings on w is …

Directory Location Service (Dls), Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.

Gateway Design For Lan Interconnection Via Isdn, Xian-Yu Zhang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Recently, the use of bridges/gateways to interconnect physically distant local area networks (LANs) has become increasingly popular. There are various ways of connecting these bridges/gateways. ISDN is one of them and an attractive one. In this paper we discuss our work in the gateway design for interconnecting LANs via ISDN.

Techniques For Cubic Algebraic Surfaces Ii, Thomas W. Sederberg

Faculty Publications

A survey of some techniques that may have potential for free-form modeling with algebraic surfaces is continued. Classical results as well as several recent innovations are included. Specific attention is paid to cubic algebraic surfaces, although many of the ideas presented have application to algebraic surfaces of any degree. Topics addressed include piecewise constructions, interpolation to points and space curves, and parameterization.

The Origins Of Modern Computing, Saul Rosen

Department of Computer Science Technical Reports

No abstract provided.

Curvature Computations On Surfaces In N-Space, Jung-Hong Chuang, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

On High Level Characterization Of Parallelism, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Efficient Parallel Binary Search On Sorted Arrays, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.

Multisearch Techniques Of Hierarchical Dags On Mesh-Connected Computers, With Applications, Jyh-Jong Tsay, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

Computing Some Distance Functions Between Polygons, Mikhail J. Atallah, Celso C. Ribeiro, Sergio Lifschitz

Department of Computer Science Technical Reports

No abstract provided.

History Of The Computer Sciences Department At Purdue University, John R. Rice, Saul Rosen

Department of Computer Science Technical Reports

No abstract provided.

The Origins Of Computing And Computer Science At Purdue University, Saul Rosen, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Surface Fitting Using Implicit Algebraic Surface Patches, Chandrajit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Zone Theorem And Polyhedral Decompositions, Chandrajit L. Bajaj, Tamal K. Dey

Department of Computer Science Technical Reports

No abstract provided.

Robot Pedagogics: The Adaptation, Analysis, And Computer Control Of A Model Manipulator, Edward T. Hammerand, Chung You Ho

Computer Science Technical Reports

The subject of robotics is addressed by many different fields, among them computer science, electrical engineering, and mechanical engineering. This work is an attempt to bring together all of these aspects from the perspective of a computer science background. Different techniques are considered and reconciled with one another in the analytical area, while detail and explanation are added in all areas that were not previously available. In addition, geometrical interpretations arc presented for concepts that have heretofore been presented only in the form of equations.

Mesh And Pyramid Algorithms For Iconic Indexing, Alok Choudhary, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

In this paper parallel algorithms on meshes and pyramids for iconic indexing are presented. Our algorithms are asymptotically superior to previously known parallel algorithms.

A Simulation Of A Multi-Hop Communications Network Using A Kinematic Topology Generator And Static Sphere-Packing Power Control, Kevin Charles Davis

Masters Theses

No abstract provided.

Bulletin No 4191 - Inputs For Beefin, D. J. Barker, P J. May, R. G. Grieve

Bulletins 4000 -

BEEFIN is a computer model (Barker et at. 1986) that calculates profit maximizing diets for finishing cattle to a specified carcass weight and fat thickness. It predicts cattle growth, feed conversion ratio, final liveweight, number of days on feed and amount of available feedstuffs to finish the cattle to specification.

BEEFIN calculates an enterprise profit and loss budget and performs a sensitivity analysis on cattle and feed price changes. A sensitivity analysis of returns to assets, variable costs and per tonne of feed fed is also calculated.

Ctran: Transforming Scientific Fortran Programs To Unix Based Computing Environments, Qi Chen

Masters Theses

FORTRAN is one of the most popular scientific programming languages. The efficiency, rich libraries, and popularity of FORTRAN support its continued use as a programming language for scientific computing in the near future. However, in current multiprocessor UNIX environments, C is often better supported. The desire to use existing FORTRAN subroutines within such a C environment leads to several options. In this thesis, we introduce a "modern" scientific programming language called CTRAN for this purpose.

We begin with a brief review of the history of scientific programming languages. An introduction of CTRAN is given in Chapter HI. In Chapter IV, …

Surface Approximations In Geometric Modeling, Jung-Hong Chuang

Department of Computer Science Technical Reports

No abstract provided.

Efficient Detection Of Quasiperiodicities In Strings, Alberto Apostolico, Andrzej Ehrenfeucht

Department of Computer Science Technical Reports

No abstract provided.

Synchronization And Load Imbalance Effects In Distributed Memory Multiprocessor Systems, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Application Of The E/T Performance Modeling Methodology To A Computation On A 128 Processor Ncube, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Unifying Parametric And Implicit Surface Representations For Computer Graphics: Parametric Surface Display And Algebraic Surface Fitting, Changrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.