Lecture Notes For All

Many of these slides have been published in several of our Purdue Cytometry CDROM series, and may be used without copyright restriction except for commercial or for profit use, PROVIDED YOU GIVE CREDIT TO THE AUTHOR, and reference this site.

Want to just listen to 2 Introductory flow cytometry lectures?? Online flow cytometry lectures -E-lectures created in 1999-2000

: "Presentation 101 for Graduate Students" This presentation is a guide for how to present a good seminar. It discusses the important aspects of a good presentation. It is a great start for graduate/postgraduate students.
Seminar presentation on (Purdue University, September 24, 2009) NEW!!
- Below are the new updated versions of the class BMS 524 "Introduction to Confocal Microscopy and Image Analysis" that have been available since 1994. Many are updated in 2007. PLEASE EMAIL ME WITH ANY ERRORS YOU FIND IN THESE SLIDES !!!
TIPS and FIXES for POWERPOINT _ how to embed FLASH, Fixes for SOUND FILE problems etc

Lecture	Title	Prof	Size	PPT: or Video View
	GRAD STUDENTS.... "Presentation 101 for Graduate Students"	JPR		Some help preparing your seminars...
	IF YOU USE OUR SLIDES....PLEASE GIVE PROPER CREDIT
1	The Principles of Microscopy Part 1 [49 slides]	JPR	6.153 Meg	PPT
2	The Principles of Microscopy Part 2 [41 slides]	JPR	2.714 Meg	PPT
3	Image Formats and Image Manipulations [29 slides]	SK	5.794 Meg	PPT---
4	The Principles of Microscopy Part 3 [31 slides]	JPR	4.265 Meg	PPT---VIEW the video lecture
5	Fluorescence and Fluorescent Probes [52 slides]	JPR	7.46 Meg	PPT:::: VIEW the video lecture
6	The Principles of Confocal Microscopy [44 slides]	BR	5.022 Meg	PPT---VIEW the video lecture
7	3D Imaging, Rotations and Stereo Imaging [33 slides]	JPR	3.163 Meg	PPT
8	Principles of 2D image analysis - Morphometry (I) [46 slides]	JPR	1.623 Meg	PPT---VIEW the video lecture
9	Applications of Morphometry (II) [36 slides]	JPR	9.237 Meg	PPT---VIEW the video lecture
10	Live Cell Imaging Application in Confocal Microscopy [38 slides]	JPR	9.545 Meg	PPT
11	Applications of Confocal Microscopy [24 slides]	JPR	2.349 Meg	PPT
12	Sample Preparation of Confocal Microscopy [25 slides]	JPR	8.4 Meg	PPT--- VIEW the video lecture
13	Additional Applications of Confocal Microscopy [25 slides]	BR

	IF YOU USE OUR SLIDES....PLEASE GIVE PROPER CREDIT

JPR=Dr. J. Paul Robinson, Purdue University Cytometry Laboratories; BR=Dr. Bartek Rajwa, PUCL; SK=Steve Kelley PUCL

(Used in my Graduate class BMS 631 - (versions these slides have been made publicly available since 1991. J. Paul Robinson, Professor, Purdue University Cytometry Laboratories. They are based on Howard Shaprio's great text "Practical Flow Cytometry" and many have page numbers to reference the material in that text.
These lectures are updated more frequently on the regular class page at this page

A	Introductory flow cytometry: Part 1- E-lecture - automated online lecture	JPR	Listen	63 Minutes
B	Introductory flow cytometry: Part 2- E-lecture - automated online lecture	JPR	Listen	60 minutes
1	Fluorescence Quantitation - An overview of the salient issues including QC	JPR	15.4 Megs	PPT
2	BMS 631 - LECTURE 1 Flow Cytometry: Theory (2006)	JPR	28.8 Megs	PPT
3	BMS 631 Flow Cytometry: Theory - Lecture 2 Whos and whys of flow cytometry - History(2006)	JPR	8.32 Megs	PPT
4	BMS 602A/631 - Lecture 3: : Light and Matter (2006)	JPR	0.68 Megs	PPT
5	BMS 602A/631: Lecture 4 : Light and Fluorescence (2005)	JPR	0.51 Megs	PPT
6	BMS 631 – Lecture 5: Properties and Applications of Light Sources (2005)	JPR	3.34 Megs	PPT
7	BMS 631 - Lecture 6: : Optical Systems (2005)	JPR	24.53 Megs	PPT
8	BMS 631 - Lecture 7: Optics - Filter Properties & manipulation of light in flow cytometry (2005)	JPR	0.17 Megs	PPT
9	BMS 631: Lecture 8: Detectors (2004)	JPR	2.8 megs	PPT
10	BMS 631 - Lecture: Flow systems and hydrodynamics (2005)	JPR	8.41 Megs	PPT
11	BMS 631 - Lecture 10: Multiparameter data analysis (2004)	JPR	1.71 Megs	PPT
	IF YOU USE OUR SLIDES....PLEASE GIVE PROPER CREDIT

These lectures are undated, but many have been here for many years, so they may not be as up updated as you might like...

Introduction to Flow Cytometry - 1 28 Slides by Dr. J. Paul Robinson Download the PPT file 5.3 Megs
Introduction to Flow Cytometry -2 32 Slides by Dr. J. Paul Robinson Download the PPT file 1.05 Megs
Flow Cytometry Lecture 3 - Light and Matter 28 Slides by Dr. J. Paul Robinson Download the PPT file 213 K
Flow Cytometry lecture 4 - Optical Systems 29 Slides by Dr. J. Paul Robinson Download the PPT file 1.94 Megs
Flow Cytometry Lecture 5 - Light Sources and Optical Systems 26 Slides by Dr. J. Paul Robinson Download the PPT file 3.9 Megs
Flow Cytometry Lecture 6 - Optics: Filter Properties 41 Slides by Dr. J. Paul Robinson Download the PPT file 235 K
Flow Cytometry Lecture 7 - Detectors & Fluidics 54 Slides by Dr. J. Paul Robinson Download the PPT file 9.7 Megs
Flow cytometry lecture 8 - Electronic measurements & Signal Processing 24 Slides by Dr. J. Paul Robinson Download the PPT file 95 K
Flow Cytometry Lecture 9 - Data Collection: Linear, Log, Ratios... 24 Slides by Dr. J. Paul Robinson Download hte PPT file 292 K

General Flow Cytometry lectures (note some have not been updated for several years)
IF YOU USE OUR SLIDES....PLEASE GIVE PROPER CREDIT

Basic flow cytometry theory [17 slides] Dr. J. Paul Robinson, Purdue University Cytometry Laboratories
DNA analysis [28 slides] Dr. J. Paul Robinson, Purdue University Cytometry Laboratories
Multiple Color Analysis [3 slides] Dr. William Telford, Flow Lab at Hospital for Special Surgery, New York, NY
Light Scatter [2 slides] Dr. William Telford, Flow Lab at Hospital for Special Surgery, New York, NY
Excitation / Emission peaks[9 slides] Dr. William Telford, Flow Lab at Hospital for Special Surgery, New York, NY
Applications [14 slides] Dr. J. Paul Robinson, Purdue University Cytometry Laboratories
Antibody Binding [49 slides] Dr. Carleton Stewart, (Retired)
Multiparameter Immunofluorescence [67 slides] Dr. Carleton C. Stewart, Ph.D. & Sigrid J. Stewart, (Retired)
Compensation [16 slides] Dr. Carleton C. Stewart, Ph.D. & Sigrid J. Stewart, (Retired)
Simultaneous Measurement of Necrotic, Apoptotic Dead and Live Cells [4 slides] Dr. Carleton Stewart, (Retired)
Immunophenotyping Leukemias & Lymphomas [23 slides] Dr. Carleton Stewart, (Retired)
Breast Cancer: DNA Content & Relevant Markers [4 slides] Dr. Carleton Stewart, (retired)
Automated Reticulocyte Analysis [27 slides] B. H. Davis
Immunophenotyping of Hematopoietic Progenitor Cells by Multiparameter Flow Cytometry [20 slides] Dr. Carleton Stewart, (retired)
IF YOU USE OUR SLIDES....PLEASE GIVE PROPER CREDIT

Introductory Digital Systems Laboratory

2011-05-17T15:39:00.000-07:00

Introductory Digital Systems Laboratory

Course Highlights

This course features videos of the students' ambitious and impressive finalprojects and a complete set of lecture notes.

Course Description

6.111 is reputed to be one of the most demanding classes at MIT, exhausting many students' time and creativity. The course covers digital design topics such as digital logic, sequential building blocks, finite-state machines, FPGAs, timing and synchronization. The semester begins with lectures and problem sets, to introduce fundamental topics before students embark on lab assignments and ultimately, a digital design project. The students design and implement a final digital project of their choice, in areas such as games, music, digital filters, wireless communications, video, and graphics. The course relies on extensive use of Verilog® for describing and implementing digital logic designs on state-of-the-art FPGA.

Special Features

Student projects

Technical Requirements

Special software is required to use some of the files in this course: .rm, .ucf, .v.

Click Below to Download the files :-

Lecture Notes

SES #	TOPICS
L1	Introduction (PDF)
L2	Combinational logic (PDF)
L3	Introduction to Verilog® - combinational logic (PDF)
L4	Sequential building blocks (PDF)
L5	Simple sequential circuits and Verilog® (PDF)
L6	Finite-state machines and synchronization (PDF)
L7	Memory basics and timing (PDF)
L8-L9	Arithmetic structures (PDF)
L10	Analog building blocks (PDF)
L11	System integration issues and major/minor FSM (PDF)
L12	Reconfigurable logic architecture (PDF - 1.3 MB)
L13	Video (PDF - 4.0 MB)
L14	Project kickoff (PDF)
L15	LSI integration and performance transformations (PDF - 1.1 MB)
L16	Power dissipation in digital systems (PDF)

Introduction to Web Design

2011-05-17T15:38:00.000-07:00

Introduction to Web Design

Your First Web Page

Video Segment	Code/Notes
Basic HTML
Validation	tplt.html validate.html

Adding CSS

Video Segment	Code/Notes
Colors in CSS	Color Demo
Fonts in CSS	Font Notes Font Demo

Introduction to Binary

Video Segment	Code/Notes
Intro to Binary	Number Systems.ppt binlights.html legomover.html
Binary to Base 10 Conv.
Octal and Hexadecimal

Internet Addressing

Video Segment	Code/Notes
Internet Addressing	Protocols.ppt Online Article (LAN) InternetMagic.html
Other Protocols	Protocols.ppt Online Article (LAN) InternetMagic.html

Learning About Linux

Video Segment	Code/Notes
Overview of Unix	Unix.ppt
Basic Unix Commands
Permissions
Extending Unix Commands

Color and Images

Video Segment	Code/Notes
Science of Color	ScienceOfColor.ppt Color Applets
Creating Images
Gif (Transparency)	Images.ppt

Learning Emacs

Video Segment	Code/Notes
Emacs	Emacs.ppt guide to emacs
Emacs: Files, Windows, Buffers	Emacs.ppt guide to emacs

XHTML Images, Links, and Lists

Video Segment	Code/Notes
Images	image notes twoPi.jpg bgPattern1.jpg bgPattern2.jpg bgPattern3.jpg
Links	link notes new page
Lists	list notes list demo

Layout with CSS

Video Segment	Code/Notes
Borders and the Box Layout	Box / Border notes Box / Border demo boxModel.gif
CSS Layout with Float	Float Layout notes Float Layout Demo Diagram of layout
Buttons in CSS	Button notes Vertical button demo Horizontal button demo

Tables

Video Segment	Code/Notes
Basic Tables	basicTable.html TableBasics.ppt

Managing CSS

Video Segment	Code/Notes
CSS Levels	CSS Levels notes globalStyle.html myStyle.css second.html
Cross-Browser CSS	Cross-Browser Notes CSS Buttons Improved CSS Buttons

Multimedia

Video Segment	Code/Notes
Adding Audio	AddingSound.ppt soundEffects.html
Multimedia With Flash	plane.html
Multimedia with Wax	waxPlane.html debugmode.com
Basic Image Swapping	imageSwap.html
Rollover Buttons	mouseOver.html
Extending HTML	cgispy.com dynamicdrive.com

Introduction to VLSI Design

2011-05-17T08:44:00.000-07:00

Introduction to VLSI Design

Click here to download the files:-

Project 1.35um.pdf	06-Oct-2001 00:29	573K
Project 2.35um.pdf	06-Oct-2001 00:29	376K
Project 3.35um.pdf	06-Oct-2001 00:30	142K
Project 4.35um.pdf	06-Oct-2001 00:30	81K
Project 5.pdf	06-Oct-2001 00:30	75K
Project 6.pdf	06-Oct-2001 00:30	99K
SPICE_brief_manual.zip	06-Oct-2001 00:43	1.2M
Training_manuals/	20-Mar-2001 23:41	-
VLSI³] p¾É½×.pdf	06-Oct-2001 00:30	6.3M
VLSI³] p¾É½×.ppt	06-Oct-2001 00:30	1.5M
ch5.PDF	06-Oct-2001 00:29	29K

	VLSI³] p¾É½×.pdf	15-Oct-2001 22:47	6.3M
	VLSI³] p¾É½×.ppt	15-Oct-2001 22:47

