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 42061 - 42090 of 50110

Full-Text Articles in Entire DC Network

Foodservice Waste Management: A Model For Action, Robert D. Buchanan Aug 1992

Foodservice Waste Management: A Model For Action, Robert D. Buchanan

Historical Documents of the Purdue Cooperative Extension Service Archive

No abstract provided.


Remote Memory Backing Storage For Distributed Virtual Memory Operating Systems (Thesis), James Griffoen Aug 1992

Remote Memory Backing Storage For Distributed Virtual Memory Operating Systems (Thesis), James Griffoen

Department of Computer Science Technical Reports

No abstract provided.


Investigation And Development Of A Transient Absorber Diode Using Gallium Arsenide, Rahil Hasan, James A. Cooper Jr. Aug 1992

Investigation And Development Of A Transient Absorber Diode Using Gallium Arsenide, Rahil Hasan, James A. Cooper Jr.

Department of Electrical and Computer Engineering Technical Reports

The design and development of a transient absorber, abbreviated transorb, is presented. The device is required to protect components from voltage transients up tc 150 A at 60 V. The design is implemented using back-to-back p-i-n diodes. A three mask;-step fabrication sequence is used. Device characterization and simulation shout that a device of area 0.04cm2 meets the required specifications. We are successfuly ablle to operate devices of area less than 10-4cm2 at the required current densities. Devices of larger areas are subject to material limitations with current gallium arsenide technology.


On Parallel Rectilinear Obstacle-Avoiding Paths, Mikhail J. Atallah, Danny Z. Chen Aug 1992

On Parallel Rectilinear Obstacle-Avoiding Paths, Mikhail J. Atallah, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.


A Decision Boundary Method For Embedding Selection, W. Hsu, L. S. Hsu, M. F. Tenorio Aug 1992

A Decision Boundary Method For Embedding Selection, W. Hsu, L. S. Hsu, M. F. Tenorio

Department of Electrical and Computer Engineering Technical Reports

Previously, we have presented a method for embedding selection based on cluster analysis. In this paper, we described an embedding selection method based on a feature reduction transformation matrix. This method extracts features that are important for maintaining decision boundaries in the supervised clusters. Experimentally, we demonstrate that our method allow accurate prediction of the Mackay-Glass chaotic time series. Three important properties of the feature reduction transformation are proved in this paper.


An X11-Based Japanese Language Processing And Learning Environment, Boon-Lock Yeo, Minerva Yeung, Anthony A. Maciejewski Aug 1992

An X11-Based Japanese Language Processing And Learning Environment, Boon-Lock Yeo, Minerva Yeung, Anthony A. Maciejewski

Department of Electrical and Computer Engineering Technical Reports

No abstract


Data On English To Japanese Transliteration Of Technical Terminology, Yun-Sun Kang, Anthony A. Maciejewski Aug 1992

Data On English To Japanese Transliteration Of Technical Terminology, Yun-Sun Kang, Anthony A. Maciejewski

Department of Electrical and Computer Engineering Technical Reports

No abstract.


Computing The All-Pairs Longest Chains In The Plane, Mikhail J. Atallah, Danny Z. Chen Aug 1992

Computing The All-Pairs Longest Chains In The Plane, Mikhail J. Atallah, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.


Architecture Of The Relax Problem Solving Environment, H. Scott Mcfaddin, John R. Rice Aug 1992

Architecture Of The Relax Problem Solving Environment, H. Scott Mcfaddin, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


On The Mapping Of Partial Differential Equation Computations Onto Distributed Memory Mimd Parallel Machines (Ph.D. Thesis), Nikos Chrisochoides Aug 1992

On The Mapping Of Partial Differential Equation Computations Onto Distributed Memory Mimd Parallel Machines (Ph.D. Thesis), Nikos Chrisochoides

Department of Computer Science Technical Reports

No abstract provided.


Observing Reusable Password Choices, Eugene H. Spafford Jul 1992

Observing Reusable Password Choices, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


