Engineering Commons^™

A Simplified Approach To Reduce Blocking And Ringing Artifacts In Transform-Coded Images, Jianping Hu

Dissertations and Theses

Presently Block-based Discrete Cosine Transform (BDCT) image coding techniques are widely used in image and video compression applications such as JPEG and MPEG. At a moderate bit rate, BDCT is usually a quite satisfactory solution to most of practical coding applications. However, for high rate compression it produces noticeable blocking and ringing artifacts in the decompressed image. It has been an active research area for a decade for reducing these artifacts. In this thesis, a novel post-processing algorithm is proposed to remove the blocking and ringing artifacts at low bit rate. It is non-iterative and uses both spatial and transform …

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

BITs and PCs Newsletter

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

A Global Computing Environment For Networked Resources, Haluk Topcuoglu, Salim Hariri

Electrical Engineering and Computer Science - All Scholarship

Current advances in high-speed networks and WWW technologies have made network computing a cost-effective, high-performance computing alternative. New software tools are being developed to utilize efficiently the network computing environment. Our project, called Virtual Distributed Computing Environment (VDCE), is a high-performance computing environment that allows users to write and evaluate networked applications for different hardware and software configurations using a web interface. In this paper we present the software architecture of VDCE by emphasizing application development and specification, scheduling, and execution/runtime aspects.

English-Chinese Bilingual Database And The Compilation Of Dictionary, Gan Ye, Nanjing University

Pepperdine University Libraries

No abstract provided.

Multi-Criteria Optimization - An Important Foundation Of Fuzzy System Design, Hung T. Nguyen, Vladik Kreinovich

Departmental Technical Reports (CS)

In many real-life design situations, there are several different criteria that we want to optimize, and these criteria are often in conflict with each other. Traditionally, such multi-criteria optimization situations are handled in an ad hoc manner, when different conflicting criteria are artificially combined into a single combination objective that is then optimized. The use of unnatural ad hoc tools is clearly not the best way of describing a very natural aspect of human reasoning. Fuzzy logic describes a much more natural way of handling multi-criterion optimization problems: when we cannot maximize each of the original conflicting criteria 100%, we …

Computers Of Generation Omega, Vladik Kreinovich

Departmental Technical Reports (CS)

To make computers faster, we must take smaller and smaller processing elements, and to analyze these elements, we need to take into consideration more and more subtle quantum effects. A. Stern has shown a natural way to use quantum field theory for computing. It turns out that if we take into consideration all quantum effects, then this idea leads to an even faster performance.

Spider: An Overview Of An Object-Oriented Distributed Computing System, Han-Sheng Yuh

Theses Digitization Project

The Spider Project is an object-oriented distributed system which provides a testbed for researchers in the Department of Computer Science, CSUSB, to conduct research on distributed systems.

Design And Implemetation Of Internet Mail Servers With Embedded Data Compression, Alka Nand

Theses Digitization Project

No abstract provided.

An Intercomparison Of Two Tunable Diode Laser Spectrometers Used For Eddy Correlation Measurements Of Methane Flux In A Prairie Wetland, David P. Billesbach, Joon Kim, R.J. Clement, S.B Verman, F.G. Ullman

Department of Electrical and Computer Engineering: Faculty Publications

An intercomparison was made between two tunable diode laser spectrometers used to measure methane fluxes by the eddy correlation technique at a prairie wetland site. The spectrometers were built by Unisearch Associates Inc. of Concord, Ontario, Canada, and Campbell Scientific Inc. of Logan, Utah, and were models EMS-50 and TGA-100, respectively. The fluxes were found to agree very well with each other in the range of 0 to 42 mg 􏰑 m-2 h-1.

The TGA-100 was observed to exhibit offset drifts. Most of the time, when the offset was only slowly changing (as compared to the eddy correlation averaging time), …

Physical Media Independence: System Support For Dynamically Available Network Interfaces, Jon Inouye, Jim Binkley, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Advances in hardware technology has fueled the proliferation of dynamically configurable network interface cards. This empowers mobile laptop users to select the most appropriate interface for their current environment. Unfortunately, the majority of system software remains "customized" for a particular network configuration, and assumes many network characteristics remain invariant over the runtime of the software. Physical Media Independence (PMI) is the concept of making assumptions about a particular device explicit, detecting events which invalidate these assumptions, and recovering once events are detected. This paper presents a model supporting PMI. Based on device availablilty, the model identifies implicit device-related assumptions made …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 1, January 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Optimizing The Performance Of The Corba Internet Inter-Orb Protocol Over Atm, Aniruddha Gokhale, Douglas C. Schmidt

All Computer Science and Engineering Research

