Index Catalog // ScholarsArchive@OSU

An Analysis of the Coexistence of Three Competing Species with a Shared Pathogen

Creator:: Bokil, Vrushali A. and Leung, Margaret-Rose
Abstract:: We consider an SI model of three competing species that are all affected by a single pathogen which is transmitted directly via mass action. The total population sizes of the three species satisfy a three-dimensional Lotka-Volterra competition model. We address the interaction between competition and disease dynamics, and show that...
Resource Type:: Technical Report
Full Text:: Pathogen M.-R. Leung∗ and V. A. Bokil† Department of Mathematics Oregon State University Corvallis, OR

Coexistence of Competing Species with a Directly Transmitted Pathogen

Creator:: Bokil, V. A. and Manore, C. A.
Abstract:: In this paper we consider models of two competing species that are both affected by a pathogen which is transmitted directly. We consider both mass action as well as frequency incidence models of disease spread, and Lotka-Volterra competition. Our aim is to address the interaction between competition and disease dynamics....
Resource Type:: Technical Report
Full Text:: Pathogen V. A. Bokil∗ and C. A. Manore† Department of Mathematics Oregon State University Corvallis, OR

Quantum Interchange Walk as a Unifying Approach

Creator:: Dimcovic, Zlatko and Kovchegov, Yevgeniy
Abstract:: We construct a quantum interchange walk, related to classical walks with memory. This gives us a coinless discrete walk, while the origin in classical walks with memory offers the promise of use of existing tools from classical memoried walks. This approach readily reproduces all standard approaches. We briefly discuss its...
Resource Type:: Technical Report
Full Text:: Zlatko Dimcovic1 and Yevgeniy Kovchegov2 1 Department of Physics, Oregon State University, Corvallis OR

Quantum Random Walk via Classical Random Walk With Internal States

Creator:: Burton, Robert M., Jr., Kovchegov, Yevgeniy, and Nguyen, Thinh
Abstract:: In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role...
Resource Type:: Technical Report
Full Text:: Department of Mathematics, Oregon State University, Corvallis, OR 97331-4605, USA 2 Department of Electrical

Russo's formula for Lorentz Lattice Gas Model

Creator:: Kovchegov, Yevgeniy
Abstract:: We use a combinatorial approach to study the trajectory of a light ray constrained to Euclidian plane R^2 with random reflecting obstacles placed throughout R^2. For the 2D Lorentz lattice gas (LLG) model we derive an analogue of Russo's formula of increasing events in percolation.
Resource Type:: Technical Report
Full Text:: p > 0. We refer the reader to ∗Department of Mathematics, Oregon State University, Corvallis, OR

High-Order Staggered Finite Difference Methods for Maxwell's Equations in Dispersive Media

Creator:: Bokil, Vrushali A. and Gibson, Nathan L.
Abstract:: We study the stability properties of, and the phase error present in, several higher order (in space) staggered finite difference schemes for Maxwell's equations coupled with a Debye or Lorentz polarization model. We present a novel expansion of the symbol of finite difference approximations, of arbitrary (even) order, of the...
Resource Type:: Technical Report
Full Text:: Equations in Dispersive Media V. A. Bokil∗ and N. L. Gibson† Department of Mathematics Oregon State

A benchmark suite for parallel computers : part II

Creator:: Shen, Jisheng and Lewis, Ted G.
Resource Type:: Technical Report
Full Text:: Computers Part II Jisheng Shen Ted Lewis Department of Computer Science Oregon State University

Two notes on the complexity of the Towers of Hanoi. I. Is Towers of Hanoi really hard? II. Time complexity of the Towers of Hanoi problem

Creator:: Cull, Paul and Gerety, Colin
Resource Type:: Technical Report
Full Text:: Department of Computer Science Oregon State University Corvallis, Oregon 97331 F C'" ~,7~U72R SCIENCE

From concrete forms to generalized abstractions through perspective-oriented analysis of logical relationships

Creator:: Yang, Sherry and Burnett, Margaret M.
Abstract:: We believe concreteness, direct manipulation and responsiveness in a visual programming language increase its usefulness. However, these characteristics present a challenge in generalizing programs for reuse, especially when concrete examples are used as one way of achieving concreteness. In this paper, we present a technique to solve this problem by...
Resource Type:: Technical Report
Full Text:: ' Oregon State University Department of Computer Science Corvallis, OR 97331 l l n n fl n l

VIGRAM : a program understanding and complexity metric analysis tool for Pascal programs

Creator:: Kruatrachue, Kritawan
Abstract:: This report describes "VIGRAM" (Visual Programming) which is a program understanding and complexity metric analysis tool for Pascal programs. VIGRAM is implemented on the Macintosh as one part of the "O.S.U." (Qregon Speedcode Universe) project. With VIGRAM, the source code of a Pascal procedure can be displayed as a visual...
Resource Type:: Capstone Project
Full Text:: Department of Computer Sci~nce Oregon State University Corvallis, Oregon 9733-1 .. VIGRAl\1 JZL

ScholarsArchive@OSU

An Analysis of the Coexistence of Three Competing Species with a Shared Pathogen

Coexistence of Competing Species with a Directly Transmitted Pathogen

Quantum Interchange Walk as a Unifying Approach

Quantum Random Walk via Classical Random Walk With Internal States

Russo's formula for Lorentz Lattice Gas Model

High-Order Staggered Finite Difference Methods for Maxwell's Equations in Dispersive Media

A benchmark suite for parallel computers : part II

Two notes on the complexity of the Towers of Hanoi. I. Is Towers of Hanoi really hard? II. Time complexity of the Towers of Hanoi problem

From concrete forms to generalized abstractions through perspective-oriented analysis of logical relationships

VIGRAM : a program understanding and complexity metric analysis tool for Pascal programs

Limit your search

Academic Affiliation

Advisor

Commencement Year

Committee Member

Conference Name

Creator

Contributor

Date

Decade

Degree Field

Degree Level

Degree Name

File Format

Funding Body

Language

License

Non-Academic Affiliation

Peer Reviewed

Resource Type

Rights Statement

Subject

Search Constraints

Search Results

Limit your search