DOWNLOAD FREE LECTURE NOTES SLIDES PPT PDF EBOOKS

Natural Language Processing

2011-12-06T06:37:00.001-08:00

Natural Language Processing

Textbook required for puchase or reference (on library reserve, Barker P98.J87 2009):
Jurafsky, D. and Martin, J.H., Speech and Language Processing
2nd edition, Prentice-Hall: 2008.

Download slides here

Topic	Slides & Reference Readings
Introduction: walking the walk, talking the talk	• Lecture 1 pdf slides; pdf 4-up; Jurafsky & Martin (JM), ch. 1. • If you don't know Python, read the NLTK book, ch. 1-3; otherwise, skim NLTK book, chs 2–3. • Background Reading (for RR 1): Jurafsky & Martin ch.4 on ngrams. (pp. 83-94; p. 114-116) • Background Reading (for RR 1): Abney on statistics and language. • Background Reading (for RR 1): Chomsky, Extract on grammaticality, 1955. • (Optional) Background chapters on NLP from Russell & Norvig, ch. 22.
RR1 discussion; Bayes' rule and smoothing; from words to parsing	Intro to Competitive Grammar Writing
Parts of speech, parsers, and statistical parsing; Parsing & competitive grammar writing I	• Bring notebook computer to class (at least 1 per team) • Competitive Grammar Writing slides, pdf; pdf, 2up • JM, ch. 13 (parsing), pp. 427-435; ch. 14, pp. 459-467 • (Optional) NLTK book on advanced parsing (skim)
Parsing & competitive grammar writing II	• Bring notebook computer to class (at least 1 per team)
Parsing & competitive grammar writing III	• Bring notebook computer to class (at least 1 per team)
Competitive Grammar Evaluation & Wrap-up, Grammy Awards
Smoothing & language models	• Lecture 3 pdf slides; pdf 4-up • JM ch. 3
Smoothing; word parsing	• Lecture 4 pdf slides; pdf 4-up
Word parsing II	• Lecture 5 pdf slides; pdf 4-up
Context Free parsing I	• Lecture 6 pdf slides; pdf 4-up
Context-free parsing II	• Lecture 7 pdf slides; pdf 4-up
RR #2	• No slides today
Earley's algorithm	• Lecture 8 pdf slides; pdf 4-up; animation of Earley algorithm here; 4upbw Earley here.
Modern statistical parsers I	• Lecture 9 pdf slides; pdf 4-up
Treebank parsers II	• Lecture 10 pdf slides;
Semantics I: the lambda calculus view	•Lecture 11 pdf slides; pdf 4-up
Semantics II: SQL	•Lecture 12 pdf slides; pdf 4-up
Semantics III: Quantifiers	• Lecture 13 pdf slides; pdf 4-up
Semantics IV: learning words	•Lecture 14 pdf slides; pdf 4-up
	•Lecture 15 pdf slides; pdf 4-up
Lexical Semantics	• Lecture 16 pdf slides; pdf 4-up
Discourse	• Lecture 17 pdf slides pdf 4-up
Language Learning	• Lecture 18 pdf slides; pdf 4-up
Language Learning & Language Change	• Lecture 19 pdf slides; pdf 4-up
Evolution of language	• Lecture 20 pdf slides; pdf 4-up
Evolution of language	• Lecture 21 pdf slides; pdf 4-up

Embedded System

2011-12-06T05:50:00.001-08:00

Embedded System

Instructor : Dick Steflik

Text:

Building Embedded Linux Systems - O'Reilly

Description:The use of single-board computer systems as the embedded processingelements for consumer and industrial products. Storage hierarchies,rotating and non-rotating storage devices. Parallel and serialinterfacing standards. Architecture and application of small formfactor, single board computers used to solve consumer and industrialproblems. Application and use of small computer operating systems. Thiscourse has a directed laboratory in which students will get hands-onexperience with interfacing and the application of small form factordevices including embedded web servers, single-board computer systemsand mixed signal programmable systems on chip.

Download slides here

Introduction
ATtiny2313 Introduction
Universal Synchronous/Asynchronous Receiver/Transmitter (USARTs)
Fuses
Universal Serial Interface (USI)
Inter-Integrated Circut (I2C) Bus
Timer/Counters
AT32AP7000 Intro
Linux
GPIO
JTAGICE mk II
AVR32 USART
Buildroot
User Interfaces (CGI)
Memory and File Systems

Web Programming

2011-12-06T05:47:00.001-08:00

Web Programming

Instructor : Professor Steflik

References:

Advanced Java Networking; Steflik and Shridharen; Prentice-Hall
essential Javascript; ; Prentice-Hall
JavaScript Bible; Goodman; IDG
essential PHP ; Cosentino; Prentice-Hall
Core PHP; Atkinson
ASP in a Nutshell; Weissinger; O'Reilly
Web Security and Commerce; Garfinkle and Spafford; O'Reilly
Web Performance; Menasce'; Prentice-Hall
Philip and Alex's Guide to Web Publishing; Greenspun; Morgen Kaufmann

Lecture Notes download here :

Title	Document Type	File Name
CS-422 Introduction	PowerPoint	cs422_intro.ppt
HTTP Review	PowerPoint	http.ppt
Java Script	PowerPoint	JavaScript.ppt
More Java Script Button Example Button Array Example Radio Button Example	PowerPoint	JavaScript2.ppt
SQL Intro	PowerPoint	SQL.ppt
Database Design	PowerPoint	database.ppt
PHP Intro	PowerPoint	phpintro.ppt
Active Server Pages	PowerPoint	asp.ppt
ActiveX Data Objects	PowerPoint	aspado.ppt
.NET	PowerPoint	dotnet.ppt
ASP.NET Mono myasp.aspx myasp.aspx source web.config	PowerPoint	aspdotnet.ppt
AJAX
** Cold Fusion I	PowerPoint	CF5_Field_Seminar_Preso_Final-7-27-01.ppt
** Cold Fusion II	PowerPoint	coldfusion.ppt
** Fuse Box	PowerPoint	2_Fusebox.ppt
** FuseDoc	PowerPoint	3_Fusedoc.ppt
Web Design and eCommerce	PowerPoint	web_design_ecommerce.ppt
Web Distributed Data eXchange (WDDX)	PowerPoint	lesson5.ppt
Java Servlets Servlet Examples Page	PowerPoint	servlet.ppt
Java Servlets (more) Servlet Examples Page	PowerPoint	servlet.ppt
Java Server Pages JSP Examples Page	PowerPoint	jsp.ppt
Java Beans for JSPs JSP Bean Insert Example (use myasp.aspx to see if it worked) jspBean.jsp source bean.java source	PowerPoint	JavaBeans4JSP.ppt
JSP Implicit Objects	PowerPoint	jspImplicitObjects.ppt
Web Security Web Security - CAPTCHAs Secure Sockets Layer/Transport Layer Security	PowerPoint	WebSecurity.ppt SSL.ppt
Enterprise Java Beans I Enterprise java Beans II	PowerPoint	ejb.ppt ejb2.ppt
Web Services	PowerPoint	jws_slides.ppt

Cryptography and Network Security

2011-12-06T05:32:00.001-08:00

Cryptography and Network Security

Instructor : MahalingamRamkumar

Overview :Computer networks are vital infrastructures needed for our day to daylives. Our increasing reliance on computers and networks of computerscalls for robust measures to secure this infrastructure from maliciousintents.

Present day networks face continuous threats from hackers. Anunderstanding of the potential perils, and the strengths and limitations of existing solutions to this problem is relevant not onlyfor students specializing in
security, but for every person for whom a computer is an indispensablepart of life.

Cryptography, once considered to be solely restricted to the realm ofspies and secret service agencies, is an increasingly importantbuilding block for realizing computer and network security. Anunderstanding of the principles of cryptography is therefore essentialfor comprehending approaches to realize secure networks.

The course will introduce private and public key encryption, keydistribution (Kerberos, public key infrastructure), cryptographic hashfunctions, digital signatures, IP Security, Secure Socket Layer, WEP(Wired Equivalent Privacy
for wireless networks), intrusion detection, Firewalls, denial ofservice, spam, email viruses, phishing, and an overview of many attacksthat the Internet has experienced, especially in the last decade.

Text : Cryptography and NetworkSecurity, Third Edition, by William Stallings, Prentice Hall,2003

Additional References

Cryptography, Theory andPractice, Douglas R. Stinson, 2nd Edition, CRC Press.
A Course in Number Theory andCryptography, Neal Koblitz
Supplemental materialthat will be provided by the instructor in electronic form - usually inpdf format.

Download slides here :

Lecture Slides (PDF), Introduction

Lecture Slides (PDF), Symmetric Cryptography

Lecture Slides (PDF), Asymmetric Cryptography

Lecture Slides (PDF), Key Distribution

Lecture Slides (PDF), Network Security

Lecture Slides (PDF), Web Security

Lecture Slides (PDF), Wily Hacker

Lecture Slides (PDF), Intrusion Detection

Lecture Slides (PDF), Firewalls

Lecture Slides (PDF), Wireless Security

Network Security Slides

2011-12-06T05:29:00.001-08:00

Network Security Slides

Instructor: Henning Schulzrinne
Professor and Chair in theDept. of Computer Science;also with theDept. of Electrical Engineeringat Columbia University(Contact Info)

Description:

Instead of relying exclusively on physical security and separatenetworks, more and more applications are moving to shared networkslike the Internet. These applications include the electronic bankingand commerce, virtual private networks and the transfer of sensitivemedical or personnel data. A combination of security measures,including cryptography and firewalls, need to be integrated intonetwork architecture, protocols and implementations to offerreasonable assurance as to privacy and user identity. The course willprovide the necessary foundations for network security, includingencryption techniques, design of secure systems and protocols as wellas enhancements for existing protocols like electronic mail, WWW and theInternet protocol. While the majority of the material will be drawnfrom the text, additional topical areas such as electronic cash, theWWW security protocol SSL and Java security issues will be covered.

Required text(s):

Charlie Kaufman, Radia Perlman and Mike Speciner, NetworkSecurity - Private Communication in a Public World, Prentice Hall,Englewood Cliffs, New Jersey, 1995. ISBN 0-13-061466-1

Download slides here

Topic	PDF, 1 slide/page	PDF, 2 slides/page
Introduction	1	2
Review of networks	1	2
Introduction to cryptography (Ch. 2)	1	2
Secret-key cryptography (Ch. 3)	1	2
Hashes (Ch. 4)	1	2
Public-key cryptography (Ch. 5)	1	2
Number theory (Ch. 6)	1	2
Authentication (Ch. 7)	1	2
Authentication of people	1	2
Security handshake pitfalls	1	2
Kerberos 4	1	2
Kerberos 5	1	2
OS security	1	--
IP security	1	2
Email security	1	2
Transport-layer and web security	1	2

