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

Computer Engineering Commons

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

Articles 1 - 30 of 47

Full-Text Articles in Computer Engineering

Automated Online News Classification With Personalization, Chee-Hong Chan, Aixin Sun, Ee Peng Lim Dec 2001

Automated Online News Classification With Personalization, Chee-Hong Chan, Aixin Sun, Ee Peng Lim

Research Collection School Of Information Systems

Classification of online news, in the past, has often been done manually. In our proposed Categorizor system, we have experimented an automated approach to classify online news using the Support Vector Machine (SVM). SVM has been shown to deliver good classification results when ample training documents are given. In our research, we have applied SVM to personalized classification of online news.


Reifying Communication At The Application Level, Andrew P. Black, Jie Huang, Jonathan Walpole Oct 2001

Reifying Communication At The Application Level, Andrew P. Black, Jie Huang, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Middleware, from the earliest RPC systems to recent Object-Oriented Remote Message Sending (RMS) systems such as Java RMI and CORBA, claims transparency as one of its main attributes. Coulouris et al. define transparency as “the concealment from the … application programmer of the separation of components in a distributed system.” They go on to identify eight different kinds of transparency.

We considered titling this paper “Transparency Considered Harmful”, but that title is misleading because it implies that all kinds of transparency are bad. This is not our view. Rather, we believe that the choice of which transparencies should be offered by ...


Infopipes—An Abstraction For Information Flow, Jie Huang, Andrew P. Black, Jonathan Walpole, Calton Pu Jun 2001

Infopipes—An Abstraction For Information Flow, Jie Huang, Andrew P. Black, Jonathan Walpole, Calton Pu

Computer Science Faculty Publications and Presentations

Building Object-Oriented Distributed Systems has been facilitated by Remote Message Sending (RMS) systems like Java RMI and implementations of CORBA. However, RMS systems are designed to support request/response interactions. Streaming applications, in contrast, are characterized by high-bandwidth, long-duration communication with stringent performance requirements. Examples of streaming applications include video-on-demand, teleconferencing, on-line education, and environmental observation. These applications transfer huge amounts of data and focus on distributed information flow rather than request/response.

To simplify the task of building distributed streaming applications, we propose a new abstraction for information flow—Infopipes. Using Infopipes, information flow becomes the heart of the ...


Comparison Of Two Distributed Fuzzy Logic Controllers For Flexible-Link Manipulators, Linda Z. Shi, Mohamed Trabia May 2001

Comparison Of Two Distributed Fuzzy Logic Controllers For Flexible-Link Manipulators, Linda Z. Shi, Mohamed Trabia

Mechanical Engineering Faculty Presentations

The paper suggests that fuzzy logic controllers present a computationally efficient and robust alternative to conventional controllers. The paper presents two possible structures for the distributed fuzzy logic controller of a single-link flexible manipulator. A linear quadratic regulator method is used to prove the effectiveness of fuzzy logic controllers.


Modeling The Transient Rate Behavior Of Bandwidth Sharing As A Hybrid Control System, Kang Li, Molly H. Shor, Jonathan Walpole, Calton Pu Mar 2001

Modeling The Transient Rate Behavior Of Bandwidth Sharing As A Hybrid Control System, Kang Li, Molly H. Shor, Jonathan Walpole, Calton Pu

Computer Science Faculty Publications and Presentations

This paper uses hybrid control to model a problem of computer network systems, the dynamic behavior of bandwidth sharing among competing TCP traffic. It has been well known in the computer network community that well-behaved (TCP-friendly) congestion control mechanisms are crucial to the robustness of the Internet. Congestion control determines the transmission rate for each flow. Right now, most TCP-friendly research focuses only on the average throughput behavior without considering how the data is sent out in the short-term (e.g. bursty or smooth). However, recent experimental results show that short-term rate adjustments can change the bandwidth sharing result. Therefore ...


Moving Towards Massively Scalable Video-Based Sensor Networks, Wu-Chi Feng, Jonathan Walpole, Calton Pu, Wu-Chang Feng Mar 2001

Moving Towards Massively Scalable Video-Based Sensor Networks, Wu-Chi Feng, Jonathan Walpole, Calton Pu, Wu-Chang Feng

Computer Science Faculty Publications and Presentations

Networking and computing technologies are becoming advanced enough to enable a wealth of diverse applications that will drastically change our everyday lives. Some past examples of these developments include the World Wide Web and wireless data networking infrastructures. As is quite obvious, the World Wide Web has enabled a fundamental change in the way many people deal with day-to-day tasks. Through the web, one can now make on-line reservations for travel, pay bills through on-line banking services, and view personalized on-line newscasts. More recently, developments in wireless technologies have enabled anywhere, anytime access to information over wireless medium. As wireless ...


