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

Engineering Commons

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 16981 - 17010 of 17307

Full-Text Articles in Engineering

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 …


A Performance Prediction Model For A Fault-Tolerant Computer During Recovery And Restoration, Rodrigo A. Obando Apr 1993

A Performance Prediction Model For A Fault-Tolerant Computer During Recovery And Restoration, Rodrigo A. Obando

Electrical & Computer Engineering Theses & Dissertations

The modeling and design of a fault-tolerant multiprocessor system is addressed in this dissertation. In particular, the behavior of the system during recovery and restoration after a fault has occurred is investigated. Given that a multicomputer system is designed using the Algorithm to Architecture To Mapping Model (ATAMM) model, and that a fault (death of a computing resource) occurs during its normal steady-state operation, a model is presented as a viable research tool for predicting the performance bounds of the system during its recovery and restoration phases. Furthermore, the bounds of the performance behavior of the system during this transient …


Recognition Of Quadric Surfaces From Range Data: An Analytical Approach, Ivan X. D. D'Cunha Apr 1993

Recognition Of Quadric Surfaces From Range Data: An Analytical Approach, Ivan X. D. D'Cunha

Electrical & Computer Engineering Theses & Dissertations

In this dissertation, a new technique based on analytic geometry for the recognition and description of three-dimensional quadric surfaces from range images is presented. Beginning with the explicit representation of quadrics, a set of ten coefficients are determined for various three-dimensional surfaces. For each quadric surface, a unique set of two-dimensional curves which serve as a feature set is obtained from the various angles at which the object is intersected with a plane. Based on a discriminant method, each of the curves is classified as a parabola, circle, ellipse, hyperbola, or a line. Each quadric surface is shown to be …


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.


Middle Terminal Cell Models For Efficient Over-The-Cell Routing, Siddharth Bhingarde Apr 1993

Middle Terminal Cell Models For Efficient Over-The-Cell Routing, Siddharth Bhingarde

Masters Theses

In this thesis, we introduce a new class of cell models called Middle Terminal Models (MTM) which combines the advantages of existing cell models: BTM and CTM. This class contains the models 2MTM, 3MTM-V, and 3MTM+V depending on the number of metal layers and the permissibility of vias in over-the-cell areas. In MTM, two rows of terminals are located in the middle of the cell. This partitions over-the-cell area into three regions and allows allocation of more nets to over-the-cell area in congested channels. We prove that when vias are allowed over-the-cell, in "almost all" cases the MTM based layouts …


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.


Rendering The Out-The-Window View For The Afit Virtual Cockpit, W. Dean Mccarty Mar 1993

Rendering The Out-The-Window View For The Afit Virtual Cockpit, W. Dean Mccarty

Theses and Dissertations

The Air Force Institute of Technology (AFIT) is developing a distributed interactive flight simulator, the Virtual Cockpit, using commercial graphics workstations and helmet mounted displays. The Virtual Cockpit communicates with other simulators via local and long-haul networks using the SIMNET protocol. The work reported in this thesis focuses on developing the terrain database for the synthetic environment and on rendering the pilot's view of the database. There are many different file formats for describing 3- dimensional geometric polygonal objects. An analysis of three formats, AFIT GEOM, the Naval Postgraduate School (NPS) DRP, and Software Systems' Flight, is presented. Each file …


Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih Mar 1993

Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

We give algorithms to minimize density for channels with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, previous results for running time and space are improved by a factor of L/lg n and L , respectively, where L is the channel length and n is the number of terminals.


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.


Detection Of Skin Tumor Boundaries In Color Images, Fikret Erçal, M. Moganti, William V. Stoecker, Randy Hays Moss Jan 1993

Detection Of Skin Tumor Boundaries In Color Images, Fikret Erçal, M. Moganti, William V. Stoecker, Randy Hays Moss

Computer Science Faculty Research & Creative Works

A simple and yet effective method for finding the borders of tumors is presented as an initial step towards the diagnosis of skin tumors from their color images. The method makes use of an adaptive color metric from the red, green, and blue planes that contains information for discriminating the tumor from the background. Using this suitable coordinate transformation, the image is segmented. The tumor portion is then extracted from the segmented image and borders are drawn. Experimental results that verify the effectiveness of this approach are given


Weapon System Integration For The Afit Virtual Cockpit, William E. Gerhard Jr. Jan 1993

