Genevieve B. Orr

Genevieve B. Orr
Willamette University · Department of Computer Science

About

51
Publications
12,850
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
2,583
Citations

Publications

Publications (51)
Conference Paper
The field of micrometeorology is primarily concerned with smaller-scale meteorological phenomena, specifically those which occur within the lowest atmospheric layer called the Atmospheric Boundary Layer (ABL). The primary defining characteristic of the ABL is that wind dynamics within this layer are influenced by the Earth's topography, as well as...
Chapter
There are those who argue that developing fast algorithms is no longer necessary because computers have become so fast. However, we believe that the complexity of our algorithms and the size of our problems will always expand to consume all cycles available, regardless of the speed of ourmachines.Thus, there will never come a time when computationa...
Chapter
In the last section we focus on tricks related to time series analysis and economic forecasting. In chapter 16, John Moody opens with a survey of the challenges of macroeconomic forecasting including problems such as noise, nonstationarities, nonlinearities, and the lack of good a priori models. Lest one be discouraged, descriptions of many possibl...
Book
The twenty last years have been marked by an increase in available data and computing power. In parallel to this trend, the focus of neural network research and the practice of training neural networks has undergone a number of important changes, for example, use of deep learning machines. The second edition of the book augments the first edition w...
Article
This paper describes the use of algorithmic art as a context for teaching programming and computational thinking. We show how students can learn to apply mathematics and computer programming to create algorithmic art, and we record changes in their understanding and attitudinal responses toward computer science. The power of this approach lies in t...
Article
3D Stereoscopy is a rich and fun interdisciplinary context for engaging students across campus. Students can practice programming and also experience how computing can be used as a tool for exploration and analysis of scientific (or other) questions.
Article
Full-text available
The Khronos Group recently released two major updates to the OpenGL specification, versions 3.3 and 4.0, containing many exciting new features that offer greater speed, flexibility, and a much greater range of graphics capabilities. However, a number of standard long-time features, such as glBegin/glEnd and the fixed pipeline, are scheduled to go a...
Conference Paper
The NSF-funded Northwest Distributed Computer Science Department (NW-DCSD) project brings together 24 multi-disciplinary faculty from 19 diverse colleges and universities in an effort to change the face of computing in the Pacific Northwest region of the United States. We offer an innovative and inclusive vision of computing in the 21st century and...
Article
The goal of this workshop is to learn about a fun and educational courses that are designed to expose non-traditional computer students to computing through the field of art. The workshop will cover the following topics: • Mental Models that beginning programming students have about programming. • Using Scratch as an introduction into programming c...
Article
Digital terrain modeling is an important area of study in computer graphics due to its growing use in scientific visualization and gaming. It encompasses the processing and storage of data, the analysis and extraction of information, and the visualization and integration of multiple information domains (elevation, geographic, symbolic). The primary...
Conference Paper
General education students can be taught computational thinking skills through courses that marry computer programming with algorithmic art. Algorithmic art is a varied and growing field where images are generated on the computer using mathematical and computer algorithms (see http://processing.org/exhibition/index.html for examples). Visually orie...
Article
Full-text available
In this paper, we describe the Northwest Distributed Computer Science Department, a project intended to bring together faculty from across the region to share resources and skills and thereby improve computing education. This position paper presents the motivation, goals, and current direction of the project.
Article
In this workshop participants will design a cross-campus collaborative project built around an airport (or other transit) simulation. Computer scientists and software engineers create simulations both to understand how processes work, and to avoid catastrophes in the actual implementations of those processes. At the last CCSC-NW, an airport simulat...
Article
In liberal arts institutions and in other small colleges, the traditional computer graphics course is commonly offered as an upper division elective. Often, these schools do not have the resources to offer additional follow up courses within the field of CG. As a result, the computer graphics course is the first and only exposure to the field that...
Article
Workshop participants will design a small, simple cross-campus collaborative pilot project. Those who are interested will carry out the project in the subsequent year. The project would be chosen by the participants; it might involve solving a small research question or building a simple game. The primary goal would be to discover successful collab...
Article
As computer science enrollments drop and interest in computer game rises, schools are introducing courses in game development at all levels in the curriculum as a way to attract and motivate students. By keeping the games simple, or by using existing game engines, one can offer courses to an audience with limited computer science skills. Game cours...
Article
In late 2005 and early 2006, the Computer and Information Systems and Engineering (CISE) Division of the National Science Foundation (NSF) convened four regional workshops, each with about 30 leaders in computing and computing education to "take a 5--10 year view" of the field, considering universal influences such as decreasing enrollments, USA wo...
Article
Computer science educators struggle constantly to find new and engaging examples to illustrate necessarily abstract concepts. A balance must be struck between examples that are too simple (and therefore fail to provide a realistic challenge) and examples that are too complex (where the bulk of students' time is spent on understanding the example)....
Article
This tutorial leads participants through the steps students must follow to produce a 1--2 minute 3D animated short in one semester. Commercially available animation software (e.g. Maya) is used and it is assumed that the students begin the course with no previous experience in either animation or computer science. Such a goal is ambitious; it requi...
Article
Computer Graphics is evolving as a discipline characterized by the fusion of artistic and technical theories and skills. The goal of the SIGGRAPH Curriculum Working Group has been to create a knowledge base that defines this discipline. This knowledge base is presented as a palette of subject areas and skills that forms the necessary educational fr...
Article
There is growing consensus that multimedia authoring should be an important component of a liberal arts curriculum because it represents a new and growing form of literacy. Unfortunately, it can be daunting to teach given the extensive interdisciplinary expertise required. Our solution has been to develop a new model of collaborative teaching that...
Article
How do we get students to think less about the mechanics of multimedia software and more about the medium's creative potential for telling a story? One way is through collaboration with students in different but synergistic disciplines. This paper presents a new model for interdisciplinary collaborative teaching which provides a more flexible alter...
Article
We describe and advocate an approach to student program grading based on interactive program demonstration. Although one-on-one interaction is a hallmark of good teaching in many disciplines, the pressure of class loads and the availability of sophisticated automatic tools have steered some instructors away from close interaction with students in c...
Article
In this paper we describe a computer graphics course that teaches students fundamental principles of computer science as well as how to use the computer as an artistic medium. The goal of the course is to have students from two very different disciplines work together, pooling their individual talents to create computer-generated works of art. Such...
Article
Java3D is a top-down approach for building 3D interactive programs which run in a web browser or as stand-alone applications. Built on top of the Java programming language, it uses a scene graph hierarchy as the basic structure. Various geometrical representations, animation/interaction, lighting, texture, collision detection, and sound are support...
Article
Full-text available
. The convergence of back-propagation learning is analyzed so as to explain common phenomenon observed by practitioners. Many undesirable behaviors of backprop can be avoided with tricks that are rarely exposed in serious technical publications. This paper gives some of those tricks, and offers explanations of why they work. Many authors have sugge...
Article
Full-text available
The levels and gamma decay in168Er have been investigated following thermal neutron capture on enriched targets of 167Er2O3. Precision measurements of the gamma spectrum with curved-crystal spectrometers revealed over 700 transitions up to an energy of 2.5 MeV, with intensities spanning five orders of magnitude. A list of primary gamma transitions...
Article
The 107Ag(n, gamma )108Ag reaction has been studied using a variety of techniques: (i) thermal neutron capture-primary gamma rays measured with a pencil-shaped Ge(Li) detector; 45-1200 keV gamma rays measured with a bent-crystal spectrometer; 10-80 keV gamma rays measured with a Si(Li) detector; conversion electrons measured with a magnetic spectro...
Conference Paper
The convergence of back-propagation learning is analyzed so as to explain common phenomenon observed by practitioners. Many undesirable behaviors of backprop can be avoided with tricks that are rarely exposed in serious technical publications. This paper gives some of those tricks, and offers explanations of why they work. Many authors have suggest...
Chapter
The convergence of back-propagation learning is analyzed so as to explain common phenomenon observedb y practitioners. Many undesirable behaviors of backprop can be avoided with tricks that are rarely exposedin serious technical publications. This paper gives some of those tricks, ando.ers explanations of why they work. Many authors have suggested...
Technical Report
The convergence of back-propagation learning is analyzed so as to explain common phenomenon observedb y practitioners. Many undesirable behaviors of backprop can be avoided with tricks that are rarely exposedin serious technical publications. This paper gives some of those tricks, ando.ers explanations of why they work. Many authors have suggested...
Book
It is our belief that researchers and practitioners acquire, through experience and word-of-mouth, techniques and heuristics that help them successfully apply neural networks to di cult real world problems. Often these \tricks" are theo- tically well motivated. Sometimes they are the result of trial and error. However, their most common link is tha...
Conference Paper
Good tricks for regularization are extremely important for improving the generalization ability of neural networks. The first and most commonly used trick is early stopping, which was originally described in [11]. In its simplest version, the trick is as follows: Take an independent validation set, e.g. take out a part of the training set, and moni...
Conference Paper
This section contains 5 chapters presenting easy to implement tricks which modify either the architecture and/or the learning algorithm so as to enhance the network’s modeling ability. Better modeling means better solutions in less time.
Conference Paper
The present section focuses on tricks for four important aspects in learning: (1) incorporation of prior knowledge, (2) choice of representation for the learning task, (3) unequal class prior distributions, and finally (4) large network training.
Conference Paper
Stochastic (on-line) learning can be faster than batch learning. However, at late times, the learning rate must be annealed to remove the noise present in the stochastic weight updates. In this annealing phase, the convergence rate (in mean square) is at best proportional to 1/τ where τ is the number of input presentations. An alternative is to inc...
Article
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0 =t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms provides an easy path to results on mean squared weight error and asymptotic normality. We apply this approach to stochastic gradient algorithms with momentum. We show th...
Conference Paper
The authors extend the theory of search dynamics for stochastic learning algorithms, address the time evolution of the weight-space probability density and the distribution of convergence times, with particular attention given to escape from local optima, and develop a theoretical framework that describes the evolution of the weight-space probabili...
Chapter
The γ rays from neutron capture in the 0− resonance of 107Ag at 16.3 eV have been studied. Thirteen primary transitions populate spin 1 levels in 108Ag below an energy of 1.5 MeV. Transitions from low-lying levels change in intensity by as much as a factor of 2 between thermal neutron capture (largely spin 1) and the 0- resonance, indicating a stro...
Article
This paper uses the dynamics of weight space probabilities [3, 4] to address stochastic gradient algorithms with learning rate annealing and momentum. This theoretical framework provides a simple, unified treatment of asymptotic convergence rates and asymptotic normality. The results for algorithms without momentum have been previously discussed in...
Article
In stochastic learning, weights are random variables whose time evolution is governed by a Markov process. At each time-step, n, the weights can be described by a probability density function P (!; n). We summarize the theory of the time evolution of P , and give graphical examples of the time evolution that contrast the behavior of stochastic lear...
Article
We present an algorithm for fast stochastic gradient descent that uses a nonlinear adaptive momentum scheme to optimize the late time convergence rate. The algorithm makes effective use of curvature information, requires only O(n) storage and computation, and delivers convergence rates close to the theoretical optimum. We demonstrate the technique...
Article
The ..gamma.. rays from neutron capture in the 0- resonance of ¹°⁷Ag at 16.3 eV were studied. Thirteen primary transitions populate spin 1 levels in ¹°⁸Ag below an energy of 1.5 MeV. Transitions from low lying levels change in intensity by as much as a factor of 2 between thermal neutron capture (largely spin 1) and the 0- resonance, indica...
Article
Ph.D. Computer Science and Engineering In this thesis we develop a mathematical formulation for the learning dynamics of stochastic or on-line learning algorithms in neural networks. We use this formulation to 1) model the time evolution of the weight space densities during learning, 2) predict convergence regimes with and without momentum, and 3)...

Network

Cited By

Projects

Project (1)
Project
With a focus on the role of complex topography, research and development of visualization types, techniques and tools to help scientists better understand and explain the ecological processes they study.