Digital Commons Network^™

Taxonomic Reasoning And Lexical Semantics, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

Taxonomic reasoning is used in many applications, including many-sorted logic, knowledge bases, document retrieval, and natural language processing. These various applications have been dealt with independently. Because they have so much in common, a general approach to taxonomic reasoning would seem to be justified. This paper presents a theory of lexical semantics as an example of such a general approach. The theory defines a representation and an algebra for that representation. The operations of the algebra are inherently parallel, making them well matched to the capabilities of modern computer systems.

A Lexical Extension Of Montague Semantics, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

This paper presents a model theory of lexical semantics that is compatible with theories in the Montagovian tradition. Lexical expressions are modeled as subsets or “subspaces” in a “semantic spaces”. A unique representation is defined for subspaces of the semantic space. This unique representation is called the "normal form" of the lexical denotation. A Boolean algebra of normal forms is developed, in which lexical entailment is Boolean inclusion. The presentation in the body of the paper is informal, making use of examples to illustrate the theory and to indicate the range of applicability. Formal definitions and proofs in support of …

Digital Image Processing Using Mathematical Morphology, Andrew Mehnert

Theses : Honours

This dissertation is a natural extension of my undergraduate research project entitled, "Digital Image Processing”. Whilst my undergraduate project dealt with a number of classical digital image filtering techniques such as spatial convolution and frequency domain filtering via the Fourier transform, this dissertation focuses on an alternative approach employing Mathematical Morphology. In contrast to classical filtering techniques, which often geometrically distort the original image, morphological operations, used sensibly, essentially preserve shape and geometry. Mathematical morphology therefore lends itself to image processing applications requiring the identification of objects and object features within an image. Herein basic morphological operations are developed, firstly …

Data Base Design For Research In Comparative Zapotec, Anita C. Bickford

Theses and Dissertations

This thesis explores the nature and content of a comparative data base for the Zapotec languages of Mexico that may be produced. Many questions are discussed: how to sub-divide and list the Zapotec languages and dialects; what data format will be most accessible to researchers as well as to field workers with data to add; computer software considerations (designing computational tools); how to handle non-cognates with shared meanings, non-overlap of glosses (i.e., one Zapotec gloss covers several Spanish words, or vice versa), semantic shifts and secondary meanings, and other problems such as special characters, free variation, elisions, etc.; whether to …

Optical Machine Recognition Of Lower-Case Greek Characters Of Any Size, Ivan X. D. D'Cunha

Electrical & Computer Engineering Theses & Dissertations

An algorithm utilizing a syntactic approach and a criterion based on normalized moments is defined for the reliable, automatic, machine recognition of handwritten and printed Greek characters of any size and font. In this approach a binary image of the character in question is obtained initially; its skeleton is then produced by utilizing a standard thinning algorithm. The classification process then incorporates the topological features of the characters such as existence of closed curves, number of intersections, number and location of free ends, axial symmetry, and the criteria derived from normalized moments to uniquely identify each pattern. Experiments conducted demonstrated …

Design Considerations For Distributed Scientific Software Systems, Paul E. Buis

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.

Engineering The Object-Relation Database Model In O-Raid, Bharat Bhargava, Prasun Dewan, Stephen Leung

Department of Computer Science Technical Reports

No abstract provided.

Machine Learning: A Critique Of Research Efforts And Suggested Research Strategy, William S. Davis, David B. Murrell

Department of Computer Science Technical Reports

No abstract provided.

Supporting Objects In A Conventional Operating System, Prasun Dewan

Department of Computer Science Technical Reports

No abstract provided.

Integrating Editing In A Monolingual Environment, Prasun Dewan

Department of Computer Science Technical Reports

No abstract provided.

A Lexical Extension Of Montague Semantics, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

Montague's linguistic theory provides a completely formalized account of language in general and natural language in particular. It would appear to be especially applicable to the problem of natural language understanding by computer systems. However the theory does not deal with meaning at the lexical level. As a result, deduction in a system based on Montague semantics is severely restricted. This paper considers lexical extension of Montague semantics as a way to remove this restriction. Representation of lexical semantics by a logic program or semantic net is complex. An alternative representation, called a semantic space, is described. This alternative lacks …

