LECTURE NOTES

Week	Class #	Date	Topics	Materials	References
1	1	01/17	Introduction, complex networks	intro, slides
2	2	01/22	Complex networks	slides, Summary
	3	01/24	Lifetime research	Summary
3	4	01/29	Economics, Computer Science and Policy	slides, Summary
	5	01/31	Wikipedia as a complex network and Finding boundaries for dense sensor networks	Slides (Wikipedia), Slides (Boundary), Summary
4	6	02/05	Overview of RFID. Conserving energy in RFID.	Overview Slides, Paper, Slides, Summary
	7	02/07	Linear programming and max flow background.	Overview slides, Slides (linear programming), Summary
5	8	02/12	Linear programming and its usage in formulating networking problems.	Overview slides, Slides (linear programming), Summary
	9	02/14	Self-Stabilization	slides, Summary
6	10	02/19	Quantum computing	slides, Summary	Intro
	11	02/21	Information Theory	Summary	A Mathematical Theory of Communication
7	12	02/26	RFID Security and Privacy Concerns	slides, Summary
	13	02/28	Energy-Aware Self-Stabilizing Multicast for MANETs (part 1)	Summary
8	14	03/05	Energy-Aware Self-Stabilizing Multicast for MANETs (part 2). John Quintero discussion	slides, Summary	Self-stabilization paper
	15	03/07
9			Spring break
10	16	03/19	Introduction to Discrete Fourier Transforms (DFTs)	slides, Summary
	17	03/21	Self Organizing maps	slides, Summary
11	18,19	04/01	FFT w/ MATLAB examples	Summary, slides (from pg 44 on), examples
12	20	04/02	parallelism and FFT	Summary
	21	04/04
13	22	04/09	Kalman filter example	Summary	Resource scheduling paper
	23	04/11
14	24	04/16	Cyber-Physical Systems (CPS)	Summary
	25	04/18
15	26	04/23
	27	04/29	Ken Final Presentation	Tridib Final Presentation	Guofeng Final Presentation
16	28	04/30	Krishna Final Presentation	Su Final Presentation	Corby Final Slides

READING LIST

• M.E.J. Newman, The structure and function of complex networks [pdf]
• X. Wang and G. Chen, Complex networks: small-world, scale-free and beyond, IEEE Circuits and Systems Magazine, Vol. 3, No. 1, 2003, pp.6-20. [pdf]

POLICY ON CHEATING

Any incidence of cheating in this class will be severely dealt with. This applies to homework assignments, programming assignments, quizzes and tests. The minimum penalty for cheating will be that the student will not obtain any credit for that particular assignment. (This means that if in a test and/or assignment a student is found have cheated, he/she will obtain zero in that test and/or assignment.) For the homework and the programming assignments students may discuss the problems with others, but one is expected to turn in the results of one's own effort (not the results of a friend's efforts). One tends to get very suspicious if two identically wrong results show up in the homework assignment and/or tests. The names of the offenders will be maintained in the departmental files. The repeat offenders may be debarred from the University.