Infosphere Project: An Overview, Calton Pu, Jonathan Walpole Mar 2001

Infosphere Project: An Overview, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We describe the Infosphere project, which is building the systems software support for information-driven applications such as digital libraries and electronic commerce. The main technical contribution is the Infopipe abstraction to support information flow with quality of service. Using building blocks such as program specialization, software feedback, domain-specific languages, and personalized information filtering, the Infopipe software generates code and manage resources to provide the specified quality of service with support for composition and restructuring.


Smart Objects And Open Archives, Michael L. Nelson, Kurt Maly Jan 2001

Smart Objects And Open Archives, Michael L. Nelson, Kurt Maly

Computer Science Faculty Publications

Within the context of digital libraries (DLs), we are making information objects "first-class citizens". We decouple information objects from the systems used for their storage and retrieval, allowing the technology for both DLs and information content to progress independently. We believe dismantling the stovepipe of "DL-archive-content" is the first step in building richer DL experiences for users and insuring the long-term survivability of digital information. To demonstrate this partitioning between DLs, archives and information content, we introduce "buckets": aggregative, intelligent, object-oriented constructs for publishing in digital libraries. Buckets exist within the "Smart Object, Dumb Archive" (SODA) DL model, which promotes ...


Buckets: Smart Objects For Digital Libraries, Michael L. Nelson Jan 2001

Buckets: Smart Objects For Digital Libraries, Michael L. Nelson

Computer Science Faculty Publications

Current discussion of digital libraries (DLs) is often dominated by the merits of the respective storage, search and retrieval functionality of archives, repositories, search engines, search interfaces and database systems. While these technologies are necessary for information management, the information content is more important than the systems used for its storage and retrieval. Digital information should have the same long-term survivability prospects as traditional hardcopy information and should be protected to the extent possible from evolving search engine technologies and vendor vagaries in database management systems. Information content and information retrieval systems should progress on independent paths and make limited ...


Arc - An Oai Service Provider For Digital Library Federation, Xiaoming Liu, Kurt Maly, Mohammad Zubair, Michael L. Nelson Jan 2001

Arc - An Oai Service Provider For Digital Library Federation, Xiaoming Liu, Kurt Maly, Mohammad Zubair, Michael L. Nelson

Computer Science Faculty Publications

The usefulness of the many on-line journals and scientific digital libraries that exist today is limited by the inability to federate these resources through a unified interface. The Open Archive Initiative (OAI) is one major effort to address technical interoperability among distributed archives. The objective of OAI is to develop a framework to facilitate the discovery of content in distributed archives. In this paper, we describe our experience and lessons learned in building Arc, the first federated searching service based on the OAI protocol. Arc harvests metadata from several OAI compliant archives, normalizes them, and stores them in a search ...


Fuzzycast: Media Broadcasting For Multiple Asynchronous Receivers, Marcel Waldvogel, Wei Deng, Ramaprabhu Janakiraman Jan 2001

Fuzzycast: Media Broadcasting For Multiple Asynchronous Receivers, Marcel Waldvogel, Wei Deng, Ramaprabhu Janakiraman

All Computer Science and Engineering Research

When using an on-demand media streaming system on top of a network with Multicast support, it is sometimes more efficient to use broadcast to distribute popular content. There has been a lot of research in broadcasting on-demand content to multiple, asynchronous receivers. In this paper, we propose a family of novel, practical techniques for broadcasting on-demand media, which achieve lowest known server/network bandwidth usage and I/O efficient client buffer management, while retaining the simplicity of a frame-based single channel scheme.


Aggregated Hierarchical Multicast For Active Networks, Tilman Wolf, Sumi Y. Choi Jan 2001

Aggregated Hierarchical Multicast For Active Networks, Tilman Wolf, Sumi Y. Choi

All Computer Science and Engineering Research

Active Networking is the basis for a range of new and innovative applications that make use of computational resources inside network routers. One such application is Aggregated Hierarchical Multicast, which aims at implementing efficient many-to-many communication. In certain scenarios it is possible to transmit less accurate, aggregated data and thus achieve better scalability. Using Active Networks, this aggregation computation can be done transparently by network routers without end system support. We present how aggregated data streams can be structured in a hierarchical fashion to allow easy access of data at the desired aggregation level. We introduce two application examples to ...


Dres: Internet Resource Management Using Deferred Reservations, Samphel Norden Jan 2001

Dres: Internet Resource Management Using Deferred Reservations, Samphel Norden

