Physical Sciences and Mathematics Commons^™

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.

Task-Oriented Display Design: Concept And Example, Terence S. Abbott

Dissertations, Theses, and Masters Projects

No abstract provided.

Ordering Events In A Distributed System: A Performance Evaluation, Jeffrey E. Payne

Dissertations, Theses, and Masters Projects

No abstract provided.

Asymptotically Fast Algorithms For Spherical And Related Transforms, James R. Driscoll, Dennis M. Healy

Computer Science Technical Reports

This paper considers the problem of computing the harmonic expansion of functions defined on the sphere. We begin by proving convolution theorems that relate the convolution of two functions on the sphere to a "multiplication" in the sprectral domain, as well as the multiplication of two functions on the sphere to a "convolution" in the spectral domain. These convolution theorems are then used to develop a sampling theorem on the sphere.

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.

Determinism And Connectionism In A Rule-Based Natural Language System, Stan C. Kwasny, Kanaan A. Faisal

All Computer Science and Engineering Research

The processing of Natural Language is, at the same time, natural symbolic and naturally symbolic and naturally sub-symbolic. It is symbolic because ultimately symbols play a critical role. Writing systems, for example, owe their existence to the symbolic nature of language. It is also sub-symbolic because of the nature of speech, the fuzziness of concepts, and the high degree of parallelism that is difficult to explain as a purely symbolic phenomenon. This report details a set of experiments which support the claim that Natural Language can be syntactically processed in a robust manner using a connectionist deterministic parser. The model …

A Status Report On Software Quality In The United States And Japan, Robert Yacobellis

Robert H Yacobellis

No abstract provided.

Symbolic Automation And Numerical Synthesis For Robot Kinematics, Jen Sriwattanathamma, Chung You Ho

Computer Science Technical Reports

This research analyzes three topics in robot arm kinematics. First, the direct kinematics which determines the Cartesian position and orientation of the end effector for the specified values of joint parameters is analyzed. Second, the differential motions concerning the differential relationships between the command variables in position and orientation of the end effector and the joint-controlled variables are studied. Finally, the inverse kinematics which determines the joint variables for a specified Cartesian position and orientation of the end effector is considered.

This dissertation presents a methodology for incorporating the artificial intelligence types of knowledge into automating solutions for the direct …

A Band And Bound Technique For Simple Random Algorithms, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

Machine Knowledge Maniputation Issues In Parallel Compilers, Ko-Yang Wang, Dennis Gannon, Piyush Mehrotra

Department of Computer Science Technical Reports

No abstract provided.

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.

Hermite Interpolation Of Rational Space Curves Using Real Algebraic Surfaces, Chanderjit Bajaj, Insung Ihm

Department of Computer Science Technical Reports

No abstract provided.

Xellpack: An Interactive Problem Solving Environment For Elliptic Partial Differential Equations, Jophn P. Bonomo, Wayne R. Dyksen

Department of Computer Science Technical Reports

No abstract provided.

Effects Of Autonomy On Maintaining Global Serializability In Heterogeneous Database Systems, W. Du, Ahmed K. Elmagarmid, Y. Leu, S. F. Ostermann

Department of Computer Science Technical Reports

No abstract provided.

Quasi Serializability: A Correctness Criterion For Interbase, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

A Dimensionality Paradigm For Surface Interrogations, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Distributed Operation Language For Specification And Processing Of Multidatabase Applications, Marek Rusinkiewicz, Kanchei Loa, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Convex Decompositions Of Simple Polyhedra, Chanderjit Bajaj, Tamal K. Dey

Department of Computer Science Technical Reports

No abstract provided.

Non-Algorithmic Load Imbalance Effects For Domain Decomposition Methods On A Hypercube, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Parallel Implementation Of Stickel's Ac Unification Algorithm In A Message-Passing Environment, David John Kleikamp, Ralph W. Wilkerson

Computer Science Technical Reports

Unification algorithms are an essential component of automated reasoning and term rewriting systems. Unification finds a set of substitutions or unifiers that, when applied to variables in two or more terms, make those terms identical or equivalent. Most systems use Robinson's unification algorithm or some variant of it. However, terms containing functions exhibiting properties such as associativity and commutativity may be made equivalent without appearing identical. Systems employing Robinson's unification algorithm must use some mechanism separate from the unification algorithm to reason with such functions. Often this is done by incorporating the properties into a rule base and generating equivalent …

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 …

Multilevel Asynchronous Iteration For Pdes, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Programmer And End User Communication In Computer System Development, Theresa J. Hart

Masters Theses

Many computer professionals agree that good communication between computer programmers or analysts and the people for whom a system is being created is essential for system success. This study researches possible reasons behind the communication problems that exist between programmers and end users and suggests ways to narrow the communication gap.

Many theories, including the theories of hemispheric brain dominance, thinking styles, and motivational factors may help explain the differences in communication styles between programmers and users. To further explore the communication problem, an exploratory survey was given to programmers and users to evaluate their perception of the communication that …

The Development Of A Personalized Computer Assisted School Psychology (Casp) System, Patricia Lou Steinert

Dissertations

The purpose of this project was to develop a model computer system to assist school psychologists in managing and manipulating data accumulated in the course of accomplishing their professional responsibilities. School psychologists have traditionally generated large amounts of data, but rarely have they looked across these data to obtain information and/or feedback about their own functioning relative to their professional role. The system described is intended as a model from which an individual psychologist might construct a system to meet individual needs. Data across students were accumulated in four broad areas: (1) personal effectiveness/accountability, (2) diagnosis, (3) local test norms, …

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.

The Young-Eidson Algorithm: Applications And Extensions, A. Hadjidimos, D. Noutsos

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.

Imacs Conference On Expert Systems For Numerical Computing, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

On The Sorting Of Points Along An Algebraic Curve, John K. Johnstone, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.