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

Computer Engineering Commons™

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

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 24961 - 24990 of 25615

Full-Text Articles in Computer Engineering

Convergence Properties Of Perceptrons, Ratnasri Krishna Adharapurapu Jan 1995

Convergence Properties Of Perceptrons, Ratnasri Krishna Adharapurapu

Theses Digitization Project

No abstract provided.

Go to article

Evolution Of Emergent Computation, James P. Crutchfield, Melanie Mitchell Jan 1995

Evolution Of Emergent Computation, James P. Crutchfield, Melanie Mitchell

Computer Science Faculty Publications and Presentations

A simple evolutionary process can discover sophisticated methods for emergent information processing in decentralized spatially-extended systems. The mechanisms underlying the resulting emergent computation are explicated by a novel technique for analyzing particle-based logic embedded in pattern-forming systems. Understanding how globally-coordinated computation can emerge in evolution is relevant both for the scientific understanding of natural information processing and for engineering new forms of parallel computing systems.

Go to article

Scheduling Of Parallel Jobs On Dynamic, Heterogenous Networks, Dan Clark, Jeremy Casas, Steve Otto, Robert Prouty, Jonathan Walpole Jan 1995

Scheduling Of Parallel Jobs On Dynamic, Heterogenous Networks, Dan Clark, Jeremy Casas, Steve Otto, Robert Prouty, Jonathan Walpole

Computer Science Faculty Publications and Presentations

In using a shared network of workstations for parallel processing, it is not only important to consider heterogeneity and differences in processing power between the workstations but also the dynamics of the system as a whole. In such a computing environment where the use of resources vary as other applications consume and release resources, intelligent scheduling of the parallel jobs onto the available resources is essential to maximize resource utilization. Despite this realization, however, there are few systems available that provide an infrastructure for the easy development and testing of these intelligent schedulers. In this paper, an infrastructure is presented …

Go to article

Using Matlab To Illustrate The 'Phenomenon Of Aliasing', Sol Neeman, Ph.D. Jan 1995

Using Matlab To Illustrate The 'Phenomenon Of Aliasing', Sol Neeman, Ph.D.

Engineering Studies Faculty Publications and Creative Works

The phenomenon of aliasing is important when sampling analog signals. In cases where the signal is bandlimited, one can avoid aliasing by ensuring that the sampling rate is higher than the Nyquist rate . But in cases where the signal is not bandlimited , aliasing is unavoidable if the signal is not filtered before it is sampled. It is then crucial to understand the phenomenon in order to estimate the distortion generated when the signal is reconstructed from its samples. Using the software package MATLAB by MathWorks, Inc ., two examples are presented. The first is a pure sinusoid which …

Go to article

Pac Learing Of One-Dimensional Patterns, Paul W. Goldberg, Sally A. Goldman, Stephen D. Scott Jan 1995

Pac Learing Of One-Dimensional Patterns, Paul W. Goldberg, 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 consider the problem of PAC-learning the concept class of geometric patterns where the target geometric pattern is a configuration of k points on the real line. Each instance is a configuration of n points on the real line, where it is labeled according to whether or not it visually resembles the target pattern. To capture the notion of visual resemblance we use the Hausdorff metric. Informally, two geometric patterns P and Q resemble each othe runder the …

Go to article

A Survey Of Network Signaling, Dakang Wu Jan 1995

A Survey Of Network Signaling, Dakang Wu

All Computer Science and Engineering Research

Abstract Network signaling is the process of transferring control information among components of a communication network to establish, maintain, and release connections, and to pass the network management information. The rapid evolution in the field of telecommunications has led to the rapid evolution of network signaling. In this paper, we review the evolution of network signaling. We emphasize the concepts and protocols used in modern fast packet switching networks especially in emerging ATM networks.

Go to article

Reasoning About Program Interactions In The Presence Of Mobility, Gruia-Catalin Roman, Peter J. Mccann Jan 1995

Reasoning About Program Interactions In The Presence Of Mobility, Gruia-Catalin Roman, Peter J. Mccann

