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 24961 - 24990 of 25627

Full-Text Articles in Engineering

Generalization Metrics For Neural Modeling Applications In System Identification, Denise M. Reeves Apr 1995

Generalization Metrics For Neural Modeling Applications In System Identification, Denise M. Reeves

Electrical & Computer Engineering Theses & Dissertations

In this thesis a procedure to design multilayer feedforward networks for system identification with good prediction properties is presented. Central to the design procedure is a means to characterize the prediction capabilities of various trained neural networks. Such knowledge will allow for the identification of the best network design. For system identification purposes, a "good" model is one that is good at predicting, In particular, a good model is one that produces small prediction errors when applied to a set of cross-validation data. We formulate and implement a criterion function designed to measure the size of a trained neural network's …

Go to article

Novel Kalman Filtering Method For The Suppression Of Gyroscope Noise Effects In Pointing And Tracking Systems, Marcelo C. Aigrain Mar 1995

Novel Kalman Filtering Method For The Suppression Of Gyroscope Noise Effects In Pointing And Tracking Systems, Marcelo C. Aigrain

Department of Electrical and Computer Engineering: Faculty Publications

A primary cause of degraded performance in pointing and tracking systems is the jitter in the line of sight. This jitter is caused by the residual angular motion of the stabilized platform within the system. A major contributor to this residual motion is the gyroscope noise. Thus, to reduce angular jitter, lower-noise gyroscopes are selected, generally at a premium cost. Another approach is to enhance the accuracy of the gyroscopes electronically (by suppressing measurement noise) before their outputs are fed into the stabilized platform control system. Optimal filtering techniques can be used for this purpose. The goal is to estimate …

Go to article

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

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

Study Of The Subjet Structure Of Quark And Gluon Jets, D. Buskulic, D., M. Thulasidas Mar 1995

Study Of The Subjet Structure Of Quark And Gluon Jets, D. Buskulic, D., M. Thulasidas

Research Collection School Of Computing and Information Systems

Measurements of the subjet structure of quark and gluon jets in hadronic Z decays are presented. The analysis is based on one million hadronic events recorded by the Aleph detector. Roughly symmetric three-jet events are selected with a coarse jet-resolution cut-off, y1. Gluon jets are identified with a purity of 94.6% in those events where evidence of long-lived heavy-flavour hadrons in the other two jets is found. The jets are then analyzed using a smaller cut-off y0 (< y1) so that subjets are resolved. The properties of the jets (subjet multiplicities (Nq), (Ng) and rates Rng(q) for n = 1, 2, 3, 4) are determined and are found to be in good agreement with the expectations of perturbative QCD as long as the subjet resolution parameter y0 is sufficiently large to keep non-perturbative effects small. In particular, the ratio , which to leading order in QCD is given by the ratio of colour factors , is measured to be 1.96 ± 0.15 for y0 = 2 · 10−3, but falls to 1.29 ± 0.03 for y0 = 1.6 · 10−5.

Go to article

Apparatus For Forming Fine Particles, Dennis R. Alexander Feb 1995

Apparatus For Forming Fine Particles, Dennis R. Alexander

Department of Electrical and Computer Engineering: Faculty Publications

To alter feedstock material, the material is exposed to laser radiation applied at a selected angle of incidence, intensity and wavelength related to the refractive index of the feedstock material. Fine uniform particles may be formed through vapor explosion and/or plasma formation and used by this method to coat surfaces, such as with paint or adhesive or to supply uniform small particles to a heat engine. Moreover, moving materials such as a column of liquid may be subjected to high internal pressure and temperature for creating physical and chemical changes.

Go to article

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

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

BITs and PCs Newsletter

An eighteen 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

Losslees Compression Of Rgb Color Images, Nasir D. Memon, Khalid Sayood Jan 1995

Losslees Compression Of Rgb Color Images, Nasir D. Memon, Khalid Sayood

Department of Electrical and Computer Engineering: Faculty Publications

Although much work has been done toward developing lossless algorithms for compressing image data, most techniques reported have been for two-tone or gray-scale images. It is generally accepted that a color image can be easily encoded by using a gray-scale compression technique on each of the three accounts the substantial correlations that are present between color planes. Although several lossy compression schemes that exploit such correlations have been reported in the literature, we are not aware of any such techniques for lossless compression. Because of the difference in goals, the best way of exploiting redundancies for lossy and lossless compression …

Go to article

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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 1, January 1995, 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

Software And Hardware Requirements For Some Applications Of Parallel Computing To Industrial Problems, Geoffrey C. Fox Jan 1995

