Explores how women voice themselves and their concerns through theatre/performance. Students will read texts and see performances by and about women and will examine them within their sociopolitical/historical contexts.
This course would be a guided tour of moduli spaces that have played a central role in topology, differential geometry, and representation theory. The emphasis will be on explicit examples rather than theory.
This the second semester of a 2-semester, year long, class on probabilistic artificial intelligence. The main emphasis of the course is on building and understanding the mathematical tools and conceptual foundations of AI, especially from a probabilistic point of view. Furthermore, group projects of the students will serve to explore applications and implementations.
The goal of any manufacturing enterprise should be to obtain safe, dependable, satisfactory, and economical production within the operating constraints of the process. Students will gain foundational knowledge of industrial control systems focused on manufacturing automation. The course will concentrate on the selection and application of commercial sensors, actuators, and controllers to meet the needs of an individual process, or an enterprise-wide operation.
We often mean more than we say and pragmatics is the field concerned with how we come to understand what speakers really mean. This class provides an introduction to the main topics in Pragmatics within Linguistics. Amongst other topics, we will explore presuppositions, implicatures, speech acts and information structure. In short, we will be concerned with the study of the meaning of natural language utterances in context as well as with how context enriches meaning.
The course introduces and develops methods for designing and implementing abstract data types using the Java programming language. The main focus is on how to implement abstract data collections and their associated operations. Specific implementations include linked structures, recursive structures, binary trees, balanced trees, and hash tables. Algorithm analysis and asymptotic bounding of implementations is a major topic throughout the course. The topics covered in this course are fundamental to programming and are essential to further computer science courses.