Physical Sciences and Mathematics Commons^™

Addressing The Gaps—Promise And Performance, Synthesis And Purity, Large-N And Small-N: A Response To Moore, Todd Landman

Human Rights & Human Welfare

A response to:

Moore, W. (2006). Synthesis v. purity and large-N studies: How might we assess the gap between promise and performance? Human Rights, Human Welfare, 6(1).

Synthesis V. Purity And Large-N Studies: How Might We Assess The Gap Between Promise And Performance?, Will H. Moore

Human Rights & Human Welfare

A review of:

Protecting Human Rights: A Comparative Study by Todd Landman. Washington, DC: Georgetown University Press, 2005, 231 pp.

Cs 790-01: Introduction To Parallel Algorithms, Natsuhiko Futamura

Computer Science & Engineering Syllabi

Low-cost parallel computers such as PC clusters are becoming available, and many previously unsolvable problems can be solved using such computers. However, designing algorithms that perform well on parallel computers is often challenging. The focus of this course is on learning how to design algorithms for parallel computers and how to evaluate them.

Quantal Density Functional Theory: Wave Function Arbitrariness Of The Noninteracting Fermion Model, Viraht Sahni, Marlina Slamet

Physics Faculty Publications

In quantal density functional theory (Q-DFT), the mapping from either a ground or excited state of the interacting system to one of noninteracting fermions with equivalent density is such that the state of the latter model S system is arbitrary. Thus, in principle, there are an infinite number of local (multiplicative) effective potential energy functions that can reproduce the density of the interacting system. In the present work, we note that there is also an arbitrariness in the wave function of the model fermions when the S system is constructed in an excited state. Different wave functions lead to the …

Algebraic Characterizations Of Graph Imbeddability In Surfaces And Pseudosurfaces, Lowell Abrams, Dan Slilaty

Mathematics and Statistics Faculty Publications

Given a finite connected graph G and specifications for a closed, connected pseudosurface, we characterize when G can be imbedded in a closed, connected pseudosurface with the given specifications. The specifications for the pseudosurface are: the number of face-connected components, the number of pinches, the number of crosscaps and handles, and the dimension of the first Z2-homology group. The characterizations are formulated in terms of the existence of a dual graph G ∗ on the same set of edges as G which satisfies algebraic conditions inspired by homology groups and their intersection products.

Bias Matroids With Unique Graphical Representations, Dan Slilaty

Mathematics and Statistics Faculty Publications

Given a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one of which is a loop, we describe how the bias matroid of Ω is uniquely represented by Ω.

Electrical Properties Of Unintentionally Doped Semi-Insulating And Conducting 6h-Sic, William C. Mitchel, W. D. Mitchell, Z. Q. Fang, S. R. Smith, Helen Smith, Igor Khlebnikov, Y. I. Khlebnikov, C. Basceri, C. Balkas

Mathematics and Statistics Faculty Publications

Temperature dependent Hall effect (TDH), low temperature photoluminescence (LTPL), secondary ion mass spectrometry (SIMS), optical admittance spectroscopy (OAS), and thermally stimulated current (TSC) measurements have been made on 6H-SiC grown by the physical vapor transport technique without intentional doping. n- and p-type as well semi-insulating samples were studied to explore the compensation mechanism in semi-insulating high purity SiC. Nitrogen and boron were found from TDH and SIMS measurements to be the dominant impurities that must be compensated to produce semi-insulating properties. The electrical activation energy of the semi-insulating sample determined from the dependence of the resistivity …

On Adaptive Testing In Orthogonal Saturated Designs, Daniel T. Voss, Weizhen Wang

Mathematics and Statistics Faculty Publications

