Physical Sciences and Mathematics Commons^™

Investigating Real-Time Sonar Performance Predictions Using Beowulf Clustering, Charles Lane Cartledge

Computer Science Theses & Dissertations

Predicting sonar performance, critical to using any sonar to its maximum effectiveness, is computationally intensive and typically the results are based on data from the past and may not be applicable to the current water conditions. This paper discusses how Beowulf clustering techniques were investigated and applied to achieve real-time sonar performance prediction capabilities based on commercially off the shelf (COTS) hardware and software. A sonar system measures ambient noise in real-time. Based on the active sonar range scale, new ambient measurements can be available every 1 to 24 seconds. Traditional sonar performance prediction techniques operated serially and often took …

Multiple Streams Synchronization In Collaborative Multimedia Systems, Emilia Stoica

Computer Science Theses & Dissertations

With the recent increase of the communication bandwidth and processor power, new types of applications have emerged. Among them, there are multimedia application, in which users are able to control, combine, and manipulate different types of media, such as text, sound, video, computer graphics, and animation. A key requirement in any multimedia application is to synchronize the delivery of various media streams to the user. To achieve this, the sender has to provide the temporal relations between the streams as they are captured. Since the receiver uses this information in streams presentation, its accuracy is very important.

Our main contribution …

Visibility-Related Problems On Parallel Computational Models, Himabindu Gurla

Computer Science Theses & Dissertations

Visibility-related problems find applications in seemingly unrelated and diverse fields such as computer graphics, scene analysis, robotics and VLSI design. While there are common threads running through these problems, most existing solutions do not exploit these commonalities. With this in mind, this thesis identifies these common threads and provides a unified approach to solve these problems and develops solutions that can be viewed as template algorithms for an abstract computational model. A template algorithm provides an architecture independent solution for a problem, from which solutions can be generated for diverse computational models. In particular, the template algorithms presented in this …

Indifference Graphs And The Single Row Routing Problem, Peter J. Looges

Computer Science Theses & Dissertations

This thesis investigates the subclass of interval graphs known as indifference graphs. New optimal algorithms for recognition, center, diameter, maximum matching, Hamiltonian path and domination in indifference graphs are presented. The recognition algorithm produces a linear order with properties which allow the solution of the other problems in linear time. Indifference graphs are further applied to the single row routing problem which results in both sequential,. and parallel routing algorithms.