Physical Sciences and Mathematics Commons^™

Search And Tracking Algorithms For Rapidly Moving Mobiles, Amy L. Murphy, Gruia-Catalin Roman, George Varghese

All Computer Science and Engineering Research

With the advent of wireless technology and laptops, mobility is an important area of research. A fundamental problem in this area is the delivery of messages to a moving mobile. Current solutions work correctly only for slowly moving nodes that stay in one location long enough for tracking to stabilize. In this paper we consider the problem of message delivery to rapidly moving mobile units. With these algorithms, we introduce a new method for designing algorithms based on the paradigm of considering a mobile unit as a message, and adapting traditional message passing algorithms to mobility. Our first algorithm is …

Algorithms For Message Delivery In A Micromobility Environment, Amy L. Murphy, Gruia-Catalin Roman, George Varghese

All Computer Science and Engineering Research

As computing components get smaller and people become accustomed to having computational power at their disposal at any time, mobile computing is developing as an important research area. One of the fundamental problems in mobility is maintaining connectivity through message passing as the user moves through the network. This is usually accomplished in one of two ways: search or tracking. In search, an algorithm hunts the mobile unit through the network each time a message is to be delivered, while in tracking, a specific home keeps up to date information about the current location of the mobile unit. Our paper …

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 …

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 …

The Playground Mediator: Visual Tool For Configuring And Debugging Distributed Applications, T. Paul Mccartney

All Computer Science and Engineering Research

The Mediator is a visual configuration tool for use with The Programmers' Playground distributed programming environment. With the Mediator, one can interactively launch distributed application modules, configured communication among the modules, observe communication patterns, interactively control module communication, kill running modules, and receive imported applications from a separate World Wide Web interface. This manual describes how to use the Mediator both as a stand-alone configuration tool and as a visual interface to the Playground Application Management System.

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

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 …

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.

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 …

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.

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 …

Congestion Control In Multicast Transport Protocols, Rajib Ghosh, George Varghese

All Computer Science and Engineering Research

We discuss congestion control mechanisms in multicast transport protocols and we propose TCP-M - a TCP-friendly Multicast transport protocol. TCP-M uses IP multicast to deliver data packets and acknowledgements to provide reliability. Ack implosion at the source is prevented by fusing acknowledgements at some intermediate routers. TCP-M reacts to network congestion exactly like TCP by having the sender emulate a TCP sender.

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.

Lime: Linda Meets Mobility, Gian Pietro Picco, Amy L. Murphy, Gruia-Catalin Roman

All Computer Science and Engineering Research

LIME is a system designed to assist in the rapid development of dependable mobile applications over both wired and ad hoc networks. Mobile agents reside on mobile hosts and all communication takes place via transiently shared tuple spaces distributed across the mobile hosts. The decoupled style of computing characterizing the Linda model is extended to the mobile environment. At the application level, both agents and hosts perceive movement as a sudden change of context. The set of tuples accessible by a particular agent residing on a given host is altered transparently in response to changes in the connectivity pattern among …

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 …

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 …

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 …

Tcp Dynamic Acknowledgment Delay: Theory And Practice, Daniel R. Dooly, Sally A. Goldman, Stephen D. Scott

All Computer Science and Engineering Research

We study an on-line problem that is motivated by the networking problem of dynamically adjusting delays of acknowledgments in the Transmission Control Protocol (TCP). The theoretical problem we study is the following. There is a sequence of n packet arrival times A = and a look-ahead coefficient L. The goal is to partition A into k subsequences sigma1, sigma2, ...,sigmak (where a subsequence end is defined by an acknowledgment) that minimizes a linear combination of the cost for the number of acknowledgments sent and the cost for the additional latency introduced by delaying acknowledgments. At each arrival, an oracle provides …

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.

Java Grande Forum Report: Making Java Work For High-End Computing, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

This document describes the Java Grande Forum and includes its initial deliverables.Theseare reports that convey a succinct set of recommendations from this forum to SunMicrosystems and other purveyors of Java™ technology that will enable GrandeApplications to be developed with the Java programming language.

Aegis Data Analysis And Reduction (Adar) In Support Of The Aegis Weapon System (Aws), June Bullard Gaines

Theses and Dissertations

