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

Computer Engineering Commons

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

1993

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 1 - 30 of 68

Full-Text Articles in Computer Engineering

Script-Based Qos Specifications For Multimedia Presentations, Richard Staehli, Jonathan Walpole Dec 1993

Script-Based Qos Specifications For Multimedia Presentations, Richard Staehli, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Multimedia presentations can convey information not only by the sequence of events but by their timing. The correctness of such presentations thus depends on the timing of events as well as their sequence and content. This paper introduces a formal specification language for playback of real-time presentations. The main contribution of this language is a quality of service (QOS) specification that relaxes resolution and synchronization requirements for playback. Our definitions give a precise meaning to the correctness of a presentation. This specification language will form the basis for a QOS interface for reservation of operating system resources.


Declarative Representations Of Multiagent Systems, Munindar P. Singh, Michael N. Huhns, Larry M. Stevens Oct 1993

Declarative Representations Of Multiagent Systems, Munindar P. Singh, Michael N. Huhns, Larry M. Stevens

Faculty Publications

This paper explores the specification and semantics of multiagent problem-solving systems, focusing on the representations that agents have of each other. It provides a declarative representation for such systems. Several procedural solutions to a well-known test-bed problem are considered, and the requirements they impose on different agents are identified. A study of these requirements yields a representational scheme based on temporal logic for specifying the acting, perceiving, communicating, and reasoning abilities of computational agents. A formal semantics is provided for this scheme. The resulting representation is highly declarative, and useful for describing systems of agents solving problems reactively.


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.


Electronic Simulation Of The Temporal Characteristics Of Photon Memory Echoes And Some Related Applications, Yuwen Kuo, Monish Ranjan Chatterjee Aug 1993

Electronic Simulation Of The Temporal Characteristics Of Photon Memory Echoes And Some Related Applications, Yuwen Kuo, Monish Ranjan Chatterjee

Electrical and Computer Engineering Faculty Publications

The characteristics of nonlinear photon memory echoes are investigated by means of SPICE simulations using equivalent resonator ensembles. By developing implicit nonlinear circuit models in the memory echo domain, the triple product formalism of electronic holography, involving correlation and convolution, is tested for the storage and recall of arbitrary signals and/or data bit streams in both time-inverted and nontime-inverted modes. Furthermore, a few specific optical data processing applications are also simulated in which the mixed binary multiplication of two or more binary bit streams is achieved.

Higher order products, optical pattern recognition, and other possible applications are also discussed ...


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

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

Margaret Sylvia

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 and Computer Engineering Faculty Publications

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.


Fault Tolerant And Integrated Token Ring Network, Thomas Christopher Gilbar Jun 1993

Fault Tolerant And Integrated Token Ring Network, Thomas Christopher Gilbar

FIU Electronic Theses and Dissertations

This thesis is a study of communication protocols (token ring, FDDI, and ISDN), microcontrollers (68HC 1EVB), and fault tolerance schemes. One of the major weaknesses of the token ring network is that if a single station fails, the entire system fails. A scheme involving a combination of hardware and timer interrupts in the software has been designed and implemented which deals with this risk. Software and protocols have been designed and applied to the network to reduce the chance of bit faults in communications. ISDN frame format proved to be exceptional in its capacity to carry echoed data and a ...


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.


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.


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

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

Margaret Sylvia

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. 


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 Engineering & Computer Science 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 ...


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 Engineering & Computer Science 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 ...


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.


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

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

Computer Science and Engineering: Theses, Dissertations, 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 ...


Computer Model For Predicting Aids Among Intravenous Drug Users, Daniel Berleant, R. Ron Goforth, Jun Yuan Jan 1993

Computer Model For Predicting Aids Among Intravenous Drug Users, Daniel Berleant, R. Ron Goforth, Jun Yuan

Journal of the Arkansas Academy of Science

Intravenous drug abuse (IVDA) is an important cause of HIV transmission. Computer simulation is one way to understand and predict the spread of HIV infection among IVDAs. We design and simulate HIV infection among IVDAs and the impact of AIDS on this community, and thereby predict future IVDA population, HIV levels, AIDS levels, and AIDS deaths in this group. The HIV to AIDS, and AIDS to Death latencies are described by probability density functions (PDFs) in this model. Factors such as the recruit, quit, and normal death rate of IVDAs, are considered, as well as the infection and removal rates ...


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 ...


