Physical Sciences and Mathematics Commons^™

Towards Designing A Knowledge-Based Tutoring System : Sql-Tutor As An Example, Gang Zhou

Dissertations

A Knowledge-Based Tutoring System, also sometimes called an Intelligent Tutoring System, is a computer based instructional system that uses artificial intelligence techniques to help people learn some subject. The goal of the system is to provide private tutoring to its students based on their different backgrounds, requests, and interests. The system knows what subject materials it should teach, when and how to teach them, and can diagnose the mistakes made by the students and help them correct the mistakes.

The major objective of this dissertation is to investigate and develop a generic framework upon which we can build a Knowledge-Based …

Pattern Discovery In Sequence Databases : Algorithms And Applications To Dna/Protein Classification, Gung-Wei Chirn

Dissertations

Sequence databases comprise sequence data, which are linear structural descriptions of many natural entities. Approximate pattern discovery in a sequence database can lead to important conclusions or prediction of new phenomena. Traditional database technology is not suitable for accomplishing the task, and new techniques need to be developed.

In this dissertation, we propose several new techniques for discovering patterns in sequence databases. Our techniques incorporate pattern matching algorithms and novel heuristics for discovery and optimization. Experimental results of applying the techniques to both generated data and DNA/proteins show the effectiveness of the proposed techniques.

We then develop several classifiers using …

Knowledge Discovering For Document Classification Using Tree Matching In Texpros, Ching-Song Wei

Dissertations

This dissertation describes a knowledge-based system for classifying documents based upon the layout structure and conceptual information extracted from the content of the document. The spatial elements in a document are laid out in rectangular blocks which are represented by nodes in an ordered labelled tree, called the "layout structure tree" (L-S Tree). Each leaf node of a L-S Tree points to its corresponding block content. A knowledge Acquisition Tool (KAT) is devised to create a Document Sample Tree from L-S Tree, in which each of its leaves contains a node content conceptually describing its corresponding block content. Then, applying …

Integrating Hypertext With Information Systems Through Dynamic Mapping, Jiangling Wan

Dissertations

This dissertation presents a general hypertext model (GHMI) supporting integration of hypertext and information systems through dynamic mapping. Information systems integrated based on this model benefit from hypertext function-alities (such as linking, backtracking, history, guided tours, annotations, etc.) while preserving their own computation capabilities. Although systems supporting integration of hypertext and interface-oriented information systems do exist in hypertext literature, there is no existing model or system effectively supporting integration of hypertext and computation-oriented information systems. GHMI makes its major contributions by both extending and specifying the well-known Dexter Hypertext Reference Model. GHMI extends the Dexter model to overcome its limitations. …

Theory And Design Of Portable Parallel Programs For Heterogeneous Computing Systems And Networks, Ying-Chieh Wu

Dissertations

A recurring problem with high-performance computing is that advanced architectures generally achieve only a small fraction of their peak performance on many portions of real applications sets. The Amdahl's law corollary of this is that such architectures often spend most of their time on tasks (codes/algorithms and the data sets upon which they operate) for which they are unsuited. Heterogeneous Computing (HC) is needed in the mid 90's and beyond due to ever increasing super-speed requirements and the number of projects with these requirements. HC is defined as a special form of parallel and distributed computing that performs computations using …

Identifying And Exploiting Concurrency In Object-Based Real-Time Systems, Guohui Yu

Dissertations

The use of object-based mechanisms, i.e., abstract data types (ADTs), for constructing software systems can help to decrease development costs, increase understandability and increase maintainability. However, execution efficiency may be sacrificed due to the large number of procedure calls, and due to contention for shared ADTs in concurrent systems. Such inefficiencies are a concern in real-time applications that have stringent timing requirements. To address these issues, the potentially inefficient procedure calls are turned into a source of concurrency via asynchronous procedure calls (ARPCs), and contention for shared ADTS is reduced via ADT cloning. A framework for concurrency analysis in object-based …