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

Digital Commons Network™

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

Purdue University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 12241 - 12270 of 13648

Full-Text Articles in Entire DC Network

Tree Structured Grobner Basis Computation On Parallel Machines, Hemal V. Shah, Jose A. B. Fortes Oct 1994

Tree Structured Grobner Basis Computation On Parallel Machines, Hemal V. Shah, Jose A. B. Fortes

Department of Electrical and Computer Engineering Technical Reports

With the advent of symbolic mathematical software packages such as Maple, Mathematics, and Macsyma, symbolic computation has become widely used in many scientific applications. Though a significant effort has been put in performing numeric computation on multiprocessors, symbolic computation on parallel machines is still in an unexplored state. However, symbolic mathematical applications are ideal candidates for parallel processing, because they are computationally intensive. This paper considers the parallel computation of Grobner basis, a special basis for a multivariate polynomial ideal over a field that plays a key role in symbolic computation. Large Grobner basis computation poses a challenging problem due …


A Simd Sparse Matrix-Vector Multiplication Algorithm For Computational Electromagnetics And Scattering Matrix Models, Nirav Harish Kapadia Oct 1994

A Simd Sparse Matrix-Vector Multiplication Algorithm For Computational Electromagnetics And Scattering Matrix Models, Nirav Harish Kapadia

Department of Electrical and Computer Engineering Technical Reports

A large number of problems in numerical analysis require the multiplication of a sparse matrix by a vector. In spite of the large amount of fine-grained parallelism available in the process of sparse matrix-vector multiplication, it is difficult to design an algorithm for distributed memory SIMD computers that can efficiently multiply an arbitrary sparse matrix by a vector. The difficulty lies in the irregular nature of the data structures required to efficiently store arbitrary sparse matrices, and the architectural constraints of a SIMD computer. We propose a new algorithm that allows the "regularity" of a data structure that uses a …


Asymptotically Optimal Heuristics For Bottleneck And Capacity Optimization Problems, Wojciech Szpankowski Oct 1994

Asymptotically Optimal Heuristics For Bottleneck And Capacity Optimization Problems, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Bit-Sequences: A Cache Invalidation Algorithm In Mobile Environments, Jin Jing, Omran Bukhres, Ahmed K. Elmagarmid, Rafael Alonso Oct 1994

Bit-Sequences: A Cache Invalidation Algorithm In Mobile Environments, Jin Jing, Omran Bukhres, Ahmed K. Elmagarmid, Rafael Alonso

Department of Computer Science Technical Reports

No abstract provided.


Geometric Contraints For Cagd, Christoph M. Hoffmann, Jörg Peters Oct 1994

Geometric Contraints For Cagd, Christoph M. Hoffmann, Jörg Peters

Department of Computer Science Technical Reports

No abstract provided.


Distributed Lock Management For Mobile Transactions, Jin Jing, Omran Bukhres, Ahmed K. Elmagarmid Oct 1994

Distributed Lock Management For Mobile Transactions, Jin Jing, Omran Bukhres, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.


A Suboptimal Lossy Data Compression Based On Approximate Pattern Matching, Tomasz Luczak, Wojciech Szpankowski Oct 1994

A Suboptimal Lossy Data Compression Based On Approximate Pattern Matching, Tomasz Luczak, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Scheduling A Superscalar Pipelined Processor Without Hardware Interlocks, Heng-Yi Chao, Mary P. Harper Sep 1994

Scheduling A Superscalar Pipelined Processor Without Hardware Interlocks, Heng-Yi Chao, Mary P. Harper

Department of Electrical and Computer Engineering Technical Reports

In this paper, we consider the problem of scheduling a set of instructions on a single processor with multiple pipelined functional units. In a superscalar processor, the hardware can issue multiple instructions every cycle, providing a fine-grained parallelism for achieving order-ofmagnitude speed-ups. It is well known that the problem of scheduling a pipelined processor with uniform latencies, which is a subclass of the problem we consider here, belongs to the class of NP-Complete problems. We present an efficient lower bound algorithm that coniputes a tight lower bound on the length of an optimal schedule, and a new heuristic scheduling algorithm …


Science Pad: An Intelligent Electronic Notepad For Ubiquitous Scientific Computing, Anupam Joshi, Sanjiva Weerawarana, Tzvetan T. Drashansky, Elias N. Houstis Sep 1994

Science Pad: An Intelligent Electronic Notepad For Ubiquitous Scientific Computing, Anupam Joshi, Sanjiva Weerawarana, Tzvetan T. Drashansky, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.


Processing Pde Interface Conditions Ii, Tzvetan Drashansky, John R. Rice Sep 1994

Processing Pde Interface Conditions Ii, Tzvetan Drashansky, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


C++ Class Libraries For Error Control Codes, Jamshid Nazari, Okan K. Ersoy Aug 1994

C++ Class Libraries For Error Control Codes, Jamshid Nazari, Okan K. Ersoy

Department of Electrical and Computer Engineering Technical Reports

