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

Digital Commons Network™

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

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 25261 - 25290 of 25759

Full-Text Articles in Entire DC Network

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.

Go to article

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.

Go to article

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 …

Go to article

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 …

Go to article

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.

Go to article

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 …

Go to article

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.

Go to article

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 …

Go to article

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.

Go to article

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, …

Go to article

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.

Go to article

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.

Go to article

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 …

Go to article

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 …

Go to article

Research Proposal: Preference Acquisition Through Reconciliation Of Inconsistencies, Nilesh L. Jain Jan 1993

Research Proposal: Preference Acquisition Through Reconciliation Of Inconsistencies, Nilesh L. Jain

All Computer Science and Engineering Research

The quality of performance of a decision-support system (or an expert system) is determined to a large extent by its underlying preference model (or knowledge base). The difficulties in preference and knowledge acquisition make them a major focus of current research in decision-support and expert systems. Researchers have used various concepts to develop promising acquisition techniques. One of the concepts used is knowledge maintenence where the knowledge base is changed in response to incorrect or inadequate performance by the expert system. This dissertation investigates a preference acquisition technique based on the reconciliation of inconsistencies between the preference model and the …

Go to article

Clinical Decision-Support Systems In Radiation Therapy, Nilesh L. Jain, Michael G. Kahn Jan 1993

Clinical Decision-Support Systems In Radiation Therapy, Nilesh L. Jain, Michael G. Kahn

All Computer Science and Engineering Research

Computers have been used in radiation therapy since the early 1960s to perform dose calculations. In the last decade, researchers have developed computer-based clinical decision-support systems for assisting in different decision-making tasks in radiation therapy. This paper reviews eleven prototype systems developed for target volume delineation, treatment planning, treatment plan evaluation, and treatment machine diagnosis. The advent of three-dimensional (3D) conformal radiation therapy (CRT) provides radiation oncologists with the opportunity to consider innovative beam arrangements which were not possible in two-dimensional class solutions. The difficulty of manually generating the thousands of clinically plausible 3D treatment plans calls for the use …

Go to article

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

Go to article

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 (Part II), …

Go to article

Approximation Algorithms For Configuring Hierarchical Nonblocking Communication Networks, J. Andrew Fingerhut Jan 1993

Approximation Algorithms For Configuring Hierarchical Nonblocking Communication Networks, J. Andrew Fingerhut

All Computer Science and Engineering Research

A framework is given for specifying nonblocking traffic limits in a connection-oriented communications network. In this framework, connections may be point-to-point or mutlipoint, and the data rates may vary from one connection to another. The traffic limits may be "flat", or they may also be hierarchical, representing communities of interest within the network that have higher traffic among themselves than with the rest of the network. The communication networks are constructed from switches (or nodes) and trunks, which connect pairs of switches. This framework is intended to model Asynchronous Transfer Mode (ATM) networks and traffic. We present a way of …

Go to article

Teaching A Smarter Learner, Sally A. Goldman, H. David Mathias Jan 1993

Teaching A Smarter Learner, Sally A. Goldman, H. David Mathias

All Computer Science and Engineering Research

We introduce a formal model of teaching in which the teacher is tailored to a particular learner, yet the teaching protocol is designed so that no collusion is possible. Not surprisingly, such a model remedies the non-intuitive aspects of otehr models in which the teacher must successfully teach any consistent learner. We prove that any class that can be exactly identified by a deterministic polynomial-time algorithm with access to a very rich set of example-based queries is teachable by a computationally unbounded teacher and a polynomial-time learner. In addition, we present other general results relating this model of teaching to …

Go to article

Improving The Speed Of A Distributed Checkpointing Algorithm, Sachin Garg, Kenneth F. Wong Jan 1993

Improving The Speed Of A Distributed Checkpointing Algorithm, Sachin Garg, Kenneth F. Wong

All Computer Science and Engineering Research

This paper shows how Koo and Toueg's distributed checkpointing algorithm can be modified so as to substantially reduce the average message volume. It attempts to avoid O(n{squared}) messages by using dependency knowledge to reduce the number of checkpoint request messages. Lemmas on consistency and termination are also included.

Go to article

Dynamic Reconfiguration With I/O Abstraction, Bala Swaminathan, Kenneth J. Goldman Jan 1993

Dynamic Reconfiguration With I/O Abstraction, Bala Swaminathan, Kenneth J. Goldman

All Computer Science and Engineering Research

Dynamic reconfiguration is explored in the context of I/O abstraction, a new programming model that defines the communication structure of a system in terms of connections among well-defined data interfaces for the modules in the system. The properties of I/O abstraction, particularly the clear separation of computation from communication and the availability of a module's state information, help simplify the reconfiguration strategy. Both logical and physical reconfiguration are discussed, with an emphasis on a new module migration mechanism that (1) takes advantage of the underlying I/O abstraction model, (2) avoids the expense and complication of state extraction techniques, (3) minimizes …

Go to article

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.

Go to article

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 {phi}-nodes.

