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

Physical Sciences and Mathematics Commons

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

Articles 1 - 13 of 13

Full-Text Articles in Physical Sciences and Mathematics

New Topologies And Parallel Algorithms For Static Interconnection Networks., Srabani Sen Gupta Dr. Dec 1997

New Topologies And Parallel Algorithms For Static Interconnection Networks., Srabani Sen Gupta Dr.

Doctoral Theses

Many real-life applications in the areas of signal processing, image processing, etc., require a large amount of fast computations to be performed. Although high speed powerful processors are currently available due to the phenomenal advances in VLSI technology, the increasing demand for massive real-time computations can not be met just by a uniprocessor system. One way of achieving the goal of fast computation is through parallel processing. In parallel processing, a problem is broken into several subproblems, which are distributed among different processors so that each of the processors can perform its task simultaneously. Main areas of recent research in …


Concept Vectors: A Synthesis Of Concept Mapping And Matrices For Knowledge Representation In Intelligent Tutoring Systems, Mark L. Dyson Dec 1997

Concept Vectors: A Synthesis Of Concept Mapping And Matrices For Knowledge Representation In Intelligent Tutoring Systems, Mark L. Dyson

Theses and Dissertations

A review of the literature relating to intelligent tutoring systems (ITS) reveals that the bulk of research to date is focused on the student, and on methods for representing the knowledge itself. From student models to learning schemas to presentation methods, comparatively little attention has been paid to the problem of educators attempting to build viable lesson plans for use in an ITS environment--yet when this problem is addressed in the literature, it is recognized as a potentially daunting one. This thesis addresses the problem of ITS lesson plan development by proposing a practical, computable approach for knowledge engineering that …


Applications Of Unsupervised Clustering Algorithms To Aircraft Identification Using High Range Resolution Radar, Dzung Tri Pham Dec 1997

Applications Of Unsupervised Clustering Algorithms To Aircraft Identification Using High Range Resolution Radar, Dzung Tri Pham

Theses and Dissertations

Identification of aircraft from high range resolution (HRR) radar range profiles requires a database of information capturing the variability of the individual range profiles as a function of viewing aspect. This database can be a collection of individual signatures or a collection of average signatures distributed over the region of viewing aspect of interest. An efficient database is one which captures the intrinsic variability of the HRR signatures without either excessive redundancy typical of single-signature databases, or without the loss of information common when averaging arbitrary groups of signatures. The identification of 'natural' clustering of similar HRR signatures provides a …


Displacement Of The Earth's Bow Shock And Magnetopause Due To An Impinging Interplanetary Shock Wave, William A. Olson Dec 1997

Displacement Of The Earth's Bow Shock And Magnetopause Due To An Impinging Interplanetary Shock Wave, William A. Olson

Theses and Dissertations

Interplanetary shock waves (ISWs) propagating through the solar wind can collide with the earth's bow shock, resulting in a series of new shocks, contact discontinuities, and rarefaction waves which interact to effectively move the bow shock and magnetopause toward the earth. A one dimensional MacCormack predictor corrector algorithm with Flux Corrected Transport (FCT) was developed to model the ISW bow shock and magnetopause interactions, and to numerically predict their propagation speeds after collision. Analytic relationships for the Mach numbers and propagation speeds of the generated shock waves and contact discontinuities were used to validate the model and to compare numerical …


Modeling And Simulation Support For Parallel Algorithms In A High-Speed Network, Dustin E. Yates Dec 1997

Modeling And Simulation Support For Parallel Algorithms In A High-Speed Network, Dustin E. Yates

Theses and Dissertations

This thesis investigates the ability of a simulation model to compare and contrast parallel processing algorithms in a high-speed network. The model extends existing modeling, analysis, and comparison of parallel algorithms by providing graphics based components that facilitate the measurement of system resources. Simulation components are based on the Myrinet local area network standard. The models provide seven different topologies to contrast the performance of five variations of Fast Fourier Transform (FFT) algorithms. Furthermore, the models were implemented using a commercially developed product that facilitates the testing of additional topologies and the investigation of hardware variations. Accurate comparisons are statistically …


A Single Chip Low Power Implementation Of An Asynchronous Fft Algorithm For Space Applications, Bruce W. Hunt Dec 1997

A Single Chip Low Power Implementation Of An Asynchronous Fft Algorithm For Space Applications, Bruce W. Hunt

Theses and Dissertations

A fully asynchronous fixed point FFT processor is introduced for low power space applications. The architecture is based on an algorithm developed by Suter and Stevens specifically for a low power implementation. The novelty of this architecture lies in its high localization of components and pipelining with no need to share a global memory. High throughput is attained using large numbers of small, local components working in parallel. A derivation of the algorithm from the discrete Fourier transform is presented followed by a discussion of circuit design parameters specifically, those relevant to space applications. The generic architecture is explained with …


Atmospheric Turbulence Scintillation Effects On Wavefront Tilt Estimation, James A. Louthain Dec 1997

Atmospheric Turbulence Scintillation Effects On Wavefront Tilt Estimation, James A. Louthain

