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 10531 - 10560 of 12099

Full-Text Articles in Entire DC Network

Review: Writing In The Center, Jim Skelton Jan 1986

Review: Writing In The Center, Jim Skelton

The Writing Center Journal

No abstract provided.


Types Of Conferences And The Composing Process, H. Eric Branscomb Jan 1986

Types Of Conferences And The Composing Process, H. Eric Branscomb

The Writing Center Journal

No abstract provided.


Teaching Word Processing: A Cooperative Effort, Jane Lightcap Brown Jan 1986

Teaching Word Processing: A Cooperative Effort, Jane Lightcap Brown

The Writing Center Journal

No abstract provided.


Review: Microcomputers And Word Processing Programs, Fred Kemp Jan 1986

Review: Microcomputers And Word Processing Programs, Fred Kemp

The Writing Center Journal

No abstract provided.


Evaluation Of Aggregate Sample Durability, Margaret A.; Hanson Jan 1986

Evaluation Of Aggregate Sample Durability, Margaret A.; Hanson

JTRP Technical Reports

No abstract provided.


An Ongoing Tutor-Training Program, Evelyn Posey Jan 1986

An Ongoing Tutor-Training Program, Evelyn Posey

The Writing Center Journal

No abstract provided.


The Effects Of Writing Apprehension On The Teaching Behaviors Of Writing Center Tutors, Patrick Bizzaro, Hope Toler Jan 1986

The Effects Of Writing Apprehension On The Teaching Behaviors Of Writing Center Tutors, Patrick Bizzaro, Hope Toler

The Writing Center Journal

No abstract provided.


Review: Talking About Writing, Janice Neuleib Jan 1986

Review: Talking About Writing, Janice Neuleib

The Writing Center Journal

No abstract provided.


Independence And Collaboration: Why We Should Decentralize Writing Centers, Louise Z. Smith Jan 1986

Independence And Collaboration: Why We Should Decentralize Writing Centers, Louise Z. Smith

The Writing Center Journal

No abstract provided.


Structure Of A Rigid Smooth Space Curve, Chia-Hoang Lee Dec 1985

Structure Of A Rigid Smooth Space Curve, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.


Generation Of Configuration Space Obstacles I: The Case Of A Moving Sphere, Chanderjit Bajaj, Myung-Soo Kim Dec 1985

Generation Of Configuration Space Obstacles I: The Case Of A Moving Sphere, Chanderjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.


Site Recovery In Replicated Distributed Database Systems, Bharat Bhargava Dec 1985

Site Recovery In Replicated Distributed Database Systems, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


Efficient Plane Sweeping In Parallel, Mikhail J. Atallah, Michael T. Goodrich Dec 1985

Efficient Plane Sweeping In Parallel, Mikhail J. Atallah, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.


Fast Detection And Display Of Symmetry In Trees, Joseph Manning, Mikhail J. Atallah Dec 1985

Fast Detection And Display Of Symmetry In Trees, Joseph Manning, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


Materials Characterization And Economic Considerations Of Cold-Mix Recycled Asphalt Pavements, Luis Humberto Castedo-Franco Dec 1985

Materials Characterization And Economic Considerations Of Cold-Mix Recycled Asphalt Pavements, Luis Humberto Castedo-Franco

Indiana Local Technical Assistance Program (LTAP) Publications

Recycling of asphalt pavements has become a common rehabilitation and maintenance process since the mid 1970s. The state of the art of designing and constructing pavements composed of recycled materials has now advanced to a point where recycling is considered as an alternative to conventional procedures for most paving projects. An in-depth evaluation of cold-mix recycling techniques was undertaken and the findings are presented in this report. The variability of the existing materials found in city streets and county roads throughout the State of Indiana was evaluated by means of laboratory test procedures. The data obtained from these experiments were …


A Queueing Model For Token-Passing Computer Networks, Vernon J. Rego, Lionel M. Ni Nov 1985

A Queueing Model For Token-Passing Computer Networks, Vernon J. Rego, Lionel M. Ni

Department of Computer Science Technical Reports

No abstract provided.


Overloading Of Names In Distributed Systems, Douglas E. Comer, Ralph E. Droms Nov 1985

Overloading Of Names In Distributed Systems, Douglas E. Comer, Ralph E. Droms

Department of Computer Science Technical Reports

No abstract provided.


