We have developed a computer security workshop designed to instruct post-secondary instructors who want to start a course or laboratory exercise sequence in computer security. This workshop has also been used to provide computer security education to IT professionals and students. It is effective in communicating basic computer security principles as well as an understanding of some of the significant tools and techniques in this area. Evaluations of the workshop have been very positive; we will offer the workshop locally, regionally, and nationally in the next year. The materials from this workshop are available at http://clics.cs.uwec.edu/workshopmaterials.htm.

Three examples using mixed language programming in Maple and C are provided for the express purpose of highlighting, in a practical way, various issues normally discussed in a traditional programming languages class only as theoretical concepts. The three examples highlight concepts in parameter passing techniques, storage order choices, native machine types and sizes, and the handling of single and multi-dimensional arrays when dealing with legacy code.

Because encapsulation is a difficult concept for students to implement correctly, we propose a set of seven software design rules to be used as an aid for teaching the appropriate design and use of encapsulation of object properties.

A first course in computer science that loosely follows the Computing Curricula 2001 report is described. This course blends theory and practice, highlights algorithm design, introduces a modest amount of imperative programming, and uses an Internet algorithmics theme to tie the topics together and keep the course both challenging and interesting to those with and without previous computing experience.

By exploiting a well known security vulnerability in many C library implementations, it is possible for an unprivileged user to gain unrestricted system privileges. With an understanding of how the process execution stack is allocated and managed during process execution, a user can override the return address of a C library routine and thereby resume execution at a different address where a set of malicious functions can be invoked [1]. This is known as the buffer overflow exploit. With buffer overflow as the underlying theme, an example will be described using C and the MIPS assembly language that simultaneously exposes students to issues in computer security, operating systems concepts such as memory management and function invocation/return, and the MIPS instruction set architecture.

A standard practice in object-oriented programming is to implement an operation, called equals in Java, for testing the equality of two objects. The equals method should be defined for every new Java class, but because of the intricacies of inheritance, casting, and dynamic typing, equals is often quite difficult to write correctly. And unfortunately many textbooks present flawed implementations of this operation. In this paper, we present a semantically correct technique for testing object equivalence, a technique that simultaneously brings together important mathematical foundations (equivalence relations), practical programming issues (inheritance, casting, dynamic typing), and sound software design (design patterns) in a natural and compelling way. While Java is used to demonstrate how the semantic flaws are corrected and the design improved using our techniques, the design is general enough that it will be clear how the same ideas could easily be extended to other languages such as C++.

This 90-minute panel session will discuss recent and future developments in incorporating Computational Science and Engineering into the undergraduate curriculum. There is a companion session devoted to tools and techniques and so the focus here is on programs and courses.The panelists will demonstrate a clear uniformity of purpose but a wide variety of approaches to increasing the CSE experience of undergraduates in different types of schools.The schools represented vary from large state universities to small private liberal arts colleges and a medium-sized school with a strong engineering bias.The approaches adopted also differ. There are complete programs built largely from existing courses, specific courses that are added to established programs to allow a student to follow an emphasis in CSE. The introduction of CSE into existing programs through faculty advice and education has also been successful.Yet other approaches represented among the panelists are the introduction of multi-disciplinary team-taught project-based courses as a springboard for growing an undergraduate CSE program including undergraduate research projects. The incremental use of small add-on courses to supplement conventional mathematics offerings with some CSE content has also been used successfully.Another approach represented on the panel is the use of a particular vehicle --- in this case graphics and visualization --- to introduce key ideas of CSE into regular parts of the curriculum.The unifying theme of the panel --- the desire to improve undergraduate CSE education will be evident throughout. By presenting a wide variety of approaches to achieve this end, it is hoped that any audience participants who wish to create a CSE thread in their own programs will find some ideas to help them. Some of the practical and political issues will also be discussed in the various contexts.The program for the panel would allow each panelist a maximum of 10 minutes to outline their programs and approaches. The remaining 30 (or more) minutes would then be reserved for general discussion and questions and contributions from the audience.

Inheritance is a central topic in most introductory object-oriented programming courses and frequently the most challenging for students to comprehend. The difficulties students experience often center around the rather complicated and obscure dynamic method invocation algorithms used in languages like C++ and Java. We present a visual model for teaching inheritance that captures the essential aspects of these algorithms yet is easy for students to comprehend and apply.

Here, we introduce a new approach to macromolecular docking which combines the continuous global optimization algorithm CGU [6, 21] with the grid-based conformational search engine DOT [23]. We also detail the use of this method to dock acetylcholine into the fasciculin-acetylcholinesterase complex. Fasciculin blocks access to the long, narrow pathway leading to the active site, which is located in the interior of the acetylcholinesterase. For this reason, finding the location computationally is rather non-trivial. We not only successfully identified the optimal docking configuration, but were able to do so in a matter of hours.

Proteins require specific three-dimensional conforma-tions to function properly. These “native ” conforma-tions result primarily from intramolecular interactions between the atoms in the macromolecule, and also

Earlier parallel computational results on constrained global optimization problems have shown that speedups greater than the number of processors can occur in practice. To show how this is possible, a relatively simple example of a multiple-cost-row linear program is presented in which the parallel algorithm gives a speedup, over its sequential version, greater than the number of processors. In addition, it is shown that for a particular problem instance (taken from another special class of multiple-cost-row linear programming problems), the average parallel speedup, taken over all orderings of the cost rows, can also be greater than the number of processors. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.