All Computer Science and Engineering Research

In this proposal, we consider the problem of resource reservation for Integrated Services (IntServ) and Differentiated Services (DiffServ) networks. Current approaches for resource reservation in INtegrated Service Networks adopt an all-or-nothing approach, where partially acquired resources must be released if resources are not available at all routers on the chosen path. Furthermore, under high load, end-systems must retry requests repeatedly leading to inefficient allocation and increased traffic. We propose a new approach called Deferred REServation (DERS) that substantially improves performance (reduces the overall cell rejection probability and increases link utilization) over the all-or-nothing reservation approach. Call admissibility is increased by ...


Phase Transitions And Backbones Of Constraint Minimization Problems, Weixiong Zhang Jan 2001

Phase Transitions And Backbones Of Constraint Minimization Problems, Weixiong Zhang

All Computer Science and Engineering Research

Many real-world problems involve constraints that cannot be all satisfied. The goal toward an overconstrained problem is to find solutions minimizing the total number of constraints violated. We call such a problem constraint minimization problem (CMP). We study the behavior of the phase transitions and backbones of CMP. We first investigate the relationship between the phase transitions of Boolean satisfiability, or precisely 3-SAT (a well-studied NP-complete decision problem), and the phase transitions of MAX 3-SAT (an NP-hard optimization problem). To bridge the gap between the easy-hard-easy phase transitions of 3-SAT, in which solutions of bounded quality, e.g., solutions with ...


The Fpx Kcpsm Module: An Embedded, Reconfigurable Active Processing Module For The Field Programmable Port Extender (Fpx), Henry Fu, John W. Lockwood Jan 2001

The Fpx Kcpsm Module: An Embedded, Reconfigurable Active Processing Module For The Field Programmable Port Extender (Fpx), Henry Fu, John W. Lockwood

All Computer Science and Engineering Research

While hardware plugins are well suited for processing data with high throughput, software plugins are well suited for implementing complex control functions. A plugin module has been implemented for the FPX that executes software on an embedded soft-core processor. By including this module in an FPX design, it is possible to implement active networking functions on the FPX using both hardware and software. The KCPSM, an 8-bit microcontroller developed by Xilinx Corp., has been embedded into an FPX module. The module includes circuits to be reprogrammed over the network and to execute new programs between the processing of data packerts ...


Generalized Rad Module Interface Specification Of The Field-Programmable Port Extender (Fpx) Version 2.0, David E. Taylor, John W. Lockwood, Sarang Dharmapurikar Jan 2001

Generalized Rad Module Interface Specification Of The Field-Programmable Port Extender (Fpx) Version 2.0, David E. Taylor, John W. Lockwood, Sarang Dharmapurikar

All Computer Science and Engineering Research

The Field-programmable Port eXtender (FPX) provides dynamic, fast, and flexible mechanisms to process data streams at the ports of the Washington University Gigabit Switch (WUGS-20). By performing all computations in FPGA hardware, cells and packets can be processed at the full line speed of the transmission interface, currently 2.4 Gbits/sec. In order to design and implement portable hardware modules for the Reprogrammable Application Devide (RAD) on the FPX board, all modules should conform to a standard interface. This standard interface specifies how modules receive and transmit ATM cells of data flows, prevent data loss during reconfiguration, and access ...


Design Of Wavelength Converting Switches For Optical Burst Switching, Jeyashankher Ramamirtham, Jonathan Turner Jan 2001

Design Of Wavelength Converting Switches For Optical Burst Switching, Jeyashankher Ramamirtham, Jonathan Turner

All Computer Science and Engineering Research

Optical Burst Switching (OBS) is an experimental network technology that enables the construction of very high capacity routers, using optical data paths and electronic control. In this paper, we study two designs for wavelength converting switches that are suitable for use in optical burst switching systems and evaluate their performance. Both designs use tunable lasers to implement wavelength conversion. One is strictly nonblocking design, that also requires optical crossbars. The second substitutes Wavelength Grating Routers (WGR) for the optical crossbars, reducing cost, but introducing some potential for blocking. We show how the routing problem for the WGR-based switches can be ...


Efficient Queue Management For Tcp Flows, Anshul Kantawala, Jonathan Turner Jan 2001

Efficient Queue Management For Tcp Flows, Anshul Kantawala, Jonathan Turner

All Computer Science and Engineering Research

Packets in the Internet can experience large queueing delays during busy periods. Backbone routers are generally engineered to have large buffers, in which packets may wait as long as half a second (assuming FIFO service, longer otherwise). During congestion periods, these bufferfs may stay close to full, subjecting packets to long delays, even when the intrinsic latency of the path is relatively small. This paper studies the performance improvements that can be obtained by using more sophisticated packet schedulers, than are typical of Internet routers. The results show that the large buffers found in WAN routers ocntribute only marginally to ...


