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

Physical Sciences and Mathematics Commons

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 56281 - 56310 of 57958

Full-Text Articles in Physical Sciences and Mathematics

Visualization Of Surfaces In Four-Dimensional Space, Christoph M. Hoffmann, Jianhua Zhou Mar 1990

Visualization Of Surfaces In Four-Dimensional Space, Christoph M. Hoffmann, Jianhua Zhou

Department of Computer Science Technical Reports

No abstract provided.


The Wic Advisor: A Case Study In Medical Expert System Development, Elizabeth J. Mattson, Matthew M. Thomas, Sharon A. Trenz, Steve B. Cousins Mar 1990

The Wic Advisor: A Case Study In Medical Expert System Development, Elizabeth J. Mattson, Matthew M. Thomas, Sharon A. Trenz, Steve B. Cousins

All Computer Science and Engineering Research

This project provides a good case study of expert system development with untrained experts over a short period of time. We describe the development of a working medical screening and diagnosis expert system for use at the Women, Infants and Children (WIC) clinics in Madison County, Illinois. The system was designed and implemented over the period of four months. A large number of knowledge acquisition techniques were employed, some of them customized in ways that greatly increased their effectiveness. This paper explores the development of THE WIC Advisor, from problem definition through expert system delivery. The knowledge acquisition methods used …


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

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

BITs and PCs Newsletter

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


On The Optimum Relaxation Factor Associated With P-Cyclic Matrices, S. Galanis, A. Hadjidimos, D. Noutsos Feb 1990

On The Optimum Relaxation Factor Associated With P-Cyclic Matrices, S. Galanis, A. Hadjidimos, D. Noutsos

Department of Computer Science Technical Reports

No abstract provided.


An Efficient Parallel Algorithm For The Row Minima Of A Totally Monotone Matrix, Mikhail J. Atallah, S. Rao Kosaraju Feb 1990

An Efficient Parallel Algorithm For The Row Minima Of A Totally Monotone Matrix, Mikhail J. Atallah, S. Rao Kosaraju

Department of Computer Science Technical Reports

No abstract provided.


Load Balanced Tree Embeddings, Ajay K. Gupta, Susanne E. Hambrusch Feb 1990

Load Balanced Tree Embeddings, Ajay K. Gupta, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.


Supporting Queries In The O-Raid Object-Oriented Database System, James G. Mullen, Jagannathan Srinivasan, Prasun Dewan, Bharat Bhargava Feb 1990

Supporting Queries In The O-Raid Object-Oriented Database System, James G. Mullen, Jagannathan Srinivasan, Prasun Dewan, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


A Geometric Investigation Of The Skeleton Of Csg Objects, Debashish Dutta, Christoph M. Hoffmann Feb 1990

A Geometric Investigation Of The Skeleton Of Csg Objects, Debashish Dutta, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.


A Limiting Distribution For The Depth In Patricia Tries, Bonita Rais, Philippe Jacquet, Wojciech Szpankowski Feb 1990

A Limiting Distribution For The Depth In Patricia Tries, Bonita Rais, Philippe Jacquet, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


P-Complete Geometric Problems, Mikhail J. Atallah, Paul Callahan, Michael T. Goodrich Feb 1990

P-Complete Geometric Problems, Mikhail J. Atallah, Paul Callahan, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.


Athena: A Knowledge Base System For //Ellpack, C. E. Houstis, Elias N. Houstis, M. Katzouraki, T. S. Papatheodorou, John R. Rice Feb 1990

Athena: A Knowledge Base System For //Ellpack, C. E. Houstis, Elias N. Houstis, M. Katzouraki, T. S. Papatheodorou, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


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

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


//Ellpack: A Numerical Simulation Programming Environment For Parallel Mimd Machines, Elias N. Houstis, John R. Rice, N. P. Chrisochoides, H. C. Karathanasis, P. N. Papochiou, E. A. Vavalis, Ko Yang Wang Jan 1990

//Ellpack: A Numerical Simulation Programming Environment For Parallel Mimd Machines, Elias N. Houstis, John R. Rice, N. P. Chrisochoides, H. C. Karathanasis, P. N. Papochiou, E. A. Vavalis, Ko Yang Wang

