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

Computer Engineering Commons™

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

1997

Discipline
Institution
Keyword
Publication
Publication Type

Articles 91 - 120 of 131

Full-Text Articles in Computer Engineering

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

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.

Go to article

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

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.

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

A Theoretical And Empirical Study Of A Noise-Tolerant Algorithm To Learn Geometric Patterns, Sally A. Goldman, Stephen D. Scott Jan 1997

A Theoretical And Empirical Study Of A Noise-Tolerant Algorithm To Learn Geometric Patterns, 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 describe a way in which the landmark matching problem can be mapped to that of learning a one-dimensional geometric pattern. The first contribution of our work is an efficient noise-tolerant algorithm (designed using the statistical query model) to PAC-learn the class of one-dimensional geometric patterns. The second contribution of our work is an empirical study of our algorithm that provides at least some evidence that statistical query algorithms may be valuable for use in practice for handling …

Go to article

Principles For Developing And Measuring High-Performance Web Servers Over Atm, James C. Hu, Sumedh Mungee, Douglas C. Schmidt Jan 1997

Principles For Developing And Measuring High-Performance Web Servers Over Atm, James C. Hu, Sumedh Mungee, Douglas C. Schmidt

All Computer Science and Engineering Research

High-performance Web servers are essential to meet the growing demands of the Internet. Satisfying these demands requires a thorough understanding of the key factors that affect Web server performance. This paper provides three contributions to the design, implementation, and evaluation of high-performance Web servers. First, we report the results of a comprehensive empirical study of popular high-performance Web servers (such as Apache, Netscape Enterprise, PHTTPD, and Zeus) over high-speed ATM networks. This study illustrates their relative performance and identifies their performance bottlenecks. To measure performance accurately, we developed a new benchmarking technique that subjects Web servers to varying connection frequencies. …

Go to article

Costs Of Constraint Based Networks On A Sphere, Hongzhou Ma, Jonathan Turner Jan 1997

Costs Of Constraint Based Networks On A Sphere, Hongzhou Ma, Jonathan Turner

All Computer Science and Engineering Research

This paper estimates the link costs of constraint based nonblocking ATM networks on a sphere. Analytical results are obtained when switches are uniformly distributed on the surface of a unit sphere and every switch has source and sink capacity of one, and the results are compared with simulations.

Go to article

Balancing Consistency And Lag In Transaction-Based Computational Steering, Eileen Kraemer, Delbert Hart, Gruia-Catalin Roman Jan 1997

Balancing Consistency And Lag In Transaction-Based Computational Steering, Eileen Kraemer, Delbert Hart, Gruia-Catalin Roman

All Computer Science and Engineering Research

Computational steering, the interactive adjustment of application parameters and allocation of resources, is a promising technique for higher-productivity simulation, finer-grained optimization of dynamically varying algorithms, and greater understanding of program behavior and the characteristics of data sets and solution spaces. Tools for computational steering must provide monitoring, visualization, and interaction facilities. In addition, these tools must address issues related to the consistency, latency, and scalability at each of these phases, and must consider the perturbation that results. In this paper we describe transaction-based components for a computational steering system and present an approach that guarantees consistent monitoring and displays, supports …

Go to article

Cappucino: An Extensible Planning Tool For Constraint-Based Atm Network Design, Inderjeet Singh, Jonathan S. Turner Jan 1997

Cappucino: An Extensible Planning Tool For Constraint-Based Atm Network Design, Inderjeet Singh, Jonathan S. Turner

All Computer Science and Engineering Research

Cappuccino is a planning tool for topological design of ATM networks. It uses a novel constraint-based approach to ATM network design. Extensibility of the tool is a basic design goal and the tool provides an open interface to incorporate new algorithms.

Go to article

An Architecture For Monitoring Visualization And Control Of Gigabit Networks, Guru Parulkar, Douglas Schmidt, Eileen Kraemer, Jonathan Turner, Anshul Kantawala Jan 1997

An Architecture For Monitoring Visualization And Control Of Gigabit Networks, Guru Parulkar, Douglas Schmidt, Eileen Kraemer, Jonathan Turner, Anshul Kantawala

All Computer Science and Engineering Research