Introduction to Embedded Systems

2011-12-06T04:21:00.001-08:00

Introduction to Embedded Systems

Description

Embedded systems; machine languageexecution; assembly and C language programming; local variables andsubroutines; input/output synchronization; analog to digital conversionand digital to analog conversion; debugging; and interrupts.

Textbook

Jonathan W. Valvano
Introduction to Embedded Systems:
Interfacing to the Freescale 9S12
Cengage Publishing, 2009
ISBN-10: 049541137X / ISBN-13: 9780495411376
(authors' site)
Textbook Errata Page: http://users.ece.utexas.edu/~valvano/typo3.pdf

Download slides here

Download Link	Description (** means not done yet, used Fall 2010)
aLec01_dataflow	Introduction to EE319K, data flow graphs, flowcharts, call graphs, interrupts
aLec02_texas	Usage of TExaS simulator, 9S12 assembly, top down design
aLec03_numbers Lecture3worksheet	How numbers are stored, precision, basis, hexadecimal, binary, TExaS help
aLec04_ArchAddrMem Lecture4worksheet	9S12 architecture, addressing modes, memory allocation
aLec05_Ports Lecture5worksheet	I/O ports, stack, subroutines, direction register
aLec06_LogicShift Lecture6worksheet	AND OR EOR NOT, shift, addition
aLec07_Debugging	Functional debugging, performance debugging, trace, profile, monitor, dump, stabilization
aLec08_Arithmetic Lecture8worksheet	Addition, subtraction, overflow, number wheels, conditional branch
aLec09_switch_LED Lecture9worksheet	Switch interface, LED interface, if-then conditional, 9S12 board
aLec10_subroutinesStack Lecture10worksheet	Successive refinement, modular programming, parameter passing, stack usage
aLec11_IndexMode Lecture11worksheet	Arrays, strings, indexed addressing, timer, "how do we prove our software works?"
aLec12_timer_debugging	Time delay, intrusiveness, monitors, dumps
aLec13_exam1review.pdf	Review
aLec14_FSM_debugging	Software abstraction, finite state machines, Moore/Mealy FSM, debugging
aLec15_FSM aLec15b_FSM_C	Traffic light controller, Stepper motor interface, arrays in C, pointers in C, struct in C, Moore Finite State Machine written in C using struct
aLec16_localVariables Lec8.ppt	Fixed point, temporary/permanent allocation, private/public scope Yerraballi's PPT lecture on local variables, nicely done
aLec17_locals_LCD	Stack frame pointers, I/O synchronization, blind/busy-wait/interrupts, LCD interface
aLec18_LCD_fixedpoint	LCD interface, fixed point numbers
aLec19_timer_threads	Blind/busy-wait/interrupts, threads, interrupt service routines, output compare
aLec20_OCinterrupts	Output compare, running a FSM in the background, logic analyzer debugging
aLec21_Metrowerks	C programming, projects, assembly-C linkage, phase lock loop (PLL)
aLec22_ADC	Analog to digital conversion, range/resolution/precision, Nyquist Theorem, real time, time jitter
aLec23_Lab7	Successive approximation, ADC device driver
aLec24_arrays_math	**Arrays, tables, 32-bit math, interpolation, conversion from ADC sample to measurand
aLec25_SCI	Serial port, baud rate versus bandwidth, asynchronous transfer, device driver
aLec26_SCIinterrupt	Buffered I/O using interrupts and FIFO queue, performance measures
aLec27_realtime	FIFO queues, I/O synchronization, distributed systems, latency, real time systems
aLec28_DAC	Digital to analog conversion, range/resolution/precision, accuracy, monotonic, audio amp
aLec29_sound	Signal generation, sound, RMS measurement of noise, oscilloscopes, spectrum analyzer
aLec30_EmbeddedSystems	Systems approach, design for testing, ECE curriculum
aLec31_pointers	**Pointers, linked lists, FSM in C, trees, MACQ
aLec32_steppers	Stepper motor basics
aLec33_Trobot	How to install and run Trobot
aLec34_GoodDesignPrinciples	Modular programming, coupling, cohesion, exceptions
aLec35_ProgrammingStyle	C programming style guidelines
aLec36_SystemsEngineering	Systems approach, requirements document, interfaces, standard values, batteries
aLec37_finalreview	Review

Computational Geometry by M. de Berg et al (2nd edition) PPT Slides

2011-11-21T06:23:00.001-08:00

Introduction and Objective

Introduction to data structures, algorithms, and analysis techniquesfor computational problems that involve geometry. Line segmentintersection. Polygon triangulation and visibility problems. Linearprogramming. Range queries. Point location. Arrangements andduality. Voronoi diagrams and Delaunay triangulations. Convexhulls. Other selected topics. Programming assignments..

Textbook

M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf. Computational Geometry (2nd edition). Springer-Verlag, 2000. ISBN: 3-540-65620-0.

The book is accompanied by a website http://www.cs.uu.nl/geobook/which provides additional material such as pointers to software and research papers. For general background on algorithms, you can consult the following.

J. Kleinberg and E. Tardos, Algorithm Design, Addison-Wesley, 2005; ISBN 0-321-29535-8.

T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms,Second Edition MIT Press, 2001; ISBN 0-262-03293-7

Slides download here.

Date	Topic
Jan 12	Geometric Basics Convex Hulls
Jan 14	Line Segment Intersection
Jan 19	Doubly-Connected Edge List Overlay of Two Subdivisions
Jan 21	The Art Gallery Problem (Graphs, BFS, DFS)
Jan 26	Triangulation
Jan 28	Half-Plane Intersection
Mar 23	Duality
Mar 25	Arrangement of Lines

Business Statistics PPT and Video

2011-10-02T01:29:00.000-07:00

Business Statistics

Professor David Mease

Lecture Powerpoint Slides and Videos:

Lecture 26 = Thursday 5/13 Video

Lecture 25 = Tuesday 5/11 Video

Lecture 24 = Tuesday 5/4 Video

Lecture 23 = Thursday 4/29 Video

Lecture 22 = Tuesday 4/27 Video

Lecture 21 = Thursday 4/22 Video

Lecture 20 = Tuesday 4/20 Video

Lecture 19 = Thursday 4/15 Video

Lecture 18 = Tuesday 4/13 Video

Lecture 17 = Thursday 3/25 Video

Lecture 16 = Tuesday 3/23 Video

Lecture 15 = Thursday 3/18 Video

Lecture 14 = Thursday 3/11 Video

Lecture 13 = Tuesday 3/9 Video

Lecture 12 = Thursday 3/4 Video

Lecture 11 = Tuesday 3/2 Video

Lecture 10 = Thursday 2/25 Video

Lecture 9 = Tuesday 2/23 Video

Lecture 8 = Thursday 2/18 Video

Lecture 7 = Tuesday 2/16 Video

Lecture 6 = Thursday 2/11 Video

Lecture 5 = Tuesday 2/9 Video

Lecture 4 = Thursday 2/4 Video

Lecture 3 = Tuesday 2/2 Video

Lecture 2 = Thursday 1/28 Video

Lecture 1 = Tuesday 1/26 Video

Database System Concepts PPT PDF SLIDES

2011-09-13T10:39:00.000-07:00

Database System Concepts
Fifth Edition

Avi Silberschatz
Henry F. Korth
S. Sudarshan

Copyright Note

The slides and figures below are copyright Silberschatz, Korth. Sudarshan, 2005.The slides and figures are authorized for personal use, and for use in conjunction witha course for which Database System Concepts is the prescribed text.Instructors are free to modify the slides to their taste, as long as themodified slides acknowledge the source and the fact that they have beenmodified. Paper copies of the slides may be sold strictly at theprice of reproduction, to students of courses where the book is the prescribed text. Any use that differs from the above, and any for profit sale ofthe slides (in any form) requires the consent of the copyright owners;contact Avi Silberschatz (avi@cs.yale.edu) to obtain thecopyright owners consent.

Chapter	Formats
1. Introduction	ppt, pdf
Part 1: Relational Databases
2. Relational Model	ppt, pdf
3. SQL	ppt, pdf
4. Advanced SQL	ppt, pdf
5. Other Relational Languages	ppt, pdf
Part 2: Database Design
6. Database Design: The Entity-Relationship Approach	ppt, pdf
7. Relational Database Design	ppt, pdf
8. Application Design	ppt, pdf
Part 3: Object-Based Databases and XML
9. Object-Based Databases	ppt, pdf
10. XML	ppt, pdf
Part 4: Data Storage and Querying
11. Storage and File Structure	ppt, pdf
12. Indexing and Hashing	ppt, pdf
13. Query Processing	ppt, pdf
14. Query Optimization	ppt, pdf
Part 5: Transaction Management
15. Transactions	ppt, pdf
16. Concurrency Control	ppt, pdf
17. Recovery System	ppt, pdf
Part 6: Data Mining and Analysis
18. Data Analysis and Mining	ppt, pdf
19. Information Retrieval	ppt, pdf
Part 7: System Architecture
20. Database System Architectures	ppt, pdf
21. Parallel Databases	ppt, pdf
22. Distributed Databases	ppt, pdf
Part 7: Other Topics
23. Advanced Application Development	ppt, pdf
24. Advanced Data Types	ppt, pdf
25. Advanced Transaction Processing	ppt, pdf
Part 8: Case Studies
26. PostgreSQL	ppt, pdf
27. Oracle	ppt, pdf
28. IBM DB2 Universal Database	ppt, pdf
29. Microsoft SQL Server	ppt, pdf
Appendices
A. Network Model	ppt, pdf
B. Hierarchical Model	ppt, pdf
C. Advanced Relational Database Design	ppt, pdf

Digital System Design PPT PDF SLIDES

2011-09-13T10:26:00.000-07:00

Lecture

NETWORK SECURITY PPT PDF SLIDES

2011-09-13T10:18:00.000-07:00

Textbooks

The required textbook for the course is Computer Networking - A Top Down Approach Featuring the Internet Second Edition by James Kurose and Keith Ross (Addison Wesley). It is available in the CMU Bookstore. Almost all the material that we will cover is in the textbook, although we may cover it in a different order.
There are two recommended texts which are useful references (especially if networking becomes your career). You can get the best price on them by ordering from an on-line bookstore.

TCP/IP Illustrated, Volume 1 : The Protocols by W. Richard Stevens.
Unix Network Programming : Networking APIs: Sockets and XTI (Volume 1) by W. Richard Stevens.

Schedule

		Topics		Readings
		Introduction, Network Infrastructure, Delays,Throughput, Bandwidth lecture1.ps		Chapter 1
		Packet-switching, Circuit-switching, Protocol Stacks, Layering lecture2.ps		Chapter 1
		Holiday - Labor Day
		Sockets (TCP, UDP) lecture3.ps		2.1, 2.6-2.8
		Applications (Security, DNS) (pdf, ppt)		7.1-7.3, 7.5, 7.8.2, 2.5
		Applications (DNS, Web) (pdf, ppt)		2.2-2.4
		Web Optimizations (CDN, caching) (pdf, ppt)		2.9
		Transport Protocols (pdf, ppt)		3.1-3.5
		TCP - congestion control (pdf, ppt)		3.6
		More TCP (pdf, ppt)		3.7
		TCP and Routers (pdf, ppt)
		Multimedia (ppt)		6.1-6.4
		IP addressing, IP forwarding tables, ARP, DHCP lecture12.ps		4.1, 4.4.1, 4.4.2, 5.4, 4.4.6
		MIDTERM I
		Routing: RIP and OSPF lecture13.ps		4.2,4.5.1
		AS Hierarchy, BGP lecture14.ps		4.3, 4.5.2
		Subnetting, CIDR, IPv4 lecture15.ps		4.4.3, 4.4.4
		IPv6, tunneling, NAT, VPNs, IP over ATM, ICMP lecture16.ps		4.4.7, 4.7, 5.9.5, 4.4.5
		Physical Layer, Link layer basics ( pdf)		5.1-5.4
		Ethernet, Bridging/Switching (pdf)		5.5, 5.6, 5.8-5.10
		QOS basics, Delay guarantees, Leaky buckets lecture19.ps		6.5-6.6
		WFQ, Intserv, RSVP, Diffserv lecture20.ps		6.7 - 6.9
		Network security: Firewalls, IPSec, DoS (ppt, pdf)		Chapter 7
		P2P (centralized, flood, routing, hash) (pdf, ppt)		2.9.3
		Mobile/Wireless (Link, IP & TCP) (pdf, ppt)		5.7,4.9
		Multicast (pdf, ppt)		4.8
		Networking Futures, Powerpoint file
		Thanksgiving Holiday
		Course Overview
		MIDTERM II

Multimedia Systems PPT PDF SLIDES

2011-09-13T10:15:00.000-07:00

Amarnath Gupta

Amarnath Gupta is a Research Scientist at the San Diego Supercomputer Center (SDSC) of the University of California San Diego. He leads the Advanced Query Processing Laboratory in the Data and Knowledge Systems group at SDSC. His research interests include scientific data modeling, information integration, multimedia databases and spatiotemporal data management.

Amarnath received his Bachelor of Technology from the Indian Institute of Technology, Kharagpur, a Master of Science in Biomedical Engineering from University of Texas, Arlington, and his Ph.D. (Engineering) degree in Computer Science from Jadavpur University, India.

Topics

Representation of Image, Audio and Video Data
Principles of Image, Audio and Video Compression
File Systems for Multimedia Information
Principles of Audio/Video Networking
Multimedia Information Servers
Multimedia Database Systems

Slides and/or Notes

Introduction: Multimedia and Multimedia Systems, Engineering Issues [ppt]
Basics of Compression: Unconstrained and constrained-length Huffman encoding, Golomb-Rice encoding, Lossless JPEG [ppt]
Basics of Compression: JPEG-LS standard, LZW encoding and GIF, Network-aware compression [ppt]
Basics of Compression: Lossy Compression, JPEG-standard, JPEG 2000 proposal [ppt]
Video Compression [ppt]
The MPEG standard [ppt]
MPEG-4 standards [ppt]
Multimedia Servers [ppt]
Multimedia Servers: Service Models, Vertical Striping in Fellini [ppt]
Multimedia Servers: Horizontal Striping in Fellini [ppt]
Answer to Problem 1: T1, T2 have periods 6 and 8 and two subtasks each, and are distributed over 4 disks. Start them at 0 and 1 respectively.
Answer to Problem 2: T1, T2, T3 have periods 6, 8 and 8 and two subtasks each, and are distributed over 4 disks. Start them at 0, 1 and 3 respectively.
Managing VBR Video traffic: Bandwidth Smoothing Techniques [ppt]

Reading Assignments

A. Eleftheriadis and D. Anastassiou, "Optimal Data Partitioning of MPEG-2 Coded Video", IEEE Trans. Circuits and Systems for Video Technology, to be published.
M.R. Izquierdo and D.S. Reeves, "A Survey of Statistical Models for Variable-bit-rate Compressed Video", ACM Multimedia Systems Journal, 7, 1999, 199-213.
B. Ozden, A. Biliris, R. Rastogi and A. Silberschatz,"A Disk-based Storage Architecture for Movie on Demand Servers", Information Systems Journal , 6, 1995, 465-482.
S. Ramanathan and P.V. Rangan, "Adaptive Feedback Techniques for Synchronized Multimedia Retrieval over Integrated Networks", IEEE/ACM Trans. on Networking, 1, 1993, 243-260.
N. Shivakumar, C, Sreenan, B. Narendran and P. Agarawal, "The Concord Algorithm for Synchronization of Multimedia Streams", Proc. IEEE Int. Conf. on Multimedia Systems , Washington, 1995.
J.C. Pasquale, G.C. Polyzos and G. Xylomenos, "The Multimedia Multicasting Problem", ACM Multimedia Systems Journal, 6, 1998, 43-59.
H.M. Vin, P. Goyal, A. Goyal and A. Goyal, "A Statistical Admission Control Algorithm for Multimedia Servers", Proc. ACM Multimedia Conference San Francisco, 1994, 33-40.
P. Shenoy and H.M. Vin, "Efficient Support for Interactive Operations in Multiresolution Video Servers", ACM Multimedia Systems Journal , 7, 1999, 241-253.
P. Bocheck, A. Campbell, S.F. Chang and R. Liao, "Content-aware Network Adaptation for MPEG-4", Proc. NOSSDAV 99 New Jersey, 1999.
F. Nack and A.T. Lindsay, "Everything you wanted to know about MPEG-7" (distributed in class), IEEE Multimedia Magazine, 6, Nos.3,4, 1999.

WIRELESS AND MOBILE NETWORKING PPT PDF SLIDES

2011-09-13T10:11:00.000-07:00

Professor: Katia Obraczka (katia "at" cse. ucsc. edu)

Textbook

No textbook is required. The book "Ad Hoc Wireless Networks: Architectures and Protocols" by C. Siva Ram Murthy and B.S. Manoj can be used as a reference.

Lectures


Lecture Notes	Jan 5: Lecture 1 (pdf) Jan 10: Lecture 2 (pdf) Jan 12: Lecture 3 (pdf) Jan 17: University Holiday Jan 19: Lecture 4 (pdf) and trama_dynamma_softTDMAC.pdf Jan 24: Lecture 5 (pdf) Jan 26: Lecture 6 (pdf) Jan 31: Lecture 7 (pdf) Feb 2: Hamid's Class (pdf) Feb 7: Lecture 8 (pdf) Feb 9: Lecture 9 (pdf) Feb 14: Lecture 10 (pdf) Feb 16: Lecture 11 (pdf)

Reading Lists

Introduction

L. Kleinrock, "Nomadicity: Anytime, Anywhere In A DisconnectedWorld," Invited paper, Mobile Networks and Applications, Vol. 1,No. 4, January 1996, pp. 351-357.
L. Kleinrock, " An Internet Vision: The Invisible Global Infrastructure," Ad Hoc Networks Journal, Vol. 1, No. 1, pp. 3-11, July 2003.
M Weiser, TheComputer for the 21st Century, 1991.
M. Weiser, SomeComputer Science Problems in Ubiquitous Computing, Communications of the ACM, July 1993.

Medium Access Control

Basic Contention-Based Channel Access:

B. P. Crow and I. Widjaja and L. G. Kim and P. T. Sakai, "IEEE 802.11 Wireless Local Area Networks", 1997. IEEE Communications Magazine, 35(9):116-126.
Vaduvur Bharghavan, Alan Demers, Scott Shenker, Lixia Zhang, "MACAW: A Media Access Protocol for Wireless for Wireless LANs", ACM Sigcomm 94.
J. J. Garcia-Luna-Aceves and C. L. Fullmer, "Floor Acquisition Multiple Access in Single-Channel Wireless Networks," ACM MONET Journal, Special Issue on Ad Hoc Networks, Vol. 4, 1999, pp. 157-174.

Schedule-Based Channel Access:

Venkatesh Rajendran, Katia Obraczka, J.J. Garcia-Luna-Aceves. "DYNAMMA: A DYNAmic Multi-channel Medium Access Framework for Wireless Ad Hoc Networks", Proceedings of the 4th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS). Oct 2007. Nominated for the best paper award.
V. Rajendran, Katia Obraczka, and J.J. Garcia-Luna-Aceves, "Energy-Efficient, Collision-Free Medium Access Control for Wireless Sensor Networks", ACM/Kluwer Wireless Networks (WINET), 2006.
Djukic, P. and Mohapatra, P., "Soft-TDMAC: A Software TDMA-Based MAC over Commodity 802.11 Hardware", Proceedings of the INFOCOM 2009, 2009