Doctoral Program Computing Technology In Education 1993-1994, Nova Southeastern University Jan 1993

Doctoral Program Computing Technology In Education 1993-1994, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


Intel Nx To Pvm 3.2 Message Passing Conversion Library, Trey Arthur, Michael L. Nelson Jan 1993

Intel Nx To Pvm 3.2 Message Passing Conversion Library, Trey Arthur, Michael L. Nelson

Computer Science Faculty Publications

NASA Langley Research Center has developed a library that allows Intel NX message passing codes to be executed under the more popular and widely supported Parallel Virtual Machine (PVM) message passing library. PVM was developed at Oak Ridge National Labs and has become the defacto standard for message passing. This library will allow the many programs that were developed on the Intel iPSC/860 or Intel Paragon in a Single Program Multiple Data (SPMD) design to be ported to the numerous architectures that PVM (version 3.2) supports. Also, the library adds global operations capability to PVM. A familiarity with ...


A Comparison Of Queueing, Cluster And Distributed Computing Systems, Joseph A. Kaplan, Michael L. Nelson Jan 1993

A Comparison Of Queueing, Cluster And Distributed Computing Systems, Joseph A. Kaplan, Michael L. Nelson

Computer Science Faculty Publications

Using workstation clusters for distributed computing has become popular with the proliferation of inexpensive, powerful workstations. Workstation clusters offer both a cost effective alternative to batch processing and an easy entry into parallel computing. However, a number of workstations on a network does not constitute a cluster. Cluster management software is necessary to harness the collective computing power. A variety of cluster management and queuing systems are compared: Distributed Queueing Systems (DQS), Condor, Load Leveler, Load Balancer, Load Sharing Facility (LSF - formerly Utopia), Distributed Job Manager (DJM), Computing in Distributed Networked Environments (CODINE), and NQS/Exec. The systems differ in ...


Application Of Artificial Neural Networks To Optimization Problems In Electrical Power Operation, Jayant Kumar Jan 1993

Application Of Artificial Neural Networks To Optimization Problems In Electrical Power Operation, Jayant Kumar

Retrospective Theses and Dissertations

No abstract provided.


The Washington University Multimedia System, William D. Richard, Jerome R. Cox Jr., Brian Gottlieb, Ken Krieger Jan 1993

The Washington University Multimedia System, William D. Richard, Jerome R. Cox Jr., Brian Gottlieb, Ken Krieger

All Computer Science and Engineering Research

The Washington University Multimedia System (MMS) is a complete multimedia system capable of transmitting and receiving video, audio, and radiological images, in addition to normal network traffic, over the Washingon University broadband ATM network. The MMS consists of an ATMizer and three multimedia subsystems. The ATMizer implements the host interface, the interface to the ATM network, and the interface to the three multimedia subsystems. The video sybsystem encodes and decodes JPEG compressed video using two hardware compression engines. The audio subsystem encodes and decodes CD-quality stereo audio. The high-speed radiological image subsystem reformats radiological image data transmitted by a dedicated ...


Asking Questions To Minimize Errors, Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar Jan 1993

Asking Questions To Minimize Errors, Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar

All Computer Science and Engineering Research

