Physical Sciences and Mathematics Commons^™

Towards Robot Theatre, Marek Perkowski

Systems Science Friday Noon Seminar Series

The talk will present the idea of futuristic robot theatre and work done towards it at the Intelligent Robotics Laboratory, Department of Electrical and Computer Engineering at PSU. After a short history of robot theatre from antiquity until 2008 we will present recent work on robot theatre in the world and at PSU, including two plays: ancient Korean folk tale "Hahoe Pylyshin" and "What's that? A Schroedinger Cat" or a debate between Einstein and Schroedinger Cat about quantum mechanics - an educational theatre. Several models of robot theatre will be discussed: animatronic theatre, interactive theatre and improvisational theatre. We will …

Holism And Human History, Martin Zwick

Systems Science Faculty Publications and Presentations

We want and need the ‘whole story,’ but the whole story is difficult to tell. We can reduce the magnitude of the task by taking a cue from the title of the meeting, namely “Cosmos, Nature, Culture: A Transdisciplinary Conference.” The ‘whole story’ can be divided into three stories: the story of the unfolding of the universe (‘cosmos’), the story of the evolution of life (‘nature’), and the story of human history (‘culture’). This paper focuses on the third of these. Of course, human history is rooted in nature which is a manifestation of cosmos on our planet, but its …

Operational Verification Of A Relativistic Program, Robert T. Bauer

Computer Science Faculty Publications and Presentations

Engineering eorts to achieve scalable multiprocessor perfor- mance for concurrent reader-writer programs have resulted in a family of algorithms that are non-blocking and that tolerate interprocessor in- terference. Because these algorithms accept a unique frame of reference for each processor's accesses to memory, they typify a concurrent pro- gramming technique for shared memory multicore architectures called relativistic programmming.

Rigorous verification of these algorithms is not possible with existing semantic based approaches because the semantics under approximates multiprocessor behavior and the algorithms rely on abstruse interactions with the operating system that aren't reconciled with language seman- tics.

The Read-Copy Update (RCU) …

The Design And Implementation Of A Safe, Lightweight Haskell Compiler, Timothy Jan Chevalier

Computer Science Faculty Publications and Presentations

Typed programming languages offer safety guarantees that help programmers write correct code, but typical language implementations offer no proof that source-level guarantees extend to executable code. Moreover, typical implementations link programs with unsafe runtime system (RTS) code. I present a compiler for the functional language Haskell that preserves some of the properties of Haskell’s type system. The soundness proof for the combination of the compiler and a verified RTS requires a proof that the compiler emits code that cooperates correctly with the RTS. In particular, the latter proof must address the boundary between the user program and the garbage collector. …

A Framework For Superimposed Applications : Techniques To Represent, Access, Transform, And Interchange Bi-Level Information, Sudarshan Srivivasa Murthy

Dissertations and Theses

Superimposed applications (SAs) superimpose (that is, overlay) new information and structures (such as annotations) on parts (such as sub-documents) of existing base information (BI). In this setting, SA developers and users work with bi-level information, a combination of the superimposed information and the referenced BI parts.

