Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

2005

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 691 - 720 of 5573

Full-Text Articles in Physical Sciences and Mathematics

Cs 141: Computer Programming I, Ronald F. Taylor Oct 2005

Cs 141: Computer Programming I, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer programming.
Examples from and applications to a broad range of problems are given. No prior knowledge of programming is
assumed. The concepts covered will be applied to the Java programming language. Students must register for both
lecture and one laboratory section. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.


Cs 205: Computer Literacy And Office Automation, Ann Tirpack Oct 2005

Cs 205: Computer Literacy And Office Automation, Ann Tirpack

Computer Science & Engineering Syllabi

To understand basic computer operations and the principal components of a computer and connected peripheral devices. To understand and examine current operating systems, software utilities, device drivers and application software. To define and understand current storage technology and learn about logical file storage and
management.

To become proficient in using:
-Windows
-Word Processing Applications
-Spreadsheet Applications
-Database Applications
-Presentation Graphics Applications

To understand the basics of e-mail. To introduce networking concepts including the Internet and its components and web browser basics. To learn ways to protect your data and avoid computer disasters.


Cs 206: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog Oct 2005

Cs 206: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

By the end of this course, the students will have a greater depth of understanding in the areas of spreadsheets, databases, and presentation software using Microsoft Excel Access and PowerPoint.


Cs 205-07: Computer Literacy And Office Automation, John P. Herzog Oct 2005

Cs 205-07: Computer Literacy And Office Automation, John P. Herzog

Computer Science & Engineering Syllabi

Basic computer terminology, word processing, spreadsheets, databases, and graphics.


Cs 209: Computer Programming For Business Ii, Dennis Kellermeier Oct 2005

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 209 is the second of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming.


Cs 208: Computer Programming For Business I, Dennis Kellermeier Oct 2005

Cs 208: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 208 is the first of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming. This course assumes students have never written a program before.


Cs 240: Introduction To Computer Science I, Mateen M. Rizki Oct 2005

Cs 240: Introduction To Computer Science I, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.


Cs 240: Introduction To Computer Science I, L. Jane Lin Oct 2005

Cs 240: Introduction To Computer Science I, L. Jane Lin

Computer Science & Engineering Syllabi

This course is the first in the three course sequence "Introduction to Computer Science" offered by the
Computer Science department at WSU. This course presents a general introduction to C++ programming
language. It introduces the fundamental capabilities of C++ language as a problem solving tool. Topics include data representation, debugging and program verification.


Cs 242: Introduction To Computer Science Iii, Praveen Kakumanu Oct 2005

Cs 242: Introduction To Computer Science Iii, Praveen Kakumanu

Computer Science & Engineering Syllabi

This is the final course in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on building a number of abstract data types such as stacks, queues, trees and tables. We continue to study the C++ object-oriented concepts such as Inheritance, polymorphism and template handling. We also start learning to analyze the complexity of algorithms in this course.


Cs 340: Programming Language Workshop In Java, Ronald F. Taylor Oct 2005

Cs 340: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://java.sun.com or other software as approved by the instructor. There are no exams.


Cs 400/600: Data Structures And Software Design, Natsuhiko Futamura Oct 2005

Cs 400/600: Data Structures And Software Design, Natsuhiko Futamura

Computer Science & Engineering Syllabi

In this course, students will learn basic data structures and how to design and analyze software. Course covers introduction to the fundamentals of complexity and analysis and study of common problems and solutions using various data structures. After taking this course, students are expected to be able to design reasonable software for problems and estimate (evaluate) the performance of them even without writing the software.


Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp Oct 2005

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Computer Science & Engineering Syllabi

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. The Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.


Cs 409/609: Principles Of Artificial Intelligence, John C. Gallagher Oct 2005

Cs 409/609: Principles Of Artificial Intelligence, John C. Gallagher

Computer Science & Engineering Syllabi

Problem solving methods in artificial intelligence (AI) with emphasis on heuristic approaches. Topics include methods of representation, search, intelligent agents, planning, learning, natural language processing, logic, inference, robotics, and case-based reasoning. Three hours lecture, two hours lab.


Cs 415: Social Implications Of Computing, Leo Finkelstein Oct 2005

Cs 415: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions. The goal of this course is to blend social implications issues with common technical communication formats you'll need to be familiar with out in the "real world." To do this, the course is built around a research project on a social implications topic …


Cs 766: Evolutionary Computation, Mateen M. Rizki Oct 2005

