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 44461 - 44490 of 50087

Full-Text Articles in Entire DC Network

A Comparison Of E/D-Mesfet Gallium Arsenide And Cmos Silicon For Vlsi Processor Design, Mark K. Bettinger Dec 1985

A Comparison Of E/D-Mesfet Gallium Arsenide And Cmos Silicon For Vlsi Processor Design, Mark K. Bettinger

Department of Electrical and Computer Engineering Technical Reports

Gallium Arsenide (GaAs) circuits have long been known for their speed. They are now being considered for single chip processors since GaAs chips are reaching VLSI complexities. Design constraints that affect both system and processor design accompany the new technology. The goal of this work is to compare and contrast designs in GaAs-E/D MESFET and Si-CMOS technologies as they apply to ALU design. These differences are emphasized by examining the design of several structures in GaAs for implementation of Stanford University’s MIPS processor in GaAs. The three topics discussed are adder design, multiplier placement and design, and cache effects on …


Bacterial Canker To Tomato, Richard X. Latin Dec 1985

Bacterial Canker To Tomato, Richard X. Latin

Historical Documents of the Purdue Cooperative Extension Service Archive

No abstract provided.


Optimal Simulations Between Mesh-Connected Arrays Of Processors, S. Rao Kosaraju, Mikhail J. Atallah Nov 1985

Optimal Simulations Between Mesh-Connected Arrays Of Processors, S. Rao Kosaraju, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


Normal Incidence Absorption Properties Of Single Layers Of Elastic Porous Materials, J Stuart Bolton Nov 1985

Normal Incidence Absorption Properties Of Single Layers Of Elastic Porous Materials, J Stuart Bolton

Publications of the Ray W. Herrick Laboratories

Recently, a theory has been developed which describes wave propagation in relatively stiff, partially reticulated polyurethane foams, the type most commonly used in noise control applications [J.S. Bolton and E. Gold, J. Acoust. Soc. Am. Suppl. 1, vol. 77, S59 (1985)]. A high impedance wave associated with the bulk mechanical properties of the foam matrix is usually significantly excited in these materials. As a consequence, the acoustical performance of finite depth layers of foam of this type is very sensitive to the boundary conditions which apply at the front and rear layer surfaces. Specifically, it will be shown in this …


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.


Cycle-Time Distributions And Stability Of Adaptive Token-Passing Bus Networks, Vernon J. Rego, Herman D. Hughes Nov 1985

Cycle-Time Distributions And Stability Of Adaptive Token-Passing Bus Networks, Vernon J. Rego, Herman D. Hughes

Department of Computer Science Technical Reports

No abstract provided.


Stability Problems In Local Area Networks: A Qualitative Approach, Wojciech Szpankowski, Dan Marinsecu, Vernon J. Rego Nov 1985

Stability Problems In Local Area Networks: A Qualitative Approach, Wojciech Szpankowski, Dan Marinsecu, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.


On A Recurrence Equation Arising In The Analysis Of Conflict Resolution Algorithms, Wojciech Szpankowski Nov 1985

On A Recurrence Equation Arising In The Analysis Of Conflict Resolution Algorithms, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Performance Evaluation Of Interval-Searching Conflict Resolution Algorithms, Wojciech Szpankowski Nov 1985

Performance Evaluation Of Interval-Searching Conflict Resolution Algorithms, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Budgeting To Avoid Investment Errors, J. H. Atkinson, Freddie L. Barnard Nov 1985

Budgeting To Avoid Investment Errors, J. H. Atkinson, Freddie L. Barnard

Historical Documents of the Purdue Cooperative Extension Service Archive

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.


A Communication Sub-System For Mvs/Xa, Dan C. Marinescu Oct 1985

A Communication Sub-System For Mvs/Xa, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.


An Analysis Of A Contention Resolution Algorithm --- Another Approach, Wojciech Szpankowski Oct 1985

An Analysis Of A Contention Resolution Algorithm --- Another Approach, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Bounds For Queue Lengths In A Contention Packet Broadcast System, Wojciech Szpankowski Oct 1985

Bounds For Queue Lengths In A Contention Packet Broadcast System, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Solution Of A Linear Recurrence Equation Arising In Analysis Of Some Algorithms, Wojciech Szpankowski Oct 1985

Solution Of A Linear Recurrence Equation Arising In Analysis Of Some Algorithms, Wojciech Szpankowski

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.


Robust Transmission Of Unbounded Strings Using Fibonacci Representations, Alberto Apostolico, Aviezri S. Fraenkel Oct 1985

Robust Transmission Of Unbounded Strings Using Fibonacci Representations, Alberto Apostolico, Aviezri S. Fraenkel

Department of Computer Science Technical Reports

No abstract provided.


A Fast Linear Space Algorithm For Computing Longest Common Subsequences, A. Apostolio, C. Guerra Oct 1985

A Fast Linear Space Algorithm For Computing Longest Common Subsequences, A. Apostolio, C. Guerra

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.


Fast Parallel Algorithms For Voronoi Diagrams, Micahel T. Goodrich, Colm O'Dunlaing, Chee Yap Oct 1985

Fast Parallel Algorithms For Voronoi Diagrams, Micahel T. Goodrich, Colm O'Dunlaing, Chee Yap

Department of Computer Science Technical Reports

No abstract provided.


Chemical Equilibria To Model Volatilization Of Ammonia From Aquatic And Soil Systems, L. E. Sommers Oct 1985

Chemical Equilibria To Model Volatilization Of Ammonia From Aquatic And Soil Systems, L. E. Sommers

IWRRC Technical Reports Archive

No abstract provided.


Microbial Sulfate Reduction In Extremely Acid Lakes, A. E. Konopka, R. A. Gyure, W. Doemel, A. Brooks Oct 1985

Microbial Sulfate Reduction In Extremely Acid Lakes, A. E. Konopka, R. A. Gyure, W. Doemel, A. Brooks

IWRRC Technical Reports Archive

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 …