All Computer Science and Engineering Research

Mobile computing is emerging as an important new paradigm which has the potential to reshape our thinking about distributed computation. Mobility has far-reaching implications on what designers and users can assume about communication patterns, resource availability, and applciation behaviors as components move from one location to another while joining or leaving groups of other components in their vicinity. New distributed algorithms are likely to be required as the nature of applications shifts with the emergence of this new kind of computing environment. Formal methods have an important role to play in the midst of these developments both in terms of …

Go to article

A Single-Stroke Orientation-Orient Gesture System, Yike Hu Jan 1995

A Single-Stroke Orientation-Orient Gesture System, Yike Hu

All Computer Science and Engineering Research

No abstract provided.

Go to article

An Interactive Model Of Teaching, H. David Mathias Jan 1995

An Interactive Model Of Teaching, H. David Mathias

All Computer Science and Engineering Research

Previous teaching models in the learning theory community have been batch models. That is, in these models the teacher has generated a single set of helpful examples to present to the learner. In this paper we present an interactive model in which the learner has the ability to ask queries as in the query learning model of Angluin [1]. We show that this model is at least as powerful as previous teaching models. We also show that anything learnable with queries, even by a randomized learner, is teachable in our model. In all previous teaching models, all classes shown to …

Go to article

Aras: Asynchronous Risc Architecture Simulator, Chia-Hsing Chien, Mark A. Franklin, Tienyo Pan, Prithvi Prabhu Jan 1995

Aras: Asynchronous Risc Architecture Simulator, Chia-Hsing Chien, Mark A. Franklin, Tienyo Pan, Prithvi Prabhu

All Computer Science and Engineering Research

In this paper, an asynchronous pipeline instruction simulator, ARAS is presented. With this simulator, one can design selected instruction pipelines and check their performance. Performance measurements of the pipeline configuration are obtained by simulating the execution of benchmark programs on the machine architectures developed. Depending on the simulation results obtained by using ARAS, the pipeline configuration can be altered to improve its performance. Thus, one can explore the design space of aynchronous pipeline architectures.

Go to article

Assertional Reasoning About Pairwise Transient Interactions In Mobile Computing, Gruia-Catalin Roman, Peter J. Mccann, Jerome Plun Jan 1995

Assertional Reasoning About Pairwise Transient Interactions In Mobile Computing, Gruia-Catalin Roman, Peter J. Mccann, Jerome Plun

All Computer Science and Engineering Research

Mobile computing represents a major point of departure from the traditional distributed computing paradigm. The potentially very large number of independent computing units, a decoupled computing style, frequent disconnections, continuous position changes, and the location-dependent nature of the behavior and communication patterns of the individual components present designers with unprecedented challenges in the areas of modularity and dependability. This paper describes two ideas regarding a modular approach to specifying and reasoning about mobile computing. The novelty of our approach rests with the notion of allowing transient interactions among programs which mobe in space. In this paper we restrict our concert …

Go to article

Transient Data Sharing Among Mobile Programs, Jerome Plun, Gruia-Catalin Roman Jan 1995

Transient Data Sharing Among Mobile Programs, Jerome Plun, Gruia-Catalin Roman

All Computer Science and Engineering Research

Mobile computing represents a major point of departure from the traditional distributed computing paradigm. The potentially very large number of independent computing units, a decoupled computing style, frequent disconnections, continuous position changes, and the location-dependent nature of the behavior and communication patterns present designers with unprecedented challenges in the areas of modularity and dependability. This paper describes a modular approach to specifying and reasoning about of mobile computing. Its novelty rests with the notion of allowing transient (location-dependent) data sharing among programs which move in space. The notation is a direct extension of that used in UNITY and reasoning about …

Go to article

Real-Time Upcalls: A Mechanism To Provide Real-Time Processing Guarantees, Raman Gopalakrishna, Guru M. Parulkar Jan 1995

Real-Time Upcalls: A Mechanism To Provide Real-Time Processing Guarantees, Raman Gopalakrishna, Guru M. Parulkar