Why That Expression Has This Type, And How It Got It, Mike Beaven Jul 1992

Why That Expression Has This Type, And How It Got It, Mike Beaven

Department of Computer Science Technical Reports

No abstract provided.


Pattern Matching With Mismatches: A Simple Randomized Algorithm And Its Analysis, Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski Jul 1992

Pattern Matching With Mismatches: A Simple Randomized Algorithm And Its Analysis, Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


A Data Structure For Dynamically Maintaining Rooted Trees, Greg N. Frederickson Jul 1992

A Data Structure For Dynamically Maintaining Rooted Trees, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.


On The Separability Problem Of Real Functions And Its Significance In Solid Modeling, Christoph M. Hoffmann Jul 1992

On The Separability Problem Of Real Functions And Its Significance In Solid Modeling, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.


Piecewise Rational Approximations Of Real Algebraic Curves, Chanderjit L. Bajaj, Guoliang Xu Jul 1992

Piecewise Rational Approximations Of Real Algebraic Curves, Chanderjit L. Bajaj, Guoliang Xu

Department of Computer Science Technical Reports

No abstract provided.


Using The Extra Stage Cube Multipath Network To Reduce The Impact Of Hot Spots, Mu- Cheng Wang, Howard Jay Siegel, Mark A. Nichols, Seth Abraham Jul 1992

Using The Extra Stage Cube Multipath Network To Reduce The Impact Of Hot Spots, Mu- Cheng Wang, Howard Jay Siegel, Mark A. Nichols, Seth Abraham

Department of Electrical and Computer Engineering Technical Reports

One type of interconnection network for a medium to large-scale parallel processing system (i.e., a system with 26 to 216 processors) is a buffered packet-switched multistage interconnection network (MIN). It has been shown that the performance of these networks is satisfactory for uniform network traffic. More recently, several studies have indicated that the performance of MINs is degraded significantly when there is hot spot traffic, that is, a large fraction of the messages are routed to one particular destination. A multipath MIN is a MIN with two or more paths between all source and destination pairs. This research investigates how …


On Global Transaction Scheduling Criteria In Multidatabase Systems, Aidong Zhang, Ahmed K. Elmagarmid Jul 1992

On Global Transaction Scheduling Criteria In Multidatabase Systems, Aidong Zhang, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.


The Use Of The Discrete Fourier Transform To Calculate The Spatial Response Of Line-Driven, Layer-Wise Homogeneous Acoustically-Loaded Panels, J Stuart Bolton, Thomas J. Wahl Jul 1992

The Use Of The Discrete Fourier Transform To Calculate The Spatial Response Of Line-Driven, Layer-Wise Homogeneous Acoustically-Loaded Panels, J Stuart Bolton, Thomas J. Wahl

Publications of the Ray W. Herrick Laboratories

No abstract provided.


On Structure Features Of Global Transactions In Multidatabase Systems, Aidong Zhang, Jin Jing Jul 1992

On Structure Features Of Global Transactions In Multidatabase Systems, Aidong Zhang, Jin Jing

Department of Computer Science Technical Reports

No abstract provided.


Lower Bounds On Threshold And Related Circuits Via Communication Complexity, V. P. Roychowdhury, K. Y. Siu, A. Orlitsky Jul 1992

Lower Bounds On Threshold And Related Circuits Via Communication Complexity, V. P. Roychowdhury, K. Y. Siu, A. Orlitsky

Department of Electrical and Computer Engineering Technical Reports

Communication-complexity definitions and arguments are used to derive linear (Q(n)) and almost-linear (Q(n/ log n)) lower bounds on the size of circuits implementing certain functions. The techniques utilize only basic features of the gates used and of the functions implemented hence apply to a large class of gates (including unbounded fan-in AND/OR, threshold, symmetric, and generalized symmetric) and to a large class of functions (including equality, comparison, and inner product mod 2). Each of the bounds derived is shown to be tight for some functions and some applications to threshold-circuit complexity are indicated. The results generalize and in some cases …


