Digital Commons Network^™

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.

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.

Automated Translation Of Digital Logic Equations Into Optimized Vhdl Code, John Evan Stark

Masters Theses

"It was desired to develop an algorithm for the automated translation of' finite slate machines from state table form to optimized VHDL form. To do this, algorithms arc needed for reducing the state machine to simplest form, making state assignments, producing minimal logic equations to represent the state machine, and producing VHDL code which describes the intended circuit. Various such algorithms were examined and a prototype program written to perform this translation"--Abstract, page ii.

Teacher Utilization Of A Middle School Media Program: A Case Study, Earnestine T. Mccloud

CCAC Theses and Dissertations

The goal of this research study was to determine the effectiveness of the media center within the school environment. The components of the media center program that should be strengthened were identified. The role of the media center, teachers, and staff in facilitating media center goals and objectives were evaluated.

Permission to survey teachers of the Lemmel Middle School was granted by the assistant Superintendent of Planning and Research. The letter of introduction, the questionnaire, directions for completing the questionnaire, and self-addressed, return envelopes were placed in the teachers' mailboxes.

To facilitate in the processing of the questionnaires, the data …

The Strong Perfect Graph Conjecture For Pan-Free Graphs, Stephan Olariu

Computer Science Faculty Publications

A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the largest number ω(F) of pairwise adjacent vertices in F. Berge's famous Strong Perfect Graph Conjecture asserts that a graph G is perfect if and only if neither G nor its complement G contains an odd chordless cycle of length at least five. Its resolution has eluded researchers for more than twenty years. We prove that the conjecture is true for a class of graphs which strictly contains the claw-free graphs.

A New Conjecture About Minimal Imperfect Graphs, H. Meyniel, Stephan Olariu

Computer Science Faculty Publications

H. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by a chordless path containing an odd number of edges. We conjectured that in every minimal imperfect graph, every pair of vertices is joined by a path containing an even number of edges. We give an equivalent version of this new conjecture.

Computing Hough Transforms On Hypercube Multicomputers, Sanjay Ranka, Sartaj Sahni

Electrical Engineering and Computer Science - Technical Reports

Efficient algorithms to compute the Hough transform on MIMD and SIMD hypercube multicomputers are developed. Our algorithms can compute p angles of the Hough transform of an N x N image, p ≤ N, in 0(p + log N) time on both MIMD and SIMD hypercubes. These algorithms require 0(N2) processors. We also consider the computation of the Hough transform on MIMD hypercubes with a fixed number of processors. Experimental results on an NCUBE/7 hypercube are presented.

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 …

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.

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.

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.

Testability Analysis Of Synchronous Sequential Circuits Based On Structural Data, Raghu V. Hudli, Sharad C. Seth

School of Computing: Faculty Publications

Bounds on test sequence length can be used as a testability measure. We give a procedure to compute the upper bound on test sequence length for an arbitrary sequential circuit. We prove that the bound is exact for a certain class of circuits. Three design rules are specified to yield circuits with lower test sequence bounds.

On The Bottleneck And Capacity Assignment Problems, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Elliptic Expert: The Design Of An Expert System For Elliptic Partial Differential Equations, Wayne R. Dyksen, Carl R. Gritter

Department of Computer Science Technical Reports

No abstract provided.

A System For The Diagnosis Of Faults Using A First Principles Approach, Barbara A. Smith, Ralph W. Wilkerson

Computer Science Technical Reports

One of the primary areas of application of Artificial Intelligence is diagnosis. Diagnosis from first principles is a diagnostic technique which uses knowledge of the designed structure and function of a device to determine the possible causes of the malfunction.

This work builds on the foundation of a theory of diagnosis by implementing and extending the theory. A correction to the algorithm which defines the theory is presented. The theory is extended for multiple sets of observations of the system and measurement data.

A fundamental problem in diagnosis is selecting the measurement which will be of the most benefit in …

Parallel (//) Ellpack: An Expert System For Parallel Processing Of Partial Differential Equations, Elias N. Houstis, John R. Rice, T. S. Papatheodorou

Department of Computer Science Technical Reports

No abstract provided.

A White Paper On High-Speed Network Architecture, Douglas E. Comer, John M. Steele, Raj Yavatkar

Department of Computer Science Technical Reports

No abstract provided.

On The Applications Of Multi-Equational Resultants, Chanderjit Bajaj, Thomas Garrity, Joe Warren

Department of Computer Science Technical Reports

No abstract provided.

Approximation Methods For Algebraic Curves And Surfaces, Chandrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Embedding Complete Binary Trees Into Butterfly Networks, Ajay K. Gupta, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

On Computing Longest Common Subsequences In Linear Space, A. Apostolico, S. Browne, C. Guerra

Department of Computer Science Technical Reports

No abstract provided.

On The Geometry Of Dupin Cyclides, V. Chandru, D. Dutta, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Parallel Split-Level Relaxation, Thomas C. Henderson, Ashok K. Samal

School of Computing: Conference and Workshop Papers

The goal of the scene labeling problem is to identify a set of regions in a given image. There are several approaches to solve this problem, including backtracking, graph matching, etc. A new method called split-level relaxation based on discrete relaxation was proposed in. It takes care of multiple semantic constraints, by considering each of them independently. The problem is NP-complete, so it takes a long time to solve this problem. With the advent of multiprocessors, it is now imperative to see if the problem can be solved faster in the average case.

We give a framework for solving the …

An Event-Action Model And Associated Architecture For Monitoring Parallel And Distributed Systems, Dan C. Marinescu, James E. Lumpp, Thomas L. Casavant, Howard Jhay Siegel

Department of Computer Science Technical Reports

No abstract provided.

Implementing Educational Software And Evaluating Its Academic Effectiveness: Part Ii, Karen Jolicoeur, Dale E. Berger

CGU Faculty Publications and Research

In Part I, published last month, we presented a successful classroom implementation plan for integrating educational software into elementary school classrooms. Implementing educational software successfully into classrooms is an essential prerequisite to achieving the second goal of the present research-evaluating how much students learned by using specific software programs. In Part II, we will measure how effective eight software programs were at teaching fifth grade students new fraction concepts and spelling words. In addition, we will examine the validity of teacher and student software ratings based on the effectiveness of each program.

A "Generalization" Of The Patel-Jordan Parallel Iterative Technique, John P. Bonomo, Wayne R. Dyksen

Department of Computer Science Technical Reports

No abstract provided.

Computations With Algebraic Curves, Shreeram S. Abhyankar, Chandrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

A Lower Bound On Embedding Tree Machines With Balanced Processor Utilization, Ajay K. Gupta, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

Semi-Automatic Process Decomposition For Non-Shared Memory Machines, Charles Koelbel, Piyush Mehrotra

Department of Computer Science Technical Reports

No abstract provided.