Digital Commons Network^™

Reachability Trees For High Level Petri Nets With Marking Variables, Chuang Lin, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Semi Iterative Methods On Distributed Memory Multiprocessor Architectures, A. Hadjidimos, Elias N. Houstis, John R. Rice, M. K. Samartzis, E.A. Vavalis

Department of Computer Science Technical Reports

No abstract provided.

The New Generation Of Computer Literacy, J. Paul Myers Jr.

Computer Science Faculty Research

A tremendous mismatch is developing between two of the most critical components of any computer literacy course: the textbooks and the students. We are encountering a "new generation" of students (literally as well as figuratively!) who are much better acquainted with computer usage than their earlier counterparts. Yet many textbooks with increasing emphasis in those same computer tools continue to appear. There are signs of a coming change in that a few authors and publishers apparently are becoming aware of the need for innovations in texts for non-scientists. These textbooks open the door for a new orientation to principles in …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, February 1989, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Sequence Comparison Of The Connection Machine, Mikhail J. Atallah, Scott Mcfaddin

Department of Computer Science Technical Reports

No abstract provided.

Critical Path Analysis Of Real-Time Ada Programs, Dan C. Marinescu, Ryan Stansifer

Department of Computer Science Technical Reports

No abstract provided.

Composition Of Libraries, Software Parts And Problem Solving Environments, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

On Variable Radius Blending Using Dupin Cyclides, Vijaya Chandru, Debasish Dutta, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

A Class Of Non-Preemptive Scheduling Algorithms For Real-Times Systems, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Dex: A High Level Tool For Distributed System Experiments, Niraj K. Sharma, Jagannathan Srinivasan

Department of Computer Science Technical Reports

No abstract provided.

On Grid Refinement At Point Singularities For H-P Methods, A. T. Chen, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Psychophysical Comparison Of Two Methods For Adaptive Histogram Equalization, John B. Zimmerman, Steve B. Cousins, Mark E. Frisse, Karin M. Hartzell, Michael C. Kahn

All Computer Science and Engineering Research

Adaptive histogram equalization (ahe) is a method for adaptive contrast enhancement of digital images propped by Pizer et. Al.. It has the properties that it is an automatic, reproducible method for the simultaneous viewing of contrast within a digital image with a large dynamic range. Recent experiments have show that in specific cases, there is no significant difference in the ability of ahe and linear intensity windowing to display grey-scale contrast. More recently, Pizer et al. have proposed a variant of ahe which limits the allowed contrast enhancement of the image. The contrast-limited adaptive histogram equalization (clahe) produces images in …

An Improved Exact Graph Coloring Algorithm, Thomas J. Sager, Shi-Jen Lin

Computer Science Technical Reports

We present two algorithms for exact graph coloring of the vertex sequential with dynamic reordering of vertices variety. The first, W-DEG, is a straight-forward improvement on Korman’s original algorithm. The second, SWAP2, is a not so straight forward improvement on Korman’s algorithm and appears to offer the best performance of known exact graph coloring algorithms.

A Color-Exchange Algorithm For Exact Graph Coloring, Thomas J. Sager, Shi-Jen Lin

Computer Science Technical Reports

DEXCH, a color-exchange exact graph coloring algorithm is presented. On many classes of graphs, DEXCH can, in the mean, find the chromatic number of a graph considerably faster than the DSATUR algorithm. The improvement over DSATUR stems from the ability to reorganize the subset of colored vertices and to detect in certain instances the existence of a complete subgraph of cardinality equal to the number of colors used in the best coloring found so far. The mean improvement over DSATUR is greatest on high edge-density graphs attaining the value of 42% on random graphs of edge-density 0.7 on 64 vertices.

A Pruning Procedure For Exact Graph Coloring, Thomas J. Sager, Shi-Jen Lin

Computer Science Technical Reports

The graph coloring problem can be stated: “Given an undirected graph, using a minimal number of colors, assign each vertex a color so that if two vertices are connected by an edge then they are not assigned the same color.” Graph coloring can be used to solve scheduling problems with constraints of the form: events e and e' can not be scheduled together. Graph coloring is an NP-Complete problem. Generally large problems are solved heuristically, although some of the better heuristic algorithms use an exact graph coloring algorithm to finish coloring a graph after first reducing it heuristically …

Enhancing Manufacturing Planning And Control Systems Through Artificial Intelligence Techniques, Ronald S. Dattero, John J. Kanet, Edna M. White

MIS/OM/DS Faculty Publications

Manufacturing planning and control systems are currently dominated by systems based upon Material Requirements Planning (MRP). MRP systems have a number of fundamental flaws. A potential alternative to MRP systems is suggested after research into the economic batch scheduling problem.

Based on the ideas of economic batch scheduling, and enhanced through artificial intelligence techniques, an alternative approach to manufacturing planning and control is developed. A framework for future research on this alternative to MRP is presented.

A Logic Programming Elucidation Of Oda - Document Descriptions And Processes, Howard A. Blair, Allen Brown Jr.

Electrical Engineering and Computer Science - Technical Reports

We are pursuing a programme of research in document representation. The principal aim of this research is to develop a document description language that has a precise formal semantics, that is fully expressive of the constructs typical of traditional (procedural) document description languages, that is constraint-based, and that cleanly separates specifications of form and content. The research is currently in the first of three envisioned three phases. In the first phase we are formalising the Office Document Architecture (ODA) by faithfully translating ODA document descriptions into logic programmes. The transition utilizes highly restricted forms of Prolog programmes.1 In the second …

Safe Computing, Bruce M. Mcmillin, T. L. Casavant

Computer Science Faculty Research & Creative Works