Introduction to Software Engineering in Java

2011-05-17T08:41:00.000-07:00

Introduction to Software Engineering in Java

Course Description

This course is an introduction to Java™ programming and software engineering. It is designed for those who have little or no programming experience in Java and covers concepts useful to 6.005. The focus is on developing high quality, working software that solves real problems. Students will learn the fundamentals of Java, and how to use 3rd party libraries to get more done with less work. Each session includes one hour of lecture and one hour of assisted lab work. Short labs are assigned with each lecture.

This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.

Technical Requirements

Special software is required to use some of the files in this course: .java.

Click Below to Download the files :-

Lecture Notes

SES # TOPICS

1 Variables, operators, types (PDF)

2 More types, methods, conditionals (PDF)

3 Loops, arrays (PDF)

4 Classes, objects (PDF)

5 Packages, containers, using objects (PDF)

6 Object-oriented programming, inheritance, abstract classes and interfaces (PDF)

7 Good programming skills, collections, exceptions (PDF)

8 Java I/O, testing and debugging (PDF)

An Introduction to Queueing Systems

2011-05-17T08:39:00.001-07:00

An Introduction to Queueing Systems

Table of Contents
Chapter 1
Introduction

Chapter 2
Basic Queueing Theory

Chapter 3
Analysis of the M/G/1 Queue in Equilibrium

Chapter 4
Advanced Queueing Theory

Chapter 5
Fundamentals of Queueing Networks

Chapter 6
Advanced Queueing Networks

Chapter 7
Simulation Techniques for Queues and Queueing Networks

Click on the links above for more detailed information on the contents of individual chapters. Sample sections are also provided.
Please write to skb@ieee.org if you have problems downloading any of the material on this and other linked web pages
This book is available from Kluwer/Plenum Publishers . Please visit the publisher's web site for this book for ordering and other publication information .

Slides for Lectures Based on the Book
If you are teaching a course on Queueing Theory based on the book "An Introduction to Queueing Systems" and would like to use the original Power Point slides, please write to me at skb@ieee.org or skb@iitk.ac.in

Click here to download slides :-

Slide Set 1 (Chapter 1) An Introduction to Queues and Queueing Theory
Slide Set 2 (Sections 2.1 - 2.2) Stochastic Processes, Markov Chains etc.
Slide Set 3 (Sections 2.3 - 2.5) Basic Queueing Theory - I (Analysis of M/M/-/- Type Queues)
Slide Set 4 (Sections 2.6 - 2.10) Basic Queueing Theory - II (Departures, Method of Stages, Batch Arrivals)
Slide Set 5 (Chapter 3) Analysis of the simple M/G/1 Queue (Residual Life, Imbedded Markov Chain)
Slide Set 6 (Additional Notes) Method of Supplementary Variables for the M/G/1 Queue
Slide Set 7 (Sections 4.1 - 4.3) M/G/1 Queue with Vacations and Exceptional First Service
Slide Set 8 (Section 4.4) M/G/1 Queue with Batch Arrivals
Slide Set 9 (Section 4.5) Priority Operation of the M/G/1 Queue
Slide Set 10 (Additional Notes) Analysis of M/M/n/K Queue with Multiple Priorities
Slide Set 11 (Additional Notes) Basic Model of Finite Capacity Single Server M/G/1/K Queue
Slide Set 12 (Additional Notes) The G/M/1, G/G/1, G/G/m, and M/G/m/m Queues
Slide Set 13 (Chapters 5,6) Queueing Networks - I (Classification and Basic Concepts)
Slide Set 14 (Chapter 5) Open and Closed Jackson Networks
Slide Set 15 (Chapter 5) Analysis of Closed Networks (Convolution and MVA Algorithms)
Slide Set 16 (Chapters 5, 6) Queueing Networks - II
QNAT Slides The QNAT Package
Slide Set 17 (Chapter 7) Simulation of Queues and Queueing Networks
Slide Set 18 (Section 4.6) Discrete Time Queues