Scalable Ip Lookup For Programmable Routers, David E. Taylor, John W. Lockwood, Todd Sproull, David B. Parlour Jan 2001

Scalable Ip Lookup For Programmable Routers, David E. Taylor, John W. Lockwood, Todd Sproull, David B. Parlour

All Computer Science and Engineering Research

Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services imposes new demands for flexibility and programmability. IP adress lookup has become a significant performance bottleneck for the highest performance routers. New commercial products utilize dedicated Content Addressable Memory (CAM) devides to achieve high lookup speeds. This paper describes an efficient, scalable lookup engine design, able to achieve high-performance with the use of a small portion of a reconfigurable logic device and a commodity Random Access Memory (RAM) device. Based on Eatherton's Tree Bitmap algorithm [1 ...


An Efficient Quality Scalable Motion-Jpeg2000 Transmission Scheme, Ruibiao Qiu, Wei Yu Jan 2001

An Efficient Quality Scalable Motion-Jpeg2000 Transmission Scheme, Ruibiao Qiu, Wei Yu

All Computer Science and Engineering Research

Video application over the Internet are getting increasingly popular because of the explosive growth of the Internet. However, video packets loss due to network congestions can degrade the video quality substantially. In this paper, we propose a transmission scheme for Motion-JPEG2000. It can be implemented in an active network environment efficiently. Our simulation shows that our scheme gracefully adapts to network congestion and improves the quality of video transmission in congested IP networks.


Legends As A Device For Interacting With Visualizations, Mihail E. Tudoreanu, Eileen Kraemer Jan 2001

Legends As A Device For Interacting With Visualizations, Mihail E. Tudoreanu, Eileen Kraemer

All Computer Science and Engineering Research

Users and developers of visualization tools must deal with the problem of specifying what information to show and how to represent it. Typically, the user's focus of interest will change over time, and the specifications must change with the user's interests. Techniques for the simple, direct, and intuitive creation and refinement of these specifications can be useful. In this paper we show how legends, a natural element of graphical displays, may be used as a direct and unobstrusive interaction device through which users may interactively specify new visualizations and animations.


Embedding Images In Non-Flat Spaces, Robert Pless Jan 2001

Embedding Images In Non-Flat Spaces, Robert Pless

All Computer Science and Engineering Research

Multi-dimensional scaling is an analysis tool which transforms pairwise distances between points to an embedding of points in space which are consistent with those distances. Two recent techniques in statistical patter recognition, locally linear embedding (LLE) and Isomap, give a mechanism for finding the structure underlying point sets for which comparisons or distances are only meaningful between nearby points. We give a direct method to extend the embedding algorithm to new topologies, finding the optimal embedding of points whose geodesic distance on a surface mathes the given pairwise distance measurements. Surfaces considered include spheres, cylinders, tori, and their higher dimensional ...


Scheduling Processing Resources In Programmable Routers, Prashanth Pappu, Tilman Wolf Jan 2001

Scheduling Processing Resources In Programmable Routers, Prashanth Pappu, Tilman Wolf

All Computer Science and Engineering Research

To provide flexibility in deploying new protocols and services, general-purpose processing engines are being placed in the datapath of routers. Such network processors are typically simple RISC multiprocessors that perform forwarding and custom application processing of packets. The inherent unpredictability of execution time of arbitrary instruction code poses a significant challenge in providing QoS guarantees for data flows that compete for such processing resources in the network. However, we show that network processing workloads are highly regular and predictable. Using estimates of execution times of various applications on packets of given lengths, we provide a method for admission control and ...


Evaluation Of Motion-Jpeg2000 For Video Processing, Wei Yu, Ruibiao Qiu, Jason Fritts Jan 2001

Evaluation Of Motion-Jpeg2000 For Video Processing, Wei Yu, Ruibiao Qiu, Jason Fritts

All Computer Science and Engineering Research

The new ISO/ITU-T standard for still image coding, JPEG2000, has been shown to provide superior coding efficiency to the previous standard, JPEG. Because of the superb performance of JPEG2000, it is reasonable to argue that Motion-JPEG2000, the corresponding moving picture coding standard of JPEG2000, has equally outstanding performance. However, there has not been a sufficient performance evaluation of Motion-JPEG2000. To this end, we have studied the potential of Motion-JPEG2000 for video processing. Our experiments show that Motion-JPEG2000 provides high compression performance, strong error resilience, and good perceptual image quality. Together with a rich set of features inherited from JPEG2000 ...


