Digital Commons Network^™

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 …

Genesis Of An Expert System For Umr Degree Auditing, Ruth Sue Dare

Masters Theses

"This paper describes the features, design, and development of an expert system for degree auditing at the University of Missouri--Rolla. It summarizes artificial intelligence as it is known today while specifically addressing expert systems. It describes selected expert systems currently in existence.

The present audit procedure utilized at the University of Missouri--Rolla is discussed. A description is given of the design and development of an expert system, written in LISP, to conduct a degree audit. Finally there are concluding remarks which include an analysis of the system and a discussion of possible system enhancement"--Abstract, page ii.

Multiprocessor Scheduling With Practical Constraints, Kenneth Burton Donovan

Retrospective Theses and Dissertations

The problem of scheduling tasks onto multiprocessor systems has increasing practical importance as more applications are being addressed with multiprocessor systems. Actual applications and multiprocessor systems have many characteristics which become constraints to the general scheduling problem of minimizing the schedule length. These practical constraints include precedence relations and communication delays between tasks, yet few researchers have considered both these constraints when developing schedulers.

This work examines a more general multiprocessor scheduling problem, which includes these practical scheduling constraints, and develops a new scheduling heuristic using a list scheduler with dynamically computed priorities. The dynamic priority heuristic is compared against …

Epsilon Precedence Grammars And Languages, Masoud T. Milani

Retrospective Theses and Dissertations

The classes of simple and weak precedence grammars are generalized to include ε-rules (productions with the empty right parts). The descriptive power of epsilon simple precedence (ESP) grammars increases directly with the number of ε-rules permitted; the class of ESP grammars with no ε-rules, ESP₀, is identical to the class of simple precedence grammars; ESP grammars with at most one ε-rule, ESP₁, define a class of languages which properly includes the class of ESP₀ languages, but is itself properly included in the class of deterministic, context-free languages. In general, ESP grammars having at most i …

Intra Region Routing, Robert Alan Eustace

Retrospective Theses and Dissertations

The custom integrated circuit routing problem normally requires partitioning into rectangular routing regions. Natural partitions usually result in regions that form both "channels" and "areas". This dissertation introduces several new channel and area routing algorithms and measures their performance.

A formal description of the channel routing problem is presented and a relationship is established between the selection of intervals for each track and the number of tracks in the completed channel. This relationship is used as an analysis tool that leads to the development of two new and highly effective channel routing algorithms: the Revised and LCP algorithms. The performance …

Specification And Efficiency Evaluation Of A Data Communications Protocol, Patricia Ann Anderson

Masters Theses

"A data communications protocol for an established operating environment is formally specified. Motivation for the development of this protocol is presented, with consideration for the future communications requirements of the system.

Factors influencing the performance of a protocol are reviewed. Error recovery, network addressing, flow control, traffic prioritization, and initialization and termination sequences are examined in general and with respect to the protocol development.

In conclusion, a mathematical evaluation of the efficiency of the protocol is provided, using Tanenbaum's equations for determining channel utilization. The theoretical channel utilization of a perfect system, without propagation delay or error, is compared with …

A Data Structure For The Use Of Patterns In The Perceptual Ordering Of The Game Of Chess, Russ L. Hanna

Masters Theses

"It is well known that the way one perceives a problem can influence the difficulty of solving the problem in a profound way. In the case of computer chess playing programs, one finds that most programs perceive the game in much the same way. They are all based on Shannon's original proposal for chess playing programs. His approach was to generate all of the possible combinations of moves up to a certain number of plays and then a subset of all combinations to a deeper level thereafter. Each of these moves would then be evaluated as to its relative worth. …

Prolog., Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

A Description is Given of Prolog, a Contraction of Programming in Logic, Which Uses the Formalism of Mathematical Logic as its Primary Design Principle. the Structure of Prolog is Examined, and a Database Program is Described to Illustrate its application. an Application to an Artificial Intelligence Problem, the Towers of Hanoi, is Also Given.

Mica: Prototyping An Expert System Consultant, Joseph Howard Marchal

Masters Theses

"The United States, as the world's largest producer and consumer of scrap and flake mica, has an obvious economic interest in applications of artificial intelligence technology that would expedite beneficiation of mica. In the fall of 1985, personnel of the Tuscaloosa and Rolla research centers of the Bureau of Mines and of the University of Missouri--Rolla, Institute for Artificial Intelligence started the following long term research project: Develop an Expert System Consultant for the three basic stages of mica beneficiation: Stage 1: characterization of the material; Stage 2: treatment to obtain a concentrate; and Stage 3: evaluation of the resulting …

A Semantic Basis For Parallel Algorithm Design, Roger E. Eggen

Doctoral Dissertations

"As computing demands increase, emphasis is being placed on parallel architectures- To efficiently use parallel machines, software must be designed to take advantage of these machines. This research concentrates on an abstraction of algorithm design to permit the expression of parallel programs. The abstraction emphasizes thought about algorithms at a high level as opposed to algorithm implementation at a statement level. A model based on data flow allows algorithm expression using flow diagrams. The model specifies operating system requirements that support parallel programming at a module level. Paths are used to carry data between modules. Data enter modules through ports. …