We have designed a framework to assist SAs in the following bi-level-information-management activities: representation, access, transformation, and interchange. This framework defines the abstraction context agent to activate any BI part and to retrieve information from the context of the part. It includes means to represent and access bi-level information in a conceptual model (the …

Improving Travel Information Products Via Robust Estimation Techniques, David Maier, Kristin A. Tufte, Rafael J. Fernández Moctezuma

TREC Final Reports

Traffic-monitoring systems, such as those using loop detectors, are prone to coverage gaps, arising from sensor noise, processing errors and transmission problems. Such gaps adversely affect the accuracy of Advanced Traveler Information Systems. This project will explore models based on historical data that can provide estimates to fill such gaps. We build on an initial study by Mr. Rafael J. Fernandez-Moctezuma, using both a linear model and an artificial neural network (ANN) trained on historical data to estimate values for reporting gaps. These initial models were 80% and 89% accurate, respectively, in estimating the correct speed range, and misclassifications were …

Programmer Friendly Refactoring Tools, Emerson Murphy-Hill

Dissertations and Theses

Tools that perform semi-automated refactoring are currently under-utilized by programmers. If more programmers adopted refactoring tools, software projects could make enormous productivity gains. However, as more advanced refactoring tools are designed, a great chasm widens between how the tools must be used and how programmers want to use them. This dissertation begins to bridge this chasm by exposing usability guidelines to direct the design of the next generation of programmer-friendly refactoring tools, so that refactoring tools fit the way programmers behave, not vice-versa.

Is Parallel Programming Hard, And If So, Why?, Paul E. Mckenney, Maged M. Michael, Manish Gupta, Philip William Howard, Josh Triplett, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Of the 200+ parallel-programming languages and environments created in the 1990s, almost all are now defunct. Given that parallel systems are now well within the budget of the typical hobbyist or graduate student, it is not unreasonable to expect a new cohort in excess of several thousand parallel languages and environments to appear in the 2010s. If this expected new cohort is to have more practical impact than did its 1990s counterpart, a robust and widely applicable framework will be required that encompasses exactly what, if anything, is hard about parallel programming. This paper revisits the fundamental precepts of concurrent …

Graphical User Interfaces As Updatable Views, James Felger Terwilliger

Dissertations and Theses

In contrast to a traditional setting where users express queries against the database schema, we assert that the semantics of data can often be understood by viewing the data in the context of the user interface (UI) of the software tool used to enter the data. That is, we believe that users will understand the data in a database by seeing the labels, dropdown menus, tool tips, help text, control contents, and juxtaposition or arrangement of controls that are built in to the user interface. Our goal is to allow domain experts with little technical skill to understand and query …

Computational Techniques For Reducing Spectra Of The Giant Planets In Our Solar System, Holly L. Grimes

Dissertations and Theses

The dynamic atmospheres of Jupiter, Saturn, Uranus, and Neptune provide a rich source of meteorological phenomena for scientists to study. To investigate these planets, scientists obtain spectral images of these bodies using various instruments including the Cooled Mid-Infrared Camera and Spectrometer (COMICS) at the Subaru Telescope Facility at Mauna Kea, Hawaii. These spectral images are two-dimensional arrays of double precision floating point values that have been read from a detector array. Such images must be reduced before the information they contain can be analyzed. The reduction process for spectral images from COMICS involves several steps:

1. Sky subtraction: the …

Finding Irc-Like Meshes Sans Layer 7 Payloads, Akshay Dua, Jim Binkley, Suresh Singh

Computer Science Faculty Publications and Presentations

We present an algorithm for detecting IRC-like chat networks that does not rely on Layer 7 payload information. The goal is to extract only those meshes from conventional flows where long-term periodic data is being exchanged between an external server and multiple internal clients. Flow data is passed through a series of filters that reduce the memory requirements needed for final candidate mesh sorting. Final outputs consist of two sorted lists including the fanout list, sorted by the number of client hosts in the mesh, and a secondary list called the evil sort. The latter consists of meshes with any …

Evaluating Similarity-Based Trace Reduction Techniques For Scalable Performance Analysis, Kathryn Marie Mohror, Karen L. Karavanic

Computer Science Faculty Publications and Presentations

Event traces are required to correctly diagnose a number of performance problems that arise on today’s highly parallel systems. Unfortunately, the collection of event traces can produce a large volume of data that is difficult, or even impossible, to store and analyze. One approach for compressing a trace is to identify repeating trace patterns and retain only one representative of each pattern. However, determining the similarity of sections of traces, i.e., identifying patterns, is not straightforward. In this paper, we investigate pattern-based methods for reducing traces that will be used for performance analysis. We evaluate the different methods against several …

Squeak By Example, Andrew P. Black, Stéphane Ducasse, Oscar Nierstrasz, Damien Pollet, Damien Cassou, Marcus Denker

Computer Science Faculty Publications and Presentations

Squeak is a modern open-source development environment for the classic Smalltalk-80 programming language. This book, intended for both students and developers, will guide you gently through the language and tools by means of a series of examples and exercises.

Additional material is available from the book's web page at SqueakByExample.org.