Unicast Routing

Dynamic source routing in ad hoc wireless networks, David B. Johnson, David A. Maltz, in MobileComputing, editor T. Imielinski and Hank Korth, Kluwer, 1996.
An Implementation Study of the AODV Routing Protocol, Elizabeth M. Royer and Charles E. Perkins,Proceedings of the IEEE Wireless Communications and Networking Conference, Chicago, IL,September 2000.
Optimized Link State Routing Protocol (OLSR), RFC 3626.
Optional: Samir R. Das, Charles E. Perkins, Elizabeth M. Royer and Mahesh K. Marina.Performance Comparison of Two On-demand Routing Protocols for Ad hoc Networks.IEEE Personal Communications Magazine special issue on Ad hoc Networking, February 2001, pp.16-28.

Multicast routing

Multicast Operation of the Ad hoc On-Demand Distance Vector Routing Protocol. Royer and Perkins,Proceedings of Mobicom, August 1999.
On-Demand Multicast Routing Protocol. Lee, Gerla and Chiang, Proceedings of WCNC, September1999.
Robust and scalable integrated routing in MANETs using context-aware ordered meshes. Rolando Menchaca-Mendez and J. J. Garcia-Luna-Aceves, INFOCOM'10 Proceedings of the 29th conference on Information communications, San Diego, California, USA.

Capacity of wireless networks