Self-Aligned Single Crystal Contacted High-Speed Silicon Bipolar Transistor Utilizing Selective (Seg) And Confined Selective Epitaxial Growth (Clseg), James W. Siekkinen, Gerold W. Neudeck Jul 1992

Self-Aligned Single Crystal Contacted High-Speed Silicon Bipolar Transistor Utilizing Selective (Seg) And Confined Selective Epitaxial Growth (Clseg), James W. Siekkinen, Gerold W. Neudeck

Department of Electrical and Computer Engineering Technical Reports

A new high-speed bipolar transistor structure, the ELOBJT-3, is proposed as a novel application of selective epitaxy technology. The new structure is greatly suited to high-speed ECL circuits, where Ccb, C,, and Rbx are of prime importance. The reduction of these parasitics to their nearly theoretical minimums is accomplished through the use of dielectric isolation and concentric contacting. For extremely high speed operation, dimensions can be scaled to sub-micron size due to the completely self-aligned emitter-base region. Simulation was used to compare important device parameters of the ELOBJT-3 device and a comparably sized existing high speed bipolar structure. Results showed …


Report Of The Purdue Workshop On Grand Challenges In Computer Architecture! For The Support Of High Performance Computing, Howard Jay Siege1, Seth Abraham, William L. Bain, Kenneth E. Batcher, Thomas L. Casavant, Doug Degroot, Jack B. Dennis, David C. Douglas, Tse-Yun Feng, James R. Goodman, Alan Huang, Harry F. Jordan, J. Robert Jump, Yale N. Patt, Alan Jay Smith, James E. Smith, Lawrence Snyder, Harold S. Stone, Russ Tuck, Benjamin W. Wah Jul 1992

Report Of The Purdue Workshop On Grand Challenges In Computer Architecture! For The Support Of High Performance Computing, Howard Jay Siege1, Seth Abraham, William L. Bain, Kenneth E. Batcher, Thomas L. Casavant, Doug Degroot, Jack B. Dennis, David C. Douglas, Tse-Yun Feng, James R. Goodman, Alan Huang, Harry F. Jordan, J. Robert Jump, Yale N. Patt, Alan Jay Smith, James E. Smith, Lawrence Snyder, Harold S. Stone, Russ Tuck, Benjamin W. Wah

Department of Electrical and Computer Engineering Technical Reports

The Purdue Workshop on Grand Challenges in Computer Architecture fbr the Support of High Performance Computing was held at Purdue University on December 12 and 13, 1991. The workshop was sponsored by the National Science Foundation to identify critical research topics in computer architecture as they relate to high performance computing. After a wide-ranging discussion of the computational characteristics and requirements of the grand challenge applications, four major architectural challenges were identified as crucial to advancing the state of the art of high performance computation in the coming decade. These computer architecture grand challenges are summarized below. Challenge I : …


Classification Of Linearly Non-Separable Patterns By Linear Threshold Elements, Vwani P. Roychowdhury, Kai-Yeung Siu, Thomas Kailath Jul 1992

Classification Of Linearly Non-Separable Patterns By Linear Threshold Elements, Vwani P. Roychowdhury, Kai-Yeung Siu, Thomas Kailath

Department of Electrical and Computer Engineering Technical Reports

Learning and convergence properties of linear threshold elements or percept,rons are well understood for the case where the input vectors (or the training sets) to the perceptron are linearly separable. However, little is known about the behavior of a linear threshold element when the training sets are linearly non-separable. In this paper we present the first known results on the structure of linearly non-separable training sets and on the behavior of perceptrons when the set of input vectors is linearly non-separable. More precisely, we show that using the well known perceptron learning algorithm a linear threshold element can learn the …


A Practical Approach To Ll(K); Llm(N), Terence J. Parr, Henry G. Dieb Jul 1992

A Practical Approach To Ll(K); Llm(N), Terence J. Parr, Henry G. Dieb