Department of Computer Science Technical Reports

No abstract provided.


Towards Automatic Grid Generation Using Binary Space Partition Trees, George Vanecek Jan 1990

Towards Automatic Grid Generation Using Binary Space Partition Trees, George Vanecek

Department of Computer Science Technical Reports

No abstract provided.


Computational Complexity Of Geometric Symmetry Detection In Graphs, Joseph Manning Jan 1990

Computational Complexity Of Geometric Symmetry Detection In Graphs, Joseph Manning

Computer Science Technical Reports

Constructing a visually informative drawing of an abstract graph is a problem of considerable practical importance, and has recently been the focus of much investigation. Displaying symmetry has emerged as one of the foremost criteria for achieving good drawings. Linear-time algorithms are already known for the detection and display of symmetry in trees, outerplanar graphs, and embedded planar graphs. The central results of this paper show that for general graphs, however, detecting the presence of even a single axial or rotational symmetry is NP-complete. A number of related results are also established, including the #P-completeness of counting the axial or …


G1 Interpolation Using Piecewise Quadric And Cubic Surfaces, Chanderjit L. Bajaj Jan 1990

G1 Interpolation Using Piecewise Quadric And Cubic Surfaces, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.


A Functional Language With Classes, Mike Veaven, Ryan Stanisfer, Dan Wetklow Jan 1990

A Functional Language With Classes, Mike Veaven, Ryan Stanisfer, Dan Wetklow

Department of Computer Science Technical Reports

No abstract provided.


Queueing Models Of Secondary Storage Devices, Edward G. Coffman Jan 1990

Queueing Models Of Secondary Storage Devices, Edward G. Coffman

Department of Computer Science Technical Reports

No abstract provided.


Geometric Computations With Algebraic Varieties Of Bounded Degree, Chanderjit L. Bajaj Jan 1990

Geometric Computations With Algebraic Varieties Of Bounded Degree, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.


Algebraic Surface Design With Hermite Interpolation, Chandrajit L. Bajaj, Insung Ihm Jan 1990

Algebraic Surface Design With Hermite Interpolation, Chandrajit L. Bajaj, Insung Ihm

Department of Computer Science Technical Reports

No abstract provided.


Design Of A Dynamically Reconfigurable, Integrated, Parallel Vision System, Ashok K. Samal Jan 1990

Design Of A Dynamically Reconfigurable, Integrated, Parallel Vision System, Ashok K. Samal

CSE Conference and Workshop Papers

Multiprocessors can be used to speed up the process of object recognition. Building a parallel vision system is a two step process: (a) design and implement parallel algorithms for individual operations, and (b) integrate them into a coherent system. So far the emphasis has been on the first step. The second step has not received enough attention. A framework for building a parallel vision system is presented here. The necessary and desirable features of such a system have been identified. An initial design which incorporates these features is also given.


Grades - A Computer Based Score Management System For The Iigs, Charles Patrick Wahle Jan 1990

Grades - A Computer Based Score Management System For The Iigs, Charles Patrick Wahle

All Graduate Projects

This project involved the creation of an electronic gradebook designed to realistically meet the needs of classroom teachers. The computer source code was written in Pascal, a compiled language that allowed fast execution of any part of the program. The electronic gradebook called GradeS uses the graphic Desktop Intert'ace. It tracks up to 42 students per class, allowing up to 50 assignments per grading period. An unlimited number of classes can be stored on data disks. It produces four different types of whole class and individual student reports both on the screen and the printer. The project includes a report …


Positive Residues Involved In The Voltage-Gating Of The Mitochondrial Porin-Channel Are Localized In The External Moiety Of The Pore, Philadelphia University Jan 1990

Positive Residues Involved In The Voltage-Gating Of The Mitochondrial Porin-Channel Are Localized In The External Moiety Of The Pore, Philadelphia University

Philadelphia University, Jordan

No abstract provided.


Have You Hugged Your Computer Today?, David Morgan Lochhead Jan 1990

Have You Hugged Your Computer Today?, David Morgan Lochhead

Dr. David Morgan Lochhead