Architecture And Operation Invocation In The Clouds Kernel, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Intensional Reasoning About Knowledge, Oliver B. Popov, Arlan R. Dekock

Computer Science Technical Reports

As demands and ambitions increase in Artificial Intelligence, the need for formal systems that facilitate a study and a simulation of a machine cognition has become an inevitability. This paper explores and developes the foundations of a formal system for propositional reasoning about knowledge. The semantics of every meaningful expression in the system is fully determined by its intension, the set of complexes in which the expression is confirmed. The knowledge system is based on three zeroth-order theories of epistemic reasoning for consciousness, knowledge and entailed knowledge. The results presented in the paper determine the soundness and the completeness of …

A Study Of Automated Reasoning In A Brain Tumor Diagnosis Expert System, Aung Zaw Maung

Masters Theses

The objective of this study is to survey various theorem-proving methods and to evaluate how these methods can be applied as inference engines in a brain tumor diagnosis expert system.

Various applications of automated reasoning based on the resolution principle are discussed. Knowledge representations and inference mechanisms used in expert systems are also surveyed.

An actual application of this method for a medical diagnosis problem is implemented and explained, and the limitations of this approach and possible future enhancements are discussed.

Computing About Physical Objects, Chanderjit Bajaj, Christoph M. Hoffmann, Elias N. Houstis, John T. Korb, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

An Expert System Controlling An Adaptable Distributed Data Base System, Bharat Bhargava, John Riedl, Detlef M. Weber

Department of Computer Science Technical Reports

No abstract provided.

Domains For Logic Programming, I. Filippenko, F. L. Morris

Electrical Engineering and Computer Science - Technical Reports

We construct Scott domains well suited to use in an abstract implementation of logic programming, and perhaps to the modelling of other first-order data structures. The domain elements, which we call ‘grafts’, are in effect a sort of directed graphs. The approximation order in the domains corresponds to the relation between tuples of terms, “has a substitution instance”; the price to be paid is that one equivalence class of (tuples of) terms under renaming of variables is represented by many grafts. Graft domains come in two flavors—plain and ‘acyclic’—for modelling on an equal footing logic programming without and with the …

An Attribute-Grammar Implementation Of Government-Binding Theory, Nelson Correa

Electrical Engineering and Computer Science - All Scholarship

The syntactic analysis of languages with respect to Government binding (GB) grammar is a problem that has received relatively little attention until recently. This paper describes an attribute grammar specification of the Government binding theory. The paper focuses on the description of the attribution rules responsible for determining antecedent trace relations in phrase-structure trees, and on some theoretical implications of those rules for the GB model. The specification relies on a transformation-le variant of Government "binding theory, briefly discussed by Chomsky (1981), in which the rule move-a is replaced by an interpretive rule. Here the interpretive rule is specified by …

Proof And Intuition, Michael Detlefsen

ACMS Journal 2004

This paper aims to give a clear exposition of two critiques of logicism. The intuitionist, Brouwer, is best known for rejecting the law of the excluded middle (his "special critique.") The paper argues that Brouwer's "general critique" is deeper and more extensive than this. That is, Brouwer is arguing that mathematical knowledge requires a kind of direct mathematical experience, analogous to sensory experience and this cannot be attained simply by linguistic operations independently of experience. It also discusses Poincare's critiques - that there is a huge difference between genuine mathematical insight and an ability to logically manipulate mathematical truths and …

Lily: A Parser Generator For Ll(1) Languages, Timothy Topper Taylor

Masters Theses

This paper discusses the design and implementation of Lily, a language for generating LL(1) language parsers, originally designed by Dr. Thomas J. Sager of the University of Missouri--Rolla. A method for the automatic generation of parser tables is described which creates small, highly optimized tables, suitable for conversion to minimal perfect hash functions.

An implementation of Lily is discussed with attention to design goals, implementation of parser table generation, and table optimization techniques. Proposals are made detailing possibilities for further augmentation of the system. Examples of Lily programs are given as well as a manual for the system.

Intensional Reasoning About Knowledge, Oliver B. Popov

Doctoral Dissertations