Go to article

Trainrec: A System For Training Feedforward & Simple Recurrent Networks Efficiently And Correctly, Barry L. Kalman, Stan C. Kwasny Jan 1993

Trainrec: A System For Training Feedforward & Simple Recurrent Networks Efficiently And Correctly, Barry L. Kalman, Stan C. Kwasny

All Computer Science and Engineering Research

TRAINREC is a system for training feedforward and recurrent neural networks that incorporates several ideas. It uses the conjugate-gradient method which is demonstrably more efficient than traditional backward error propagation. We assume epoch-based training and derive a new error function having several desirable properties absent from the traditional sum-of-squared-error function. We argue for skip (shortcut) connections where appropriate and the preference for a sigmoidal yielding values over the [-1,1] interval. The input feature space is often over-analyzed, but by using singular value decomposition, input patterns can be conditioned for better learning often with a reduced number of input units. Recurrent …

Go to article

Logical Interference In Symmetric Connectionist Networks, Gadi Pinkas Jan 1993

Logical Interference In Symmetric Connectionist Networks, Gadi Pinkas

All Computer Science and Engineering Research

This work delineates the relation between logic and symmetric neural networks. The motivation is two-fold: 1) to study the capabilities and limitations of connectionist networks with respect to knowledge representatoin; and 2) to develop a new kind of inference negine that is expressive, massively parallel, capable of coping with nonmonotonic or noisy knowledge and capable of learning. The thesis shows that propositional logic can be implemented efficiently in networks where hidden units allow the representation of arbitrary constraints. An inference engine is constructed which can obtain its knowledge either by compiling symbolic rules or by learning them inductively from examples. …

Go to article

Objective Evaluation Of Radiation Treatment Plans, Nilesh L. Jain, Michael G. Kahn Jan 1993

Objective Evaluation Of Radiation Treatment Plans, Nilesh L. Jain, Michael G. Kahn

All Computer Science and Engineering Research

The evaluation of radiation treatment plans involves making trade-offs among doses delivered to the tumor volumes and nearby normal tissues. Evaluating state-of-the-art three-dimensional (3D) plans is a difficult task because of the huge amount of planning data that needs to be deciphered. Multiattribute utility theory provides a methodology for specifying trade-offs and selecting the optimal plan from many competing lans. Using multiattribute utility theory, we are developing a clinically meaningful objective plan-evaluation model for 3D radiation treatment plans. Our model incorporates three of the factors involved in radiation treatment evaluation - treatment preferences of the radiation oncologist, clinical condition of …

Go to article

The N-Body Problem: Distributed System Load Balancing And Performance Evaluation, Vasudha Govindan, Mark A. Franklin Jan 1993

The N-Body Problem: Distributed System Load Balancing And Performance Evaluation, Vasudha Govindan, Mark A. Franklin

All Computer Science and Engineering Research

In this paper, the N-body simulation problem is considered, its parallel implementation described, its execution time performance is modeled and compared with measured results, and two alternative load balancing algorithms for enhancing performance investigated. Parallel N-body techniques are widely applied in various fields and possess characteristics that challenge the computation and communication capabilities of parallel computing systems and are therefore good candidates for use as parallel benchmarks. Performance models may be used to estimate the performance of an algorithm on a given system, identify performance bottlenecks and study the performance implications of several algorithm are system enhancements. In this paper, …

Go to article

The Programmers' Playground: I/O Abstraction For Heterogeneous Distributed Systems, Kenneth J. Goldman, Michael D. Anderson, Bala Swaminathan Jan 1993

The Programmers' Playground: I/O Abstraction For Heterogeneous Distributed Systems, Kenneth J. Goldman, Michael D. Anderson, Bala Swaminathan

All Computer Science and Engineering Research

I/O abstraction is offered as a new high-level approach to interprocess communication. Functional components of a concurrent system are written as encapsulated modules that act upon local data structures, some of which may be published for external use. Relationships among modules are specified by logical connections among their published data structures. Whenever a module updates published data, I/O takes place implicitly according to the configuration of logical connections. The Programmer's Playground, a software library and run-time system supporting I/O abstraction, is described. Design goals include high-level communication among programs written in multiple programming languages and the uniform treatment of discrete …

Go to article

An Optimal Nonblocking Multicast Virtual Circuit Switch, Jonathan S. Turner Jan 1993

An Optimal Nonblocking Multicast Virtual Circuit Switch, Jonathan S. Turner

All Computer Science and Engineering Research

This paper describes an architecture for a multicast virtual circuit switch using cell recycling. This is the first nonblocking switch architecture that is optimal in both the switching network complexity and the amount of memory required for multicast address translation. Furthermore, it is optimal in the amount of effort required for multicast connection modification. This architecture makes it both technically and economically feasible to construct the large switching systems that will ultimately be needed for wide scale deployment of Broadband ISDN to residential users. In particular, we estimate that systems with tens of thousands of 620 Mb/s ports can be …

Go to article

First Prev Next Last