Escolar Documentos
Profissional Documentos
Cultura Documentos
doc Subject Code EOE-071 Subject Name: Enterpreneurship Development Session 2011-12 Groups : 08CSA, 08CSB,08EC,08IT Lect. No. Ref. Pt. Topics to be covered
Unit I: Entrepreneurship 1 2 3 4 5 6 7 1.1 1.2 1.3 1.4 1.5 1.6
Entrepreneurship- Meaning & Defination, growth of SSI in developing countries. SSI positions vis-a-vis large industries; Role of small scale industries in the national economy Characteristics and types of small scale industries Demand based and resources based ancillaries and sub-control types. Government policy for small scale industry; stages in starting a small scale industry. CASE STUDY
Unit II: Project identification 8 9 10 11 12 13 14 2.1 2.2 2.3 2.4 2.5 2.6 2.7
Assessment of viability, formulation, evaluation Financing, field-study and collection of information, Preparation of project report, demand analysis, Material balance and output methods Benefit cost analysis, discounted cash flow, Internal rate of return and net present value methods.
15 16 17 18 19 20 21 22
Preparation of balance sheets Assessment of economic viability, decision making, expected costs Planning and production control, quality control, marketing, Industrial relations, sales and purchases, advertisement Wages and incentive, inventory control Preparation of financial reports, accounts and stores studies.
23 24 25
26
4.3
control Economic evaluation, risk analysis, capital expenditures, policies and practices in public enterprises profit planning and programming, planning cash flow, capital expenditure and operations control of financial flows, control and communication.
27 28 29 30 31
Laws concerning entrepreneur viz, partnership laws , business ownership, sales and income taxes workman compensation act Role of various national and state agencies which render assistance to small scale industries
Teacher Krishan Kumar Subject Code ECS-074 Session 2011-12 Lect. No. 1 Ref. Pt.
Topics to be covered Unit I: INTRODUCTION Introduction of Pattern Recognition Basics of pattern recognition Examples Design principles of pattern recognition system,
Model Preprocessing Segmentation Feature Extraction Training Samples Cost Generalization
1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 1.10 1.11 1.12 1.13 1.14 1.15 1.16 1.17
Leaning and adaptation, Supervised, unsupervised and reinforcement learning Pattern recognition approaches: Template matching Statistical classification Syntactic or structural matching
1.18 4 1.13 1.14 5 1.15 1.16 6 1.17 1.18 7 1.19 1.20 1.21
Neural networks Mathematical foundation:Linear algebra: Probability theory: Mathematical foundation:expectation, mean and covariance, Mathematical foundation:Normal distribution, multivariate normal densities, Mathematical foundation:Chi squared test Assignment-1 Class Test-1 Marks: 10 Unit- II: Statistical Pattern Recognition Bayesian Decision Theory: Introduction Bayesian Decision Theory -Continuous Features Minimum-Error-Rate classification Classifiers, discriminants Multi Category case Two Category case Normal Density Univariate Density Multivariate Density Normal density and discriminants function Case-1 Case-2 Case-3
Error Bounds for Normal Densities Chernoff Bound Bhattacharyya Bound Bayes Decision Theory Discrete Features Independent Binary Features Missing and Noisy Features Missing Features Noisy Features Compound Bayes Decision Theory and Context Assingment-2
9 2.1 2.2 2.3 2.4 2.5 2.6 2.7 2.8 2.9 2.10 2.11 2.12 2.13 2.14 2.15 2.16 2.17 2.18 2.19 2.20 2.21 2.22 2.23 2.24
10
11
12
13
14 15
16 17
18 3.1 3.2 3.3 3.4 3.5 3.6 3.7 3.8 3.9 3.10 3.11 3.12 3.13 3.14 3.15 3.16 3.17 3.18 3.19 3.20 3.21 3.22 3.23
Unit- III: Parameter Estimation Methods Parameter Estimation Methods Introduction Maximum likelihood estimation, General Principal The Gaussian case Bayesian EstimationClass Conditional Densities Parameter Distribution Bayesian parameter estimation: General Theory
Bayesian parameter estimation: Gaussian Case The Univariate Case: p(|D) The Univariate Case: p(x|D) The Multivariate Case
19
20
Principal component Analysis (PCA), Fisher Linear discriminants analysis, Expectation-Maximization (EM), Hidden Markov models (HMM),
First-order Markov models First-order hidden Markov models Hidden Markov Model Computation Evaluation Examples
21 22 23
24 25 26
27 28
29 30
4.1 4.2 4.3 4.4 4.5 4.6 4.7 4.8 4.9 4.10 4.11
31
32
Fuzzy classification
Are Fuzzy Category Memberships just Probabilities? Assignment-4
33 34 35 36 37 38 39 40
UNIT-5 Unsupervised learning and clustering: Creation function for clustering, Clustering Techniques: Iterative square-error partitional clustering-K means, Agglomerative hierarchical clustering, Clustering validation Assignment-5, class Test-5 Marks: 10 Revision using PPTs PPT Showing some development in this field using Research Papers Queries Handling BOOKS Pattern Classification by Richard O. Duda, Peter E. Hart, Devid G. Stork, II Edition Pattern Recognition and Machine Learning by Cristopher M. Bishop Foundation of Statistical Natural Language Processing by Cristopher D. Manning and Hinrich Schutze
LESSON PLAN
Teacher Sapna Katiyar Subject Code ECS702 Session 2011 Lect. No. 1 Ref. Pt. 1.1 1.2 1.3 1.4 File Name LP-ECS702-SK Subject Name Digital Image Processing Group 08CSA, 08CSB
3 4
Sampling and Quantization Basic Gray Level Functions Piecewise-Linear Transformation Functions Contrast Stretching; Histogram Specification Histogram Equalization; Local Enhancement Enhancement using Arithmetic/Logic Operations Image Subtraction, Image Averaging Basics of Spatial Filtering; Smoothing - Mean filter, Ordered Statistic Filter Sharpening The Laplacian
5 6
7 8
1.10 1.11
9 10 11 12 13 14 15 16
2.1 2.2 2.3 2.4 2.5 2.6 2.7 2.8 2.9 2.10 2.11 2.12 2.13 2.14 2.15 2.16 3.1 3.2 3.3 3.4 3.5 3.6 3.7
17
18
19 20 21
Unit II: Image Enhancement in Frequency Domain Fourier Transform and the Frequency Domain Basis of Filtering in Frequency Domain Filters Low-pass, High-pass Correspondence Between Filtering in Spatial and Frequency Domain Smoothing Frequency Domain Filters Gaussian Low pass Filters Sharpening Frequency Domain Filters Gaussian Highpass Filters Homo morphic Filtering Image Restoration A Model of Restoration Process Noise Models Restoration in the presence of Noise only-Spatial Filtering Mean Filters Arithmetic Mean filter Geometric Mean Filter Order Statistic Filters Median Filter Max and Min filters Periodic Noise Reduction by Frequency Domain Filtering Band pass Filters Minimum Mean-square Error Restoration Unit III: Color Image Processing Color Fundamentals, Color Models Converting Colors to different models Color Transformation Smoothing and Sharpening Color Segmentation Morphological Image Processing Introduction
22 23 24 25
3.8 3.9 3.10 3.11 3.12 3.13 3.14 3.15 4.1 4.2 4.3 4.4 4.5 4.6 4.7 4.8 4.9 4.10 4.11 4.12 4.13 4.14 5.1 5.2 5.3 5.4 5.5 5.6 5.7 5.8 5.9 5.10
26 27 28 29 30 31 32 33 34 35
36 37 38 39 40
Logic Operations involving Binary Images Dilation and Erosion Opening and Closing Morphological Algorithms Boundary Extraction Region Filling Extraction of Connected Components Convex Hull Thinning, Thickening Unit IV: Registration Introduction Geometric Transformation Plane to Plane transformation Mapping, Stereo Imaging Algorithms to Establish Correspondence Algorithms to Recover Depth Segmentation Introduction, Region Extraction Pixel-Based Approach Multi-level Thresholding Local Thresholding Region-based Approach Edge and Line Detection: Edge Detection, Edge Operators Pattern Fitting Approach Edge Linking and Edge Following Edge Elements Extraction by Thresholding Edge Detector Performance Unit V: Feature Extraction Representation Topological Attributes Geometric Attributes Description Boundary-based Description Region-based Description, Relationship Object Recognition Deterministic Methods, Clustering Statistical Classification Syntactic Recognition Tree Search Graph Matching
LESSON PLAN
Teacher: Shruti Mittal Subject Code: TCS-801 Session: 2011-12 Lect. No. 1 Ref. Pt. File Name: LP-TCS801-SM.doc Subject Name : Distributed Systems Group: 08CSA&08CSB Topics to be covered Unit I: Characterization of Distributed Systems: Introduction, Examples of distributed Systems, Theoretical Foundation for Distributed System: Limitation of Distributed system, absence of global clock, shared memory Resource sharing and the Web Challenges. System Models: Architectural models, Fundamental Models Logical clocks, Lamports logical clocks Vectors logical clocks Causal ordering of messages, global state, termination detection. Distributed Mutual Exclusion: Classification of distributed mutual exclusion, requirement of mutual exclusion theorem, Token based and non token based algorithms, Performance metric for distributed mutual exclusion algorithms. Unit II: Distributed Deadlock Detection: system model, resource Vs communication deadlocks, deadlock prevention Deadlock avoidance, detection & resolution, centralized dead lock detection, distributed dead lock detection, path pushing algorithms, edge chasing algorithms. Agreement Protocols: Introduction, System models, classification of Agreement Problem Byzantine agreement problem, Consensus problem, Interactive consistency Problem Solution to Byzantine Agreement problem, Application of Agreement problem, Atomic Commit in Distributed Database system. Unit III: Distributed Objects and Remote Invocation: Communication between distributed objects, Remote procedure call, Events and notifications, Java RMI case study. Security: Overview of security techniques, Cryptographic algorithms, Digital signatures
1.1
2 3 4 5 6 7
8 9 10 11 12 13
14
3.1
15,16
3.2
17,18 19,20
3.2 3.3
Cryptography pragmatics, Case studies: Needham Schroeder, Kerberos, SSL & Millicent. Distributed File Systems: File service architecture, Sun Network File System, The Andrew File System, Recent advances.
Unit IV: Transactions and Concurrency Control: Transactions, Nested transactions, Locks, Optimistic Concurrency control Timestamp ordering, Comparison of methods for concurrency control. Distributed Transactions: Flat and nested distributed transactions, Atomic Commit protocols, Concurrency control in distributed transactions, Distributed deadlocks, Transaction recovery. Replication: System model and group communication. Fault - tolerant services, highly available services, Transactions with replicated data. Unit V: Distributed Algorithms: Introduction to communication protocols, Balanced sliding window protocol, Routing algorithms, Destination based routing, APP problem, Deadlock free Packet switching, Introduction to Wave & traversal algorithms Election algorithm.CORBA Case Study: CORBA RMI, CORBA services. LESSON PLAN
Rajdev Tiwari ECS-075 Data Mining and Warehousing 2011-12 08CS & 08IT
Lect. No(s)
Ref. No(s)
1 2
1.1 1.2
Unit I: Overview Motivation (for Data Mining),Data MiningDefinition & Functionalities Data Processing, Form of Data Preprocessing, Data Cleaning: Missing Values
1.3
4 5 6
7 8 9 10 11
12 13
2.6 2.7
Data Cleaning: Missing Values, Noisy Data,(Binning, Clustering, Regression, Computer and Human inspection) Inconsistent Data, Data Integration and Transformation. Data Reduction:-Data Cube Aggregation, Dimensionality reduction, Data Compression Numerosity Reduction, Clustering, Discretization and Concept hierarchy generation Unit II: Concept Description Definition, Data Generalization, Analytical Characterization, Analysis of attribute relevance Mining Class comparisons, Statistical measures in large Databases. Measuring Central Tendency Measuring Dispersion of Data, Graph Displays of Basic Statistical class Description Mining Association Rules in Large Databases, Association rule mining Mining Single-Dimensional Boolean Association rules from Transactional Databases Apriori Algorithm Mining Multilevel Association rules from Transaction Databases Mining Multi-Dimensional Association rules from Relational Databases Unit III: Classification and prediction What is Classification & Prediction, Issues regarding Classification and prediction Decision tree Bayesian Classification Classification by Back propagation, Multilayer feedforward Neural Network, Back propagation Algorithm Classification methods K-nearest neighbor classifiers, Genetic Algorithm Cluster Analysis: Data types in cluster analysis, Categories of clustering methods, Partitioning methods Hierarchical Clustering- CURE and Chameleon Density Based Methods-DBSCAN, OPTICS, Grid Based Methods- STING, CLIQUE Model Based Method Statistical Approach, Neural Network approach
14 15 16 17
18 19
3.5 3.6
20 21 22 23
24 25 26 27 28 29 30 31
Outlier Analysis Unit IV: Data Warehousing Overview, Definition, Delivery Process, Difference between Database System and Data Warehouse, Multi Dimensional Data Model Data Cubes, Stars, Snow Flakes, Fact Constellations Concept hierarchy, OLAP operations* Process Architecture, 3 Tier Architecture Data Marting
Granularity and level of summarization*
Unit V:
32 33 34 35 36 5.1 5.2 5.3 5.3 5.4
Aggregation, Historical information, Query Facility OLAP function and Tools. OLAP Servers, ROLAP, MOLAP, HOLAP Data Mining interface, Security Backup and Recovery, Tuning Data Warehouse Testing Data Warehouse
and
2. Jiawei Han, Micheline Kamber, Data Mining Concepts & Techniques Elsevier 3. Sam Anahory, Dennis Murray, Data Warehousing in the Real World : A Practical Guide for Building Decision Support Systems, Pearson Education 4. Mallach,Data Warehousing System,McGraw Hill
LAB PLAN
Teacher MANISH MISHRA
Subject Code
Subject Name DIGITAL IMAGE PROCESSING LAB
ECS-752
Session Group
2011-12 08CSA
A. LIST OF EXPERIMENTS AS PER UNIVERSITY SYLLABUS Class No. 1. 2. 3. 4. Name of experiment Write a program in c to rotate a line in animated form Write a c program to fill a rectangle using eight neighbor pixel algo Write a c program to display intensity array of output image for given input image using salt and peper noise method Write a c program to display intensity array of output image for given input image using histogram equalization method Write a c program to implement image enhancement using arithmetic and logical operator (i.e.subtraction averaging of image) Write a c program to implement image Segmentation Write a c program to implement Region extraction of an input image Write a c program to implement morphological image processing Write a c program to implement Color transformation on input image Write a c program to implement 2Dtransformation(translation and rotation) on input image Implement all the above methods by using MATLAB Tentative Date
5Aug 12Aug 19Aug 26Aug
5.
2Sep
6. 7. 8. 9. 10.
9Sep 16Sep
23Sep
14Oct
21Oct
11.
4Nov,11Nov,18Nov
B. LAB CONDUCT PLAN: All the groups shall conduct same experiment on a day (when implement with c). OR The students shall be divided in groups of 2/3(when implement with MATLAB) and each group shall conduct different experiments. C. LAB EVALUATION/MARKING SCHEME Total internal marks: 25 Attendance marks: 5 Lab Record: 5 Quiz 5 Internal Viva 10
Teacher
MANISH MISHRA
Subject Code
Subject Name DIGITAL IMAGE PROCESSING LAB
ECS-752
Session Group
2011-12 08CSB
D. LIST OF EXPERIMENTS AS PER UNIVERSITY SYLLABUS Class No. 1. 2. 3. 4. Name of experiment Write a program in c to rotate a line in animated form Write a c program to fill a rectangle using eight neighbor pixel algo Write a c program to display intensity array of output image for given input image using salt and peper noise method Write a c program to display intensity array of output image for given input image using histogram equalization method Write a c program to implement image enhancement using arithmetic and logical operator (i.e.subtraction averaging of image) Write a c program to implement image Segmentation Tentative Date
1Aug 8Aug 29Aug 12Sep
5.
19Sep
6.
26Sep
7. 8. 9. 10.
Write a c program to implement Region extraction of an input image Write a c program to implement morphological image processing Write a c program to implement Color transformation on input image Write a c program to implement 2Dtransformation(translation and rotation) on input image Implement all the above methods by using MATLAB
10Oct
10Oct
17Oct
31Oct
11.
31Oct,14Nov
E. LAB CONDUCT PLAN: All the groups shall conduct same experiment on a day (when implement with c). OR The students shall be divided in groups of 2/3(when implement with MATLAB) and each group shall conduct different experiments. F. LAB EVALUATION/MARKING SCHEME Total internal marks: 25 Attendance marks: 5 Lab Record: 5 Quiz 5 Internal Viva 10