All Computer Science and Engineering Research

Real-time upcalls (RTUs) are an operating systems mechanism that can be used by applications to efficiently schedule code segments (or handlers) that must execute periodically. While the mechanism was conceibed to support protocol processing with quality-of-service guarantees for networked multimedia applicatoins it is general enough to be applicable in other domains like real-time image processing. Until now real-time threads have been the only mechanism for implementing protocols in user space with QoS guarantees. The RTU mechanism avoids the implementation complexity of the thread based approach while retaining its ability to ensure real-time behavior. In addition, our design simplifies protocol code, …

Go to article

Load Balance Properties Of Distributed Data Layouts For Clustered Mod Servers, Milind M. Buddhikot, Guru Parulkar Jan 1995

Load Balance Properties Of Distributed Data Layouts For Clustered Mod Servers, Milind M. Buddhikot, Guru Parulkar

All Computer Science and Engineering Research

Large scale storage servers that provide location transparent, interactive access to hundreds or thousands of concurrent, independent clients will be important components of hte furture information super-highway infrastructure. Two key requirements of such servers are as follows: support high parallelism and concurrency in data access to allow large number of access to the same or different data. Second, support independent interactive playout control operations such as fast-forward, rewind, slow-play, pause, resume, random access etc. with minimal latency. This paper assumes a distributed storage server architecture consisting of several high performance storage nodes interconnected by a high speed desk area network …

Go to article

Hart's Critics On Defeasible Concepts And Ascriptivism, Ronald P. Loui Jan 1995

Hart's Critics On Defeasible Concepts And Ascriptivism, Ronald P. Loui

All Computer Science and Engineering Research

Hart's "Ascription of Responsibility and Rights" is where we find perhaps the first clear pronouncement of defeasibility and the technical introduction of the term. The paper has been criticised, disavowed, and never quite fully redeemed. Its lurid history is now being used as an excuse for dismissing the importance of defeasibility. Quite to the contrary, Hart's introduction of defeasibility has uniformly been regarded as the most agreeable part of the paper. The critics' wish that defeasibility could be better expounded along the lines of a Wittgensteinian game-theoretic semantics has largely been fulfilled. Even the most contentious part of the paper, …

Go to article

Efficient Demultiplexing Of Network Packets By Automatic Parsing, Mahesh Jayaram, Ron K. Cytron Jan 1995

Efficient Demultiplexing Of Network Packets By Automatic Parsing, Mahesh Jayaram, Ron K. Cytron

All Computer Science and Engineering Research

Packet filters are a mechanism for efficiently demultiplexing network packets to application endpoints. There is currently no general, formal specification method for packet filters that allows for easy or efficient composition of specifications. In this paper we present an automatic approach that achieves all of these goals. We approach packet filter specification as a language recognition problem: each filter is represented by a context-free grammar, whose language is the set of packets the filter should accept. Thus, packet filters can be formulated through a general, well defined specification; further, the grammar-based approach simplifies filter composition, which is essential where scalability …

Go to article

Design Of A Tool For Rapid Prototyping Of Communication Protocols, Aniruddha Gokhale, Ron Cytron, George Varghese Jan 1995

Design Of A Tool For Rapid Prototyping Of Communication Protocols, Aniruddha Gokhale, Ron Cytron, George Varghese

All Computer Science and Engineering Research

We present a new tool for automatically generating prototypes of communication protocols on a wide variety of platforms. Our goal is to reduce design time, enhance portability, and accommodate optimizations automatically. Users of the tool are required to provide an abstract implementation of the protocol in C++ without worrying about the underlying operating system specific system calls. Instead, the user employs high-level interface functions provided by the tool to interact with the underlying operating system. Users also need not worry about complex packet formats that involve fields of various bit and byte lengths. Instead, they use simple C/C++ struct declarations …

Go to article

Self-Stabilization By Window Washing, Adam M. Costello, George Varghese Jan 1995

Self-Stabilization By Window Washing, Adam M. Costello, George Varghese

All Computer Science and Engineering Research