Adaptive, size-a step-down tests are provided for the analysis of orthogonal saturated designs. The tests work effectively under effect sparsity, and include as special cases the individual nonadaptive tests of Berk and Picard (1991) and the simultaneous nonadaptive tests of Voss (1988). The approach is similar to that used by Wang and Voss (2003) to construct adaptive confidence intervals, but testing is simpler because one can use the same denominator for all statistics. Step-down tests also have a clear power advantage over simultaneous confidence intervals and analogous single-step tests, as is demonstrated theoretically and assessed via simulation.

Cs 141-01: Computer Programming - I, Michael Ondrasek

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 208-01: 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-01: 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 214-01: Visual Basic.Net, Roddy Keish

Computer Science & Engineering Syllabi

No abstract provided.

Cs 241-01: Introduction To Computer Science Ii, Praveen Kakumanu

Computer Science & Engineering Syllabi

This course is the second in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on tools for building abstract data types (using structure and class concepts in C++) and Object-Oriented Programming. We also begin the study of data structures in this course.

Cs 241-01: Computer Science Ii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Cs 242-01: Introduction To Computer Science Iii, Eric Maston

Computer Science & Engineering Syllabi

This is the third and final course in the Introduction to Computer Science series. This course focuses on data structures with abstract data types, such as trees, stacks, queues, and tables.

Cs 340-01: 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. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and general discussion of the programming assignments. Do not expect support in debugging badly documented code.

Cs 302-01: Client Server Databases, Karen Meyer

Computer Science & Engineering Syllabi

No abstract provided.

Cs 340-01: Programming Language Workshop In C#, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in C#. You are expected to learn the language and solve a set of programming problems assigned to you using MS Visual Studio.Net. There are no exams. We officially meet only once in the quarter. However, I will be available in the posted office hours for clarifications and discussions about the programming problems.

Cs 400/600-01: Data Structures And Software Design, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Cs 701-01: Database Systems And Design, Kenneth Melendez

Computer Science & Engineering Syllabi

No abstract provided.

Cs 740-01: Algorithms, Complexity And The Theory Of Computability, Thomas Sudkamp

Computer Science & Engineering Syllabi

No abstract provided.

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

Computer Science & Engineering Syllabi

No abstract provided.

Cs 790-01: Multimedia Coding And Communication (I), Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.

Cs 765-01: Foundations Of Neurocomputation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course is designed to help you develop a solid understanding of neural network algorithms and architectures. At the end of this course you should be able to read and critically evaluate most neural network papers published in major journals, (e.g. IEEE Transaction on Neural Networks, Neural Networks, and Neural Computation). In addition, you should be able to implement a broad range of network architectures and learning algorithms for a variety of applications.

Cs 884-01: Advanced Topics In Programming Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

The primary focus of this course is the design and specification of the Object-Oriented language Java.

Cs 317-01: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences. Methods for solving matrix eigenvalue problems, initial value and boundary value problem for ordinary differential equations (ODEs). Study of standard types of partial differential equations (PDEs) with applications. Solution techniques for systems of nonlinear equations. Discussion of courses of errors in numerical methods. Special topics and applications presented as schedule permits. 4 credit hours. Prerequisites: CS 316, MTH 233, 253, or 355. Programming course prerequisites: EGR 153 or CEG 220 or CS 241.

Ceg 402/602-01: Introduction To Computer Communication, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 333: Introduction To Unix, Todd Rovito

Computer Science & Engineering Syllabi

Introduction to the use of UNIX and UNIX tools as a problem-solving environment. Emphasis on the shell, files and directories, editing files, user process management, compiling, and debugging. Prerequisite: CS 241.

Ceg 434/634-01: Concurrent Software Design, Natsuhiko Futamura

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 460/660-01: Introduction To Software Computer Engineering, Robert J. Weber

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large programs. Some of the required basic concepts necessarily have to be developed using small programs as examples. To this extent, we also study programming-in-the-small. The overall objectives are to present an overview of issues in the development of software, to discuss terminology, to illustrate via example case studies, and to give sufficiently detailed advice on how to develop quality software. Hands-on experience is emphasized through the use of homework and a class project.