Computer Engineering Commons^™

Experimental Investigations Of Wavelength And Angular Errors In Holographic Gratings With Non-Bragg-Matched Read Beams, Monish Ranjan Chatterjee, Vivek Ray

Electrical and Computer Engineering Faculty Publications

Perfect Bragg matching is generally desirable for accurate optical interconnections with holographic gratings. In reality, however, gratings may be illuminated by READ beams with non-Bragg-matched angles, or wavelengths, or both. In such cases, the scattered beams are generally misdirected, and may suffer loss of efficiency and possibly more serious errors such as crosstalk noise or missed connections. A conventional wave-vector triad method of analyzing the scattered beam errors leads readily to near-Bragg estimates of the output angular misalignment. However, the READ wave-vector triads appear to indicate a possible wavelength shift in the output beam even with a Bragg-matched READ wavelength, …

Multiple Streams Synchronization In Collaborative Multimedia Systems, Emilia Stoica

Computer Science Theses & Dissertations

With the recent increase of the communication bandwidth and processor power, new types of applications have emerged. Among them, there are multimedia application, in which users are able to control, combine, and manipulate different types of media, such as text, sound, video, computer graphics, and animation. A key requirement in any multimedia application is to synchronize the delivery of various media streams to the user. To achieve this, the sender has to provide the temporal relations between the streams as they are captured. Since the receiver uses this information in streams presentation, its accuracy is very important.

Our main contribution …

Location Independent Names For Nomadic Computers, David Steere, Mark Morrissey, Peter Geib, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Recent advances in the Domain Name System (DNS) and the Dynamic Host Configuration Protocol (DHCP) have enabled a new approach to supporting mobile users: location independent naming. In this approach, machines use the same hostname from any internet location, but use an IP address that corresponds to their current location. We describe a protocol that implements location independent naming for nomadic computers, i.e., machines that do not need transparent mobility. Our protocol allows hosts to move across security domains, uses existing protocols, and preserves existing trust relationships. Therefore, it preserves the performance and security of normal IP for nomadic computers …

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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 14, Number 5, May 1998, 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.

Adaptation Space: Surviving Non-Maskable Failures, Crispin Cowan, Lois Delcambre, Anne-Francoise Le Meur, Ling Liu, David Maier, Dylan Mcnamee, Michael Miller, Calton Pu, Perry Wagle, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Some failures cannot be masked by redundancies, because an unanticipated situation occurred, because fault-tolerance measures were not adequate, or because there was a security breach (which is not amenable to replication). Applications that wish to continue to offer some service despite nonmaskable failure must adapt to the loss of resources. When numerous combinations of non-maskable failure modes are considered, the set of possible adaptations becomes complex. This paper presents adaptation spaces, a formalism for navigating among combinations of adaptations. An adaptation space describes a collection of possible adaptations of a software component or system, and provides a uniform way of …

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

Spectral/Temporal Segment Features For Automatic Speech Recognition, Xi Hong Wang

Electrical & Computer Engineering Theses & Dissertations

In this thesis an approach for efficiently computing a compact spectral/temporal feature set for representing a segment of speech, with effective resolution depending on both frequency and time position within the segment, is developed, analyzed, and tested. The goal of this method is to mimic the resolution properties of the human auditory system, but using a computationally efficient FFT-based front end rather than a more complex auditory model. In particular this method applies both frequency and time "warping" to FFT spectra to obtain good frequency resolution at low frequencies and good time resolution at high frequencies. Time resolution is also …

Joint Wavelet Transform Correlation With Separated Target And Reference Planes, Boon Yi Soon, Mohammad A. Karim, Russell C. Hardie, Mohammad S. Alam

Electrical and Computer Engineering Faculty Publications

In recent years, we realize the usefulness of feature extraction for optical correlator and hereby, we investigate the capability of Laplace operator in feature extraction of multiple targets. The first-order terms and the false alarm terms in the correlation output would be removed using electronic power spectrum subtraction technique. Most importantly, the entire magneto-optic SLM is completely utilized for displaying only targets in the input scene. A new cost efficient hardware implementation is proposed and aforementioned result of the proposed system is evaluated through computer simulation.

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

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

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

Stackguard: Automatic Adaptive Detection And Prevention Of Buffer-Overflow Attacks, Crispin Cowan, Calton Pu, David Maier, Heather Hinton, Jonathan Walpole, Peat Bakke, Steve Beattie, Aaron Grier, Perry Wagle, Qian Zhang

Computer Science Faculty Publications and Presentations

This paper presents a systematic solution to the persistent problem of buffer overflow attacks. Buffer overflow attacks gained notoriety in 1988 as part of the Morris Worm incident on the Internet. While it is fairly simple to fix individual buffer overflow vulnerabilities, buffer overflow attacks continue to this day. Hundreds of attacks have been discovered, and while most of the obvious vulnerabilities have now been patched, more sophisticated buffer overflow attacks continue to emerge.

We describe StackGuard: a simple compiler technique that virtually eliminates buffer overflow vulnerabilities with only modest performance penalties. Privileged programs that are recompiled with the StackGuard …

