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

Physical Sciences and Mathematics Commons

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 56131 - 56160 of 57977

Full-Text Articles in Physical Sciences and Mathematics

Array Reshaping -- A Mechanism For Optimizing Array Storage On Parallel Architecture, Ko-Yang Wang Dec 1990

Array Reshaping -- A Mechanism For Optimizing Array Storage On Parallel Architecture, Ko-Yang Wang

Department of Computer Science Technical Reports

No abstract provided.


Heuristic Guided Pre-Optimized Algorithm Substitution For Parallel Computers, Ko-Yang Wang Dec 1990

Heuristic Guided Pre-Optimized Algorithm Substitution For Parallel Computers, Ko-Yang Wang

Department of Computer Science Technical Reports

No abstract provided.


The Duke Internet Programming Contest, Owen Astrachan, Vivek Khera, David Kotz Dec 1990

The Duke Internet Programming Contest, Owen Astrachan, Vivek Khera, David Kotz

Dartmouth Scholarship

On the evening of October 23, 1990, electronic mail messages started to pour into the computers at the Duke University Computer Science Department. Teams of programmers from all over the world were registering to compete in the first global (as far as the authors are aware) programming contest to be held on the Internet. During the three hour competition, modeled after the annual ACM scholastic programming contest, 60 teams from 37 institutions in 5 countries attempted to solve a set of six programming problems using C or Pascal. Their solutions were sent by electronic mail to Duke, where their programs …


Models And Algorithms For Co-Scheduling Compute-Intensive Tasks On A Network Of Workstations, Mikhail J. Atallah, Christina Lock, Dan C. Marinescu, Howard J. Seigel, Thomas L. Casavant Dec 1990

Models And Algorithms For Co-Scheduling Compute-Intensive Tasks On A Network Of Workstations, Mikhail J. Atallah, Christina Lock, Dan C. Marinescu, Howard J. Seigel, Thomas L. Casavant

Department of Computer Science Technical Reports

No abstract provided.


Voronoi Diagrams In A River, Kokichi Sugihara Dec 1990

Voronoi Diagrams In A River, Kokichi Sugihara

Department of Computer Science Technical Reports

No abstract provided.


Implementing Expert System Rule Conditions By Neural Networks, Henry Tirri Dec 1990

Implementing Expert System Rule Conditions By Neural Networks, Henry Tirri

Department of Computer Science Technical Reports

No abstract provided.


Brep-Index: A Multi-Dimensional Space Partitioning Tree, George Vanĕček Dec 1990

Brep-Index: A Multi-Dimensional Space Partitioning Tree, George Vanĕček

Department of Computer Science Technical Reports

No abstract provided.


Fitting Semantics For Conditional Term Rewriting, Chilukuri K. Mohan Dec 1990

Fitting Semantics For Conditional Term Rewriting, Chilukuri K. Mohan

Electrical Engineering and Computer Science - Technical Reports

This paper investigates the semantics of conditional term rewriting systems with negation which do not satisfy useful properties like termination. It is shown that the approach used by Fitting [5] for Prolog-style logic programs is applicable in this context. A monotone operator is developed, whose fixpoints describe the semantics of conditional rewriting. Several examples illustrate this semantics for non-terminating rewrite systems which could not be easily handled by previous approaches.


Householder Reduction, Per Brinch Hansen Dec 1990

Householder Reduction, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

This tutorial discusses Householder reduction of n linear equations to a triangular form which can be solved by back substitution. The main strengths of the method are its numerical stability and suitability for parallel computing. We explain how Householder reduction can be derived from elementary matrix algebra. The method is illustrated by a numerical example and a Pascal algorithm. We assume that the reader has a general knowledge of vector and matrix algebra but is less familiar with linear transformation of a vector space.


The All-Pairs Pipeline, Per Brinch Hansen Dec 1990

The All-Pairs Pipeline, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

An all-pairs problem is a computation on every possible subset consisting of two elements chosen from a set of n elements. N-body simulation and Householder reduction are all-pairs problems. The paper defines the all-pairs problem concisely by means of precedence matrices and derives a parallel algorithm. The algorithm is presented in both coarse-grain and medium-grain form. The all-pairs paradigm is illustrated by a pipeline for Householder reduction of a matrix to triangular form.


Balancing A Pipeline By Folding, Per Brinch Hansen Dec 1990

Balancing A Pipeline By Folding, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

A pipeline for Householder reduction is folded several times across an array of processors to achieve approximate load balancing. The performance of the folded pipeline is analyzed and measured on a Computing Surface.


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

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

Electrical Engineering and Computer Science - Technical Reports

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 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.


A Multi-Scale Approach For Recognizing Complex Annotations In Engineering Documents., Andrew Francis Laine, William Ball, Arun Kumar Dec 1990

A Multi-Scale Approach For Recognizing Complex Annotations In Engineering Documents., Andrew Francis Laine, William Ball, Arun Kumar

All Computer Science and Engineering Research

This paper describes a novel method of character recognition targeted for extracting complex annotations found in engineering documents. The results of this work will make it possible to capture the information contained in documents used to support facilities management and manufacturing. The recognition problem is made difficult in part because characters and text may be expressed in arbitrary fonts and orientations. Our approach includes a novel incremental strategy based on the multi-scale representation of wavelet decompositions. Our approach is motivated by biological mechanisms of the human visual systems. Using wavelets as a set of basis functions, we may decompose an …


Problems To Test Parallel And Vector Languages -- Ii, John R. Rice, Jin Jing Dec 1990

Problems To Test Parallel And Vector Languages -- Ii, John R. Rice, Jin Jing

Department of Computer Science Technical Reports

No abstract provided.


A Performance Predication Model For Parallel Compilers, Ko-Yang Wang Nov 1990