A tutorial on error control code is given and encoding and decoding using finite field transforms are outlined. Several C++ class libraries are then designed to implement some of the concepts in error control codes. A high level description of these libraries are given and several programs that. uses these libraries are presented. RS and BCH codes can be generated by these libraries from primitive polynomials where the user specifies the code size and number of errors to be corrected. Using these libraries power progra.ins in error control codes can be writtnen in less than few pages.


Automatic Test Reordering For Electrical And Thermal Stress During Monitored Burn-In, Kaushik Roy, Rabindra K. Roy, Abhijit Chatterjee Aug 1994

Automatic Test Reordering For Electrical And Thermal Stress During Monitored Burn-In, Kaushik Roy, Rabindra K. Roy, Abhijit Chatterjee

Department of Electrical and Computer Engineering Technical Reports

As the complexity of VLSI circuits increases, the semiconductor manufacturers progress towards in-situ monitored burn-in to improve the quality and reliability of their products. A new method is proposed to control the switching current drawn by a CMOS circuit during burn-in ancl test applications. This is based on reordering of the test vector is such that the circuit activity or electrical stress is modified as specified by the designer or the quality control engiineer during monitored burn-in. Results on several ISCAS-89 benchmarks show that the current (or power dissipation) requirement of a circuit can be changed by more than a …


Problem Solving Environments For Partial Differential Equation Based Applications (Ph.D. Thesis), Sanjiva Weerawarana Aug 1994

Problem Solving Environments For Partial Differential Equation Based Applications (Ph.D. Thesis), Sanjiva Weerawarana

Department of Computer Science Technical Reports

No abstract provided.


Modeling With Collaborating Pde Solvers - Theory And Practice, Mo Mu, John R. Rice Aug 1994

Modeling With Collaborating Pde Solvers - Theory And Practice, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Timing Results Of A Parallel Fftsynth, Robert E. Lynch, Zhongyun Zhang Aug 1994

Timing Results Of A Parallel Fftsynth, Robert E. Lynch, Zhongyun Zhang

Department of Computer Science Technical Reports

No abstract provided.


Nanoelectronic Functional Devices, Pratheep Balasingam, Vwani P. Roychowdhury Jul 1994

Nanoelectronic Functional Devices, Pratheep Balasingam, Vwani P. Roychowdhury

Department of Electrical and Computer Engineering Technical Reports

Continuing advances in the miniaturization of electron devices have made possible the fabrication of nanoelectronic devices with feature sizes in the 1 - lOOnm range. However, it is widely believed that conventional integrated circuit design techniques will become impractical, due to the small size and the low current carrying capacity of nanostructured devices. Proposals which envision novel ways to circumvent this problem have begun to appear in earnest. The majority of these proposals use globally coherent quantum systems to generate computational abilities. We differ from these proposals in that we use semiclassical global models, as the basis from which to …


Stability Analysis Of Quota Allocation Access Protocols In Ring Networks With Spatial Reuse, Leonidas Georgiadis, Wojciech Szpankowski, Leondros Tassiulas Jul 1994

Stability Analysis Of Quota Allocation Access Protocols In Ring Networks With Spatial Reuse, Leonidas Georgiadis, Wojciech Szpankowski, Leondros Tassiulas

Department of Computer Science Technical Reports

No abstract provided.


Parallel, Probabilistic, Self-Organizing, Hierarchical Neural Networks , Faramarz Valafar, Okan K. Ersoy Jun 1994

Parallel, Probabilistic, Self-Organizing, Hierarchical Neural Networks , Faramarz Valafar, Okan K. Ersoy

Department of Electrical and Computer Engineering Technical Reports

A new neural network architecture called the Parallel Probabilistic Self-organizing Hierarchical Neural Network (PPSHNN) is introduced. The PPSHNN is designed to solve complex classification problems, by dividing the input vector space into regions, and by performing classification on those regions. It consists of several modules which operate in a hierarchically during learning and in parallel during testing. Each module has the task of classification for a region of the input information space as well as the task of participating in the formation of these regions through post- and pre-rejection schemes. The decomposition into regions is performed in a manner that …


A Conceptual Model For Multimedia Database Systems, Shunge Li, Xiangning Liu, Bharat Bhargava Jun 1994

A Conceptual Model For Multimedia Database Systems, Shunge Li, Xiangning Liu, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


Scalar Field Modeling & Visualization On The Intel Delta, Chandrajit Bajaj, Kwun-Nan Lin Jun 1994

Scalar Field Modeling & Visualization On The Intel Delta, Chandrajit Bajaj, Kwun-Nan Lin

Department of Computer Science Technical Reports

No abstract provided.


Processing Pde Interface Conditions, John R. Rice Jun 1994

Processing Pde Interface Conditions, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Implementing A Hidden Markov Model With Duration Modeling On The Maspar Mp-1, C. D. Mitchell, L. H. Jamieson, M. P. Harper, R. A. Helzerman Jun 1994

Implementing A Hidden Markov Model With Duration Modeling On The Maspar Mp-1, C. D. Mitchell, L. H. Jamieson, M. P. Harper, R. A. Helzerman

Department of Electrical and Computer Engineering Technical Reports

