6 Matching Results

Search Results

Results: 1 - 6
open access

Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation

Description: Discrete event simulation is an important tool for modeling and analysis. Some of the simulation applications such as telecommunication network performance, VLSI logic circuits design, battlefield simulation, require enormous amount of computing resources. One way to satisfy this demand for computing power is to decompose the simulation system into several logical processes (Ip) and run them concurrently. In any parallel discrete event simulation (PDES) system, the events are ordered according … more
Date: May 1996
Creator: Sarkar, Falguni
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Performance Study of Concurrent Search Trees and Hash Algorithms on Multiprocessors Systems

Description: This study examines the performance of concurrent algorithms for B-trees and linear hashing. B-trees are widely used as an access method for large, single key, database files, stored in lexicographic order on secondary storage devices. Linear hashing is a fast and reliable hash algorithm, suitable for accessing records stored unordered in buckets. This dissertation presents performance results on implementations of concurrent Bunk-tree and linear hashing algorithms, using lock-based, partitione… more
Date: May 1996
Creator: Demuynck, Marie-Anne
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Symplectic Integration of Nonseparable Hamiltonian Systems

Description: Numerical methods are usually necessary in solving Hamiltonian systems since there is often no closed-form solution. By utilizing a general property of Hamiltonians, namely the symplectic property, all of the qualities of the system may be preserved for indefinitely long integration times because all of the integral (Poincare) invariants are conserved. This allows for more reliable results and frequently leads to significantly shorter execution times as compared to conventional methods. The res… more
Date: May 1996
Creator: Curry, David M. (David Mason)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Automatic Speech Recognition Using Finite Inductive Sequences

Description: This dissertation addresses the general problem of recognition of acoustic signals which may be derived from speech, sonar, or acoustic phenomena. The specific problem of recognizing speech is the main focus of this research. The intention is to design a recognition system for a definite number of discrete words. For this purpose specifically, eight isolated words from the T1MIT database are selected. Four medium length words "greasy," "dark," "wash," and "water" are used. In addition, four sho… more
Date: August 1996
Creator: Cherri, Mona Youssef, 1956-
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Practical Parallel Processing

Description: The physical limitations of uniprocessors and the real-time requirements of numerous practical applications have made parallel processing an essential technology in military, industry and scientific research. In this dissertation, we investigate parallelizations of three practical applications using three parallel machine models. The algorithms are: Finitely inductive (FI) sequence processing is a pattern recognition technique used in many fields. We first propose four parallel FI algorithms o… more
Date: August 1996
Creator: Zhang, Hua, 1954-
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

A Machine Learning Method Suitable for Dynamic Domains

Description: The efficacy of a machine learning technique is domain dependent. Some machine learning techniques work very well for certain domains but are ill-suited for other domains. One area that is of real-world concern is the flexibility with which machine learning techniques can adapt to dynamic domains. Currently, there are no known reports of any system that can learn dynamic domains, short of starting over (i.e., re-running the program). Starting over is neither time nor cost efficient for real-wor… more
Date: July 1996
Creator: Rowe, Michael C. (Michael Charles)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
Back to Top of Screen