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

Physical Sciences and Mathematics Commons

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

Articles 1 - 5 of 5

Full-Text Articles in Physical Sciences and Mathematics

Three--Dimensional Medical Imaging: Algorithms And Computer Systems, M. R. Stytz, G. Frieder, O. Frieder Jan 1991

Three--Dimensional Medical Imaging: Algorithms And Computer Systems, M. R. Stytz, G. Frieder, O. Frieder

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

This paper presents an introduction to the field of three-dimensional medical imaging It presents medical imaging terms and concepts, summarizes the basic operations performed in three-dimensional medical imaging, and describes sample algorithms for accomplishing these operations. The paper contains a synopsis of the architectures and algorithms used in eight machines to render three-dimensional medical images, with particular emphasis paid to their distinctive contributions. It compares the performance of the machines along several dimensions, including image resolution, elapsed time to form an image, imaging algorithms used in the machine, and the degree of parallelism used in the architecture. The paper concludes …


Performance Prediction For Distributed Load Balancing On Multicomputer Systems, Ishfaq Ahmed, Arif Ghafoor, Kishan Mehrotra Jan 1991

Performance Prediction For Distributed Load Balancing On Multicomputer Systems, Ishfaq Ahmed, Arif Ghafoor, Kishan Mehrotra

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

This paper presents a performance evaluation approach to compare different distributed load balancing schemes on a unified basis. This approach is an integration of simulation, statistical and analytical models, and takes into account the fundamental system parameters that can possibly affect the performance. We show that all the sender-initiated distributed load balancing strategies can be modeled by a central server open queuing network. Furthermore, these load balancing strategies can be characterized by only two queuing parameters – the average execution queue length and the probability that a newly arrived task is executed locally or migrated to another node. To capture …


Analyzing Images Containing Multiple Sparse Patterns With Neural Networks, Rangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka Jan 1991

Analyzing Images Containing Multiple Sparse Patterns With Neural Networks, Rangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

We have addressed the problem of analyzing images containing multiple sparse overlapped patterns. This problem arises naturally when analyzing the composition of organic macromolecules using data gathered from their NMR spectra. Using a neural network approach, we have obtained excellent results in using NMR data to analyze the presence of various amino acids in protein molecules. We have achieved high correct classification percentages (about 87%) for images containing as many as five substantially distorted overlapping patterns.


Scatter Scheduling For Problems With Unpredictable Structures, Min-You Wu, Wei Shu Jan 1991

Scatter Scheduling For Problems With Unpredictable Structures, Min-You Wu, Wei Shu

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

An extended scatter scheduling was applied to problems with unpredictable, asynchronous structures. It has been found that with this simple scheduling strategy, good load balance can be reached without incurring much runtime overhead. This scheduling algorithm has been implemented on hypercube machines, and its performance is compared with other scheduling strategies.


A Decentralized Task Scheduling Algorithm And Its Performance Modeling For Computer Networks, Ishfaq Ahmad, Arif Ghafoor, Kishan Mehrotra Jan 1991

A Decentralized Task Scheduling Algorithm And Its Performance Modeling For Computer Networks, Ishfaq Ahmad, Arif Ghafoor, Kishan Mehrotra

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

A dynamic task scheduling algorithm, that is stable, de-centralized, and adaptive to network topology, is presented. The proposed algorithm is an extension of nearest neighbor load balancing strategy with an enhanced degree of efficiency and it is intended for multicomputers connected by a store and forward communication network. The proposed algorithm is modeled by a central server open queuing network. It is shown that the response time of a task consists of two parts. The first part comprises a task‘s settling time which consists of scheduling time, communication time, and waiting time in scheduling and communication queues. The second part …