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 43621 - 43650 of 50088

Full-Text Articles in Entire DC Network

Application Calling, Michael E. Hussey, John C. Lindenlaub Nov 1988

Application Calling, Michael E. Hussey, John C. Lindenlaub

Department of Electrical and Computer Engineering Technical Reports

The motivation for the development of Application Calling grew from an interest in offering a large number of users access to software on an AppleTalk network. The goal of Application Calling was to give access to applications and yet: • limit the disk space requirements • protect software vendors from unauthorized copying of software • maintain the standard Macintosh interface • allow for easy software updates Application Calling does this by using a different method of accessing software. Instead of every user having a copy of an application, every user has a copy of a small file which launches or …


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.


Model For An Intelligent Operating System For Executing Tasks On A Reconfigurable Parallel Architecture, C. Henry Chu, Edward J. Delp, Leah H. Jamieson, Howard Jay Siegel, Frank J. Weil, Andrew B. Whinston Nov 1988

Model For An Intelligent Operating System For Executing Tasks On A Reconfigurable Parallel Architecture, C. Henry Chu, Edward J. Delp, Leah H. Jamieson, Howard Jay Siegel, Frank J. Weil, Andrew B. Whinston

Department of Electrical and Computer Engineering Technical Reports

Parallel processing is one approach to achieve the large computational processing capabilities required by many real-time computing tasks. One of the problems that must be addressed in the use of reconfigurable multiprocessor systems is matching the architecture configuration to the algorithms to be executed. This paper presents a conceptual model that explores the potential of artificial intelligence tools, specifically expert systems, to design an Intelligent Operating System for multiprocessor systems. The target task is the implementation of image understanding systems on multiprocessor architectures. PASM is used as an example multiprocessor. The Intelligent Operating System concepts developed here could also be …


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.


On An Ssor Matari Relationship And Its Consequences, S. Galanis, A. Hadjidimos, D. Noutsos Oct 1988

On An Ssor Matari Relationship And Its Consequences, S. Galanis, A. Hadjidimos, D. Noutsos

Department of Computer Science Technical Reports

No abstract provided.


Parallel Algorithms For Evaluating Sequences Of Set-Manipulation Operations, Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju Sep 1988

Parallel Algorithms For Evaluating Sequences Of Set-Manipulation Operations, Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju

Department of Computer Science Technical Reports

No abstract provided.


Are You Getting Your Money's Worth In Street Construction, Charles F. Scholer Sep 1988

Are You Getting Your Money's Worth In Street Construction, Charles F. Scholer

Indiana Local Technical Assistance Program (LTAP) Publications

A presentation on how to have an effective quality assurance program for street construction.


On Local Implicit Approximation And Its Applications, Jung Hong Chuang, Christoph M. Hoffmann Sep 1988

On Local Implicit Approximation And Its Applications, Jung Hong Chuang, Christoph M. Hoffmann

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.


A Note On The Complexity Of A Simple Transportation Problem, Greg N. Frederickson Sep 1988

A Note On The Complexity Of A Simple Transportation Problem, Greg N. Frederickson

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.


Task Planner For Simultaneous Fulfillment Of Operational, Geometric And Uncertainty-Reduction Goals, S. A. Hutchinson, A. C. Kak Sep 1988

Task Planner For Simultaneous Fulfillment Of Operational, Geometric And Uncertainty-Reduction Goals, S. A. Hutchinson, A. C. Kak

Department of Electrical and Computer Engineering Technical Reports

Our ultimate goal in robot planning is to develop a planner which can create complete assembly plans given as input a high level description of assembly goals, geometric models of the components of the assembly, and a description of the capabilities of the work cell (including the robot and the sensory system). In this paper, we introduce SPAR, a planning system which reasons about high level operational goals, geometric goals and uncertainty-reduction goals in order to create assembly plans which consist of manipulations as well as sensory operations when appropriate. Operational planning is done using a nonlinear, constraint posting planner. …


Simplification Of Manipulator Dynamic Model For Nonlinear Decoupled Control, J. W. Jeon, C S. G. Lee Sep 1988

Simplification Of Manipulator Dynamic Model For Nonlinear Decoupled Control, J. W. Jeon, C S. G. Lee

Department of Electrical and Computer Engineering Technical Reports