This paper describes the parallel implementation of a Hidden Markov Model (HMM) for spoken language recognition on the MasPar MP-1. A major drawback of using HMMs for speech recognition is the amount of processing time required to develop and test the model. By exploiting the massive parallelism of explicit duration HMMs, we can develop more complex models for real-time speech recognition. Implementational issues such as choice of data structures, method of communication, and utilization of parallel computation functions will be explored. The results of our experiments show that the parallelism in HMMs can be effectively exploited by the MP-1. Training …


Modular Mappings Of Rectangular Algorithms, Hyuk J. Lee, José A.B. Fortes Jun 1994

Modular Mappings Of Rectangular Algorithms, Hyuk J. Lee, José A.B. Fortes

Department of Electrical and Computer Engineering Technical Reports

Affine space-time mappings have been extensively studied for systolic array design and parallelizing compilation. However, there are practical important cases that require other types of transformations. This paper considers so-called modular mappings described by linear transformations modulo a constant vector. Sufficient conditions for these mappings to be one-to-one are investigated for rectangular domains of arbitrary dimensions. It is shown that a sufficient condition for a modular mapping to be one-to-one is that its (n x n) coefficient -matrix T has entries tii = k1 and tij = 0 for i > j where > is a total order on {1, 2,. ., …


An Analysis Of The Paging Activity Of Parallel Programs, Kuei Yu Wang, Dan C. Marinescu Jun 1994

An Analysis Of The Paging Activity Of Parallel Programs, Kuei Yu Wang, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.


Eppod: A Problem Solving Environment For Parallel Electronic Prototyping Of Physical Object Design, Poting Wu, Elias N. Houstis, John R. Rice Jun 1994

Eppod: A Problem Solving Environment For Parallel Electronic Prototyping Of Physical Object Design, Poting Wu, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Selected Topics On Demand Side Management, S. Alyasin, L. Chung, D Gotham, D. Hu, B. Kwon, J. Lee, A. Mok, A. Risal, R. Sasaki May 1994

Selected Topics On Demand Side Management, S. Alyasin, L. Chung, D Gotham, D. Hu, B. Kwon, J. Lee, A. Mok, A. Risal, R. Sasaki

Department of Electrical and Computer Engineering Technical Reports

Each year in the graduate course on "Economic Dispatch and Control of Integrated Power Systems," the students prepare a term project which is assembled into a report. This year, the assigned topic relates to demand side management. This topic appears to be especially timely and, because it relates to the revenue derived by the electric utility. The term demand side management (DSM) refers to modification of power system demand by some means in order to obtain better load factor characteristics. The study of DSM has many unresolved issues - many stem from the fact that the electric utility industry is …


A Performance Analysis Of A Digital Pll Based Mpsk Demodulator, Michael P. Fitz, R. Jean-Marc Cramer May 1994

A Performance Analysis Of A Digital Pll Based Mpsk Demodulator, Michael P. Fitz, R. Jean-Marc Cramer

Department of Electrical and Computer Engineering Technical Reports

This paper presents a generalized nonlinear (Markov) analysis technique that is used to evaluate the statistical performance of uniforn~ly sampled digital phase-locked loop (DPLL) demodulators. Although the rigorous analysis of the statistical performance of the analog PLL for digitally modulated signals (i.e., Costas loops) remains an open problem, the discrete time analysis for MPSK modulation is tractable. This paper characterizes the first-order, decisiondirected DPLL based demodulator as a Markov chain. Traditional analytical techniques are used to evaluate the steady-state statistical performance. Numerical results for the steady-state density function are derived for BPSK, QPSK, and 8PSK. The resulting steady-state bit error …


Frequency Offset Compensation And Burst Design In Frequency Flat Fading Channels, Wen-Yi Kuo, Michael P. Fitz May 1994

Frequency Offset Compensation And Burst Design In Frequency Flat Fading Channels, Wen-Yi Kuo, Michael P. Fitz

Department of Electrical and Computer Engineering Technical Reports

Capability to combat channel fading and easy implementation have made the pilot symbol assisted modulation (PSAM) of practical interest in mobile communications. However, the operation in burst mode for multiple access purpose has still been a missing part from previous research. This work first examines the burst design problem associated with pilot symbol allocation in a frequency flat fading environment. Explicit relationship between error performance and the design parameters including pilot distribution, frequency offset, Doppler spread, and modulation scheme is exploreti. A new unequal spacing pilot insertion burst architecture is proposed to achieve better error performance. Frequency offset compensation in …


Communication Operations On Coarse-Grained Mesh Architectures, Susanne E. Hambrusch, Farooq Hameed, Ashfaq A. Khokhar May 1994

Communication Operations On Coarse-Grained Mesh Architectures, Susanne E. Hambrusch, Farooq Hameed, Ashfaq A. Khokhar

Department of Computer Science Technical Reports

No abstract provided.


Building Information Systems For Mobile Environments, Evaggelia Pitoura, Bharat Bhargava May 1994

Building Information Systems For Mobile Environments, Evaggelia Pitoura, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.