COMS W4205 Combinatorial Methods

1
COMS W4205 Combinatorial Methods

• Prof. Jonathan Gross
• Sequences
• Ordinary Generating Functions, Asymptotic
  Estimates
• Solving Recurrences
• Evaluating Sums
• Finite Calculus, Inclusion-Exclusion
• Subsets and Binomials
• Applications to Statistics, The Catalan
  Recurrence
• Integer Operators
• Euclidean Algorithm, Chinese Remainder Theorem
• Partitions and Permutations
• Stirling Numbers, Exponential Generating
  Functions
• Graph Enumeration
• Burnside-Polya Counting
• Combinatorial Designs
• Latin Squares, Balanced Block Designs,
• Finite Geometries, Projective Planes, Affine
  Planes

2
COMS W4252 Introduction to Computational
Learning Theory

• Theoretical foundation of machine learning
• Focus on provably correct and efficient learning
  algorithms
• Connections with artificial intelligence,
  statistics, theoretical computer science
• Counts as required track course for Machine
  Learning MS track, track elective for Foundations
  of Computer Science MS track
• Contact instructor (Rocco Servedio,
  rocco_at_cs.columbia.edu) with any questions

3
CSEE 4823 Advanced Logic DesignProf. Steven
Nowick

• Course Focus advanced course in modern digital
  design
• Pre-Requisites basics (half-semester) of digital
  design
• Combinational logic truth tables, Karnaugh
  maps, basic combinational design
• Sequential logic basic exposure -- latches,
  flipflops, state machines
• Covers
• Advanced digital logic topics
• Designing controllers (Mealy/Moore state
  machines)
• High-speed adders (carry-lookahead,
  Kogge-Stone)/multipliers
• Structured logic blocks (PALs, PLDs, ROMS)
• Arbiters/synchronizers
• Asynchronous (clockless) circuits
• Introduction to modern industrial design
  methodology
• hardware description languages for
  specification/design (VHDL)
• Introduction to CAD tools modelling
  simulation
• Real-world design applications
• Note -- not primarily a lab course, but includes
  mini-project
• Provides
• Strong background for advanced digital/embedded
  systems and computer architecture courses
• Good background for industrial positions

4
Advanced Computer Design

• Goal
• To learn how to design computers holistically
  from the hardware, to hypervisors, to operating
  systems, compilers, storage systems and
  middleware
• To understand hardware, and software tradeoffs
  for PDAs versus desktops versus mainframes
• To create (in a Thought Experiment) your own
  system based on which market, which workload you
  are targeting optimization for
• To practice pitching your design to a fictitious
  CEO (our class) to have them fund your system.
• At the end of the term, I and the class vote
  which of the student systems we will bet our
  company on. (Not allowed to vote for your own
  system architecture)
• Workload
• Lectures, discussion of recommended papers
• Assignment of short papers (1 to 2 pages) after
  each thought experiment
• Student in class presentations of their papers
• No finals, midterms or exams
• Graduate course E6998
• http//www.columbia.edu/dd20/e6998.htm
• Instructor Donna Dillenberger
• IBM 18 years, executive, Distinguished Engineer,
  Master Inventor, Member of IBM Academy,
• Chief Architect of IT Resource Optimization
  Solutions,

5
COMS 4955 VoIP Security

• Seminar lab course
• learn about VoIP protocols and technology
• install, test and measure a complete VoIP system
  
• conduct a team project implementing, as
  open-source software, an aspect of VoIP
• prepare a survey talk on a topic related to VoIP
  
• http//www.cs.columbia.edu/hgs/teaching/voip-secu
  rity/

6
COMS 6998-1 Practical Cryptography

• Course information http//www.cs.columbia.edu/dc
  ook
• Contacts Debbie Cook dcook_at_cs.columbia.edu and
• Moti Yung moti_at_cs.columbia.edu
• Time Mondays 410-6pm
• Seminar on applied cryptography
• Mixture of lectures and discussions of current
  research
• 1/3 of the course will cover algorithms used in
  practice, design principles and cryptanalysis
• 2/3 of the course will involve student
  presentations and discussions on current research
• Grading
• class participation, a project of the students
  choice, 2 or 3 homeworks
• Prerequisites
• COMS4180 Network Security or familiarity with
  concepts of public key encryption, symmetric key
  encryption, hash functions and knowledge of
  network security protocols
• Basic probability and mathematical maturity
• C or JAVA (for project)

7
COMS W4170 User Interface Design
www.cs.columbia.edu/graphics/courses/csw4170Fall
2006, Tu/Th 110225pm, 633 SW Mudd, Prof. Steve
Feiner (feiner_at_cs.columbia.edu)

• Introduction to theory and practice of user
  interface design
• Design and development of 2D user interfaces

• Sample Spring 2006 final projects UIs for the
  Skype API, emphasizing collaboration and display
  of history

8
COMS W4172 3D User Interfaces www.cs.columbia.edu/
graphics/courses/csw4172Spring 2007, Prof. Steve
Feiner (feiner_at_cs.columbia.edu)

• Metaphors for 3D user interfaces, from desktop to
  immersive
• Selecting 3D objects
• Manipulating 3D objects
• Translation
• Rotation
• Scaling
• 3D interaction devices, displays, and perception
• Travel
• Wayfinding
• System control, from menus to multimodal
  interaction
• Symbolic input, such as text
• Virtual reality and augmented reality
• 3D math
• Guest lectures

9
GRA opportunities for MS students

• Faculty
• Prof. Feiner (HCI)
• Prof. Hirschberg (natural language)
• Prof. Nowick (CAD, computer architecture)
• Prof. Schulzrinne (networks)
• Prof. Stolfo (security)
• Probably others just ask
• May only take 2nd/3rd semester students with
  partial course load or may require project (6901)
  experience