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 18541 - 18570 of 19337

Full-Text Articles in Entire DC Network

Writing Centers And Writing-For-Learning, Richard Leahy Jan 1989

Writing Centers And Writing-For-Learning, Richard Leahy

The Writing Center Journal

No abstract provided.


Subjectivity In The Tutorial Session: How Far Can We Go?, Stacey Freed Jan 1989

Subjectivity In The Tutorial Session: How Far Can We Go?, Stacey Freed

The Writing Center Journal

No abstract provided.


Announcements Jan 1989

Announcements

The Writing Center Journal

No abstract provided.


On The Bottleneck And Capacity Assignment Problems, Wojciech Szpankowski Dec 1988

On The Bottleneck And Capacity Assignment Problems, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Elliptic Expert: The Design Of An Expert System For Elliptic Partial Differential Equations, Wayne R. Dyksen, Carl R. Gritter Dec 1988

Elliptic Expert: The Design Of An Expert System For Elliptic Partial Differential Equations, Wayne R. Dyksen, Carl R. Gritter

Department of Computer Science Technical Reports

No abstract provided.


Parallel (//) Ellpack: An Expert System For Parallel Processing Of Partial Differential Equations, Elias N. Houstis, John R. Rice, T. S. Papatheodorou Nov 1988

Parallel (//) Ellpack: An Expert System For Parallel Processing Of Partial Differential Equations, Elias N. Houstis, John R. Rice, T. S. Papatheodorou

Department of Computer Science Technical Reports

No abstract provided.


A White Paper On High-Speed Network Architecture, Douglas E. Comer, John M. Steele, Raj Yavatkar Nov 1988

A White Paper On High-Speed Network Architecture, Douglas E. Comer, John M. Steele, Raj Yavatkar

Department of Computer Science Technical Reports

No abstract provided.


On The Applications Of Multi-Equational Resultants, Chanderjit Bajaj, Thomas Garrity, Joe Warren Nov 1988

On The Applications Of Multi-Equational Resultants, Chanderjit Bajaj, Thomas Garrity, Joe Warren

Department of Computer Science Technical Reports

No abstract provided.


Approximation Methods For Algebraic Curves And Surfaces, Chandrajit L. Bajaj Nov 1988

Approximation Methods For Algebraic Curves And Surfaces, Chandrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.


Embedding Complete Binary Trees Into Butterfly Networks, Ajay K. Gupta, Susanne E. Hambrusch Nov 1988

Embedding Complete Binary Trees Into Butterfly Networks, Ajay K. Gupta, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.


On Computing Longest Common Subsequences In Linear Space, A. Apostolico, S. Browne, C. Guerra Nov 1988

On Computing Longest Common Subsequences In Linear Space, A. Apostolico, S. Browne, C. Guerra

Department of Computer Science Technical Reports

No abstract provided.


On The Geometry Of Dupin Cyclides, V. Chandru, D. Dutta, Christoph M. Hoffmann Nov 1988

On The Geometry Of Dupin Cyclides, V. Chandru, D. Dutta, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.


The Use Of Intensity Techniques For Noise Source Identification In Small Machinery, Urs D. Dietschi, J Stuart Bolton Nov 1988

The Use Of Intensity Techniques For Noise Source Identification In Small Machinery, Urs D. Dietschi, J Stuart Bolton

Publications of the Ray W. Herrick Laboratories

Intensity techniques are now widely used for two purposes: sound power determination and source identification. The work described in this presentation illustrates an application of the latter type. As part of a noise control program for a small domestic appliance, a narrow‐band intensity measurement system was developed based on a face‐to‐face microphone probe, a two‐channel FFT analyzer, and a personal computer. The probe was used to measure the nearfield normal intensity on planes parallel to the device's major surfaces. Graphical display of these data allowed the radiated sound field to be visualized at any desired frequency. Further, it was possible …


Experimental Evaluation Of Simd Pe-Mask Generation And Hybrid Mode Parallel Computing On Multi- Microprocessor Systems, Samuel A. Fineberg, Thomas L. Casavant, Howard Jay Siegel Nov 1988

Experimental Evaluation Of Simd Pe-Mask Generation And Hybrid Mode Parallel Computing On Multi- Microprocessor Systems, Samuel A. Fineberg, Thomas L. Casavant, Howard Jay Siegel

Department of Electrical and Computer Engineering Technical Reports

Experimentation aimed at determining the potential efficiency of multi-microprocessor designs of SIMD machines is reported. The experimentation is based on timing measurements made on the PASM system prototype at Purdue. The application used to measure and evaluate this phenomenon was bitonic sorting, which has feasible solutions in both SIMD and MIMD modes of computation, as well as in at least two hybrids of SlMD and MIMD modes. Bitonic sorting was coded in these four ways and experiments were performed that examine the tradeoffs among all of these modes. Also, a new PE mask generation scheme for multiple "of-the-shelf" microprocessor based …


Applications Of Simple Markov Models To Computer Vision, Manoel F. Tenorio, Craig W. Codrington Nov 1988

Applications Of Simple Markov Models To Computer Vision, Manoel F. Tenorio, Craig W. Codrington

Department of Electrical and Computer Engineering Technical Reports

In this report we advocate the use of computationally simple algorithms for computer vision, operating in parallel. The design of these algorithms is based on physical constraints present in the image and object spaces. In particular, we discuss the design, implementation, and performance of a Markov Random Field based algorithm for low level segmentation. In addition to having a simple and fast implementation, the algorithm is flexible enough to allow intensity information to be fused with motion and edge information from other sources.


An Event-Action Model And Associated Architecture For Monitoring Parallel And Distributed Systems, Dan C. Marinescu, James E. Lumpp, Thomas L. Casavant, Howard Jhay Siegel Oct 1988

An Event-Action Model And Associated Architecture For Monitoring Parallel And Distributed Systems, Dan C. Marinescu, James E. Lumpp, Thomas L. Casavant, Howard Jhay Siegel

Department of Computer Science Technical Reports

No abstract provided.


A "Generalization" Of The Patel-Jordan Parallel Iterative Technique, John P. Bonomo, Wayne R. Dyksen Sep 1988

A "Generalization" Of The Patel-Jordan Parallel Iterative Technique, John P. Bonomo, Wayne R. Dyksen

Department of Computer Science Technical Reports

No abstract provided.


Computations With Algebraic Curves, Shreeram S. Abhyankar, Chandrajit L. Bajaj Sep 1988

Computations With Algebraic Curves, Shreeram S. Abhyankar, Chandrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.


A Lower Bound On Embedding Tree Machines With Balanced Processor Utilization, Ajay K. Gupta, Susanne E. Hambrusch Aug 1988

A Lower Bound On Embedding Tree Machines With Balanced Processor Utilization, Ajay K. Gupta, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.


Semi-Automatic Process Decomposition For Non-Shared Memory Machines, Charles Koelbel, Piyush Mehrotra Aug 1988

Semi-Automatic Process Decomposition For Non-Shared Memory Machines, Charles Koelbel, Piyush Mehrotra

Department of Computer Science Technical Reports

No abstract provided.


Improving Cache Performance By Selective Cache Bypass, Chi-Hung Chi, Henry Dietz Jul 1988

Improving Cache Performance By Selective Cache Bypass, Chi-Hung Chi, Henry Dietz

Department of Electrical and Computer Engineering Technical Reports

In traditional cache-based computers, all memory references are made through cache. However, a significant number of items which are referenced in a program are referenced so infrequently that other cache traffic is certain to “bump” these items from cache before they are referenced again. I n such cases, not only is there no benefit in placing the item in cache, but there is the additional overhead of “bumping” some other item out of cache to make room for this useless cache entry. Where a cache line is larger than a processor word, there is an additional penalty in loading the …


Physics And Modeling Of Submicron Devices. Annual Report: August I, 1987 - July 31, 1988, Supriyo Datta, Mark S. Lundstrom, Amitava Das, H. Bob Frohne, Michael J. Mclennan Jul 1988

Physics And Modeling Of Submicron Devices. Annual Report: August I, 1987 - July 31, 1988, Supriyo Datta, Mark S. Lundstrom, Amitava Das, H. Bob Frohne, Michael J. Mclennan

Department of Electrical and Computer Engineering Technical Reports

The work described in this report is directed at understanding quantum transport phenomena in sub-micron heterostructure devices, at developing computational techniques for modeling such devices, and at applying these techniques to develop new device concepts. During the past year we have (l) applied a previously developed collisionless quantum device model (SEQUAL) and Monte Carlo model (DEMON) to the design and study of heterojunction bipolar transistors (Chapter 2); (2) developed a technique for the analysis of arbitrarily shaped quantum devices with elastic scattering (Chapter 3); and (3) developed an approach for incorporating inelastic dissipative processes in quantum transport theory (Chapter 4). …


Flows: Performance Guarantees In Best Effort Delivery Systems, Douglas E. Comer, Rajendra Yavatkar Jul 1988

Flows: Performance Guarantees In Best Effort Delivery Systems, Douglas E. Comer, Rajendra Yavatkar

Department of Computer Science Technical Reports

No abstract provided.


A Generic Algorithm For Transaction Processing During Network Partitioning, Bharat Bhargava, Shirley Browne Jun 1988

A Generic Algorithm For Transaction Processing During Network Partitioning, Bharat Bhargava, Shirley Browne

Department of Computer Science Technical Reports

No abstract provided.


Seth: A Quorum-Based Replicated Database System For Experimentation With Failures, Bharat Bhargava, Abdelsalam Helal, Jagannathan Srinivasan Jun 1988

Seth: A Quorum-Based Replicated Database System For Experimentation With Failures, Bharat Bhargava, Abdelsalam Helal, Jagannathan Srinivasan

Department of Computer Science Technical Reports

No abstract provided.


Robust Replication Control Using Primary Copy Method, Niraj K. Sharma May 1988

Robust Replication Control Using Primary Copy Method, Niraj K. Sharma

Department of Computer Science Technical Reports

No abstract provided.


A. C. Power Losses In Mov Surge Arrestors, Alan J. Engelmann, W. L. Weeks May 1988

A. C. Power Losses In Mov Surge Arrestors, Alan J. Engelmann, W. L. Weeks

Department of Electrical and Computer Engineering Technical Reports

It was the objective of this study to measure power losses occurring in MOV surge arrestors as they were subjected to various voltage Excitations. In particular, power losses were observed in two MOV devices as sinusoidal voltages of different magnitudes were applied, at various frequencies in the range of typical power frequencies and common harmonics. Power losses were also observed in an MOV device for applied voltages consisting of the sum of 60 Hertz sinusoids and a single harmonic. The measurement procedure consisted of obtaining digital records representing the waveforms of voltage across and current through the MOV device during …


Yet Another Application Of A Binomial Recurrence, Wojciech Szpankowski, Vernon J. Rego Apr 1988

Yet Another Application Of A Binomial Recurrence, Wojciech Szpankowski, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.


An Approach To Support Automatic Generation Of User Interfaces, Prasun Dewan, Marvin Solomon Apr 1988

An Approach To Support Automatic Generation Of User Interfaces, Prasun Dewan, Marvin Solomon

Department of Computer Science Technical Reports

No abstract provided.


An Optimal Parallel Algorithm For The Visibility Of A Simple Polygon From A Point, Mikhail J. Atallah, Danny Z. Chen, Hubert Wagner Apr 1988

An Optimal Parallel Algorithm For The Visibility Of A Simple Polygon From A Point, Mikhail J. Atallah, Danny Z. Chen, Hubert Wagner

Department of Computer Science Technical Reports

No abstract provided.