Systems Architecture Commons^™

On Matching Ann Structure To Problem Domain Structure, George G. Lendaris, Martin Zwick, Karl Mathia

Complex Systems Faculty Publications and Presentations

To achieve reduced training time and improved generalization with artificial neural networks (ANN, or NN), it is important to use a reduced complexity NN structure. A "problem" is defined by constraints among the variables describing it. If knowledge about these constraints could be obtained a priori, this could be used to reduce the complexity of the ANN before training it. Systems theory literature contains methods for determining and representing structural aspects of constrained data (these methods are herein called GSM, general systems method). The suggestion here is to use the GSM model of the given data as a pattern for …

A Study Of Dynamic Optimization Techniques: Lessons And Directions In Kernel Design, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

The Synthesis kernel [21,22,23,27,28] showed that dynamic code generation, software feedback, and fine-grain modular kernel organization are useful implementation techniques for improving the performance of operating system kernels. In addition, and perhaps more importantly, we discovered that there are strong interactions between the techniques. Hence, a careful and systematic combination of the techniques can be very powerful even though each one by itself may have serious limitations. By identifying these interactions we illustrate the problems of applying each technique in isolation to existing kernels. We also highlight the important common under-pinnings of the Synthesis experience and present our ideas on …

Constrained-Latency Storage Access: A Survey Of Application Requirements And Storage System Design Approaches, Richard Staehli, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Applications with Constrained Latency Storage Access (CLSA) are those that have large storage needs and hard constraints on the amount of latency they can tolerate. Such applications present a problem when the storage technology that is cost effective and large enough cannot meet their latency constraints for demand fetching. Examples are found in the developing field of multimedia computing and, to a lesser extent, in real-time database literature. This paper examines the nature of timing constraints at the application-storage interface and defines a classification for both the synchronization constraints of the application and the latency characteristics of the storage system. …

Concurrency Control, Version Management And Transactions In Advanced Database Systems, Jonathan Walpole, Muntuck Yap

Computer Science Faculty Publications and Presentations

This document constitutes the final deliverable for the research project titled “An Investigation of Selected Issues in Transaction Mechanism Design for Object Oriented Databases.” The document describes our ideas for extending the traditional transaction concept for use in object oriented databases, and concentrates specifically on providing an underlying model to support the concurrency control and version management aspects of the problem. The ideas presented here are not however restricted to the domain of object oriented databases. They are more generally applicable to database systems that require flexibility in their versioning and concurrency control policies.

In this document we define a …

Benchmarking Parallel Machines Via A Software Architecture, Srikanth Kambhatla, Jon Inouye, Jonathan Walpole

Computer Science Faculty Publications and Presentations

The diversity in parallel architectures and the programming styles induced thereof, make benchmarking of parallel machines a hard problem. Current benchmarking techniques are limited in applicability due to the issues of portability. We present a different approach to benchmarking parallel machines, which would make the resulting benchmarks portable, easy to use and widely applicable. The approach involves the use of a software architecture to mask the diversities of the underlying architectures. The benchmarks are based on the Linda Tuple Space, and is called BeLinda. In this report, we motivate the use of a software architecture, give a specification of the …

"Large Systems", Richard Ernest Bellman

Special Collections: Oregon Public Speakers

No abstract provided.

"The Ore Plan: A Practical Application Of The Systems Approach To Solid Waste Management In Oregon", Richard Duncan

Special Collections: Oregon Public Speakers

No abstract provided.

"The Curious Behavior Of Complex Systems: Lessons From Biology", Heinz Von Foerster

Special Collections: Oregon Public Speakers

No abstract provided.

"A Philosophy For Complexity", Charles West Churchman

Special Collections: Oregon Public Speakers

No abstract provided.

"Education For Managing Complexity", Harold A. Linstone

Special Collections: Oregon Public Speakers

No abstract provided.

Moment-Curvature-Thrust Relationships In Hybrid Members, Douglas Wrenn Fiala

Dissertations and Theses

In order to overcome the difficulties encountered in closed form solutions, moment-curvature-thrust relationships are developed for hybrid and nonhybrid cross sections utilizing an open form method. The use of horizontal sectors permits the inclusion of residual stresses and/or nonbilinear stress-strain relationships, if desired. Theoretical and experimental data are compared. Applications to circular tubes and other cross sections are discussed. Results indicate that open form solutions are feasible for calculating moment-curvature-thrust data. Hybrid cross sections are easily treated by open form solutions.