Software And Hardware Requirements For Some Applications Of Parallel Computing To Industrial Problems, Geoffrey C. Fox

Northeast Parallel Architecture Center

We discuss the hardware and software requirements that appear relevant for a set of industrial applications of parallel computing, these are divided into 33 separate categories, and come from a recent survey of industry in New York State. The software discussions includes data parallel languages, message passing, databases, and high-level integration systems. The analysis is based on a general classification of problem architectures originally developed for academic applications of parallel computing. Suitable hardware architectures are suggested for each application. The general discussion is crystalized with three case studies: computational chemistry, computational fluid dynamics, including manufacturing, and Monte Carlo Methods.

Go to article

Simtm Turing Machine Simulator, Yin Fu Chen Jan 1995

Simtm Turing Machine Simulator, Yin Fu Chen

Theses Digitization Project

No abstract provided.

Go to article

Ua3/8/5 Wku Network Campus Map, Wku President's Office-Meredith Jan 1995

Ua3/8/5 Wku Network Campus Map, Wku President's Office-Meredith

WKU Administration Documents

Map of WKU campus computer networking project.

Go to article

Hardware Implementation Of The Complex Hopfield Neural Network, Chih Kang Cheng Jan 1995

Hardware Implementation Of The Complex Hopfield Neural Network, Chih Kang Cheng

Theses Digitization Project

No abstract provided.

Go to article

Convergence Properties Of Perceptrons, Ratnasri Krishna Adharapurapu Jan 1995

Convergence Properties Of Perceptrons, Ratnasri Krishna Adharapurapu

Theses Digitization Project

No abstract provided.

Go to article

Evolution Of Emergent Computation, James P. Crutchfield, Melanie Mitchell Jan 1995

Evolution Of Emergent Computation, James P. Crutchfield, Melanie Mitchell

Computer Science Faculty Publications and Presentations

A simple evolutionary process can discover sophisticated methods for emergent information processing in decentralized spatially-extended systems. The mechanisms underlying the resulting emergent computation are explicated by a novel technique for analyzing particle-based logic embedded in pattern-forming systems. Understanding how globally-coordinated computation can emerge in evolution is relevant both for the scientific understanding of natural information processing and for engineering new forms of parallel computing systems.

Go to article

Scheduling Of Parallel Jobs On Dynamic, Heterogenous Networks, Dan Clark, Jeremy Casas, Steve Otto, Robert Prouty, Jonathan Walpole Jan 1995

Scheduling Of Parallel Jobs On Dynamic, Heterogenous Networks, Dan Clark, Jeremy Casas, Steve Otto, Robert Prouty, Jonathan Walpole

Computer Science Faculty Publications and Presentations

In using a shared network of workstations for parallel processing, it is not only important to consider heterogeneity and differences in processing power between the workstations but also the dynamics of the system as a whole. In such a computing environment where the use of resources vary as other applications consume and release resources, intelligent scheduling of the parallel jobs onto the available resources is essential to maximize resource utilization. Despite this realization, however, there are few systems available that provide an infrastructure for the easy development and testing of these intelligent schedulers. In this paper, an infrastructure is presented …

Go to article

Using Matlab To Illustrate The 'Phenomenon Of Aliasing', Sol Neeman, Ph.D. Jan 1995

Using Matlab To Illustrate The 'Phenomenon Of Aliasing', Sol Neeman, Ph.D.

Engineering Studies Faculty Publications and Creative Works

The phenomenon of aliasing is important when sampling analog signals. In cases where the signal is bandlimited, one can avoid aliasing by ensuring that the sampling rate is higher than the Nyquist rate . But in cases where the signal is not bandlimited , aliasing is unavoidable if the signal is not filtered before it is sampled. It is then crucial to understand the phenomenon in order to estimate the distortion generated when the signal is reconstructed from its samples. Using the software package MATLAB by MathWorks, Inc ., two examples are presented. The first is a pure sinusoid which …

Go to article

Pac Learing Of One-Dimensional Patterns, Paul W. Goldberg, Sally A. Goldman, Stephen D. Scott Jan 1995

Pac Learing Of One-Dimensional Patterns, Paul W. Goldberg, Sally A. Goldman, Stephen D. Scott

All Computer Science and Engineering Research

Developing the ability to recognize a landmark from a visual image of a robot's current location is a fundamental problem in robotics. We consider the problem of PAC-learning the concept class of geometric patterns where the target geometric pattern is a configuration of k points on the real line. Each instance is a configuration of n points on the real line, where it is labeled according to whether or not it visually resembles the target pattern. To capture the notion of visual resemblance we use the Hausdorff metric. Informally, two geometric patterns P and Q resemble each othe runder the …