The Internet Inter-ORB Protocol (IIOP) enables heterogeneous CORBA-compliant Object Request Brokers (ORBs) to interoperate over TCP/IP networks. The IIOP uses the Common Data Representation (CDR) transfer syntax to map CORBA Interface Definition Langauge (IDL) data types into a bi-canonical wire format. Due to the excessive marshaling/demarshaling overhead, data copying, and high-levels of function call overhead, conventional implementation of IIOP protocols yield poor performance over high-speed networks. To meet the demands of emerging distributed multimedia applications, CORBA-compliant ORBs must support both interoperable and highly efficient IIOP implementations. This paper provides two contributions to the study and design of high performance CORBA …

Expressing Code Mobility In Mobile Unity, Gian Pietro Picco, Gruia-Catalin Roman, Peter J. Mccann

All Computer Science and Engineering Research

Advancements in network technology have led to the emergence of new computing paradigms that challenge established programming practices by employing weak forms of consistency and dynamic forms of binding. Code mobility, for instance, allows for invocation-time binding between a code fragment and the location where it executes. Similarly, mobile computing allows hosts (and the software they execute) to alter their physical location. Despite apparent similarities, the two paradigms are distinct in their treatment of location and movement. This paper seeks to uncover a common foundation for the two paradigms by exploring the manner in which stereotypical forms of code mobility …

Symmetrical Routes And Reverse Path Congestion Control, Rajib Ghosh, George Varghese

All Computer Science and Engineering Research

We describe new mechanisms to deal with asymmetries that arise in routing protocols. We show how to avoid route asymmetries (due to non-unique shortest paths) by adding random integer link costs. We show in detail how RIP can be modified to avoid route asymmetry with high probability, without affecting either its efficiency or performance metrics such as convergence time. Symmetrical intra-domain routing also makes possible a new form of congestion control that we call Reverse Path Congestion Control (RPCC). We show, using simulations, that RPCC can augment existing TCP congestion control mechanisms to improve start up behavior and to avoid …

End-User Visualization And Manipulation Of Distributed Aggregate Data, T. Paul Mccartney, Kenneth J. Goldman

All Computer Science and Engineering Research

Aggregate visualization and manipulation enables the viewing and interaction of dynamically changing data sets in a graphically meaningful way. However, off-the-shelf applications typically provide only limited ways to view static aggregates and generally to not support manipulation of aggregate data through the resulting visualization. To be fully dynamic, an aggregate visualization should be customizable to suit the individual's needs and should allow end-users to modify the data through direct manipulation. This paper describes a software system that empowers end-users to create interactive aggregate visualizations through a visual language interface. Included are mechanisms for specifying how aggregate data is processed from …

Reasoning About Code Mobility With Mobile Unity, Gian Pietro Picco, Gruia-Catalin Roman, Peter J. Mccann

All Computer Science and Engineering Research

Advancements in network technology have led to the emergence of new computing paradigms that challenge established programming practices by employing weak forms of consistency and dynamic forms of binding. Code mobility, for instance, allows for invocation-time binding between a code fragment and the location where it executes. Similarly, mobile computing allows hosts (and the software they execute) to alter their physical location. Despite apparent similarities, the two paradigms are distinct in their treatment of location and movement. This paper seeks to uncover a common foundation for the two paradigms by exploring the manner in which stereotypical forms of code mobility …

Using Snapshot Streams To Support Visual Exploration, Delbert Hart, Eileen Kraemer, Gruia-Catalin Roman

All Computer Science and Engineering Research

The non-determinism, complexity, and size of distributed software systems present significant difficulties for designers and maintainers. Visualization can help alleviate these difficulties through interactive exploratory tools that allow both novice and experienced users to investigate a distributed computation using a common tool set. Essential to the success of a visual exploration tool is the ability to provide accurate representations of global states. This paper is concerned with the use of snapshots in support of interactive visual exploration of distributed computations. The nature of the visualization process requires snapshots that (1) are consecutive, thus facilitating smooth animation of state changes, (2) …

Mobile Unity: A Language And Logic For Concurrent Mobile Systems, Peter J. Mccann, Gruia-Catalin Roman

All Computer Science and Engineering Research

Traditionally, a distributed system has been viewed as a collection of fixed computational elements connected by a static network. Prompted by recent advances in wireless communications rechnology, the emerging field of mobile computing is challenging these assumptions by providing mobile hosts with connectivity that may change over time, raising the possibility that hosts may be called upon to operate while only weakly connected to or while completely disconnected from other hosts. We define a concurrent mobile system as one where independently executing coponents may migrate through some space during the course of the computation, and where the pattern of connectivity …

Architectural Choices In Large Scale Atm Switches, Jonathan Turner, Naoaki Yamanaka

All Computer Science and Engineering Research

The rapid development of Asynchronous Transfer Mode technology in the last 10-15 years has stimulated renewed interest in the design and analysis of switching systems, leading to new ideas for system designs and new insights into the performance and evaluation of such systems. As ATM moves closer to realizing the vision of ubiquitous broadband ISDN services, the design of switching systems takes on growing importance. This paper seeks to clarify the key architectural issues for ATM switching system design and provides a survey of the current state-of-the-art.

