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 25201 - 25230 of 25622

Full-Text Articles in Engineering

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

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

All Computer Science and Engineering Research

A new high-level approach to interprocess communication in heterogeneous distributed systems in introduced, This approach, called I/O Abstraction, allows one to write each functional component of a distributed system as an encapsulated program that acts upon a set of local data structures, some of which may be published for external use. The functional components are separately configured by establishing logical connections among the published data structures. In order to illustrate this approach, we describe the The Programmers' Playground, a high-level language "veneer" and protocol designed to support I/O abstraction in heterogeneous computing environment. Support for communication among programs written in …


Computing Specificity, Ronald Loui, J. Norman, K. Stiefvater, A. Merrill, A. Costello, J. Olson Nov 1992

Computing Specificity, Ronald Loui, J. Norman, K. Stiefvater, A. Merrill, A. Costello, J. Olson

All Computer Science and Engineering Research

This note reports on an effort to implement a version of Poole's rule for specificity. Relatively, efficient implementation relies on correcting and improving a pruning lemma of Simari-Loui [92]. This in turn requires revision of Poole's specificity concept. The resulting system is a usable knowledge representation system with first-order-language and defeasible reasoning. Sample input and output are included in an appendix. It is a good candidate for multiple inheritance applications; it is useful for planning, but limited by the underlying search for plans.


Automatic Surface Mount Solder Joints Inspection, Zhu Liu Oct 1992

Automatic Surface Mount Solder Joints Inspection, Zhu Liu

Theses

This thesis reports the research results on automatic inspection of solder joints on printed circuit boards. The previous work on this subject has been advanced significantly in the following three aspects. With the support of AT&T Bell Lab, the most updated surface mount solder joints are inspected in this work instead of larger simulation solder joints or traditional through hole solder joints in the previous work. A small set of features is extracted for surface mount solder joints in both infrared and visual light inspection. A new image processing software named Khoros has been applied to improve the quality of …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 7, October 1992, College Of Engineering And Computer Science, Wright State University Oct 1992

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 7, October 1992, 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.


Process And Policy: Resource-Bounded Non-Demonstrative Reasoning, Ronald P. Loui Oct 1992

Process And Policy: Resource-Bounded Non-Demonstrative Reasoning, Ronald P. Loui

All Computer Science and Engineering Research

This paper investigates the appropriateness of formal dialectics as a basis for non-monotonic and defeasible reasoning that takes computational limits seriously. Rules that can come into conflict should be regarded as policies, which are inputs to deliberative processes. Dialectical protocols are appropriate for such deliberations when resources are bounded and search is serial. AI, it is claimed here, is now perfectly positioned to correct many misconceptions about reasoning that have resulted from mathematical logic's enormous success in this century: among them (1) that all reasons are demonstrative, (2) that rational belief is constrained, not constructed, (3) that process and disputation …


Interaction Of Profiled Light With Contrapropagating Acoustic Waves: Fourier Transform Approach, Partha P. Banerjee, Chen-Wen Tarn, Jaw-Jueh Liu Oct 1992

Interaction Of Profiled Light With Contrapropagating Acoustic Waves: Fourier Transform Approach, Partha P. Banerjee, Chen-Wen Tarn, Jaw-Jueh Liu

Electrical and Computer Engineering Faculty Publications

A straightforward Fourier-transform approach is employed to investigate acousto-optic interaction between an input optical beam with arbitrary profile and contrapropagating cw sound in the Bragg regime. The process can be analyzed in terms of the simultaneous scattering of light by the two sound waves in the interaction region. Analytic expressions for the equivalent transfer functions are obtained and the scattered light profiles are plotted.


Packet Routing In Networks With Long Wires, Ronald I. Greenberg, H.-C. Oh Oct 1992

Packet Routing In Networks With Long Wires, Ronald I. Greenberg, H.-C. Oh

Computer Science: Faculty Publications and Other Works