We propose a network monitoring, visualization and control system (NMVC) that ensures adequate quality of service to network users while maintaining high network resource utilization. The main components of our system are a network probe, an endsystem probe, software network management agents that provide extensible multi-attribute event filtering for highly scalable data/event collection, network operation centers (NOCs) which can remotely install and (re)configure these agents, efficient online event ordering algorithms that can help synthesize and display a consistent view of network health, status and performance and a View Choreographer that allows management applications and administrators to specify the mapping of …

Go to article

Enhancements To 4.4 Bsd Unix For Efficient Networked Multimedia In Project Mars, Milind M. Buddhikot, Xin Jane Chen, Dakang Wu, Guru M. Parulkar Jan 1997

Enhancements To 4.4 Bsd Unix For Efficient Networked Multimedia In Project Mars, Milind M. Buddhikot, Xin Jane Chen, Dakang Wu, Guru M. Parulkar

All Computer Science and Engineering Research

Cluster based architectures that employ high performance inexpensive Personal Computers (PCs) interconnected by high speed commodity interconnect have been recognized as a cost-effective way of building high performance scalable Multimedia-On-Demand (MOD) storage servers [4, 5, 7, 9]. Typically, the PCs in these architectures run operating systems such as UNIX that have traditionally been optimized for interactive computing. They do not provide fast disk-to-network data paths and guaranteed CPU and storage access. This paper reports enhancements to the 4.4 BSD UNIX system carried out to rectify these limitations in the context of our Project Massively-parallel And Real-time Storage (MARS) [7]. We …

Go to article

Replication Of The First Controlled Experiment On The Usefulness Of Design Patterns: Detailed Description And Evaluation, Lutz Prechelt, Barbara Unger, Douglas Schmidt Jan 1997

Replication Of The First Controlled Experiment On The Usefulness Of Design Patterns: Detailed Description And Evaluation, Lutz Prechelt, Barbara Unger, Douglas Schmidt

All Computer Science and Engineering Research

Advocates of software design patterns claim that using design patterns improves communication between software developers. The controled experiment that we describe in this report tests the hypothesis that software maintainers of well-structured, well-documented software containing design patterns can make changes (1) faster and (2) with less errors if the use of patterns is explicitly documented in the software. The experiment was performed with 22 participants of a university course on C++ and design patterns; it is similar to a previous experiment performed in Karlsruhe. For one of the two experiment tasks the experiment finds that both hypotheses appear to be …

Go to article

Computational Detection Of Cpg Islands In Dna, Eric C. Rouchka, Richard Mazzarella, David J. States Jan 1997

Computational Detection Of Cpg Islands In Dna, Eric C. Rouchka, Richard Mazzarella, David J. States

All Computer Science and Engineering Research

Regions of DNA rich in CpG dinucleotides, also known as CpG islands, are often located upstream of the transcription start side in both tissue specific and housekeeping genes. Overall, CPG dinucleotides are observed at a density of 25% the expected level from base composition alone, partially due to 5-methylcytosine decay (Bird, 1993). Since CpG dinucleotides typically occur with low frequency, CpG islands can be distinguished statistically in the genome. Our method of detecting CpG islands involves a heuristic algorithm employing classic changepoint methods and log-likelihood statistics. A Java applet has been created to allow for user interaction and visualization of …

Go to article

An Algorithm For Message Delivery In A Micromobility Environment, Amy L. Murphy, Gruia-Catalin Roman, George Varghese Jan 1997

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

All Computer Science and Engineering Research

With recent advances in wireless communication and the ubiquity of laptops, mobile computing has become an important research area. An essential problem in mobile computing is the delivery of a message from a source to either a single mobile node, unicast, or to a group of mobile nodes, multicast. Standard solutions proposed for macromobility (Mobile IP) and micromobility (cellular phones) for the unicast problem rely on tracking the mobile node. Tracking solutions scale badly when mobile nodes move frequently, and do not generalize well to multicast delivery. Our paper proposes a new message delivery algorithm for micromobility based on a …

Go to article

An Introduction To Mobile Unity, Gruia-Catalin Roman, Peter J. Mccann Jan 1997

An Introduction To Mobile Unity, Gruia-Catalin Roman, Peter J. Mccann

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 …

Go to article

Terabit Burst Switching, Jonathan S. Turner Jan 1997

Terabit Burst Switching, Jonathan S. Turner

All Computer Science and Engineering Research

