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

Physical Sciences and Mathematics Commons™

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

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 13291 - 13320 of 13631

Full-Text Articles in Physical Sciences and Mathematics

Generalization Metrics For Neural Modeling Applications In System Identification, Denise M. Reeves Apr 1995

Generalization Metrics For Neural Modeling Applications In System Identification, Denise M. Reeves

Electrical & Computer Engineering Theses & Dissertations

In this thesis a procedure to design multilayer feedforward networks for system identification with good prediction properties is presented. Central to the design procedure is a means to characterize the prediction capabilities of various trained neural networks. Such knowledge will allow for the identification of the best network design. For system identification purposes, a "good" model is one that is good at predicting, In particular, a good model is one that produces small prediction errors when applied to a set of cross-validation data. We formulate and implement a criterion function designed to measure the size of a trained neural network's …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 3, March 1995, College Of Engineering And Computer Science, Wright State University Mar 1995

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 3, March 1995, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Go to article

Study Of The Subjet Structure Of Quark And Gluon Jets, D. Buskulic, D., M. Thulasidas Mar 1995

Study Of The Subjet Structure Of Quark And Gluon Jets, D. Buskulic, D., M. Thulasidas

Research Collection School Of Computing and Information Systems

Measurements of the subjet structure of quark and gluon jets in hadronic Z decays are presented. The analysis is based on one million hadronic events recorded by the Aleph detector. Roughly symmetric three-jet events are selected with a coarse jet-resolution cut-off, y1. Gluon jets are identified with a purity of 94.6% in those events where evidence of long-lived heavy-flavour hadrons in the other two jets is found. The jets are then analyzed using a smaller cut-off y0 (< y1) so that subjets are resolved. The properties of the jets (subjet multiplicities (Nq), (Ng) and rates Rng(q) for n = 1, 2, 3, 4) are determined and are found to be in good agreement with the expectations of perturbative QCD as long as the subjet resolution parameter y0 is sufficiently large to keep non-perturbative effects small. In particular, the ratio , which to leading order in QCD is given by the ratio of colour factors , is measured to be 1.96 ± 0.15 for y0 = 2 · 10−3, but falls to 1.29 ± 0.03 for y0 = 1.6 · 10−5.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 2, February 1995, College Of Engineering And Computer Science, Wright State University Feb 1995

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

BITs and PCs Newsletter

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

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 1, January 1995, College Of Engineering And Computer Science, Wright State University Jan 1995

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

BITs and PCs Newsletter

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

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

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

Can Declared Strategy Voting Be An Effective Instrument For Group Decision-Making?, Lorrie Faith Cranor Jan 1995

Can Declared Strategy Voting Be An Effective Instrument For Group Decision-Making?, Lorrie Faith Cranor

All Computer Science and Engineering Research

The goal of this research is to determine whether declared strategy voting can be an effective tool for group decision-making. Declared strategy voting is a novel group decision-making procedure in which preference is specified using voting strategies - first-order mathematical functions that specify a choice in terms of zero or more parameters. This research will focus on refining the declared strategy voting concept, developing an accessible implementation of declared strategy voting that can be used for mock elections, assessing the potential impacts of declared strategy voting, and evaluating the effectiveness of declared strategy voting for group decision-making. This proposal describes …

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

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

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

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

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

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

Formal Specification Of A Dynamically Configurable Distributed System, Ram Sethuraman, Kenneth J. Goldman Jan 1995

Formal Specification Of A Dynamically Configurable Distributed System, Ram Sethuraman, Kenneth J. Goldman

All Computer Science and Engineering Research

The Programmers' Playground is a programming environment that supports end-user construction of distributed multimedia applications. The system implements a new programming model that is based, in part, upon ideas from the formal I/O automaton model of Lynch and Tuttle. Important features of The Programmers' Playground are a separation of communication and computation and graphical support for dynamic reconfiguration. This paper provides a formal specification of the Playground programming model and runtime system in terms of the I/O automaton model on which it is based. Exploiting the compositionality properties of the I/O automaton model, the formal specification is describd as a …

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

Redesigning The Bsd Callout And Timer Facilities, Adam M. Costello, George Varghese Jan 1995

Redesigning The Bsd Callout And Timer Facilities, Adam M. Costello, George Varghese

All Computer Science and Engineering Research

We describe a new implementation of the BSD callout and timer facilities. Current BSD kernels take time proportional to the number of outstanding timers to set or cancel timers. Our implementation takes constant time to start, stop, and maintain timers; this leads to a highly scalable design that can support thousands of outstanding timers without much overhead. Unlike the existing implementation, our routines are guaranteed to lock out interrupts only for a small, bounded amount of time. We also extend the setitimer() interface to allow a process to have multiple outstanding timers, thereby reducing the need for users to maintain …

Go to article

User Interface Applications Of A Multi-Way Constraint Solver, T. Paul Mccartney Jan 1995

User Interface Applications Of A Multi-Way Constraint Solver, T. Paul Mccartney

All Computer Science and Engineering Research

Constraints are widely recognized as a useful tool for user interface constructino. Through constraints, relationships among user interface components can be defined declaratively, leaving the task of relationship management to a constraint solver. Multi-way constraint solvers supporting constraint hierarchies provide a means to specify preferential constraint relationships with a dynamically changing computation flow, making them especially well suited to interactive user interfaces. However, previous such constraint solvers lack the ability to enforce inequalities or to effectively handle cyclic constraint relationships. These deficiencies limit the problems that could be solved using a constraint-based approach. This paper presents a new algorithm called …

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

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

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

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

An Efficient Signaling Structure For Atm Networks, Dakang Wu Jan 1995

An Efficient Signaling Structure For Atm Networks, Dakang Wu

All Computer Science and Engineering Research

As ATM becomes widely accepted as the communication standard for high speed networks, the signaling system structure and protocols that support ATM become more and more important. To support existing, future and unknown applications, the signalign system has to be very flexible and efficient. In this paper we define the signaling problem, present several possible signaling system structures, compare the advantages and disadvantages of these systems, and then we propose a new signaling system structure. The fundamental idea of the new signaling system is the logical separation of the signaling system structure from the underlying communication network, even though they …

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

Reliable Fifo Load Balancing Over Multiple Fifo Channels, Hari Adieseshu, Gurudatta M. Parulkar, George Varghese Jan 1995

Reliable Fifo Load Balancing Over Multiple Fifo Channels, Hari Adieseshu, Gurudatta M. Parulkar, George Varghese

All Computer Science and Engineering Research

Link striping algorithms are often used to overcome transmission bottlenecks in computer networks. However, traidtional striping algorithms suffer from two major disadvantages. They provide inadequate load sharing in the presence of variable length packets, and may result in non-FIFO delivery of data. We describe a new family of link striping algorithms that solve both problems. Our scheme applies to packets at any layer (physical, data, link, network, and transport) that work over multiple FIFO channels. We deal with variable sized packets by showing how a class of fair queueing algorithms can be converted into load sharing algorithms. Our transformation results …

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

An Oo Encapsulation Of Lightweight Os Concurrency Mechanisms In The Ace Toolkit, Douglas C. Schmidt Jan 1995

An Oo Encapsulation Of Lightweight Os Concurrency Mechanisms In The Ace Toolkit, Douglas C. Schmidt

All Computer Science and Engineering Research

This paper describes the design of the ACE object-oriented thread encapsulation class library. The architecture of this class library is presented from an end-user and internal design perspective and several key design issues are discussed. Readers should gain an understanding of the overall design approach as well as the tradeoffs between various software quality factors such as performance, portability, and extensibility.

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

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

First Prev Next Last