Seminar exploring cultural, linguistic, and social aspects of life as an exchange student in Japan. Topics include history of local and national cultural contact with Japan, the Japanese education system, and situating study abroad in larger context (undergraduate & beyond). Emphasis on developing independent research skills and an individual study abroad plan.

Examination of various Japanese performance aspects: literary texts on stage, architecture of traditional and modern theaters, gendered acting, social backgrounds of actors and audiences, music and dance. We'll read plays, a history of Japanese theater, and an anthropological study of gendered acting. We'll see films based on plays, and educational videos. Field trips to Japanese performing arts on stage. (Gen. Ed. AL, DG)

This is a stand-alone independent study designed by the student and faculty sponsor that involves frequent interaction between instructor and student. Qualitative and quantitative enrichment must be evident on the proposed contract before consent is given to undertake the study.

Not available at this time

Fundamentals of quantum information systems, including quantum computation, quantum cryptography, and quantum information theory. Topics include: quantum circuit model, qubits, unitary operators, measurement, entanglement, quantum algorithms for factoring and search, quantum key distribution, error-correction and fault-tolerance, information capacity of quantum channels, complexity of quantum computation.

Basic and advanced techniques for text-based information systems, including retrieval models, indexing and text representation, browsing and query formulation, data-intensive computing approaches, evaluation, and issues surrounding implementation. The course will include a substantial project such as implementation of major elements of search engines and applications.

The design and analysis of efficient algorithms for important computational problems. Paradigms for algorithm design including Divide and Conquer, Greedy Algorithms, Dynamic Programming; and, the use of Randomness in Algorithms. Algorithms for Sorting and Searching, Graph Algorithms, Matroid, Linear Programming, Proving NP completeness, Approximation Algorithms for NP Complete Problems, and others. Prerequisites: The mathematical maturity expected of incoming Computer Science graduate students, knowledge of algorithms at the level of COMPSCI 311.

Basic problems in the translation of programming languages focusing on theory and common implementation techniques for compiling traditional (Pascal-like) programming languages to produce assembly or object code for typical machines. Involves a substantial laboratory project in which the student constructs a working compiler for a considerable subset of a realistic programming language within a provided skeleton.

Basic problems in the translation of programming languages focusing on theory and common implementation techniques for compiling traditional (Pascal-like) programming languages to produce assembly or object code for typical machines. Involves a substantial laboratory project in which the student constructs a working compiler for a considerable subset of a realistic programming language within a provided skeleton.

This course introduces concepts, practices, and tools for conducting effective research. You will learn how to read technical papers, interpret published research, assess the research frontier, select research topics, devise research questions and hypotheses, propose and plan research activities, analyze experimental results, and report those results.