UNT Theses and Dissertations - 237 Matching Results

Search Results

prev Results: 21 - 44 next
open access

A Comparative Analysis of Guided vs. Query-Based Intelligent Tutoring Systems (ITS) Using a Class-Entity-Relationship-Attribute (CERA) Knowledge Base

Description: One of the greatest problems facing researchers in the sub field of Artificial Intelligence known as Intelligent Tutoring Systems (ITS) is the selection of a knowledge base designs that will facilitate the modification of the knowledge base. The Class-Entity-Relationship-Attribute (CERA), proposed by R. P. Brazile, holds certain promise as a more generic knowledge base design framework upon which can be built robust and efficient ITS. This study has a twofold purpose. The first is to demonstrat… more
Date: August 1987
Creator: Hall, Douglas Lee
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Computer Realization of Human Music Cognition

Description: This study models the human process of music cognition on the digital computer. The definition of music cognition is derived from the work in music cognition done by the researchers Carol Krumhansl and Edward Kessler, and by Mari Jones, as well as from the music theories of Heinrich Schenker. The computer implementation functions in three stages. First, it translates a musical "performance" in the form of MIDI (Musical Instrument Digital Interface) messages into LISP structures. Second, the var… more
Date: August 1988
Creator: Albright, Larry E. (Larry Eugene)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Semaphore Solutions for General Mutual Exclusion Problems

Description: Automatic generation of starvation-free semaphore solutions to general mutual exclusion problems is discussed. A reduction approach is introduced for recognizing edge-solvable problems, together with an O(N^2) algorithm for graph reduction, where N is the number of nodes. An algorithm for the automatic generation of starvation-free edge-solvable solutions is presented. The solutions are proved to be very efficient. For general problems, there are two ways to generate efficient solutions. One as… more
Date: August 1988
Creator: Yue, Kwok B. (Kwok Bun)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Speech Recognition Using a Synthesized Codebook

Description: Speech sounds generated by a simple waveform synthesizer were used to create a vector quantization codebook for use in speech recognition. Recognition was tested over the TI-20 isolated word data base using a conventional DTW matching algorithm. Input speech was band limited to 300 - 3300 Hz, then passed through the Scott Instruments Corp. Coretechs process, implemented on a VET3 speech terminal, to create the speech representation for matching. Synthesized sounds were processed in software by … more
Date: August 1988
Creator: Smith, Lloyd A. (Lloyd Allen)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Computer Graphics Primitives and the Scan-Line Algorithm

Description: This paper presents the scan-line algorithm which has been implemented on the Lisp Machine. The scan-line algorithm resides beneath a library of primitive software routines which draw more fundamental objects: lines, triangles and rectangles. This routine, implemented in microcode, applies the A(BC)*D approach to word boundary alignments in order to create an extremely fast, efficient, and general purpose drawing primitive. The scan-line algorithm improves on previous methodologies by limiting … more
Date: December 1988
Creator: Myjak, Michael D. (Michael David)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

A C Navigational System

Description: The C Navigational System (CNS) is a proposed programming environment for the C programming language. The introduction covers the major influences of programming environments and the components of a programming environment. The system is designed to support the design, coding and maintenance phases of software development. CNS provides multiple views to both the source and documentation for a programming project. User-defined and system-defined links allow the source and documentation to be hie… more
Date: May 1989
Creator: Hammerquist, James D. (James Daniel)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Inheritance Problems in Object-Oriented Database

Description: This research is concerned with inheritance as used in object-oriented database. More specifically, partial bi-directional inheritance among classes is examined. In partial inheritance, a class can inherit a proper subset of instance variables from another class. Two subclasses of the same superclass do not need to inherit the same proper subset of instance variables from their superclass. Bi-directional partial inheritance allows a class to inherit instance variables from its subclass. The pro… more
Date: May 1989
Creator: Auepanwiriyakul, Raweewan
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Improving Digital Circuit Simulation: A Knowledge-Based Approach

Description: This project focuses on a prototype system architecture which integrates features of an event-driven gate-level simulator and features of the multiple expert system architecture, HEARSAY-II. Combining artificial intelligence and simulation techniques, a knowledge-based simulator was designed and constructed to model non-standard circuit behavior. This non-standard circuit behavior is amplified by advances in integrated circuit technology. Currently available digital circuit simulators can not s… more
Date: August 1989
Creator: Benavides, John A. (John Anthony)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Linear Unification

Description: Efficient unification is considered within the context of logic programming. Unification is explained in terms of equivalence classes made up of terms, where there is a constraint that no equivalence class may contain more than one function term. It is demonstrated that several well-known "efficient" but nonlinear unification algorithms continually maintain the said constraint as a consequence of their choice of data structure for representing equivalence classes. The linearity of the Paterson-… more
Date: December 1989
Creator: Wilbanks, John W. (John Winston)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

The Object-Oriented Database Editor

Description: Because of an interest in object-oriented database systems, designers have created systems to store and manipulate specific sets of abstract data types that belong to the real world environment they represent. Unfortunately, the advantage of these systems is also a disadvantage since no single object-oriented database system can be used for all applications. This paper describes an object-oriented database management system called the Object-oriented Database Editor (ODE) which overcomes this d… more
Date: December 1989
Creator: Coats, Sidney M. (Sidney Mark)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Concurrent Pattern Recognition and Optical Character Recognition

Description: The problem of interest as indicated is to develop a general purpose technique that is a combination of the structural approach, and an extension of the Finite Inductive Sequence (FI) technique. FI technology is pre-algebra, and deals with patterns for which an alphabet can be formulated.
Date: August 1991
Creator: An, Kyung Hee
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Efficient Parallel Algorithms and Data Structures Related to Trees

