Physical Sciences and Mathematics Commons^™

Object Oriented Program Correctness With Oosiml, José M. Garrido

Faculty and Research Publications

Software reliability depends on program correctness and robustness and these are extremely important in developing high-quality software. Correctness is also essential when considering aspects of software security. However, experience applying these concepts, associated methods, and supporting software with Eiffel and Java have shown that students find some diffculty learning program correctness and in learning the software tools provided. We have developed an experimental language, OOSimL, that includes an assertion notation similar to that of Eiffel but which has much more flexibility, and that provides the same semantics as Java.

The first part of this paper provides an overview of concepts …

Digital Logic Based Encoding Strategies For Steganography On Voice-Over-Ip, Hui Tian, Ke Zhou, Hong Jiang, Dan Feng

CSE Conference and Workshop Papers

This paper presents three encoding strategies based on digital logic for steganography on Voice over IP (VoIP), which aim to enhance the embedding transparency. Differing from previous approaches, our strategies reduce the embedding distortion by improving the similarity between the cover and the covert message using digital logical transformations, instead of reducing the amount of the substitution bits. Therefore, by contrast, our strategies will improve the embedding transparency without sacrificing the embedding capacity. Of these three strategies, the first one adopts logical operations, the second one employs circular shifting operations, and the third one combines the operations of the first …

It Seemed Like A Good Idea At The Time, James Huggins, Jonas Boustedt, Robert Mccartney, Katherine Deibel, Beth Simon, Suzanne Westbrook

Computer Science Presentations And Conference Materials

We often learn of successful pedagogical experiments, but we seldom hear of the the ones that failed. For this special session we solicited submissions from the SIGCSE membership, selected the best from among these, and will have presentations at the session by the selected authors. Our contributions describe pedagogical approaches that seemed to be good ideas but turned out as failures. At the session, contributors will describe their pedagogical experiment, the rationale for the experiment, evidence of failure, and lessons learned.

Everyone Is A Curator: Human-Assisted Preservation For Ore Aggregations, Frank Mccown, Michael L. Nelson, Herbert Van De Sompel

Computer Science Faculty Publications

The Open Archives Initiative (OAI) has recently created the Object Reuse and Exchange (ORE) project that defines Resource Maps (ReMs) for describing aggregations of web resources. These aggregations are susceptible to many of the same preservation challenges that face other web resources. In this paper, we investigate how the aggregations of web resources can be preserved outside of the typical repository environment and instead rely on the thousands of interactive users in the web community and the Web Infrastructure (the collection of web archives, search engines, and personal archiving services) to facilitate preservation. Inspired by Web 2.0 services such as …

Correlation Of Music Charts And Search Engine Rankings, Martin Klein, Olena Hunsicker, Michael Nelson

Computer Science Faculty Publications

We investigate the question whether expert rankings of real-world entities correlate with search engine (SE) rankings of corresponding web resources. We compare Billboards "Hot 100 Airplay" music charts with SE rankings of associated web resources. Out of nine comparisons we found two strong, two moderate, two weak and one negative correlation. The remaining two comparisons were inconclusive.

Evaluating Multicore Algorithms On The Unified Memory Model, John E. Savage, Mohammad Zubair

Computer Science Faculty Publications

One of the challenges to achieving good performance on multicore architectures is the effective utilization of the underlying memory hierarchy. While this is an issue for single-core architectures, it is a critical problem for multicore chips. In this paper, we formulate the unified multicore model (UMM) to help understand the fundamental limits on cache performance on these architectures. The UMM seamlessly handles different types of multiple-core processors with varying degrees of cache sharing at different levels. We demonstrate that our model can be used to study a variety of multicore architectures on a variety of applications. In particular, we use …