Go to article

A Survey Of Network Signaling, Dakang Wu Jan 1995

A Survey Of Network Signaling, Dakang Wu

All Computer Science and Engineering Research

Abstract Network signaling is the process of transferring control information among components of a communication network to establish, maintain, and release connections, and to pass the network management information. The rapid evolution in the field of telecommunications has led to the rapid evolution of network signaling. In this paper, we review the evolution of network signaling. We emphasize the concepts and protocols used in modern fast packet switching networks especially in emerging ATM networks.

Go to article

Reasoning About Program Interactions In The Presence Of Mobility, Gruia-Catalin Roman, Peter J. Mccann Jan 1995

Reasoning About Program Interactions In The Presence Of Mobility, Gruia-Catalin Roman, Peter J. Mccann

All Computer Science and Engineering Research

Mobile computing is emerging as an important new paradigm which has the potential to reshape our thinking about distributed computation. Mobility has far-reaching implications on what designers and users can assume about communication patterns, resource availability, and applciation behaviors as components move from one location to another while joining or leaving groups of other components in their vicinity. New distributed algorithms are likely to be required as the nature of applications shifts with the emergence of this new kind of computing environment. Formal methods have an important role to play in the midst of these developments both in terms of …

Go to article

A Single-Stroke Orientation-Orient Gesture System, Yike Hu Jan 1995

A Single-Stroke Orientation-Orient Gesture System, Yike Hu

All Computer Science and Engineering Research

No abstract provided.

Go to article

An Interactive Model Of Teaching, H. David Mathias Jan 1995

An Interactive Model Of Teaching, H. David Mathias

All Computer Science and Engineering Research

Previous teaching models in the learning theory community have been batch models. That is, in these models the teacher has generated a single set of helpful examples to present to the learner. In this paper we present an interactive model in which the learner has the ability to ask queries as in the query learning model of Angluin [1]. We show that this model is at least as powerful as previous teaching models. We also show that anything learnable with queries, even by a randomized learner, is teachable in our model. In all previous teaching models, all classes shown to …

Go to article

Aras: Asynchronous Risc Architecture Simulator, Chia-Hsing Chien, Mark A. Franklin, Tienyo Pan, Prithvi Prabhu Jan 1995

Aras: Asynchronous Risc Architecture Simulator, Chia-Hsing Chien, Mark A. Franklin, Tienyo Pan, Prithvi Prabhu

All Computer Science and Engineering Research

In this paper, an asynchronous pipeline instruction simulator, ARAS is presented. With this simulator, one can design selected instruction pipelines and check their performance. Performance measurements of the pipeline configuration are obtained by simulating the execution of benchmark programs on the machine architectures developed. Depending on the simulation results obtained by using ARAS, the pipeline configuration can be altered to improve its performance. Thus, one can explore the design space of aynchronous pipeline architectures.

Go to article

Assertional Reasoning About Pairwise Transient Interactions In Mobile Computing, Gruia-Catalin Roman, Peter J. Mccann, Jerome Plun Jan 1995

Assertional Reasoning About Pairwise Transient Interactions In Mobile Computing, Gruia-Catalin Roman, Peter J. Mccann, Jerome Plun

All Computer Science and Engineering Research

Mobile computing represents a major point of departure from the traditional distributed computing paradigm. The potentially very large number of independent computing units, a decoupled computing style, frequent disconnections, continuous position changes, and the location-dependent nature of the behavior and communication patterns of the individual components present designers with unprecedented challenges in the areas of modularity and dependability. This paper describes two ideas regarding a modular approach to specifying and reasoning about mobile computing. The novelty of our approach rests with the notion of allowing transient interactions among programs which mobe in space. In this paper we restrict our concert …

Go to article

Transient Data Sharing Among Mobile Programs, Jerome Plun, Gruia-Catalin Roman Jan 1995

Transient Data Sharing Among Mobile Programs, Jerome Plun, Gruia-Catalin Roman

All Computer Science and Engineering Research

Mobile computing represents a major point of departure from the traditional distributed computing paradigm. The potentially very large number of independent computing units, a decoupled computing style, frequent disconnections, continuous position changes, and the location-dependent nature of the behavior and communication patterns present designers with unprecedented challenges in the areas of modularity and dependability. This paper describes a modular approach to specifying and reasoning about of mobile computing. Its novelty rests with the notion of allowing transient (location-dependent) data sharing among programs which move in space. The notation is a direct extension of that used in UNITY and reasoning about …

Go to article

Real-Time Upcalls: A Mechanism To Provide Real-Time Processing Guarantees, Raman Gopalakrishna, Guru M. Parulkar Jan 1995