Cs 766: Evolutionary Computation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course explores evolutionary computation from a historical, theoretical, and application viewpoint. An overview of the most common evolutionary search techniques are presented including genetic algorithms, evolutionary programming, evolutionary strategies, and genetic programming. The fundamental issues driving the choice of problem representation and specific genetic operators are discussed. Various applications of evolutionary computation to problems in control, optimization, and pattern recognition are examined.


Cs 466/666: Introduction To Formal Languages, Thomas Sudkamp Oct 2005

Cs 466/666: Introduction To Formal Languages, Thomas Sudkamp

Computer Science & Engineering Syllabi

CS 466/666 is an introduction to formal language and automata theory. In this course we will examine methods for defining the syntax of languages and recognizing patterns. The syntax of languages can be defined using grammars and patterns can be described by regular expressions and accepted by finite state machines. Along with presenting the fundamentals of these topics, the course will develop and investigate the relationships between language definition and pattern recognition.


Cs 480/680: Comparative Programming Languages, Michael L. Raymer Oct 2005

Cs 480/680: Comparative Programming Languages, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.


Cs/Mth 316/516: Numerical Methods For Digital Computers, Ronald F. Taylor Oct 2005

Cs/Mth 316/516: Numerical Methods For Digital Computers, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences. Methods of interpolation, data smoothing, functional approximation, numerical differentiation and integration. Solution techniques for linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications of interest to engineering, science, and applied mathematics students are an integral part of the course. Special topics presented as schedule permits.


Fall 2005, Nsu Oceanographic Center Oct 2005

Fall 2005, Nsu Oceanographic Center

Currents

No abstract provided.


Coarse-Grained Free-Energy-Functional Treatment Of Quasistatic Multiscale Processes In Heterogeneous Materials, H. Zhou, Ruqiang Feng, Dennis J. Diestler, Xiao Cheng Zeng Oct 2005

Coarse-Grained Free-Energy-Functional Treatment Of Quasistatic Multiscale Processes In Heterogeneous Materials, H. Zhou, Ruqiang Feng, Dennis J. Diestler, Xiao Cheng Zeng

Xiao Cheng Zeng Publications

A new treatment of quasistatic (reversible) multiscale processes in heterogeneous materials at nonzero temperature is presented. The system is coarse grained by means of a finite-element mesh. The coarse-grained free-energy functional (of the positions of the nodes of the mesh) appropriate to the thermodynamic-state variables controlled in the relevant process is minimized. Tests of the new procedure on a Lennard-Jonesium crystal yield thermomechanical properties in good agreement with the “exact” atomistic results.


The Industrial Platinum Cycle For Russia: A Case Study Of Materials Accounting, O. A. Babakina, T. E. Graedel Oct 2005

The Industrial Platinum Cycle For Russia: A Case Study Of Materials Accounting, O. A. Babakina, T. E. Graedel

Yale School of the Environment Publications Series

Platinum is a strategic resource for the world economy and appears to be unsubstitutable in many of its uses. As a consequence, establishing its life cycle and quantifying net increases and decreases may serve as a basis for detecting lifecycle wide opportunities for increasing recycling and reuse of platinum. With this aim, we have characterized the platinum cycle for the Russian Federation for the year 2000. It was found that most of the platinum produced in Russia was exported immediately(21,300 kg Pt/yr (82%)), while the remainder was stockpiled (2,200 kg Pt/yr (8.5%)) or used domestically (2,450 kg Pt/yr, (9.4%)). Russia …


Inventory And Analysis Of Yale University’S Greenhouse Gas Emissions, Marco Buttazzoni, Kathleen Campbell, Brandon Carter, Seth Dunn, Trish Eyler, Woonkwong Liew, Elizabeth Martin, Nalin Sahni, Kate Zyla Oct 2005

Inventory And Analysis Of Yale University’S Greenhouse Gas Emissions, Marco Buttazzoni, Kathleen Campbell, Brandon Carter, Seth Dunn, Trish Eyler, Woonkwong Liew, Elizabeth Martin, Nalin Sahni, Kate Zyla

Yale School of the Environment Publications Series

No abstract provided.


Remarks On Risk-Sensitive Control Problems, José Luis Menaldi, Maurice Robin Oct 2005

Remarks On Risk-Sensitive Control Problems, José Luis Menaldi, Maurice Robin

Mathematics Faculty Research Publications