"I have owned a computer for over ten years now. When the computer came into my life, it turned it upside down. I was excited. I would spend every moment that I could with my computer. The most exciting thing that could happen to me would be for a new piece of software to come along. I lavished my computer with new programs. "


Mapping Finite Element Graphs On Hypercubes, Yeh-Ching Chung, Sanjay Ranka Jan 1990

Mapping Finite Element Graphs On Hypercubes, Yeh-Ching Chung, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

In parallel computing, it is important to map a parallel program onto a parallel computer such that the total execution time of a parallel program is minimized. In general, a parallel program and a parallel computer can be represented by a task graph (TG) and a processor graph (PG), respectively. For a TG, nodes represent tasks of a parallel program and edges denote the data communication needed between tasks. The weights associated with nodes and edges represent the computational load and communication cost, respectively. For a PG, nodes and edges denote processors and communication channels, respectively. By using the graph …


Arithmetic Classification Of Perfect Models Of Stratified Programs (Addendum), Krzysztof R. Apt, Howard A. Blair Jan 1990

Arithmetic Classification Of Perfect Models Of Stratified Programs (Addendum), Krzysztof R. Apt, Howard A. Blair

Electrical Engineering and Computer Science - Technical Reports

RECURSION-FREE PROGRAMS The following section completes the analysis of arithmetic complexity of perfect models and has been inadvertently omitted in the previous version of the paper. We say that a general program P is recursion-free if in its dependency graph Dp there is no cycle. Clearly recursion-free programs form a subclass of stratified programs. Recursion-free programs form a very simple generalization of the class of hierarchical programs introduced in [C78]. Hierarchical programs satisfy an additional condition on variable occurrences in clauses that prevents floundering, i.e. a forced selection of a non-ground negative literal in an SLDNF- derivation. In this section …


An Architecture For Distributed Multimedia Database Systems, P. B. Berra, C.Y.R. Chen, A. Ghafoor, C. C. Lin Jan 1990

An Architecture For Distributed Multimedia Database Systems, P. B. Berra, C.Y.R. Chen, A. Ghafoor, C. C. Lin

Electrical Engineering and Computer Science - All Scholarship

In the past few years considerable demand for user oriented multimedia information systems has developed. These systems must provide a rich set of functionality so that new, complex, and interesting applications can be addressed. This places considerable importance on the management of diverse data types including text, images, audio and video. These requirements generate the need for a new generation of distributed heterogeneous multimedia database systems. In this paper we identify a set of functional requirements for a multimedia server considering database management, object synchronization and integration, and multimedia query processing. A generalization of the requirements to a distributed system …


Using Annotated C++, Marshall P. Cline, Doug Lea Jan 1990

Using Annotated C++, Marshall P. Cline, Doug Lea

Electrical Engineering and Computer Science - All Scholarship

A++ (‘‘Annotated C++’’) is both a formalism and a proposed CASE tool for annotating C++ code with object-oriented specifications, assertions, and related semantic information. Annotations provide programmers with a useful means for approaching class design, exceptions, correctness, standardization, software reusability and related issues in software engineering with C++. This paper shows how A++ provides arbitrarily fine granularity to the C++ type system, how it automates and streamlines exception testing, how it can aid in standardization of software components, and how it can safely remove redundant exception tests.


Ua66/3/3 Journal Of The A. C. M., Wku Association For Computing Machinery Jan 1990

Ua66/3/3 Journal Of The A. C. M., Wku Association For Computing Machinery

Student Organizations

Journal created by and about the WKU Association for Computing Machinery a student organization sponsored by WKU Computer Science.


Building Voronoi Diagrams For Convex Polygons In Linear Expected Time, L Paul Chew Jan 1990

Building Voronoi Diagrams For Convex Polygons In Linear Expected Time, L Paul Chew

Computer Science Technical Reports

Let P be a list of points in the plane such that the points of P taken in order form the vertices of a convex polygon. We introduce a simple, linear expected-time algorithm for finding the Voronoi diagram of the points in P. Unlike previous results on expected-time algorithms for Voronoi diagrams, this method does not require any assumptions about the distribution of points. With minor modifications, this method can be used to design fast algorithms for certain problems involving unrestricted sets of points. For example, fast expected-time algorithms can be designed to delete a point from a Voronoi diagram, …