Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 25111 - 25140 of 25623

Full-Text Articles in Engineering

Networking Your Cd-Roms: A Texas Tale, Margaret Sylvia Aug 1993

Networking Your Cd-Roms: A Texas Tale, Margaret Sylvia

Faculty Publications

Installation of a CD-ROM network at St. Mary's University Academic Library created a revolution in the way students and faculty do research.


Three Points Of Great Height On Elliptic Curves, Andrew Bremner, Duncan A. Buell Jul 1993

Three Points Of Great Height On Elliptic Curves, Andrew Bremner, Duncan A. Buell

Faculty Publications

We give three elliptic curves whose generators have great height, demonstrating along the way a moderately efficient method for finding such points.


Variable Structure End Point Control Of A Flexible Manipulator, Shailaja Chenumalla, Sahjendra N. Singh Jul 1993

Variable Structure End Point Control Of A Flexible Manipulator, Shailaja Chenumalla, Sahjendra N. Singh

Electrical & Computer Engineering Faculty Research

We treat the question of control and stabilization of the elastic multibody system developed in the Phillips Laboratory, Edwards Air Force Base, California. The controlled output is judiciously chosen such that the zero dynamics are stable or almost stable. A variable structure control (VSC) law is derived for the end point trajectory control. Although, the VSC law accomplishes precise end point tracking, elastic modes are excited during the maneuver of the arm. A Linear stabilizer is designed for the final capture of the terminal state.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 6, June 1993, College Of Engineering And Computer Science, Wright State University Jun 1993

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 6, June 1993, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Tolerance Specification Of Robot Kinematic Parameters Using An Experimental Design Technique, Y.H. Andrew Liou, Paul P. Lin, Richard R. Lindeke, Hsiang-Dih Chiang Jun 1993

Tolerance Specification Of Robot Kinematic Parameters Using An Experimental Design Technique, Y.H. Andrew Liou, Paul P. Lin, Richard R. Lindeke, Hsiang-Dih Chiang

Mechanical Engineering Faculty Publications

This paper presents the tolerance specification of robot kinematic parameters using the Taguchi method. The concept of employing inner and outer orthogonal arrays to identify the significant parameters and select the optimal tolerance range for each parameter is proposed. The performance measure based on signal-to-noise ratios (S/N) using the Taguchi method is validated by Monte Carlo simulations. Finally, a step-by-step tolerance specification methodology is developed and illustrated with a planar two-link manipulator and a five-degree-of-freedom Rhino robot.


A Decision Criteria To Select An Associative-Memory Organization That Minimizes The Execution Time Of A Mix Of Associative-Search Operations, David W. Banton Jun 1993

A Decision Criteria To Select An Associative-Memory Organization That Minimizes The Execution Time Of A Mix Of Associative-Search Operations, David W. Banton

Theses and Dissertations

The dissertation develops a decision criteria to select an associative-memory organization that minimizes the execution time of a mix of associative-search operations and a decision criteria to estimate the layout dimensions of each organization for a specified memory size. The dissertation reclassifies Feng's associative-search operations into three hardware-influenced categories: bit-position independent (BPI), record-content independent (RCI); bit-position dependent (BPD), RCI; and BPD, record-content dependent (RCD). It develops a relationship between the categories and three associative-memory organizations: the CAM, the bit-serial word-parallel associative memory (BSWPAM) , and the extreme-search associative memory (ESAM). A version of the CAM, three versions of the BSWPAM, …


Building A Gateway For The Cd-Rom Network: A Step Toward The Virtual Library With The Virtual Microsystems V-Server, Margaret Sylvia Jun 1993

Building A Gateway For The Cd-Rom Network: A Step Toward The Virtual Library With The Virtual Microsystems V-Server, Margaret Sylvia

Faculty Publications

Describes one college library's experience with a gateway for dial-in access to its CD-ROM network to increase access to automated index searching for students off-campus. Hardware and software choices are discussed in terms of access, reliability, affordability, and ease of use. Installation problems are discussed, and an appendix lists product information.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 5, May 1993, College Of Engineering And Computer Science, Wright State University May 1993

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 5, May 1993, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


The Application Of Neural Networks To Optimal Robot Trajectory Planning, Daniel J. Simon May 1993

The Application Of Neural Networks To Optimal Robot Trajectory Planning, Daniel J. Simon

Electrical and Computer Engineering Faculty Publications

Interpolation of minimum jerk robot joint trajectories through an arbitrary number of knots is realized using a hardwired neural network. Minimum jerk joint trajectories are desirable for their similarity to human joint movements and their amenability to accurate tracking. The resultant trajectories are numerical rather than analytic functions of time. This application formulates the interpolation problem as a constrained quadratic minimization problem over a continuous joint angle domain and a discrete time domain. Time is discretized according to the robot controller rate. The neuron outputs define the joint angles (one neuron for each discrete value of time) and the Lagrange …


Suboptimal Robot Joint Interpolation Within User-Specified Knot Tolerances, Daniel J. Simon, Can Isik May 1993

Suboptimal Robot Joint Interpolation Within User-Specified Knot Tolerances, Daniel J. Simon, Can Isik