A number of efficient learning algorithms achieve exact identification of an unknown function from some clas using membership and equivalence queries. Using a standard transformation such algorithms can easily be converted to on-line learning algorithms that use membership queries. Under such a transformation the number of equivalence queries made by the query algorithm directly corresponds to the number of mistakes made by the on-line algorithm. In this paper we consider several of the natural classes known to be learnable in this setting, and investigate the minimum number of equivalence queries with accompanying counterexamples (or equivalently the minimum number of mistakes ...


Efficiently Computing {Phi}-Nodes On-The-Fly, Ron K. Cytron, Jeanne Ferrante Jan 1993

Efficiently Computing {Phi}-Nodes On-The-Fly, Ron K. Cytron, Jeanne Ferrante

All Computer Science and Engineering Research

Recently, Static Single Assignment Form and Sparse Evaluation Graphs have been advanced for the efficient solution of program optimization problems. Each method is provided with an initial set of flow graph nodes that inherently affect a problem's solution. Other relevant nodes are those where potentially disparate solutions must combine. Previously, these so-called {phi}-nodes were found by computing the iterated dominance frontiers of the initial set of nodes, a process that could take worst case quadratic time with respect to the input flow graph. In this paper we present an almost-linear algorithm for detemining exactly the same set of ...


Supervised Competitive Learning With Backpropagation Network And Fuzzy Logic, Takayuki Dan Kimura, Thomas H. Fuller Jr., Ce Wang Jan 1993

Supervised Competitive Learning With Backpropagation Network And Fuzzy Logic, Takayuki Dan Kimura, Thomas H. Fuller Jr., Ce Wang

All Computer Science and Engineering Research

SCL assembles a set of learning modules into a supervised learning system to address the stability-plasticity dilemma. Each learning module acts as a similarity detector for a prototype, and includes prototype resetting (akin to that of ART) to respond to new prototypes. Here (Part I) we report SCL results using back-propagation networks as the learning modules. We used two feature extractors: about 30 energy-based features, and a combination of energy-based and graphical features (about 60). ACL recognized 96% (energy) and 99% (energy/graphical) of test digits, and 91% (energy) and 96% (energy/graphical) of test letters. In the accompanying paper ...


A Comparison Study Of The Pen And The Mouse In Editing Graphic Diagrams, Ajay Apte, Takayuki Dan Kimura Jan 1993

A Comparison Study Of The Pen And The Mouse In Editing Graphic Diagrams, Ajay Apte, Takayuki Dan Kimura

All Computer Science and Engineering Research

We report the results of an experiment comparing the merits of the pen and the mouse as drawing devices. For this study a pen-based graphic diagram editor equipped with a shape recognition algorithm was developed on GO's PenPoint operating system. A commercially available drawing program on NeXT was used for mouse-based editing. Twelve CS students were chosen as subjects and asked to draw four different diagrams of similar complexity: two with a pen and the other two with a mouse. The diagrams are chosen from the categories of dataflow visual language, Petri nets, flowcharts, and state diagrams. The results ...


A Taxonomy Of Program Visualization Systems, Gruia-Catalin Roman, Kenneth C. Cox Jan 1993

A Taxonomy Of Program Visualization Systems, Gruia-Catalin Roman, Kenneth C. Cox

All Computer Science and Engineering Research

Program visualization may be viewed as a mapping from programs to graphical representations. This simple idea provides a formal framework for a new taxonomy of program visualization systems. The taxonomy is compared briefly against previous attempts to organize the program visualization field. The taxonomic principles and their motivation are explained in detail with reference to a number of existing systems, especially Balsa, Tango, and Pavane.


The Dim System: Woz Simulation Results - Phase Ii, Anne Johnstone, Umesh Berry, Tina Nguyen Jan 1993

The Dim System: Woz Simulation Results - Phase Ii, Anne Johnstone, Umesh Berry, Tina Nguyen

All Computer Science and Engineering Research

We report an experiment designed to compare human-human spoken dialogues with human-computer spoken dialogue. Our primary purpose was to collect data on the kinds of protocols that were used to control the interaction. Three groups of 12 subjects each were asked to complete tasks over the phone. These tasks involved the use of custom-calling features such as call-forwarding and speed-dialing. The experimental procedure was a new variation on the Wizard of Oz (WOZ) technique that allowed much clearer comparisons to be made between human-human and human-computer interactions. Subjects in the Operator Group were told they were talking to a human ...


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 ...


Clothespins On Timelines: Utilities And The Interval Representation Of Time, R. P. Loui, Jersey Chen Jan 1993

Clothespins On Timelines: Utilities And The Interval Representation Of Time, R. P. Loui, Jersey Chen

All Computer Science and Engineering Research

We discuss the problem of representing utility in planning systems that are based on Allen's [83] popular ontology for planning, which represents actions and events as time intervals. We identify a small number of primitive functions on time intervals which may be helpful in representing preference and also in eliminating dominated actions. Assuming that utility can be decomposed to take advantage of these primitives, these functions provide one solution to the problem of specifying utility in such expressive planning languages. We identify a restricted class of utility expressions that generate linear programming problems. The contribution is not deep, but ...