Dialogue And Deliberation, Ronald P. Loui, Diana M. Moore

All Computer Science and Engineering Research

Formal accounts of negotiation tend to invoke the strategic models of conflict which have been impressively developed by game theorists in this half-century. For two decades, however, research on artificial intelligence (AI) has produced a different formal picture of the agent and of the rational deliberations of agents. AI's models are not based simply on intensities of preference and quantities of probability. AI's models consider that agents use language in various ways, that agents use and convey knowledge, that agents plan, search, focus, and argue. Agents can choose their language, apply their knowledge, change their plans, continue their search, shift …

Noise-Tolerant Parallel Learning Of Geometric Concepts, Nader H. Bshouty, Sally A. Goldman, H. David Mathias

All Computer Science and Engineering Research

We present several efficient parallel algorithms for PAC-learning geometric concepts in a constant-dimensional space. The algorithms are robust even against malicious classification noise of any rate less than 1/2. We first give an efficient noise-tolerant parallel algorithm to PAC-learn the class of geometric concepts defined by a polynomial number of (d-1)-dimensional hyperplanes against an arbitrary distribution where each hyperplane has a slope from a set of known slopes. We then describe how boosting techniques can be used so that our algorithms' dependence on {GREEK LETTER} and {DELTA} does not depend on d. Next we give an efficient noise-tolerant parallel algorithm …

School Of Computer And Information Sciences Master Of Science Degree Programs 1997, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Doctoral Degree Programs School Of Computer And Information Science 1997, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Alchourron's Defeasible Conditionals And Defeasible Reasoning, Fernando Tohme, Ronald P. Loui

All Computer Science and Engineering Research

No abstract provided.

Eliding The Arguments Of Cases, Ronald P. Loui, Jeff Norman

All Computer Science and Engineering Research

No abstract provided.

End-User Visualization And Manipulation Of Aggregate Data, T. Paul Mccartney, Kenneth J. Goldman

All Computer Science and Engineering Research

Aggregate visualization and manipulation enables the viewing and interaction of dynamically changing data sets in a graphically meaningful way. However, off-the-shelf applications generally provide only limited ways to view aggregates. To be truly effective to the end-user, an aggregate visualization should be customizable to suit the individual's needs. This paper describes a software system that empowers end-users to create interactive aggregate visualizations through direct manipulation. Included are mechanisms for specifying how aggregate data is processed from multiple sources, providing functionality similar to project, select, join, and cross product of relational databases. Visualization of distributed data sets is emphasized.

Euphoria Reference Manual, T. Paul Mccartney, Kenneth J. Goldman

All Computer Science and Engineering Research

EUPHORIA is a user interface management system that enables end-users to create direct manipulation graphical user interfaces (GUIs) through interactive drawing. Used in conjunction with The Programmers' Playground, a distributed programming environment, end-users can dynamically create and associate GUI components with an underlying application without programming, This document describes EUPHORIA's functionality.

Building Interactive Distributed Applications In C++ With The Programmers' Playground, Kenneth J. Goldman, Joe Hoffert, T. Paul Mccartney, Jerome Plun, Todd Rogers

All Computer Science and Engineering Research

The objective of The Programmers' Playground, described in this manual, is to provide a development environment and underlying support for end-user construction of distributed multimedia applications from reusable self-describing software components. Playground provides a set of software tools and a methodology for simplifying the design and construction of applications that interact with each other and with people in a distributed computer system. This manual explains how to write interactive distributed applications using Playground. The only background necessary to get started is an understanding of basic data structures and control constructs in C++. If you already know C++, then with the …

Learning With Unreliable Boundary Queries, Avrim Blum, Prasad Chalasani, Sally A. Goldman, Donna K. Slonim

All Computer Science and Engineering Research

We introduce a model for learning from examples and membership queries in situations where the boundary between positive and negative examples is somewhat ill-defined. In our model, queries near the boundary of a target concept may receive incorrect or "don't care" responses, and the distribution of examples has zero probability mass on the boundary region. The motivation behind our model is that in many cases the boundary between positive and negative examples is complicated or "fuzzy." However, one may still hope to learn successfully, because the typical examples that one sees to not come from that region. We present several …

Noise-Tolerant Distribution-Free Learning Of General Geometric Concepts, Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki

All Computer Science and Engineering Research

We present an efficient algorithm for PAC-learning a very general class of geometric concepts over Rd for fixed d. More specifically, let T be any set of s halfspaces. Let x = (x1,...,xd) be an arbitrary point in Rd. With each t Є T we associate a boolean indicator function It(x) which is 1 if and only if x is in the halfspace t. The concept class Cds that we study consists of all concepts formed by any boolean function over It1, ...Its for ti Є T. This class is much more general than any geometric concept class known to …