C.Tech Courses for the Spring Semester 2017-18 (II Semester, 2017-18)

(based on the C.Tech Group Meeting dated 01 Sep 2017, and subsequent discussions)

[The group decided to propose the fractal curriculum concept for the ELL100 Intro to Electrical Engg course for discussion by the relevant forums of EE.]

- ELL888 - Advanced Machine Learning (Neural networks and Deep Learning) [Registration Cap: 60]

A P Prathosh [Slot J]

- [MTech CTech Core] ELL783 Operating Systems (3-0-2) 4 credits

Sumantra Dutta Roy [Slot A]

- ELL784 Introduction to Machine Learning (3-0-0) 3 credits [Registration Cap: 50]

Sumantra Dutta Roy [Slot C] (Prof. Jayadeva to take a few lectures)

- [BTech Dept Core] ELL365 Embedded Systems (3-0-0) 3 credits

Tapan Kumar Gandhi (Coordinator) [Slot A]

Instructors: Tapan Kumar Gandhi, Subrat Kar, S. M. K. Rahman

- ELL786 Multimedia Systems (3-0-0) 3 credits

Brejesh Lall [Slot D]

- ELP780 Software Lab (Elective Lab) (0-0-4) 2 credits

Subrat Kar

- ELL409 Machine Intelligence and Learning (3-0-2) 4 credits [Registration Cap: 50]

Jayadeva [Slot J]

- ELL796 Signals and Systems in Biology (3-0-0) 3 credits

Sumeet Agarwal [Slot AC]

- [Core] ELP305 Design and System Lab (0-0-3) 1.5 credit

S. M. K. Rahman (coordinator) [Slot R]

Instructors:

Prathosh A. P. (1 day of the week)

S. M. K. Rahman (1 day of the week)

Seshan Srirangarajan (1 day of the week)

Subrat Kar (1 day of the week)

Tapan Kumar Gandhi (1 day of the week)

- ELL881 Special Topics in Computers-II (3-0-0)

Healthcare Technology

Tapan Kumar Gandhi

[Slot X1: timings: mutual convenience]

- ELL880 Special Topics in Computers-I (3-0-0)

Social Network Analysis

Sumantra Dutta Roy (Coordinator)

Instructors: Sougata Mukherjea and Amit Nanavati, IBM-IRL

[Slot X1: timings: mutual convenience]

We apologise, this course will not run in the current semester.

- ELV780 Special Module in Computers (1-0-0) 1 credit

IoT: Internet of Things

Sumantra Dutta Roy (Coordinator)

Instructors: Dinesh Kumar and team, Samsung [Slot X1: mutually convenient timings]

[Please see below, sample course outline: 1 credit course]

18 Jan’18 update: the Samsung researchers have announced their schedule for classes.

Link to course schedule: [link]

Venue for classes: 24 Jan (Wed) 4:30pm-5:30pm class: IIA 201 (Bharti, first floor). For the rest of the semester, 2-4pm on the Wednesdays according to the above schedule: IIA 305 (Bharti, second floor)

- ELL402 Computer Communication (3-0-0) 3 credits

Swades De

[Slot X1: timings: mutual convenience]

-ELP782 Computer Networks Lab (0-1-4)

Swades De

[Slot P]

-ELV720 Special Module in Communication Systems and Networking (1-0-0) 1 credit [A Comm Course]

Pervasive Computing and Mobile Computing

H. M. Gupta

[Slot X1]

-ELL822 Special Topics in Communication Systems and Networking-II (3-0-0) 3 credits [A Comm Course]

Linear and Nonlinear Programming

Jun-Bae Seo

[Slot X1]

-ELV781 Special Module in Information Processing -I (1-0-0) 1 credit [A Comm Course]

(Details awaited)

  [Slot X1: timings: mutual convenience]

- ELD880 Major Project Part-1 (Computer Technology) (0-0-12) 6 credits

Sumantra Dutta Roy [Slot P]

 

- ELD881 Major Project Part-2 (Computer Technology) (0-0-24) 12 credits

Sumantra Dutta Roy [Slot P]

- ELD780 Minor Project (Computer Technology) (0-0-4) 2 credits

Sumantra Dutta Roy [Slot P]

Course Outlines:

ELL822 Special Topics in Communications (Optimisation)

Note from Jun-Bae Seo:

The first lecture of ELL 822 takes place on Tuesday, 3:30-5:00 Bharti school, 106.

It will hold this place regularly on Wednesday 3:30-5:00 as well.

This course is about optimization techniques; the syllabus of this course is

1.           Convex sets and functions

2.           Constrained minimization theory: Lagrangian multiplier, KKT condition, Duality

3.           Linear programming

4.           Unconstrained minimization: Line search, Steepest descent, Newton, Quasi-Newton method and convergence; subgradient method for non-differentiable functions

5.           Constrained minimization algorithms: Active set method, Penalty and Barrier method, Feasible direction method, Sequential Quadratic programming, Projected Gradient method

6.           Applications to computer networks: Network utility maximization, and network decomposition

The main aim of this course is to help students get familiar with optimization so that they feel comfortable in reading research papers, when students would do their own research.

The make-up lecture for the first two lectures will be scheduled later.

ELP782: Computer Networks Lab, 0-1-4, 3 Credits

This is the last call for registration for ELP782 (0-1-4, 3-credits) in 2017-18, Semester II. With the current number of registrations the course will not run in this semester.

Course objective: Intended to provide the protocol implementation concepts of communication network systems, and to be able to appreciate the connection between theoretical analysis and actual network system-level implementations.

Course content: Simulation and hardware experiments on different aspects of computer communication networks. Network traffic generation and analysis, differentiated service queues, network of queues using discrete event simulations.

Lab activities:

* Network traffic generation and analysis of traces; numerical erification using traffic distributions

* Learning discrete event simulation tools

* Simple point-to-point communication and queueing analysis

* Differentiated traffic generation, reception, and analysis

* Simulation of network of queues - open as well as closed network systems

* Exploration of application-specific network performance analysis

Self-study component:

* Cross-layer protocol optimization concepts: Distributed control, cost and energy efficiency

* Advanced research papers on case-by-case basis, per assignment

Tentative Course Evaluation Plan:

* Regular evaluation viva (30%)

* Regular evaluation demonstration (40%)

* Term project demonstration and viva (30%)

ELV780 Internet of Things - IoT Eco-system & Specifications

Link to course schedule: [link]