Theses and Dissertations

A new atmospheric turbulence screen generator is developed for use in performance calculations of adaptive optics systems valid over a wide range of atmospheric turbulence parameters. The screen generator accounts for diffraction effects caused by weak turbulence and incorporates the phase, amplitude, and cross statistics of the perturbed optical field. The wavefront's phase and amplitude perturbations are taken from the correlation functions developed by Lee and Harp and the cross correlation of the phase and amplitude derived in this thesis. The screen generator uses a modal representation to perform a Fourier series expansion of the wavefront phase and amplitude over …


On Cvt Minimization In Single Machine Scheduling., D. K. Manna Dr. Feb 1997

On Cvt Minimization In Single Machine Scheduling., D. K. Manna Dr.

Doctoral Theses

Scheduling problens are quite common in real life. They arise whenever there is a need to plan execution of various tasks over time and therefore they play very important roles in commercial set-ups concerning manufacturing or service in the optimal use of resources and/or customers satisfaction. The theory of scheduling deals with the construction of suitable models and their analyses. Researchersattention was drawn to the study of scheduling problems using mathematical modeling, probably for the first time when Johnson (1954] published his famous work on flowshop problem. Since then, the study of scheduling problem and its context has gradually attracted …


Random Number Generators For Parallel Computers, Paul D. Coddington Jan 1997

Random Number Generators For Parallel Computers, Paul D. Coddington

Northeast Parallel Architecture Center

Random number generators are used in many applications, from slot machines to simulations of nuclear reactors. For many computational science applications, such as Monte Carlo simulation, it is crucial that the generators have good randomness properties. This is particularly true for large-scale simulations done on high-performance parallel computers. Good random number generators are hard to find, and many widely-used techniques have been shown to be inadequate. Finding high-quality, efficient algorithms for random number generation on parallel computers is even more difficult. Here we present a review of the most commonly-used random number generators for parallel computers, and evaluate each generator …


A Compiler Algorithm For Optimizing Locality In Loop Nests, Mahmut Kandemir, J. Ramanujam, Alok Choudhary Jan 1997

A Compiler Algorithm For Optimizing Locality In Loop Nests, Mahmut Kandemir, J. Ramanujam, Alok Choudhary

Electrical Engineering and Computer Science - All Scholarship

This paper describes an algorithm to optimize cache locality in scientific codes on uniprocessor and multiprocessor machines. A distinctive characteristic of our algorithm is that it considers loop and data layout transformations in a unified framework. We illustrate through examples that our approach is very effective at reducing cache misses and tile size sensitivity of blocked loop nests; and can optimize nests for which optimization techniques based on loop transformations alone are not successful. An important special case is the one in which data layouts of some arrays are fixed and cannot be changed. We show how our algorithm can …


On The Computational Complexity Of The Lbg And Pnn Algorithms, Jamshid Shanbehzadeh, Philip Ogunbona Jan 1997

On The Computational Complexity Of The Lbg And Pnn Algorithms, Jamshid Shanbehzadeh, Philip Ogunbona

Faculty of Informatics - Papers (Archive)

This correspondence compares the computational complexity of the pair-wise nearest neighbor (PNN) and Linde–Buzo–Gray (LBG) algorithms by deriving analytical expressions for their computational times. It is shown that for a practical codebook size and training vector sequence, the LBG algorithm is indeed more computationally efficient than the PNN algorithm.


Adaptive Multicast Routing In Wormhole Networks, Ran Libeskind-Hadas, Tom Hehre '96, Andrew Hutchings '98, Mark Reyes '98, Kevin Watkins '97 Jan 1997

Adaptive Multicast Routing In Wormhole Networks, Ran Libeskind-Hadas, Tom Hehre '96, Andrew Hutchings '98, Mark Reyes '98, Kevin Watkins '97

All HMC Faculty Publications and Research

Multicast communication has applications in a number of fundamental operations in parallel computing. An effective multicast routing algorithm must be free from both livelock and deadlock while minimizing communication latency. We describe two classes of multicast wormhole routing algorithms that employ the multi-destination wormhole hardware mechanism proposed by Lin et al. [12] and Panda et al. [17]. Specific examples of these classes of algorithms are described and experimental results suggests that such algorithms enjoy low communication latencies across a range of network loads.


Efficient Implementation Of Image Compression-Postprocessing Algorithm Using A Digital Signal Processor, Nadir Sinaceur Jan 1997

Efficient Implementation Of Image Compression-Postprocessing Algorithm Using A Digital Signal Processor, Nadir Sinaceur

Dissertations and Theses

In this thesis, an attempt has been made to develop a fast way to implement a post-processing algorithm for image compression. All the previous tests for this postprocessing algorithm, which we will present, have been only software based and did not consider the time parameter.

For this purpose a new algorithm is used to compute the 2-D DCT transform. This change made the process a lot faster on a Spare 5 workstation. We have then decided to further increase the speed of the post-processing scheme by implementing it on the ADSP21020 chip.

The results show that such a chip can …