Industrial Simulation With Animation, Edward T. Hammerand, Chung You Ho

Computer Science Technical Reports

This thesis examines and evaluates the new simulation language PCModel. Prior to the arrival of PCModel, simulation via computer typically resulted in pages of statistics compiled over the duration of the simulation. PCModel's approach is to simulate the model on the display before the user in real time. Additionally, user interaction is supported to allow changes to be made throughout the simulation run.

The evaluation of PCModel is accomplished through inspection of a pair of examples already simulated in a conventional simulation language. The examples show the relative strong and weak points of the language, as well as demonstrating how …

A Generalized Information Structure To Be Used In A Human-Factors Knowledge Base, Bruce J. Wachlin

Theses and Dissertations

The purpose of this thesis is to design a generalized information structure that can be used in a human-factors knowledge base. The information structure will take into account the human factors requirements and the hardware characteristics of the system. In this thesis the design and implementation of several prototype systems of a generalized information structure to be used in a human-factors knowledge base are presented.

The Design And Implementation Of A High-Speed Incremental Portable Prolog Compiler, Kenneth A. Bowen, Kevin A. Buettner, Ilyas Cicekli, Andrew Turk

Electrical Engineering and Computer Science - Technical Reports

The design and implementation of a relatively portable Prolog compiler achieving 12K LIPS on the standard benchmark is described. The compiler is incremental and uses decompilation to implement retract, clause, and listing, as well as support the needs of its four-port debugger. The system supports modules, garbage collection, database pointers, and a full range of built-ins.

Method And Apparatus For Performing Hashing Operations Using Galois Field Multiplication, John L. Carter, George Markowsky, Mark N. Wegman

Computer Science Faculty Research & Creative Works

The invention comprises a method and apparatus for performing a hashing operation on an N bit number under control of a prespecified N bit hashing constant which comprises performing N/K finite field partial multiplications of the object to be hashed by the hashing constant, utilizing K logic and combinatorial circuits all of which operate in parallel to completely evaluate the number in N/K operations.

Another feature of the present invention is that the hashing constant loaded into the system may be changed at will with a resultant changing of the hashing characteristics to suit a particular class of objects to …

A Monte Carlo Analysis Of The Mincycle Algorithm For Generating Minimal Perfect Hash Functions, Pao-Po Hou, Thomas J. Sager

Computer Science Technical Reports

In this paper, several minimal perfect hashing function generating methods are examined. One of them, the mincycle method by Sager is evaluated by the Monte Carlo method. The results are represented in graphs and tables.

A Parallel Branch And Bound Algorithm For Integer Linear Programming Models, Rochelle L. Boehning, Billy E. Gillett

Computer Science Technical Reports

A parallel branch and bound algorithm is developed for use with MIMD computers to study the efficiency of parallel processors on general integer linear programming problems. The Haldi and IBM test problems and a System Design model are used in the implementation of the algorithm. Initially the algorithm solves the Haldi and IBM test problems on a single processor computer which simulates a multiple processor computer. The algorithm is then implemented on the Denelcor HEP multiprocessor using two of the IBM problems to compare the results of the simulation to the results using an MIMD computer. Finally the algorithm is …

Predicting Success In High School Computer Programming, John C. Gevedon

Graduate Theses and Dissertations

There are great differences in performance among students taking high school programming courses, and instructors debate over what elements contribute to these differences. Some students develop logical thinking abilities and problem solving techniques, while others fail to develop skills beyond memorization of specific terms and procedures. It is not known whether these differences are causally related to the specific educational environment or student backgrounds. Without more information, the factors that actually contribute to the success of high school students in computer programming courses cannot be accurately determined. It was the purpose of this study then to isolate certain student characteristics …

Development Of An On-Line Computer System For Cyclic Voltammetry Studies, Tai-Lee Leo Huo

Chemistry & Biochemistry Theses & Dissertations

An Apple II Plus microcomputer was interfaced to a PAR 174A Polarographic Analyser, an HP 7O4OA X-Y recorder and a three-electrode system. This on-line computer system was applied to Cyclic Voltammetry (CV) studies. The interfacing involved both hardware and software development. Various hardware components were used to amplify and transmit the analog signal both going into the computer and coming from the computer. Software programs were written for staircase waveform generation, data acquisition, and plotting the voltammograms obtained.

A package was designed for CV experiments to be used by the students in the instrumental analysis laboratory. This package contains several …

An Algorithm For Parallel Subsumption, Ralph M. Butler, Arlan R. Dekock

Computer Science Technical Reports

Many current automated theorem provers use a refutation procedure based on some version of the principle of resolution. These methods normally lead to the generation of large numbers of new clauses. Subsumption is a process that eliminates the superfluous clauses from the clause space, thus speeding up the proof. The research presented in this thesis is concerned with the design and implementation of a subsumption algorithm which exploits the parallelism provided by a multiprocessor. For portability, all coding is done in the programming language C. Monitors are used as the synchronization mechanism. Correct performance in both a multiprocessor and uniprocessor …