Description: The main contribution of this dissertation proposes a new paradigm, called the parentheses matching paradigm. It claims that this paradigm is well suited for designing efficient parallel algorithms for a broad class of nonnumeric problems. To demonstrate its applicability, we present three cost-optimal parallel algorithms for breadth-first traversal of general trees, sorting a special class of integers, and coloring an interval graph with the minimum number of colors.
Date: December 1991
Creator: Chen, Calvin Ching-Yuen
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

DRVBLD: a UNIX Device Driver Builder

Description: New peripheral devices are being developed at an ever increasing rate. Before such accessories can be used in the UNIX environment (UNIX is a trademark of Bell Laboratories), they must be able to communicate with the operating system. This involves writing a device driver for each device. In order to do this, very detailed knowledge is required of both the device to be integrated and the version of UNIX to which it will be attached. The process is long, detailed and prone to subtle problems and… more
Date: May 1992
Creator: Cano, Agustin F.
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

A Mechanism for Facilitating Temporal Reasoning in Discrete Event Simulation

Description: This research establishes the feasibility and potential utility of a software mechanism which employs artificial intelligence techniques to enhance the capabilities of standard discrete event simulators. As background, current methods of integrating artificial intelligence with simulation and relevant research are briefly reviewed.
Date: May 1992
Creator: Legge, Gaynor W.
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Using Extended Logic Programs to Formalize Commonsense Reasoning

Description: In this dissertation, we investigate how commonsense reasoning can be formalized by using extended logic programs. In this investigation, we first use extended logic programs to formalize inheritance hierarchies with exceptions by adopting McCarthy's simple abnormality formalism to express uncertain knowledge. In our representation, not only credulous reasoning can be performed but also the ambiguity-blocking inheritance and the ambiguity-propagating inheritance in skeptical reasoning are simul… more
Date: May 1992
Creator: Horng, Wen-Bing
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Using Normal Deduction Graphs in Common Sense Reasoning

Description: This investigation proposes a powerful formalization of common sense knowledge based on function-free normal deduction graphs (NDGs) which form a powerful tool for deriving Horn and non-Horn clauses without functions. Such formalization allows common sense reasoning since it has the ability to handle not only negative but also incomplete information.
Date: May 1992
Creator: Munoz, Ricardo A. (Ricardo Alberto)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Linearly Ordered Concurrent Data Structures on Hypercubes

Description: This thesis presents a simple method for the concurrent manipulation of linearly ordered data structures on hypercubes. The method is based on the existence of a pruned binomial search tree rooted at any arbitrary node of the binary hypercube. The tree spans any arbitrary sequence of n consecutive nodes containing the root, using a fan-out of at most [log₂ 𝑛] and a depth of [log₂ 𝑛] +1. Search trees spanning non-overlapping processor lists are formed using only local information, and can be use… more
Date: August 1992
Creator: John, Ajita
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

An Efficient Hybrid Heuristic and Probabilistic Model for the Gate Matrix Layout Problem in VLSI Design

Description: In this thesis, the gate matrix layout problem in VLSI design is considered where the goal is to minimize the number of tracks required to layout a given circuit and a taxonomy of approaches to its solution is presented. An efficient hybrid heuristic is also proposed for this combinatorial optimization problem, which is based on the combination of probabilistic hill-climbing technique and greedy method. This heuristic is tested experimentally with respect to four existing algorithms. As test ca… more
Date: August 1993
Creator: Bagchi, Tanuj
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design

Description: The goal of a parallel algorithm is to solve a single problem using multiple processors working together and to do so in an efficient manner. In this regard, there is a need to categorize strategies in order to solve broad classes of problems with similar structures and requirements. In this dissertation, two parallel algorithm design strategies are considered: linked list ranking and parentheses matching.
Date: December 1993
Creator: Halverson, Ranette Hudson
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Multiresolutional/Fractal Compression of Still and Moving Pictures

Description: The scope of the present dissertation is a deep lossy compression of still and moving grayscale pictures while maintaining their fidelity, with a specific goal of creating a working prototype of a software system for use in low bandwidth transmission of still satellite imagery and weather briefings with the best preservation of features considered important by the end user.
Date: December 1993
Creator: Kiselyov, Oleg E.
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Temporal Connectionist Expert Systems Using a Temporal Backpropagation Algorithm

Description: Representing time has been considered a general problem for artificial intelligence research for many years. More recently, the question of representing time has become increasingly important in representing human decision making process through connectionist expert systems. Because most human behaviors unfold over time, any attempt to represent expert performance, without considering its temporal nature, can often lead to incorrect results. A temporal feedforward neural network model that can … more
Date: December 1993
Creator: Civelek, Ferda N. (Ferda Nur)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

A Multi-Time Scale Learning Mechanism for Neuromimic Processing

Description: Learning and representing and reasoning about temporal relations, particularly causal relations, is a deep problem in artificial intelligence (AI). Learning such representations in the real world is complicated by the fact that phenomena are subject to multiple time scale influences and may operate with a strange attractor dynamic. This dissertation proposes a new computational learning mechanism, the adaptrode, which, used in a neuromimic processing architecture may help to solve some of these… more
Date: August 1994
Creator: Mobus, George E. (George Edward)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System

Description: The primary purpose of this work is to study, implement and analyze the performance of parallel algorithms related to subsequence problems. The problems include string to string correction problem, to determine the longest common subsequence problem and solving the sum-range-product, 1 —D pattern matching, longest non-decreasing (non-increasing) (LNS) and maximum positive subsequence (MPS) problems. The work also includes studying the techniques and issues involved in developing parallel applic… more
Date: August 1994
Creator: Pothuru, Surendra
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
Back to Top of Screen