The AEGIS Weapons System (AWS), part of the AEGIS Combat System (ACS), is an integral part of the defense system on U.S. Navy AEGIS-class ships. AEGIS Data Analysis and Reduction (ADAR) has been developed to assist in the evaluation of the AWS data. ADAR, along with the AWS and ACS, has evolved through the years to accommodate advances in technology and computer programming languages. Additionally, ADAR has evolved so that users located at sites other than the Naval Surface Warfare System Dahlgren Division (NSWCDD), Dahlgren, Virginia, can reduce tactical system data and perform data analysis using the reduced data.

This …

[Introduction To] Schaum's Outlines Fundamentals Of Computing With C++, John R. Hubbard

Bookshelf

This book is intended to be used primarily for self study, preferably in conjunction with a regular course in the fundamentals of computer science using the new ANSI/ISO Standard C++. The book covers topics from the fundamental units of the 1991 A.C.M. computing curricula.

The Role Of The Einstein Library Of Nova Southeastern University In Meeting The Needs Of Distance Education Students, Anne K. Abate

CCE Theses and Dissertations

The goal of this study was to evaluate the information needs of a selected segment of the distance learning graduate student population served by the Einstein Library at Nova Southeastern University and to propose a new model of library service based on the implementation of current and emerging technologies. Several survey instruments were developed and administered through electronic mail to students and faculty in the School of Computer and Information Sciences, the Center for Psychological Studies, and the School of Social and Systemic Studies, the Fischler Center for the Advancement of Education and the School of Business and Entrepreneurship at …

Effect Of Electronic Portfolio Assessments On The Motivation And Computer Interest Of Fourth And Fifth Grade Students In A Massachusetts Suburban School, Paul V. Montesino

CCE Theses and Dissertations

A preliminary causal-comparative study was conducted in an elementary suburban school in Massachusetts to investigate the impact of electronic portfolio assessments in student's intrinsic motivation and computer interest.

The target population were two groups of fourth grade and two groups of fifth grade students for a total of 77 subjects. They were trained and introduced to electronic portfolio assessments, a program which lasted for the entire school year. The students used Hyper Studio, a multimedia software program developed and marketed by Roger Wagner Publishing, Inc.

It was the intention of the elementary school program directors and teachers that students would …

A Simplified Faceted Approach To Information Retrieval For Reusable Software Classification, Victor Allen Nguyen

CCE Theses and Dissertations

Software Reuse is widely recognized as the most promising technique presently available in reducing the cost of software production. It is the adaptation or incorporation of previously developed software components, designs or other software-related artifacts (i.e. test plans) into new software or software development regimes. Researchers and vendors are doubling their efforts and devoting their time primarily to the topic of software reuse. Most have focused on mechanisms to construct reusable software but few have focused on the problem of discovering components or designs to meet specific needs. In order for software reuse to be successful, it must be perceived …

On The Structure Of Graphs With Few P4s, Luitpold Babel, Stephan Olariu

Computer Science Faculty Publications

We present new classes of graphs for which the isomorphism problem can be solved in polynomial time. These graphs are characterized by containing — in some local sense — only a small number of induced paths of length three. As it turns out, every such graph has a unique tree representation: the internal nodes correspond to three types of graph operations, while the leaves are basic graphs with a simple structure. The paper extends and generalizes known results about cographs, P₄-reducible graphs, and P₄-sparse graphs.

Illumination By Floodlights, William Steiger, Ileana Streinu

Computer Science: Faculty Publications

We consider three problems about the illumination of planar regions with floodlights of prescribed angles. Problem 1 is the decision problem: given a wedge W of angle φ ≤ π, n points p1 . . . . . pn in the plane and n angles α1 . . . . . αn such that ∑ni=1 αi ≤ θ, decide whether W can be illuminated by floodlights of angles α1 , . . . , αn placed in some order at the points p1 , . . . , pn and then rotated appropriately. We show that this problem is the …

The Vertex-Edge Visibility Graph Of A Polygon, Joseph O'Rourke, Ileana Streinu

Computer Science: Faculty Publications

We introduce a new polygon visibility graph, the vertex-edge visibility graph GV E, and demonstrate that it encodes more geometric information about the polygon than does the vertex visibility graph GV. © 1998 Elsevier Science B.V.

Computational Geometry Column 34, Pankaj K. Agarwal, Joseph O'Rourke

Computer Science: Faculty Publications

Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geometry are listed.