A useful way to design simple and robust protocols is to make them self-stabilitizing. We describe a new general technique for self-stabilization called window washing. We apply this technique to generalized sliding window protocols that work on a number of topologies. This results in simple, efficient, and self-stabilizing protocols. As far as we know, both window washing and generalized sliding window protocols are new ideas. Our protocols can be used for data links, reliable broadcast, and flow control.

Go to article

Distributed Radiological Multimedia Conferencing, Naeem Bari Jan 1995

Distributed Radiological Multimedia Conferencing, Naeem Bari

All Computer Science and Engineering Research

Distributed Radiological Multimedia Conference (DRMC) is a collaborative imaging/multimedia conferencing tool which allows geographically separated physicians to confer over a shared projection radiograph. DRMC utilizes the advantages of high bandwidth and scalability offered by the new Asynchronous Transfer Mode (ATM) network technology. This application is customized for the high quality of displayed images and rapid response to user requests. It allows conferees to: share a common radiograph; each possess an independently controlled globally visible cursor; be able to point to and outline areas on the image to bring it to the other conferees' attention; and see and hear each other …

Go to article

Master Of Science Degree Programs Computer Information Systems, Management Information Systems 1995, Nova Southeastern University Jan 1995

Master Of Science Degree Programs Computer Information Systems, Management Information Systems 1995, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Go to article

A General Matrix Iterative Model For Dynamic Load Balancing, Mark A. Franklin, Vasudha Govindan Jan 1995

A General Matrix Iterative Model For Dynamic Load Balancing, Mark A. Franklin, Vasudha Govindan

All Computer Science and Engineering Research

Effective load balancing algorithms are crucial in fully realizing the performance potential of parallel computer systems. This paper proposes a general matrix iterative model to represent a range of dynamic load balancing algorithms. The model and associated performance measures are used to evaluate and compare vairous load balancing algorithms and derive optimal algorithms and associated parameters for a given application and multiprocessor system. The model is parameterized to represent three load balancing algorithms - the random strategy, diffusion and complete redistribution algorithms. The model is validated by comparing the results with measured performance on a realistic workload. The parallel N-body …

Go to article

Issues In Distributed Control For Atm Networks, Jonathan S. Turner Jan 1995

Issues In Distributed Control For Atm Networks, Jonathan S. Turner

All Computer Science and Engineering Research

Asynchronous Transfer Mode (ATM) network technology is expected to become a central part of the emerging global information infrastructure. ATM networks introduce a number of features that distinguish them from earlier technologies and introduce new issues in network control. This paper offers a framework for precisely defining and analyzing alternative approaches to the distributed control of ATM networks and explores some of the key design issues through a series of examples. It is hoped that it will provide a useful foundation for researchers in networking and distributed computing interested in exploring these issues further and developing more complete solutions.

Go to article

Synchronized Data Objects, Marin Bezic Jan 1995

Synchronized Data Objects, Marin Bezic

All Computer Science and Engineering Research

Synchronized Data Objects (SDOs) are presented as a method of encapsulating, in the datatype definition, synchronization protocols that are used to control information exchange. SDOs are presented in the context of I/O abstraction, a programming model that seeks to separate communication from computation in order to support dynamic end-user configuration of distrivuted applications. SDOs can be used to implement a variety of synchronization paradigms, including remote invalidation, demand-driven data streams, remote procedure call, and promises. An implementation of SDOs is described in the context of The Programmers' Playground, a distributed application development environment that supports the I/O abstraction programming model. …

Go to article

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

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

All Computer Science and Engineering Research

No abstract provided.

Go to article

Building Interactive Distributed Applications In C++ With The Programmers' Playground, Kenneth J. Goldman, T. Paul Mccartney, Ram Sethuraman, Bala Swaminathan And Todd Rogers Jan 1995

Building Interactive Distributed Applications In C++ With The Programmers' Playground, Kenneth J. Goldman, T. Paul Mccartney, Ram Sethuraman, Bala Swaminathan And Todd Rogers

All Computer Science and Engineering Research

