CS 598

Fall 2011 All Classes

All Classes

Credit: 2 TO 4 hours.

Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites.

May be repeated in the same or separate terms if topics vary.

CS 598 class schedule data for fall 2011
CRN Type Section Time Day Location Instructor Section Details
58261
Lecture-Discussion
ACK
10:00AM -11:50AM
W
508 Psychology Building
Kirlik, A
Part of Term:
1
Date Range:
08/22/11-12/07/11
Credit:
4 hours
Section Info:
Topic: Proseminar in Human Factors. The purpose of the seminar is to present the student with an understanding of the methodology, content, and research process in human factors. One aspect focuses on the current content of human factors research with an emphasis on faculty research on this campus. The second aspect examines the process of human factors research, addressing the particular issues in experimental design, data analysis, write up, and presentation that are relatively unique to applied psychological research. Prior background in human factors is neither a requirement, nor even expected. It is however important that the student be interested in the applications of psychological theory to applied problems, especially to problems in human-computer interaction and human interaction with technology more generally. This section meets with PSYC 593 ACK, 38128.
Restriction(s):
Restricted to Graduate - Urbana-Champaign.
35989
Lecture-Discussion
CXZ
2:00PM -3:15PM
TR
1131 Siebel Center for Comp Sci
Zhai, C
Part of Term:
1
Date Range:
08/22/11-12/07/11
Credit:
4 hours
Section Info:
Topic: Advanced Topics in Information Retrieval. Advanced concepts, models, and algorithms in information retrieval and major recent developments in the field, including historical milestones in information retrieval research, evaluation methodology, vector space retrieval model, probabilistic retrieval models, learning to rank algorithms, probabilistic topic models, information retrieval systems, text analytics, and topics of research frontiers in information retrieval.
49222
Lecture-Discussion
GA
2:00PM -3:15PM
WF
1111 Siebel Center for Comp Sci
Agha, G
Part of Term:
1
Date Range:
08/22/11-12/07/11
Credit:
4 hours
Section Info:
Topic: Emerging Programming Paradigms. A new generation of applications is changing the nature of programming. Web applications require context awareness. Sensor networks use broadcast messages and have limited computational resources. Cyberphysical systems must provide real-time control. Cloud computing requires balancing availability, consistency and reliability. The seminar will study programming models and languages for such systems.
42378
Lecture-Discussion
KGK
9:30AM -10:45AM
WF
1103 Siebel Center for Comp Sci
Karahalios, K
Part of Term:
1
Date Range:
08/22/11-12/07/11
Credit:
4 hours
Section Info:
Topic: Social Computer Mediated Communication. This is a project based course that looks at the theory and practice of computer mediated communication (CMC) with an emphasis on the social setting. We look at the history of CMC, social motivation and technological forces for using such systems and the conventions that evolved. Students will design and create their own social CMC systems as the course progresses.
46032
Lecture-Discussion
MAN
3:30PM -4:45PM
TR
1111 Siebel Center for Comp Sci
Prabhakaran, M
Part of Term:
1
Date Range:
08/22/11-12/07/11
Credit:
4 hours
Section Info:
Topic: Applied Cryptography. Cryptography is a crucial component in building systems that are "secure." This course will provide a theoretically sound foundation in applied cryptography. We shall see fundamental cryptographic notions and how cryptographic primitives can be used to create a broad range of applications with well-defined security guarantees.
54730
Lecture
NV
11:00AM -12:20PM
TR
1304 Siebel Center for Comp Sci
Vaidya, N
Part of Term:
1
Date Range:
08/22/11-12/07/11
Credit:
4 hours
Section Info:
Topic: Distributed Algorithms. Prerequisites: ECE 428 or ECE 438. Distributed algorithms for wired networks, including algorithms for consensus, clock synchronization, mutual exclusion, broadcast; proofs of correctness of distributed algorithms; fault-tolerant distributed algorithms; distributed algorithms for wireless networks. Meets with ECE 598, Section NV, 54453.
46989
Lecture-Discussion
PS
12:30PM -1:45PM
TR
1131 Siebel Center for Comp Sci
Smaragdis, P
Part of Term:
1
Date Range:
08/22/11-12/07/11
Credit:
4 hours
Section Info:
Topic: Machine Learning for Signal Processing. Prerequisite: Linear algebra, Probability theory. Today we see an increasing need for machines that can understand complex real-world signals, such as speech, images, movies, music, biological and mechanical readings, etc. In this course we will cover the fundamentals of machine learning and signal processing as they pertain to this goal, as well as exciting recent developments. We will learn how to decompose, analyze, classify, detect and consolidate signals, and examine various commonplace operations such as finding faces from camera feeds, organizing personal music collections, designing speech dialog systems and understanding movie content. The course will consist of lectures and student projects and presentations. Students are expected to have a working knowledge of linear algebra, probability theory, and programming skills to carry an implementation of a final project (preferably in MATLAB, but all languages are welcome).
58308
Lecture-Discussion
RAR
3:30PM -4:45PM
TR
112 Transportation Building
Rutenbar, R
Part of Term:
1
Date Range:
08/22/11-12/07/11
Credit:
4 hours
Section Info:
Topic: Probabilistic Graphical Models for AI. Probabilistic graphical models underly many critical representation, reasoning and inference tasks in modern AI. They come in many flavors, from Bayesian Nets to Markov Random Fields. There is now a coherent body of work on how to learn them, interrogate them, and optimize them. We will survey the field, along with relevant background on probability and optimization.
46042
Lecture-Discussion
SS
12:30PM -1:45PM
WF
1103 Siebel Center for Comp Sci
Sinha, S
Part of Term:
1
Date Range:
08/22/11-12/07/11
Credit:
4 hours
Section Info:
Topic: Probabilistic Methods for Biological Sequence Analysis. This course will present some of the important research topics pertaining to the computational processing of genomic sequences, focusing on probabilistic approaches to the problem. Computational techniques will be discussed in the context of the important biological process of gene regulation, and problems such as sequence alignment, motif finding, and module detection, will be studied in detail. A recurrent theme of the course will be comparative genomics -- the paradigm of examining data from multiple species for improving the extracted signal.
COURSE EXPLORER
Email: Course Explorer Feedback

OFFICE OF THE REGISTRAR | 901 W. Illinois Street, Urbana, Illinois 61801

Site developed by: Technology Services at Illinois | UNIVERSITY OF ILLINOIS URBANA-CHAMPAIGN
1102 Digital Computer Laboratory | MC-256 | Urbana, IL 61801 | phone 217-244-7000