This report summarizes the results of an architectural study on Terabit Burst Switching. The purpose of this study was to explore alternative architectures for very high performance switching for data communication, using a combination of optical and electronic technologies. We explore two alternative implementations of the burst switching concept in detail, one using a hybrid architecture with an electronic core, and an integrated architecture using an all optical data path. We also briefly discuss an approach using optical TDM. Our results show that using the hybrid architecture, it is feasible to construct systems with aggregate capacities of tens of terabits …

Go to article

The Agent Test, Michael N. Huhns, Munindar P. Singh Jan 1997

The Agent Test, Michael N. Huhns, Munindar P. Singh

Faculty Publications

The authors consider agents on the World Wide Web, including information retrieval agents. They propose a test for agenthood, involving communication in multi-agent systems.

Go to article

Internet-Based Agents: Applications And Infrastructure, Munindar P. Singh, Michael N. Huhns Jan 1997

Internet-Based Agents: Applications And Infrastructure, Munindar P. Singh, Michael N. Huhns

Faculty Publications

Software agents are mitigating the complexity of modern information systems—technically by providing a locus for managing information subsets, and psychologically by providing an abstraction for human interaction with them.

Go to article

Mobile Agents, Michael N. Huhns, Munindar P. Singh Jan 1997

Mobile Agents, Michael N. Huhns, Munindar P. Singh

Faculty Publications

A lot of agents are executing on the Web, and some of them are starting to move around. While most agents are static (existing as a single process or thread on one host), others can pick up and move their code and data to a new host where they resume executing.

Go to article

Conversational Agents, Michael N. Huhns, Munindar P. Singh Jan 1997

Conversational Agents, Michael N. Huhns, Munindar P. Singh

Faculty Publications

When you build or buy an agent for the Web, you want it to perform as well as possible. Increasingly, this means your agent should take advantage not only of the Web's information resources, but also of all the other agents that might be operating there.

Go to article

Agents Are Everywhere!, Michael N. Huhns, Munindar P. Singh Jan 1997

Agents Are Everywhere!, Michael N. Huhns, Munindar P. Singh

Faculty Publications

A decade ago this claim would have evoked images from the Cold War—and probably gotten this column classified! Today, it describes one of the hottest technical areas on the Internet.

Go to article

Hierarchical Classification As An Aid To Browsing, John R. Rose, Caroline M. Eastman Jan 1997

Hierarchical Classification As An Aid To Browsing, John R. Rose, Caroline M. Eastman

Faculty Publications

An approach to browsing large chemical reaction databases is presented. The method that is described builds on earlier work in which unsupervised hierarchical classification was used to extract generalizations of reaction classes from reaction databases for use in reaction knowledge bases. The method described in this paper involves classification based on both semantic and topological features. It supports the creation of deep hierarchies in which succeeding levels represent increasing degrees of abstraction. The creation of a hierarchy allows the user to quickly locate interesting items or classes of items by performing a tree traversal as opposed to sequentially scanning a …

Go to article

Design And Implementation Of High-Radix Arithmetic Systems Based On The Sdnr/Rns Data Representation, Paul Whyte Jan 1997

Design And Implementation Of High-Radix Arithmetic Systems Based On The Sdnr/Rns Data Representation, Paul Whyte

Theses : Honours

This project involved the design and implementation of high-radix arithmetic systems based on the hybrid SDNRIRNS data representation. Some real-time applications require a real-time arithmetic system. An SDNR/RNS arithmetic system provides parallel, real-time processing. The advantages and disadvantages of high-radix SDNR/RNS arithmetic, and the feasibility of implementing SDNR/RNS arithmetic systems in CMOS VLSI technology, were investigated in this project. A common methodological model, which included the stages of analysis, design, implementation, testing, and simulation, was followed. The combination of the SDNR and RNS transforms potential complex logic networks into simpler logic blocks. It was found that when constructing a SDNRIRNS …

Go to article

A Method To Partially Suppress Is1 And Ma1 For Ds Ss Cdma Wireless Networks, Beata J. Wysocki, Tadeusz A. Wysocki Jan 1997

A Method To Partially Suppress Is1 And Ma1 For Ds Ss Cdma Wireless Networks, Beata J. Wysocki, Tadeusz A. Wysocki

Department of Electrical and Computer Engineering: Faculty Publications (to 2015)