A Performance Predication Model For Parallel Compilers, Ko-Yang Wang

Department of Computer Science Technical Reports

No abstract provided.


An Interactive Symbolic-Numeric Interface To Parallel Ellpack For Building General Pde Solvers, S. Weerawarana, Elias N. Houstis, John R. Rice Nov 1990

An Interactive Symbolic-Numeric Interface To Parallel Ellpack For Building General Pde Solvers, S. Weerawarana, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Optimal Superprimitivity Testing For Strings, Alberto Apostolico, Martin Farach, Costas S. Iliopoulos Nov 1990

Optimal Superprimitivity Testing For Strings, Alberto Apostolico, Martin Farach, Costas S. Iliopoulos

Department of Computer Science Technical Reports

No abstract provided.


Implementation And Performance Of A Communication Facility For Distributed Transaction Processing, Enrique Mafla, Bharat Bhargava Nov 1990

Implementation And Performance Of A Communication Facility For Distributed Transaction Processing, Enrique Mafla, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


On Good Triangulations In Three Dimensions, Tamal K. Dey, Chanderjit L. Bajaj, Kokichi Sugihara Nov 1990

On Good Triangulations In Three Dimensions, Tamal K. Dey, Chanderjit L. Bajaj, Kokichi Sugihara

Department of Computer Science Technical Reports

No abstract provided.


Managing Data Synchronization Automatically For Distributed-Memory Architectures, Ko-Yang Wang Nov 1990

Managing Data Synchronization Automatically For Distributed-Memory Architectures, Ko-Yang Wang

Department of Computer Science Technical Reports

No abstract provided.


Experiences With Parallelizing A Distributed Database System, Bharat Bhargava, Janche Sang, Yin-He Jiant Nov 1990

Experiences With Parallelizing A Distributed Database System, Bharat Bhargava, Janche Sang, Yin-He Jiant

Department of Computer Science Technical Reports

No abstract provided.


A Perspective On The Cypress Internetworking Technology, Thomas Narten, Douglas E. Comer, Rajendra Yavatkar Nov 1990

A Perspective On The Cypress Internetworking Technology, Thomas Narten, Douglas E. Comer, Rajendra Yavatkar

Department of Computer Science Technical Reports

No abstract provided.


Piecewise Linear Approximations Of Digitized Space Curves With Applications, Insung Ihm, Bruce Naylor Nov 1990

Piecewise Linear Approximations Of Digitized Space Curves With Applications, Insung Ihm, Bruce Naylor

Department of Computer Science Technical Reports

No abstract provided.


Compiling Programs For Nonshared Memory Machines, Charles Koelbel Nov 1990

Compiling Programs For Nonshared Memory Machines, Charles Koelbel

Department of Computer Science Technical Reports

No abstract provided.


Segment Streaming For Efficient Pipelined Televisualization, Fengmin Gong Nov 1990

Segment Streaming For Efficient Pipelined Televisualization, Fengmin Gong

All Computer Science and Engineering Research

The importance of scientific visualization for both science and engineering endeavors has been well recognized. Televisualization becomes necessary because of the physical distribution of data, computation resources, and users involved in the visualization process. However, televisualization poses a number of challenges to the designers of communication protocols. A pipelined televisualization (PTV) model is proposed for efficient implementation of a class of visualization applications. Central to the proposed research is the development of a segment of streaming IPC (interprocess communication) mechanism in support of efficient pipelining across very high speed internetworks. This requires exploration of special issues arising from extending a …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, November 1990, College Of Engineering And Computer Science, Wright State University Nov 1990

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, November 1990, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Engineering Software Under Statistical Quality-Control, R. H. Cobb, Harlan D. Mills Nov 1990

Engineering Software Under Statistical Quality-Control, R. H. Cobb, Harlan D. Mills

The Harlan D. Mills Collection

No abstract provided.


Axiomatization Of Some Natural Quantifiers, William C. Purdy Nov 1990

Axiomatization Of Some Natural Quantifiers, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

This paper extends an existing logic, £n, to some of the generalized quantifiers of natural language. In contrast to the usual approach, this extension does not require the identity relation. Sommers has suggested that the identity is unnecessary in a logic that properly treats singular terms. This paper lends support to Sommers position. £n is a logic designed for natural language reasoning (see [3]). This paper defines an extension, LNQ, of that logic to include the cardinal quantifiers, at least n, and the second-order quantifier, most. Because of the limited expressiveness of first-order languages, a complete axiomatization for most is …


Hypercube Algorithms For Operations On Quadtrees, Ravi V. Shankar, Sanjay Ranka Nov 1990

Hypercube Algorithms For Operations On Quadtrees, Ravi V. Shankar, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

This paper describes parallel algorithms for the following operations on quadtrees - boolean operations (union, intersection, complement), collapsing a quadtree, and neighbor finding in an image represented by a quadtree. The architecture assumed in this paper is a hypercube with one processing element (PE) per hypercube node. We assume that the architecture is SIMD, i.e., all PEs work under the control of a single control unit.


Forecasting The Behavior Of Multivariate Time Series Using Neural Networks, Kanad Charkraborty, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka Nov 1990

Forecasting The Behavior Of Multivariate Time Series Using Neural Networks, Kanad Charkraborty, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

This paper presents a neural network approach to multivariate time-series analysis. Real world observations of flour prices in three cities have been used as a benchmark in our experiments. Feedforward connectionist networks have been designed to model flour prices over the period from August 1972 to November 1980 for the cities of Buffalo, Minneapolis, and Kansas City. Remarkable success has been achieved in training the networks to learn the price curve for each of these cities, and thereby to make accurate price predictions. Our results show that the neural network approach leads to better predictions than the autoregressive moving average(ARMA) …