Physical Sciences and Mathematics | Open Access Articles

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 4, April 1995, 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.

Go to article

Mpvm: A Migration Transparent Version Of Pvm, Jeremy Casas, Dan Clark, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Parallel Virtual Machine (PVM) is a widely-used software system that allows a heterogeneous set of parallel and serial UNIX-based computers to be programmed as a single message-passing parallel machine, In this paper, an extension to PVM to support dynamic process migration is presented. Support for migration is important in general-purpose workstation environments since it allows parallel computations to co-exist with other applications, using idle-cycles as they become available and off-loading from workstations when they are no longer free. A description and evaluation of the design and implementation of the prototype Migratable PVM system is presented together with some performance results.

Go to article

Thermal Effects On Y2O3:Eu3+ For Fiber Optic Temperature Sensing, Arnel C. Lavarias

Electrical & Computer Engineering Theses & Dissertations

Fiber optic methods have gained acceptance in the past several years as non intrusive optical techniques of measuring environmental variables, particularly under hostile conditions. Fiber optic temperature sensors are required for many applications which have a large operating range. One way to implement this sensor is to introduce rare earth-doped materials into a fiber showing temperature-dependent optical emission characteristics. The thermal effects on optical emission characteristics of Y₂O₃:Eu³⁺ were studied. The thermal broadening and temperature dependence of the lifetime (τ) of the 611.4 nm emission due to the ⁵D₀ ➔ 7F …

Go to article

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

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

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

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

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

Book Review: Reasoning Agents In A Dynamic World: The Frame Problem. Kenneth M. Ford And Patrick J. Hayes, Eds.,, Jozsef A. Toth

Jozsef A Toth Ph.D.

No abstract provided.

Go to article

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

All Computer Science and Engineering Research

No abstract provided.

Go to article

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

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

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

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

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

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

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

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

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

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

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

All Computer Science and Engineering Research

No abstract provided.

Go to article

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

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

Error Control For Continuous Media And Multipoint Applications, Christos Papadopoulos, Guru Parulkar

All Computer Science and Engineering Research

High-bandwidth multimedia applications pose new challenges to error control. These include the support of error control for Continuous Media (CM) streams and the scalable support of error control in multipoint applications where the number of participants is large. Current error control mechanisms provide no support for the above applications. In this report we present new error control mechanisms that provide the required support. Continuous media applications have strict timing requirements which greatly affect recovery. To support continuous media applications we have designed and implemented a point-to-point error control mechanism which features the following: (1) selective repeat retransmission, (2) conditional retransmission, …

Go to article

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

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

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

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

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

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

Full-Text Articles in Physical Sciences and Mathematics

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

BITs and PCs Newsletter

Mpvm: A Migration Transparent Version Of Pvm, Jeremy Casas, Dan Clark, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Thermal Effects On Y2O3:Eu3+ For Fiber Optic Temperature Sensing, Arnel C. Lavarias

Electrical & Computer Engineering Theses & Dissertations

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

Electrical & Computer Engineering Theses & Dissertations

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

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

Research Collection School Of Computing and Information Systems

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

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

Book Review: Reasoning Agents In A Dynamic World: The Frame Problem. Kenneth M. Ford And Patrick J. Hayes, Eds.,, Jozsef A. Toth

Jozsef A Toth Ph.D.

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

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research

An Efficient Signaling Structure For Atm Networks, Dakang Wu

All Computer Science and Engineering Research

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

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

All Computer Science and Engineering Research

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

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

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research

Error Control For Continuous Media And Multipoint Applications, Christos Papadopoulos, Guru Parulkar

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research

Synchronized Data Objects, Marin Bezic

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research

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

All Computer Science and Engineering Research