Course Description for Monsoon- 2014 Course Name Faculty Name A Course on Generalized Syntax Dipti M. Sharma+ Soma Paul + M Radhika+ Riyaz Bhat Advanced Biology (cellular/molecular/genetic) A.Rameshwar Advanced Biomolecular Architecture Abhijit Mitra Advanced Computer Networks Sanjay Rawat Analog & Mixed Signal Design Shubhajit Roy Chowdhary Biomolecular Structure & Supramolecular Chemistry Deva Priyakumar+ Abhijit Mitra + Tapan Kumar Sau Biomolecular Structure Interaction& Dynamics Abhijit Mitra+B.Gopal Broadband Networks Jayashree Ratnam Cloud Computing Reddy Raja CMOS Radio Frequency Integrated Circuit Design Syed Azeemuddin CNS Lab Deva Priyakumar Communication Theory II Ubaidulla Compilers Suresh Purini Complexity and Advanced Algorithms Kannan Srinathan Computational Linguistics 1 Dipti Misha Sharma + Soma Paul Data Warehousing & Data Mining Vikram Pudi Database Systems Kamal Karlapalem Design of Mechanisms Suril Vijay Shah Differential Equations Shobha Oruganti Digital Image Processing Jayanthi Sivaswamy Disaster Management Neelima Satyam Ecological Modeling RC Prasad Economic Theories, Social Choice & Power Shobhit Mohan+Naresh Sharma Game Design and Engineering Kavita Vemuri Game Theory for Computer Science Ganesh Iyer, Progress Software Genomics and Proteomics Shridevi V Green Buildings Vishal Garg Information Theory and Coding Prasad Krishnan Intro to Cognitive Science Priyanka Srivastava + Bapi Raju + Dipti Sharma + Kavita Vemuri Introduction to Middleware Systems Ramesh Loganathan Linear Control Systems Rambabu Kalla Machine Learning Shailesh Kumar, Google Mobile Robotics Madhava Krishna Natural Language Processing SP Kishore Non Violence Nandakishore Acharya Number Theory and Cryptology Rajat Tandon Parallel Programming R.Govindarajulu Phonetics and Phonology Peri Bhaskara rao Principles of Programming Languages Venkatesh Choppella Principles of Semiconductor Devices Srivatsava J
Transcript
Course Description for Monsoon- 2014
Course Name Faculty Name
A Course on Generalized Syntax Dipti M. Sharma+ Soma Paul + M Radhika+ Riyaz Bhat
Theories of Arts and Aesthetics Sunil Lohar+Naini Arora
Time Frequency Analysis Anil Kumar VTopics in Speech Systems: Text to SpeechConversion. Suryakanth V Gangashetty
Web Mining Manish Gupta
Title : A Course on Generalized SyntaxCourse Code : CLG543Credits : 3-1-0-4Type-when :Faculty Name : Dipti M. Sharma+ Soma Paul + M Radhika+ Riyaz BhatPre-requisites: CL1 or knowledge of basic Linguistics and syntaxObjective : Understanding various syntactic phenomena of English and Indian languages in the
light of a grammatical framework.
Course Description:1. Nature of Constraint Based Grammar2. Fundamentals of Sign Based Construction Grammar (SBCG) in relation to HPSG (Head Driven
Phrase structure Grammar)1. Nature and feature structure description of sign2. Notion of Construction3. Representation of meaning – Minimal Recursion Semantics (MRS)4. Issues of Locality
3. Analysis and representation of the following in SBCG framework:1. Modifier-modified relation2. Verb and their alternations3. Unbounded Dependencies
4. Analysis of English sentences using LinGO English Resource Grammar (ERG)5. Using of Linguistic Knowledge Builder (LKB) for building a model grammar
REFERENCE:
1. Boas H. C. & Ivan Sag (2012): Sign Based Construction Grammar2. Copestake A., Dan Flickinger, C. Pollard and Ivan Sag (2006): Minimal Recursion Semantics: An
Introduction3. Bender, Emily M., Ivan A. Sag, and Thomas Wasow (2003) Syntactic Theory: A formal introduction4. Copestake Ann and Dan Flickinger (2000) An open-source grammar development environment
and broad-coverage English grammar using HPSG5. Copestake, Ann (1999) The New LKB System
OTHER READINGS:
1. Ginzburg Jonathan and Ivan A. Sag (2000): Interrogative Investigations, The Form, Meaning andUse of English Interrogatives
2. Sag Ivan (1997) English Relative Clause Constructions3. Pollard Carl (1996): The Nature of Constraint Based Grammar
4. Baldwin T., J. Beavers, E. Bender, D. Flickinger, Ara Kim and S. Oepen (2005) Beauty and theBeast: What running a broad-coverage precision grammar over the BNC taught us about thegrammar
1. and the corpus5. Oepen Stephan, Kristina Toutanova, Stuart Shieber, Christopher Manning, Dan Flickinger and
Thorsten Brants (2002) The LinGO Redwoods Treebank: Motivation and Preliminary Applications6. Baldwin Timothy and Francis Bond (2002) Alternation-based Lexicon Reconstruction
GRADING:HA and/or CA 15%Seminar/Project 30%Mid term 25%End term 30%
OUTCOME:
At the end of the course the students will be have better understanding of the syntactic structure ofhis/her language.
TITLE : Advanced BiologyCourse Code : SCI421Credits : 3-1-0-4Type-when : Core course, Monsoon 2014Faculty Name : Prof. A. RameshwarPre-Requisite : Introductory biology or equivalent
OBJECTIVE : An intensive in-depth treatment of selected topics in Evolutionary biologywith emphasis on open questions that may benefit from a multidisciplinary approach includingcomputational methodology
COURSE TOPICS : Origin of life Evolution of Life
• Prokaryotes– Membranes
» Signal Transduction– Homochirality– RNA world– Protein Universe– DNA World
» Chromosome– Metabolic pathways
» Photosynthesis• Eukaryotes
– Multicellularity– Sex
» Soma & Germ line Mitosis - meiosis– Organelles– Apoptosis
• Disease- - Drug Design Targets
PREFERRED TEXT BOOKS: -
*REFERENCE BOOKS:– Stearns S C Hoekstra R F 2002 Evolution An introduction. Oxford Univ.Press– Primrose S B, Twyman R M 2003 Principles of Genome Analysis Blackwell Publishing– Koonin E V, Galperin M Y 2002 Sequence- Evolution-Function. Kluwer Academic
publishers- Sechbach J,Chela-Flores J,Owen T,Raulin F (eds) 2004 Life in the universe. Kluwer
Academic publishers– Adam S. Wilkins.2002. The Evolution of Developmental Pathways. Sinauer Associates.
– Ziheng Yang.2006. Computational Molecular Evolution, Oxford University Press
*PROJECT: Being an advanced course, emphasis is laid on self-study. Every week, students are askedto present research papers covering the topics discussed in the previous class.
• GRADING:• Midterm I 10• Midterm II 10• Final Exam 30• Assignments & presentations 50
OUTCOME: Even now the topic of evolution remains as central and fundamental to the biologicalsciences as it was earlier. A good understanding of it is crucial to the bioinformaticians.
REMARKS: This course covers the new order of topics in evolution starting from origin of life andmolecular evolution all the way to the evolution of organelles, cells, tissues, organs, organisms,species and populations. It will also deal with evolution of disease and locating drug design targets.
Type: Domain core (M Tech Bioinformatics) + (post B Sc non chemistry background)+ Domain requirement for MS by research/ PhD (Bioinformatics) + Science Elective for B Tech
Load: Total contact hours 5-6 hours per weekLive lectures: Two 1.5 hr lectures per weekLabs + Tutorials 1.5 - 3 hr per week
Assignment hours (including lab and reading assignments) around 5 hours per week
Objectives: First course on the basics of design principles of nature at the molecular level, whichwould provide breadth in structural and biophysical approaches and ‘chemenable’ students tounderstand structures and interactions in Biology
Expected outcome:1. Ability to write Lewis and other specialized structural formulae and use them to relate structureswith properties2. Ability to communicate with written structures of biological molecules3. Ability to understand standard IUPAC nomenclature and numbering4. Ability to understand structural features including Chirality and prochirality, structure parametersincluding torsion angles, their definitions and standard values for biomolecules5. Ability to build molecules in silico and familiarity with some visualization and analysis tools6. Understand the basis of computability of energetic of molecules and their ensembles7. Ability to handle files containing structural information of molecules and mine structure databasesof biological molecules
Course topics: Atomic structure and the periodic table Quantum mechanical approach to atomic structure and bonding Bonding and intermolecular forces Nomenclature and isomerism Configuration and Conformation Structure and properties of molecules Computation of energies of molecules and their interactions Small biomolecules Biological macromolecules: Proteins, Nucleic acids , Lipids and carbohydrates
Syllabus and topic wise Coverage:Week Topics
1/1 Design principles of nature – chemistry at the atomic level
1/2 Quantum mechanical structure of the atom
2 Quantum mechanical structure of the atom:Assignment : Structure of atoms - Due Week 3
3 Periodic table and its organizationo The electronic configuration of atoms and periodic properties of
atoms in their free and bonded stateAssignment : Periodic properties – Due week 4
4 Bonding and intermolecular forceso Theories of bonding
Assignment : Bonding – Due week 5Dry lab on structure drawing tool
Assignment : Structure drawing – Due week 65 Bonding and intermolecular forces
o Types of bonds and their consequenceso Electron distribution in molecules and their representationo Hybridizationo Resonance and aromaticityo Intermolecular forces
Assignment : Bonding – Due week 76 Molecular structure
o Bond length, bond angle and shape of moleculeso Dipole momentso Structural and stereo isomerso Nomenclatureo Chirality and optical activityo Representation of configuration
TutorialAssignment : Nomenclature and isomerism – Due week 8
7 Configuration and conformationo Stereo chemical nomenclatureo Sugars and carbohydrates
TutorialAssignment : Representation of configuration /conformation – Due week 9
8 Configuration and conformationo Representation of conformations, their energy barriers and torsion
angles9 Structure and properties of molecules
o Bond energy and type of bond breakingo Basics of thermodynamics and kinetics
TutorialAssignment : Properties of molecules - Due Week 11
10 Structure and properties of moleculeso Acids and baseso Reactivity’s of molecules
Dry lab on structure building and visualizing tool11 - 12 Study of amino acids and proteins
o Familiarity with the different amino acids and their classificationo Investigation of dipeptides and torsion angleso Levels of protein structure and forces stabilizing themo Primary structure and its relation with higher order structureo Secondary structure and Ramachandran plot
Dry lab on structure visualizing toolAssignment : Identification /classification of amino acids – Due week 12
Assignment : Ramachandran plot – Due week 1313 Study of nucleic acids
o DNA- Components, chemical structureso Base pairing and hydrogen bondingo Types of DNAs A, B, Z and their structure parameters
Dry lab on structure analysis tool14 Study of nucleic acids
o Nucleic acid databaseso Comparing DNA and RNAo Nucleic acid protein interactions
Text books: Study material will be provided in the form of pdf files and web contentAlso Atkins and LeachReference books
1. Bio-Chemistry – Stryer2. Biochemistry – Voet, Voet and Pratt3. Ralph H. Petrucci, General Chemistry: Principles & Modern Applications, 8th Edition, Addison
Wesley Longman (2003)4. P W Atkins, Elements of Physical Chemistry, 5/E, Oxford University Press (2010)
OBJECTIVE : The course is designed for students who have basis knowledge of networking (OSImodel, TCP/IP, ARP and few application level protocols, LAN and routing etc.). The course builds itscontents by considering a mixed approach of involving theory and practical. From this perspective, thecourse introduces advanced topics that are basis blocks of networking and covers fundamentals thatare used to develop few of the advanced technologies, including routing protocols, wireless & mobilenetworks etc. The course aims to provide information so that at the end of the course, the studentsfind themselves comfortable in taking either of the direction- industrial job or further research innetworking.
Syllabus::The whole course is designed for 12 (+2) weeks of classes (3hr per week -> 36 (+6) hrs of
class room teaching).Week#1 1. Overview and quick revision;Week#2 1. End-to-end Protocols (getting processes to communicate)- RPC and Routing protocols,e.g., BGP.Week#3-4 1. TCP congestion controlWeek#5 1. Few application level protocolsWeek#6-7 1. End-to-End data, multimedia networking applications (image, audio, videocompression).Week#8-9 1. Alternative Infrastructures(Active networks, Software defined networks)Week#10 P2PWeek#11 IPv6Week#12 Network Security and wireless and Mobile networks (this may take extra 1 week)
B. Textbook:"Computer Networks: A Systems Approach", by Larry Peterson and Bruce Davie."Computer Networking: A Top-Down Approach Featuring the Internet", by James F. Kurose and KeithW. Ross
4. Final exam: 35% (marks 70)Total Marks: 200 (the final grading will be relative and there will be separate weights for topics.)
*Mini Project: Student (in group) can choose some topics as their mini project. The project isexpected to involve as good amount of engineering, i.e., programming efforts. Examples: networksniffer and protocol decoder; client-server chat application etc.
TITLE : Analog and Mixed Signal DesignCourse Code : ECE461Credits : 3-1-0-4Type-When : Monsoon 2014Faculty Name : Shubhajit Roy ChowdharyPre-Requisite : Basic Electronic Circuits
OBJECTIVE: Circuit requirement for realizing in IC Form
COURSE TOPICS:No. of Lectures
1 Device Models, Biasing Techniques, Loads. 6
2Current mirrors – single stage amplifiers – cascade amplifiers, differentialamplifiers
10
3 Operational amplifiers – Two stage and Three stage op-amps-other op-amp architectures
10
4 Comparators – errors, switch capacitor circuits 65 Sample and hold circuits – data converters (A/D and D/A) 86 PLLS, their analysis and design 4
Total 44
PREFERRED TEXT BOOKS:1. 1.Paul R. Gray & Robert G. Mayor – Analysis and Design of Analog Integrated Circuits, John
Wily & Sons 2001.2. 2.David Johns, Ken Martin, Analog Integrated Circuit Design, John Wily & Sons 1997.3. 3.Jacob Baker R et.al, CMOS Circuit Design, IEEE Press, Prentice Hall, India 2000.
TITLE : Biomolecular Structure and Supramolecular ChemistryCourse Code : SCI644Credits : 3-1-0-4Type-when : Monsoon-2014Faculty Name : U. Deva Priyakumar, Abhijit Mitra & Tapan SauPre-Requisite : General and Structural Chemistry or Advanced Biomolecular Architecture
OBJECTIVE: To understand biomolecular structures (proteins and nucleic acids), nonbondedinteractions, molecular recognition and binding in the context of Supramolecular chemistry andbiomolecules.
COURSE TOPICS:Nonbonded interactionsProteins
Amino acids: structures and conformationsMotifs of protein structuresAlpha-domain structuresAlpha/beta structuresBeta structuresProtein folding and stabilityMembrane proteinsNucleic acidsBuilding blocks of nucleic acidsDNA structure – different forms of DNARNA structure (including noncanonical structures)Determination of biomolecular structures (Xray and NMR)Molecular recognition and bindingLock and key, and induced fit mechanismsMeasurement of binding constantsThermodynamic and kinetic aspectsCooperativityBiological and synthetic ion binding hosts (crown ethers, calixarenes, ion channels, etc.)Inclusion complexes (cyclodextrins, zeolites, cyclophanes, etc.)Protein-ligand, RNA-ligand and Protein-DNA bindingEnzyme catalysis, and Supramolecular catalysis
PREFERRED TEXT BOOKS:1. Introduction to Protein Structure by Branden & Tooze2. Supramolecular chemistry by Steed & Atwood3. Other material that will be given
TITLE : Biomolecular Structure Interactions And DynamicsCourse Code : SCI643Credits : 3-0-1-4Type_When : Monsoon-2014Faculty Name : Prof. Abhijit Mitra and Prof. B. GopalakrishnanPre-requisites : Advanced Biomolecular Architecture or General and StructuralChemistry or equivalent Max. No. of students (limit, if any): Science/Open elective for ‘non CNS’ B.Tech students – no limit.
OBJECTIVE: Navigating the �Sequence � Structure � Function� Space for Biomolecules.Course Description: � Structure and properties of biomolecules, � Interactions betweenbiomolecules, � Properties of ensembles of biomolecules, � Reactions and reaction mechanisms, �Important biochemical reactions, � Exploration and analysis of biomolecular structures andinteractions, � Molecular modeling and docking � concepts and techniques, �Databases and tools.
Text Book:1. Bio-Chemistry - Lehninger2. Bio-Chemistry � Stryer3. Biochemistry � Voet, Voet and PrattSyllabus and topic wise Coverage:Lectures Topics
Week 11 -2 Structure and properties of biomolecules: Steric and electronic effects,Electrophiles, nucleophiles, acids, bases and salts, Buffers
Week 2
3 Interactions between biomolecules: Hydrogen bonding and solvation, examples of structureproperty correlationAssignment 1 : Due Week 3
Week 2 � 44 � 7 Properties of ensembles of biomolecules: Elementary concepts ofchemical thermodynamics, Equilibrium and kinetics, Ionic equilibriums and chemistry in aqueoussolution. Application to stability of proteins, nucleic acids and their interactions.Assignment 2 : Due Week 5
Week 58 � 9 Reactions and reaction mechanisms Classification of reactions and their mechanisms �application to classification of biochemical reactions and their enzymesAssignment 3: Due Week 6
Week 5 � 610 � 12 Important biochemical reactions Examples from enzyme classes, active site, targetspecificity, inhibition and activation. Reactions involved in storage and retrieval of energy. Enzymekinetics.Assignment 4: Due Weeks 8
Week 7 � 913 � 18 Exploration and analysis of biomolecular structures and interactionsExperimental methods and techniques for analyzing structures and interactions � NMR, ESR, X-Ray,CD, Fluorescence etc. Detailed structural analysis of some representative proteins, Analysis of DNAand RNA structures,Assignment 5 and 6: Due Weeks 9 and 11
Week 10 � 1219 � 24 Molecular modeling and docking � concepts and techniques:Useful concepts in Molecular modeling - Tasks and techniques in molecular modeling, Identification oftasks e.g. alignment, minimization, conformational search, dynamics and simulation etc., Methods ofanalyzing structures, Methods of prediction and validation of structuresAssignment 7: Due Week 12
Week 13 � 1425 � 28 Databases and tools: Classification of databases, databases of structures andfunctions, CATH, SCOP, PFAM, Functional domain � Analysis serversAssignment 8: Due Week 14
Laboratory:� Visualization & rendering� Building molecules-Physical (Ball & Stick, Paper models), in silico� Rendering of various aspects of structures of biomolecules� Web based tools� Query tools: i) Sequence retrieval, ii) Structure retrieval� Protein structure analysis tools:
Outcome: 1. Review of physicochemical principles at the molecular level 2. From molecules tobiochemical systems � appreciation of principles of kinetics and thermodynamics for understandingmechanisms of interactions and reactions of biomolecules 3. Appreciation of the experimental methodsused for exploring structures of biomolecules 3. Understanding of important structural concepts usedfor the analysis of protein and nucleic acid structures 4. Learning to use and understanding theprinciples of molecular modeling, docking and molecular dynamics simulations for inferring structures,
functions and interactions from sequences � 5. Familiarity with important structural and functionaldatabases and their usefulness in biological contexts.
Remarks: Total contact hours 4-5 hours per week Live lectures: Two 1.5 hr lectures per week.
TITLE : Broadband NetworksCourse Code: ECE530CREDITS : 3-1-0-4TYPE-WHEN : Monsoon -2014FACULTY NAME : Dr. Jayashree RatnamPRE-REQUISITE: Communication Networks
OBJECTIVE : Comprehensive overview of emerging high-speed, advanced Wire-linetelecommunication networks
COURSE TOPICS:
Introduction to Broadband Networks: Evolution, Services and Deployment; Standards bodiesand Study groups - ITU-T, IETF, IEEE
Digital Multiplexing Techniques (time/ frequency/ wavelength/ statistical), Digital hierarchies-pleisochronous and synchronous (PDH/SDH); Network Interfaces and Devices
Standard Network Architectures: SONET/SDH, Asynchronous Transfer Mode (ATM), Gigabit Ethernet
Network Design: Resource Allocation, Provisioning, Resilience (Protection and Restoration);Tele traffic Engineering: Bandwidth Management, Traffic Grooming and Load Balancing;Service Level Agreements and Performance Metrics
Modeling and Performance Analysis: Queuing Theory, Voice traffic and Erlang formulae;Poisson and Self-similar traffic modeling
Access Network Technologies: Digital Subscriber Line Variants (xDSL), Broadband IntegratedServices Digital Network (B-ISDN)
Backbone and Backhaul Networks: Fiber to the Premises: Passive Optical Networks – GPONand WDMPON;
PREFERRED TEXT BOOKS/ PAPERS: Jean Walrand and Pravin Varaiya, “High Performance Communication Networks”, Harcourt Asia
and Morgan Kaufmann 2000 Leon Garcia and Indra Widjaja, “Communication Networks- Fundamental; Concepts and Key
Architectures”, Tata McGraw Hill 2000 Optical Networks: A Practical Perspective by Rajiv Ramaswami and Kumar Sivarajan, Morgan
Kaufann Publishers 2000 Dmitri Bertsekas and Robert Gallager, “Data Networks”, Prentice-Hall Inc., 1997. William Stallings, “High-Speed Networks and Internets- Performance and QoS”, Pearson
Education 2008
*REFERENCE BOOKS:1. Some Tutorial/Survey Papers from IEEE Journals
GRADING:1. Periodic Assignments/Quiz: 20 marks2. Mid-term Examinations: 20 + 20 marks3. End Semester Examination: 40 marks
TITLE : Classical Text Reading I
TITLE : Cloud ComputingCourse Code : CSE565Credits : 3-1-0-4Type-When : Monsoon-2014Faculty : Reddy RajaPre-Requisite : B. Tech 3rd year and above Maturity in Software Engineering area
(instructor's permission)Max.Limit : 90
OBJECTIVE: This course introduces students to the cloud-computing paradigm with a focus on hands-on programming exposure to the grid or cloud environment. The concepts of distributed computing,distributed file systems, cloud, cloud middleware, cloud migration will be introduced with practicalapplications in mind.
COURSE TOPICS: Introduction to Cloud Computing, Cloud Computing architectures, CloudComputing architecture – A case study of Amazon, Introduction to Map Reduce. Theory behindMapReduce, Map Reduce Implementation Hadoop – A case study, Map Reduce Programming: Nuts andbolts, Distributed File Systems - Overview, requirementsGoogle File system, A case study, HDFS – A case study, Other Distributed File SystemsDistributed Systems - Advanced Features, Distributed Cache Hadoop, A case studyOverview of Clusters, Managing Clusters, A case study on Hadoop
S.No Date Week Topic Name Hours Topic Descriptions
1 Introduction toCloud Computing
1.5
1. 2.Different terms used in Cloudcomputing and their meaning.
2. 3.Moore Law & relationship tostorage, CPU speed, etc
3. 4.Introduction to DistributedComputing
1. 1.Fallacies of DistributedComputing
2. 2.Sources of failure indistributed computing
4. 5.Large Data sets and the handlingissues
2 Cloud Computingarchitectures
1.5
RequirementsIntroduction Cloud computing architectureClusters and Cloud ComputingVirtualization at the infrastructure levelOn Demand ComputingSecurity in Colud computing environments
3
Cloud Computingarchitecture – Acase study ofAmazon
1.5
Introduction to Amazon Cloud ComputingservicesAmazon EC2 architectureAmazon S3 architectureAmazon DB, Queues and Cloud Front
4Introduction to MapReduce. Theorybehind MapReduce
1.5
Problem understanding and introductionFunctional programmingMap, Fold and examplesMapReduce and Programming model
Parallelism, fault tolerance andoptimization
5
Map ReduceImplementationHadoop – A casestudy
1.5
Map reduce implementations overviewHadoop as a case studyHadoop architectureParallelism, Map and ReduceJobs and TasksInput and output filesPerformance: Locality of FilesInput splitsPartitioning and shufflingOptimizationsFault toleranceOther implementations of Map Reduce
6Map ReduceProgramming: Nutsand bolts
1.5
Word Count ProblemHow the Map and reduce work
Configuring Job confSetting the combinerChained jobspipesStreaming
7
Distributed FileSystemsOverview,requirements
Google File system,A case studyHDFS – A casestudy
SummarizeDistributed FileSystems
1.5
Distributed File system basicsDFSFile System design point trade-offs
write speed vs read speedstreaming vs random accessreliability vs performance
challenges at large scaleindividual machine/disk failuressynchronization challenges:network splits, concurrentwriters, partial writesbandwidth limitations
Distributed Systems- AdvancedFeatures- Distributed CacheHadoop, A casestudy
1.5
Advanced concepts in distributed systemCustom data structuresFile Formats
Sequence Filesusing CompressionCustom inputformat and Record reader
classesTuning shuffle distribution by overridingpractitionerCustomer status counters in ReporterUsing Distributed CacheManually rebalancing data replicationHDFS File permissionsRackAware DFSInterfacing with GangliaStarting Cluster on EC2Using S3 based DFS
9
Other topics indistributedcomputing.Scripting, Databaseetc.Implementationcase studies
1.5
PigZooKeeperHbase and others
10
Overview ofClustersManaging ClustersA case study onHadoop
1.5
Cluster overviewCluster ManagementBasic SetupNode ConfigurationCluster ConfigurationTuning Configuration for optimumperformance
11 Lab 1: Word Countdemonstration
1.5In class demonstration. Walking thro theWordCount Problem. Standalone andDistributed version using Cache
15 Project Idea 1Propose a system to query results similarto the Database queries(sql like). Probemdomain to be described.
16 Project Idea 2Implement a secure system for securingthe execution of tasks – Problem Domainto be described.
17 Project Idea 3Propose a system for using MapReduce foran ERP application in an enterprise.Problem domain to be described.
18 Project Idea 4
Using Map Reduce for defence applications.Processing large amount of data(Imageprocessing etc) – Problem domain to bedescribed
19 Project Idea 4Using Map Reduce in Medical applications –Image processing etc – Problem domain tobe described
20 Assignment 3 TBD21 Assignement 4 TBD
PREFERRED TEXT BOOKS: No text book - Material from research papers
*PROJECT: Each student will have be given a hands on project implementation to task on a cloudenvironment
GRADING:* Mid term exams:20%
* Final exam :20%* Assignments: 20%* Project: 40%
OUTCOME: After taking the course, the student will be able to understand the cloud computingplatforms and will be able to acquire the skills to program in a distributed grid/cloud computingenvironment and conduct research in this emerging area
TITLE : CMOS Radio-Frequency Integrated Circuit Design
Course Code : ECE467Type when : Monsoon - 2014Credits : 3-1-0-4Faculty Name : Syed AzeemuddinPre-Requisite :
Pre-requisites: Electronic Circuits and Design, Analog signal design, some basics of EMTCourse Description: Introduction to RF and wireless technology, Basic concepts in RF Design, PassiveRFIC components, Review of MOS device Physics, RLC networks, Transmission lines concept, SmithChart and S-parameters, Bandwidth estimation techniques, biasing circuits, Noise, high-frequencyamplifier design techniques, CMOS low noise amplifiers (LNA), An overview of wireless transceiverarchitectures (If time permits).
Text Book:1.Thomas H. Lee, The Design of CMOS Radio-Frequency Integrated Circuits, Cambridge UniversityPress, 2004, ISBN 0521835399.2. Behzad Razavi, RF Microelectronics, Prentice-Hall 1998, ISBN 0-13-887571-5.
Projects (if any):1. CMOS low noise amplifier.Grading: 1. Course Grading Home Work - 10 %2. Mid-term Exam - 20%3. Laboratory Assignments - 10%4. Final Exam � 30%5. Final project - 30%
Remarks: Home works are due in the class on the assigned due date. Makeup exam will be given onlyunder special circumstances.
TITLE : Computational Natural Sciences LabCourse Code : SCI373Credits : 0-1-4-4Type-when : Monsoon -2014Core for III yr I Sem CND StudentsBouquet core for Science stream studentsElective for BTech StudentsFaculty Name : U. Deva PriyakumarPre-Requisite : None for students from the Science/Bioinformatics domain. B or better grade inScience I AND Science II courses for BTech (CSE/ECE) studentsOBJECTIVE : Hands on training to application of computational tools such as quantum mechanicalcalculations, molecular dynamics simulations, Monte Carlo simulations, minimization of moleculesCOURSE TOPICS : 1. Writing Z-matrices for simple molecules2. Conversion of internal coordinates to Cartesian coordinates3. Implementing Huckel Molecular Orbital theory using any programming language4. Geometry Optimization of simple molecules using GAMESS5. Frequency calculations and normal mode analysis6. Conformational analysis of simple linear molecules7. Numerical methods for classical simulations8. Molecular dynamics simulation9. Monte Carlo simulationPREFERRED TEXT BOOKS: Molecular Modelling by Andrew Leach; Molecular Modeling and Simulationby Tamar Schlick,*REFERENCE BOOKS: GAMESS manual*PROJECT:GRADING: 30% Class assignments + 30% Exams + 30% project + 10% Viva voceOUTCOME: Familiarity to state of the art program packages for doing basic quantum mechanicalcalculations, and molecular dynamics simulations; Understanding and implementation of simplemethods such as Huckel methods, etc.REMARKS
TITLE: Communication Theory II (ECE 436)Course Code : ECE436CREDITS : 3-1-0-4TYPE-WHEN : Monsoon -2014FACULTY NAME : UbaidullaPRE-REQUISITE : Communication Theory I
OBJECTIVE: An advanced course in Communication Systems which allows the interested student topursue further study in Communications.
COURSE TOPICS:
Digital Communication through Band-Limited Channels: Nyquist Criterion, Optimum Receivers,Equalization; Turbo Equalization
Advanced Modulation Schemes and their performance: Memoryless and Memory basedSignalling; Power Spectra
Carrier and symbol synchronization: Parameter, Phase and Timing Estimation
Multichannel and Multicarrier Systems: M-ary Orthogonal Signals and OFDM
Spread Spectrum Signals for Digital Communication: Direct Sequence and Frequency HoppedSignals
Multiuser Communications: Multiuser Detection in CDMA systems; Multiuser MIMO Systems
PREFERRED TEXT BOOK:1. Digital Communications: John G. Proakis & Masoud Salehi
*REFERENCE BOOKS:1. Communication Systems: Simon Haykin2. Principles of Communication Systems: Taub and Schilling3. Communication Systems: Bruce Carlson
GRADING:1. Periodic Assignments/Quiz: 20 marks2. Mid-term Examinations: 20 + 20 marks3. End Semester Examination: 40 marks
TITLE : CompilersCourse Code : CSE419Credits : 3-1-0-4Type-when : Monsoon-2014Faculty Name : Suresh PuriniPre-Requisite : Formal Languages
OBJECTIVE: To learn the principles, techniques and tools behind designing and building a Compiler.
COURSE TOPICS:Lexical Analysis, Syntax Analysis, Semantic Analysis, Run Time Environments, IntermediateRepresentations, Code Generation, Instruction Scheduling, Register Allocation, Local and GlobalOptimizations, Introduction to Data Flow Analysis
PREFERRED TEXT BOOKS:Engineering a Compiler, By Keith Cooper and Lina Torczon
*REFERENCE BOOKS:Compilers by Aho, Hopcroft, Ullman, Sethi and Lam
*PROJECT:
Students may have to build a Compiler for a toy programming language
GRADING:percent each midterm, Final (30-40 percent) , Project (10-20 Percent)
CSE411 : Complexity & Advanced Algorithms 3-1-0-4Course Code : CSE411Type-when : Monsoon-2014Faculty Name : Kannan srinathanPre-Requisite: Should have taken Introduction to Algorithms or equivalent
Objective: The course is aimed at undergraduates and graduates who have done a first course inalgorithms and a first course in formal languages. This course is intended to build up further on theabove two themes. About a third of the course will cover topics in formal languages/computing theorysuch as reductions, NP, NP-Completeness, the language hierarchy, classical undecidability results, andthe like. The remaining two-thirds of the course shall focus on two notions of recent advances inalgorithms: parallel algorithms, and randomized algorithms.
In the case of parallel algorithms, focus will be on algorithm design and problem solving using thePRAM model. Classical PRAM algorithm design techniques such as binary tree based computations,accelerated cascading, divide and conquer will be covered. Also included in the coverage are PRAMalgorithms for lists, trees, and graphs.
Course Topics: Basic concepts in randomized algorithms will be covered with applications to parallelalgorithms. Topics covered include tail inequalities, independence, application to symmetry breakingand the like. Computing theory: Reductions, NP and NP-completeness, Language hierarchy,recursive/recursively enumerable, Undecidability. Parallel Algorithms: Models of computation andFlynn’s taxonomy including SIMD and MIMD; Design paradigms including divide and conquer, binarytree based computations, accelerated cascading; and the like; Parallel algorithms for lists and trees :list ranking, tree traversal and evaluation; Parallel graph algorithms: connected components, matrixbased computations. Randomized Algorithms: Tail inequalities including Chernoff bounds; Examplesfor parallel/distributed symmetry breaking, Luby’s algorithm, graph coloring; Online algorithms forpaging.
Preferred Text Books: 1) Introduction to Parallel Algorithms, J. JaJa. 2) Randomized Algorithms, byR. Motwani and P. Raghavan. 3) Introduction to the Theory of Computation, M. Sipser, 2nd edition.Outcome: At the end of the course, a student shall be able to understand the implications ofparallelism in problem solving, design parallel algorithms, and also reason about the efficiency of thesame.
TITLE : Computational Linguistics ICredits : 3-1-0-4Type-When : Monsoon - 2014Faculty Name : Dipti M Sharma + Soma PaulPre-Requisite : None
OBJECTIVE: Basic knowledge of theoretical linguistics and its application in NLP.
COURSE TOPICS: Challenges in processing natural languages: Analyzing the structures, Dealing withambiguities, Structural units in language: word, phrase, sentence, Morphology - Words and how theyare formed, Basic building blocks in morphology � morphemes; Word formation (function based) �inflectional, derivational, Word formation processes Affixation � suffixation, prefixation, infixation,Non-concatenative, Compounding, Morphotactics --constraints on affixes; Morphophonology,Developing morphological analyzers and generators � approaches, (a) Paradigm based - paradigmtables, add-delete rules, (b) Finite state machineries.
3. Syntax : Words in a sentence : word classes, Part of Speech, POS tagging, defining tagset for yourlanguage, Rule based part of speech taggers, Statistical part of speech taggers, Issues in tagging,Syntactic structures - Constituency, phrases and constituent structures, Subcategorization
Agreement, Auxiliary verbs; Representing phrase structures, Deriving phrases using phrase structurerules (CFG), Dependency structure, Constraints on rules, Feature structure, Syntactic dependencies �Modifier-modified trees - Paninian approach, Karaka relations - karaka semantic model, karma andother karakas, tadarthya, Karaka vibhakti mapping, Lexical vibhakti giving the flexibilty of free wordorder, Choice of Vibhakti governed by TAM. Annotating syntactic relations - developing tagset, LexicalSemantics � Subcategorization; Ambiguity, Sense relations - homonymy, polysemy, hypernymy,hyponymy, synonymy etc.
PREFERRED TEXT BOOKS:1. Jurafsky & Martin, 2000; Speech and Language Processing, Pearson Education2. Bharati et al., 1995; Natural Language Processing � A Paninian Perspective3. Fromkin, V, Robert Rodman, Nina Hyams (2002) An Introduction to Language, Thomson Wadsworth
*REFERENCE BOOKS:Aronoff, Mark and Janie Rees-Miller (eds) (2003) The Handbook of Linguistics, Blackwell PublishersAkmajian, Adrian, Richard A Demers, Ann K Farmer and Robert M. Harnish (2001) Linguistics � AnIntorduction to Language and Communication, Prentice Hall
*PROJECT: Students will work on projects in groups of 2-3
GRADING: HA 10% Mid term 30% Project 25% End term 35%
OUTCOME: At the end of the course the students will be able to understand and analyse actuallanguage data and develop computational resources for various levels of language structures.
TITLE : Data Warehousing and Data MiningCourse Code : CSE445Credits : 3-1-0-5Type-When : Monsoon-2014Faculty Name : Vikram PudiPre-Requisite : Database Systems Bouquet course
OBJECTIVE: Learn techniques to extract actionable knowledge from lareg data sets.
COURSE TOPICS: Data warehouse is a repository that contains subject-oriented, non-volatile,integrated and time-variant database. The data warehouse is used for reporting purpose and on-lineanalytical processing. Data cubes and multi-dimensional data will be covered. Data mining consists oftechniques to extract actionable from large data sets. Understanding data, distance measures,normalization, and subspaces of high dimensional data is needed. Algorithms for data clustering,classification and association rules will be studied. Projects will involve mining large data sets.
Approximatenumber ofLectures
Topics
3 What is data mining? Data Pre-processing, Distance measures,understanding data
3 Data clustering, k-means, k-mediods, dbscan, cure, outliers3 Classification, Decision trees, Bayesian classifier3 Association Rules, FP-tree, Frequent Item Sets3 Data Warehousing, OLAP schema, data cube, storage and query processing
– materialized views2 Data cube analytics2 Graph Data Mining3 More on clustering, multiple clustering, subspace clustering3 More on classification, boosting, ROC, ensemble classifier
2 Applications
PREFERRED TEXT BOOKS: Han & Kembar or Han, Kember, Pei Data Mining book, 2nd or 3rd edition.
*REFERENCE BOOKS: Research papers
*PROJECT: Extract knowledge from large real-life data set
GRADING: Exams – 65% - midterm 15% each, and final 30% Assignments – 15% Project – 25%
OUTCOME: The student will understand techniques for data mining, and will be able to perform datamining tasks. Further, the student should be able to conduct research in data mining.
TITLE : Database SystemsCourse Code : CSE441CREDITS : 4TYPE-WHEN : Monsoon-2014FACULTY NAME : Kamal KarlapalemPRE-REQUISITE : Students should have knowledge of SQL, database design and operating systems,programming language, algorithms.
OBJECTIVE : Databases have become essential part of every business. A databasesystem can be used to manage large amounts of data in a persistent manner. The objective of this
course is to study the methods that have been evolved over several decades to build databasesystems or database management systems software in a focused manner which includestorage management, index management, query processing, recovery management andtransaction management.
COURSE TOPICSIntroduction (3 hours); Data storage ( 3 hours); Representing data elements (3 hours); Indexstructures (3 hours); Multidimensional indexes (6 hours); Query execution (6 hours); The querycompiler (6 hours); Coping with system failures (3 hours); Concurrency control (6 hours);More about transaction management (6 hours)
PREFERRED TEXT BOOKS:1. Database System Implementation, Hector Garcia-Molina, Jeffrey D. Ullman and JenniferWidon, Pearson Education, 2003OTHER TEXT BOOKS:2. Elmasri & Navathe, Fundamentals of Database Systems, Pearson Education, 5th Education.3. Raghu Ramakrishnan and Johannes Gehrke, Database Management Systems, Third edition, Mc
Graw Hill, 2003.4. Abraham Silberschatz, Henry F.Korth, S.Sudarshan, Database system concepts, fifth edition, Mc
Graw Hill, 2006.
PROJECT:A practical project on indexing, query optimization, and transaction management will be given.
The project will be evaluated.
GRADING:PROJECT and Assignments: 30%; MIDSEM: 30%; ENDSEM: 40%
OUTCOME:The course will help the students in understanding the fundamental concepts of several database
management systems like ORACLE, DB2, SYBASE and so on. Also, the students willunderstand the solutions/options to interesting problems which have been encountered by thedesigners of preceding DBMSs. Most important, the students will be exposed to internal designof DBMSs and able to tune the DBMSs to meet the performance demands of diverseapplications.
TITLE : Design of MechanismsCOURSE CODE : CEG444CREDITS : 3-1-0-4TYPE-WHEN : Engineering Elective, Monsoon-2014FACULTY NAME : Suril Vijay ShahPRE-REQUISITE : NoneMax.Limit : 40OBJECTIVES : With continuous evolution of technology and ever growing complexity of engineeringproducts, it is difficult to isolate electronics, computer science and mechanical streams. This has givenrise to mechatronics which essentially builds on the above three streams. Mechanism design is a veryimportant element of any mechatronics product design. The main objective of this course is exposingstudents to design, graphical synthesis and analysis of mechanisms. The course will also expose toimportant elements of mechanism building, such as gears, gear trains, bearings, cams, belts, chains,ropes, etc., and mechanisms for practical robots.
COURSE TOPICS:
Introduction to Design ProcessPurpose, History of mechanisms; Design, Invention, and Creativity; Performance Specifications;Ideation and Invention; Analysis; Detailed Design, Prototyping and Testing; Other Approaches toDesign; Human Factors Engineering.
Fundamentals of MechanismsClassification of Mechanisms/Linkages, Degree-of-Freedom and Mobility; Types of Motion; Links,Joints and Kinematic Chain; Number Synthesis; Mechanism and Structure; Standard Mechanisms;Isomers; Inversion of Mechanisms; Using Springs as Links; Practical Considerations; Motors andDrive, Selection of Electrical Motors, Air and Hydraulic Actuators and Solenoids.
Graphical Design and Synthesis (Putting Together) of MechanismsSynthesis; Function, Path, and Motion Generation; Limiting Conditions; Dimensional Synthesis; Quick-Return Mechanisms; Coupler Curves and Cognates (Similar mechanisms); Straight-Line Mechanisms.
Graphical and Algebraic Position AnalysisTranslation, Rotation, and Complex Motions; Graphical Position Analysis; Algebraic Position Analysis;Position of Any Point on a Linkage; Circuits and Branches in Linkages; Newton-Raphson SolutionMethod.
Velocity and Acceleration AnalysisDefinition of Velocity, Graphical Velocity Analysis; Velocity of Any Point on a Linkage; InstantCenters of Velocity; Graphical Acceleration Analysis.
Introduction to DynamicsNewton’s laws of motion; Mass and Mass Moment of Inertia; Lumped Parameter Dynamic Model;Equivalent Systems; The Principle of d’Alembert, Newtonian Solution Method.
Other Elements of Mechanism BuildingDesign of Cam Mechanism, Design of Gear Drive, Law of Gearing and Gear Trains; Rope, Belt andChain drives.
Mechanism Design for Practical RobotsIndustrial Robots; Wheeled Robots; Robotic leg; Four and Six Legged Robots.
PREFERRED TEXT BOOKS:1. Norton R. L, Design of Machinery: An Introduction to the Synthesis and Analysis of Mechanisms
and Machines. McGraw-Hill, New York (2011)2. Erdman A. G and Sandor G. N., Mechanism Design: Analysis and Synthesis, Vol. 1, Prentice Hall,
Englewood Cliffs, New Jersey (1984)
REFERENCE BOOKS:1. Ghosh A &Mallik A.K., Theory of Mechanisms & Machines, East West Press (2009).2. Uicker J.J, Pennock G.R. & Shigley J.E., Theory of Machines and Mechanisms, Oxford UniversityPress (2009).
3. Hartenberg R.S., Kinematic Synthesis of Linkages. McGraw-Hill, New York (1964).
PROJECT:The course will involve a mechanism design project. The students will conceptualize, design, analyzeand build a mechanism in the project.
GRADING:Mid-term 1 (15%), Mid-term 2 (15%), Final Exam (25%), Assignments (15%), Design Project (30%).OUTCOME:The course will equip students with theoretical and practical knowledge of mechanism design,synthesis and analysis. The students will also be involved in a project on mechanism building whichwill equip them for mechatronics product conceptualization, design and development.
REMARKS:The assignments will include several MATLAB based exercises. Another important element of thecourse assignments and project will be design and simulation of mechanisms using ADAMSsoftware, license of which is already being purchased by the institute.
TITLE : Differential EquationsCourse Code : IMA303CREDITS : 4TYPE-WHEN : Monsoon-2014FACULTY NAME : Dr. Shobha OrugantiPRE-REQUISITE : CalculusMax.Limit : 40
OBJECTIVE : To understand the basic concepts of elementary differential equations, tolearn to solve certain forms of first order and second order differential equations and applications. Tolearn Fourier series, learn some methods to solve problems in partial differential equations andboundary value problems.
COURSE TOPICS :
1. First order ODEs2. Second order ODEs3. Higher order ODEs4. Systems – Phase planes5. Laplace Transforms6. Series Solutions7. Fourier Series8. Partial differential equations and Boundary value problems
PREFERRED TEXT BOOKS:Goerge F. Simmons, Differential Equations With Applications and Historical NotesErwin Kreyszig, “Advanced Engineering Mathematics”, Wiley
*REFERENCE BOOKS:
*PROJECT:
GRADING:50% for 2 Tests and final exam25% for assignments25% for quizzes
OUTCOME:Upon successful completion of the course the student must be able to
1. Solve first order differential equations using the techniques of separation of variable,integrating factors, power series and Laplace transforms. Understand the existence anduniqueness
2. Use Euler’s method to approximate solutions for first order ODEs3. Find general and particular solutions of second order linear ODEs using the techniques of
undetermined coefficients, variation of parameters, power series and Laplace transforms.4. Solve homogeneous first order systems of linear ODEs5. Use direction fields, phase lines and phase portraits to qualitatively analyze the solutions to
differential equations.6. Fourier Series7. Partial differential equations and boundary value problems.
TITLE : Digital Image ProcessingCourse Code : CSE478Credits : 3-1-0-4Type-When : Monsoon 2014Faculty Name : Jayanthi SivaswamyPRE-REQUISITE: Signals and Systems, Linear Algebra, programming
OBJECTIVE : Digital images and their processing is the topic of this course. The course introducesthe necessary mathematical tools and techniques and examines different algorithms that have beendeveloped for processing and analysis of digital images.
COURSE TOPICS :1. INTRODUCTION: Goal of Image processing and computer vision, Human visual perception –
phenomena, Digital Image basics- Tessellation, Pixel and spatial resolutions, Image formation,Relations between pixels – neighborhoods, connectivity, distances, Basic problems in IP –enhancement, compression, restoration, image analysis.
2. SPATIAL DOMAIN PROCESSING: Point and neighborhood operations Image enhancementusing above operations – contrast stretching, histogram proc., filtering, Geometrictransformations, zooming.
3. IMAGE ARITHMETIC: Addition, subtraction, multiplication and division of images,Implementation issues.
4. COLOUR IP: Colour definitions and models, False and Full colour IP5. IMAGE TRANSFORMS: Basis images and expansion of images using them
6. IMAGE RESTORATION: Restoration vs enhancement, Type of degradations, Geometriccorrection, Linear degradation models – Inverse filtering, Deconvolution.
7. IMAGE COMPRESSION: Principles behind compression – types of redundancies, Entropy,compression ratios, SNR of compression, Lossy vs Lossless methods, Spatial approaches –Coding based, Transform based – DCT, JPEG.
PREFERRED TEXT BOOKS: Digital Image Processing by Gozalez and Woods; Addison-Wesley,Fundamentals of digital Image Processing by AK Jain; Prentice Hall
*REFERENCE BOOKS: Digital Image processing using Matlab by r Gonzalez; Addison-Wesley, ImageProcessing: The fundamentals by M Petrou; Wiley and Sons.
*PROJECT: Yes
GRADING: Assignments: Weekly computer-based assignments, and one final project developingsolutions to a specific problem/topic. (20 + 20)%Tests: 2 midsem exams 2 x 15 = 30%Final exam 30%
OUTCOME:
On completion of this course a student will have both theoretical and practical knowledge and skills of image processing techniques
ability to design algorithms for solving problems related to image processing.
TITLE : Disaster ManagementCourse Code : CES442Credits : 3-1-0-4Type-when : Monsoon-2014Faculty Name : Neelima SatyamPre-Requisite : NoneMax.Limit : 35
OBJECTIVE :1. To teach students about types of natural and environmental disasters.2. To help students to develop skills in various stages of disaster preparedness, mitigation andmanagement.3. To teach the students the methodologies for disaster risk assessment.
COURSE TOPICS :
• Natural Disasters Mitigation and Management – An Outline• Natural Hazard Evaluation, Mitigation and Preparedness• Earthquakes , Landslides and Tsunamis• Tornadoes, Cyclones, Floods , Drought• Disaster Awareness Education and Communication
UNIT I :Introduction- Natural Disasters - Natural Disaster Risk Assessment- Earth and its characteristics –Environmental Change and Degradation – Disaster mitigation, preparedness, response and recovery-comprehensive emergency management - Emergency Services- Natural Disasters, Environment andPublic Policy – Impact on Natural and Built Environments - Early warning systems and disasterPreparedness– Rehabilitation , Vulnerable Populations - Role Volunteers of National and Internationalagencies
UNIT II:Natural hazards - Mapping - Modeling, risk analysis and loss estimation – Natural disaster risk analysis- prevention and mitigation - Applications of Space Technology (Satellite Communications, GPS, GISand Remote Sensing and Information / Communication Technologies ( ICT ) in Early warning Systems- Disaster Monitoring and Support Centre– Information Dissemination – Mobile Communications etc.,
UNIT IV:Oceanic, Atmospheric and Hydrologic cycles - Severe Weather & Tornadoes, Cyclones, Floods andDroughts - Global Patterns - Critical Climate System Aspects and Processes- Mitigation & Preparation –Drought – Drought Assessment and Monitoring.
UNIT V:Organizational and Administrative strategies for managing large scale disasters — Administrativemechanisms , Community and Social organizations – Role of Regional and local administrative team -Vulnerability - catastrophic effects of natural hazards on human settlements - Education and Training– Establishment of capacity building among various stake holders – Government - Educationalinstitutions - Awareness training and short-term programs for critical population - Use of multi-mediaand press for disaster communication
PREFERRED TEXT BOOKS:
*REFERENCE BOOKS:1. Kovach, Robert L. Earth's Fury (1995), An Introduction to Natural Hazards andDisasters, Englewood Cliffs, N.J.: Prentice Hall.2. Alexander, David A. (1995), Natural Disasters. New York: Chapman and Hall.3. Bryant, Edward (1995), Natural Hazards,. New York: Cambridge University Press.4. Robinson, Andrew (1996), Earthshock: Hurricanes, Volcanoes, Earthquakes,Tornadoes and Other Forces of Nature, New York: Thames and Hudson.
*PROJECT:
GRADING:Assignment 20%Minor project 15% (different project for different groups with 3 students in each and it has to bepresented)Mid Exams 25% (written exam)Final examination 40% (written exam)
OUTCOME:1. Learn about the types of natural and environmental disasters and its causes.2. Develop ways and means by which a natural disaster effect is minimized.3. Learn about organizational and Administrative strategies for managing large scaledisasters.4. Learn about the early warning systems, monitoring of disasters effect and necessity ofrehabilitation.5. Learn about the engineering and non-engineering controls of mitigating various natural disasters.6. Understand the key roles of capacity building to face disaster among governmentbodies, institutions, NGO’s and other voluntary organizations at national and international level.
Title : Ecological ModelingCourse Code : Temp22Type-when : Monsoon-2014Faculty Name : Ramachandra Prasad
Course DescriptionThe course is an inter-disciplinary oriented program dealing with the application of theory andconcepts of ecology, statistic and computers for better understanding of the ecosystem.Introduces basic ecological concepts relating to species and community levels of ecosystem anddescribes their structural and functional aspects with focus on various descriptive and statisticalmethods to understand the phenomenon of ecological process and ecosystem services provided bythem. Also discusses the conceptual methods related ecological theories and concepts for suitableecological modeling and simulation studies.Course Objectives:
Understanding basic principles of ecology Significance of Ecosystem services Discuss in detail statistical techniques related to ecological understanding Habitat modeling aspects and simulation studies
Student Performance Objectives
By the end of the course students:Understands the basic ecological phenomenonCapable of using statistical methods in describing the ecosystemSimulate possible scenario of ecological processes (species level)Course ContentEcological ConceptsEcology – General Account(2 weeks) Environment – Climatic, Edaphic, Topographic, Biotic factors
Species and PopulationAnalysis of Communities
Community dynamicsEcosystem – Principles and concepts(3 weeks) Dynamics of Ecosystem
Production EcologyDiscussion: Papers related the ecological theories and processes by studentsStatistical Ecology (4 weeks)
Sampling designCommunity and sample diversityInvestigating spatial patternsSpecies Propagation ModelsAssociation and correlationOrdination – patterns and gradients among samplesClassification – comparing grouping samplesRelating data sets to environmental factorsDiscussion – papers related to above concepts
Climate change and Ecology (2 weeks)Concepts related Climate change and ecologyClimate effects on community production and diversityScenario based analysisDiscussion – Papers related to the theme
Landscape models & Simulation Studies (3 weeks)Introduction to Landscape modelsForest growth modelsCarbon and biomass modelsTree growth / structure simulationsPaper presentations by students on various simulation studiesProject presentations
Additional:Concepts of Ecological Economics, Ecological Foot printsCourse also includes Project work, where students utilize the contents (all / selected) discussed in thecourse for implementation of modeling or simulation studies of their choice.Reference BooksWaite S (2000) Statistical Ecology in Practice. A Guide to Analyzing Environmental and Ecological FieldData. Pearson Education.P. A. Henderson, “Practical Methods in Ecology” Wil.ey-Bl.ckwell | 2003 | onlineVerma V., 1991, A Text Book of Plant Ecology, Emkay Publications, New Delhi, India
TITLE : Economic Theories, Social Choice & PowerCourse Code : HSS463CREDITS : 4TYPE-WHEN : Humanities Elective, Monsoon 2014FACULTY NAME : Shobhit Mohan+Naresh Sharma
Description:The course is designed to introduce the students to economic reasoning and thinking, nature
of economic problem, and equip the student with basic tools of economic analysis and its conceptualapparatus. It also plans to introduce some of the long standing issues in theory of social choice andsome possible ways out of the conundrum. This will help in understanding the functioning of aneconomic system on the one hand and problems encountered, and policy analysis on the other hand.The course provides a wide coverage of concepts and basic tools as an introductory course and itpresumes no prior economic knowledge on part of the student. Intermediate (plus two) levelmathematics, in particular familiarity with basic calculus, sets, matrices etc. will be helpful.
Part I: (a) Nature of economic problem – and some important economic concepts; (b) Evolution andessential features of economic ideas from the mercantilists to contemporary economics. (3 lec.)
Part II: Macroeconomics – (Economic system at work and under stress): Functioning of an economy.Aggregate economic activity – Aggregate income, aggregate consumption, aggregate savings andaggregate investment and their inter-relationship; concept and measurement of national income;Concepts and objectives of economic policy (fiscal, monetary, trade, industrial). Problems ofunemployment and inflation. (3-4 lec.)
Part III: Microeconomics – (Basic tools of economic decision making in a capitalist economy: Market,demand and supply for a single good): (a) Consumer theory: preference relations and their properties,utility maximization, demand – meaning, types, factors, consumer surplus; (b) Production and costtheory: profit maximization, laws of returns to scale and variable proportions, cost concepts, short-runand long-run cost-output relation and supply function; break-even analysis; economies of scale andscope. (c) Market structures – perfect competition, monopoly, monopolistic competition and oligopolyand the theory of firm; Critique of neo-classical theories of firm and alternative theories of firm;Pricing in practice. (d) Theory of distribution: markets for factor inputs - wages, rents and profits. (e)Concept of general equilibrium. (f) Externality – public goods. (10 lec.)
Part-IV Theory of Social Choice - An outline (without the rigorous formal treatment ), including but notnecessarily limited to, individual choice and social choice, Arrow’s General Possibility Result and theunderlying philosophical motivations, and some results (primarily MMD) that try to bypass the GeneralPossibility Result. (4 lec.)
Part-V Power - Importance of institutions and the role of power in social interactions;, effect oneconomic outcomes; some issues of development. (4-5 lec.)
Basic Readings:
Lectures, discussions form the basic material for the course. Some of the books and other materialuseful for the course are provided below. Many of these are alternative sources for one another (e.g.books listed as (1) and (2)) and all of it is not essential reading. Wider list of readings is provided toallow students to have a selection of their own.
1. Samuelson and Nordhaus: Economics, Tata MacGraw Hill.2. Case and Fair: Principles of Economics, Pearson Education Asia.3. Koutsoyiannis: Modern Microeconomics, Macmillan4. Hal R Varian: Intermediate Microeconomics, East west Press.5. Mas-colell, Whinston and Green: Microeconomic Theory, Oxford Univ Press.6. Abel and Bernake: Macroeconomics, Addition Wesley.7. Edward Shapiro: Macroeconomic Analysis, Galgotia.8. Branson: Macroeconomics, Harper and Row Publishers.9. Central Statistical Organisation (GoI): National Accounts Statistics.10. Government of India: Economic Survey.11. Dutt and Sundaram: Indian Economy, S Chand and Co.12. Schaum Series books in Microeconomics and Macroeconomics for problem solving.13. Maurice Dobb: Theories of value and distribution since Adam Smith, Vikas Publishing House
Pvt Ltd.
Xeroxed/ mimeo material:-Lecture Notes on Managerial Economics by Naresh Sharma-History of Economic thought by Naresh Sharma-Parts of Eric Roll: History of Economic Ideas, Oxford Univ Press.
Further references will be supplied during the course according to topics covered. The firsttwo above cover wide spectrum of topics both micro- and macro- economics. The next three are onmicro and then the next three on macro. There are other basic books on economics (including thetopics covered here) in the library. Any of them can also be consulted on the relevant topics coveredin the course.
Grading Policy:Two Mid Sem Exams (25% each), End Sem (50%)
TITLE : Game Design and EngineeringCourse Code : CSE464
OBJECTIVE : The course introduces aspects fundamental to game design, genres,technology analysis and development for market. The course gives equal emphasis to digital, boardand physical games
COURSE TOPICS : This course is designed to introduce the critical aspects of games design anddevelopment. Students will go through a structured process involving theory and practical classes tounderstand game development. Equal emphasis is given to non-virtual or digital games includingboard games, electronic games like rhythm mat and/or games that require physical devices. The maingoal is to get create patentable ideas. The theory classes will cover aspects like theme, narrative,technology(single player versus multiplayer, managing data, rendering etc.,), game play, playerexperience, material analysis in the case of physical games, marketing and animation. In game play,basics like game engine (digital) and game logic models will also covered. Experts from industry willcover animation and certain topics in marketing. In the lab class, the teams will huddle toconceptualize the idea, structure the game design documents, present their ideas and finalizetechnology issues. The secondary or even primary goal in some cases is to use of CAD/CAM like toolsto come up with schematics of any physical implement required for the game and actually solder, cut,fabricate and paint ….
Syllabus (theory classes)
1. What is a game?- Games Overview - A Theory of Fun; History of Games.- History of Computer Games
2. What are the elements of a game?In this part, we cover the elements of a game, with emphasis on the four major ones. Case studies ofgames in which one or more of these elements have made the game will be analysed.- Mechanics: rules & procedures of the game.- Story: events that bind the game together.- Aesthetics: game’s look, feel and sounds.- Technology: high-technology to materials (paper, sensors, wood etc.,)
3. Principles of Game Design:-Layers of Game Design- Design Issues- Preproduction and Documentation- Design Trade Offs- Poor DesignEnd of this part, the Game Design Document is prepared.
3. Who is the player?- Game Genre and player- Cutting through the noise from player (likes, dislikes...)
4. What is player's experience?- measuring player’s experience- Cognitive behavior measurement techniques
Understanding and measuring player’s experiences during game play is an important test for optimalgame designs. Player’s experiences are recorded by many techniques. This part will analyze each of
the technique and the value addition of each. Some experimental work will be required using tools likesimple EEG, ECG/GSR and eye tracking.
5. How to design game mechanics?- Decision-making, types of decisions- Flow theory.- Special dynamics: feedback loops, emergence and intentionality
6. What’s game interface?- User Interface design.- Differences between digital and non-digital UI.- User Interface iteration
7. How to create a game script/story?- Linear & Nonlinear storytelling
8. Building a game with technologies-Analysis of game engines (Unity, XNA)- AI versus HI in game development.- Computer graphics & animation- Physics engine –collision detection
9. Testing a game.- Solo testing.- Critical analysis- Designer testing.- Player testing
10. Marketing the game
11. Ethics, Culture, Violence in Games and Responsibilities
PREFERRED TEXT BOOKS:1. The Art of Game Design, Jesse Schell, 2008. 2. Challenges for Game Designers, Brenda Brathwaite
*REFERENCE BOOKS:1. Characteristics of Games, Elias, Garfield, and Gutschera, 2012, MIT Press2. Game Design and Development: Introduction to the Game Industry. Moore, Michael.
Reference papers on serious games, board games, swarm/biological behavior, cognition and gamesetc.,
*PROJECT:Each team of 3 will conceptualize, design, prototype and test 2 unique games .
Number of Project: 2
P1: Design and prototype a board game that explains a concept. This can be trading, friendship,education, jobs, global trade, social media etc., think on the lines of games like monopoly, go, chessetc., Use readily available material to make the prototype. Game play, rules and player demographicswill make up your report.
P2: Design and develop/engineer a game virtual or live-action game that can be used for physicaltherapy. Virtual game – for carpal tunnel syndrome (look up the web for this occupational hazard).Live-action game: which can help people exercise their lower back (a major issue with people who sit
for long hours)? Materials for the virtual game can include Kinnect or joy sticks. Interfaces need beassembled. For the live-action, raw materials which are readily available need to be used and alsofabrication like injection molding should be avoided. Sensors can be used, if electronic games areselected.
OUTCOME:At least couple of design patents. Selected games ideas to the annual Game Developer Conference,transfer/license and most importantly connecting theory to practice/real product
REMARKS:The course requires a lot lab type of work. Considering that animation experts and animators are notavailable, some creativity is encouraged to create avatars, characters for the digital games andlayouts for the physical games. Half of the class hours will be in a lab room or work space. This spacewill be kept open throughout the semester for students to work at any time.
Maximum number: 30 (10 teams)
TITLE : Game Theory for Computer ScienceCourse Code : CSE593CREDITS : 3-1-0-4TYPE-WHEN : Monsoon-2014FACULTY NAME : Dr. Ganesh Iyer, Progress SoftwarePRE-REQUISITE : Computer Networks, Distributed Systems
OBJECTIVE : The aim of this course is to introduce students to the novel concepts of gametheory with special emphasis on its applications in current day Computer Science domains includingCloud computing systems, social media analytics, security mechanisms and Internet marketingstrategies.
COURSE TOPICS :Game theory is the mathematical modelling of strategic interaction among rational (and irrational)agents. Beyond what we call 'games' in common language, such as chess, soccer, etc., it includes themodelling of conflict among nations, political campaigns, competition among firms, and tradingbehaviour in stock markets. There has been a remarkable increase in the usage of game theory andmechanism designs for computer science applications in the past decade.
In computer science game theory and mechanism design are used as a way to solve optimizationproblems in systems where participants act independently and their decisions change the wholesystem. Application areas include, communication networks, artificial intelligence systems, distributedsystems such as grid and Cloud computing paradigms, network security, online systems such as eBay,Google keyword auctions etc. This course aims to provide basic understanding of various game-theoretic concepts (non-cooperative games, cooperative games, mechanism design concepts) and itsapplication in different solution architecture domains. After this course the students should be able tomodel several real situations using game-theory and design solutions (mechanisms, algorithms,protocols etc.) that are robust even in presence of "self-centred" entities.
Topics:Basic concepts, definitions, utilities, classification of games, classic examples, typical applicationscenarios. Non-cooperative games: Extensive form games, dominant strategy equilibrium, Nashequilibrium and related concepts, Cloud market pricing and usage modeling through extensive formgames. Repeated games: monitoring, discounting, Cloud provider’s reliability. Congestion games:Energy minimization in mobile cloud computing. Robustness: Non-cooperative games for Cyberphysical systems (e.g. Cloud Computing systems) . Bargaining Theory: Resource allocation in Cloudcomputing, Multimedia resource management. Coalitional Game theory: Revenue maximization inMobile Cloud networks, cooperation between multiple networks. Mechanism design: Incentive
compatible mechanisms, profit maximization, cost sharing, pricing and investment decisions inInternet. Auction Theory: Social media marketing (Google, Facebook), Cloud brokers, online auctions(eBay), sponsored search. Crowdsourcing and Schelling’s Theory of Self-Command. Security Games:Defense –attack interactions, security and dependability measurement, assessing and managingsecurity risks. Network Games: Routing, flow control, congestion control, revenue sharing betweenInternet service providers. Coordination games – Sustaining marketer-consumer cooperation.Miscellaneous topics: Future directions and remarks, Recap.
PREFERRED TEXT BOOKS:Game Theory in Wireless and Communication Networks: Theory, Models, and Applications, Zhu Han,Dusit Niyato, Walid Saad, Tamer Baar, Are Hjørungnes, Cambridge Publications, 2011
*REFERENCE BOOKS:
1. Social Media Marketing: Game Theory and the Emergence of Collaboration, Eric Anderson,Springer, 2010.
2. Game Theoretic Problems in Network Economics and Mechanism Design Solutions, Y. Narahariet. al., Springer 2009.
3. Dynamic Pricing and Automated Resource Allocation for Complex Information Services,Michael Schwind, Springer 2007.
4. Games and Decision Making, Charalambos D. Aliprantis and Subir K. Chakrabarti, Oxford Press2010.
5. Computational aspects of Cooperative game theory, Georgios Chalkiadakis, Morgan andClaypool Publishers, 2012.
6. Game Theory in Communication Networks, Josephina Antoniou, CRC Proess, 2012.7. Algorithmic Game Theory, Noam Nissan et. al., Cambridge University Press, 2007.8. Lectures in Game Theory in Computer Scientists, Krzysztof R. Apt, Erich Grädas, Cambridge
University Press, 2012.
*PROJECT:1. Students will be given a specific computer science problem and will be asked to come up with anapproach/algorithm to solve the same. Later they will be required to implement/simulate to solveusing the proposed algorithm
2. Students will be given some of the current day game theory applications (e.g. pricing strategiesamong Cloud products: Revenue models) and asked to analyze and understand different gametheoretic approaches to solve the same problem to achieve different objectives
GRADING:2 quizzes (5%+5%), Mid-term (25%), Assignment (25%), Final Exam (40%)
OUTCOME:Knowledge on game theory, understanding of modern computer science problems and use cases fromthe game theoretic point of view, ability to model real-world situations such as social mediamarketing, social analytics and Cloud computing issues using game theory, design robust and efficientsolutions (mechanisms, algorithms, protocols) that would work for agents that are rational andintelligent.
Title : GENOMICS AND PROTEOMICSCourse Code : SCI423TYPE-WHEN : Monsoon-2014FACULTY NAME : V.Shridevi
ObjectivesThis course aims to make the students understand the concepts of genomes and proteomes. Itdescribes in details the tools required for genome and protein sequencing.
Outcome
Students will gain knowledge about how DNA and protein sequences are obtained, the tools requiredin sequencing. They will also learn about the human genome project and also applications ofproteomics in drug discovery.
UNIT – 1INTRODUCTION: Structure and organization of prokaryotic, eukaryotic and human genomes. Humangenome project. Mitochondria and chloroplast genomes – organization and function.
UNIT – 2
SEQUENCING HUMAN GENOME: various sequencing technologies, partial sequencing for mapping,gene identification, from sequence drafts to complete final sequences. Genomic and c-DNA libraries,NGS and meta genome sequencing.
UNIT – 3MAPPING AND SEQUENCE ASSEMBLY: Mapping strategies - linkage maps, physical maps, low and highresolution physical mapping. Genetic markers – RFLP, VNTR, physical markers, ESTs, SNPs.
UNIT – 4PROTEOMES: Definition of proteomes, genome-proteome relationship, deducing proteome fromgenome. Role of proteins in cells: structural and functional protein families.
UNIT – 5TOOLS OF PROTEOMICS: Iso-electric focusing, two dimensional protein gels, HPLC, MALDI- TOF, massspectrometry, tandem mass spectrometry, protein sequencing and peptide fingerprinting.
UNIT – 6PROTEOMICS APPLICATIONS: Obtaining and evaluating gene expression profiles with microarrays.Protein-protein interactions in -vivo, yeast and mammalian two hybrid systems. Applications in drugdiscovery.
REFERENCES:
1. Introduction to proteomics: tools for new biology by Daniel C. Leibler (2002), Humanpress.
2. Genomes 2 by Terence Brown (2002), Oxford: Wiley-Liss.3. Principles of gene manipulation and genomics (seventh edition) by S.B. Primrose and R.M.
Twyman, Blackwell publishing.4. Human molecular genetics 2 by Tom Strachan and Andrew P. Read, John Wiley & Sons.
Course Title : Green BuildingsCourse Code : CEG422Credits : 4Type/ When : Monsoon-2014Faculty name : Vishal GargMax.Limit : 40
Objective:1. To understand impact of building on environment and human beings2. To understand the concept of high performance green buildings and sustainability3. To understand various green building rating systems such as LEED NC, LEED O&M, GRIHA,
ASHRAE Standard 189.1 – Standard for the Design of High Performance Green Buildings4. To apply the learning by case study: Evaluate IIIT campus for green building design and
operations
Course Topics: Conventional building impacts Introduction to Green Buildings Impacts of building construction, operation and disposal The green building process and assessment Ecological design
Sustainable sites and landscaping Energy efficiency in buildings Renewable energy Water conservation Sustainable and alternative materials Indoor environmental quality Construction Operations and Building Commissioning Certification Systems Sustainable Operations Economic issues and future directions in green building
Project work: Each student will evaluate an aspect of the IIIT campus from the point of view of arating system and will submit his/her assessment and recommendations.
Site Visits:Site visit(s) to building(s)/campus(es) in Hyderabad which are designed or operated in sustainablemanner. Students will have to submit their individual site visit reports.
Preferred Text Books:1. Sustainable Construction: Green Building Design and Delivery, Second Edition, Charles Kibert,
John Wiley and Sons2. The Integrative Design Guide to Green Building: Redefining the Practice of Sustainability, Bill
Reed, John Wiley and Sons3. ASHRAE Standard 189.1 – Standard for the Design of High Performance Green Buildings4. LEED Reference Guide for Green Building Design and Construction5. LEED Reference Guide for Green Building Operations and Maintenance
Reference Books:1. The Green Studio Handbook: Environmental Strategies for Schematic Design, Alison Kwok ,
Walter Grondzik, Elsevier2. Carbon-Neutral Architectural Design, Pablo M. La Roche, CRC Press3. Green Building: A Professional's Guide to Concepts, Codes and Innovation, Anthony C. Floyd,
International Code Council4. Green Building Fundamentals (2nd Edition), Mike Montoya, Pearson Education5. Fundamentals of Integrated Design for Sustainable Building, Marian Keeler, Bill Burke, John
Wiley and Sons
Grading:Mid-term exams = 10%+10%Report on Site Visit(s) =5%Attendance in the Invited lectures/seminars = 5%Project work and presentation=20%End semester Exam=50%
Outcome:Students will get an overview of green building design and operations. They will also understandvarious rating systems and will apply these to evaluate sustainability of the campus.
Remarks:1. Maximum 30 students will be permitted to register for the course.2. Course will be heavy and would need lot of reading.3. There will be several lectures from various experts besides the regular class hours. Students
are expected to attend them.
TITLE : Information Theory and CodingCourse Code : ECE539Credits : 3-1-0-4
Type-when : Monsoon-2014Faculty Name : Dr.Prasad KrishnanPre-Requisite : Basics of Electrical CommunicationLimit : 40 :: UG-30, PG-10. If more students regd, selection based on the CGPA.
OBJECTIVE : To develop good understanding of the mathematical / statistical theory ofcommunication
COURSE TOPICS :
(1) Introduction: Basic communication system models: discrete and continuous
(2) Measure of information: entropy, relative entropy, mutual information.
*REFERENCE BOOKS:1. Visual intelligence: how we create what we see by Donald Hoffman2. Phantoms in the brain by Ramachandran and Blakeslee
*PROJECT: YES
GRADING: No Exam, Weekly Reports, Term Paper and Project
TITLE : Introduction to Middleware SystemsCourse Code : CSE463
Credits : 3-1-0-4Type-When : Monsoon 2014Faculty Name : Ramesh LoganathanPre-Requisite : Good understanding of Java/C/C++, OS, Network Knowledge of Java will be helpful
OBJECTIVE : The course aims to provide students with a high-level understanding of modernmiddleware technologies and insight into fundamentals of middleware internals. Emphasis will be on ahands-on exploration of the technology.
COURSE TOPICS: Scope & Delivery Approach Combination of lectures, discussions and programmingproblems An effort will be made to keep the course content updated based on contemporarydevelopments.
Expected Learning:• Understand essence of middleware and distributed object technology• Overview of middleware architectures• Understanding of RMI, CORBA, .NET• Describe clearly the J2EE/EJB architecture• Service Oriented Architecture• Understand of WebServices• Compare different middleware technologies- CORBA, .NET & EJB/J2EE• Develop small projects to understand middleware’s
.Course Outline:• What is middleware?o Dsitributed computing, Overview of technologies & players.o Evolution of middlewares• The basics- RPCs• Distributed Objects- CORBAo Middleware supporting distributed object. The CORBA Architecture;• Java & Middlewareso Java RMI, Dynamic Proxies (JDK1.5)• Distributed Components- Web• Distributed Components- EJB• Web Services infrastructureo Distributed computing over interneto SOAP; Web Services; Security; ++• Jini, JavaSpace and JMX• Future Trends in Middleware
Discussions (Seminar):Topics will be assigned thru the course. Teams will be formed in the beginning. Tentative topics (for2005):• Effecting SOA using current middleware technologies1. J2EE2. .NET3. MOM4. Proprietary (homegrown)• Security framework in distributed applications1. SOA & Security2. Webservice based security related standards coming up3. Application design good practices• Application architectures around Web Services• Mobile computing infrastructure & Java
*REFERENCE BOOKS:Suggested Reading:• Roman, Mastering EJB, 2e, Wiley, 2002, {useful for programming with EJB.}• Emmerich, Engineering Distributed Objects, Wiley, 2000
• Information on: http://www.corba.org/ http://java.sun.com/j2eehttp://java.sun.com/products/ejb/
Java Learning• Reference Book- Core Java Vol-1, Cornell & Hostman (available in IIIT library)• Java tutorial: links & lab exercises will be providedo From- developer.sun.java.com/
*PROJECT:Mini-projects (samples)• Implement Java RMI without using RMI (subset- we will spec)• Basic TP monitor (use RMI underneath) (we will spec)• Serialization of objects• Simple XML over http based RPC• HTTP based RPC (any representation protocol)• Async messaging system (we will spec it out)• Case- propose a solution a simple supply chain• Case- propose a simple solution for business to business data interchange
GRADING:• Quizzes (objective)-. Six (Best Four. 5% each)- 20%• Labs (Best 4- 5% each)- 20%o Each lab assessed only if present in next class• Seminars- 5%• CP- 5%• Mini project- 20%1. Project idea/spec- 5%2. Design- 5%3. Code assessment- 5%4. Running as per spec (QA)– 5%5. Assessment by team members- 10%o Ex: Basic RPC system? In Java; without using RMIo Systems (no apps)o Any area middlewares• End exam- 30%• 8 groups (3-4 each) for seminars & projects
REMARKS:• -.Java tutorial is very important (there will be a surprise lab & quiz)
- All labs are important/ assessed or not.o Project will be very difficult without the labs. Most students last year got low marks inproject due to them ignoring the labs!
- CP expectation is absolute.o Unless everyone attends and interacts in all classes, CP is not assured.o It will be my discretion to choose in which class(es) to assess this. Last year there wasWeightage for attendance, general interaction, and interaction in 2 specific classes.o This year also CP will be on these lines only.
- While I will not remind, there is serious weightage for interaction in the class.o Whether prompted by the instructor or not, you will need to ask a lot of questions.o Apart from the assessment weightage, this interaction is the biggest value we bring tothis course. More you ask better you learn!
- The PPTs used in the lectures is more as a reference/guide. The lectures may not cover allthe slides. You are expected to review the PPT later and revert back with any questions.
- The lecture topics are organised in a logical sequence. Continuity will be only w.r.t thatsequence. But each lecture is independent. I will come more often to ensure there is anunderstanding of the continuity.
TITLE : LINEAR CONTROL SYSTEMSCourse Code : ECE451Credits : 3-1-0-4Type-When : Monsoon-2014Faculty Name : Rambabu KallaPre-Requisite : None
COURSE TOPICS: Introduction to Control Systems, The Laplace Transform, Mathematical Modellingof Dynamic Systems, Transient and Steady State Response Analyses, Root Locus Analysis FrequencyResponse Analysis. The course will also involve modeling systems through SolidWorks, dynamicsimulation of such systems using MS Visual Nastran and control of systems through aSimulink/MATLAB interface to Nastran.
PREFERRED TEXT BOOKS: Modern Control Engineering by K.Ogata.
*REFERENCE BOOKS: Modern Control System Theory by Gopal Also Control Systems Book byNagrath and Gopal.
*PROJECT: Course project will be there.
GRADING: Home Work -10 %, 2 Mid Terms - 25%, Project - 25 %, Final- 40%
TITLE : Machine LearningCourse Code : CSE577Credits : 3-1-0-4Type-When : Monsoon-2014Faculty Name : Shailesh Kumar, Googlepre- requisite : NoneCOURSE TOPICS: Machine Learning is the study of compute algorithms that improve automaticallthrough experience. This course will expose various machine Learning, Paradigm- Concept learning,Decision trees, Neural Networks, Instance based learning, Reinforcement learning, Bayesian learning,etc. This course will also introduce fundamentals to analyze the learning schemes for convergence,correctness and generalization.
PREFERRED TEXT BOOKS: In Tom M. Michell “ Machine Learning” McG Hill; In Duda, Hart & storx,“Pattern Clarification”, Wiley 10-15 research papers. Mandatory Project: A Project involving significanttheatrical or Practical aspect of machine learning Pre-requisites: Pattern Recognition, AI, Algorithms.
TITLE : Mobile RoboticsCourse Code : CSE483Credits : 3-1-0-4Type-When : Monsoon - 2014Faculty Name : K. Madhava KrishnaPre-Requisite : None
COURSE TOPICS: This course provides you a working level understanding of the five basic pillars ofplanar wheeled robots namely localization, mapping & exploration, SLAM, planning and collisionavoidance. The course shall comprise of simulation and experimental components. The experimentalcomponent will be either an implementation of a SLAM module (only for one group) on the robot or allthe other modules such as Localization, Mapping and Navigation (all other groups.
Week 1: Introduction + Basic problemsW2: Map-building (segment based and grid based maps)W3: Map building : Hybrid Maps and Maps based on sensor fusionW4: Global LocalizationW5: Local LocalizationW6: Exploration (frontier and entropy based techniques)W7: Introduction to SLAMW8: Planning in low dimensional spaceW9: Probabilistic planning techniquesW10: Planning under constraints
PREFERRED TEXT BOOKS:1. Probabilistic Robotics by Thrun, Burgard and Fox (1 copy available in library)2. Computational principles of Mobile Robots by Dudek and Jenkin (1copy available in library)3. Autonomous Mobile Robots by Nourbhaksh and Siegwart (8 copies)
*PROJECT:The project would be announced very early in W2. or W3. Project would be divided amongst teams,each team doing a particular part. Finally integrated testing both in simulation and actual robot willhave to be shown.
TITLE : Natural Language ProcessingCourse Code : CSE472CREDITS : 3-0-1-4TYPE-WHEN : Monsoon-2014FACULTY NAME : SP KishorePRE-REQUISITE : Intro to NLP
OBJECTIVE : This is the advanced course in Natural Language Processing intended forhonors, dual degree, BTP, MTech and PhD students.
COURSE TOPICS : In this course, students get an overview of various areas in NLP and the currentresearch trends in each of them. The topics covered include machine translation (rule based &statistical), discourse, statistical parsing, word sense disambiguation, natural language generation,coreference resolution, semantic role labeling etc.. The course also covers two of the most popularmachine learning methods (Expectation-Maximization and Maximum Entropy Models) for NLP.Students would be introduced to tools such as NLTK, CoreNLP to aid them in their research.
*PROJECT: There will be a mini project and research readings once every alternate week.
TITLE : Non-ViolenceCourse Code : HSS354CREDITS : 3-1-0-4TYPE-WHEN : Humanities, Monsoon 2014FACULTY NAME : Nand Kishore AcharyaPRE-REQUISITE: None
OBJECTIVE: The course dealing with analysis of causes and forms of violenceattempts to understand non-violence with its various forms as Law ofLife and its relevance to present day socio-economic-politicalstructures.
COURSE TOPICS: - Conceptual understanding of violence and non-violence- Is violence innate?- Psychology of non-violence- Structural violence and its forms- Instrumental or revolutionary violence- Religious philosophies and non-violence- Secular metaphysics of non-violence- Wholistic concept of science- Non-violent view of history- Towards non-violent structure – Economy, Technology and Environmental ethics- Distribution of profit and question of ownership- Decentralization of political power- Non-violent resistance- Non-violent communication- Thinkers of Non-violence - Tolstoy, Thoreau, Mahatma Gandhi
PREFERRED TEXT BOOKS:
*REFERENCE BOOKS:Violence and its Causes —UnescoSubverting Hatred —ed. Daniel L. Smith ChristopherPower of Non-Violence —Richard B. GreggThe Politics of Non-Violent Action —Gene SharpPeace by Peaceful Means —Johan GaltungNon-killing Global Political Science —Glan D PageEssays is Gandhian Economics —ed. Romesh Divan andMark LutzThe Closing Circle: Nature, Man and Technology —Barry CommonerMyth of the Machine (2 vols)—Lewis MumfordSmall Is Beautiful —E.F. SchumacherLaw of Love and Law of Violence —TolstoyOn Civil-disobedience —ThoreauSelections from Gandhi —Nirmal Kumar BoseWholeness and Implicate Order —David Bohm
*PROJECT:
GRADING:Midterm Exams - 30%Assignments - 30%Presentations and Projects - 40%
OUTCOME: After completing the course the student would be able to understand the violenceunderlying past and present-day structures. He/she is likely toappreciate the necessity of developing non-violent outlook and techniques for establishing a just andpeaceful social order committed to welfare of each and all
REMARKS: Films and literary pieces etc. may also be used to feel and understand the power of Non-violence.
TITLE : Number Theory and CryptologyCourse Code : IMA404Credits : 3-1-0-4Type-When : Monsoon-2014Faculty Name : Rajat TandonMax.Limit : 40Pre-Requisite : A little bit of abstract algebra including the basic concepts of groups, rings and fields.Concept of limit in real analysis. A little bit about matrices.
OBJECTIVE: To introduce the students to the number theoretic aspects of Cryptography
COURSE TOPICS: Finite Fields, Legendre Symbol, Euler's Theorem, Polynomial time algorithm,Primality Testing, Carmichael Numbers, RSA and discrete log, an Introduction to the use of EllipticCurves in Cryptology.
PREFERRED TEXT BOOKS: An Introduction to Number Theory and Cryptography by Neal Koblitz(Springer)
*REFERENCE BOOKS: Cryptology by Stillwell
*PROJECT: No project
GRADING: On the basis of two tests 25 marks each and a final exam of 50 marks
TITLE : Parallel ProgrammingCourse Code : CSE502Credits : 3-1-0-4
Type-when : Monsoon-2014Faculty Name : Prof.R GovindarajuluMax.Limit : 20
COURSE TOPICS :1. Introduction to Parallel Computing; Parallel Programming Platforms; Parallel Architectures.2. Parallel Algorithm Design; Analytical Modeling of Parallel Programs; Performance Analysis.3. Message-Passing Programming. Message Passing Model; Message Passing Interface. MPI CollectiveCommunicative and Computation Operations.4. Shared-memory Programming. Shared-memory model. Thread Basics Synchronization. OpenMP.Specifying Concurrent Tasks in OpenMP. Synchronization constructs in OpenMP.5. Floyds Algorithm; Matrix Multiplication Solving Linear Systems, Sorting and Graph Algorithms.
PREFERRED TEXT BOOKS:1. Michael J. Quinn Parallel Programming in C with MPI and OpenMP TMH 2003.2. Ananth Grama, Anshul Gupta, George Karypis and Vipin Kumar Introduction to Parallel ComputingPearson (Education) Second Edition 2003.
*REFERENCE BOOKS:1. David E Culler, Jaswinder Pal Singh with Anoop Gupta Parallel Computer Architecture - AHardware/Software Approach Elsevier 1999.2. Gregory R Andrews - Foundations of Multithreaded, Parallel, and Distributed Programming –Addison Wesley 2000.3. William Gropp, Ewing Lusk and Anthony Skjellum Using MPI Portable Parallel Programming with theMessage-Passing Interface, MIT Press Second Edition 1999.4. Peter S Pacheco - Parallel Programming with MPI, Morgan Kaufmann Pub 1997.5. Rohit Chandra et.al Parallel Programming in Open MP Morgan Kaufmann Pn 2001.6. Harry F Jordan and Gita Alaghband, Fundamentals of Parallel Processing Pearson Education 2003.7. Gregory V Wilson, Practical Parallel Programming PHI 1999.8. Barry Wilkinson and Michael Allen, Parallel Programming. Techniques and Application usingNetworked Workstation and Parallel computers. Pearson Education 1999.9. Shameem Akhter and Jason Roberts, Multicore Programming Increasing Performance throughsoftware Multi-threading Intel Press 2006.10. Timothy G Mattson, Beverly A Sanders and Benna L Massingill, Patterns for Parallel ProgrammingAddison-Wesley 2005.11. Michael J Quinn, Parallel Computing TMH 2002.12. Bil Lewis and Daniel J. Berg, Multithreaded Programming with Pthreeds Sun Minosystems Press1998;
REMARKS: Concurrency: Process, synchronization, semaphores, locks and monitors, Transactionalmemory.
TITLE : Phonetics and PhonologyCourse Code : CLG413Credits : 3-1-0-4 (= credits - hours per week – tutorials - lab sessions)Type-When : Monsoon 2014Faculty Name : Professor Peri Bhaskara raoPre-Requisite : None
OBJECTIVE: To teach the fundamentals of speech sounds of Indian languages, their patterning inhigher level processing in phonology, morphophonology etc.
COURE TOPICS: Speaking and Writing: Relationship between spoken sound, written letters of a script, and
abstract units such as Phonemes. Transcription and transliteration. Organs of Speech and Transcription: Sagittal section of human head showing the Organs of
Speech; Principles of transcription. Speech Production Mechanisms: The four processes – Airstreams, Phonation, Ori-nasal,
Articulation. Airstreams: Chamber and initiator; Pulmonic, Glottalic, and Velaric Airstreams; Egressive
and Ingressive types.
Articulation: Various Places and Manners of articulation (stricture types). Median and Lateralairflow Phonation (States of Glottis): Voicelessness, Modal Voicing, Breathy voicing, Creakyvoicing.
Ori-Nasal Process: Oral, Nasal and Nasalized sounds. More Details of Articulation: Aspiration; Median and Lateral Airflow; Simple and Complex
Articulations – Double Articulation and Secondary Articulation. Vowels and vocoid articulations: Parameters for classifying various vowels; Concomitant
features of vowels: Nasalization, phonation types. Suprasegmentals: Pitch, Loudness, and Duration. Their articulatory, perceptual and linguistic
correlates. Syllable: Vowels, Consonants, Semi-vowels and Syllabic Consonants; Stress and Tone. Phonemics: Phonemes, and Allophones; Principles of Contrast, Context-Dependent
Distribution, and Free- variation; Neutralization of Contrast; Problem solving in Phonologyand Preparation of Coherent Phonemic Inventory from a given Data Set along with Rules forderiving various Allophones in the data.
PREFERRED TEXT BOOKS: Ladefoged, P., & Johnson, K. (2011). A course in phonetics (6th ed.).Boston, MA: Wadsworth, Cengage Learning.Catford, J. C. (1988). A practical introduction to phonetics. Oxford: Oxford University Press.Abercrombie, D. (1967). Elements of general phonetics. Edinburgh: Edinburgh University Press.Pike, K. L. (1947). Phonemics: A Technique for reducing languages to writing. Ann Arbor: University ofMichigan Press.
REFERENCE BOOKS: Laver, J. (1994). Principles of phonetics. Cambridge: Cambridge University Press. Ladefoged, P., & Maddieson, I. (1996). The sounds of the world's languages. Oxford:
Blackwell. Pike, K. L. (1972). Phonetics. A critical analysis of phonetic theory and a technic for the
practical description of sounds. Ann Arbor: University of Michigan Press. Tatham, M., & Morton, K. (2011). A guide to speech production and perception. Edinburgh:
Edinburgh University Press. Clark, J., & Yallop, C. (1995). An introduction to phonetics and phonology (2nd ed.). Oxford:
Outcome: The successful pupils are expected to be equipped with the capacity to understand thedetails of production mechanisms of different speech sounds of Indian languages and the skill set fordeveloping phonological rules for a given coherent phonetic data set.
Remarks:ELECTIVITY: This is an Elective course and can be taken by 3rd Year or 4th Year undergraduatestudents or by any Postgraduate students.ASSIGNMENTS: Consist of all or some of the following types: Descriptive assignments; Waveformand/or spectrogram labeling of sounds and sound segments; Problem solving in phonology.
TITLE : Principles of Programming LanguagesCourse Code : CSE415Credits : 3-1-0-4Type-when : Monsoon 2014Faculty Name : Venkatesh ChoppellaPre-Requisite : Discrete Mathematics (with some knowledge of sets and predicate logic).Programming in any programming language. Exposure to a strongly typed object-orientedprogramming language like Java would be useful, but not necessary.
OBJECTIVE:
This course is an introduction to the principles behind the design of programming languages, includingobject-oriented programming, and the use of formal methods in reasoning with programs. How does aprogram run? One way to answer this question is to understand that programs are translated(compiled) into another, lower-level language, which is executed by hardware. In this course, we takea different, but related approach. We build a series of interpreters, each a mini abstract or virtualmachine for a specific language. Using this approach we study standard features of procedurallanguages like scoping, stack architectures, parameter passing, and also more advanced features likecontinuations, threads, and type reconstruction and generic types, and, finally, object orientedprogramming. However, this is not a course on object-oriented programming; we will, instead, learnhow OO languages are implemented and designed.All the interpreters we write in this course will be in the Scheme programming language, which will becovered at the beginning of the course. Ideally, programming in Scheme would have been aprerequisite. But the first week of the course is devoted to a quick introduction to it. Students shoulduse the summer holidays to learn as much Scheme as they can, and also learn to use the text editorEmacs (which is, among other things, an integrated development environment for PVS), The secondgoal of this course is to introduce the mechanics of formal reasoning of models of data and programs(logics, sequents, skolemization, quantification, etc.). We will employ the Prototype VerificationSystem (PVS) for expressing simple models and their verification. PVS is an industrial scale typechecker and interactive theorem prover with support for model checking (through the SAL library).The reason for employing PVS (as opposed to automated model checkers) is to give the student anopportunity to learn to write specifications, define putative theorems as a way of exercising thespecifications, and then attempt to prove these theorems "by hand" and with some automatedassistance from PVS.
COURSE TOPICS:Introduction to SchemeIntroduction to Scheme programming: lists, functions, and recursion. Most material will be taken fromthe HtDP. Interpreter Models of programming languages Values, types and expressions. Abstractsyntax. Backus-Naur form. Block structure and lexical environments. Scope and binding. Proceduresand closures. Implementing recursion. Computational effects. Explicit and implicit references.Implementing mutation. Expressible and denotable values. Parameter passing. Tail recursion.Continuation-passing style (CPS). Converting to CPS. Continuation-passing interpreters. Trampolining.Imperative interpreters. Modeling exceptions and concurrency. Type checking. Type reconstruction.Term unification. Hindley-Milner polymorphism. Object Oriented Languages Interpreters for ObjectOriented Programming. Dynamic Method Dispatch. Inheritance. Shallow embedding of an objectoriented language in Scheme. Introduction to Formal Verification Formal Specification. Types,Predicates and Sets. Higher-order predicates. Introduction to Prototype Verification System. Sequentcalculus. Skolemization. Axiomatization and Type correctness conditions. Dependent types. Provingtheorems using the PVS theorem prover. Induction. Invariants. Theory interpretations. Simple modelchecking.
PREFERRED TEXT BOOKS:.How to Design Programs (HtDP). Felleisen et al. Available online. http://www.htdp.org/
Also available in print from Prentice Hall India..Essentials of Programming Languages, (EoPL) 3rd Edition. Friedman and Wand. Available inPrentice Hall India edition. This is the main text book.
Software.PLT Scheme http://www.plt-scheme.org.Prototype Verification System http://pvs.csl.sri.com.Emacs text editor
*REFERENCE BOOKS:.Prototype Verification System (PVS). Documentation available on the PVS website.http://pvs.csl.sri.com.Programming Languages: Applications and Interpretation. Shriram Krishnamurti. Availableonline http://www.cs.brown.edu/~sk/Publications/Books/ProgLangs/.Programming Languages: Principles and Paradigms. Gabbrielli, Maurizio, Martini, Simone.Springer 2010. (Library, please purchase a few copies of this book to be kept on reserve, plusone copy for loan to the instructor.)
Class notes will supplement reading assignments from the text books.
GRADING:.homework (will be assigned but not graded): 0%.quizzes (6): 30%.midterm exams (2): 30%.final exam: 40%
OUTCOME:A student completing this course should be able to
.apply the principles learnt in this course to gain a deep understanding of any programminglanguage he/she learns in the future..apply the skills and the vocabulary to formally and informally reason with programs anddata, specially during modeling, construction and testing of software.
Title : Principles of semiconductor devicesCourse Code : ECE462Credits : 3-1-0-4Type-When : Elective Course – Monsoon 2014Faculty : Srivatsava JandhyalaPre-requisite : Electronic CircuitsCourse Overview: The course details the physics of various semiconductor devices and relates it totheir electrical characteristics. Popular devices like PN-junction diodes, MOS Capacitors, variousMOSFETs and BJTs are discussed in detail along with their circuit simulation models. An overview ofadvanced Integrated Circuit Technology is provided at the end of the course.Course Topics
1. Fundamentals of semiconductors: Band structure, Electron-hole statistics, Intrinsic and Extrinsicsemiconductors, Band diagrams, Carrier transport Mechanisms, generation- recombination, opticalabsorption and emission, basics of circuit models and parameter extraction.
2. P-N junctions: Physics of P-N junction, Diode electrical characteristics, charge storage and transientbehavior, Circuit model, Junction break down, Zener diode, Schottky diodes, photo diode, Solar cell,tunnel diode, LED and laser diode.
3. Bipolar Junction transistors: Transistor physics, Circuit models for BJT, Frequency response andswitching of BJTs, Non-ideal effects, Hetero-junction Bipolar transistors, power BJTs.
4. Metal Oxide Semiconductor capacitor: MOS capacitor – structure and regions of operation, electricalcharacteristics, interface states, flat-band condition, small-signal capacitances.
5. Metal Oxide Semiconductor Field Effect Transistor: Regions of operation, Body effect, thresholdvoltage, popular MOSFET SPICE models, Scaling laws, Short geometry effects, Integrated circuittechnology.
6. Advanced Integrated Circuit Technology: Principles and technology of advanced devices for future ICtechnology- Devices like UTBSOI, FinFETS, HEMTs, Tunnel FETS will be introduced.referred Textbooks:
1. “Fundamentals of modern VLSI device,” by Y Taur & TH Ning, Cambridge UniversityPress.
2. “Semiconductor Devices: Physics and Technology,” by Simon M. Sze, Ming-Kwei Lee, Wiley, 2012.
3. “Solid State Electronic Devices,” by Ben Streetman, Sanjay Banerjee.
Reference books:
1. “Semiconductor Device Fundamentals,” by R.F. Pierret, Addison-Wesley, 1996.
2. “Semiconductor Devices, An Introduction,” by Jasprit Singh, McGraw-Hill.
3. Current literature from journal and conference proceedings.
Course ObjectivesThe course aims in providing the essential link between the devices and their circuits. From thiscourse, student will appreciate how the physics of the device gets related to its electrical properties,which in-turn determines the circuit applications.Remarks
Final projects of the course will use the existing circuit simulator from Cadence.
Grading Policy
1. Home Works - 15%
2. Mid-term 1 Exam - 20%
3. Mid-term 2 Exam - 20%
4. Final project - 10%
5. Class Participation and Quizzes – 5%
6. Final Exam – 30%
TITLE : Quantum Mechanics, symmetry & spectroscopyCourse Code : SCI439Type-When : Monsoon-2014Faculty Name : Prof.Harjinder Singh
Scope: This is a core course for 3rd yr, CND (dual degree B Tech CSE+MS CNS) students. At thisstage, we will admit regular B Tech students also (for general elective) subject to the condition suchthat there number is no more than half the class strength. The selection for such candidates will bebased on the grades obtained in Science-I and Science-II courses. Post graduate students fromCCNSB may also opt for this course. Project work will be compulsory for PG students.
The course will provide knowledge in three areas: (A) application of quantum theory to strucutralaspects of molecules (B) principles of symmetry and application of group theory to molecular systemsand (C) principles of spectroscopy.
Course overview: (L= 1Hr)
(A) Molecular quantum mechanics: 14 L1. Introduction and revision of elementary ideas covered in General Physics course.2.Quantum versus classical Physics; Wave particle duality, probability amplitude. Measurement andUncertainty, matrix formulation.3.Time independent Simple applications: Harmonic oscillator, Angular momentum, Perturbationtheory, Variation theorem, Hellman-Feynman theorem, H atom, H_2 molecule, Born-Oppenheimerapproximation.4. Further applications: Periodic potential (solids), electronic structure of molecules, Hartree Focktheory, etc.5. Time dependent quantum mechanics, Evolution of a wave packet. Fermi-Golden rule, etc.6.Miscellaneous Applications.
PREFERRED TEXT BOOKS:1. Molecular Quantum Mechanics, P W Atkins and R S Friedman, OUP.2. P W Atkins, Physical Chemistry, Oxford Univ Press.3. Quantum Chemistry, I N Levine, Prentice Hall
(B) Symmetry:Symmetry of objects, point groups, calculus of symmetry, reduced and irreducible representations,LCAO-SALC approach in MO theory, applications. 10 L
PREFERRED TEXT BOOKS:1. F A Cotton, Chemical Applications of Group Theory, Wiley.2. P W Atkins and R S Friedman, Molecular Quantum Mechanics, Oxford Univ Press.
(C)Principles of Spectroscopy:1. atomic and molecular spectroscopy, IR (including normal mode analysis), visible-uv, MWspectroscopy 8 L2. ESR and Raman spectroscopy 4 LPREFERRED TEXT BOOKS:1. C N Banwell and E N McCash, Fundamentals of spectrosopy, Mcgraw-Hill.2. G M Barrow, Introduction to Molecular Spectroscopy, Mcgraw-Hill.
3. P W Atkins, Physical Chemistry, Oxford Univ Press.
Grading plan:Option A:2 Mid sem exams: 15% eachEnd sem exam: 40%Assignments: 20%2 quizes: 5% each
Option B:2 Mid sem exams: 10% eachEnd sem exam: 40%Assignments: 10%2 quizes: 5% eachterm paper/project: 20%
TITLE : Research in Information SecurityCourse Code : CSE540CREDITS : 4TYPE-WHEN : Monsoon-2014FACULTY NAME : Sanjay Rawat
PRE-REQUISITE : programming languages (C/C++, Python), operating systems, compilers,introduction to security.
OBJECTIVE : This course is intended to introduce students the exciting world of informationsecurity research. The main focus of this course would be on non-cryptographic security research i.e.topics related to software vulnerabilities, malware, intrusion detection/prevention systems. Therenowned Cryptographer Dr. Bruce Schneier once said that “.. security is a chain and is as strong asits weakest link. Cryptography is already a string link, problem lies somewhere else- in networks andsoftware ….” Following the aforementioned suggestion, the course is designed to introduce softwaresecurity issues and state-of-the-art in techniques to address those issues. At the end of the course,the students should:
1. understand the various issues in software security;2. understand the techniques that are applied in order to address security issues;3. understand the majority of the attacks that hamper the security of the networks, e.g. bug
exploitation (aka hacking);4. learn basics of malware analysis and defensive techniques;5. learn basics of program analysis (static and dynamic program analysis) that are applied to
analyze software for vulnerability detection;6. get familiar with the state-of-the-art in security research to lay foundation for their advance
research.
COURSE TOPICS : The entire course is divided into 3 modules:
A. Software vulnerability Analysis:
1. Non-web software vulnerabilities (low level bug, e.g., buffer overflow, use-after-free etc.)2. Binary code analysis3. Static program analysis4. Dynamic program analysis (fuzzing)5. Application of SAT/SMT solvers for security6. Application of evolutionary computing/ machine learning for security program analysis7. Web specific vulnerabilities and their analysis (e.g. XSS, CSRF, SQLinjection etc.)
The course is mainly based on research articles and notes given by the instructor.
*REFERENCE BOOKS:
Any compiler book for dataflow analysis Assembly book for x86 Practical malware analysis, by Sikorski and Honig
*PROJECT: Student can choose some topic that can be extended to major project for the masterdegree or advance research. However, if student choose to work on the project during the course,they can do. So, this is optional.
GRADING:20%: Mini Project15%: In-class paper presentation15%: Hands-on assignments (2)15%: mid term35%: End exam
OUTCOME: The students will be well aware of state-of-the-art in non-cryptographic security issuesand their proposed solutions. The student will also get to know about the opportunities that exist inthe research space. Some of the topics are very practical from industry point of view, especially whenit comes to proactive approach to security i.e. security during development process.
REMARKS: The course is highly flexible in its contents and approach. Based on the student’sparticipation and interest, the course may progress in a particular direction.
TITLE : Research MethodologyCourse Code : CSE991Credits : 3-1-0-4Type-When : Monsoon-2014faculty Name : Priyanka SrivastavaPre-Requisite : None
OBJECTIVE :The goal of this course is to impart an understanding of the methods of scientific enquiry. Inparticular, we will focus on how to identify relevant parameters, how to formulate hypotheses, andhow to design experiments. We will also cover data analysis techniques. The course will give studentsa hands-on experience in the quantitative and qualitative methods used in empirical studies.
COURSE TOPICS :Part 1: Introduction to Philosophy of Science: 2 WeeksWhat is research?Logical EmpiricismInduction and confirmationChallenges in theory testingPopper and FalsificationKuhn: Paradigms and Normal scienceKuhn: Crisis and Revolution
Kuhn: Theory-laden observations and the question of progressAlternatives to Kuhn: Lakatos, Laudan and Feyerabend
Part 2: Quantitative and Qualitative Methods for Research: 4 weeksResearch designPurpose of research
ExplorationDescriptionExplanationNecessary and sufficient causesUnits of analysisThe time dimensionCross-sectional studiesLongitudinal studiesHow to design research projectThe research proposalTheory and HypothesisConceptualization, operationalisation and measurementDefinitions in descriptive and explanatory studiesOperationalisation choicesCriteria of measurement qualityIndexes, scales and typologiesIndexes versus scalesIndex constructionScale constructionThe logic of samplingA brief history of samplingNonprobability samplingThe theory and logic of probability samplingPopulations and sampling framesTypes of s ampling designsMultistage cluster samplingModes of observation: Quantitative and QualitativeExperimentsIndependent and dependent variablesPretesting and post testingExperimental and control groupsThe double blind experimentSelecting subjectsProbability samplingRandomizationVariations on experimental designAlternative experimental settingsWeb-based experimentsNatural experimentsSurvey researchTopics appropriate for survey researchGuidelines for asking questionsQuestionnaire constructionSelf-administered questionnaireInterview surveysTelephone surveysOnline surveysComparison of the different survey methodsQualitative field researchUnobtrusive researchEvaluation research
Part 3: Analysis of data: Quantitative and Qualitative: 3 weeksQualitative data analysisLinking theory and analysisQualitative data processingQuantitative data analysis
Quantification of dataUnivariate analysisSubgroup comparisonsBivariate analysisIntroduction to multivariate analysisThe elaboration modelStatistical analysisDescriptive statisticsMeasures of associationRegression analysisInferential analysisUnivariate inferencesTests of statistical significanceChi Squaret-testOther multivariate techniquesPath analysisTime series analysisAnalysis of varianceDiscrimination analysisLog linear modelsWriting research
Method of teaching: Initial part of the course will contain lectures, readings, and discussions. By themiddle of the semester, the participants will be asked to come up with a research problem and todesign and conduct an experiment. The second half of the course will largely include presentationsfrom the class participants.
PREFERRED TEXT BOOKS:1. The Practice of Social Research by Earl Babbie, Published by Wadsworth, Cengage learning2. Theory and Reality: An Introduction to the Philosophy of Science (Science and Its ConceptualFoundations series) by Peter Godfrey-Smith, Published by University Of Chicago Press3. Science As a Process: An Evolutionary Account of the Social and Conceptual Development ofScience (Science and Its Conceptual Foundations Series) by David L. Hull, Published by Univ ofChicago Press4. Freakonomics: A Rogue Economist Explores the Hidden Side of Everything (Revised and Expanded)by Steven D. Levitt, Stephen J. Dubner, Published by William Morrow
*REFERENCE BOOKS:*PROJECT:GRADING: Students will be assessed on the basis of:1. Class participation2. Class Presentations3. Interim reports4. Experiment Design5. Final Report
TITLE : Science Lab ICourse Code : ISC201Credits : 0-1-4-4Type-When : Monsoon-2014Faculty Name : Tapan K. Sau and Marimuthu KrishnanPre-Requisite : None
OBJECTIVE: Main objective of this laboratory course is to understand the concepts of select sciencetopics through lab sessions.
5. Photometry6. pH-metry7. Kinetics of Reactions8. Solution Chemistry Techniques
PREFERRED TEXT BOOKS: No preferred textbooks. Hands-out will be provided.
GRADING: 60% Lab performance (based on student comprehension and reports) 30% Quizzes(quizzes may contain any combination of the following: multiple choice, matching, true-false, sketchesor drawings, definitions, and short questions) 10% Viva-voce.
OUTCOME: This laboratory course is designed to introduce students to the bachelor level sciencelaboratory techniques. Students completing this course are expected to learn the following: (i) handson experience of select science topics (ii) measure and report physical quantities with appropriateprecision, (iii) convert raw data to a physically meaningful form, (iv) apply appropriate methods ofanalysis to raw data, (v) recognize the relevance of data, (vi) work safely in the lab, (vii) adhere toinstructions on laboratory safety, (viii) recognize hazardous situations and act appropriately, and (ix)recognize the applicability of scientific principles to real world situations.
REMARKS: No formal Exam. Quizes and viva-voce will be conducted during the semester exams.
TITLE : Software Quality EngineeringCourse Code : CSE861Note: Please use course code for previously existing courseCredits : 3Type-when : Monsoon -2014Faculty Name : Raghu ReddyPre-Requisite : SSAD & Project or Software Engineering. If neither course is taken, thestudent should get permission from the Instructor.
OBJECTIVE : The course will impart quality concepts and skills necessary to design andanalyze software systems. Topics include verification and validation, metrics and measurements,software quality assurance, standards, etc.
COURSE TOPICS: Software process models and relation to quality
o Traditional models *o Agile models
Quality Assessment Standards and Modelso CMMIo ISO 9000o Software Productivity research assessmento Malcolm Baldridge assessment
Quality at various levels of SDLCo Requirements and formalization of requirementso Architecture and Qualitieso Design Reviewso Code Reviews/inspections
Software Testing and Qualityo Unit, Integration, System, Acceptance, Regressiono Blackbox Testing
Equivalence Boundry value Decision table Pairwise State-transition Use case based
o White box Control flow Data flow Mutation
Measurement and Metricso Complexityo Reliabilityo Availability
*REFERENCE BOOKS: Metrics and Models in Software Quality Engineering by Stephen H. Kan Software Metrics: A rigorous and practical approach by Fenton and Pfleeger. A practioner’s guide to Software Test Design by Lee Copeland
*PROJECT: No project. Students will be assessed using activities and exams. If the class is not large,we may require a term paper submission.
GRADING: Traditional grading. Consists of 2 mid-terms, 1 final, set of activities and term paper.
OUTCOME: The course begins with an exploration of the concepts underlying quality systems and theuse of metrics. Students are encouraged to discuss the advantages as well as the limitations ofsystems and quantitative approaches, with a view to understanding the importance of interpretation inmetrics usage and of matching quality systems choices to organizational objectives and culture. Theylearn the use of modern measurements and metrics through exercises. By the end of the coursestudents should be able to design/evaluate a software system from a quality perspective.
REMARKS: Ideally we could like the class strength to not exceed 50 students.
TITLE : Spatial InformaticsCourse Code : CSE591Credits : 3-1-0-4Type-When : Monsoon-2014Faculty Name : K S RajanPre-Requisite : Open to PG, UG-4 & UG-3
OBJECTIVE: Spatially explicit information like a map (e.g. Google Maps) informs us not just thegeographical location but also the relationship between the objects in it, as the saying goes, �A Pictureis worth thousand words�. This course gives an introduction to Remote Sensing and GIS, the sciencebehind it and how this technology can benefit many disciplines, including navigation, environmentalsystems, disaster response, etc.
COURSE TOPICS: 1.Introduction. 2.Fundamentals of Remote Sensing. 3.Image Acquisition andDigital data. 4.Image Processing and Analysis. 5.Applications of Remote Sensing � Land Use and LandCover. 6.Geographical Information Systems (GIS) - Fundamental concepts. 7.Geospatial data and itsDigital representation � Vectors and Rasters. 8.Data structures in GIS and its Representation.9.Projections and Georeferencing. 10.Spatial Data Query and Analysis. 11.Special Topics in SpatialInformatics. a.Web-GIS and GML. b.Open Source Initiatives in GIS/RS. c.3D GIS. d. Environmentaland Health Informatics. e.Risk Mapping and Vulnerability Assessments
A few lectures, will be given by Invited Speakers in related areas during the course to provide thestudents a wider understanding of its relevance and application. In addition, there will be a hands-on(lab tutorials) introduction to some of the RS and GIS software and tools at relevant times during thecourse
PREFERRED TEXT BOOKS:1.Introduction to Remote Sensing by James B. Campbell2.Geographic Information Systems by Paul A. Longley, Michael F. Goodchild, David J. Maguire, andDavid W. Rhind3.Introduction To Geographic Information Systems by Kang-Tsung Chang*REFERENCE BOOKS:
GRADING:
1. Assignments (max. of 4) 15% 2. Project 10% 3. Mid-term Exams (2) 30% [15% + 15%] 4. End-Semester Exam (1) 45% Details of Assignments/Projects will be announced during the course
OUTCOME:Students will learn the basic concepts of geospatial data representation, cartography, visualization,data manipulation and how to extract meaningful information from it. In addition, they will be exposedto the application potential of this fast developing domain cutting across disciplinary interests.
TITLE : Speech Signal ProcessingCourse Code : ECE448Credits : 3-1-0-4Type-when : Monsoon-2014Faculty Name : B. YegnanarayanaPre-Requisite : (PG, research and BTech students from 3rd year onwards will be permitted) Signal
and systems Digital signal processing.
COURSE TOPICS: Background and need for speech processing, Speech production mechanism,Nature of speech signal, Basics of digital signal processing, Equivalent representations of signal andsystems, Speech signal processing methods, Linear prediction analysis, Basics of speech recognition.
PREFERRED TEXT BOOKS: 1. L.R.Rabiner and B.H Juang, Fundamentals of speech recognition,Pearson LPE (1993). 2. L.R.Rabiner and R.W.Schafer, Digital processing of speech signals, PearsonLPE (1993).
GRADING: Based on lab reports, midsem exams and final exam. Weightage depends on the numberof registrants.
Title : Speech TechnologyCourse Code : CSE971Credits : 3-1-0-4Type When : Monsoon-2014Faculty Name : S P KishorePre-Requisite : Speech Signal Processing
Objective : This is an advance course whose objective is to discuss and provide hands-onexperiance on implementstion of algorithms, models used in feature extraction and in building speechsystems.
COURSE TOPICS :1. Introduction to speech technology2. Feature extraction from speech signal3. Algorithms for speech recognition4. Methods for speech synthesis5. Approaches for speech enhancement6. Approaches for speaker recognition
PREFERRED TEXT BOOKS: Fundamentals of Speech Recognition (Prentics Hall Signal ProcessingSeries) (Paperback) by Lawrence Rabiner and Biing-Hwang Juang
*REFERENCE BOOKS: Spoken Language Processing: A Guide to Theory, Algorithm and SystemDevelopment by Xeudong Huang, Alex Acero, and Hsiao-Wuen Hon
OUTCOME: At the end of the course, the students are expected to attain the theoretical andpractical knowledge of the different algorithms used in speech technology.
TITLE : Theories of Arts and AestheticsCourse Code : HSS334Faculty Name : Sunil Lohar, Naini AroraType-When : Humanities Elective, Monsoon 2014Credit : 3-0-0-4
Description:
The aim of this course is to understand the rational thinking behind the Arts, and appreciating itsvalues behind artistic imagination, through understanding theory and practice. Arts are taken asmagical, irrational, mysterious and celebrative human activity, whereas rigorous thought runsthrough arts, right from the antiquity of civilizations. Such thoughts not only were constitutive ofarts through the ages but art practices threw up deepest of questions pertaining to human natureand reality.The course will have three components:
TheoryUnderstanding the origin of arts in perspective of West and India.Reading classical and contemporary texts on Arts – both Indian and Western.Formal Ontology of Arts and Formal Theory in various disciplines of Arts.Understanding of art and aesthetics in terms of different enclosures and disclosures.Introduction to Indian miniature and fresco traditions, Sculpture and Architecture of India:Mathura, Gandhara, Hoysla, Cholas, etc.Introduction to Western art (Renaissance to modern art- painting and sculpture).Introduction to Photography, possibilities of various types of blending.
Art appreciation which will align with theory: students will be shown artwork images of Indian andwestern artists / movies / documentaries, etc.
As a final project, students will have to create an artwork, accompanied with a write up whichwould highlight the theoretical points in it. This project will also show their understanding of theentire course.
Topical breakup of lectures:
Lecture 1: - Introduction: the importance of this course, etc.Lecture 2, 3: In depth about the origin of art (pliny the elder, narcissus, nagnajit and natyashastrastory).Lecture 4: Work of art as re-embodiment of imagination.Lecture 5, 6, 7: Different forms of art, various enclosures and disclosures.Lecture 8: Synchronic and Diachronic forms, Event to Iconic and vice versaOntology of various forms of art begins.Lecture 9: Painting: Indian Art (Folk painting schools).Lecture 10, 11: Indian miniature and fresco traditions (extra hours discussing relation betweentext and image)Lecture 12, 13, 14: Sculpture and Architecture of India: Mathura, Gandhara, Hoysla, Cholas, etc.Lecture 15, 16, 17: Introduction to Western art (Renaissance to modern art, painting andsculpture).Lecture 18: Introduction to Photography.Lecture 19, 20: Films and performances, (extra hours on watching important films, exploringrelation between sound and image).Lecture 21: Possibilities of various types of blending of Art Forms.Lecture 22, 23, 24 along: blending of Art Forms (with extra hours)
Building up of projects culminating in individual works of art along with a detailed write-up frommiddle of the course.
Reference Materials:Vishnudharmottara purana, part III Translated into English form Orignal Sanskrit Text, (2002)Paul Klee, Pedagogical Sketchbook.Joseph D. Parry, Art and Phenomenology.Hegel, G.W.F. (1835–38), Introduction to the Philosophy of Fine Art.A. Hofstadter and R. Kuhns (eds.) (1964) Philosophies of Art and Beauty.B. N. Goswamy and A. L. Dahmen-Dallapiccola (1976), An early document of Indian art.Stephen Davies, Ontology of Art.Class Notes and Slides of Navjyoti Singh’s courses on Art.
Grading:
Mid sem 1 (30%) after lecture 8, mid sem2 (30%) after lecture 16, Project (40%)
Remarks:Various articles to be read and presented as group or individual presentations
TITLE : Time Frequency AnalysisCourse Code : ECE442Credits : 3-1-0-4Type-When : Monsoon - 2014Faculty Name : Anil Kumar VuppalaPre-Requisite :
COURSE TOPICS:I. Introduction to the course Vector Space, Basis Functions, Basis, Frames, Signal Expansion.II. Linear time frequency representation –Fourier and Gabor Review of Fourier Transform and FourierSeries Localisation problem Time-Frequency distributions, general concepts Short-Time FourierTransform Gabor Transform Instantaneous Frequency.III. Linear time frequency representation – Wavelets Nested subspaces Multiresolution formulationContinuous wavelet transform discrete wavelet transform.IV. Quadratic time frequency representation Energy distributions Wigner distribution.V. Applications in signal and image processing
*REFERENCE BOOKS: Time-Frequency Analysis, L. Cohen, Prentice Hall.A wavelet tour of signal processing, S. Mallat, Academic Press
GRADING:Assignments 20%2 mid sem exams 30%1 project 15%End sem exam 35%
TITLE : TOPICS IN SPEECH SYSTEMS: TEXT-TO-SPEECH CONVERSIONCourse Code : CSE973Credits : 4-3-0-0 (= credits - hours per week - tutorials - lab sessions)Type-When : Monsoon-2014Faculty Name : Dr.Suryakanth V GangashettyPre-Requisite : CLG 413 Phonetics & Phonology / CLG211 Introduction to Linguistics / CLG 421Computational Linguistics / ECE448 Speech Signal Processing / CSE 472 Natural Language ProcessingObjective : Keeping Indian languages as the focus, the course will discuss about basic units in writing,script, transliteration, text normalization, text-encoding and related issues. It will have exercises inphonemic inventory preparation from phonetic data, text normalization, morphophonemicprocesses, and their implementation(s) in text-to-speech systems for Indian languages.
Course Topics: Linguistic Aspects of Text and Sound:Composition of Text: Letters, punctuation marks, digits, spaces, abbreviations etc.Script and Encoding: Script, Letters, Glyphs, Graphemes, Allographs, Code-pointsLetter to Phoneme conversion and Morphophonemic Processes.
Speech Systems: Components of a text-to-speech (TTS) system; Building limited domain andunrestricted TTS systems; Letter-to-phoneme conversion and prosody (duration and F0) generationusing machine learning techniques; Building Indian language (IL) voices.
Preferred Text Book: Thierry Dutoit (1997) An introduction to text-to-speech. Kluwer AcademicPublishers, Netherlands.
Reference Books: Deng, Li & O' Shaughnessy, Douglas (2003). Speech Processing. New York: MarcelDekker.Tatham, M., & Morton, K. (2005). Developments in Speech Synthesis. Chichester: John Wiley & Sons.
Tatham, M., & Morton, K. (2011). A guide to speech production and perception. Edinburgh: EdinburghUniversity Press.
Project: One major project involving implementation of text processing for speech synthesis.
Outcome: The students are expected to become well-versed with text processing aspects of Indianlanguages and their implementation(s) in speech systems.
Remarks: ELECTIVITY: This is an elective course and can be taken by 3rd Year or 4th Yearundergraduate students in Computer Science or by any postgraduate students in ComputationalLinguistics or in Computer Science.
TITLE : Web MiningCourse Code : CSE446CREDITS : 3-1-0-4TYPE-WHEN : Monsoon -2014FACULTY NAME : Manish Gupta, Microsoft Bing, IndiaMax. Limit : 60
PRE-REQUISITE :
1. CS4731 – Information Retrieval and Extraction. In special cases, the instructor might waive offthis pre-requisite. Drop an email.
2. Understanding of basic probability3. Need a computer for study of popular IR and web mining tools4. Good knowledge of a programming language (Java, C or C++) and a scripting language (shell,
python or perl)
Class Size and Selection:The instructor would like to keep the class strength to a maximum of 40 students. If the registrationgoes over 40, the first class would include a 15 minute quiz consisting of basic web mining related 30-40 multiple choice questions. Students scoring within top 40 will be selected. Ties, if any, will then beresolved based on the time of registration; earlier registrations will be preferred.
OBJECTIVE :This course aims to provide a conceptual and practical understanding of various aspects of web miningstarting with the basics of web search to discussions about recent topics studied in the World WideWeb community.
The course will take the participants through understanding of the basic information retrievalconcepts, web mining concepts, architecture of search engines, and applications. The first part of thecourse will cover the basics of IR and web mining very briefly (2-3 weeks), while the second part willfocus on applications and advanced topics. The applications are related to recent trends in research ontopics in web mining including social networks, recommendation systems, query understanding,analysis of micro-blogs, computational advertising, etc. Besides this, the course also aims atintroducing students to popular tools in data analysis like Hadoop (and Pig and Hive), Lingpipe andLemur.
COURSE TOPICS :
Week 1 – Introduction: Administrative info (optionally, a 15-minute quiz); Course introduction andpreview; Web search basics: Document representation, inverted index, crawling. Ranking: Rankingcriteria; Basic scoring approaches.
Week 2 - Similarity Search: Shingling, Min-hash, Fast mirror site detection, random projections;Locality sensitive hashing. Ranking models and link analysis: PageRank, HITS.
Week 5 - Social Networks: Introduction to social networks, power laws; Diameter, hop-plots, bow-tie, preferential attachment; User behavior analysis.
Week 6 - Social Influence Analysis: Definition of social influence; Existential Test for SocialInfluence; Computational models for Social Influence and Applications.
Week 7 - Micro-blogging: Sentiment Analysis, Location Prediction; Predicting popular events onTwitter; Group Chats on Twitter, Near-Duplicate Detection on Twitter.
Week 8 - Web Economics and Monetization (Computational Advertising): Basics ofadvertising, Anatomy of an ad; Signals for keyword-ad matching, Advertisement models; Evolution ofthe Internet Economic Ecosystem.
Week 9 - Mining Structured Information from the Web: Extracting lists from web pages;Annotating and searching web tables; Answering table augmentation queries from unstructured listson the Web.
Week 10 - Mining Structured Information from the Web for Entities (Entity Mining): Entitysynonyms, Entity attribute discovery, Entity augmentation; Entity linking, Entity tagging, Entitysearch; Entity intent mining: Mapping queries to entities.
Week 11 - Introduction to Web Search Query Log Mining: Introduction to search logs; Overviewof log mining applications; Basic data structures for search log processing. Query Understanding byLog Mining: Basic statistics of queries; Query categorization; Query expansion, substitution, andsuggestion; Temporal and spatial features of queries; Extracting aspects and entities from queries.
Week 12 - Document Understanding by Log Mining: URL annotation; Document summarization;Search result clustering. Query-Document Matching by Log Mining: Mining preference pairs;Mining preference lists; Predicting click-through rate of ads.
Week 13 - User Understanding by Log Mining : Analyzing variations in user behavior;Personalized search: three questions; User segmentation; Modeling user behavior. Privacy in WebSearch Query Log Mining.
Week 14 – Crowd sourcing: Categories and the characteristics of crowd sourcing applications;Algorithms for crowd sourcing systems, Matching tasks and crowds; Analysis of a few crowd sourcingsystems.
PREFERRED TEXT BOOKS:Manning, C., Raghavan, P., and Schutze, H. (2007). An Introduction to Information Retrieval.Cambridge University Press.
Chakrabarti, S. (2002). Mining the Web: Discovering knowledge from hypertext data. Morgan-Kaufman.
*REFERENCE BOOKS:
Baeza-Yates, R. and Ribeiro-Neto, B. (1999). Modern Information Retrieval. PearsonEducation.
Witten, I. H., Moffat, A., and Bell, T. C. (1999). Managing Gigabytes: Compressing andIndexing Documents and Images. Morgan-Kaufman.
Grossman, D. A. and Frieder, O. (1998). Information Retrieval: Algorithms and Heuristics.Kluwer.
Croft, B., Metzler, D., and Strohman, T. (2009). Search Engines: Information Retrieval inPractice. Pearson Education.
Also, we will refer many papers from recent WWW, WSDM, SIGIR, CIKM and ICWSMproceedings.
*PROJECT: Mini Project
The project can be done in groups of 2-3. The instructor will post some sample project topics by week 5. By week 7, the teams will have to either choose a topic from the sample set or propose their
own project topics related to any area within web mining. Students will have to start the project topic from week 10. In the last week, the teams will have to send the project code + documentation + instructions
to run the code to the instructor via email. Finally, in the last week, we will also have projectpresentations (10 min per team).
The instructor will choose best projects and will be happy to work with students to submit highquality projects to relevant conferences as research papers.
GRADING:
Quizzes (objective) – Surprise short 5-minute in-class quizzes (based on the content taught inthe previous class). Six (Best Four. 5% each) - 20%
At the end of the course the students should be able to understand the following:1. Basics of information retrieval and web mining, and a few applications.2. Popular IR and web mining tools like Hadoop (and Pig and Hive), Lingpipe and Lemur.3. How does Amazon recommend products to its users?4. How are social networks formed and how do they grow?5. How do people influence each other on social networks?6. Challenging problems in the world of micro-blogs aka Twitter7. How can your query log be used to understand you and serve you with a better web
experience?8. How do search engines make money through ads?9. Ways of generating useful and credible information using the wisdom of the crowds.10. Techniques to capture the temporal nature of the web.11. How to mine structured information from the web?12. How to mine structured information from the web for particular entities?