Real-Time Upcalls: A Mechanism To Provide Real-Time Processing Guarantees, Raman Gopalakrishna, Guru M. Parulkar

All Computer Science and Engineering Research

Real-time upcalls (RTUs) are an operating systems mechanism that can be used by applications to efficiently schedule code segments (or handlers) that must execute periodically. While the mechanism was conceibed to support protocol processing with quality-of-service guarantees for networked multimedia applicatoins it is general enough to be applicable in other domains like real-time image processing. Until now real-time threads have been the only mechanism for implementing protocols in user space with QoS guarantees. The RTU mechanism avoids the implementation complexity of the thread based approach while retaining its ability to ensure real-time behavior. In addition, our design simplifies protocol code, …

Go to article

Load Balance Properties Of Distributed Data Layouts For Clustered Mod Servers, Milind M. Buddhikot, Guru Parulkar Jan 1995

Load Balance Properties Of Distributed Data Layouts For Clustered Mod Servers, Milind M. Buddhikot, Guru Parulkar

All Computer Science and Engineering Research

Large scale storage servers that provide location transparent, interactive access to hundreds or thousands of concurrent, independent clients will be important components of hte furture information super-highway infrastructure. Two key requirements of such servers are as follows: support high parallelism and concurrency in data access to allow large number of access to the same or different data. Second, support independent interactive playout control operations such as fast-forward, rewind, slow-play, pause, resume, random access etc. with minimal latency. This paper assumes a distributed storage server architecture consisting of several high performance storage nodes interconnected by a high speed desk area network …

Go to article

Hart's Critics On Defeasible Concepts And Ascriptivism, Ronald P. Loui Jan 1995

Hart's Critics On Defeasible Concepts And Ascriptivism, Ronald P. Loui

All Computer Science and Engineering Research

Hart's "Ascription of Responsibility and Rights" is where we find perhaps the first clear pronouncement of defeasibility and the technical introduction of the term. The paper has been criticised, disavowed, and never quite fully redeemed. Its lurid history is now being used as an excuse for dismissing the importance of defeasibility. Quite to the contrary, Hart's introduction of defeasibility has uniformly been regarded as the most agreeable part of the paper. The critics' wish that defeasibility could be better expounded along the lines of a Wittgensteinian game-theoretic semantics has largely been fulfilled. Even the most contentious part of the paper, …

Go to article

Efficient Demultiplexing Of Network Packets By Automatic Parsing, Mahesh Jayaram, Ron K. Cytron Jan 1995

Efficient Demultiplexing Of Network Packets By Automatic Parsing, Mahesh Jayaram, Ron K. Cytron

All Computer Science and Engineering Research

Packet filters are a mechanism for efficiently demultiplexing network packets to application endpoints. There is currently no general, formal specification method for packet filters that allows for easy or efficient composition of specifications. In this paper we present an automatic approach that achieves all of these goals. We approach packet filter specification as a language recognition problem: each filter is represented by a context-free grammar, whose language is the set of packets the filter should accept. Thus, packet filters can be formulated through a general, well defined specification; further, the grammar-based approach simplifies filter composition, which is essential where scalability …

Go to article

Design Of A Tool For Rapid Prototyping Of Communication Protocols, Aniruddha Gokhale, Ron Cytron, George Varghese Jan 1995

Design Of A Tool For Rapid Prototyping Of Communication Protocols, Aniruddha Gokhale, Ron Cytron, George Varghese

All Computer Science and Engineering Research

We present a new tool for automatically generating prototypes of communication protocols on a wide variety of platforms. Our goal is to reduce design time, enhance portability, and accommodate optimizations automatically. Users of the tool are required to provide an abstract implementation of the protocol in C++ without worrying about the underlying operating system specific system calls. Instead, the user employs high-level interface functions provided by the tool to interact with the underlying operating system. Users also need not worry about complex packet formats that involve fields of various bit and byte lengths. Instead, they use simple C/C++ struct declarations …

Go to article

Self-Stabilization By Window Washing, Adam M. Costello, George Varghese Jan 1995

Self-Stabilization By Window Washing, Adam M. Costello, George Varghese

All Computer Science and Engineering Research

A useful way to design simple and robust protocols is to make them self-stabilitizing. We describe a new general technique for self-stabilization called window washing. We apply this technique to generalized sliding window protocols that work on a number of topologies. This results in simple, efficient, and self-stabilizing protocols. As far as we know, both window washing and generalized sliding window protocols are new ideas. Our protocols can be used for data links, reliable broadcast, and flow control.

Go to article

First Prev Next Last