Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Dissertations

Discipline
Institution
Keyword
Publication Year
Publication Type

Articles 541 - 568 of 568

Full-Text Articles in Computer Sciences

Multi-Wavelength Infrared Imaging Computer Systems And Applications, Jun Li May 1997

Multi-Wavelength Infrared Imaging Computer Systems And Applications, Jun Li

Dissertations

This dissertation presents the development of three computer systems for multi-wavelength thermal imaging.

Two computer systems were developed for the multi-wavelength imaging pyrometers (M-WIPs) that yield non-contact temperature measurements by remotely sensing the surface of objects with unknown wavelength-dependent emissivity. These M-WIP computer systems represent the state-of-art development in remote temperature measurement system based on the multi-wavelength approach. The dissertation research includes M-WIP computer system integration, software development, performance evaluation, and also applications in monitoring and control of temperature distribution of silicon wafers in a rapid thermal process system.

The two M-WIPs are capable of data acquisition, signal processing, system …


High Speed Protocols For Dual Bus And Dual Ring Network Architectures, Yaling Zhou May 1997

High Speed Protocols For Dual Bus And Dual Ring Network Architectures, Yaling Zhou

Dissertations

In this dissertation, two channel access mechanisms providing fair and bandwidth efficient transmission on dual bus and dual ring networks with high bandwidth-latency product are proposed. In addition, two effective priority mechanisms are introduced to meet the throughput and delay requirements of the diverse arrays of applications that future high speed networks must support.

For dual bus architectures, the Buffer Insertion Bandwidth Balancing (BI_BWB) mechanism and the Preemptive priority Bandwidth Balancing (P_BI_BWB) mechanism are proposed. BI_BWB can significantly improve the delay performance of remote stations. It achieves that by providing each station with a shift register into which the station …


On Document Filing Based Upon Predicates, Zhijian Zhu May 1997

On Document Filing Based Upon Predicates, Zhijian Zhu

Dissertations

This dissertation presents a formal approach to modeling documents in a personal office environment, proposes a heterogeneous algebraic query language to manipulating objects (folders) in the document model, and investigates a predicate-driven document filing system for automatically filing documents.

The document model was initially proposed in [38] which adopts a very natural view for describing the office documents using the relational and object-oriented paradigms. The model employs a dual approach to classifying and categorizing office documents by defining both a document type hierarchy and a folder organization. This dissertation extends and specifies formally the document model. Documents are partitioned into …


Least Space-Time First Scheduling Algorithm : Scheduling Complex Tasks With Hard Deadline On Parallel Machines, Bo-Chao Cheng Jan 1997

Least Space-Time First Scheduling Algorithm : Scheduling Complex Tasks With Hard Deadline On Parallel Machines, Bo-Chao Cheng

Dissertations

Both time constraints and logical correctness are essential to real-time systems and failure to specify and observe a time constraint may result in disaster. Two orthogonal issues arise in the design and analysis of real-time systems: one is the specification of the system, and the semantic model describing the properties of real-time programs; the other is the scheduling and allocation of resources that may be shared by real-time program modules.

The problem of scheduling tasks with precedence and timing constraints onto a set of processors in a way that minimizes maximum tardiness is here considered. A new scheduling heuristic, Least …


Safe Code Transfromations For Speculative Execution In Real-Time Systems, Mohamed Mohamed Younis Jan 1997

Safe Code Transfromations For Speculative Execution In Real-Time Systems, Mohamed Mohamed Younis

Dissertations

Although compiler optimization techniques are standard and successful in non-real-time systems, if naively applied, they can destroy safety guarantees and deadlines in hard real-time systems. For this reason, real-time systems developers have tended to avoid automatic compiler optimization of their code. However, real-time applications in several areas have been growing substantially in size and complexity in recent years. This size and complexity makes it impossible for real-time programmers to write optimal code, and consequently indicates a need for compiler optimization. Recently researchers have developed or modified analyses and transformations to improve performance without degrading worst-case execution times. Moreover, these optimization …


Massively Parallel Reasoning In Transitive Relationship Hierarchies, Yugyung Lee Jan 1997

Massively Parallel Reasoning In Transitive Relationship Hierarchies, Yugyung Lee

Dissertations

This research focuses on building a parallel knowledge representation and reasoning system for the purpose of making progress in realizing human-like intelligence. To achieve human-like intelligence, it is necessary to model human reasoning processes by programs. Knowledge in the real world is huge in size, complex in structure, and is also constantly changing even in limited domains. Unfortunately, reasoning algorithms are very often intractable, which means that they are too slow for any practical applications. One technique to deal with this problem is to design special-purpose reasoners. Many past Al systems have worked rather nicely for limited problem sizes, but …


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

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 May 1996

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 May 1996

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 May 1996

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 May 1996

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 Jan 1996

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 …


Automatic Visual Recognition Using Parallel Machines, Yui-Liang Chen Oct 1995

Automatic Visual Recognition Using Parallel Machines, Yui-Liang Chen