Electrical and Computer Engineering Faculty Publications

Approximation of a desired robot path can be accomplished by interpolating a curve through a sequence of joint-space knots. A smooth interpolated trajectory can be realized by using trigonometric splines. But, sometimes the joint trajectory is not required to exactly pass through the given knots. The knots may rather be centers of tolerances near which the trajectory is required to pass. In this article, we optimize trigonometric splines through a given set of knots subject to user-specified knot tolerances. The contribution of this article is the straightforward way in which intermediate constraints (i.e., knot angles) are incorporated into the parameter …


Ua66/3/3 Acm/Upe Awards Banquet, Association For Computing Machinery, Upsilon Pi Epsilon Apr 1993

Ua66/3/3 Acm/Upe Awards Banquet, Association For Computing Machinery, Upsilon Pi Epsilon

Student Organizations

ACM/UPE awards and initiation banquet program.


Resource Utilization Model For The Algorithm To Architecture Mapping Model, Rakesh R. Patel Apr 1993

Resource Utilization Model For The Algorithm To Architecture Mapping Model, Rakesh R. Patel

Electrical & Computer Engineering Theses & Dissertations

The analytical model for resource utilization, and the variable node time and conditional node model for the enhanced ATAMM model for a real-time data flow architecture, is presented in this research. The Algorithm To Architecture Mapping Model, ATAMM, is a Petri net based graph theoretic model developed at Old Dominion University, and is capable of modeling the execution of large-grained algorithms on a real-time data flow architecture. Using the resource utilization model, the resource envelope may be obtained directly from a given graph and, consequently, the maximum number of required resources may be evaluated. The node timing diagram for one …


Robot Force Velocity Control Using Expert System For Control Mode Changes, William R. Doggett Apr 1993

Robot Force Velocity Control Using Expert System For Control Mode Changes, William R. Doggett

Electrical & Computer Engineering Theses & Dissertations

The most important property of an automated mechanical system is reliable execution of a specified task. Automated mechanical systems work best in precisely structured environments where all operations are repeatable. Typically, these systems are difficult to modify and expensive to install. Sensors can be used to detect disturbances, thus reducing hardware cost by offsetting the need for precise rigid construction components. Sensors, however, increase the complexity and cost of the control software. Efficient methods of reacting to sensor information during automated system operation are required to reduce software complexity and expense.

This thesis analyzes a robotic construction task and describes …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 4, April 1993, College Of Engineering And Computer Science, Wright State University Apr 1993

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 4, April 1993, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


A Systolic Simulation And Transformation System, Ronald I. Greenberg, H.-C. Oh Mar 1993

A Systolic Simulation And Transformation System, Ronald I. Greenberg, H.-C. Oh

Computer Science: Faculty Publications and Other Works

This paper presents a CAD tool, SystSim, to ease the design of systolic systems. Given a high-level, functional description of processors, and a high-level description of their interconnection, SystSim will perform simulations and provide graphical output. SystSim will also perform transformations such as retiming, which eases use of the methodology of Leiserson and Saxe of designing a system with broadcasting and then obtaining a systolic system through retiming.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 3, March 1993, College Of Engineering And Computer Science, Wright State University Mar 1993

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 3, March 1993, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Design Of A Hardware Discrete Event Simulation Coprocessor, David W. Daniel Mar 1993

Design Of A Hardware Discrete Event Simulation Coprocessor, David W. Daniel

Theses and Dissertations

A hardware discrete event simulation (DES) coprocessor was designed to eliminate synchronization overhead as a possible bottleneck. The target architecture is an eight node Intel iPSC/2 Hypercube, but this design has application to future CPU designs that wish to incorporate on-chip architectural features to better support parallel processor synchronization. A structural description of a general-purpose DES hardware coprocessor is given with approximately 90 percent of the components written at the gate level. The remaining components use low-level behavioral descriptions. While the DES coprocessor microcode implements the Chandy-Misra protocol, general-purpose support for a wide-range of protocols was a primary hardware design …


Matching Points To Lines: Sonar-Based Localization For The Psubot, Kevin Blythe Stanton Feb 1993

Matching Points To Lines: Sonar-Based Localization For The Psubot, Kevin Blythe Stanton

Dissertations and Theses

The PSUBOT (pronounced pea-es-you-bought) is an autonomous wheelchair robot for persons with certain disabilities. Its use of voice recognition and autonomous navigation enable it to carry out high level commands with little or no user assistance. We first describe the goals, constraints, and capabilities of the overall system including path planning and obstacle avoidance. We then focus on localization-the ability of the robot to locate itself in space. Odometry, a compass, and an algorithm which matches points to lines are each employed to accomplish this task. The matching algorithm (which matches "points" to "lines") is the main contribution to this …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 2, February 1993, College Of Engineering And Computer Science, Wright State University Feb 1993

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 2, February 1993, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


A Sign-To-Speech Translation System, Koka Veera Raghava Rao Jan 1993

A Sign-To-Speech Translation System, Koka Veera Raghava Rao

School of Computing: Dissertations, Theses, and Student Research