Additional Queueing Related Material

Analysis of a M/G/1/K queue without vacations
Analysis of a M/G/1/K queue with vacations - exhaustive service with single/multiple vacations
Analysis of a M/G/m/m queue
Another look at the M/G/1 queue (includes the Method of Supplementary Variables)
Analysis of the G/M/1 queue
Analysis of M/M/n/K queues with preemptive and non-preemptive priorities
Analysis of a M/G/1/-/N queue

Introduction to Probability and Statistics

2011-05-17T08:24:00.000-07:00

Introduction to Probability and Statistics

Level:

Undergraduate

Instructors:

Prof. Dmitry Panchenko

Course Features

Course Description

Figure showing the union of events. (Image courtesy of Prof. Dmitry Panchenko.)

Course Features

Lecture notes
Exams (no solutions)

Course Description

This course provides an elementary introduction to probability and statistics with applications. Topics include: basic probability models; combinatorics; random variables; discrete and continuous probability distributions; statistical estimation and testing; confidence intervals; and an introduction to linear regression.

Lecture Notes

The lecture notes were taken by Anna Vetter, a student in the class.

LEC #	TOPICS	LECTURE NOTES
1	Probability, Set Operations	(PDF)
2	Properties of Probability Finite Sample Spaces, Some Combinatorics	(PDF)
3	Multinomial Coefficients, Union of Events	(PDF)
4	Matching Problem, Conditional Probability	(PDF)
5	Independence of Events	(PDF)
6	Solutions to Problem Set 1	(PDF)
7	Bayes' Formula	(PDF)
8	Random Variables and Distributions	(PDF)
9	Cumulative Distribution Function	(PDF)
10	Marginal Distributions	(PDF)
11	Conditional Distributions, Multivariate Distributions	(PDF)
12	Functions of Random Variables, Convolution	(PDF)
13	Functions of Random Variables: Sum, Product, Ratio, Maximum, Change of Variables	(PDF)
14	Linear Transformations of Random Vectors, Review of Problem Set 4	(PDF)
15	Review for Exam 1	(PDF)
16	Expectation, Chebyshev's Inequality	(PDF)
17	Properties of Expectation, Variance, Standard Deviation	(PDF)
18	Law of Large Numbers, Median	(PDF)
19	Covariance and Correlation, Cauchy-Schwartz Inequality	(PDF)
20	Poisson Distribution, Approximation of Binomial Distribution, Normal Distribution	(PDF)
21	Normal Distribution, Central Limit Theorem	(PDF)
22	Central Limit Theorem, Gamma Distribution, Beta Distribution	(PDF)
23	Estimation Theory, Bayes' Estimators	(PDF)
24	Bayes' Estimators	(PDF)
25	Maximum Likelihood Estimators	(PDF)
26	Chi-square Distribution, t-distribution, Confidence Intervals for Parameters of Normal Distribution	(PDF)
27	Confidence Intervals for Parameters of Normal Distribution	(PDF)
28	Review for Exam 2	(PDF)
29	Hypotheses Testing, Bayes' Decision Rules	(PDF)
30	Most Powerful Test for Two Simple Hypotheses	(PDF)
31	t-test	(PDF)
32	Two-sample t-test, Goodness-of-fit Tests, Pearson's Theorem	(PDF)
33	Simple Goodness-of-fit Test, Composite Hypotheses	(PDF)
34	Contingency Tables, Tests of Independence and Homogeneity	(PDF)
35	Kolmogorov-Smirnov Goodness-of-fit Test	(PDF)
36	Review of Test 2	(PDF)
37	Review for the Final Exam	(PD

Introduction to Probability and Statistics

2011-05-17T08:19:00.000-07:00

Introduction to Probability and Statistics

Instructor:	Kristin Sainani kcobb@stanford.edu www.stanford.edu/~kcobb Office: T211, HRP Redwood Building Office Hour: 1-2pm Monday
TA	Richard Chiu richard2@stanford.edu Office Hour: 10:30-11:30am Wed., T214 HRP Redwood Building
Schedule:	MW 4:15-5:45pm in CCSR 4105 LAB DAYS (M206): Oct. 21, 28; Nov. 4, 11, 18
Syllabus:	· Syllabus
Lectures:	· September 21, 2009: Math Review · Sept. 23, 2009: Looking at Data · Sept. 28, 2009: Permutations and Combinations · Sept. 30, 2009: Conditional Probability · Oct. 5, 2009: Probability Distributions · Oct. 7, 2009: Discrete Distributions: the binomial · Oct. 12, 2009: The Normal Distribution · Oct. 14, 2009: Statistical Inference · Oct. 19, 2009: One sample tests · Oct. 26, 2009: Pitfalls of hypothesis testing · Nov. 2, 2009: Two-sample Tests I · Nov. 9, 2009: Two-sample Tests II · Nov. 16, 2009: More than two samples · Nov. 30, 2009: Linear regression
Homework:	· H1, due Wed. Sept. 23 · H2, due Mon. Sept. 28 · H3, due Wed. Sept. 30 · H4, due Mon. Oct. 5 · H5, due Wed. Oct. 7 · H6, due Mon. Oct. 12 · H7, due Wed. Oct. 14 · H8, due Mon. Oct. 19 · H9, due Wed. Oct. 21 · H10, due Mon. Nov. 2 · H11, due Wed. Nov. 4 · H12, due Wed. Nov. 11 · H13, due Mon. Nov. 16 · H14, due Wed. Nov. 18 · H15, due Wed. Dec. 2
Labs:	· Oct. 21, 2009: Intro. to SAS and Central Limit Theorem · Oct. 28, 2009: Intro. to data in SAS; analyzing 2x2 tables · Data for Lab 2 · Nov. 4, 2009: Ttests and non-parametric equivalents · Data for Lab 3 · Nov. 11, 2009: linear regression and ANOVA · Data for Lab 4 · Nov. 18, 2009: linear regression model building · Data for Lab 5
Extras:	· A caution on interpreting odds ratios (letter) · Monty Hall problem · Monty Hall problem in the New York Times · Dice exercise · Extra probability problems (optional) · Extra probability answers · P-value column · Statistical Roadmap for two-sample tests · Handy Reference Sheet I (probability) · Handy Reference Sheet II (statistics) · Extra practice problems for final exam · Answers to extra practice problems
Answers:	· H1, Answer Key · H2, Answer Key · H3, Answer Key · H4, Answer Key · H5, Answer Key · H6, Answer Key · H7, Answer Key · H8, Answer Key · H9, Answer Key · H10, Answer Key · H11, Answer Key · H12, Answer Key · H13, Answer Key · H14, Answer Key · H15, Answer Key
Exams:	· Midterm Exam, due Oct. 28 · Final Exam, due Dec. 11

Introduction to Neural Networks

2011-05-17T08:14:00.000-07:00

Introduction to Neural Networks

Topics covered:

Artificial Neural Network Theory, models and architectures, neurobiological basis, learning theory, applications and hardware implementation issues.

Textbook:

Applications of Neural Networks in Electromagnetics (first 6 chapters) by Christos Christodoulou, and Michael Georgiopoulos, Artech House, 2001 (recommended).

Useful References:

Introduction to Neural Networks, by J. M. Zurada, West Publishing Company, 1992.

Neural Networks, A Comprehensive Foundation, by Simon Haykin, Prentice Hall, second edition, 2001.

Neural Network Design, by Hagan, Demuth and Beale, PWS Company, 1996.

Perceptrons (Expanded Edition), by Minsky and Papert, 1988.

Pattern Recognition Principles, by Duda and Hart, 2001.

Instructor:

Dr. Michael Georgiopoulos, Engineering Building 1, Room 407, Te; (407) 823-5338, E-Mail: michaelg@mail.ucf.edu

Obeus.com - The Democratic Ads

Objectives:

The objectives of this course is to examine the fundamental concepts of neural network computing from the theoretical, as well as from the applications point of view. A variety of neural network architectures with their associated learning algorithms are going to be examined thoroughly. Furthermore, successful applications of neural networks will be discussed. Comparisons of the neural network architectures with already existing approaches will be conducted, whenever data are available.

Prerequisites by Topic:

From the catalog data, it appears that the course has as a prerequisite the Pattern Recognition class (EEL 5825). Although having a background in pattern recognition will help you understand the material of the course faster, EEL 5825 is not a hard prerequisite. In other words, the material presented in this class is self-contained. The mathematical prerequisites are the standard calculus courses, material that is normally covered in the first two years of the standard engineering, computer science, or physics curriculum. Finally, to achieve the full benefit of the material some programming experience in a high-level language, such as C, C++, Fortran or MATLAB is needed.

Course Outline:

Introduction to Neural Networks:

Preliminaries
Benefits of Neural Networks
Types of Activation Functions
Multi-Layer Feed-Forward Networks
Learning Procedures (Supervised, Unsupervised, Hybrid Learning)
Learning Tasks (Association, Pattern Classification, Clustering, Prediction)
Knowledge Representation
Brief History of Neural Networks

Single-Layer and Multi-Layer Perceptrons

The Single-Layer Perceptron
Perceptron Learning Algorithm
A Geometrical Interpretation of the Perceptron Learning Algorithm
Adaline Network
Multi-Layer Perceptron
The Back-Propagation Algorithm
Issues with the Back-Propagation Algorithm
Variations of the Back-Propagation Algorithm
Applications

Radial Basis Functions – Kohonen Networks

Preliminaries of Radial Basis Function Networks
Learning Strategies with Radial Basis Function Networks

Ø Fixed Centers selected at random.

Ø Self-Organized selection of centers

Ø Supervised selection of centers

Ø Supervised selection of centers and variances

A Radial Basis Function Neural Network Algorithm
Issues with Radial Basis Function Learning
The General Regression Neural Network (GRNN)
Applications

Adaptive Resonance Theory Neural Networks

The Fuzzy ARTMAP Neural Network
The Fuzzy ARTMAP Architecture
Operating Phases of the Fuzzy ARTMAP Architecture
Geometrical Interpretation of the Fuzzy ARTMAP Learning
Properties of Learning in Fuzzy ARTMAP
Applications

Recurrent Neural Networks (or other topic)

Preliminaries of Associative Memories
The Hopfield Model
Optimization Problems using the Hopfield model
The RTRL Neural Network
The Elman Neural Network

Notes :

Backpropagation
Neuron Model and Network Architectures
Chapter 1 Notes
Chapter 2 Notes
Chapter 3 Notes
Chapter 4 Notes
Chapter 5 Notes

Introduction to Modern Cryptography Notes

2011-05-17T08:10:00.000-07:00

Introduction to Modern Cryptography Notes

By: Mihir Bellare and Phillip Rogaway
Introduction to Modern Cryptography notes ppt ( lectures powerpoint slides ). It is a collection of lectures notes not ours. Plese Click bellow to download ppt slides/ pdf notes. If you face any problem in downloading then give your suggetion as comment by clicking on comment link bellow the post (bottom of page) or email us in this address <engineeringppt.blogspot@gmail.com>. I will must consider your comments only in 1-2 days. Thank you very much for visit our site

Chapter	Notes	Slides
Introduction	postscript ; pdf	pdf
Block ciphers	postscript ; pdf	pdf
Pseudorandom functions	postscript ; pdf	pdf
Symmetric encryption	postscript ; pdf	pdf
Hash functions	postscript ; pdf	pdf
Message authentication	postscript ; pdf	pdf
Computational number theory	postscript ; pdf	pdf
Number-theoretic primitives	postscript ; pdf	pdf
Asymmetric encryption	postscript ; pdf	pdf
Digital signatures	postscript ; pdf	pdf
Key distribution	-	pdf

Appendix	Notes
The birthday problem	postscript ; pdf

Introduction to Meteorolog

2011-05-17T08:08:00.000-07:00

Introduction to Meteorolog

Karl Schulze's ES 1110 Lecture Notes (Introduction to Meteorology)

Introduction to the Atmosphere

Chapter 1 (.doc file)

Chapter 1 Powerpoint

The Energy Cycle

Chapter 2 (.doc file)

Chapter 2 Powerpoint

Temperature

Chapter 3 (.doc file)

Chapter 3 Powerpoint

Unit2

Water in the Atmosphere

Chapter 4 (.doc file)

Chapter 4 Powerpoint

Meteorological Observations

Chapter 5 (.doc file)

Chapter 5 Powerpoint

Weather Forecasting

Chapter 13 (.doc file)

Chapter 13 Powerpoint

Unit 3

Atmospheric Forces and Wind

Chapter 6 (.doc file)

Chapter 6 Powerpoint

Global Scale Winds

Chapter 7 (.doc file)

Chapter 7 Powerpoint

Air Masses and Fronts

Chapter 9 (.doc file)

Chapter 9 Powerpoint

Extratropical Cyclones and Anticyclones

Chapter 10 (.doc file)

Chapter 10 Powerpoint

Unit 4

Oceanography

Chapter 8 (.doc file)

Chapter 8 Powerpoint

Thunderstorms

Chapter 11 (.doc file)

Chapter 11 Powerpoint

Small-Scale Winds

Chapter 12 (.doc file)

Chapter 12 Powerpoint

Introduction to MATLAB Notes PDF

2011-05-17T08:06:00.000-07:00

Introduction to MATLAB Notes PDF

Inset of a Julia Set; see the Wikipedia article for more information. In assignment 3, students are asked to write MATLAB® code to generate this and other fractals. (Image courtesy of course instructors.)

Course Highlights

This one-week course features a complete set of lecture notes and assignments.

Course Description

This course provides an aggressively gentle introduction to MATLAB®. It is designed to give students fluency in MATLAB, including popular toolboxes. The course consists of interactive lectures with a computer running MATLAB for each student. Problem-based MATLAB assignments are given which require significant time on MATLAB.

This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.

Technical Requirements

Special software is required to use some of the files in this course: .m and .mdl

Click Below to Download the files :-

Lecture Notes

Special software is required to use some of the files in this section: .mdl.

SES #	TOPICS
1	Variables, operations, and plotting (PDF)
2	Visualization and programming (PDF)
3	Solving equations and curve fitting (PDF)
4	Advanced methods (PDF)
5	Simulink® (PDF) (MDL)

Introduction to Material Science

2011-05-17T08:03:00.000-07:00

Introduction to Material Science

(... to Prof. Peel's faculty web page)

All lecture notes, exam reviews, etc, on this web page are for the sole use of MEEN 3344 students at Texas A&M University - Kingsville. Student "Show & Tell" presentations are for reference purposes only. All show & tell data should be verified independently, and should not be used for other courses without permission.

Lecture Notes for Callister's Fundamentals 3e.

Chapter 1 (updated F09)

Chapter 2 (updated F09) b&w text 2nd ed, password protected

Chapter 3

Chapter 4

Chapter 5

Chapter 6 (diffusion software w/ passwd)

Chapter 7 (updated to 3rd ed)

Chapter 8

Chapter 9

Chapter 10 (shortened

Chapter 11 (shortened)

Chapter 13 & 14

Chapter 15 composites

Chapter 16 (corrected PowerPoint file, modified Wiley lecture on corrosion)

Corrosion Examples (Eduardo Hernandez, Lina Du, John Martinez, Stephen Bump, Michael Bauer)

Chapter 17

Chapter 12 (mod Wiley lecture)

Material Selection & Design Tips

Wiley/Penn State Lect. Notes for Callister's 6th ed. (ppt). These lectures notes are publicly available.

Chapter 22 (Materials Selection & Design)

Introduction to Linear Dynamical Systems

2011-05-17T07:50:00.000-07:00

Introduction to Linear Dynamical Systems

Textbook and optional references

There is no textbook. Everything we’ll use is posted on the 263 website in pdf format. This year the course reader, which is nothing but a collection of all the material on this website, won’t be available at the bookstore. If you want hardcopy, you can print the course reader yourself, or you can have it printed and bound at, for example, Fedex-Kinko’s in Tresidder, at cost of around $20.

Several texts can serve as auxiliary or reference texts:

Linear Algebra and its Applications, or the newer book Introduction to Linear Algebra, G. Strang.
Introduction to Dynamic Systems, Luenberger, Wiley.

You really won’t need these books; we list them just in case you want to consult some other references.

Prerequisites

Exposure to linear algebra and matrices (as in Math. 103). You should have seen the following topics: matrices and vectors, (introductory) linear algebra; differential equations, Laplace transform, transfer functions. Exposure to topics such as control systems, circuits, signals and systems, or dynamics is not required, but can increase your appreciation.

Description

Introduction to applied linear algebra and linear dynamical systems, with applications to circuits, signal processing, communications, and control systems. Topics include: Least-squares aproximations of over-determined equations and least-norm solutions of underdetermined equations. Symmetric matrices, matrix norm and singular value decomposition. Eigenvalues, left and right eigenvectors, and dynamical interpretation. Matrix exponential, stability, and asymptotic behavior. Multi-input multi-output systems, impulse and step matrices; convolution and transfer matrix descriptions. Control, reachability, state transfer, and least-norm inputs. Observability and least-squares state estimation.

Lecture Slides

Professor Stephen Boyd, Stanford University, Autumn Quarter 2008-09

All lectures, in 2up format, in one pdf file

Lecture Videos

Professor Stephen Boyd, Stanford University, Autumn Quarter 2008-09

This is a complete list of videos from last year (Autumn Quarter 2007-08)..

Lecture	Slides
Sep 25 ’07	1-1 to 1-24	Flash	iTunes
Sep 27 ’07	2-1 to 2-22	Flash	iTunes
Oct 2 ’07	2-23 to 3-8	Flash	iTunes
Oct 4 ’07	3-9 to 4-4	Flash	iTunes
Oct 9 ’07	4-2 to 5-2	Flash	iTunes
Oct 11 ’07	5-2 to 6-4	Flash	iTunes
Oct 16 ’07	6-4 to 7-2	Flash	iTunes
Oct 18 ’07	7-2 to 8-2	Flash	iTunes
Oct 23 ’07	8-2 to 9-9	Flash	iTunes
Oct 25 ’07	9-9 to 9-26	Flash	iTunes
Oct 30 ’07	10-1 to 10-20	Flash	iTunes
Nov 1 ’07	11-1 to 11-18	Flash	iTunes
Nov 6 ’07	11-18 to 12-9	Flash	iTunes
Nov 8 ’07	12-9 to 13-16	Flash	iTunes
Nov 13 ’07	13-17 to 15-9	Flash	iTunes
Nov 15 ’07	15-10 to 15-24	Flash	iTunes
Nov 27 ’07	15-25 to 16-15	Flash	iTunes
Nov 29 ’07	16-15 to 18-6	Flash	iTunes
Dec 4 ’07	18-6 to 18-30	Flash	iTunes
Dec 6 ’07	18-30 to 20-6	Flash	iTunes

Support Notes

Professor Stephen Boyd, Stanford University, Autumn Quarter 2008-09

Additional background notes.

Basic notation
Matrix primer notes (slides 1 | slides 2 | slides 3 | quizzes)
(All of this material should be very familiar to you.)
Crimes against matrices
Least squares and least norm solutions using Matlab
Solving general linear equations using Matlab
Low rank approximation and extremal gain problems

Introduction to Linear Algebra

2011-05-17T07:42:00.000-07:00

Introduction to Linear Algebra
Instructor: Sam Sengupta

Text: Schaum's outlines Linear Algebra, 3rd ed. by Lipshutz and Lipson

Click here to download the files:-

Lecture Notes
1. Topic1 :  About Vectors
2. Topic2 :  About Matrices
3. Topic3 :  Solution of simultaneous equations
4. Topic4 :  Linear mappings
5. Topic5 :  Matrix inversion
6. Topic6 :  About Matlab & Matrices
7a. Topic7a :  Elements of Eigenvalueues/Eigenfunctions
7b. Topic7b :  Computational aspects of e-values/e-functions
7c. Topic7c :  Computational aspects of e-values/e-functions 2
7d. Topic7d :  SOR: Improved Gauss'-Seidel
8. Topic8 :  Least Square solutions
9. Topic9 :  Diagonalization: Eignevalues and Eigenvectors

Introduction to Information Technologies

2011-05-15T05:59:00.000-07:00

Introduction to Information Technologies

Course Description

Hardware and software technology for handling information; system architecture for single user, central and networked systems; telecommunications; human computer interface; storage systems; operating systems; applications software.

This course introduces the variety of contemporary information technologies involving computers, networks, and telecommunications that are commonly used to handle information flows, processing, and storage in typical organizations. Both hardware and software technologies are covered. Emphasis is on the uses of components as "black boxes": their external behavioural capabilities and use, rather than their internal construction. Assignments will involve issues of comparing, choosing among, and combining information technology components to solve particular information problems. Lab work will involve working on open-ended problems using standard applications and languages. Some programming will be required.

Topics include:

· Number systems - binary, hexadecimal, octal, decimal; conversions; twos complement; floating point, coding systems

· CPU architecture - ALU, control unit, registers, buses, instruction set, addressing modes

· Peripheral devices - CRTs, keyboards, magnetic and optical disks, printers, modems, pointing devices.

· Operating systems - Windows, DOS, unix, file systems

· Programming languages - Java

· Multi-media - audio, video, animation, file formats, authoring

· Networks - components, topologies, internet, world wide web

· Communications – serial, parallel, synchronous, asynchronous, protocols

Textbook

The following is the required textbook for the course:

The Architecture of Computer Hardware and Systems Software : An Information Technology Approach (2^nd ed.), by Irv Englander, published by John Wiley & Sons, 2000.

Lecture Notes (Power Point files)

· 0. What is a computer?

· 1. Number systems

· 2. Data formats

· 3. Representing integer data

· 4. Floating-point numbers

· 5. Little man computer (deleted)

· 6. The CPU and memory

· 7. Input/output

· 8. I/O buses and interfaces

· 9. Computer peripherals – I

· 10. Computer peripherals – II

· 11. Computer peripherals – III

Introduction to Epigenetics II / Epigenetics of human diseases and computational investigations

2011-05-15T05:51:00.000-07:00

Introduction to Epigenetics II / Epigenetics of human diseases and computational investigations

Lecturers: Mario Noyer Weidner/Christine Steinhoff

Click here to download the files:-

Syllabus

06.01.2008 Introduction; Databases
Slides (pdf)

12.01.2008 Highthroughput technologies, genomewide DNA methylation profiling
Slides (pdf)

13.01.2008 Exploratory analysis and Analysing multivariate genomic data
Slides (pdf)

19.01.2008 DNA methylation prediction
Slides 1 (pdf) Slides 2(pdf)

20.01.2008 Evolutionary aspects
Slides (pdf)

26.01.2008 Prediction of imprinted genes
Slides (ppt)

27.01.2008 Deamination followed by Substitution
Slides (pdf)

Introduction to Electronics

2011-05-15T05:48:00.000-07:00

Introduction to Electronics

Subject Description: This paper is concerned with basic electronic concepts. Topics covered include fundamental d.c. and a.c. circuits, boolean logic, digital circuits, analog-to-digital and digital-to-analog conversion, computer architecture, and solid state devices such as diodes and transistors.
Test: The test papers are now available to be collected from the SCMS School Secretary on the ground floor of G Block.
Breadboards: There are a number of breadboards still outstanding. These MUST be returned to the tutor.
Exam Tutorials: Three exam tutorials have been arranged to be held in G.1.15

Wednesday 22/6 10-11am Digital Electronics - Richard Nelson
Thursday 23/6 2-3pm Analogue Electronics - Howell Round
Friday 24/5 2-3pm General problems - Zhiwei Liu

Set 1 Number Systems ( powerpoint, pdf)
Set 2 Digital Logic ( powerpoint, pdf)
Set 3 Minimisation ( powerpoint, pdf )
Tutorial 1 Exercises ( postscript, pdf )
Set 4 Common Circuits ( powerpoint, pdf )
Set 5 Sequential Logic ( powerpoint, pdf )
Tutorial 2 Exercises ( postscript, pdf )
Set 6 Registers and Counters( 4 per page pdf, original powerpoint )
Set 7 State Transition Diagrams( 4 per page pdf, original powerpoint )
Tutorial 3 Exercises ( postscript, pdf )
Set 8 Digital to Analogue Conversion( 4 per page pdf, original powerpoint )
Set 9 Analogue to Digital Conversion( 4 per page pdf, original powerpoint )

No tutorial this week due to the test.

Set 10 Digital Devices( 4 per page pdf, original powerpoint )
Set 11 Memories and Microprocessors( 4 per page pdf, original powerpoint )

ARSTechnica

RAM Guide

Toms Hardware

RAM Guide

Tutorial 4 Exercises ( postscript, pdf )
Tutorial 5 Exercises ( postscript, pdf )

Quiz 5 will be held Wednesday June 8.

Set 12 Hardware Description Languages( 4 per page pdf, original powerpoint )
Extra Tutorial Exercises ( postscript, pdf )
Introduction to Electronics, Signals, and Measurement
As taught in: Spring 2006
Level:
Undergraduate
Instructors:
Prof. Manos Chaniotakis
Prof. David Cory
Prof. Manos Chaniotakis
(Lecturer)
Prof. Ian Hutchinson
(Lecturer)
Course Features
Course Highlights
Course Description
Technical Requirements
Transistors and resistors on an old program memory module (ROM) of a Nixdorf 820 system. (Image courtesy of Hermann Schneider.)

Course Features
Lecture notes
Assignments (no solutions)
Exams (no solutions)

Course Highlights

This course features an extensive set of lecture notes and laboratory assignments. Review notes and practice exams are also available in the examssection.

Course Description

The course is designed to provide a practical - hands on - introduction to electronics with a focus on measurement and signals. The prerequisites are courses in differential equations, as well as electricity and magnetism. No prior experience with electronics is necessary. The course will integrate demonstrations and laboratory examples with lectures on the foundations. Throughout the course we will use modern "virtual instruments" as test-beds for understanding electronics. The aim of the course is to provide students with the practical knowledge necessary to work in a modern science or engineering setting.

Lecture Notes

LEC #	TOPICS
1	Introduction; Transducers (PDF)
2	Signals and Systems; Time and Frequency Domain (PDF - 1.3 MB)
3	Fourier Transform and Fourier Series (PDF - 1.3 MB)
4	Sampling and Aliasing; Numbering System (PDF - 1.3 MB)
5	KVL and KCL Analysis (PDF)
6	KVL and KCL Analysis (cont.); Nodal Mesh Analysis (PDF)
7	Superposition Method; Thevenin Circuits; Circuits (PDF)
8	Norton Equivalent Circuits (PDF)
9	Dependent Sources (PDF)
10	Quiz 1
11	Dependent Sources (cont.) (PDF)
12	Capacitors and Inductors (PDF)
13	Impedance Method (PDF)
14	Sinusoidal Steady State; Differential Equation Method (PDF)
15	Sinusoidal Steady State with Impedance Method (PDF)
16	Frequency Response; Filters (PDF)
17	Frequency Response (cont.); Filters and Q Factor (PDF)
18	Transient Response of Circuits; First Order and RL Circuits (PDF)
19	Quiz 2
20	Transient Response of First Order Circuits (PDF)
21	Transient Response of Second Order Circuits (PDF)
22	Circuits with Non-linear Elements; Diode (PDF)
23	Design and Analysis of Diode Circuits (PDF)
24	BJT (PDF)
25	BJT (cont.) (PDF)
26	BJT (cont.) (PDF)
27	Quiz 3
28	Op Amp (PDF)
29	Op Amp (cont.); Fundamental Amplifier Circuits; Input/Output Impedance (PDF)
30	Op Amp (cont.); Active Filters; Superdiode, Log, Antilog Filters (PDF)
31	Control Fundamentals
32	Control
33	Op Amp (cont.); Positive Feedback; Schmitt Trigger (PDF)
34-36	Design and Build a Heart Rate Monitor
37	Digital Circuits (PDF)
38	Digital Circuits (cont.) (PDF)

Introduction to Computers and Engineering Problem Solving

2011-05-15T05:43:00.000-07:00

Introduction to Computers and Engineering Problem Solving

Level:

Undergraduate

Instructors:

Prof. Judson Harward

Prof. Steven Lerman

Course Features

Course Highlights

Course Description

Technical Requirements

Course Features

Faculty introduction - video
Lecture notes
Assignments and solutions
Exams and Solutions

Course Highlights

This courses features lecture notes with sample code and a set of Java® tutorials in the study materials section.

Course Description

This course teaches fundamental software development and computational methods for engineering, scientific and managerial applications. Emphasis is focused on object-oriented software design and development. Assignments cover programming concepts, graphical user interfaces, numerical methods, data structures, sorting and searching, computer graphics and selected advanced topics. The Java® programming language is used.

Lectures / Active Learning Sessions

There are three sessions every week for 1.5 hours each. Many of the sessions will be Active Learning sessions (see calendar for details). Attendance is mandatory at Active Learning sessions. Please bring your laptop and wireless ethernet card to Active Learning sessions. We recommend that you bring your laptop to regular lectures as well.

Text

The textbook for the course is: Horstmann, Cay S. Big Java®. 2nd ed. New York, NY: John Wiley & Sons, 2005. ISBN: 0471697036. It is recommended, not required.

Tutorials

Each student will be assigned to a tutorial section which will be held each week on either Monday or Tuesday. Sections will have 10-12 students and will last for one hour. Attendance is mandatory. Please bring your laptop and wireless card to your tutorial. You should sign up for a tutorial section. Details on signing up for the tutorial section will be provided in class.

Lecture Notes

Special software is required to use some of the files in this section: .zip, .java, and .class.

The following table contains lecture notes and sample code to supplement the session content.

SES #	TOPICS	LECTURE NOTES	SAMPLE CODE
1	Introduction	(PDF)	(ZIP) (The ZIP file contains: 2 .class files and 2 .java files.)
2	Data Types, Variables, Operators, Control Structures	(PDF)	(ZIP) (The ZIP file contains: 6 .java files.)
3	Lab: IDE	(PDF)	(ZIP) (The ZIP file contains: 2 .java files.)
4	Control Structures (cont.)	(PDF)	(ZIP) (The ZIP file contains: 1 .jpg file and 7 .java files.)
5	Classes	(PDF)	(ZIP) (The ZIP file contains: 5 .java files.)
6	Lab: Classes	(PDF)	Java Files (ZIP) (The ZIP file contains: 3 .java files.) Solution (ZIP) (The ZIP file contains: 6 .java files.)
7	Methods	(PDF)	(ZIP) (The ZIP file contains: 8 .java files.)
8	Arrays, Vectors	(PDF)	(ZIP) (The ZIP file contains: 7 .java files.)
9	Lab: Static Members	(PDF)	(ZIP) (The ZIP file contains: 1 .pdf and 2 .java files.)
10	Lab: Recursion	(PDF)	Java Files (ZIP) (The ZIP file contains: 5 .java files.) Solution (ZIP) (The ZIP file contains: 2 .java files.)
11	Scope, Access, Packages	(PDF)	(ZIP) (The ZIP file contains: 4 .java files.)
12	Inheritance	(PDF)	(ZIP) (The ZIP file contains: 6 .java files.)
13	Lab: Interfaces, Inner Classes	(PDF)	(ZIP) (The ZIP file contains: 4 .zip files, 1 .project file, 1 .nbattrs file, 11 .java files, 1 .classpath file and 9 .class files.)
14	Introduction to Swing	(PDF)	(ZIP) (The ZIP file contains: 7 .java files.)
15	Swing Components	(PDF)	(ZIP) (The ZIP file contains: 10 .java files.)
16	Lab: Event Delegation	(PDF)	Java Files (ZIP) (The ZIP file contains: 7 .java files.) Solution (ZIP) (The ZIP file contains: 4 .java files.)
17	Lab: 2D API	(PDF)	Java Files (ZIP) (The ZIP file contains: 6 .java files.) Solution (ZIP) (The ZIP file contains: 2 .java files.)
18	Lab: Swing 2D Transformations	(PDF)	(ZIP) (The ZIP file contains: 1 .jar and 3 .java files.)
19	Lab: Root Finding	(PDF)	(ZIP) (The ZIP file contains: 1 .jpg and 19 .java files.)
20	Integration, Differential Equations	(PDF)	(ZIP) (The ZIP file contains: 4 .java files.)
21	Matrix Methods	(PDF)	(ZIP) (The ZIP file contains: 3 .java files.)
22	Lab: Linear Systems	(PDF)	Java Files (ZIP) (The ZIP file contains: 12 .java files.) Solution (ZIP) (The ZIP file contains: 5 .java files.) Lecture 22 Code (ZIP) (The ZIP file contains: 4 .java files.) Lecture 22 Solution (ZIP) (The ZIP file contains: 1 .java file.)
23	Lab: Stacks and Queues	(PDF)	Java Files (ZIP) (The ZIP file contains: 12 .java files.) Solution (ZIP) (The ZIP file contains: 5 .java files.)
24	Case Study: Postfix Calculator	(PDF)	(ZIP) (The ZIP file contains: 7 .java files.)
25	Lab: Exceptions and Inner Classes	(PDF)	Java Files (ZIP) (The ZIP file contains: 5 .java files.) Solution (ZIP) (The ZIP file contains: 3 .java files.)
26	Lab: Linked Lists	(PDF)	Java Files (ZIP) (The ZIP file contains: 8 .java files.) Solution (ZIP) (The ZIP file contains: 8 .java files.)
27	Lab: Trees	(PDF)	(ZIP) (The ZIP file contains: 2 .jar files and 2 .java files.)
28	Binary Search Trees	(PDF)	(ZIP) (The ZIP file contains: 7 .java files.)
29	Streams	(PDF)	(ZIP) (The ZIP file contains: 6 .java files.)
30	Lab: Streams	(PDF)	(ZIP) (The ZIP file contains: 2 .java files.) (ZIP) (The ZIP file contains: 2 .java files.)
31	Hashing	(PDF)	(ZIP - 1.3 MB) (The ZIP file contains: 1 .txt file, 1 .jar file and 9 .java files.)
32	Collections Framework	(PDF)
33	Lab: Sorting Algorithms	(PDF)	Sorting (ZIP) (The ZIP file contains: 4 .jar files.) Sorting SRC (ZIP) (The ZIP file contains: 49 .java files.) Insertion Sort (ZIP) (The ZIP file contains: 2 .java files.)
34	Threads	(PDF)	(ZIP) (The ZIP file contains: 5 .java files.)
35	Lab: Threads	(PDF)	Java Files (ZIP) (The ZIP file contains: 2 .java files.) Solution (ZIP) (The ZIP file contains: 2 .java files.)
37	Network Programming	(PDF)	Java Files (ZIP) (The ZIP file contains: 10 .java files.) Solution (ZIP) (The ZIP file contains: 3 .java files.) Other Files (ZIP) (The ZIP file contains: 1 .jpg file and 1 .html file.)

Introduction to Computer and Programming Techniques

2011-05-15T05:40:00.000-07:00

Introduction to Computer and Programming Techniques

Introduction to Computer and Programming Techniques notes ppt ( lectures slides ). It is a collection of lectures notes not ours. Plese Click bellow to download the ppt slides / pdf notes . If you face any problem in downloading then give your suggetion as comment . I will must consider your comment. Thank you very much for visit our site

Download powerpoint Slides
Chapter 1 Introduction
Chapter 2 Program Development and Flowchart
Chapter 3 Fundamentals of C Part I
Chapter 4 Fundamentals of C Part II
Chapter 5 Selections
Chapter 6 Iterations
Chapter 7 Arrays
Chapter 8 Pointers and Strings
Chapter 9 Functions

Introduction to Computer Science and Programming

2011-05-15T05:38:00.000-07:00

Introduction to Computer Science and Programming

Many of the problem sets focus on specific topics, such as word games, presidential campaigns, and analysis of protein sequences. (Boggle photograph, lower right, is courtesy of Angelinawb on Flickr.)

Course Highlights

This course features a complete collection of assignments and a set of onlinereadings.

Course Description

This subject is aimed at students with little or no programming experience. It aims to provide students with an understanding of the role computation can play in solving problems. It also aims to help students, regardless of their major, to feel justifiably confident of their ability to write small programs that allow them to accomplish useful goals. The class will use the Python™ programming language.

Technical Requirements

Special software is required to use some of the files in this course: .py.

Click Below to Download the files :-

LEC #	TOPICS
1	Introduction, stored program computers, flow of control, Python
2	Variables, statements, conditionals, iteration, exhaustive search (PDF)
3	Iteration, strings, printing
4	Functions, recursion, call stacks (PDF)
5	Guess and check, approximate solutions, successive approximation (PDF)
6	Lists and mutability, dictionaries (PDF)
7	Pseudo code, program organization (PDF)
8	Time complexity, divide and conquer, binary search, merge sort (PDF)
9	Divide and conquer, merge sort, exceptions (PDF)
10	Knapsack problems, branch and bound (PDF)
11	Optimization, random walks, simulation (PDF)
12	Monte Carlo simulation, calculating pi (PDF)
13	Pylab, plotting, curve fitting (PDF)
14	Classes and object-oriented programming (PDF)
15	Abstract data types, invariants (PDF)
16	Data abstraction, invariants (PDF)
17	Debugging
18	Curve fitting, probability (PDF)
19	Debugging (cont.) (PDF)
20	Stock simulation (PDF)
21	Stock simulation (cont.) (PDF)
22	Trends in computer science research
23	Review

Introduction to Computer Science

2011-05-15T05:36:00.000-07:00

UCR CS 10: Introduction to Computer Science I

Overview

In CS 010, you'll become familiar with the basic concepts underlying computer programming, and learn to apply those principles using a powerful and widely used programming language, C++. You should learn to solve basic problems by designing non-trivial programs. And you will learn to work with others (the computing field is, contrary to some beliefs, a very social discipline).

Catalog description :CS 010. Introduction to Computer Science for Science, Mathematics, and Engineering I (4) Lecture, 3 hours; laboratory, 3 hours. Prerequisite(s): MATH 009A (may be taken concurrently). Solving problems through structured programming of algorithms on computers, using the C++ object-oriented language. Topics include variables, expressions, input/output (I/O), branches, loops, functions, parameters, arrays, strings, file I/O, and classes. Also covers software design, testing, and debugging.

Basic information

Instructor :Sections 001 and 002: Kris Miller (kmiller@cs.ucr.edu).
Office hours:

MF 11am - 12pm
or by appt.

Office: Surge Bldg. 341.
Lecture:Section 001: MWF 2:10pm-3:00pm HMNSS 1503
Section 002: MWF 4:10pm-5:00pm HMNSS 1503
Teaching Assistants:Office hours held in Surge Bldg. 282.

Lab section 021: Mon 6:10 - 9:00pm Surge Bldg. 171 - Matt Fast (mfast@cs.ucr.edu) (Office Hours: M 5pm - 6pm)

Lab section 022: Tue 11:10 - 2:00pm Surge Bldg. 170 - Teddy Matinde (tmatinde@cs.ucr.edu) (Office Hours: W 1pm - 2pm)

Lab section 023: Tue 2:10 - 5:00pm Surge Bldg. 170 - Yonghui Wu (yonghui@cs.ucr.edu)(Office Hours: T 5pm - 6pm)

Lab section 024: Wed 8:10 - 11:00am Surge Bldg. 170 - Eric Cheung (chuncheung@cs.ucr.edu) (Office Hours: W 11am - 12pm)

Lab section 025: Tue 6:10 - 9:00pm Surge Bldg. 171 - Jorge Mena (jmena@cs.ucr.edu) (Office Hours: F 10am - 11am)
Textbook:Big C++, by Cay Horstmann and Timothy Budd, John Wiley & Sons, Inc.
ISBN: 0-471-47063-5
Course Email List:CS 10 mailing list (send mail now or access the archive)
ALL course related information/announcements will be conveyed to you via email. Most students will be automatically subscribed to this mailing list when enrolled in the course. However, it is up to you to ensure that you are in fact subscribed (you can go to the links above to check the subscription list). All communications from the CS department will be to your cs (or other ucr) email account, and all communications from you to the department must also originate from the same account. Make sure you make this your primary account, or at least have it forward all mail to your primary account.
NOTE: Mail sent to this mailing list will be received by all students in the class. It is considered cheating to give assignment source code to another student, so do NOT post assignment source code to this list.
Course grading:The course consists of 100 points:

Practice items (20 points) -- Designed to help you learn and to do well on the assessment items.
- 5 pts: In-class exercises (Turned in each day, but only 10 will be evaluated as satisfactory or unsatisfactory - 0.5pts each)
- 5 pts: CodeLab Homework (10 - 15 exercises per week worth approx. 0.5 pts per week)
- 10 pts: In-lab exercises (10 worth 1 pt each)
Assessment items (80 points) -- Mainly to determine whether you are learning, and to also help you learn by studying. Graded as usual.
- 15 pts: Midterm
- 20 pts: Final
- 10 pts: Quizzes (best 5 scores worth 2 pts each)
- 15 pts: Programming assignments (8 worth approx. 2 pts each)
- 20 pts: In-lab practical exams (4 worth 5 pts each)

Grades will be assigned using a conventional grading scale: 100-90 A, 89-80 B, 79-70 C, 69-60 D, 59-0 F. +/- grades will be given. Students are NOT competing against one another, but rather against the scale -- all students can get good grades if all do well. We may adjust ("curve") an individual assessment item if such adjusting HELPS the class.

Lecture schedule

Subject to change as the quarter progresses.
Read the book before lecture! Reading ahead is one of the most effective ways of doing better in class -- you'll be amazed how much more useful the lectures will be. We'll follow the book closely.

The Chapter references are to the class text book "Big C++" by Cay Horstmann and Timothy Budd.

Week 1: Mar. 28 - Apr. 1
Course intro, Intro to computers and C++ (Ch 1 slides) (Ch 1 slideshow)
Fundamental Data Types (Ch 2 slides) (Ch 2 slideshow)
In-lab 1
Homework 1 DUE: Wed, Apr. 6 by 2pm
Programming Assignment 1 DUE: Fri, Apr. 8 before 2pm
Week 2: Apr. 4 - Apr. 8
(Ch 2 cont.)
In-lab 2
Quiz 1(Wed, Apr. 6)
Homework 2 DUE: Wed, Apr. 13
Programming Assignment 2 DUE: Fri, Apr. 15 before 2pm
Week 3: Apr. 11 - Apr. 15
Objects (Ch 3) (Ch 3 slides) (Ch 3 slideshow)
In-lab 3
Quiz 2 (Lec 001) (Lec 002) (Wed, Apr. 13)
Homework 3 DUE: Wed, Apr. 20
Programming Assignment 3 DUE: Fri, Apr. 22 before 2pm
Week 4: Apr. 18 - Apr. 22
Basic Control Flow (Ch 4) (Ch 4 slides) (Ch 4 slideshow)
In-lab 4 & Practical 1
Quiz 3(Wed, Apr. 20)
Homework 4 DUE: Wed, Apr. 27
Week 5: Apr. 25 - Apr. 29
(Ch 4 cont)
Review
In-lab 5 & Practical 2
Homework 5 DUE: Wed, May 4
Programming Assignment 4 DUE: Fri, May 6 before 2pm
Midterm(Fri, Apr. 29)
Week 6: May 2 - May 6
(Ch 4 cont - loops)
Functions (Ch 5) (Ch 5 slides) (Ch 5 slideshow)
In-lab 6
Homework 6 DUE: Wed, May 11
Programming Assignment 5 DUE: Fri, May 13 before 2pm
Week 7: May 9 - May 13
(Ch 5 cont.)
In-lab 7 & Practical 3
Quiz 4(Wed, May 11)
Homework 7 DUE: Wed, May 18
Programming Assignment 6 DUE: Fri, May 20 before 2pm
Week 8: May 16 - May 20
Advanced Control Flow (Ch 7) (Ch 7 slides) (Ch 7 slideshow)
In-lab 8
Quiz 5(Wed, May 18)
Homework 8 DUE: Wed, May 25
Programming Assignment 7 DUE: Fri, May 27 before 2pm
Week 9: May 23 - May 27
(Ch 7 cont.)
Vectors (Ch 9) (Ch 9 slides) (Ch 9 slideshow)
In-lab 9 & Practical 4
Quiz 6 (Lec 001) (Lec 002) (Wed, May 25)
Homework 9 DUE: Wed, Jun. 1
Programming Assignment 8 DUE: Fri, Jun. 3 before 2pm
Week 10: May 30 - Jun. 3 (Monday Holiday)
(Ch 9 cont)
Software design, testing and debugging
Review
In-lab 10
Quiz 7(Wed, Jun. 1)
Homework 10 DUE: Sun, Jun. 5 before 9pm
Fall '04 Final (solution DOC) (solution HTML)

In-Lecture Exercise Solutions

In-Lecture Solutions

Introduction to Computer Programming pdf slide

2011-05-15T05:34:00.000-07:00

Introduction to Computer Programming pdf slide

taught by Dr. Ken Williams

Computer Science department of North Carolina A&T State University

This is an introductory course in computer programming. Problem solving techniques and writing algorithms will be stressed. Students will write programs for such tasks as engineering decision-making and numerical computation. This course is intended for Computer Science, Computer Engineering and Management Information Systems majors or other students who intend to take further programming courses.
Text Book :
Introduction to Java Programming, comprehensive version, 6^th edition, by Y. Daniel Liang, Pearson Prentice Hall, 2007, ISBN: 0132221586.

Class Notes
Introduction to computers and programming

Java Basics

Expressions

if statements

more on if statements

Writing simple programs

Loops

More on loops

Methods

Translating to Java

Classes

More on classes

Reference variables

Modifiers

Classes and Methods

Still more on classes

Inheritance

Dynamic binding

Implementing interfaces

Introduction to GUIs

More on GUIs

Introduction to Compilers ppt

2011-05-15T05:31:00.001-07:00

Introduction to Compilers ppt

Introduction to compilers notes ( lectures slides ). It is a collection of lectures notes not our. Plese Click bellow to download. If you face any problem in downloading then give your suggetion as comment . I will must consider your comment. Thank you very much for visit our site

Slides
Chapter 1 Introduction
Chapter 2 Scanners
Chapter 3 Context-free Grammar
Chapter 4 Parsers
Chapter 5 Semantic Analyzers
Chapter 6 Code Generators
Chapter 7 Run-time Environment

This Lectures Covered Following Textbooks:-
1. Louden, Compiler Construction: Principle and Practice, Course Technology, 1997.
2. Aho, Lam, Sethi & Ullman, Compilers: Principles, Techniques and Tools, Addison-Wesley, 2006.

SES #	TOPICS
1	Variables, operators, types (PDF)
2	More types, methods, conditionals (PDF)
3	Loops, arrays (PDF)
4	Classes, objects (PDF)
5	Packages, containers, using objects (PDF)
6	Object-oriented programming, inheritance, abstract classes and interfaces (PDF)
7	Good programming skills, collections, exceptions (PDF)
8	Java I/O, testing and debugging (PDF)

06.01.2008	Introduction; Databases Slides (pdf)
12.01.2008	Highthroughput technologies, genomewide DNA methylation profiling Slides (pdf)
13.01.2008	Exploratory analysis and Analysing multivariate genomic data Slides (pdf)
19.01.2008	DNA methylation prediction Slides 1 (pdf) Slides 2(pdf)
20.01.2008	Evolutionary aspects Slides (pdf)
26.01.2008	Prediction of imprinted genes Slides (ppt)
27.01.2008	Deamination followed by Substitution Slides (pdf)

Lecture Notes For All

All Subjects Notes Are Placed In Alphabetical Order

Introductory flow cytometry lectures

Introductory Digital Systems Laboratory

Introductory Digital Systems Laboratory

Course Highlights

Course Description

Special Features

Technical Requirements

Lecture Notes

Introduction to Web Design

Your First Web Page

Adding CSS

Introduction to Binary

Internet Addressing

Learning About Linux

Color and Images

Learning Emacs

XHTML Images, Links, and Lists

Layout with CSS

Tables

Managing CSS

Multimedia

Introduction to VLSI Design

Introduction to Software Engineering in Java

Introduction to Software Engineering in Java

Course Description

Technical Requirements

Lecture Notes

An Introduction to Queueing Systems

Introduction to Probability and Statistics

Level:

Instructors:

Course Features

Course Description

Lecture Notes

Introduction to Probability and Statistics

Introduction to Neural Networks

Introduction to Modern Cryptography Notes

Introduction to Modern Cryptography Notes

Introduction to Meteorolog

Introduction to MATLAB Notes PDF

Introduction to MATLAB Notes PDF

Course Highlights

Course Description

Technical Requirements

Lecture Notes

Introduction to Material Science

Introduction to Linear Dynamical Systems

Introduction to Linear Dynamical Systems

Prerequisites

Description

Lecture Slides

Lecture Videos

Support Notes

Introduction to Linear Algebra

Introduction to Information Technologies

Introduction to Information Technologies

Introduction to Epigenetics II / Epigenetics of human diseases and computational investigations

Introduction to Epigenetics II / Epigenetics of human diseases and computational investigations

Syllabus

Introduction to Electronics

Introduction to Electronics

Introduction to Electronics, Signals, and Measurement

As taught in: Spring 2006

Level:

Instructors:

Course Features

Course Highlights

Course Description

Lecture Notes

Introduction to Computers and Engineering Problem Solving

Introduction to Computers and Engineering Problem Solving

Level:

Instructors:

Course Features

Course Highlights

Course Description

Lectures / Active Learning Sessions

Text