Dissertations

Invariant features and quick matching algorithms are two major concerns in the area of automatic visual recognition. The former reduces the size of an established model database, and the latter shortens the computation time. This dissertation, will discussed both line invariants under perspective projection and parallel implementation of a dynamic programming technique for shape recognition. The feasibility of using parallel machines can be demonstrated through the dramatically reduced time complexity.

In this dissertation, our algorithms are implemented on the AP1000 MIMD parallel machines. For processing an object with a features, the time complexity of the proposed parallel algorithm is O(n) …


Automatic Office Document Classification And Information Extraction, Xiaolong Hao Oct 1995

Automatic Office Document Classification And Information Extraction, Xiaolong Hao

Dissertations

TEXPR.OS (TEXt PROcessing System) is a document processing system (DPS) to support and assist office workers in their daily work in dealing with information and document management. In this thesis, document classification and information extraction, which are two of the major functional capabilities in TEXPROS, are investigated.

Based on the nature of its content, a document is divided into structured and unstructured (i.e., of free text) parts. The conceptual and content structures are introduced to capture the semantics of the structured and unstructured part of the document respectively. The document is classified and information is extracted based on the analyses …


Mapping Of Portable Parallel Programs, Song Chen May 1995

Mapping Of Portable Parallel Programs, Song Chen

Dissertations

An efficient parallel program designed for a parallel architecture includes a detailed outline of accurate assignments of concurrent computations onto processors, and data transfers onto communication links, such that the overall execution time is minimized. This process may be complex depending on the application task and the target multiprocessor architecture. Furthermore, this process is to be repeated for every different architecture even though the application task may be the same. Consequently, this has a major impact on the ever increasing cost of software development for multiprocessor systems. A remedy for this problem would be to design portable parallel programs which …


Document Preprocessing And Fuzzy Unsupervised Character Classification, Shy-Shyan Chen May 1995

Document Preprocessing And Fuzzy Unsupervised Character Classification, Shy-Shyan Chen

Dissertations

This dissertation presents document preprocessing and fuzzy unsupervised character classification for automatically reading daily-received office documents that have complex layout structures, such as multiple columns and mixed-mode contents of texts, graphics and half-tone pictures. First, the block segmentation algorithm is performed based on a simple two-step run-length smoothing to decompose a document into single-mode blocks. Next, the block classification is performed based on the clustering rules to classify each block into one of the types such as text, horizontal or vertical lines, graphics, and pictures. The mean white-to-black transition is shown as an invariance for textual blocks, and is useful …


Visual Pattern Recognition Using Neural Networks, Jenlong Moh May 1995

Visual Pattern Recognition Using Neural Networks, Jenlong Moh

Dissertations

Neural networks have been widely studied in a number of fields, such as neural architectures, neurobiology, statistics of neural network and pattern classification. In the field of pattern classification, neural network models are applied on numerous applications, for instance, character recognition, speech recognition, and object recognition. Among these, character recognition is commonly used to illustrate the feature and classification characteristics of neural networks.

In this dissertation, the theoretical foundations of artificial neural networks are first reviewed and existing neural models are studied. The Adaptive Resonance Theory (ART) model is improved to achieve more reasonable classification results. Experiments in applying the …


An Office Document Retrieval System With The Capability Of Processing Incomplete And Vague Queries, Qianhong Liu Oct 1994

An Office Document Retrieval System With The Capability Of Processing Incomplete And Vague Queries, Qianhong Liu

Dissertations

TEXPROS (TEXt PROcessing System) is an intelligent document processing system. The system is a combination of filing and retrieval systems, which supports storing, classifying, categorizing, retrieving and reproducing documents, as well as extracting, browsing, retrieving and synthesizing information from a variety of documents. This dissertation presents a retrieval system for TEXPROS, which is capable of processing incomplete or vague queries and providing semantically meaningful responses to the users. The design of the retrieval system is highly integrated with various mechanisms for achieving these goals. First, a system catalog including a thesaurus is used to store the knowledge about the database. …


Methodology For Modeling High Performance Distributed And Parallel Systems, Rakesh Kushwaha Oct 1993

Methodology For Modeling High Performance Distributed And Parallel Systems, Rakesh Kushwaha

Dissertations

Performance modeling of distributed and parallel systems is of considerable importance to the high performance computing community. To achieve high performance, proper task or process assignment and data or file allocation among processing sites is essential. This dissertation describes an elegant approach to model distributed and parallel systems, which combines the optimal static solutions for data allocation with dynamic policies for task assignment. A performance-efficient system model is developed using analytical tools and techniques.

The system model is accomplished in three steps. First, the basic client-server model which allows only data transfer is evaluated. A prediction and evaluation method is …


A Comprehensive Part Model And Graphical Schema Representation For Object-Oriented Databases, Michael H. Halper Oct 1993

A Comprehensive Part Model And Graphical Schema Representation For Object-Oriented Databases, Michael H. Halper

Dissertations