Weapon System Integration For The Afit Virtual Cockpit, William E. Gerhard Jr.

Theses and Dissertations

The Air Force Institute of Technology is continuing research in the Virtual Cockpit. The Virtual Cockpit makes use of high performance graphics workstations, Virtual Environment technology, and Distributed Interactive Simulation network protocols to create a flight simulator based on the capabilities of the McDonnell Douglas F-15E Strike Eagle. The work presented in this thesis focuses on the design and implementation issues for integrating a weapons delivery capability. Weapons simulated include: RADAR and IR guided air- to-air missiles, gravity and precision guided bombs, and a 20mm cannon. Virtual Environment displays used include: color NTSC and monochrome high resolution helmet mounted displays …


The Use Of A Factory Simulation To Evaluate A Flexible Control Structure For Integrated Manufacturing, Ling Ling Pan Jan 1993

The Use Of A Factory Simulation To Evaluate A Flexible Control Structure For Integrated Manufacturing, Ling Ling Pan

Engineering Management & Systems Engineering Theses & Dissertations

Once a control structure for an integrated manufacturing system is decided upon, manufacturing activities are limited by that structure. A flexible control structure is presented as an approach for accommodating a variety of manufacturing activities, without being limited to a single control structure. A flexible control structure is one that allows multiple types of control structure in the manufacturing process. For example, both hierarchical and non-hierarchical structures may be used in a flexible structure. The properties of a flexible control structure are discussed from the point of view of graph theory.

Control structures for automated manufacturing are difficult to evaluate …


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 …


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.


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 …


The Pessimism Behind Optimistic Simulation, George Varghese, Roger D. Chamberlain, William E. Weihl Jan 1993

The Pessimism Behind Optimistic Simulation, George Varghese, Roger D. Chamberlain, William E. Weihl

All Computer Science and Engineering Research

In this paper we make an analogy between the time that storage must be maintained in an optimistic simulation and the blocking time in a conservative simulation. By exploring this analogy, we design two new Global Virtual Time (GVT) protocols for Time Warp systems. The first simple protocol is based on the null message scheme proposed for clock advancement in some conservative approaches; this yields what we call Local Guaranteed Time. Our main contribution is a second new protocol that is inspired by Misra's circulating marker scheme for deadlock recovery in conservative simulations, and appears to have advantages over previous …


A Unified Model For Shared-Memory And Message-Passing Systems, Kenneth Goldman, Katherine Yelick Jan 1993

A Unified Model For Shared-Memory And Message-Passing Systems, Kenneth Goldman, Katherine Yelick

All Computer Science and Engineering Research

A unified model of distributed systems that accomodates both shared-memory and message-passing communication is proposed. An extension of the I/O automaton model of Lynch and Tuttle, the model provides a full range of types of atomic accesses to shared memory, from basic reads and writes to read-modify-write. In addition to supporting the specification and verification of shared memory algorithms, the unified model is particularly helpful for proving correspondences between atomic shared objects and invocation-response systems and for proving the correctness of systems that contain both message passing and shared memory (such as a network of shared-memory multiprocessors or a distributed …


Real-Time Admission Control Algorithms With Delay And Loss Guarantees In Atm Networks, Apostolos Dailianas, Andreas D. Bovopoulos Jan 1993

Real-Time Admission Control Algorithms With Delay And Loss Guarantees In Atm Networks, Apostolos Dailianas, Andreas D. Bovopoulos

All Computer Science and Engineering Research

A multimedia ATM network is shared by media streams with different performance requirements. For media streams such as file transfers, the preservation of bursts and the provision of guarantees for loss probability at the burst level is of primary importance, while, for media streams such as voice, loss guarantees at the cell level are sufficient. Continuous media have stringent delay jitter requirements. Finally, some applications require loss-free transmission. In this paper, the first complete traffic management scheme for multimedia ATM networks is introduced. The traffic management scheme supports four different classes of traffic, each of which has different performance requirements …


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


Fril - A Fractal Intermediate Language, Ron Cytron, David Shields Jan 1993

Fril - A Fractal Intermediate Language, Ron Cytron, David Shields

All Computer Science and Engineering Research

This document describes the motivation, language description, and experience using FrIL, an intermediate language for a compiler's "middle-end." FrIL has subbessfully supported a two-semester compiler construction sequence, where the first semester included code generation from a C-like language and the second semester included advanced data flow analysis and program transformation.


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 …


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


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 …