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 18631 - 18660 of 19337

Full-Text Articles in Entire DC Network

The Function Of Talk In The Writing Conference: A Study Of Tutorial Conversation, Kevin M. Davis, Nancy Hayward, Kathleen R. Hunter, David L. Wallace Jan 1988

The Function Of Talk In The Writing Conference: A Study Of Tutorial Conversation, Kevin M. Davis, Nancy Hayward, Kathleen R. Hunter, David L. Wallace

The Writing Center Journal

No abstract provided.


Back Matter Jan 1988

Back Matter

The Writing Center Journal

No abstract provided.


The Polarities Of Context In The Writing Center Conference, Joseph Janangelo Jan 1988

The Polarities Of Context In The Writing Center Conference, Joseph Janangelo

The Writing Center Journal

No abstract provided.


Review: Teaching One-On-One, Diana George Jan 1988

Review: Teaching One-On-One, Diana George

The Writing Center Journal

No abstract provided.


Collaboration And Ethics In Writing Center Pedagogy, Irene Lurkis Clark Jan 1988

Collaboration And Ethics In Writing Center Pedagogy, Irene Lurkis Clark

The Writing Center Journal

No abstract provided.


Announcements Jan 1988

Announcements

The Writing Center Journal

No abstract provided.


Production And Engineering Properties Of Concrete Used In Precast Prestressed I-Beams For The State Of Indiana, Volume I, M. Keith Kaufman, J. A. Ramirez Jan 1988

Production And Engineering Properties Of Concrete Used In Precast Prestressed I-Beams For The State Of Indiana, Volume I, M. Keith Kaufman, J. A. Ramirez

JTRP Technical Reports

No abstract provided.


Production And Engineering Properties Of Concrete Used In Precast Prestressed I-Beams For The State Of Indiana, Volume I: Executive Summary, M. Keith Kaufman, J. A. Ramirez Jan 1988

Production And Engineering Properties Of Concrete Used In Precast Prestressed I-Beams For The State Of Indiana, Volume I: Executive Summary, M. Keith Kaufman, J. A. Ramirez

JTRP Technical Reports

No abstract provided.


Structural Behavior Of High Strength Concrete Prestressed I-Beams, Volume Ii: Executive Summary, M. Keith Kaufman, J. A. Ramirez Jan 1988

Structural Behavior Of High Strength Concrete Prestressed I-Beams, Volume Ii: Executive Summary, M. Keith Kaufman, J. A. Ramirez

JTRP Technical Reports

No abstract provided.


Self-Alignments In Words And Their Applications, Alberto Apostolico, Wojciech Szpankowski Dec 1987

Self-Alignments In Words And Their Applications, Alberto Apostolico, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


A System For Experimentation In Replicated Copy Control, Bharat Bhargava, Paul Noll, Andrew Royappa, Donna Sabo Dec 1987

A System For Experimentation In Replicated Copy Control, Bharat Bhargava, Paul Noll, Andrew Royappa, Donna Sabo

Department of Computer Science Technical Reports

No abstract provided.


Robot Control Computation In Microprocessor Systems With Multiple Arithmetic Processors, Bo Li, Shaheen Ahmad Dec 1987

Robot Control Computation In Microprocessor Systems With Multiple Arithmetic Processors, Bo Li, Shaheen Ahmad

Department of Electrical and Computer Engineering Technical Reports

In this paper we address the problem of designing a high performance robot controller with multiple arithmetic processing units (APU’s). One attractive feature about this controller is that a minimum number of special purpose hardware components are needed, and in fact off the shelf components can be used. In the controller described in this paper, one main processor (MPU) schedules a number of APU’s to produce the computational throughput. In this design an efficient scheduling algorithm plays the most important role in the system performance. DF/IHS* algorithm [8] is an efficient algorithm that solves "strong" NP-hard problems of scheduling a …


Parallel Symmetry-Breaking In Sparse Graphs, Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon Dec 1987

Parallel Symmetry-Breaking In Sparse Graphs, Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon

Department of Computer Science Technical Reports

No abstract provided.


Do We Really Need To Balance Patricia Tries?, Peter Kirschenhofer, Helmut Prodifger, Wojciech Szpankowski Oct 1987

Do We Really Need To Balance Patricia Tries?, Peter Kirschenhofer, Helmut Prodifger, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Parallel Construction Of A Suffix Tree With Applications, A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, U. Vishkin Sep 1987

Parallel Construction Of A Suffix Tree With Applications, A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, U. Vishkin

Department of Computer Science Technical Reports

No abstract provided.


A Dynamic Majority Determination Algorithm For Reconfiguration Of Network Partitions, Bharat Bhargava, Peter Lei Ng Sep 1987

A Dynamic Majority Determination Algorithm For Reconfiguration Of Network Partitions, Bharat Bhargava, Peter Lei Ng

Department of Computer Science Technical Reports