"As demands and ambitions increase in Artificial Intelligence, the need for formal systems that facilitate a study and a simulation of a machine cognition has become an inevitability. This paper explores and developes the foundations of a formal system for propositional reasoning about knowledge. The semantics of every meaningful expression in the system is fully determined by its intension, the set of complexes in which the expression is confirmed. The knowledge system is based on three zeroth-order theories of epistemic reasoning for consciousness, knowledge and entailed knowledge. The results presented in the paper determine the soundness and the completeness of …

A Computerized Audio-Visual Speech Model, Joaquin Alberto Vila Ruiz, Arlan R. Dekock

Computer Science Technical Reports

This thesis describes an expert system able to animate (graphically) and reproduce (acoustically) a text in any language which uses the Latin alphabet. A rule editor has been developed to create and modify the set of letter-to-sound rules of the target language. A parser has been implemented to apply the set of rules and translate text-to-speech. Each phoneme has a unique sound and thus requires its particular positioning of the vocal organs which are displayed in two different projections: a front view and a profile cross view of a human face in synchronization with the output sounds of the speech …

The Design Of An Adaptable Distributed System, Bharat Bhargava, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

Ua35/11 Student Honors Research Bulletin, Wku Honors Program

WKU Administration Documents

The WKU Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers are representative of work done by students from throughout the university.

• Padilla, Anne. First and Second Language Acquisition: A Comparison
• Scott, Angela. Salted and Unsalted Snacks: Taste Preferences of Second Grade Students in a Rural Area School
• Fuqua, Nancy. Acceptance by High School Students of Muffins Containing Supplemental Soy Polysaccharides
• Mans, Glee. Preference Levels of High School Freshmen for Four Cheese Food Products
• Denney, Pam. Consumer Acceptance of UHT Choclate Lowfat Milk
• Harris, Carla. Jacques-Louis David: Raphael of the Sansculottes
• Vaughn, James. Corporate Reorganization …

A Computerized Audio-Visual Speech Model, Joaquin Alberto Vila Ruiz

Masters Theses

"This thesis describes an expert system able to animate (graphically) and reproduce (acoustically) a text in any language which uses the Latin alphabet. A rule editor has been developed to create and modify the set of letter-to-sound rules of the target language. A parser has been implemented to apply the set of rules and translate text-to-speech. Each phoneme has a unique sound and thus requires its particular positioning of the vocal organs which are displayed in two different projections: a front view and a profile cross view of a human face in synchronization with the output sounds of the speech …

Structural Properties Of The String Statistics Problem, A. Apostolico, F. P. Preparata

Department of Computer Science Technical Reports

No abstract provided.

Artificial Intelligence: Myths And Realities, Hugo D'Alarcao

Bridgewater Review

Artificial intelligence the name conjures images of mechanical monsters, the Golem, Dr. Frankenstein’s creation and the rebellious computer Hal. We have always been fascinated by the possibility of creating a machine in our image, but this fascination is often accompanied by apprehension. We fear losing control of our creation and suspect that it might turn against us. It is this duality, this conflict between the desire to create and the fear of the consequences of the creation that has been so successfully exploited by writers. It is also, in part, this fascination that has recently brought the field of Artificial …

Block Encoding Of Speech Spectral Principal Components, James R. Holland Jr.

Electrical & Computer Engineering Theses & Dissertations

A Karhunen-Loeve series expansion was used to block encode speech spectral principal components as a function of time. Each of ten principal components was first obtained as a linear combination of 2© speech spectral band energies. Using a fixed block length of 10 frames (0.128 s), the K-L basis vectors were computed separately for various speakers for each principal component. In all cases the resulting basis vectors were essentially a set of discrete cosine basis vectors. Synthesis of speech from the block encoded parameters showed that very little information is lost with up to 70% data reduction. The block encoding …

Computing As A Part Of A P.H.D Students Education: A Position Paper, Andrew D. Bailey, Rayman D. Meservy

Faculty Publications

The skills and abilities associated with computer literacy are becoming required tools for accounting Ph.D. students. Not only are new doctoral students entering Ph.D. programs with better skills, they are also applying these skills more on a day to day basis. This paper presents a brief discussion of a number of issues associated with computer use and computer literacy in general. The paper also presents several aspects of the Ph.D. program at the University of Minnesota and how computers are affecting the program.