Department of Electrical and Computer Engineering Technical Reports

In terms of recognition strength, LL techniques are widely held to be inferior to LR parsers. The fact that any LR (k) grammar can be rewritten to be LR (I), whereas LL(k) is stronger than LL (I), appears to give LR techniques the additional benefit of not requiring k-token lookahead and its associated ovehead. In this paper, we suggest that LL(k) is actually superior to LR (1) when translation, rather than acceptance, is the goal. Further, a practical method of generating efficient LL(k) parsers is presented. This practical approach is based on the fact that most parsing decisions in a …


Coding Multiway Branches Using Customized Hash Functions, H. G. Dietz Jul 1992

Coding Multiway Branches Using Customized Hash Functions, H. G. Dietz

Department of Electrical and Computer Engineering Technical Reports

In most modem languages, there is a construct that allows the programmer to directly represent a multiway branch based on the value of an expression. In Pascal, it is the case statement; in C:, it is the switch and in Fortran-90 the SELECT. However, it is quite common that the efficiency of these constructs is far worse than one might reasonably expeat. This paper discusses the construction and use of customized hash functions to consistently improve execution speedl and reduce memory usage for such consuucts. Performance results are given, including some that lead to the suggestion that adding a population …


Frames: A Simple Characterization Of Permutations Realized By Frequently Used Networks, Hasan Cam, Jose A.B. Fortes Jul 1992

Frames: A Simple Characterization Of Permutations Realized By Frequently Used Networks, Hasan Cam, Jose A.B. Fortes

Department of Electrical and Computer Engineering Technical Reports

Rearrangeable multistage interconnection networks such as the Benes network realize any permutation, yet their routing algorithms are not cost-effective. On the other hand, non-rearrangeable networks can have inexpensive routing algorithms, but no simple technique exists to characterix all the permutations realized on these netwarks. This paper introduces the concept of frame and shows how iit can be used to characterize all the permutations realized on various multistage inteirconnection networks. They include any subnetwork of the Benes network, the class of networks that are topologically equivalent to the baseline network, and cascaded baseline and shuffle-exchange networks. The question of how the …


Multi-Reference Nearfield Acoustical Holography, J. Stuart Bolton, Darren Hallman Jul 1992

Multi-Reference Nearfield Acoustical Holography, J. Stuart Bolton, Darren Hallman

Publications of the Ray W. Herrick Laboratories

No abstract provided.


Evidence That Free Fatty Acid-Iron Complexes Directly Initiate Lipid Peroxidation In Vitro And In Vivo: A New Mechanism Of Oxidative Stress, Steven C. Salaris, Charles F. Babbs, Joann Pham, John J. Turek Jun 1992

Evidence That Free Fatty Acid-Iron Complexes Directly Initiate Lipid Peroxidation In Vitro And In Vivo: A New Mechanism Of Oxidative Stress, Steven C. Salaris, Charles F. Babbs, Joann Pham, John J. Turek

Weldon School of Biomedical Engineering Faculty Working Papers

Through a series of biochemical and histochemical experiments we explored the novel hypothesis that iron and free fatty acids, liberated after tissue injury, combine to form liposoluble complexes that directly initiate lipid peroxidation. The addition of 100 M ferric iron to 30 mM linoleate suspensions at pH 7.4 produced time dependent lipid peroxidation, measured as conjugated diene formation. Complexes of 100 M ferric iron and 600 M pentanoate also initiated formation of conjugated dienes in linoleate suspensions and formation of malondialdehyde-like materials in rat liver slices. A histochemical stain for free fatty acids revealed positive reactions within cell membranes in …


Linear Assignment Problem Revisited: Average (1 + 1/E)-Out Degree Bipartite Graph Has A Perfect Match, Michael Karoński, Wojciech Szpankowski Jun 1992

Linear Assignment Problem Revisited: Average (1 + 1/E)-Out Degree Bipartite Graph Has A Perfect Match, Michael Karoński, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.