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

Computer Sciences Commons

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

Articles 1 - 5 of 5

Full-Text Articles in Computer Sciences

Analysis Of Algorithms For Online Routing And Scheduling In Networks, Jessen Tait Havill Jan 1998

Analysis Of Algorithms For Online Routing And Scheduling In Networks, Jessen Tait Havill

Dissertations, Theses, and Masters Projects

We study situations in which an algorithm must make decisions about how to best route and schedule data transfer requests in a communication network before each transfer leaves its source. For some situations, such as those requiring quality of service guarantees, this is essential. For other situations, doing work in advance can simplify decisions in transit and increase the speed of the network. In order to reflect realistic scenarios, we require that our algorithms be online, or make their decisions without knowing future requests. We measure the efficiency of an online algorithm by its competitive ratio, which is the maximum …


Wavelet-Based Digital Image Restoration, Viviana Sandor Jan 1998

Wavelet-Based Digital Image Restoration, Viviana Sandor

Dissertations, Theses, and Masters Projects

Digital image restoration is a fundamental image processing problem with underlying physical motivations. A digital imaging system is unable to generate a continuum of ideal pointwise measurements of the input scene. Instead, the acquired digital image is an array of measured values. Generally, algorithms can be developed to remove a significant part of the error associated with these measure image values provided a proper model of the image acquisition system is used as the basis for the algorithm development. The continuous/discrete/continuous (C/D/C) model has proven to be a better alternative compared to the relatively incomplete image acquisition models commonly used …


A Probability Programming Language: Development And Applications, Andrew Gordon Glen Jan 1998

A Probability Programming Language: Development And Applications, Andrew Gordon Glen

Dissertations, Theses, and Masters Projects

A probability programming language is developed and presented; applications illustrate its use. Algorithms and generalized theorems used in probability are encapsulated into a programming environment with the computer algebra system Maple to provide the applied community with automated probability capabilities. Algorithms of procedures are presented and explained, including detailed presentations on three of the most significant procedures. Applications that encompass a wide range of applied topics including goodness-of-fit testing, probabilistic modeling, central limit theorem augmentation, generation of mathematical resources, and estimation are presented.


Improvements To The Color Quantization Process, Rance David Necaise Jan 1998

Improvements To The Color Quantization Process, Rance David Necaise

Dissertations, Theses, and Masters Projects

The presentation of color images on devices with limited color capabilities requires a reduction in the number of colors contained in the images. Color image quantization is the process of reducing the number of colors used in an image while maintaining its appearance as much as possible. This reduction is performed using a color image quantization algorithm. The quantization algorithm attempts to select k colors that best represent the contents of the image. The original image is then recolored using the representative colors. to improve the resulting image, a dithering process can be used in place of the recoloring.;This dissertation …


Exploiting Cache Locality At Run-Time, Yong Yan Jan 1998

Exploiting Cache Locality At Run-Time, Yong Yan

Dissertations, Theses, and Masters Projects

With the increasing gap between the speeds of the processor and memory system, memory access has become a major performance bottleneck in modern computer systems. Recently, Symmetric Multi-Processor (SMP) systems have emerged as a major class of high-performance platforms. Improving the memory performance of Parallel applications with dynamic memory-access patterns on Symmetric Multi-Processors (SMP) is a hard problem. The solution to this problem is critical to the successful use of the SMP systems because dynamic memory-access patterns occur in many real-world applications. This dissertation is aimed at solving this problem.;Based on a rigorous analysis of cache-locality optimization, we propose a …