A Meta-Level Extension Of Prolog, Kenneth A. Bowen, Tobias Weinberg

Electrical Engineering and Computer Science - Technical Reports

Prolog has many attractive features as a programming tool for artificial intelligence. These include code that is easy to understand, programs that are easy to modify, and a clear relation between its logical and procedural semantics. Moreover, it has proved possible to create clear and efficient implementations. Nonetheless, we perceive several shortcomings. Chief among these is difficulty representing dynamic databases (databases which change in time) and an apparent restriction to backward chaining, backtracking, and depth-first search. Our intent in this paper is to present an extension to Prolog, called metaProlog, which preserves the virtues of Prolog while introducing powerful constructions …

Performance Analysis Of Network File Systems, Walter F. Tichy, Zuwang Ruan

Department of Computer Science Technical Reports

No abstract provided.

A Survey Of Program Design Languages (Pdls), Brian A. Nejmeh, Herbert E. Dunsmore

Department of Computer Science Technical Reports

No abstract provided.

The Tilde File Naming Scheme, Douglas E. Comer, Thomas P. Murtagh

Department of Computer Science Technical Reports

No abstract provided.

A Parallel Array Scanning Algorithm, Ralph M. Butler, Ralph W. Wilkerson

Computer Science Technical Reports

Suppose we are given a vector X of n real numbers and we want to find the maximum sum found in any contiguous subvector of X. In Jon Bentley's article [l] on algorithm design and technique, a simple vector scanning problem and a series of progressively more efficient algorithms to solve this problem were discussed in some detail. Clearly, any algorithm must visit each location of X at least once and consequently a lower bound on the running time for problem is 0(n), which is in fact attainable as Bentley’s paper illustrates. However, the original motivation for this problem was …

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.

• Whicker, Garth. Agriculture and the Development of Malaysia
• McGaha. Rape, Passion, Lechery, Usury, Incest, Murder and other Matters in The Ravenger's Tragedy
• Harrison, Robert. It was a Day of Very General Awakening . . : Reformation and Revival in Russellville, Kentucky
• King, Betty. An Affirmative Decision for James's Isabel Archer
• Sutton, Joyce. Sex Bias in Performance of Women
• Logsdon, Doug. Poe's Women
• Yoder, Nate. Emily Dickinson and Her Puritan Heritage
• Davis, Aleen. Jay …

Computer-Aided Normalizing And Unpacking: Some Interesting Machine-Processable Transformations Of Legal Rules, Layman E. Allen, Charles S. Saxon

Book Chapters

One way of dealing with an important aspect of the natural language barrier that researchers m artificial intelligence have been wrestling with for more than two decades is to normalize the expression of the logical structure of legal rules.

The computer program, NORMALIZER, will enable a legal analyst to automatically generate Normalized Versions of legal rules and Outlines of them from Parenthesized Logical Expressions of their structure and Marked Versions of the Original Text of the rules. In brief:

Parenthesized Logical Expression & Marked Version = = > Outline & Normalized Version.

The Parenthesized Logical Expression of a normalized rule is …

Computer-Based Graduate Programs For International Educators, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Industrial Simulation With Animation, Edward T. Hammerand

Masters Theses

"This thesis examines and evaluates the new simulation language PCModel. Prior to the arrival of PCModel, simulation via computer typically resulted in pages of statistics compiled over the duration of the simulation. PCModel's approach is to simulate the model on the display before the user in real time. Additionally, user interaction is supported to allow changes to be made throughout the simulation run.

The evaluation of PCModel is accomplished through inspection of a pair of examples already simulated in a conventional simulation language. The examples show the relative strong and weak points of the language, as well as demonstrating how …

Impacts Of Robotics And Flexible Manufacturing Technologies On Manufacturing Costs And Employment, Steven M. Miller

Research Collection School Of Computing and Information Systems

The issues analyzed in this paper are the extent to which unit costs and production labor requirements might be reduced in manufacturing industries if there is more widespread use of industrial robots and flexible systems. The analysis is reported in detail in Miller (1983). These issues are analyzed from two different perspectives. The technological focus of the first perspective is narrowly confined to the use of robotic manipulators. It is assumed that robotic manipulators will be “retrofitted” into existing production facilities without making major changes in the organization of production within the factory, other than modifying individual work stations so …

A Parallel Branch And Bound Algorithm For Integer Linear Programming Models, Rochelle L. Boehning

Doctoral Dissertations

"A parallel branch and bound algorithm is developed for use with MIMD computers to study the efficiency of parallel processors on general integer linear programming problems. The Haldi and IBM test problems and a System Design model are used in the implementation of the algorithm. Initially the algorithm solves the Haldi and IBM test problems on a single processor computer which simulates a multiple processor computer. The algorithm is then implemented on the Denelcor HEP multiprocessor using two of the IBM problems to compare the results of the simulation to the results using an MIMD computer. Finally the algorithm is …