Part-whole modeling plays an important role in the development of database schemata in data-intensive application domains such as manufacturing, design, computer graphics. text document processing, and so on. Object-oriented databases (OODBs) have been targeted for use in such areas. Thus, it is essential that OODBs incorporate a part relationship as one of their modeling primitives. In this dissertation, we present a comprehensive OODB part model which expands the boundaries of OODB part-whole modeling along three fronts. First, it identifies and codifies new semantics for the OODB part relationship. Second, it provides two novel realizations for part relationships and their associated …


Morphological Operations In Image Processing And Analysis, Chamim Christopher Pu Oct 1993

Morphological Operations In Image Processing And Analysis, Chamim Christopher Pu

Dissertations

Morphological operations applied in image processing and analysis are becoming increasingly important in today's technology. Morphological operations which are based on set theory, can extract object features by suitable shape (structuring elements). Morphological filters are combinations of morphological operations that transform an image into a quantitative description of its geometrical structure which based on structuring elements. Important applications of morphological operations are shape description, shape recognition, nonlinear filtering, industrial parts inspection, and medical image processing.

In this dissertation, basic morphological operations are reviewed, algorithms and theorems are presented for solving problems in distance transformation, skeletonization, recognition, and nonlinear filtering. A …


Medium Access Control Mechanisms For High Speed Metropolitan Area Networks, Michail Papamichail Oct 1993

Medium Access Control Mechanisms For High Speed Metropolitan Area Networks, Michail Papamichail

Dissertations

In this dissertation novel Medium Access Control mechanisms for High Speed Metropolitan Area networks are proposed and their performance is investigated under the presence of single and multiple priority classes of traffic. The proposed mechanisms are based on the Distributed Queue Dual Bus network, which has been adopted by the IEEE standardization committee as the 802.6 standard for Metropolitan Area Networks, and address most of its performance limitations. First, the Rotating Slot Generator scheme is introduced which uses the looped bus architecture that has been proposed for the 802.6 network. According to this scheme the responsibility for generating slots moves …


Algorithms For Generation Of Path-Methods In Object-Oriented Databases, Ashish Mehta May 1993

Algorithms For Generation Of Path-Methods In Object-Oriented Databases, Ashish Mehta

Dissertations

A path-method is a mechanism in object-oriented databases (OODBs) to retrieve or to update information relevant to one class that is not stored with that class but with some other class. A path-method is a method which traverses from one class through a chain of connections between classes to access information at another class. However, it is a difficult task for a user to write path-methods, because it might require comprehensive knowledge of many classes of the conceptual schema, while a typical user has often incomplete or even inconsistent knowledge of the schema.

This dissertation proposes an approach to the …


Dmodel And Dalgebra : A Data Model And Algebra For Office Documents, Fortune Solani Mhlanga May 1993

Dmodel And Dalgebra : A Data Model And Algebra For Office Documents, Fortune Solani Mhlanga

Dissertations

This dissertation presents a data model (called D_model) and an algebra (called D_ algebra) for office documents. The data model adopts a very natural view of modeling office documents. Documents are grouped into classes; each class is characterized by a "frame template", which describes the properties (or attributes) for the class of documents. A frame template is instantiated by providing it with values to form a "frame instance" which becomes the synopsis of the document of the class associated with the frame template. Different frame instances can be grouped into a folder. Therefore, a folder is a set of frame …


Megsdf Mega-System Development Framework, Tamar Zemel May 1993

Megsdf Mega-System Development Framework, Tamar Zemel

Dissertations

A framework for developing large, complex software systems, called Mega-Systems, is specified. The framework incorporates engineering, managerial, and technological aspects of development, concentrating on an engineering process. MegSDF proposes developing Mega-Systems as open distributed systems, pre-planned to be integrated with other systems, and designed for change.

At the management level, MegSDF divides the development of a Mega-System into multiple coordinated projects, distinguishing between a meta-management for the whole development effort, responsible for long-term, global objectives, and local managements for the smaller projects, responsible for local, temporary objectives.

At the engineering level, MegSDF defines a process model which specifies the tasks …


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

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, …


Graph And Directed Graph Augmentation Problems, Zhuguo Mo Jun 1988

Graph And Directed Graph Augmentation Problems, Zhuguo Mo

Dissertations

No abstract provided.


Parameter Optimization Using A Hierarchical System Of Learning Automata, Brian T. Mitchell Aug 1983

Parameter Optimization Using A Hierarchical System Of Learning Automata, Brian T. Mitchell

Dissertations

Many problems in adaptive control, pattern recognition, filtering, identification, and artificial intelligence can be viewed as parameter optimization problems. The learning automation approach to these problems has two distinct advantages over the classic hill climbing methods: (1) the parameter space need not be metric and (2) a global rather than local optimum can be found. Unfortunately, these advantages do not come without corresponding difficulties, namely the problem of high dimensionality. A hierarchical system of learning automata has been used to reduce this problem somewhat, but inefficiencies still remain since the current hierarchical system was balanced and static hierarchical learning automaton …