Attitude Measurement, Mark A. Stedham, Partha P. Banerjee, Seiji Nishifuji, Shogo Tanaka

Electrical and Computer Engineering Faculty Publications

In many practical situations, it is important to determine and measure the attitude of a particular vehicle, such as a ship, an airplane, a piece of mechanical equipment such as a, crane lifter, or a spacecraft. For this reason, many attitude sensors have been developed with advanced computer and semiconductor technologies. This section first introduces the various attitude sensors with an explanation of their operating principles and then presents several methodologies for attitude measurement and determination, including ships and crane lifters, aircraft, and spacecraft applications.

Functional Radionuclide Imaging Algorithm Based On The Appended Curve Deconvolution Technique And Its Use In The Diagnosis Of Renovascular Hypertension, İrfan Karagöz, Hi̇kmet Bayhan

Turkish Journal of Electrical Engineering and Computer Sciences

In this study, a new method called the pixel basis functional radionuclide imaging (PBFRI) algorithm based on the appended curve deconvolution technique, in order to be able to increase the medical diagnostic capability of a conventional gamma camera, is presented together with the clinical results. In the PBFRI method, retention function of each pixel is obtained from the renograms and cardiac curves generated by processing the filtered segments of the kidney and heart, using a special deconvolution method. The deconvolution operation is done by using the Fourier transform technique. High frequency artifacts presented by the Fourier transform are removed by …

Genetic Approach For The Determination Of Object Parameters From X Ray Projections, Tayfun Günel, Sedef Kent

Turkish Journal of Electrical Engineering and Computer Sciences

In this study, a new method is presented, based on genetic algorithms for determining object parameters such as radii and/or attenuation coefficients with some assumptions and estimating a cross-sectional image of an object from its projections obtained by X ray illumination. After it was tested for projections degraded by different random noise levels, it was observed that the genetic and fuzzy genetic algorithms improved the signal to noise ratio of the projections. The fuzzy genetic algorithm gave better results than the genetic algorithm.

Modeling Mobile Ip In Mobile Unity, Peter J. Mccann, Gruia-Catalin Roman

All Computer Science and Engineering Research

With recent advances in wireless communication technology, mobile computing is an increasingly important area of research. A mobile system is one where independently executing components may migrate through some space during the course of the computation, and where the pattern of connectivity among the components changes as they move in and out of proximity. Mobile UNITY is a notation and proof logic for specifying and reasoning about mobile systems. In this paper it is argued that Mobile UNITY contributes to the modular development of system specifications because of the declarative fashion in which coordination among components is specified. The packet …

A Simplified Reservation And State Setup Protocol, Hari Adiseshu, Guru Parulkar, Subhash Suri

All Computer Science and Engineering Research

The last few years have seen the development of a model for Integrated Services Internet, which extends the traditional Internet by adding multiple service classes in addition to the traditional best effort service class, and a signaling protocol called RSVP for applications to reserve resources. While this framework has been standardized in the IETF WGs and the RSVP protocol has been defined, there has been no movement towards a commercial implementation of this framework, principally due to its perceived complexity and lack of scalability. This paper analyzes RSVP, discusses some of the its bottlenecks and shows how they can be …

Tcp/Ip Implementation With Endsystem Qos, Sherlia Y. Shi, Gurudatta M. Parulkar, R. Gopalakrishnan

All Computer Science and Engineering Research

This paper presents a Real-time Upcall (RTU) [1] based TCP/IP implementation that guarantees throughput for continuous media applications and ensures low latency bounds for interactive applications. RTU is an endsystem rate-based scheduling mechanism that provides quality of service (QoS) in terms of CPU cycles, to applications. We restructured the existing NetBSD TCP/IP implementation to exploit the RTU concurrency model and to provide predictable performance. Our experimental results show that on two 200 MHz NetBSD PCs connected by a 155Mbps ATM link, the RTU based kernel TCP/IP implementation provides excellent throughput guarantees for periodic connections regardless the system or network load. …

Application Development And Management In The Programmers' Playground, T. Paul Mccartney, E.F. Berkley Shands, Kenneth J. Goldman, William M. Shapiro

All Computer Science and Engineering Research

Application management refers to the process of making software applications available to end-users and providing automated mechanisms for launching and joining such applications. The Programmers' Playground is a computing environment for creating distributed applications from modular, reusable components. This paper discusses a set of tools that enable application developers to: (1) design and debug Playground distributed applications from existing "off-the-shelf" components using a visual configuration tool, (2) make new application components available on the Internet through a "launcher" service, and (3) make complete distributed applications available via a World Wide Web interface, enabling end-users to launch and join the applications …

Terabit Burst Switching Progress Report (6/98-9/98), Jonathan S. Turner

All Computer Science and Engineering Research

This report summarizes progress on the Terabit Burst Switching Project at Washington University for the period from June 15, 1998 through September 15, 1998.

Agnostic Learning Of Geometric Patterns, Sally A. Goldman, Stephen S. Kwek, Stephen D. Scott

All Computer Science and Engineering Research