In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem in a network independent context, in which routing time is expressed in terms of “congestion” and “dilation” measures for a set of packet paths. We give, for any constant ε > 0, a randomized on-line algorithm for routing any set of N packets in O((Clg^ε(Nd)+Dlg(Nd))/lglg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into account, and d is the longest path in terms of number of wires. We also …


Separating Structure From Function In The Specification And Design Of Distributed Systems, Kenneth J. Goldman Sep 1992

Separating Structure From Function In The Specification And Design Of Distributed Systems, Kenneth J. Goldman

All Computer Science and Engineering Research

A distributed system is viewed as a collection of functional components and a unifying structure that defines relationships among the components. In the paper, we advocate a particular approach to distributed system specification and design in which the structure of a distributed system is specified separately from the functional components. This permits one to reason about individual functional components in isolation, and encourages one to make explicit not only the input/output behavior of the functional components but also the logical placement of these components within the overall structure of the system. We describe a new software tool for the specification, …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 6, September 1992, College Of Engineering And Computer Science, Wright State University Sep 1992

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 6, September 1992, 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.


Dna Mapping Algorithms: Strategies For Single Restriction Enzyme And Multiple Restriction Enzyme Mapping, Will Gillett Aug 1992

Dna Mapping Algorithms: Strategies For Single Restriction Enzyme And Multiple Restriction Enzyme Mapping, Will Gillett

All Computer Science and Engineering Research

An approach to high-resolution restriction-fragment DNA mapping, known as Multiple-Restriction-Enzyme mapping (MRE mapping), is present. This approach significantly reduces the uncertainty of clone placement by using clone ends to synchronize the position in of clones within different maps, each map being constructed from fragment-length data produced by digestion of each clone with a specific restriction enzyme. Maps containing both fragments-length data and clone-end data are maintained for each restriction enzyme, and synchronization between two such maps is achieved by requiring them to have "compatible" clone-end map projections. Basic definitions of different kinds of maps, such as restriction sites maps, restriction …


Can Pac Learning Algorithms Tolerate Random Attribute Noise?, Sally A. Goldman, Robert H. Sloane Jul 1992

Can Pac Learning Algorithms Tolerate Random Attribute Noise?, Sally A. Goldman, Robert H. Sloane

All Computer Science and Engineering Research

This paper studies the robustness of pac learning algorithms when the instances space is {0,1}n, and the examples are corrupted by purely random noise affecting only the instances (and not the labels). In the past, conflicting results on this subject have been obtained -- the "best agreement" rule can only tolerate small amounts of noise, yet in some cases large amounts of noise can be tolerated. We show that the truth lies somewhere in between these two alternatives. For uniform attribute noise, in which each attribute is flipped independently at random with the same probability, we present an algorithm that …


Discourse-Level Analysis Of Abstracts For Information Retrieval: A Probabilistic Approach, Robert N. Oddy Jul 1992

Discourse-Level Analysis Of Abstracts For Information Retrieval: A Probabilistic Approach, Robert N. Oddy

School of Information Studies - Faculty Scholarship

The objective of this research is to contribute to our knowledge of how people seek information, and how computer systems can be designed to help in this process. Most information retrieval research since the field emerged in the 1950's has reduced these questions to that of trying to determine how documents relevant to a user's query might be selected from a large collection of texts---a question that has proved remarkably difficult to answer. The present work takes the stance that this particular reduction increasingly limits progress towards the objective stated above. It is directed instead towards the development of a …


Analysis Of Multifrequency Dispersive Optical Bistability And Switching In Nonlinear Ring Cavities With Large Medium-Response Times, Pawel Pliszka, Partha P. Banerjee Jul 1992

Analysis Of Multifrequency Dispersive Optical Bistability And Switching In Nonlinear Ring Cavities With Large Medium-Response Times, Pawel Pliszka, Partha P. Banerjee

Electrical and Computer Engineering Faculty Publications

Using a simple model of a ring cavity comprising a cubically nonlinear medium, we analyze dispersive optical bistability in the presence of more than one spectral component. We show the phenomenon of so-called competition for resonance. In addition to presenting cavity characteristics for the cases of two and three different frequencies, we also discuss the general method for finding steady-state solutions and checking their stability. A simple and efficient algorithm, based on a relaxation method, is devised to find steady-state solutions satisfying appropriate boundary conditions. The relaxation dynamics is physically related to a finite response time of the medium.


An Application Of Neural Networks In Data Communication Real-Time Resource Reallocation, Qing Fan Jul 1992

An Application Of Neural Networks In Data Communication Real-Time Resource Reallocation, Qing Fan

Electrical & Computer Engineering Theses & Dissertations

This thesis presents an application of artificial neural networks in real-time resource reallocation, a methodology used in the implementation of an intelligent interface node in the Computer Integrated Manufacturing (CIM) environment. In particular, the problem is formulated using a Hopfield neural network model. The real-time reallocation problem is mapped into a two-dimensional matrix of neurons similar to Hopfield and Tank's approach to the traveling salesman problem (TSP) . An energy function is formulated in terms of the hard constraints and the solution cost. The interconnection weights and the input biases are determined by the energy function. It is shown through …


The 3-Tier Structured Access Protocol To Control Unfairness In Dqdb Mans, Lakshmana N. Kumar, Andreas D. Bovopoulos Jun 1992

The 3-Tier Structured Access Protocol To Control Unfairness In Dqdb Mans, Lakshmana N. Kumar, Andreas D. Bovopoulos

All Computer Science and Engineering Research

This paper addresses the unfairness problem appearing in 802.6-based DQDB MANs. Traffic load demand is characterized as low (below 0.4 of the channel capacity), normal (from 0.4 to 0.9 of the channel capacity) or heavy (greater than 0.9 of the channel capacity). At low loads the 802.6 protocol is acceptably fair. At normal loads, however, the protocol performance is markedly unfair. The unfairness is related to the latency in transporting a request. At heavy loads the unfairness is both latency-related and flooding-related. In this paper, both types of unfairness are carefully analyzed. As a control measure, a 3-Tier Structured Access …


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

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

BITs and PCs Newsletter

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


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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 4, April 1992, 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.


Implementation And Analysis Of Np-Complete Algorithms On A Distributed Memory Computer, Joel S. Garmon Mar 1992

Implementation And Analysis Of Np-Complete Algorithms On A Distributed Memory Computer, Joel S. Garmon

Theses and Dissertations

The purpose of this research is to explore methods used to parallelize NP-complete problems and the degree of improvement that can be realized using different methods of load balancing. A serial and four parallel A* branch and bound algorithms were implemented and executed on an Intel iPSC/2 hypercube computer. One parallel algorithm used a global, or centralized, list to store unfinished work and the other three parallel algorithms used a distributed list to store unfinished work locally on each processor. the three distributed list algorithms are: without load balancing, with load balancing, and with load balancing and work distribution. The …


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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 3, March 1992, 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.


Boolean Reasoning And Informed Search In The Minimization Of Logic Circuits, James J. Kainec Mar 1992

Boolean Reasoning And Informed Search In The Minimization Of Logic Circuits, James J. Kainec

Theses and Dissertations

The minimization of logic circuits has been an important area of research for more than a half century. The approaches taken in this field, however, have for the most part been ad hoc. Boolean techniques have been employed to manipulate formulas, but not to perform symbolic reasoning. Boolean equations are employed principally as icons; they are never solved. The first objective of this dissertation is to apply Boolean reasoning systematically and uniformly to the minimization problem. Boolean reasoning entails the reduction of systems of Boolean equations to a single equation; the single equation is an abstraction, independent of the form …


An Intelligent Database For Psubot, An Autonomous Wheelchair, Dieudonne Mayi Feb 1992

An Intelligent Database For Psubot, An Autonomous Wheelchair, Dieudonne Mayi

Dissertations and Theses

In the design of autonomous mobile robots, databases have been used mainly to store information on the environment in which the device is to operate. For most of the models and ready systems, the database when used, is not a stand alone component in the system, rather it is only intended to keep static information on the disposition and properties of objects on the map.

In this thesis is implemented an intelligent database. It combines static facts to build more information. An intelligent database such as this one will be a plus for an intended autonomous machine such as the …


Model-Based Target Recognition Using Laser Radar Imagery, Robert Y. Li Feb 1992

Model-Based Target Recognition Using Laser Radar Imagery, Robert Y. Li

Department of Electrical and Computer Engineering: Faculty Publications

Autonomous target recognition can be assisted by using CO2 laser radar data. Of these data, range data provide 3-D geometric information and Doppler data boundaries of moving targets. A powerful 3-D feature extraction algorithm based on the Hough transform is used to obtain the orientations and dimensions of the target. This information is then utilized by an inference procedure that recognizes targets based on the available evidence from the sensory data. The experimental results using actual laser radar imagery are successful and the procedure can be used for the future development of a model-based system for target recognition.


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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 2, February 1992, 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.


Analysis Of Algorithms For Velocity Estimation From Discrete Position Versus Time Data, Ronald H. Brown, Susan C. Schneider Phd, Michael G. Mulligan Feb 1992

Analysis Of Algorithms For Velocity Estimation From Discrete Position Versus Time Data, Ronald H. Brown, Susan C. Schneider Phd, Michael G. Mulligan

Electrical and Computer Engineering Faculty Research and Publications

Algorithms for constructing velocity approximations from discrete position versus time data are investigated. The study is limited to algorithms suitable to provide velocity information in discrete-time feedback control systems such as microprocessor-based systems with a discrete position encoder. Velocity estimators based on lines per period, reciprocal-time, Taylor series expansion, backward difference expansions, and least-square curve fits are presented. Based on computer simulations, comparisons of relative accuracies of the different algorithms are made. The least-squares velocity estimators filtered the effect of imperfect measurements best, whereas the Taylor series expansions and backward difference equation estimators respond better to velocity transients.


Developing Image Processing Tools In X Window System, Xin Zhang Jan 1992

Developing Image Processing Tools In X Window System, Xin Zhang

Dissertations and Theses

The X Window System is an industry-standard software system which facilitates programmers to develop portable graphical user interfaces. This thesis describes an image processing tool developed under the X Window System. A multiwindow image display software with image editing and improvement functions is developed. The software has four modules: environment generation, image creation, image editing and image improvement.

The environment generation module creates working windows, scrollbars, dialogbox and pulldown menu buttons, and tracks mouse cursor positions. The working windows are three adjacent windows allowing display of three different images simultaneously. The dialogbox provides an interface between the user and the …


Eies 2 : A Distributed Architecture For Supporting Group Work, Computerized Conferencing & Communications Center, James Whitescarver, Robert M. Czech, Sreenivas Reddy, Ajaz R. Rana, Murray Turoff Jan 1992

Eies 2 : A Distributed Architecture For Supporting Group Work, Computerized Conferencing & Communications Center, James Whitescarver, Robert M. Czech, Sreenivas Reddy, Ajaz R. Rana, Murray Turoff

Computerized Conferencing and Communications Center Reports

The Computerized Conferencing Center (CCCC) at New Jersey Institute of Technology (NJIT) has been researching on-line group communications for 17 years by developing and studying tools to advance the "collective intelligence". The Electronic Information Exchange System 2 (EIES2) provides a research, development and operational environment for distributed computer supported cooperative work (CSCW) systems. The EIES 2 distributed Smalltalk processor provides for rapid prototyping and implementation of muti-media CSCW facilities in the network environment. The Smalltalk support of the object model, and meta-language properties make it ideally suited for incremental development CSCW applications. The EIES2 communication environment supports a decentralized network …


Architectural Support For Designing Fault-Tolerant Open Distributed Systems, Salim Hariri, Alok Choudhary, Behcet Sarikaya Jan 1992

Architectural Support For Designing Fault-Tolerant Open Distributed Systems, Salim Hariri, Alok Choudhary, Behcet Sarikaya

Electrical Engineering and Computer Science - All Scholarship

A distributed system consists of autonomous computing modules that interact with each other using messages. Designing distributed systems is more difficult than designing centralized systems for several reasons. Physical separation and the use of heterogeneous computers complicate interprocessor communication, management of resources, synchronization of cooperating activities, and maintenance of consistency among multiple copies of information. The main advantages of distributed systems include increased fault-tolerance capabilities through the inherent redundancy of resources, improved performance by concurrently executing a single task on several computing modules, resource sharing, and the ability to adapt to a changing environment (extensibility). Distributed systems cover a wide …


Translation Of 'Kamalakanta: A Collection Of Satirical Essays And Reflections', Monish Ranjan Chatterjee Jan 1992

Translation Of 'Kamalakanta: A Collection Of Satirical Essays And Reflections', Monish Ranjan Chatterjee

Electrical and Computer Engineering Faculty Publications

This venture was born initially out of the desire to make those works of Bengali literature which have moved me profoundly, and which I consider first-rate by any yardstick, available to friends and fellow enthusiasts who cannot read the original. In attempting to channel literary and philosophical masterpieces into a different medium, I Have experienced firsthand the formidable challenge that a translator must face because not only of the barrier imposed by the languages involved, but perhaps more so because .of his or her own severely inadequate faculty being called upon to match both the genius and the inspiration of …


Towards The Use Of Situational Information In Information Retrieval, Robert N. Oddy, Elizabeth D. Liddy, Ann Bishop, Eileen Martin, Joseph Elewononi, Bhaskaran Balakrishnan Jan 1992

Towards The Use Of Situational Information In Information Retrieval, Robert N. Oddy, Elizabeth D. Liddy, Ann Bishop, Eileen Martin, Joseph Elewononi, Bhaskaran Balakrishnan

School of Information Studies - Faculty Scholarship

This paper is an exploratory study of one approach to incorporating situational information into information retrieval systems, drawing on principles and methods of discourse linguistics. A tenet of discourse linguistics is that texts of a specific type possess a structure above the syntactic level, which follows conventions known to the people using such texts to communicate. In some cases, such as literature describing work done, the structure is closely related to situations, and may therefore be a useful representational vehicle for the present purpose. Abstracts of empirical research papers exhibit a well-defined discourse- level structure, which is revealed by lexical …


Doctor Of Science In Computer Information Systems, Nova Southeastern University Jan 1992

Doctor Of Science In Computer Information Systems, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.