Local Search And Encoding Schemes For Soft Constraint Minimization Problems, Michael P. Moran, Weixiong Zhang Jan 2001

Local Search And Encoding Schemes For Soft Constraint Minimization Problems, Michael P. Moran, Weixiong Zhang

All Computer Science and Engineering Research

Soft constraint minimization problems (SCMPs) contain hard constraints that cannot be violated and soft constraints that may be violated but carry penalties if not satisfied. In this paper, we first extend local search, WalkSAT in particular, to SCMPs and study the existing SAT encoding schemes for SCMPs. We propose a general encoding method called k-encoding. We then investigate the effects of local search neiborhood structures introduced by encoding schemes and analyze the anytime performance of extended WalkSAT using different encoding methods. Our experimental results on various graph coloring problems show that a direct extension of WalkSAT is most effective, and ...


A Proposal For A Scalable Internet Multicast Architecture, Sherlia Shi Jan 2001

A Proposal For A Scalable Internet Multicast Architecture, Sherlia Shi

All Computer Science and Engineering Research

We propose a new network and system architecture for multicast in the Internet. Our main objectives are to find a cost-effective way to scale to a large number of multicast groups whose members are geographically dispersed, and to enable small and less capable devices to participate in group communications. In order to preserve the efficiency of data distribution gained by multicast, while avoiding the control complexity previously exhibited by IP multicast, we propose the use of an overlay network for multicast services. We construct "virtual" multicast trees, which consist of unicast connections joining multicast servers in the network. These servers ...


Formal Specification And Design Of Mobile Systems, Gruia-Catalin Roman, Christine Julien, Qingfeng Huang Jan 2001

Formal Specification And Design Of Mobile Systems, Gruia-Catalin Roman, Christine Julien, Qingfeng Huang

All Computer Science and Engineering Research

Termination detection, a classical problem in distributed computing, is revisited in the new setting provided by the emerging mobile computing technology. A simple solution tailored for use in ad hoc networks is employed as a vehicle for demonstrating the applicability of formal requirements and design strategies to the new field of mobile computing. The approach is based on well understood techniquest in specification refinement, but the methodology is tailored to mobile applications and helps designers address novel concerns such as the mobility of hosts, transient interactions, and specific coordination constructs. The proof logic and programming notation of Mobile UNITY provide ...


A Distributed Annotation System, Robin Dowell Jan 2001

A Distributed Annotation System, Robin Dowell

All Computer Science and Engineering Research

One goal of any genome project is the elucidation of hte primary sequence of DNA contained within a given species. While the availability ot the primary sequence itself is valuable, it does not reach its full potential until i has been annotated. Generally defined, annotation is descriptive information or commentary added to text, in this case genomic sequence. Without a mechanism for collecting, recording, and disseminating community-based annotation, a valuable source of information is severely diminshed. In this report I outline the design and implementation of a Distributed Annotation System (DAS). DAS allowes sequence annotations to be decentralized among multiple ...


Fast Incremental Crc Updates For Ip Over Atm Networks, Florian Braun, Marcel Waldvogel Jan 2001

Fast Incremental Crc Updates For Ip Over Atm Networks, Florian Braun, Marcel Waldvogel

All Computer Science and Engineering Research

In response to the increasing network speeds, many operations in IP routers and similar devices are being made more efficient. With the advances in other areas of packet processing, the verification and regeneration of cyclic redundancy check (CRC) codes of the data link layer is likely to become a bottleneck in the near future. In this paper, we present a mechanism to defer CRC verification without compromising reliability. This opens the possibility of incremental updates of the CRC. We introduce a new high-speed technique and present efficient implementation, speeding up CRC processing by a factor of 15. Although the paper ...


Layered Protocol Wrappers For Internet Packet Processing In Reconfigurable Hardware, Florian Braun, John Lockwood, Marcel Waldvogel Jan 2001

Layered Protocol Wrappers For Internet Packet Processing In Reconfigurable Hardware, Florian Braun, John Lockwood, Marcel Waldvogel

All Computer Science and Engineering Research

The ongoing increases of line speed in the Internet backbone combined with the need for increased functionality of network devices presents a major challenge. These demands call for the use of reprogrammable hardware to provide the required flexible, high-speed functionality, at all network layers. The Field Programmable Port Extender (FPX) provides such an environment for development of networking components in reprogrammable hardware. We present a framework to streamline and simplify networking applications that process ATM cells, AAL5 frames, Internet Protocol (IP) packets and UDP datagrams directly in hardware.