Structure And Motion Of A Rigid Object Having Unknown Constant Motion, Chia-Hoang Lee, Azriel Rosenfeld Oct 1985

Structure And Motion Of A Rigid Object Having Unknown Constant Motion, Chia-Hoang Lee, Azriel Rosenfeld

Department of Computer Science Technical Reports

No abstract provided.


The Myriad Virtues Of Subword Trees, Alberto Apostolico Oct 1985

The Myriad Virtues Of Subword Trees, Alberto Apostolico

Department of Computer Science Technical Reports

No abstract provided.


Data Structures And Algorithms For The String Statistics Problem, A. Apostolico, F. P. Preparata Oct 1985

Data Structures And Algorithms For The String Statistics Problem, A. Apostolico, F. P. Preparata

Department of Computer Science Technical Reports

No abstract provided.


Structural Properties Of The String Statistics Problem, A. Apostolico, F. P. Preparata Oct 1985

Structural Properties Of The String Statistics Problem, A. Apostolico, F. P. Preparata

Department of Computer Science Technical Reports

No abstract provided.


Remark On Hsu-Du New Algorithm For The Lcs Problem, A. Apostolico Oct 1985

Remark On Hsu-Du New Algorithm For The Lcs Problem, A. Apostolico

Department of Computer Science Technical Reports

No abstract provided.


Improving The Worst Case Performance Of The Hunt-Szymanski Strategy For The Longest Common Subsequence Of Two Strings, Alberto Apostolico Oct 1985

Improving The Worst Case Performance Of The Hunt-Szymanski Strategy For The Longest Common Subsequence Of Two Strings, Alberto Apostolico

Department of Computer Science Technical Reports

No abstract provided.


The Longest Common Subsequence Problem Revisited, A. Apostolico, C. Guerra Oct 1985

The Longest Common Subsequence Problem Revisited, A. Apostolico, C. Guerra

Department of Computer Science Technical Reports

No abstract provided.


The Boyer-Moore-Galil String Searching Strategies Revisited, Alberto Apostolicao, Raffaele Giancarlo Oct 1985

The Boyer-Moore-Galil String Searching Strategies Revisited, Alberto Apostolicao, Raffaele Giancarlo

Department of Computer Science Technical Reports

No abstract provided.


Analysis Of Robot Drive Train Errors And Their Compensation, Shaheen Ahmad Oct 1985

Analysis Of Robot Drive Train Errors And Their Compensation, Shaheen Ahmad

Department of Electrical and Computer Engineering Technical Reports

This paper presents a mathematical model of the kinematic nonlinear drive train errors which reduce absolute static positioning accuracy of robot arms. This kinematic inaccuracy renders robot manipulators ineffective when programmed off-line, though they might be programmed to successfully perform the same task by “Teach Play back” schemes. The kinematic drive train inaccuracy model, presented in this paper can be used to predict and compensate for these second order effects on-line, without resorting to sensor based programming techniques, which are often expensive and difficult to implement in an industrial environment. The drive train error model presented in this paper is …


Parallel Lisp, Thomas A. Rice, Leah H. Jamieson Oct 1985

Parallel Lisp, Thomas A. Rice, Leah H. Jamieson

Department of Electrical and Computer Engineering Technical Reports

Projects in the past few years have looked into the problem of automatic parallelization of the Lisp programming language. Since it appears to be feasible to adapt Lisp to run on a general parallel computer, an implementation will be developed. This implementation will be as general as possible in order to locate the tradeoffs between implementing Lisp on a general parallel computer versus having an efficient interpreter. This implementation can be used to study the execution characteristics of Lisp in a parallel environment. It can also be used to derive information about architectural features which affect the performance of Lisp …


Order Statistics And Other Complex Data Operations On Tree-Structured Dictionary Machines, Michael T. Goodrich, Mikhail J. Atallah Aug 1985

Order Statistics And Other Complex Data Operations On Tree-Structured Dictionary Machines, Michael T. Goodrich, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


An Efficient Parallel Solution For Euclidean Shortest Paths In Three Dimensions, Chanderjit Bajaj Aug 1985

An Efficient Parallel Solution For Euclidean Shortest Paths In Three Dimensions, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.


An Optimal Parallel Algorithm For The All Nearest -- Neighbor Problem For A Convex Polygon, Michael T. Goodrich Aug 1985

An Optimal Parallel Algorithm For The All Nearest -- Neighbor Problem For A Convex Polygon, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.