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

Digital Commons Network

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

UNLV Retrospective Theses & Dissertations

Theses/Dissertations

1995

Algorithms

Articles 1 - 3 of 3

Full-Text Articles in Entire DC Network

Self-Stabilizing Sorting Algorithms, Joseph Chacko Jan 1995

Self-Stabilizing Sorting Algorithms, Joseph Chacko

UNLV Retrospective Theses & Dissertations

A distributed system consists of a set of machines which do not share a global memory. Depending on the connectivity of the network, each machine gets a partial view of the global state. Transient failures in one area of the network may go unnoticed in other areas and may cause the system to go to an illegal global state. However, if the system were self-stabilizing, it would be guaranteed that regardless of the current state, the system would recover to a legal configuration in a finite number of moves; The traditional way of creating reliable systems is to make redundant …


Adaptive Sorting Algorithms For Evaluation Of Automatic Zoning, G. S Rajarathinam Jan 1995

Adaptive Sorting Algorithms For Evaluation Of Automatic Zoning, G. S Rajarathinam

UNLV Retrospective Theses & Dissertations

Optical Character Recognition (OCR) involves analysis of machine-printed and hand written document images. The first step in an OCR process is to locate the text to be recognized on a page. An OCR device tries to identify the characters in these text regions and outputs the characters in ASCII. To evaluate the performance of any OCR device, the ASCII output of the OCR device is compared with the ground truth text which is entered into the computer manually; Some OCR devices provide the users with automatic zoning. The output of any automatic zoning algorithm has to be corrected manually to …


Self-Stabilizing Tree Algorithms, Visalakshi Thiagarajan Jan 1995

Self-Stabilizing Tree Algorithms, Visalakshi Thiagarajan

UNLV Retrospective Theses & Dissertations

Designers of distributed algorithms have to contend with the problem of making the algorithms tolerant to several forms of coordination loss, primarily faulty initialization. The processes in a distributed system do not share a global memory and can only get a partial view of the global state. Transient failures in one part of the system may go unnoticed in other parts and thus cause the system to go into an illegal state. If the system were self-stabilizing, however, it is guaranteed that it will return to a legal state after a finite number of state transitions. This thesis presents and …