This paper presents the development of simplified manipulator dynamic models which satisfy the desired steady-state error specification in the joint-variable space or in the Cartesian space under a nonlinear decoupled controller. The formulae which relate the tracking errors of joint variables in the joint-variable space or the manipulator hand in the Cartesian space to the dynamic modeling errors are first developed. Using these formulae, we derive the maximum error tolerance for each dynamic coefficient of the equations of motion. Then each simplified dynamic coefficient of the equations of motion can be expressed as a linear combination of the product terms …


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.


Efficient Algorithms For Hybrid Data/Voice Transmissions, Andrzej Kusiuk, Wojciech Szpankowski Aug 1988

Efficient Algorithms For Hybrid Data/Voice Transmissions, Andrzej Kusiuk, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Output-Sensitive Hidden Surface Elimination For Rectangles, Mikhail J. Atallah, Michael T. Goodrich Aug 1988

Output-Sensitive Hidden Surface Elimination For Rectangles, Mikhail J. Atallah, Michael T. Goodrich

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.


A Formalism For Describing Data Distribution, Charles Koelbel Aug 1988

A Formalism For Describing Data Distribution, Charles Koelbel

Department of Computer Science Technical Reports

No abstract provided.


Time-Varying Images: The Effect Of Finite Resolution On Uniqueness, Chia-Hoang Lee Aug 1988

Time-Varying Images: The Effect Of Finite Resolution On Uniqueness, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.


Analysis Of A Two Level Asynchronous Algorithm For Pdes, John R. Rice, Dan C. Marineseu Aug 1988

Analysis Of A Two Level Asynchronous Algorithm For Pdes, John R. Rice, Dan C. Marineseu

Department of Computer Science Technical Reports

No abstract provided.


An Optimal Parallel Algorithm For Preemptive Job Scheduling That Minimizes Maximum Lateness, Susan Rodger Aug 1988

An Optimal Parallel Algorithm For Preemptive Job Scheduling That Minimizes Maximum Lateness, Susan Rodger

Department of Computer Science Technical Reports

No abstract provided.


A User Guide To The Algorithm Mapper: A System For Modeling And Evaluating Parallel Applications/Architecture Pairs, C. E. Houstis, Elias N. Houstis, John R. Rice, S. M. Samartizis, D.L. Alexandrakis Aug 1988

A User Guide To The Algorithm Mapper: A System For Modeling And Evaluating Parallel Applications/Architecture Pairs, C. E. Houstis, Elias N. Houstis, John R. Rice, S. M. Samartizis, D.L. Alexandrakis

Department of Computer Science Technical Reports

No abstract provided.


Symbolic Analysis Of Large-Scale Networks, M. M. Hassoun, P. M. Lin Aug 1988

Symbolic Analysis Of Large-Scale Networks, M. M. Hassoun, P. M. Lin

Department of Electrical and Computer Engineering Technical Reports

A new approach to the problem of symbolic circuit analysis of large-scale circuits is presented in this report. The methodology has been implemented in a computer program called SCAPP (Symbolic Circuit Analysis Program with Partitioning). The method solves the problem by utilizing a hierarchical network approach and the sequence of expressions concept rather than a topological approach and the single expression idea which have dominated symbolic analysis in the past. The method employs further modifications to the modified nodal analysis (MNA) technique by allowing ideal opamps in the matrix formulation process and introducing the reduced modified analysis matrix (RMNA). The …


On-Line Object Feature Extraction For Multispectral Scene Representation, Hassan Ghassemian, David Landgrebe Aug 1988

On-Line Object Feature Extraction For Multispectral Scene Representation, Hassan Ghassemian, David Landgrebe

Department of Electrical and Computer Engineering Technical Reports

This thesis investigates a new on-line unsupervised object-feature extraction method that reduces the complexity and costs associated with the analysis of the multispectral image data and the data transmission, storage, archival and distribution as well. Typically in remote sensing a scene is represented by the spatially disjoint pixel-oriented features. It would appear possible to reduce data redundancy by an on-line unsupervised object-feature extraction process, where combined spatial-spectral object's features, rather than the original pixel-features, are used for multispectral scene representation. The ambiguity in the object detection process can be reduced if the spatial dependencies, which exist among the adjacent pixels, …