Goldberg, Goldman, and Scott demonstrated how the problem of recognizing a landmark from a one-dimensional visual image can be mapped to that of learning a one-dimensional geometric pattern and gave a PAC algorithm to learn that class. In this paper, we present an efficient on-line agnostic learning algorithm for learning the class of constant-dimension geometric patterns. Our algorithm can tolerate both classification and attribute noise. By working in higher dimensional spaces we can represent more features from the visual image in the geometric pattern. Our mapping of the data to a geometric pattern, and hence our learning algorithm, is applicable …

Fault-Tolerant Mobile Ip, Rajib Ghosh, George Varghese

All Computer Science and Engineering Research

We describe mechanisms to enhance the reliability and performance of Mobile IP. In Mobile IP today home agents and foreign agents are single points of failure and potential performance bottlenecks. For example, a home agent crash can lead to communication failure if the mobile is away from home. In this paper we describe new mechanisms to allow redundant home and foreign agents. Redundant agents can take over from each other in case of failure, and also split load amongst themselves. Our mechanisms are simple, transparent to existing mobile nodes, and compatible with the existing Mobile IP specification. We have implemented …

On-Line Scheduling With Hard Deadlines, Sally A. Goldman, Jyoti Parwatikar, Subhash Suri

All Computer Science and Engineering Research

We study non-preemptive, online admission control in the hard deadline model: each job must be either serviced prior to its deadline, or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be started. The goal is to maximize total resource utilization. The jobs are non-preemptive and exclusive, meaning once a job begins, it runs to completion, and at most one job can use …

Learning From Examples With Unspecified Attribute Values, Sally A. Goldman, Stephen S. Kwek, Stephen D. Scott

All Computer Science and Engineering Research

We introduce the UAV learning model in which some of the attributes in the examples are unspecified. In our model, an example x is classified positive (resp., negative) if all possible assignments for the unspecified attributes result in a positive (resp., negative) classification. Otherwise the classificatoin given to x is "?" (for unknown). Given an example x in which some attributes are unspecified, the oracle UAV-MQ responds with the classification of x. Given a hypothesis h, the oracle UAV-EQ returns an example x (that could have unspecified attributes) for which h(x) is incorrect. We show that any class learnable in …

Diagnostic Screening Of Digital Mammograms Using Wavelets And Neural Networks To Extract Structure, Barry L. Kalman, Stan C. Kwasny, William R. Reinus

All Computer Science and Engineering Research

As the primary tool for detecting breast carcinoma, mammography provides visual images from which a trained radiologist can identify suspicious areas that suggest the presence of cancer. We describe an approach to image processing that reduces an image to a small number of values based on its structural characteristics using wavelets and neural networks. To illustrate its utility, we apply this methodology to the automatic screening of mammograms for mass lesions. Our results approach performance levels of trained human mammographers.

Routing Table Compression Using Binary Tree Collapse, Jonathan Turner, Qiyong Bian, Marcel Waldvogel

All Computer Science and Engineering Research

This paper describes an algorithm which can roughly halve the size of the current Internet routing tables. This algorithm is based on the radix trie representation of routing tables, which was firstly used in the BSD Unix distributions. The binary tree representation, which is a simplified case of radix tree, does well at showing the relationships among all routing table entries and provides us a way to build a collapse algorithm based on its internal structure. The binary tree collapse algorithm consists of three techniques, with the first two quite intuitive while the third is a bit more elaborate. All …

Router Plugins: A Modular And Extensible Software Framework For Modern High Performance Integrated Services Routers, Dan Decasper, Zubin Dittia, Guru Parulkar, Bernhard Plattner

All Computer Science and Engineering Research

Present day routers typically employ monolithic operating systems which are not easily upgraded and extensible. WIth the rapid rate of protocol development it is becoming increasingly important to dynamically upgrade router software in an incremental fashion. We have designed and implemented a high performance, modular, extended integrated services router software architecture in the NetBSD operating system kernel. This architecture allows code modules, called plugins, to be dynamically added and configured at run time. One of the novel features of our design is the ability to bind different plugins to individual flows; this allows for distinct plugin implementations to seamlessly coexist …

Terabit Burst Switching Progress Report (12/97-2/98), Jonathan S. Turner

All Computer Science and Engineering Research

This report summarizes progress on the Terabit Burst Switching Project at Washington University for the period from December 15, 1997 through March 15, 1998. Efforts during this period have concentrated on working out details of the burst switch architecture, evaluating a variety of implementation alternatives and developing the physical design of the 160 Gb/s ATM switch to allow demonstration of the burst switch within a realistic network context.

Integrating A Constraint Mechanism With The Javabeans Model, William M. Shapiro

All Computer Science and Engineering Research

The JavaBeans component model allows users to plug together software components to create Java applications by specifying simple relationships between component events and properties. This paper describes work on augmenting the simple JavaBeans model with a multi-way constraint mechanism that allows users to graphically specify more complex multi-way contraints, resolve cyclical constraints between bean properties and graphically layout bean components. We also discuss weaknesses in the JavaBeans model and Java Abstract Windowing Toolkit (AWT) that were discovered while integrating a constraint mechanism with JavaBeans.