Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 31531 - 31560 of 31857

Full-Text Articles in Entire DC Network

Approximate Delay Analysis Of Transaction Oriented Communication In A Distributed System, Dan C. Marinescu Mar 1989

Approximate Delay Analysis Of Transaction Oriented Communication In A Distributed System, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.


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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, March 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.


Automatic Load Balanced Partitioning Strategies For Pde Computations, N. P. Chrisochoides, C. E. Houstis, Elias N. Houstis, S. K. Kortesis, John R. Rice Feb 1989

Automatic Load Balanced Partitioning Strategies For Pde Computations, N. P. Chrisochoides, C. E. Houstis, Elias N. Houstis, S. K. Kortesis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Local Perimeterization, Implicitization And Inversion Of Real Algebraic Curves, Chanderjit Bajaj Feb 1989

Local Perimeterization, Implicitization And Inversion Of Real Algebraic Curves, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.


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

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 Feb 1989

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 Feb 1989

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

Department of Computer Science Technical Reports

No abstract provided.


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

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

Department of Computer Science Technical Reports

No abstract provided.


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

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. Jan 1989

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 …


Augustine’S Mathematical Realism, Paul Zwier Jan 1989

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.


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

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 Jan 1989

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 Jan 1989

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. Jan 1989

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.


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

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 …


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

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 Jan 1989

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 Jan 1989

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 Jan 1989

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 Jan 1989

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.


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

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 Jan 1989

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.


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

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.


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

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.


On The Bottleneck And Capacity Assignment Problems, Wojciech Szpankowski Dec 1988

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 Dec 1988

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 Dec 1988

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 Nov 1988

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 Nov 1988

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.