We propose a method to partially suppress ISI and MAI for US SS CDMA schemes in wireless LANs. The method can be regarded as an alternative approach to combat ISI and in particular MAI by the use of advanced multiuser detection. Instead of using very sophisticated detectors, we propose introduction of a simple modification to the carrier waveform which results in very substaiitial reduction in cross-correlation belween users and an off-peak auto-correlation. The method can be applied to any DS SS CDMA scheme, but should be particularly useful in the case of short spreading signatures, as is the case of …

Go to article

Ontologies For Agents, Michael N. Huhns, Munindar P. Singh Jan 1997

Ontologies For Agents, Michael N. Huhns, Munindar P. Singh

Faculty Publications

An ontology is a computational model of some portion of the world. It is often captured in some form of a semantic network-a graph whose nodes are concepts or individual objects and whose arcs represent relationships or associations among the concepts. This network is augmented by properties and attributes, constraints, functions, and rules that govern the behavior of the concepts. Formally, an ontology is an agreement about a shared conceptualization, which includes frameworks for modeling domain knowledge and agreements about the representation of particular domain theories. Definitions associate the names of entities in a universe of discourse (for example, classes, …

Go to article

A Design In Interfacing The Mc68hc11 To The Amd Am29f010 Flash Memory Chips, David H. Hands Jan 1997

A Design In Interfacing The Mc68hc11 To The Amd Am29f010 Flash Memory Chips, David H. Hands

Theses : Honours

In many environments, motion, vibration and contamination to the Secondary Storage Devices such as hard drives can cause data to become unreadable or even lost. Elimination of these types of magnetic drives, incorporating its replacement with a Solid State Memory Storage Device would provide an invaluable solution for these type of environments. If a secondary storage system could replace these electro-mechanical disk drive systems incorporating a Solid State Secondary Storage Device such as the Flash Memory Integrated Chips, an increase in the speed of reading from milli-seconds to nano-seconds would transpire as well as providing a robust Secondary Storage Device. …

Go to article

A Self-Consistent Power Relation For An Inverse Compton Scattering Theory, Robert A. Schill Jr. Jan 1997

A Self-Consistent Power Relation For An Inverse Compton Scattering Theory, Robert A. Schill Jr.

Electrical & Computer Engineering Faculty Research

In a self-consistent manner, the total power for linear inverse Compton scattering between a Gaussian electron beam colliding head on with a Gaussian laser beam is obtained. The theory is shown to agree with well-known limiting cases. Coupling among harmonic modes is explicitly shown in the resultant power relation. Even so, for the parameters of interest, harmonic modes are negligible compared to the fundamental mode. Total power calculations are of importance in detector calibration. The theory is applied using practical linear accelerator and laser parameters.

Go to article

Measurement Of The Spectral Functions Of Vector Current Hadronic Tau Decays, R. Barate, M. Thulasidas Jan 1997

Measurement Of The Spectral Functions Of Vector Current Hadronic Tau Decays, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A measurement of the spectral functions of non-strange τ vector current final states is presented, using 124 358 τ pairs recorded by the ALEPH detector at LEP during the years 1991 to 1994. The spectral functions of the dominant two- and four-pion τ decay channels are compared to published results of e + e - annihilation experiments via isospin rotation. A combined fit of the pion form factor from τ decays and e + e - data is performed using different parametrizations. The mass and the width of the ρ ±(770) and the ρ 0(770) are separately determined in order …

Go to article

Compositional Programming Abstractions For Mobile Computing, Peter J. Mccann, Gruia-Catalin Roman Jan 1997

Compositional Programming Abstractions For Mobile Computing, Peter J. Mccann, Gruia-Catalin Roman

All Computer Science and Engineering Research

Recent advances in wireless networking technology and the increasing demand for ubiquitous, mobile connectivity demonstrate the importance of providing reliable systems for managing reconfiguration and disconnection of components. Design of such systems requires tools and techniques appropriate to the task. Many formal models of computation, including UNITY, are not adequate for expressing reconfiguration and disconnection and are therefore inappropriate vehicles for investigating the impact of mobility on the construction of modular and composable systems. Algebraic formalisms such as the pi-calculus have been proposed for modeling mobility. This paper addresses the question of whether UNITY, a state-based formalism with a foundation …

Go to article

First Prev Next Last