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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 61231 - 61260 of 63040

Full-Text Articles in Entire DC Network

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.


Parallel Vision Algorithms Using Sparse Array Representations, Ravi V. Shankar Nov 1990

Parallel Vision Algorithms Using Sparse Array Representations, Ravi V. Shankar

Electrical Engineering and Computer Science - Technical Reports

Sparse arrays are arrays in which the number of non-zero elements is a small fraction of the total number of array elements. This paper presents computer vision algorithms using sparse representations for arrays. The parallel architecture considered is a hypercube. The algorithms can be easily modified for other architectures like the mesh. 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) …


A Graphical Knowledge Level Approach For User-Database Interaction, K. Tan, H. Chan, Keng Siau Nov 1990

A Graphical Knowledge Level Approach For User-Database Interaction, K. Tan, H. Chan, Keng Siau

Research Collection School Of Computing and Information Systems

The authors propose a novel user interface, the Graphical Knowledge Level interface, for user-database interaction. This interface addresses two of the current research problems: the semantic inadequacy of the relational model and the logical data dependence of the relational languages. The interface is more user-friendly than the SOL interface and the Universal Relation interface, as it employs the graphical approach. The semantic inadequacy problem is alleviated by using an enhanced entity-relationship model. This data model includes abstraction concepts such as aggregation, generalization, and categorization. A formal, high-level Graphical Knowledge Level Query Language, GKQL, which provides for both logical and physical …


Fiber Distributed Data Interface, Piyush Kulshreshiha Oct 1990

Fiber Distributed Data Interface, Piyush Kulshreshiha

Department of Computer Science Technical Reports

No abstract provided.


Cooperative Management Of Embedded Resources In A Distributed Environment, Douglas E. Comer, James Griffioen Oct 1990

Cooperative Management Of Embedded Resources In A Distributed Environment, Douglas E. Comer, James Griffioen

Department of Computer Science Technical Reports

No abstract provided.


Parallel Heuristics For Determining Steiner Trees In Images, Susanne E. Hambrusch, Lynn Tewinkel Oct 1990

Parallel Heuristics For Determining Steiner Trees In Images, Susanne E. Hambrusch, Lynn Tewinkel

Department of Computer Science Technical Reports

No abstract provided.


1-D Compaction, Susanne E. Hambrusch, Hung-Yi Tu Oct 1990

1-D Compaction, Susanne E. Hambrusch, Hung-Yi Tu

Department of Computer Science Technical Reports

No abstract provided.


The Effects Of Communication Latency Upon Synchronization And Dynamic Load Balance On A Hypercube, Dan C. Marinescu, John R. Rice Oct 1990

The Effects Of Communication Latency Upon Synchronization And Dynamic Load Balance On A Hypercube, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Specification And Execution Of Transactions For Advanced Database Applications, Y. Leu, Ahmed K. Elmagarmid, N. Boudriga Oct 1990

Specification And Execution Of Transactions For Advanced Database Applications, Y. Leu, Ahmed K. Elmagarmid, N. Boudriga

Department of Computer Science Technical Reports

No abstract provided.


A Parallel Logic Language For Transaction Specification In Multidatabase Systems, Eva Kuhn, Ahmed K. Elmagarmid, Yungho Leu, Nourreddine Boudriga Oct 1990

A Parallel Logic Language For Transaction Specification In Multidatabase Systems, Eva Kuhn, Ahmed K. Elmagarmid, Yungho Leu, Nourreddine Boudriga

Department of Computer Science Technical Reports

No abstract provided.


Eclipse: A System For High Performance Concurrent Simulation, V. S. Sunderam, Vernon J. Rego Oct 1990

Eclipse: A System For High Performance Concurrent Simulation, V. S. Sunderam, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.


An Overview Of The Virtual Memory Xinu Project, Douglas E. Comer, James Griffioen Oct 1990

An Overview Of The Virtual Memory Xinu Project, Douglas E. Comer, James Griffioen

Department of Computer Science Technical Reports

No abstract provided.


Software Performance Evaluation Papers In Toms, Volumes 1-15, John R. Rice Oct 1990

Software Performance Evaluation Papers In Toms, Volumes 1-15, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Optimal Parallel Solutions To The Neighbor Localization Problem And Integer Sorting: A Fine Grained Approach, Ramachandran Vaidyanathan, Carlos R.P. Hartmann, Pramod K. Varshney Oct 1990

Optimal Parallel Solutions To The Neighbor Localization Problem And Integer Sorting: A Fine Grained Approach, Ramachandran Vaidyanathan, Carlos R.P. Hartmann, Pramod K. Varshney

Electrical Engineering and Computer Science - Technical Reports

In this report, a fine-grained decomposition approach is used to obtain an optimal parallel solution to the Neighbor Localization Problem, which in turn is œ used to sort n θ(log n)-bit numbers optimally on an EREW model. The model of computation used is the EREW Reconfigurable PRAM (R-PRAM) that permits the use of “very small” processors. The main result of this report is a parallel EREW R-PRAM algorithm that sorts n θ(log n)-bit numbers in θ(log n) time with θ(n log n) “work”. The proposed algorithm is asymptotically optimal in time and efficiency. If a weaker variant of the R-PRAM …


A Space And Time Efficient Coding Algorithm For Lattíce Computations, Deb Dutta Ganguly, Sanjay Ranka Oct 1990

A Space And Time Efficient Coding Algorithm For Lattíce Computations, Deb Dutta Ganguly, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