No abstract provided.


Shells In An Interactive System, Balachander Krishnamurthy Sep 1987

Shells In An Interactive System, Balachander Krishnamurthy

Department of Computer Science Technical Reports

No abstract provided.


Supercomputing About Physical Objects, John R. Rice Sep 1987

Supercomputing About Physical Objects, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Automatic Parameterization Of Rational Curves And Surfaces Iv: Algebraic Space Curves, Shreeram S. Abhyankar, Chanderjit Bajaj Aug 1987

Automatic Parameterization Of Rational Curves And Surfaces Iv: Algebraic Space Curves, Shreeram S. Abhyankar, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.


A Characterization Of Digital Search Trees From The Average Complexity Viewpoint, Wojciech Szpankowski Jul 1987

A Characterization Of Digital Search Trees From The Average Complexity Viewpoint, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Convex Hull Of Objects Bounded By Algebraic Curves, Chanderjit Bajaj, Myung-Soo Kim Jul 1987

Convex Hull Of Objects Bounded By Algebraic Curves, Chanderjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.


Sorting With Efficient Use Of Special-Purpose Sorters, Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju Jul 1987

Sorting With Efficient Use Of Special-Purpose Sorters, Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju

Department of Computer Science Technical Reports

No abstract provided.


Physics And Modeling Of Submicron Devices, Supriyo Datta, Mark S. Lundstrom, Marc Cahay, Amitava Das, H. Rob. Frohne, Michael J. Mclennan Jul 1987

Physics And Modeling Of Submicron Devices, Supriyo Datta, Mark S. Lundstrom, Marc Cahay, Amitava Das, H. Rob. Frohne, Michael J. Mclennan

Department of Electrical and Computer Engineering Technical Reports

The work described in this report is directed at understanding transport physics in sub-micron heterostructure devices, at developing computational techniques for modeling such devices, and at applying these techniques to investigate new device concepts. The focus of the past year’s work has been on extending our collisionless, quantum device models to treat elastic scattering processes and at applying previously-developed models to the design and study of AlGaAs/GaAs heterojunction bipolar transistors. This report describes the past year’s progress in these two areas. As a by-product of the research, several heterostructure device models have been developed, 1- and 2-D equilibrium models, 1- …


An Experimental Analysis Of Replicated Copy Control During Site Failure And Recovery, Bharat Bhargava, Paul Noll, Donna Sabo Jun 1987

An Experimental Analysis Of Replicated Copy Control During Site Failure And Recovery, Bharat Bhargava, Paul Noll, Donna Sabo

Department of Computer Science Technical Reports

No abstract provided.


Designing Networks With Compact Routing Tables Available In A Journal, Greg N. Frederickson, Ravi Janardan May 1987

Designing Networks With Compact Routing Tables Available In A Journal, Greg N. Frederickson, Ravi Janardan

Department of Computer Science Technical Reports

No abstract provided.


A Model For Adaptable Concurrency Control, Bharat Bhargava, John Riedl May 1987

A Model For Adaptable Concurrency Control, Bharat Bhargava, John Riedl

Department of Computer Science Technical Reports

No abstract provided.


Reachability Graphs And Invariants For Stochastic High Level Petri Nets, Jing Dong, Dan C. Marinescu, Chuang Lin May 1987

Reachability Graphs And Invariants For Stochastic High Level Petri Nets, Jing Dong, Dan C. Marinescu, Chuang Lin

Department of Computer Science Technical Reports

No abstract provided.


A Face Area Evaluation Algorithm For Solids In Csg Representation, Muh-Cherng Wu, Chanderjit Bajaj, C. R. Liu May 1987

A Face Area Evaluation Algorithm For Solids In Csg Representation, Muh-Cherng Wu, Chanderjit Bajaj, C. R. Liu

Department of Computer Science Technical Reports

No abstract provided.


Efficient Parallel Algorithms And Vlsi Architectures For Manipulator Jacobian Computation, T. B. Yeung, C. S. G. Lee May 1987

Efficient Parallel Algorithms And Vlsi Architectures For Manipulator Jacobian Computation, T. B. Yeung, C. S. G. Lee

Department of Electrical and Computer Engineering Technical Reports

Real-time computations of manipulator Jacobian are examined for executing on uniprocessor computers, parallel computers, and VLSI pipelines. The characteristics of the Jacobian equations are found to be in the form of the first-order linear recurrence. The time lower bound of computing the first-order linear recurrence, and hence the Jacobian, is of order O(N) on uniprocessor computers, and of order O(log2N) on parallel SIMD computers, where TV is the number of degrees-of-freedom of the manipulator. The Generalized-^ method, which achieves the time lower bound on uniprocessor computers, is derived to compute the Jacobian at any desired reference coordinate frame A; from …


Triangulating A Polygon In Parallel, Michael T. Goodrich May 1987

Triangulating A Polygon In Parallel, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.