This thesis describes sign-to-speech translation using neural networks. Sign language translation is an interesting but difficult problem for which neural network techniques seem promising because of their ability to adjust to the user's hand movements, which is not possible to do by most other techniques. However, even using neural networks and artificial sign languages, the translation is hard, and the best-known system, that of Fels & Hinton (1993), is capable of translating only 66 root words and 203 words including their conjugations. This research improves their results to 790 root signs and 2718 words including their conjugations while preserving a …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 1, January 1993, College Of Engineering And Computer Science, Wright State University Jan 1993

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 1, January 1993, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Visual Process Language: An Environment That Enhances Inventiveness In The System Development Process -- A Theoretical Perspective, Wita Wojtkowski, Waclaw G. Wojtkowski Jan 1993

Visual Process Language: An Environment That Enhances Inventiveness In The System Development Process -- A Theoretical Perspective, Wita Wojtkowski, Waclaw G. Wojtkowski

IT and Supply Chain Management Faculty Publications and Presentations

This paper provides a theoretical perspective on the effect of computer support on creativity. The assertion is made that artifacts of IS do not substantially differ from those of art and science, and that the creative processes leading to the artifacts are similar. It further proposes that the use of newly available computer technology, specifically, the Visual Process Language (VPL) will have much to offer in terms of augmenting creativity when constructing IS artfacts. We postulate that VPL assists the first insight, preparation and illumination steps of the creative process, and that both Association/Images and Progressive Abstraction techniques are embedded …


Graduate Catalog Center For Computer And Information Sciences, Nova Southeastern University Jan 1993

Graduate Catalog Center For Computer And Information Sciences, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


The Anatomy Of Programming Languages, Alice E. Fischer, Frances S. Grodzinsky Jan 1993

The Anatomy Of Programming Languages, Alice E. Fischer, Frances S. Grodzinsky

Electrical & Computer Engineering and Computer Science Book Series

The specific goals of this book are to help students learn: *To reason clearly about programming languages. *To develop principles of communication so that we can evaluate the wisdom and utility of the decisions made in the process of language design. *To break down language into its major components, and each component in to small pieces so that we can focus on competing alternatives. *To define a consistent and general set of terms for the components out of which programming languages are built, and the concepts on which they are based. * To use these terms to describe existing languages, …


Doctor Of Education Specialization In Computing And Information Technology, Nova Southeastern University Jan 1993

Doctor Of Education Specialization In Computing And Information Technology, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


Graduate Catalog Center For Computer And Information Sciences 1993-1994 Catalog, Nova Southeastern University Jan 1993

Graduate Catalog Center For Computer And Information Sciences 1993-1994 Catalog, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


A Characterization Of The Computational Power Of Rule-Based Visualization, Kenneth C. Cox, Gruia-Catalin Roman Jan 1993

A Characterization Of The Computational Power Of Rule-Based Visualization, Kenneth C. Cox, Gruia-Catalin Roman

All Computer Science and Engineering Research

Declarative visualization is a paradigm in which the process of visualization is treated as a mapping from some domain (typically a program) to an image. One means of declaring such mappings is through the use of rules which specify the relationship between the domain and the image. This paper examines the computational power of such rule-based mappings. Computational power is measure using three separate criteria. The first of these uses the Chomsky hierarchy, in which computational power is treated as string-acceptance; with this criterion we are able to show that certain rule-based models are equivalent in power to Turing machines. …


A Fault Tolerant Connectionist Architecture For Construction Of Logic Proofs, Gadi Pinkas Jan 1993

A Fault Tolerant Connectionist Architecture For Construction Of Logic Proofs, Gadi Pinkas

All Computer Science and Engineering Research

This chapter considers the problems of expressing logic and constructing proofs in fault tolerant connectionist networks that are based on energy minimalism. Given a first-order-logic knowledge base and a bound k, a symmetric network is constructed (like a Boltzman machine or a Hopfield network) that searches for a proof for a given query. If a resolution-based proof of length no longer than k exists, then the global minima of the energy function that is associated with the network represent such proofs. If no proof exist then the global minima indicate the lack of a proof. The network that is generated …


The Study Of Computer Science Concepts Through Game Play, Benjamin M. Weber Jan 1993

The Study Of Computer Science Concepts Through Game Play, Benjamin M. Weber

All Computer Science and Engineering Research

No abstract provided.


Reasoning About Synchrony Illustrated On Three Models Of Concurrency, Gruia-Catalin Roman, Jerome Plun Jan 1993

Reasoning About Synchrony Illustrated On Three Models Of Concurrency, Gruia-Catalin Roman, Jerome Plun

All Computer Science and Engineering Research

This paper presents a model of concurrency (Dynamic Synchrony) whose distinctive feature is a novel formal treatment of synchronization. Synchrony is defined as the coordinated execution of two or more actions. The dynamic aspect comes from the fact that the definition of which actions must be executed synchronously can change freely during the execution of the program. This unique modeling capability comes with a UNITY-stype assertional logic that can be applied to program verification and derivation. This paper shows that the proposed proof logic can be used to verify programs expressed using other models of foncurrency without having to translate …