This paper presents an encoding algorithm to enable fast computation of the least upper bound (LUB) and greatest lower bound (GLB) of a partially ordered set. The algorithm presented reduces the LUB computation to an OR operation on the codes. The GLB computation is reduced essentially to an AND operation on the codes. The time complexity of our encoding algorithm is O(n + e) where n is the number of nodes and e is the number of edges. With respect to space requirements the algorithm presented gives good results for small lattices (code length was 50 bits for a 300 …


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

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

BITs and PCs Newsletter

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


A Software Design Tool For Predictable Performance In Real-Time, Data Flow Architectures, Brij Mohan V. Mandala Oct 1990

A Software Design Tool For Predictable Performance In Real-Time, Data Flow Architectures, Brij Mohan V. Mandala

Electrical & Computer Engineering Theses & Dissertations

A software design tool which aids in the performance evaluation and selection of operating points for an algorithm implemented in ATAMM defined data flow architectures is presented in this thesis. ATAMM (Algorithm To Architecture Mapping Model) is a new graph theoretic model developed by researchers at Old Dominion University and the NASA-Langley Research Center. ATAMM is capable of modeling the execution of large-grained algorithms on distributed data flow architectures. A software tool is required for predicting the performance, determining the resource requirements and for selecting suitable operating points for an ATAMM based system. The ATAMM Design Tool presented in this …


Highly Concurrent Logically Synchronous Multicast, Kenneth J. Goldman Oct 1990

Highly Concurrent Logically Synchronous Multicast, Kenneth J. Goldman

All Computer Science and Engineering Research

We define the logically synchronous multicast problem, which imposes a natural and useful structure on message delivery order in an asynchronous system. In this problem, a computation proceeds by a sequence of multicasts, in which a process sends a message to some arbitrary subset of the processes, including itself. A logically synchronously multicast protocol must make it appear to every process as if each multicast occurs simultaneously at all participants of that multicast (sender plus receivers). Furthermore, if a process continually wishes to sends a message, it must eventually be permitted to do so. We present a highly concurrent solution …


A Framework For Intelligent Parallel Compilers, Ko-Yang Wang Sep 1990

A Framework For Intelligent Parallel Compilers, Ko-Yang Wang

Department of Computer Science Technical Reports

No abstract provided.


Domain Decomposer: A Software Tool For Mapping Pde Computations To Parallel Architectures, N. P. Chrisochoides, C. E. Houstis, Elias N. Houstis, P. N. Papachiou, S. K. Kortesis Sep 1990

Domain Decomposer: A Software Tool For Mapping Pde Computations To Parallel Architectures, N. P. Chrisochoides, C. E. Houstis, Elias N. Houstis, P. N. Papachiou, S. K. Kortesis

Department of Computer Science Technical Reports

No abstract provided.


Xinu On The Transputer, Douglas E. Comer, Victor Norman Sep 1990

Xinu On The Transputer, Douglas E. Comer, Victor Norman

Department of Computer Science Technical Reports

No abstract provided.


The Block Modified Accelerated Overrelaxation (Maor) Method For Generalized Consistently Ordered Matrices, A Hadjidimos, A. Psimarni, Y. G. Saridakis, A. K. Yeyios Sep 1990

The Block Modified Accelerated Overrelaxation (Maor) Method For Generalized Consistently Ordered Matrices, A Hadjidimos, A. Psimarni, Y. G. Saridakis, A. K. Yeyios

Department of Computer Science Technical Reports

No abstract provided.


Another Unified Approach To Some Bottleneck And Capacity Optimization Problems, Wojciech Szpankowski Sep 1990

Another Unified Approach To Some Bottleneck And Capacity Optimization Problems, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Parallel Techniques For Computational Geometry, Mikhail J. Atallah Sep 1990

Parallel Techniques For Computational Geometry, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


Global Concurrency Control In Heterogeneous Distributed Database Systems, Ahmed K. Elmagarmid, Weimin Du, Yungho Leu Sep 1990

Global Concurrency Control In Heterogeneous Distributed Database Systems, Ahmed K. Elmagarmid, Weimin Du, Yungho Leu

Department of Computer Science Technical Reports

No abstract provided.


Generalized Quasi Serializability Theory, Weimin Du, Ahmed K. Elmagarmid Sep 1990

Generalized Quasi Serializability Theory, Weimin Du, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.


Maintaining Hddbs Consistence: The Quasi Serializability Approach, Ahmed K. Elmagarmid, Weimin Du Sep 1990

Maintaining Hddbs Consistence: The Quasi Serializability Approach, Ahmed K. Elmagarmid, Weimin Du

Department of Computer Science Technical Reports

No abstract provided.


How To Construct The Skeleton Of Csg Objects, Christoph M. Hoffmann Sep 1990

How To Construct The Skeleton Of Csg Objects, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.


A Colored Petri Net-Based Approach For Automated Deadlock Detection In Parallel Programs, N. Mansouri, Amrit L. Goel Sep 1990

A Colored Petri Net-Based Approach For Automated Deadlock Detection In Parallel Programs, N. Mansouri, Amrit L. Goel

Electrical Engineering and Computer Science - Technical Reports

A static analysis approach is proposed for automated detection of deadlocks in a common class of parallel programs, referred to as Single Code Multiple Data (SCMD) programs. It is based on colored Petri net (CP-net) modeling and reachability analysis, where colors correspond to parallel processes. An SCMD program is first translated into a CP-net and a reachability tree is then derived and analyzed for deadlock information. CP-subnets representing basic programming language constructs are described. These subnets are employed as building blocks by an algorithm that translates synchronization-related statements of a process in an SCMD program and connects the resulting subnets. …