So-called worms, viruses, and Trojan horses that attack computer systems are defined. The vehicle that allows these attacks to occur, namely, the open computer internetwork, is examined. The problem of providing protection against attack in an internetwork environment is discussed. The need for professional responsibility on the part of the scientific and engineering community in enforcing strong ethical practices and neither tolerating nor condoning such practices is stressed.

Expectations For Associative-Commutative Unification Speedups In A Multicomputer Environment, Ralph W. Wilkerson, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

An essential element of automated deduction systems is unification algorithms which identify general substitutions and when applied to two expressions, make them identical. However, functions which are associative and commutative, such as the usual addition and multiplication functions, often arise in term rewriting systems, program verification, the theory of abstract data types and logic programming. The introduction to the associative and commutative equality axioms together with standard unification brings with it problems of termination and unreasonably large search spaces. One way around these problems is to remove the troublesome axioms from the system and to employ a unification algorithm which …

Fault Diagnosis Using First Order Logic Tools, Ralph W. Wilkerson, Barbara A. Smith

Computer Science Faculty Research & Creative Works

An automated circuit diagnostic tool implementing R. Reiter's theory of diagnosis (1987) based on deep knowledge (i.e. knowledge based on certain design information) and using first-order logic as the representation language is discussed. In this approach, the automated diagnostician uses a description of the system structure and observations describing its performance to determine if any faults are apparent. If there is evidence that the system is faulty, the diagnostician uses the system description and observations to ascertain which component(s) would explain the behavior. In particular, Reiter's method finds all combinations of components which explain this behavior.

Reliable Distributed Sorting Through The Application-Oriented Fault Tolerance Paradigm, Bruce M. Mcmillin, L. M. Ni

Computer Science Faculty Research & Creative Works

The design and implementation of a reliable version of the distributed bitonic sorting algorithm using the application-oriented fault tolerance paradigm on a commercial multicomputer is described. Sorting assertions in general are discussed and the bitonic sort algorithm is introduced. Faulty behavior is discussed and a fault-tolerant parallel bitonic sort developed using this paradigm is presented. The error coverage and the response of the fault-tolerant algorithm to faulty behavior are presented. Both asymptotic complexity and the results of run-time experimental measurements on an Ncube multicomputer are given. The authors demonstrate that the application-oriented fault tolerance paradigm is applicable to problems of …

Augustine’S Mathematical Realism, Paul Zwier

ACMS Journal 2004

This paper begins by outlining an argument advanced against mathematical realism by Philip Kitcher. It then sketches the life and work of the great Christian philosopher and theologian, Augustine of Hippo. It discusses Augustine’s view that there exist eternal ideas in the mind of God that God used as templates in his creation of material objects. Among these are ideas about numbers and other mathematical objects. It also discusses Augustine’s understanding of how human beings have access to such ideas. It concludes with a discussion of some possible objections to Augustine’s perspective.

A Definition Optimization Technique Used In A Code Translation Algorithm, David M. Dejean, George Winston Zobrist

Computer Science Faculty Research & Creative Works

Data flow analysis is used to optimize variable definitions in a program that translates microprocessor object code to a higher order language. © 1989, ACM. All rights reserved.

Signal Probabilities In And-Or Trees, Lester Lipsky, Sharad C. Seth

School of Computing: Faculty Publications

In this paper, we consider a class of AND-OR tree circuits and study their response to random-pattern inputs as the depth of the tree is allowed to increase indefinitely. Each binary input of a circuit is independently chosen to be one (zero) with probability x (1 - x). The logic of the circuit determines the probability of success (one) at the output as a monotonically increasing S-shaped function of x called the probability transfer function. The probability transfer function of an AND-OR tree is shown to have just one interior fixed point (w.r.t. changes in depth of …

The Fourth Dimension And The Theology Of Edwin Abbott Abbott, Thomas Banchoff

ACMS Journal 2004

This paper is a brief biography of Edwin Abbott Abbott, author of Flatland, and a sketch of the main ideas in the book. It also incorporates some personal reflections.

Flower : Predicting Flowering Times Of Cereal Crops, G A B Elliott, Stephen Loss

Journal of the Department of Agriculture, Western Australia, Series 4

FLOWER is a computer program which predicts the flowering date of a given wheat or barley variety at a specified location and sowing date. Department of Agriculture agronomists, breeders and advisers are using the program to provide useful information on how the development of cereals responds to different environments across Western Australia's cereal growing areas.

Personal Computing For The Visually Impaired, Bruce M. Mcmillin, P. Y. Mcmillin

Computer Science Faculty Research & Creative Works

The problem of providing feedback from the computer to a visually impaired user is examined. The use of traditional tactile input and output (Braille) is described. The limitations of voice output are discussed, and difficulties posed by complicated screen formats and screen review are considered.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, January 1989, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Concept Decomposition, Walter A. Sedelow Jr.

Journal of the Arkansas Academy of Science

Historically, perhaps the most general paradigm for scientists has been decomposition —as with, e.g., 'elements' in chemistry, and the basic structures/processes of theoretical physics. Knowledge representation research is encouraging a somewhat comparable activity in computer science, by way of the study of knowledge representation structures and knowledge representation systems. Symbol sets, rules of usage (including divergent inferencing engines) and conceptual primitives are among the entities involved in this process of decomposition.

On The Worst Case Of Three Algorithms For Computing The Jacobi Symbol, Jeffrey Shallit

Computer Science Technical Reports

We study the worst-case behavior of three iterative algorithms- Eisenstein's algorithm, Lebesgue's algorithm, and the "ordinary" Jacobi symbol algorithm - for computing the Jacobi symbol. Each algorithm is similar in format to the Euclidean algorithm for computing gcd (u,v).