No abstract provided.

Go to article

Maintaining High Throughput During Overload In Atm Switches, Jonathan S. Turner Jan 1995

Maintaining High Throughput During Overload In Atm Switches, Jonathan S. Turner

All Computer Science and Engineering Research

This report analyzes two popular heuristics for ensuring packet integrity in ATM switching systems. In particular, we analyze the behavior of packet tail discarding, in order to understand how the packet level link efficiency is dependent on the rates of individual virtual circuits and the degre of the imposed overload. In addition, we study early packet discard and show that the queue capacity needed to achieve high efficiency under worst-case conditions grows with the number of virtual circuits and we determine the efficiency obtainable with more limited queue capacities. Using the insights from these analyses, extensions to early packet discard …

Go to article

Distributed Debugging With I/O Abstraction, Andrew S. Koransky Jan 1995

Distributed Debugging With I/O Abstraction, Andrew S. Koransky

All Computer Science and Engineering Research

This thesis presents a simple, yet powerful, set of mechanisms for testing and debugging distributed applications consisting of modules that communicate through well-defined data interfaces. The tools allow default or programmer-defined functions to be attached to various communication events so that particular data values at interesting points in the program are made available for testing and debugging. The debugging status of each component of the communication interface can be controlled separately so that various debugging information can be turned on and off during program execution. By attaching breakpoints to programmer-defined fucntions in a standard debugger, fine-grained examination of each module …

Go to article

Time Variability While Training A Parallel Neural Net Network, Tina L. Seawell, Barry L. Kalman Jan 1995

Time Variability While Training A Parallel Neural Net Network, Tina L. Seawell, Barry L. Kalman

All Computer Science and Engineering Research

The algorithmic analysis, data collection, and statistical analysis required to isolate the cause of time variability observed while an Elman style recurrent neural network is trained in parallel on a twenty processor SPARCcenter 2000 is described in detail. Correlations of system metrics indicate the operating system scheduler or an interaction of kernel processes is the most probable explanation for the variability.

Go to article

Euphoria: End-User Construction Of Direct Manipulation User Interfaces For Distributed Applications, T. Paul Mccartney, Kenneth J. Goldman, David E. Saff Jan 1995

Euphoria: End-User Construction Of Direct Manipulation User Interfaces For Distributed Applications, T. Paul Mccartney, Kenneth J. Goldman, David E. Saff

All Computer Science and Engineering Research

The Programmers' Playground is a software library and run-time system for creating distributed multimedia applications from collections of reusable software moduels. This paper presents the design and implementation of EUPHORIA, Playground's user interface management system. Implemented as a Playground module, EUPHORIA allows end-users to create direct manipulation graphical user interfaces (GUIs) exclusively through the use of a graphics editor. No programming is required. At run-time, attributes of the GUI state can be exposed and connected to external Playground modules, allowing the user to vosualize and directly manipulate state information in remote Playground modules. Features of EUPHORIA include real-time direct manipulation …

Go to article

Webwork: Integrated Programming Environment Tools For National And Grand Challenges, Geoffrey C. Fox, Wojtek Furmanski, Marina Chen, Claudio Rebbi, James H. Cowie Jan 1995

Webwork: Integrated Programming Environment Tools For National And Grand Challenges, Geoffrey C. Fox, Wojtek Furmanski, Marina Chen, Claudio Rebbi, James H. Cowie

Physics - All Scholarship

Challenging-scale problems consistently demand solutions that fuse geographically distributed and heterogeneous data, personnel, expertise, and resources. For example, national health care problems require collaboration among experts of fields as diverse as medical informatics, public policy, robotics, and high performance computing to solve problems ranging from telemedicine to cost management and quality control. Indeed, many National Challenges include Grand Challenges as subcomponents. We can pose the Integrated Challenge as the solution of etaproblems hosted on world-wide metacomputers linking all three aspects: simulation, information processing, and collaboration. We suggest a hybrid approach to Integrated Challenges that combines World-Wide Web (WWW) technologies with …

Go to article

First Prev Next Last