The main purpose of this paper is to investigate the asymptotic behavior of the discounted risk-sensitive control problem for periodic diffusion processes when the discount factor α goes to zero. If uα(θ, x) denotes the optimal cost function, being the risk factor, then it is shown that limα→0αuα(θ, x) = ξ(θ) where ξ(θ) is the average on ]0, θ[ of the optimal cost of the (usual) in nite horizon risk-sensitive control problem.


Chemistry & Biochemistry Newsletter, Department Of Chemistry & Biochemistry, South Dakota State University Oct 2005

Chemistry & Biochemistry Newsletter, Department Of Chemistry & Biochemistry, South Dakota State University

Chemistry & Biochemistry Newsletter: 2002-2015

Inside:

Page 2 2010 Research Center Wins Big in Business Competition

Page 3 New Grad Students; Julee Driver to attend ACS Summer School on Green Chemistry

Page 4 New Staff; Foundation Donors

Page 5 Alumni News

Page 6 New Faculty Publications; Faculty Patents; Undergraduate Publications


An Iterated Pseudospectral Method For Functional Partial Differential Equations, J. Mead, B. Zubik-Kowal Oct 2005

An Iterated Pseudospectral Method For Functional Partial Differential Equations, J. Mead, B. Zubik-Kowal

Mathematics Faculty Publications and Presentations

Chebyshev pseudospectral spatial discretization preconditioned by the Kosloff and Tal-Ezer transformation [10] is applied to hyperbolic and parabolic functional equations. A Jacobi waveform relaxation method is then applied to the resulting semi-discrete functional systems, and the result is a simple system of ordinary differential equations d/dtUk+1(t) = MαUk+1(t)+f(t,U kt). Here Mα is a diagonal matrix, k is the index of waveform relaxation iterations, U kt is a functional argument computed from the previous iterate and the function f …


Is The Number Of Sick Persons In A Cohort Constant Over Time?, Paula Diehr, Ann Derleth, Anne Newman, Liming Cai Oct 2005

Is The Number Of Sick Persons In A Cohort Constant Over Time?, Paula Diehr, Ann Derleth, Anne Newman, Liming Cai

UW Biostatistics Working Paper Series

Objectives: To estimate the number of persons in a cohort who are sick, over time.

Methods: We calculated the number of sick persons in the Cardiovascular Health Study (CHS), a cohort study of older adults followed up to 14 years, using eight definitions of “healthy” and “sick”. We projected the number in each health state over time for a birth cohort.

Results: The number of sick persons in CHS was approximately constant for 14 years, for all definitions of “sick”. The estimated number of sick persons in the birth cohort was approximately constant from ages 55-75, after which it decreased. …


A Fast Three-Step Phase-Shifting Algorithm, Peisen S. Huang, Song Zhang Oct 2005

A Fast Three-Step Phase-Shifting Algorithm, Peisen S. Huang, Song Zhang

Song Zhang

We propose a new three-step phase-shifting algorithm, which is much faster than the traditional three-step algorithm. We achieve the speed advantage by using a simple intensity ratio function to replace the arctangent function in the traditional algorithm. The phase error caused by this new algorithm is compensated for by use of a look-up-table (LUT). Our experimental results show that both the new algorithm and the traditional algorithm generate similar results, but the new algorithm is 3.4 times faster. By implementing this new algorithm in a high-resolution, real-time 3D shape measurement system, we were able to achieve a measurement speed of …


3-D Optical Measurement Using Phase Shifting Based Methods, Peisen S. Huang, Song Zhang Oct 2005

3-D Optical Measurement Using Phase Shifting Based Methods, Peisen S. Huang, Song Zhang

Song Zhang

We review some of our most recent works on 3-D shape measurement using the digital fringe projection and phase-shifting method. First, we introduce the measurement principle and phase-shifting algorithms. Then we discuss an effective method for phase error compensation and a novel idea for system calibration. Finally, we describe a 3-D shape measurement system for high-resolution, real-time 3-D shape acquisition, reconstruction and display.


Alaska Aquatic Plant Survey Report 2005, Mary Pfauth, Mark Sytsma Oct 2005

Alaska Aquatic Plant Survey Report 2005, Mary Pfauth, Mark Sytsma

Center for Lakes and Reservoirs Publications and Presentations

Invasive, non-indigenous plants can degrade water quality and fish habitat when they invade lakes, ponds, and streams. Changes in plant community architecture in lakes due to invasion by canopy-forming invasive aquatic plants can result in loss of native plant biodiversity and reduction of the structural complexity of the underwater habitat.


The Igipi Ontological Framework: Integrating Gene Interactions With Protein Interactions, Bill Andreopoulos, Aijun An, Xiangji Huang Oct 2005

The Igipi Ontological Framework: Integrating Gene Interactions With Protein Interactions, Bill Andreopoulos, Aijun An, Xiangji Huang

Faculty Publications, Computer Science

No abstract provided.