Fundamental Limits of Information Dissemination in Wireless Ad Hoc Networks---Part I: Single-Packet Reception.
Fundamental Limits of Information Dissemination in Wireless Ad Hoc Networks---Part II: Multi-Packet Reception.
On the Multicast Capacity of Wireless Ad Hoc Networks with Network Coding, Zheng Wang, Member, IEEE, Shirish S. Karande, Member, IEEE, Hamid R. Sadjadpour, Senior Member, IEEE,and J. J. Garcia-Luna-Aceves, Fellow, IEEE.

Wireless Internetworking

A MobileHost Protocol Supporting Route Optimization and Authentication, Andrew Myles, DavidB. Johnson, Charles Perkins, IEEE Journal on Selected Areas in Communications, special issueon Mobile and Wireless Computing Networks, 13(5):839-849, June 1995.
Mobility Support in IPv6 , Charles E. Perkins and David B. Johnson. Proceedingsof the Second Annual International Conference on Mobile Computing and Networking (MobiCom'96),November 1996.
FLIP: A Flexible Interconnection Protocol for Heterogeneous Internetworking, Ignacio Solis andKatia Obraczka, in ACM/Kluwer Mobile Networking and Applications (MONET) Special onIntegration of Heterogeneous Wireless Technologies.
Optional: TCP Performance in Mobile-IP, Foo Chun Choong.

End-to-End Protocols
Point-to-point Communication:

Infrasructure-Based Wireless Networks:
1. Improving TCP/IP Performance over Wireless Networks, Hari Bala krishnan, Srinivasan Seshan, Elan Amir, Randy H. Katz. Proc. 1st ACM Conf. on Mobile Computing and Networking, Berkeley, CA, November 1995.
2. Delayed duplicate acknowledgements: a TCP-Unaware approach to improve performance of TCP over wireless, Nitin H. Vaidya, Milten N. Mehta, Charles E. Perkins, Gabriel Montenegro.
3. I-TCP: indirect TCP for mobile hosts, 15th Int'l Conf. on Distributed Computing Systems (ICDCS), May 1995.
MANETs:
1. Analysis of TCP Performance over Mobile Ad Hoc Networks, G. Holland and N. H. Vaidya, Fifth Annual International Conference on MobileComputing and Networking (MOBICOM), Seattle, August 1999.
2. A Comparison of TCP Performance over Three Routing Protocols forMobile Ad Hoc Networks, Thomas Dyer, Rajendra Boppana, Mobihoc 2001.
3. Improving TCP Performance over Mobile Ad-Hoc Networks withOut-of-Order Detection and Response, F. Wand and Y. Zhang, Mobihoc 2002.

Multipoint Communication:

Reliable Broadcast in Mobile Multihop Packet Networks, E. Pagani andG.P. Rossi, Proceedings of ACM/IEEE MOBICOM'97, Budapest, Hungary, Sep.1997, pp. 34-42.
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-HocNetworks R. Chandra, V. Ramasubramanian, and K.P. Birman, Proceedings ofIEEE ICDCS 2001, Mesa, AZ, Apr. 2001, pp. 275-283.
Venkatesh Rajendran, Katia Obraczka, Yunjung Yi, Sung-Ju Lee, Ken Tang and Mario Gerla , ""Combining Source- and Localized Recovery to Achieve Reliable Multicast in Multi-Hop Ad Hoc Networks," Proceedings of the Networking' 04, May 2004.
Optional: Ken Tang, Katia Obraczka, Sung-Ju Lee and Mario Gerla ,Reliable Adaptive Lightweight Multicast Protocol, Proceedings of IEEEICC 2003, May 2003.

Feb 28: Mobility management: Tyler and Niosha 1, Niosha 2.

Mobility Models for Systems Evaluation - A Survey by Mirco Musolesi and Cecilia Mascolo.
The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation by Jean-Yves Le Boudec and Milan Vojnovic, March 2006.

Soliman H, Castelluccia C. (2008) Hierarchical Mobile IPv6 (HMIPv6) Mobility Management (RFC 5380). IETF Network Working Group.
Kong, K.-S., Lee, W., Han, Y.-H., Myung-Ki, S., & You, H. (2008). Mobility management for all-IP mobile networks: mobile IPv6 vs. proxy mobile IPv6. IEEE Wireless Communications , 36-45.
Akyildiz, I., Xie, J., Mohanty, S., & Georgia Inst. of Technol., U. (2004). A survey of mobility management in next-generation all-IP-based wireless systems. IEEE Wireless Communications , 16-28.

March 2: Hybrid networks: Gregg and Darien.

R.N.B. Rais, M. Mendonca, T. Turletti, K. Obraczka, â€œTowards Truly Heterogeneous Internets:Bridging Infrastructure-based and Infrastructure-less Networksâ€, in Proceedings of 3rd IEEE/ACMCOMSNETS Conference, India, January 2011.
D. Miorandi and S. Vitturi, â€œHybrid Wired/Wireless Implementations of Profibus DP: a Feasibility Study Based on Ethernet and Bluetoothâ€, Computer Communications , vol.27, n.10, pag. 946-960, Jun. 2004.
A HYBRID ARCHITECTURE OF UMTS AND BLUETOOTH FOR INDOOR WIRELESS/MOBILE COMMUNICATIONS, T. KWON, R. KAPOOR, Y. LEE, M. GERLA, A. ZANELLA, 2001.

R.A. Nichols and A.R. Hammons, "Performance of DTN-Based Free-Space Optical Networks with Mobility," IEEE MILCOM 2007.
J. Ott, D. Kutscher, and C. Dwertmann, â€œIntegrating DTN and MANET Routing,â€ in CHANTS '06.
J. Whitbeck, V. Conan, HYMAD: Hybrid DTN-MANET Routing for Dense and Highly Dynamic Wireless Networks, in: AOC'09.

March 7: Energy management: Mohamed, and Security: Jim.

Hyung Seok Kim, Tarek F. Abdelzaher, and Wook Hyun Kwon. 2003. Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks. In Proceedings of the 1st international conference on Embedded networked sensor systems (SenSys '03). ACM, New York, NY, USA, 193-204.
Kai Zeng, Kui Ren, Wenjing Lou, and Patrick J. Moran. 2009. Energy aware efficient geographic routing in lossy wireless sensor networks with environmental energy supply. Wirel. Netw. 15, 1 (January 2009), 39-51.
Andreas Lachenmann, Pedro Jos; Marrn, Daniel Minder, and Kurt Rothermel. 2007. Meeting lifetime goals with energy levels. In Proceedings of the 5th international conference on Embedded networked sensor systems (SenSys '07). ACM, New York, NY, USA, 131-144.

Ram Kumar Singh. 2010. "IDS in Mobile Ad-Hoc Network with Profile Support." The Security Journal Fall 2010.
Avishai Wool. 2005. "Lightweight key management for IEEE 802.11 wireless LANs with key refresh and host revocation." Wirel. Netw. 11, 6 (November 2005), 677-686.
Shirley Radack, (Ed). 2007. "Securing Wireless Networks." The Information Technology Labs Bulletin: National Institute of Standards and Technology. April 2007
Dragorn. 2002. Comprehensive Guide to 802.11b Wireless Networks. 2600 The Hacker Quarterly, Summer 2002.

March 9: Security: Chris and Seth:

"Security in Wireless Sensor Networks". Adrian Perrig, John Stankovic, and David Wagner. June 2004.
"Wireless Sensor Network Security Analysis". Hemanta Kumar Kalita and Avijit Kar. December 2009.
"Security in Distributed, Grid, Mobile, and Pervasive Computing, Chapter 16: Wireless Sensor Network Security: A Survey". Yang Xiao. April 2007.

On Inferring Application Protocol Behaviors in Encrypted Network Traffic, Charles Wright, Fabian Monrose, Gerald Masson. Journal of Machine Learning Research, December 2006.
Inferring Speech Activity from Encrypted Skype Traffic, Yu-Chun Chang, Kuan-Ta Chen, Chen-Chi Wu, Chin-Laung Lei. IEEE Globecomm (2008).

March 14: DTNs: Philip and Rance

Epidemic Routing for Partially-Connected Ad Hoc Networks, Amin Vahdat and David Becker, Department of Computer Science Duke University
Prioritized Epidemic Routing for Opportunistic Networks, Ram Ramanathan, Richard Hansen, Prithwish Basu, Regina Rosales-Hain, Rajesh Krishnan
Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks, Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra
Probabilistic Routing Protocol for Intermittently Connected Networks, A. Lindgren, A. Doria, Lulea University of Technology, July 12, 2010
DTN Routing as a Resource Allocation Problem, Aruna Balasubramanian Brian Neil Levine Arun VenkataramaniOctober 25, 2009

Fall, Kevin. Intel Research, Berkeley. SIGCOMM 2003 Aug25, 2003. August 2003.A Delay-Tolerant Network Architecture for Challenged Internets. August 2003.
Warthman, Forrest. Delay Tolerant Networks (DTNs): A Tutorial March 2003.

VLSI Digital System Design PDF PPT SLIDES

2011-09-13T10:04:00.000-07:00

VLSI Digital System Design

Course Overview

In this course we will cover the fundamental topics necessary tosuccessfully engineer modern VLSI designs. This requires that weinvestigate two overlapping areas of study. The first givesstudents an introduction to fabrication technologies and devicephysics. This involves learning how modern integrated circuitsare manufactured and about their electrical properties. Then we willcover the principles of layout and how to simulate and verify smallcircuits. In addition, we will present a variety of trade-offs infull-custom design such as circuit style. The course will be projectoriented and will be one of the most relevent and practical coursesfor anyone interested in hardware design.

Web Page

The course web page is athttp://www.soe.ucsc.edu/classes/cmpe222/Winter11

Topic	Slides	Reading
Introduction	pdf	Chapter 1
Fabrication	pdf	Chapter 2 (pp. 35-46)
Design Rules and Layout	pdf	Chapter 2 (pp 47-64)
Devices	pdf	Chapter 3
CMOS Introduction	pdf	Chapter 5 (pp 179-192)
CMOS Layout & TX Sizing	pdf	Chapter 5 (pp. 193-227)
Interconnect	pdf	Chapter 4 (pp. 135-159)
Low-Power Design	pdf	Chapter 5 (pp. 211-229), 11.7-11.8
Review (bring questions)
MIDTERM EXAM (one 8.5x11 sheet of notes allowed)
CMOS Gate Sizing	pdf	Chapter 6 (pp. 235-263), Logical Effort paper
Exam Solutions
Other Logic Styles	pdf	Chapter 6 (pp 264-306)
Sequential Circuits	pdf	Chapter 7 (pp. 325-350)
Memories (RAM, ROM, EEPROM)	pdf	Chapter 12 (pp. 623-689, pp. 701-707)
Clocks	pdf	Chapter 10 (pp 491-549)
Clocks (pt II)
Reliability, System Integration	pdf	None
DFM	pdf	None
Design Reviews! No class.
FINAL EXAM (scheduled 4pm-7pm in Crown 201)

Graphs AND Algorithms PDF

2011-09-13T07:07:00.000-07:00

Instructors

Prof. Dr. Angelika Steger, Dr. Martin Marciniszyn

Topics

Graphs are an important concept in mathematics and computer science. This lecture presents algorithms for fundamental problems in graph theory. Amongst others, it covers the following topics:

Trees
Connectivity
Matchings
Hamilton cycles
Planar graphs
Coloring
Extremal graph theory

Material

Lecture 2: Bridg-it, Cayley's Formula, and DFS (PDF)
Lecture 3: Connectivity, Menger's Theorem (PDF)
Lecture 4: Menger's Theorem (Part II) (PDF)
Lecture 5: Min-Max Relations and Matchings (PDF)
Lecture 6: Weighted bipartite matchings and TSP (PDF)
Lecture 7: Planar Graphs: Euler's Formula and Coloring (PDF)
Lecture 8: Planar Graphs: Coloring and Drawing (PDF)

Exercises

Assignment 1: Trees
Assignment 2: Cayley's Formula and block decomposition
Assignment 3: Menger's Theorem
Assignment 4: Matchings in bipartite graphs
Assignment 5: Matchings and Min-Max Duality
Assignment 6: Hamiltonian cycles and TSP
Assignment 7: Planar Graphs
Assignment 8: Planar Graphs II
Assignment 9: Coloring I
Assignment 10:Coloring II
Assignment 11: Edge Coloring
Assignment 12: Vertex Coloring and Edge Coloring

Literature

D. B. West: Introduction to Graph Theory, Prentice Hall, 2001
R. Diestel: Graph Theory, Springer-Verlag, 2005
T. Cormen, C. Leiserson, R. Rivest: Introduction to Algorithms, MIT Press, 1990
B. Bollobas: Modern Graph Theory, Springer Verlag, 1998
The Stony Brook Algorithm Repository: A shortened version of Skiena's Algorithm Design Manual. Covers many important algorithms with downloadable implementations.

GRAPHS AND ALGORITHMS PDF PPT SLIDES

2011-09-13T07:04:00.000-07:00

Course Description

This course covers a selection of topics from graph theory and the theory of graph algorithms. Possible topics include
planar graphs (Kuratowski's Theorem, Lipton-Tarjan separators)
treewidth
network flows ("push/relabel" method of Goldberg and Tarjan)
matchings in general graphs (Tutte-Berge Theorem; algebraic algorithms)
equitable coloring (Hajnal-Szemerédi Theorem, algorithm of Kostocka and Kierstead)
list coloring (Galvin's Theorem, stable matching algorithm)
extremal graph theory (Erdős-Stone Theorem, Szemerédi's Regularity Lemma)
property testing

Literature

D. B. West: Introduction to Graph Theory, Prentice Hall, 2001.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein: Introduction to Algorithms, 2nd edition, MIT Press and McGraw-Hill, 2001.
A. Steger, Skript zur Vorlesung "Graphenalgorithmen", 2005. (in German)
H. A. Kierstead and A. V. Kostochka, A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Coloring, manuscript, 2006.
R. Diestel Graph Theory, Springer-Verlag, Heidelberg. (freely availableelectronic edition in English and German)
E. Fischer, The art of uninformed decisions: A primer to property testing, The Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science 75 (2001), 97-126. Also in: Current Trends in Theoretical Computer Science: The Challenge of the New Century (G. Paun, G. Rozenberg and A. Salomaa eds.), World Scientific Publishing (2004), Vol. I 229-264.
J. Matousek, Chapter 5 in Lecture Notes to the Core Subject course "Algorithms, Probability, and Computing", Computer Science Department, ETH Zurich, September 2007.
N. J. A. Harvey, Algebraic Algorithms for Matching and Matroid Problems, SIAM Journal on Computing, to appear.

Course Material

Content Slides Exercises Notes

Basics, Separators in planar graphs Prerequisites, Separators PDF -

Kuratowski's Theorem Slides PDF -

Kuratowski's Theorem cont'd, Treewidth - PDF -

Treewidth Slides PDF -

Treewidth, Network Flows - PDF -

Network Flows: preflow-push Slides PDF -

Relabel-to-front, Equitable colorings - PDF -

Equitable colorings (Hajnal-Szemerédi) Slides PDF -

Fast equitable coloring; Turán-type problems Slides PDF -

Erdős-Stone Theorem, Regularity Lemma - PDF -

Regularity Lemma, Property Testing Slides PDF -

Matchings, Tutte's Theorem Slides PDF -

Maximum Matching Algorithms Slides - -

ADVANCED ALGORITHMS PPT PDF SLIDES

2011-09-13T06:56:00.000-07:00

Course Description

Algorithm design and analysis is a fundamental and importantpart of computer science. This course introduces students to advancedtechniques for the design and analysis of algorithms, and explores avariety of applications.

The topics and applications that we plan to cover include hashing,bloom filters, scheduling, network design, online load balancing,algorithms in machine learning, boosting (in the context of learning),Markov chains and the MCMC method, byzantine agreement, internetalgorithms, and nearest neighbor algorithms. Enroute, we willencounter various useful ideas, including randomization, probabilisticanalysis, amortized analysis, competitive analysis, eigenvalues,linear and semi-definite programming, high dimensional geometry, andrandom walks.

Reference books

There is no textbook required for the course. Lecture notes will be made available from the course web page. Please visit the course webpage frequently for extra reading material. Reference books for each topic are listed below. Some of these books (as specified below) have been placed on reserve in the Wendt library.

Approximation Algorithms

Vijay Vazirani, Approximation Algorithms, Springer, 2001. (on reserve)
Dorit S. Hochbaum (ed.),Approximation Algorithms for NP-hard Problems, PWS Publishing, 1997. (on reserve)

Randomized Algorithms

Rajeev Motwani and Prabhakar Raghavan, Randomized Algorithms, Cambridge University Press, 2000. (on reserve)
Michael Mitzenmacher and Eli Upfal, Probability and Computing, Cambridge University Press, 2005.

Online Algorithms

Allan Borodin and Ran El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 2005. (on reserve)

Learning theory

Michael Kearns and Umesh Vazirani, An Introduction to Computational Learning Theory, The MIT Press, 1994. (on reserve)

Basic algorithm design (undergraduate material)

Jon Kleinber and Eva Tardos, Algorithm Design, Addison-Wesley, 2006. (on reserve)
T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, 2nd edition, 2001.

Download all lectures notes in a single PDF file here.

09/05 W [PDF] Intro, greedyalgorithms: scheduling, MST. (K&T§4, §5)
09/07 F [PDF] Set cover, Divide & Conquer, Dynamic programming. (K&T §5, §6, §11.3)
09/10 M [PDF] Dynamic programming. (K&T §6)
09/12 W [PDF] Network flow. (K&T §7)
09/14 F [PDF] Network flow applications, matchings. (K&T §7)
09/17 M [PDF] Randomized algorithms, Karger's min-cut algorithm. (K&T §13)
Here are some lecture notes by Avrim Blum on how to speed-up Karger's algorithm.
09/19 W [PDF] Randomized load balancing and hashing. (K&T §13.10, §13.6, M&R §8.4, §8.5)
09/21 F [PDF] Bloom filters, NP-completeness. (M&R §8.4, §8.5, M&U §5.5)
See also, this survey on the applications of bloom filters by Broder & Mitzenmacher.
10/01 M [PDF] NP-completeness contd., Approximation algorithms. (K&T §8, Vaz. §1)
10/03 W [PDF] Approximation via local search.
10/08 M [PDF] Linear programming, LP rounding. (Vaz. §14)
10/10 W [PDF] Randomized rounding, concentration bounds. (M&R §3.2, §4.1, §4.2)
10/15 M [PDF] Randomized rounding (contd.), LP duality. (M&R §4.2, Vaz. §12)
10/17 W [PDF] LP duality, Primal-dual algorithms. (Vaz. §12, 15)
10/19 F [PDF] Primal-dual algorithms. (Vaz. §15)
10/22 M [PDF] Semi-definite Programming. (Vaz. §26)
10/24 W [PDF] SDP (contd.), Streaming algorithms.
10/26 F [PDF] Streaming algorithms (contd.).
See this survey by Muthu Muthukrishnan for some motivation behind, and math used in, streaming algorithms.
10/29 M [PDF] Online algorithms & competitive analysis. (B&E-Y §1)
Here is a nice presentation by Pat Riley & Elly Winner about different approaches to evaluating online algorithms.
10/31 W [PDF] Caching/Paging, k-server problem. (B&E-Y §3, §4, §10)
11/05 M [PDF] Caching lower bound based on Yao's principle, Work function algorithm. (B&E-Y §8.4, §10, §12)
For a complete analysis of the work function and other k-server algorithms, see these detailed lecture notes (lectures 5-9) by Yair Bartal.
11/07 W [PDF] Work function (contd.), Online learning: regret minimization & the weighted majority algorithm.
11/12 M [PDF] Mistake bound model, winnow & perceptron algorithms.
11/14 W [PDF] MB model contd., PAC model. (K&V §1, §2)
11/16 F [PDF] PAC model, Occam's razor. (K&V §1, §2)
11/19 M [PDF] Boosting in the PAC framework. (K&V §4)
11/26 M [PDF] Random Walks & Markov chains. Cover time, hitting time. (M&R §6)
12/07 F [PDF] Random Walks & Markov chains: the resistance method, and mixing time. (M&R §6)
12/10 M Markov chains wrap-up and Q-A session.
No lecture notes are available for this last lecture, however, these notes contain all of what we covered, and extra.

software engineering rajib mall ppt

2011-09-13T06:39:00.000-07:00

Prof. Rajib Mall
Ph.D.(IISc, Bangalore)

Professor
Computer Science & Engineering

Head
Administrative Computer Service Support Center

Course Lectures (Powerpoint Slides):

Lecture No. 1	Lecture No. 2	Lecture No. 3	Lecture No. 4	Lecture No. 5	Lecture No. 6	Lecture No. 7
Lecture No. 8	Lecture No. 9	Lecture No. 10	Lecture No. 11	Lecture No. 12	Lecture No. 13	Lecture No. 14
Lecture No. 15	Lecture No. 16	Lecture No. 17	Lecture No. 18	Lecture No. 19

Operations Management

2011-08-05T12:07:00.000-07:00

Operations Management

Course description: This operations management course is intended to be a survey of the operating practices and procedures found in both manufacturing and service delivery firms. We will focus our attention on those business processes and procedures used to transform inputs into finished goods and services.
Operations management focuses on the systematic planning, design, and operation of all processes required for the production of goods and the delivery of services. Thus, operations management spans almost all the real value-added activities of an organization including product and process design, customer order management, production, and service delivery. Operations management also includes many supporting value-added activities such as purchasing, material requirements planning, inventory management, project management, and process improvement. These and related topics will be covered.

Lectures by chapter or topic

Group Dynamics

Chapter 1 Introduction to Operations Management

Chapter 2 Quality Management

Chapter 3 Statistical Quality Control

Chapter 4 Product Design

Chapter 5 Service Design

Chapter 6 Processes and Technology

Chapter 7 Capacity and Facilities

Chapter S7 Facility Location Models

Chapter 8 Human Resources

Chapter 9 Project Management

Introduction to Project Management - Basics

Chapter 10 Supply Chain Management

Chapter 11 Global Supply Chain Procurement

Chapter 12 Forecasting

Chapter 13 Inventory Management

Chapter S13 Simulation

Chapter 14 Sales and Operational Planning

Chapter 15 Resource Planning

Chapter 17 Scheduling

Fault-tolerant Digital Systems

2011-08-05T12:00:00.000-07:00

Fault-tolerant Digital Systems

Course Synopsis

Our daily lives are becoming increasingly dependent on computer systems, from small, embedded computers to large-scale data centers. Any disruption in or malfunctioning of these systems can lead to devastating consequences for society as a whole. The reliability and availability of these systems is thus essential for our quality of life and for the smooth functioning of society. Therefore, it is important to build computer systems that operate correctly in the face of errors and failures.

This course focuses on the design of fault-tolerant and reliable computer systems. In particular, we will attempt to understand the root causes of faults in computer systems and their impact. We will study both traditional and cutting-edge techniques to provide fault-tolerance and error resilience. Finally, we will explore the practical applications of the techniques in the context of real systems.

An important thread that runs through the course is the evaluation of fault-tolerant systems. To this end, we will study techniques ranging from analytical modeling to empirical validation. The assignments will give you hands-on exposure to cutting edge tools and techniques for dependability evaluation, and will prepare you for the final project. You are encouraged (but not required) to work on a project related to your research interests. The final project constitutes a significant part of the grade.

Topics Covered

This is a tentative list of topics to be covered in the course. Note that these topics are subject to change.

Some slides are based on Prof. Saurabh Bagchi’s slides for “Fault Tolerant Computer System Design” (ECE 695B) at Purdue University. Used with permission.

Topic	Lectures	Sub-topics
Introduction and Overview	3	Introduction to the course, Basic concepts, Sources of faults in computer systems
Modeling and Evaluation -1	2	Probability review and discrete probability, Continuous probability and TMR
Hardware fault-tolerance	2	Architectural techniques
Modeling and Evaluation -2	2	Markov processes, Stochastic Activity Networks
Software fault-tolerance	3	N-version programming, recovery blocks, robust data structures and process pairs
Modeling and Evaluation – 3	2	Fault-injection: techniques and tools, Formal methods
Parallel and Distributed systems	4	Check-pointing and recovery, Byzantine fault-tolerance and paxos
Case Studies	2	Stratus and AT&T systems

Textbooks

There is NO required textbook. However, the following books are recommended:

D. P. Siewiorek and R. S. Swarz, Reliable Computer Systems – Design and Evaluation, 3rd edition, 1999, A.K. Peters, Limited.
K. Trivedi, Probability and Statistics with Reliability, Queuing and Computer Science Applications, 2nd edition, 2001, John Wiley & Sons.

Data Structures and Algorithms

2011-08-05T11:45:00.000-07:00

Data Structures and Algorithms

Course Contents

This is an introductory level course in Data structures and algorithms, offered by CSE dept, to students of other departments who have been permitted to register for a 'minor'. The course is meant for non-CSE, UG students. CSE/PG students should take one of the other algorithms courses being offered.The syllabus definition given for this course is available from the ASC website. It is copied here for information:
Introduction to data structures, abstract data types, analysis of algorithms. Creation and manipulation of data structures: arrays, lists, stacks, queues, trees, heaps, hash tables, balanced trees, tries, graphs. Algorithms for sorting and searching, order statistics, depth-first and breadth-first search, shortest paths and minimum spanning tree.
The course will not go into much excruciating details of various C++ implementation issues of data structures and algorithms; It will not be too top-level either. The course will focus on concepts that are 'broadly useful', not only in CSE but also other disciplines. Mostly we will study "What are some useful data structures and algorithms?”.
We will do in-class group discussions to design data structures for simpler versions of real-life applications amd programming problems. We will focus on "Why are the data structures and algorithms designed in a given way?". We will study pros-and-cons of various solutions to a given problem (Why is a particular data structure or algorithm "better" than some other?). We will also discuss "How to implement these data structures and algorithms?" in a systematic manner.

Lecture Schedule

The course is in Slot 5. There will be two lectures per week, each of 90 minutes duration.Most of the readings correspond to the sections in the following Textbooks:
[GTM]: Data Structures and Algorithms in C++ , by M. Goodrich, R. Tamassia and D. Mount, Seventh Edition.
[RS]: Algorithms in C++ , by R. Sedgewick, Third Edition.

No	Date	Topic	Reading/Slides	Remarks
-	05 Jan	No class	-	Registration still ongoing
-	07 Jan	No class	-	Institute: Techfest 2011
1	12 Jan	Introduction	-	Need for data structures, their relation with algorithms, ideas of correctnesss, complexity
2	14 Jan	C++ recap	[GTM Ch.1]	Complete this topic as self study
3	19 Jan	Arrays and Linked Lists	[RS Ch.3]	-
4	21 Jan	List processing	[RS Ch.3]	-
-	26 Jan	No class	-	Republic Day
5	28 Jan	String processing	[RS Ch.3]	-
6	02 Feb	Complexity analysis	[GTM Ch.3]	-
7	04 Feb	Quiz 1	-	10% weightage; One A4 sheet of handwritten notes allowed
8	09 Feb	Stack applications	[RS Ch.4]	Slides for Stack-Queue
9	11 Feb	Queue and Deque	[RS Ch.4]	Activity: Implementing a Queue using Stacks
-	16 Feb	No class	-	Institute Holiday
10	18 Feb	Tutorial	-	Problem-solving on topics covered so far
-	23 Feb	No class	-	Midsem week
11	25 Feb	Midsem: All topics so far	-	30% weightage; One A4 sheet of handwritten notes is allowed. Links to:Some Animations, and More animations.
12	02 Mar	Trees	[GTM Ch. 6]	-
13	04 Mar	Tree traversal	[GTM Ch. 6]	Homework 1 to be assigned
14	09 Mar	Quicksort and Mergesort	[RS Ch. 7, 8]	Elementary sorting [RS Ch. 6] - self study
15	11 Mar	Priority Queue	[RS Ch. 9]	Homework 1 is due on 14th March
16	16 Mar	Heapsort	[RS Ch. 9]	Slides for Priority Queues and Heapsort
17	18 Mar	Binary Search Trees	[GTM Ch. 9]	Homework 2 to be assigned
18	23 Mar	AVL Trees	[GTM Ch. 9]	-
19	25 Mar	Hashing	[RS Ch. 14]	Homework 2 is due on 28th March
20	30 Mar	Quiz 2: All topics after Midsem	-	10% weightage; One A4 sheet of handwritten notes is allowed.
21	01 Apr	Graphs: Data Structures	[GTM Ch. 12]	Homework 3 to be assigned
22	06 Apr	Graphs: Traversal	[GTM Ch. 12]	-
23	08 Apr	Shortest Path, MST	[GTM Ch. 12]	Homework 3 is due on 15th April
24	13 Apr	Tutorial	-	Problem-solving and Practice Test
25	15 Apr	Closure	-	More problem-solving; Last day of classes
26	28 Apr	End-sem: All topics	-	40% weightage; One A4 sheet of handwritten notes is allowed.

Speech and Natural Language Processing and the Web/Topics in Artificial Intelligence Programming

2011-08-05T11:23:00.000-07:00

Speech and Natural Language Processing and the Web/Topics in Artificial Intelligence Programming

Course contents

Sound : Biology of Speech Processing; Place and Manner of Articulation; Word Boundary Detection; Argmax based computations; HMM and Speech Recognition
Words and Word Forms : Morphology fundamentals; Morphological Diversity of Indian Languages; Morphology Paradigms; Finite State Machine Based Morphology; Automatic Morphology Learning; Shallow Parsing; Named Entities; Maximum Entropy Models; Random Fields
Structures : Theories of Parsing, Parsing Algorithms; Robust and Scalable Parsing on Noisy Text as in Web documents; Hybrid of Rule Based and Probabilistic Parsing; Scope Ambiguity and Attachment Ambiguity resolution
Meaning : Lexical Knowledge Networks, Wordnet Theory; Indian Language Wordnets and Multilingual Dictionaries; Semantic Roles; Word Sense Disambiguation; WSD and Multilinguality; Metaphors; Coreferences
Web 2.0 Applications : Sentiment Analysis; Text Entailment; Robust and Scalable Machine Translation; Question Answering in Multilingual Setting; Cross Lingual Information Retrieval (CLIR)

Texts and References

Allen, James, Natural Language Understanding, Second Edition, Benjamin/Cumming, 1995.
Charniack, Eugene, Statistical Language Learning, MIT Press, 1993.
Jurafsky, Dan and Martin, James, Speech and Language Processing, Second Edition, Prentice Hall, 2008.
Manning, Christopher and Heinrich, Schutze, Foundations of Statistical Natural Language Processing, MIT Press, 1999.
Radford, Andrew et. al., Linguistics, An Introduction, Cambridge University Press, 1999.

Journals : Computational Linguistics, Natural Language Engineering, Machine Learning, Machine Translation, Artificial Intelligence
Conferences : Annual Meeting of the Association of Computational Linguistics (ACL), Computational Linguistics (COLING), European ACL (EACL), Empirical Methods in NLP (EMNLP), Annual Meeting of the Special Interest Group in Information Retrieval (SIGIR), Human Language Technology (HLT).

Lecture Slides
23/7/09 Lecture 1 : Introduction
27/7/09 Lecture 2 : Machine Learning and NLP
28/7/09 Lecture 3 : ArgMax Computation
30/7/09 Lecture 4 : WSD : WordNet
10/8/09 Lecture 5 : Wordnet; Application in Query Expansion
11/8/09 Lecture 6 : Wiktionary; semantic relatedness; how toread research papers
19/8/09 Lecture 7 : Measures of WordNet Similarity
19/8/09 Lecture 8 : Quiz 1
25/8/09 Lecture 9 : Resnick's Measure of WordNet Similarity
27/8/09 Lecture 10 : Parsing Algorithms
31/8/09 Lecture 11 : Evidence for Deeper Structure; Top Down Parsing Algorithms
31/8/09 Lecture 12 : Noun Structure; Top Down Parsing Algorithms- contd.
01/9/09 Lecture 13 : Non-noun Structure Parsing Algorithms
03/9/09 Lecture 14 : Probabilistic parsing; sequence labeling, PCFG [ pdf ]
07/9/09 Lecture 15 : Probabilistic parsing; PCFG (contd.) [ pdf ]
08/9/09 Lecture 16 : Probabilistic parsing; computing probability of a sentence [pdf ]
10/9/09 Lecture 17 : PCFG; Arguments and Adjuncts [ pdf ]
22/9/09 Lecture 18 : Probabilistic parsing; inside-outside probabilities [ pdf ]
24/9/09 Lecture 19 : Speech : Phonetics
24/9/09 Lecture 20 : HMM - Combined Lecture with CS 621
29/9/09 Lecture 21 : Morphology - Guest Lecture by Mughdha Bapat [ pdf ]
30/9/09 Lecture 22 : Graphical Models for Sequence Labelling in NLP. - Guest Lecture by Anup Kulkarni
01/10/09 Lecture 22 : Graphical Models for Sequence Labelling in NLP (contd.).- Guest Lecture by Anup Kulkarni
05/10/09 Lecture 23 : Phonetics (contd.).
06/10/09 Lecture 24 : Consonants (place and manner of articulation) and Vowels.
08/10/09 Lecture 25 : Vowels (contd.) and a “grand” assignment.
09/10/09 Lecture 26 : Forward Backward probability; Viterbi Algorithm - Combined Lecture with CS 621
15/10/09 Lecture 27 : Phonology.
20/10/09 Lecture 28a : Sentiment Analysis and Opinions on the Web. - Guest Lecture by Aaditya Joshi.
20/10/09 Lecture 28b : Machine Translation and MT Tools - GIZA++ and Moses. - Guest Lecture by Nirdesh Chauhan [pdf ]
22/10/09 Lecture 29 : Text Entailment. - Guest Lecture by Prasad Pradip Joshi
26/10/09 Lecture 30 : POS Tagging.
27/10/09 Lecture 31 : Phonology; ASR, Speech Synthesis.
29/10/09 Lecture 32-33 : HMM and Viterbi.
02/11/09 Lecture 34 : Precision, Recall, F-score, Map.
03/11/09 Lecture 35 : Semantic Relations; UNL; Towards Dependency Parsing.
05/11/09 Lecture 36 : UNL.
11/11/09 Lecture 37 : Semantic Role Extraction.
11/11/09 Lecture 38-39 : Baum Welch Algorithm; HMM training.
Lecture slides can also be found here

Natural Language Processing

2011-08-05T11:19:00.000-07:00

Natural Language Processing

Course description:

This course will cover traditional material, as well as recent advances in the theory and practice of natural language processing (NLP) - the creation of computer programs that can understand, generate, and learn natural language. The course will introduce both knowledge-based and statistical approaches to NLP, illustrate the use of NLP techniques and tools in a variety of application areas, and provide insight into many open research problems.

class notes

Lecture	Reading material
Course overview [ppt]	-
Short Perl tutorial (I) [ppt]	One of the tutorials below [see the "Links" section]
Short Perl tutorial (II) [ppt]	One of the tutorials below [see the "Links" section]
Linguistics Essentials [ppt] Guest lecture by Ben Leong	Chap.3 [Manning & Schutze] or any book on English grammar
Language Models [ppt]	Chap.4 [Jurafsky & Martin]
Language Models [ppt]	Chap.4 [Jurafsky & Martin]
Language Models [ppt]	Chap.4 [Jurafsky & Martin]
Collocations [ppt]	Chap.5 [Manning & Schutze] [a prefinal version of this chapter is available online]
Word classes and part of speech tagging ppt]	Chap.5 [Jurafsky & Martin]
Word classes and part of speech tagging ppt]	Chap.5 [Jurafsky & Martin]
HMM Tagging. Viterbi Algorithm. [ppt]	Chap.6 [Jurafsky & Martin]
Context Free Grammars [ppt]	Chap.12-13 [Jurafsky & Martin]
Parsing with Context Free Grammars [ppt]	Chap.12-13 [Jurafsky & Martin]
Probabilistic Parsing [ppt] Guest lecture by Michael Mohler.	Chap.14 [Jurafsky & Martin]
Presentation and Workshop: "New Google Tools for Research" Mano Marks, Google Willis 136, first floor of Library 11:30am-2pm	-
Exam preparation.	All the material studied so far.
Exam I.	All the material studied so far.
Word Sense Disambiguation [ppt]	Chap. 19, 20 [Jurafsky & Martin]
Word Sense Disambiguation [ppt]	Chap.19, 20 [Jurafsky & Martin]
Word Sense Disambiguation [ppt]	Chap.19, 20 [Jurafsky & Martin]
No class.	-
Word Sense Disambiguation	-
Special topics: Subjectivity and sentiment analysis [ppt]	-
Special topics: Subjectivity and sentiment analysis [ppt]	-
Special topics: Text semantic similarity [ppt]	-
Special topics: Text classification [ppt]	-
Thanksgiving. No class.	-
Wrap-up. Project discussions. Exam II preparation.	-
Exam II.	-
Project presentations.	-
Project presentations.	-

Artificial Intelligence

2011-08-05T11:12:00.000-07:00

Artificial Intelligence

Course Overview

Artificial intelligence has a unique place in science, sharing borders with mathematics, computer science, philosophy, psychology, biology, cognitive science and others. The aim of the course is to give a broad overview of AI techniques, so that when students go into industry or research, they will be able to choose the correct AI techniques for the problems which arise.

A lot of rubbish is talked about AI in popular science and science fiction books. For instance, Roger "the Emporer's new Mind" Penrose thinks that computers will never be intelligent, whereas Kevin "the March of the Machines" Warwick thinks that they will be intelligent enough to take over the earth. Mark "the Human Computer" Jeffery thinks that computers will evolve to be human, whereas Ray "the Age of Spiritual Machines" Kurzweil thinks that humans will eventually choose to be computers. Therefore, another aim for the course is to get across an impression of the aims, achievements, motivations, origins and methodologies in AI, in order to overcome some common misconceptions.

There will be four main parts to the course: (1) Fundamentals - the basic notions of AI, in particular search and knowledge representation, and we'll apply this to game playing (2) Automated reasoning - how to get a program to deduce new facts and prove things for you (3) Machine learning - how to get a program to induce hypotheses from data and make discoveries for you, and (4) Evolutionary approaches - how to evolve programs for intelligent tasks by breeding them using crossover and mutation.

Recommended Texts

The course notes are fairly self contained. A good source of supplementary reading is Russell and Norvig's textbook:

Artificial Intelligence: A Modern Approach

Syllabus

Fundamentals
- 1. Characterisations of AI
  1.1 Long term goals; 1.2 Inspirations; 1.3 Methodologies; 1.4 Tasks;
  1.5 Techniques; 1.6 Representations; 1.7 Applications; 1.8 Products;
- 2. Intelligent agents
  2.1 Autonomous rational; 2.2 Museum tour guide; 2.3 Internal structure;
  2.4 Environments;
- 3. Search
  3.1 Specifying problems; 3.2 General considerations; 3.3 Uninformed strategies;
  3.4 Using values; 3.5 Heuristic strategies; 3.6 Assessing heuristic searches;
  3.7 Designing search agents;
- 4. Knowledge representation
  4.1 Logical representations; 4.2 Semantic networks; 4.3 Production rules;
  4.4 Frames;
- 5. Game playing
  5.1 Minimax search; 5.2 Cutoff search; 5.3 Pruning; 5.4 Games with chance;
Automated reasoning
- 6. Predicate logic representations
  6.1 Syntax and semantics; 6.2 Prolog; 6.3 Expert systems;
- 7. Making deductive inferences
  7.1 Truth tables; 7.2 Equivalence rules; 7.3 Worked example;
  7.4 Propositional rules; 7.5 First order rules; 7.6 Chains of inference;
- 8. The resolution method
  8.1 Conjunctive normal form; 8.2 Worked example; 8.3 Unification;
  8.4 Worked example; 8.5 The resolution rule;
- 9. Resolution theorem proving
  9.1 Overview; 9.2 Example proofs; 9.3 Getting resolution to work;
  9.4 Applications to mathematics; 9.5 Other topics;
Machine learning
- 10. Overview of machine learning
  10.1 Aims; 10.2 Problem constituents; 10.3 Method constituents;
  10.4 The FIND-S method; 10.5 Assessing hypotheses and methods;
  10.6 Representations;
- 11. Decision tree learning
  11.1 Decision trees; 11.2 ID3 method; 11.3 Worked example;
  11.4 Avoiding overfitting; 11.5 Appropriate problems;
- 12. Two layer artificial neural networks
  12.1 Biological motivation; 12.2 ANN representation; 12.3 Perceptrons;
  12.4 Worked example; 12.5 The learning abilities of perceptrons;
- 13. Multi-layer artificial neural networks
  13.1 Architectures; 13.2 Backpropagation; 13.3 Worked example;
  13.4 Avoiding local minima; 13.5 Overfitting considerations;
  13.6 Appropriate problems for ANNs;
- 14. Inductive logic programming
  14.1 Problem specification; 14.2 Inverting resolution;
  14.3 Search considerations; 14.4 Example session with Progol;
  14.5 Applications;
Problem Solving
- 15. Constraint satisfaction solvers
  15.1 Specifying problems; 15.2 Example; 15.3 Formal definition;
  15.4 Binary constraints; 15.5 Backtracking; 15.6 Forward checking;
  15.7 Arc consistency; 15.8 Heuristic methods; 15.9 Applications;
Evolutionary Approaches
- 16. Genetic algorithms
  16.1 Motivation; 16.2 Specifying a problem; 16.3 Encoding solutions;
  16.4 Crossover; 16.5 Mutation; 16.6 Canonical algorithm; 16.7 Applications;
- 17. Genetic programming
  17.1 Representation of programs; 17.2 Function set; 17.3 Crossover;
  17.4 Mutation; 17.5 Algorithm; 17.6 Applications;

Tutorial Questions and Answers

Tutorial 1 (Word, PDF)
Tutorial 2 (Word, PDF)
Tutorial 3 (Word, PDF)
Tutorial 4 (Word, PDF)
Tutorial 5 (Word, PDF)
Tutorial 6 (Word, PDF)
Tutorial 7 (Word, PDF)

Notes and Slides

Lecture	Notes	Slides (PPT)
1	F1: Characterisations of AI	S0 S1
2	F2: AI Agents	S2
3	F3: Search	S3
4	F4: Knowledge Representation	S4
5	F5: Game Playing	S5
6	AR1: First-Order Logic	S6 (PDF)
7	AR2: Making Deductive Inferences	S7
8	AR3: The Resolution Method	S8
9	AR4: Resolution Theorem Proving	S9
10	ML1: Machine Learning Overview	S10
11	ML2: Decision Tree Learning	S11
12	ML3: Two Layer ANNs	S12
13	ML4: Multi-layer ANNs	S13
14	ML5: Inductive Logic Programming	S14
15	Constraint Satisfaction Problems	S15
16	E1: Genetic Algorithms	S16
17	E2: Genetic Programming	S17
18	Revision Lecture (slides only)	S18
19	Exam Lecture (slides only)	S19

Introduction to Artificial Intelligence

2011-08-05T11:08:00.000-07:00

Introduction to Artificial Intelligence

Lectures

Lecture 1 | Introduction | Ch. 1-2 | 09.10.2009 | pdf
Lecture 2 | Blind Search | Ch. 3 | 09.15.2009 | pdf
Lecture 3 | Informed Search | Ch. 4.1-4.2 | 09.17.2009 | pdf
Lecture 4 | Constrained Optimization | Ch. 4.3 | 09.22.2009 | pdf
Lecture 5 | Zero-Sum Games & Adversarial Search | Ch. 6 | 09.29.2009 | pdf
Lecture 6 | Constraint Satisfaction | Ch. 5 | 10.01.2009 | pdf
Lecture 7 | Propositional Logic: Knowledge Base | Ch. 7.1-7.4 | 10.06.2009 | pdf
Lecture 8 | Inference | Ch. 7.4-7.5 | 10.13.2009 | pdf
Lecture 9 | No Good Learning & Restart Strategies | Ch. 7.6 | 10.22.2009 | pdf
Lecture 10 | First-Order Logic: Syntax and Semantics | Ch. 8 | 10.29.2009 | pdf
Lecture 11 | Inference | Ch. 9 | 10.29.2009 | pdf
Lecture 12 | Probabilistic Learning Reasoning: Bayesian Inference | Ch. 14 | 11.03.2009 | pdf
Lecture 13 | Markov Models | Ch. 15 | 11.05.2009 | pdf
Lecture 14 | Learning: Decision Trees | Ch. 18.2 | 11.12.2009 | pdf
Lecture 15 | Entropy, Pruning and Bagging | Ch. 18.3 | 11.17.2009 | pdf

Computer and Programming

2011-08-05T07:57:00.001-07:00

Computer and Programming

Lecture Slide (By Dr. Anan Pholperm )

Lecture 1 Introduction to Computer (powerpoint2000)
Lecture 2 Basic Pascal Element (powerpoint2000)
Lecture 3 Flow Chart - If then Else (powerpoint2000)
Lecture 4 While- Do (powerpoint2000)
Lecture 5 Repeat- For (powerpoint2000)
Lecture 6 Data Type (powerpoint2000)
Lecture 7 Subroutine - Procedure (powerpoint2000)
Lecture 8 Function (powerpoint2000)
Lecture 9 Array (powerpoint2000)
Lecture 10 Multi-dimension Array (powerpoint2000)

Foundation of Computer Graphics

2011-08-05T07:55:00.001-07:00

Foundation of Computer Graphics

Lecture Note

Lecture 1 Introduction and Overview (chapter 1) (.ppt format)
Lecture 2 Mathematical Foundation .(ppt format)
Lecture 3 Hardware for Graphics (.ppt format)
Lecture 4 Graphics System (.ppt)
Lecture 5 Open GL Tutorial (.ppt)
Lecture 6 Geometric Transformation (.ppt)
Lecture 7 Projection (.ppt)
Lecture 8 Clipping (.ppt)
Lecture 9 Line Algorithm (.ppt)
Additional Lecture on Line Algorithm (.ppt)

Digital System Architecture

2011-08-05T07:54:00.000-07:00

Digital System Architecture

Lecture Note

Lecture 1 Introduction and Overview of Computer Architecture (Lecture1a , Lecture 1b) (ppt format) chapter 1

Lecture 2 Computer Performance and Cost (Lecture 2a, Lecture 2b)(ppt format) chapter 1
Lecture 3 Instruction Set (Lecture3) (ppt format) chapter 2
Lecture 4 Pipelining (Lecture4) (ppt format)
Lecture 5 Computer Arithmatic (Lecture 5) (ppt format)
Supplement Computer Arithmatic (From EE5324)
Supplement Floating Point Arithmatic (From Constantine Polychronopoulos ECE411)
Supplement Booth Algorithm (From ...)
Lecture 6 Memory Hierachy Design (Lecture 6)(ppt format) (Lecture 6-1) (ppt format)
Lecture 7 Virtual Memory (Lecture 7) (ppt)
Lecture 8 I/O and Queuing Theory (Lecture 8) (ppt)

Digital Design Automation

2011-08-05T07:51:00.001-07:00

Digital Design Automation

Textbook:
Wayne Wolf, Modern VLSI Design System on Chip, 3rd Edition, Prentice Hall, 2002

Lecture Note

Lecture 0 Overview (ppt format)
Lecture 1 Introduction to VLSI (ppt format)
Lecture 2 Design Abstraction (ppt format)
Lecture 3 CMOS Processing & Fabrication (ppt format)
Lecture 4 Transistors Wires and Parasitics (ppt format)
Lecture 5 Design Rules, Layout and Stick Diagram (ppt)
Lecture 6 Combinational Logic Design (ppt)
Lecture 7 Logic Gate, Power and Other Logic Family (ppt)

Intermediate Programming in C and C++

2011-08-05T06:46:00.000-07:00

Intermediate Programming in C and C++

Course Goals	Provide a systematic introduction to the C language and C++ for students who have been previously exposed to another high-level programming language. Introduce aspects of the UNIX operating system relevant to developing C programs, such as utilities, system calls, and standard libraries
Textbook	A Book on C , by Al Kelly and Ira Pohl, Addison-Wesley, Fourth Edition 1998. ISBN: 0-201-18399-4 C How to Program, by Paul Deitel and Harvey Deitel, Prentice Hall, Fourth Edition 2004. ISBN: 0-13-142644-3 (covers both C and C++)
Major Topics Covered in Course	Basic control structures Expressions Data types Functions and parameter passing Program structures Pointers and arrays Strings Unix I/O interface Input and output system calls Program creation and debugging tools Classes and types Inheritance and object-oriented programming Exceptions and templates

NOTES:

1. C syntax 2. Input/Output
3. C PreProcessor 4. C Bitwise Operators, Unions
5. Interface with Unix
6. C++ Basic 7. Classes Part-I
8. Classes Part-II 9. C++ Operator Overloading
10. C++ Inheritance 11. C++ Polymorphism
12. C++ Stream I/O 13. C++ Templates
14. C++ Exceptions

Intermediate Programming in C and C++

2011-08-05T06:12:00.001-07:00

Intermediate Programming in C and C++


Content	Slides	Exercises	Notes

Basics, Separators in planar graphs	Prerequisites, Separators	PDF	-

Kuratowski's Theorem	Slides	PDF	-

Kuratowski's Theorem cont'd, Treewidth	-	PDF	-

Treewidth	Slides	PDF	-

Treewidth, Network Flows	-	PDF	-

Network Flows: preflow-push	Slides	PDF	-

Relabel-to-front, Equitable colorings	-	PDF	-

Equitable colorings (Hajnal-Szemerédi)	Slides	PDF	-

Fast equitable coloring; Turán-type problems	Slides	PDF	-

Erdős-Stone Theorem, Regularity Lemma	-	PDF	-

Regularity Lemma, Property Testing	Slides	PDF	-

Matchings, Tutte's Theorem	Slides	PDF	-

Maximum Matching Algorithms	Slides	-	-

DOWNLOAD FREE LECTURE NOTES SLIDES PPT PDF EBOOKS

Natural Language Processing

Embedded System

Embedded System

Instructor : Dick Steflik

Download slides here

Web Programming

Cryptography and Network Security

Cryptography and Network Security

Instructor : MahalingamRamkumar

Text : Cryptography and NetworkSecurity, Third Edition, by William Stallings, Prentice Hall,2003

Additional References

Network Security Slides

Network Security Slides

Instructor: Henning SchulzrinneProfessor and Chair in theDept. of Computer Science;also with theDept. of Electrical Engineeringat Columbia University(Contact Info)

Download slides here

Introduction to Embedded Systems

Introduction to Embedded Systems

Description

Textbook

Computational Geometry by M. de Berg et al (2nd edition) PPT Slides

Business Statistics PPT and Video

Database System Concepts PPT PDF SLIDES

Digital System Design PPT PDF SLIDES

Lecture

NETWORK SECURITY PPT PDF SLIDES

Textbooks

Schedule

Multimedia Systems PPT PDF SLIDES

Amarnath Gupta

Topics

Slides and/or Notes

Reading Assignments

WIRELESS AND MOBILE NETWORKING PPT PDF SLIDES

Professor: Katia Obraczka (katia "at" cse. ucsc. edu)

VLSI Digital System Design PDF PPT SLIDES

VLSI Digital System Design

Course Overview

Web Page

Graphs AND Algorithms PDF

Instructors

Topics

Material

Exercises

Literature

GRAPHS AND ALGORITHMS PDF PPT SLIDES

Course Description

Literature

Course Material

ADVANCED ALGORITHMS PPT PDF SLIDES

software engineering rajib mall ppt

Operations Management

Fault-tolerant Digital Systems

Fault-tolerant Digital Systems

Course Synopsis

Topics Covered

Textbooks

Data Structures and Algorithms

Course Contents

Lecture Schedule

Speech and Natural Language Processing and the Web/Topics in Artificial Intelligence Programming

Course contents

Texts and References

Lecture Slides

Lecture slides can also be found here

Natural Language Processing

Natural Language Processing

Artificial Intelligence

Artificial Intelligence

Course Overview

Recommended Texts

Syllabus

Tutorial Questions and Answers

Notes and Slides

Introduction to Artificial Intelligence

Lectures

Computer and Programming

Lecture Slide (By Dr. Anan Pholperm )

Foundation of Computer Graphics

Lecture Note

Instructor: Henning Schulzrinne
Professor and Chair in theDept. of Computer Science;also with theDept. of Electrical Engineeringat Columbia University(Contact Info)

Textbook:
Wayne Wolf, Modern VLSI Design System on Chip, 3rd Edition, Prentice Hall, 2002